vm/opto/matcher.cpp

117   debug_only(_mem_node = NULL;)   // Ideal memory node consumed by mach node
314   // to avoid false sharing if the corresponding mach node is not used.
315   // The corresponding mach node is only used in rare cases for derived
361       // Generate new mach node for ConP #NULL
1647   MachNode *mach = s->MachNodeGenerator(rule);
1648   guarantee(mach != NULL, "Missing MachNode");
1649   mach->_opnds[0] = s->MachOperGenerator(_reduceOp[rule]);
1650   assert( mach->_opnds[0] != NULL, "Missing result operand" );
1657     mach->add_req( leaf->in(0) ); // Set initial control
1659     ReduceInst_Interior( s, rule, mem, mach, 1 );
1662     mach->add_req(0);             // Set initial control to none
1663     ReduceInst_Chain_Rule( s, rule, mem, mach );
1668     mach->ins_req(MemNode::Memory,mem);
1671     const MachOper* oper = mach->memory_operand();
1681       const Type* mach_at = mach->adr_type();
1695         tty->print_cr("mach:");
1696         mach->dump(1);
1705     mach->ins_req(AddPNode::Base,leaf->in(AddPNode::Base));
1711   MachNode *ex = mach->Expand(s, _projection_list, mem);
1712   if (ex != mach) {
1713     assert(ex->ideal_reg() == mach->ideal_reg(), "ideal types should match");
1717     for( uint i=0; i<mach->req(); i++ ) {
1718       mach->set_req(i,NULL);
1732     guarantee(ex == mach, "no expand rules during spill generation");
1744 void Matcher::handle_precedence_edges(Node* n, MachNode *mach) {
1747       mach->add_prec(n->in(i));
1752 void Matcher::ReduceInst_Chain_Rule( State *s, int rule, Node *&mem, MachNode *mach ) {
1769     mach->_opnds[1] = s->MachOperGenerator(opnd_class_instance);
1771     ReduceOper( s, newrule, mem, mach );
1775     mach->_opnds[1] = s->MachOperGenerator(_reduceOp[catch_op]);
1778     mach->add_req( ReduceInst(s, newrule, mem1) );
1785 uint Matcher::ReduceInst_Interior( State *s, int rule, Node *&mem, MachNode *mach, uint num_opnds ) {
1786   handle_precedence_edges(s->_leaf, mach);
1795     if( mach->in(0) == NULL )
1796       mach->set_req(0, s->_leaf->in(0));
1822       mach->_opnds[num_opnds++] = newstate->MachOperGenerator(opnd_class_instance);
1823       ReduceOper( newstate, newrule, mem, mach );
1829         num_opnds = ReduceInst_Interior( newstate, newrule, mem, mach, num_opnds );
1833         mach->_opnds[num_opnds++] = s->MachOperGenerator(_reduceOp[catch_op]);
1836         mach->add_req( ReduceInst( newstate, newrule, mem1 ) );
1840     assert( mach->_opnds[num_opnds-1], "" );
1854 void Matcher::ReduceOper( State *s, int rule, Node *&mem, MachNode *mach ) {
1861     mach->add_req( s->_leaf );  // Add leaf pointer
1871   handle_precedence_edges(s->_leaf, mach);
1874     if( !mach->in(0) )
1875       mach->set_req(0,s->_leaf->in(0));
1877       assert( s->_leaf->in(0) == mach->in(0), "same instruction, differing controls?" );
1890       ReduceOper( kid, newrule, mem, mach );
1897       mach->add_req( ReduceInst( kid, newrule, mem1 ) );
2429         // Unpin the mach node and mark it.