Lines Matching refs:Matcher
62 const RegMask *Matcher::idealreg2regmask[_last_machine_leaf];
63 RegMask Matcher::mreg2regmask[_last_Mach_Reg];
64 RegMask Matcher::STACK_ONLY_mask;
65 RegMask Matcher::c_frame_ptr_mask;
66 const uint Matcher::_begin_rematerialize = _BEGIN_REMATERIALIZE;
67 const uint Matcher::_end_rematerialize = _END_REMATERIALIZE;
69 //---------------------------Matcher-------------------------------------------
70 Matcher::Matcher( Node_List &proj_list ) :
131 OptoReg::Name Matcher::warp_incoming_stk_arg( VMReg reg ) {
152 return OptoReg::stack2reg(round_to(fixed + preserve, Matcher::stack_alignment_in_slots()));
158 void Matcher::verify_new_nodes_only(Node* xroot) {
183 void Matcher::match( ) {
354 Matcher::soft_match_failure(); // recursive matching process failed
430 void Matcher::init_first_stack_mask() {
504 if (Matcher::vector_size_supported(T_BYTE,4)) {
508 if (Matcher::vector_size_supported(T_FLOAT,2)) {
512 if (Matcher::vector_size_supported(T_FLOAT,4)) {
518 if (Matcher::vector_size_supported(T_FLOAT,8)) {
601 bool Matcher::is_save_on_entry( int reg ) {
610 void Matcher::Fixup_Save_On_Entry( ) {
789 void Matcher::init_spill_mask( Node *ret ) {
846 if (Matcher::vector_size_supported(T_BYTE,4)) {
851 if (Matcher::vector_size_supported(T_FLOAT,2)) {
855 if (Matcher::vector_size_supported(T_FLOAT,4)) {
859 if (Matcher::vector_size_supported(T_FLOAT,8)) {
929 tty->print_cr("==== Matcher alias shift %d => %d", nidx, midx);
980 Node *Matcher::transform( Node *n ) { ShouldNotCallThis(); return n; }
981 Node *Matcher::xform( Node *n, int max_stack ) {
999 if (!is_dontcare(n)) { // Matcher can match this guy
1004 if (m == NULL) { Matcher::soft_match_failure(); return NULL; }
1107 OptoReg::Name Matcher::warp_outgoing_stk_arg( VMReg reg, OptoReg::Name begin_out_arg_area, OptoReg::Name &out_arg_limit_per_call ) {
1133 MachNode *Matcher::match_sfpt( SafePointNode *sfpt ) {
1150 if( m == NULL ) { Matcher::soft_match_failure(); return NULL; }
1341 MachNode *Matcher::match_tree( const Node *n ) {
1382 Matcher::soft_match_failure();
1392 // Add any Matcher-ignored edges
1454 if (m->is_DecodeN() && Matcher::narrow_oop_use_complex_address()) {
1469 // things the Matcher does not match (e.g., Memory), and things with different
1473 // The Matcher works on Trees, but an Intel add-to-memory requires a DAG: the
1475 // pointers). Since the Matcher does not have anything for Memory (and
1478 Node *Matcher::Label_Root( const Node *n, State *svec, Node *control, const Node *mem){
1577 MachNode* Matcher::find_shared_node(Node* leaf, uint rule) {
1629 MachNode *Matcher::ReduceInst( State *s, int rule, Node *&mem ) {
1733 void Matcher::ReduceInst_Chain_Rule( State *s, int rule, Node *&mem, MachNode *mach ) {
1766 uint Matcher::ReduceInst_Interior( State *s, int rule, Node *&mem, MachNode *mach, uint num_opnds ) {
1833 void Matcher::ReduceOper( State *s, int rule, Node *&mem, MachNode *mach ) {
1886 OptoReg::Name Matcher::find_receiver( bool is_outgoing ) {
1902 void Matcher::find_shared( Node *n ) {
1943 // with matching cmp/branch in 1 instruction. The Matcher needs the
2083 // Allow Matcher to match the rule which bypass
2118 // prevent the Matcher from trying to Match the Cmp along both paths
2197 void Matcher::dump_old2new_map() {
2207 void Matcher::collect_null_checks( Node *proj, Node *orig_proj ) {
2238 !Matcher::narrow_oop_use_complex_address()) {
2271 void Matcher::validate_null_checks( ) {
2284 // it was unpinned in Matcher::collect_null_checks().
2306 bool Matcher::post_store_load_barrier(const Node *vmb) {