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

Lines Matching defs:n1
114       Node *n1 = early;
117         n1 = idom(n1);          // Walk up until break cycle
119         if (n1 == cin ||        // Walked early up to cin
123             dom_depth(n1) < c_d) {
1012   Node* n1 = expr;
1013   int   n1op = n1->Opcode();
1015   // Try to strip (n1 & M) or (n1 << N >> N) from n1.
1017       n1->in(2)->is_Con() &&
1018       n1->in(2)->bottom_type()->is_int()->get_con() == 0x7fff) {
1020     t1 = n1;
1021     n1 = t1->in(1);
1022     n1op = n1->Opcode();
1025              n1->in(1) != NULL &&
1026              n1->in(1)->Opcode() == Op_LShiftI &&
1027              n1->in(2) == n1->in(1)->in(2) &&
1028              n1->in(2)->is_Con()) {
1029     jint shift = n1->in(2)->bottom_type()->is_int()->get_con();
1032       t1 = n1;
1034       n1 = t2->in(1);
1035       n1op = n1->Opcode();
1049     return n1;
2017       Node* n1 = C->expensive_node(j);
2018       if (is_node_unreachable(n1)) {
2027         assert(n1 != n2, "should be pair of nodes");
2029         Node* c1 = n1->in(0);
2047           _igvn._worklist.push(n1);
2064         if (n1->in(0) != c1) {
2065           _igvn.hash_delete(n1);
2066           n1->set_req(0, c1);
2067           _igvn.hash_insert(n1);
2068           _igvn._worklist.push(n1);
3116 Node *PhaseIdealLoop::dom_lca_internal( Node *n1, Node *n2 ) const {
3117   if( !n1 ) return n2;          // Handle NULL original LCA
3118   assert( n1->is_CFG(), "" );
3121   uint d1 = dom_depth(n1);
3123   while (n1 != n2) {
3125       n1 =      idom(n1);
3126       d1 = dom_depth(n1);
3135       // Scan up all the n1's with equal depth, looking for n2.
3136       Node *t1 = idom(n1);
3141       // Scan up all the n2's with equal depth, looking for n1.
3144         if (t2 == n1)  return n1;
3148       n1 = t1;
3150       d1 = dom_depth(n1);
3154   return n1;
3289 // been considered in the current LCA (which is input 'n1' by convention).
3294 Node *PhaseIdealLoop::dom_lca_for_get_late_ctrl_internal( Node *n1, Node *n2, Node *tag ) {
3295   uint d1 = dom_depth(n1);
3301       _dom_lca_tags.map(n1->_idx, tag);
3302       n1 =      idom(n1);
3303       d1 = dom_depth(n1);
3308         return n1;    // Return the current LCA
3318       // Scan up all the n1's with equal depth, looking for n2.
3319       _dom_lca_tags.map(n1->_idx, tag);
3320       Node *t1 = idom(n1);
3326       // Scan up all the n2's with equal depth, looking for n1.
3330         if (t2 == n1)  return n1;
3335       n1 = t1;
3337       d1 = dom_depth(n1);
3340   } while (n1 != n2);
3341   return n1;