vm/opto/matcher.cpp

845   Node *mem = ret->in(TypeFunc::Memory);
852   MachNode *spillCP = match_tree(new LoadNNode(NULL,mem,fp,atp,TypeInstPtr::BOTTOM,MemNode::unordered));
854   MachNode *spillI  = match_tree(new LoadINode(NULL,mem,fp,atp,TypeInt::INT,MemNode::unordered));
855   MachNode *spillL  = match_tree(new LoadLNode(NULL,mem,fp,atp,TypeLong::LONG,MemNode::unordered, LoadNode::DependsOnlyOnTest, false));
856   MachNode *spillF  = match_tree(new LoadFNode(NULL,mem,fp,atp,Type::FLOAT,MemNode::unordered));
857   MachNode *spillD  = match_tree(new LoadDNode(NULL,mem,fp,atp,Type::DOUBLE,MemNode::unordered));
858   MachNode *spillP  = match_tree(new LoadPNode(NULL,mem,fp,atp,TypeInstPtr::BOTTOM,MemNode::unordered));
874     MachNode *spillVectS = match_tree(new LoadVectorNode(NULL,mem,fp,atp,TypeVect::VECTS));
878     MachNode *spillVectD = match_tree(new LoadVectorNode(NULL,mem,fp,atp,TypeVect::VECTD));
882     MachNode *spillVectX = match_tree(new LoadVectorNode(NULL,mem,fp,atp,TypeVect::VECTX));
886     MachNode *spillVectY = match_tree(new LoadVectorNode(NULL,mem,fp,atp,TypeVect::VECTY));
890     MachNode *spillVectZ = match_tree(new LoadVectorNode(NULL,mem,fp,atp,TypeVect::VECTZ));
1362   Node *mem = n->is_Store() ? n->in(MemNode::Memory) : (Node*)1 ;
1374   Label_Root( n, s, n->in(0), mem );
1396   MachNode *m = ReduceInst( s, s->_rule[mincost], mem );
1405   if( mem != (Node*)1 ) start = MemNode::Memory+1;
1407     assert( mem == (Node*)1, "" );
1489 Node *Matcher::Label_Root( const Node *n, State *svec, Node *control, const Node *mem){
1539         ((mem!=(Node*)1) && m->is_Load() && m->in(MemNode::Memory) != mem) ||
1545         && !((mem!=(Node*)1) && m->is_Load() && m->in(MemNode::Memory) != mem)) {
1557       control = Label_Root(m,s,control,mem);
1638 MachNode *Matcher::ReduceInst( State *s, int rule, Node *&mem ) {
1659     ReduceInst_Interior( s, rule, mem, mach, 1 );
1663     ReduceInst_Chain_Rule( s, rule, mem, mach );
1667   if( mem != (Node*)1 ) {
1668     mach->ins_req(MemNode::Memory,mem);
1673       // It has a unique memory operand.  Find corresponding ideal mem node.
1711   MachNode *ex = mach->Expand(s, _projection_list, mem);
1752 void Matcher::ReduceInst_Chain_Rule( State *s, int rule, Node *&mem, MachNode *mach ) {
1771     ReduceOper( s, newrule, mem, mach );
1785 uint Matcher::ReduceInst_Interior( State *s, int rule, Node *&mem, MachNode *mach, uint num_opnds ) {
1790     assert( mem == (Node*)1 || mem == mem2, "multiple Memories being matched at once?" );
1791     debug_only( if( mem == (Node*)1 ) _mem_node = s->_leaf;)
1792     mem = mem2;
1823       ReduceOper( newstate, newrule, mem, mach );
1829         num_opnds = ReduceInst_Interior( newstate, newrule, mem, mach, num_opnds );
1854 void Matcher::ReduceOper( State *s, int rule, Node *&mem, MachNode *mach ) {
1866     assert( mem == (Node*)1, "multiple Memories being matched at once?" );
1867     mem = s->_leaf->in(MemNode::Memory);
1890       ReduceOper( kid, newrule, mem, mach );