Cross Reference: /openjdk7/hotspot/src/share/vm/opto/matcher.cpp

Lines Matching defs:mach
126   debug_only(_mem_node = NULL;)   // Ideal memory node consumed by mach node
323   // to avoid false sharing if the corresponding mach node is not used.
324   // The corresponding mach node is only used in rare cases for derived
370       // Generate new mach node for ConP #NULL
1638   MachNode *mach = s->MachNodeGenerator( rule, C );
1639   mach->_opnds[0] = s->MachOperGenerator( _reduceOp[rule], C );
1640   assert( mach->_opnds[0] != NULL, "Missing result operand" );
1647     mach->add_req( leaf->in(0) ); // Set initial control
1649     ReduceInst_Interior( s, rule, mem, mach, 1 );
1652     mach->add_req(0);             // Set initial control to none
1653     ReduceInst_Chain_Rule( s, rule, mem, mach );
1658     mach->ins_req(MemNode::Memory,mem);
1661     const MachOper* oper = mach->memory_operand();
1671       const Type* mach_at = mach->adr_type();
1685         tty->print_cr("mach:");
1686         mach->dump(1);
1695     mach->ins_req(AddPNode::Base,leaf->in(AddPNode::Base));
1700   MachNode *ex = mach->Expand(s,_proj_list, mem);
1701   if( ex != mach ) {
1702     assert(ex->ideal_reg() == mach->ideal_reg(), "ideal types should match");
1706     for( uint i=0; i<mach->req(); i++ ) {
1707       mach->set_req(i,NULL);
1721     guarantee(ex == mach, "no expand rules during spill generation");
1733 void Matcher::ReduceInst_Chain_Rule( State *s, int rule, Node *&mem, MachNode *mach ) {
1750     mach->_opnds[1] = s->MachOperGenerator( opnd_class_instance, C );
1752     ReduceOper( s, newrule, mem, mach );
1756     mach->_opnds[1] = s->MachOperGenerator( _reduceOp[catch_op], C );
1759     mach->add_req( ReduceInst(s, newrule, mem1) );
1766 uint Matcher::ReduceInst_Interior( State *s, int rule, Node *&mem, MachNode *mach, uint num_opnds ) {
1774     if( mach->in(0) == NULL )
1775       mach->set_req(0, s->_leaf->in(0));
1801       mach->_opnds[num_opnds++] = newstate->MachOperGenerator( opnd_class_instance, C );
1802       ReduceOper( newstate, newrule, mem, mach );
1808         num_opnds = ReduceInst_Interior( newstate, newrule, mem, mach, num_opnds );
1812         mach->_opnds[num_opnds++] = s->MachOperGenerator( _reduceOp[catch_op], C );
1815         mach->add_req( ReduceInst( newstate, newrule, mem1 ) );
1819     assert( mach->_opnds[num_opnds-1], "" );
1833 void Matcher::ReduceOper( State *s, int rule, Node *&mem, MachNode *mach ) {
1840     mach->add_req( s->_leaf );  // Add leaf pointer
1850     if( !mach->in(0) )
1851       mach->set_req(0,s->_leaf->in(0));
1853       assert( s->_leaf->in(0) == mach->in(0), "same instruction, differing controls?" );
1866       ReduceOper( kid, newrule, mem, mach );
1873       mach->add_req( ReduceInst( kid, newrule, mem1 ) );
2285         // Unpin the mach node and mark it.