Lines Matching defs:n2
115 Node *n2 = cin;
118 n2 = idom(n2);
120 dom_depth(n2) < c_d)
122 if (n2 == early || // Walked cin up to early
2022 Node* n2 = C->expensive_node(k);
2023 if (is_node_unreachable(n2)) {
2027 assert(n1 != n2, "should be pair of nodes");
2030 Node* c2 = n2->in(0);
2048 _igvn._worklist.push(n2);
2071 if (n2->in(0) != c2) {
2072 _igvn.hash_delete(n2);
2073 n2->set_req(0, c2);
2074 _igvn.hash_insert(n2);
2075 _igvn._worklist.push(n2);
3116 Node *PhaseIdealLoop::dom_lca_internal( Node *n1, Node *n2 ) const {
3117 if( !n1 ) return n2; // Handle NULL original LCA
3119 assert( n2->is_CFG(), "" );
3122 uint d2 = dom_depth(n2);
3123 while (n1 != n2) {
3128 n2 = idom(n2);
3129 d2 = dom_depth(n2);
3135 // Scan up all the n1's with equal depth, looking for n2.
3138 if (t1 == n2) return n2;
3141 // Scan up all the n2's with equal depth, looking for n1.
3142 Node *t2 = idom(n2);
3149 n2 = t2;
3151 d2 = dom_depth(n2);
3294 Node *PhaseIdealLoop::dom_lca_for_get_late_ctrl_internal( Node *n1, Node *n2, Node *tag ) {
3296 uint d2 = dom_depth(n2);
3300 // current lca is deeper than n2
3305 // n2 is deeper than current lca
3306 Node *memo = _dom_lca_tags[n2->_idx];
3310 _dom_lca_tags.map(n2->_idx, tag);
3311 n2 = idom(n2);
3312 d2 = dom_depth(n2);
3318 // Scan up all the n1's with equal depth, looking for n2.
3322 if (t1 == n2) return n2;
3326 // Scan up all the n2's with equal depth, looking for n1.
3327 _dom_lca_tags.map(n2->_idx, tag);
3328 Node *t2 = idom(n2);
3336 n2 = t2;
3338 d2 = dom_depth(n2);
3340 } while (n1 != n2);