Lines Matching defs:Matcher

47 const RegMask *Matcher::idealreg2regmask[_last_machine_leaf];
48 RegMask Matcher::mreg2regmask[_last_Mach_Reg];
49 RegMask Matcher::STACK_ONLY_mask;
50 RegMask Matcher::c_frame_ptr_mask;
51 const uint Matcher::_begin_rematerialize = _BEGIN_REMATERIALIZE;
52 const uint Matcher::_end_rematerialize = _END_REMATERIALIZE;
54 //---------------------------Matcher-------------------------------------------
55 Matcher::Matcher()
122 OptoReg::Name Matcher::warp_incoming_stk_arg( VMReg reg ) {
143 return OptoReg::stack2reg(align_up(fixed + preserve, (int)Matcher::stack_alignment_in_slots()));
149 void Matcher::verify_new_nodes_only(Node* xroot) {
174 void Matcher::match( ) {
345 Matcher::soft_match_failure(); // recursive matching process failed
421 void Matcher::init_first_stack_mask() {
496 if (Matcher::vector_size_supported(T_BYTE,4)) {
500 if (Matcher::vector_size_supported(T_FLOAT,2)) {
506 if (Matcher::vector_size_supported(T_FLOAT,4)) {
524 if (Matcher::vector_size_supported(T_FLOAT,8)) {
536 if (Matcher::vector_size_supported(T_FLOAT,16)) {
625 bool Matcher::is_save_on_entry( int reg ) {
634 void Matcher::Fixup_Save_On_Entry( ) {
816 void Matcher::init_spill_mask( Node *ret ) {
872 if (Matcher::vector_size_supported(T_BYTE,4)) {
877 if (Matcher::vector_size_supported(T_FLOAT,2)) {
881 if (Matcher::vector_size_supported(T_FLOAT,4)) {
885 if (Matcher::vector_size_supported(T_FLOAT,8)) {
889 if (Matcher::vector_size_supported(T_FLOAT,16)) {
963 tty->print_cr("==== Matcher alias shift %d => %d", nidx, midx);
976 Node *Matcher::transform( Node *n ) { ShouldNotCallThis(); return n; }
977 Node *Matcher::xform( Node *n, int max_stack ) {
996 if (!is_dontcare(n)) { // Matcher can match this guy
1001 if (m == NULL) { Matcher::soft_match_failure(); return NULL; }
1113 OptoReg::Name Matcher::warp_outgoing_stk_arg( VMReg reg, OptoReg::Name begin_out_arg_area, OptoReg::Name &out_arg_limit_per_call ) {
1139 MachNode *Matcher::match_sfpt( SafePointNode *sfpt ) {
1156 if( m == NULL ) { Matcher::soft_match_failure(); return NULL; }
1351 MachNode *Matcher::match_tree( const Node *n ) {
1392 Matcher::soft_match_failure();
1402 // Add any Matcher-ignored edges
1464 if ((m->is_DecodeN() && Matcher::narrow_oop_use_complex_address()) ||
1465 (m->is_DecodeNKlass() && Matcher::narrow_klass_use_complex_address())) {
1480 // things the Matcher does not match (e.g., Memory), and things with different
1484 // The Matcher works on Trees, but an Intel add-to-memory requires a DAG: the
1486 // pointers). Since the Matcher does not have anything for Memory (and
1489 Node *Matcher::Label_Root( const Node *n, State *svec, Node *control, const Node *mem){
1586 MachNode* Matcher::find_shared_node(Node* leaf, uint rule) {
1638 MachNode *Matcher::ReduceInst( State *s, int rule, Node *&mem ) {
1744 void Matcher::handle_precedence_edges(Node* n, MachNode *mach) {
1752 void Matcher::ReduceInst_Chain_Rule( State *s, int rule, Node *&mem, MachNode *mach ) {
1785 uint Matcher::ReduceInst_Interior( State *s, int rule, Node *&mem, MachNode *mach, uint num_opnds ) {
1854 void Matcher::ReduceOper( State *s, int rule, Node *&mem, MachNode *mach ) {
1910 OptoReg::Name Matcher::find_receiver( bool is_outgoing ) {
2000 bool Matcher::is_bmi_pattern(Node *n, Node *m) {
2018 bool Matcher::clone_base_plus_offset_address(AddPNode* m, Matcher::MStack& mstack, VectorSet& address_visited) {
2037 void Matcher::find_shared( Node *n ) {
2078 // with matching cmp/branch in 1 instruction. The Matcher needs the
2224 // prevent the Matcher from trying to Match the Cmp along both paths
2339 void Matcher::dump_old2new_map() {
2349 void Matcher::collect_null_checks( Node *proj, Node *orig_proj ) {
2382 !Matcher::narrow_oop_use_complex_address()) {
2415 void Matcher::validate_null_checks( ) {
2428 // it was unpinned in Matcher::collect_null_checks().
2450 bool Matcher::post_store_load_barrier(const Node* vmb) {
2533 bool Matcher::branches_to_uncommon_trap(const Node *n) {