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

Lines Matching refs:mem
818   Node *mem = ret->in(TypeFunc::Memory);
825   MachNode *spillCP = match_tree(new (C) LoadNNode(NULL,mem,fp,atp,TypeInstPtr::BOTTOM));
827   MachNode *spillI  = match_tree(new (C) LoadINode(NULL,mem,fp,atp));
828   MachNode *spillL  = match_tree(new (C) LoadLNode(NULL,mem,fp,atp));
829   MachNode *spillF  = match_tree(new (C) LoadFNode(NULL,mem,fp,atp));
830   MachNode *spillD  = match_tree(new (C) LoadDNode(NULL,mem,fp,atp));
831   MachNode *spillP  = match_tree(new (C) LoadPNode(NULL,mem,fp,atp,TypeInstPtr::BOTTOM));
848     MachNode *spillVectS = match_tree(new (C) LoadVectorNode(NULL,mem,fp,atp,TypeVect::VECTS));
852     MachNode *spillVectD = match_tree(new (C) LoadVectorNode(NULL,mem,fp,atp,TypeVect::VECTD));
856     MachNode *spillVectX = match_tree(new (C) LoadVectorNode(NULL,mem,fp,atp,TypeVect::VECTX));
860     MachNode *spillVectY = match_tree(new (C) LoadVectorNode(NULL,mem,fp,atp,TypeVect::VECTY));
1352   Node *mem = n->is_Store() ? n->in(MemNode::Memory) : (Node*)1 ;
1364   Label_Root( n, s, n->in(0), mem );
1386   MachNode *m = ReduceInst( s, s->_rule[mincost], mem );
1395   if( mem != (Node*)1 ) start = MemNode::Memory+1;
1397     assert( mem == (Node*)1, "" );
1478 Node *Matcher::Label_Root( const Node *n, State *svec, Node *control, const Node *mem){
1528         ((mem!=(Node*)1) && m->is_Load() && m->in(MemNode::Memory) != mem) ||
1535         && !((mem!=(Node*)1) && m->is_Load() && m->in(MemNode::Memory) != mem) ) {
1548       control = Label_Root(m,s,control,mem);
1629 MachNode *Matcher::ReduceInst( State *s, int rule, Node *&mem ) {
1649     ReduceInst_Interior( s, rule, mem, mach, 1 );
1653     ReduceInst_Chain_Rule( s, rule, mem, mach );
1657   if( mem != (Node*)1 ) {
1658     mach->ins_req(MemNode::Memory,mem);
1663       // It has a unique memory operand.  Find corresponding ideal mem node.
1700   MachNode *ex = mach->Expand(s,_proj_list, mem);
1733 void Matcher::ReduceInst_Chain_Rule( State *s, int rule, Node *&mem, MachNode *mach ) {
1752     ReduceOper( s, newrule, mem, mach );
1766 uint Matcher::ReduceInst_Interior( State *s, int rule, Node *&mem, MachNode *mach, uint num_opnds ) {
1769     assert( mem == (Node*)1 || mem == mem2, "multiple Memories being matched at once?" );
1770     debug_only( if( mem == (Node*)1 ) _mem_node = s->_leaf;)
1771     mem = mem2;
1802       ReduceOper( newstate, newrule, mem, mach );
1808         num_opnds = ReduceInst_Interior( newstate, newrule, mem, mach, num_opnds );
1833 void Matcher::ReduceOper( State *s, int rule, Node *&mem, MachNode *mach ) {
1845     assert( mem == (Node*)1, "multiple Memories being matched at once?" );
1846     mem = s->_leaf->in(MemNode::Memory);
1866       ReduceOper( kid, newrule, mem, mach );
2310   const MemBarNode *mem = (const MemBarNode*)vmb;
2314   DUIterator_Fast imax, i = mem->fast_outs(imax);
2316     ctrl = mem->fast_out(i);            // Throw out-of-bounds if proj not found