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

Lines Matching defs:LCA
3115 // Pair-wise LCA
3117   if( !n1 ) return n2;          // Handle NULL original LCA
3120   // find LCA of all uses
3162   Node *LCA = NULL;
3165       LCA = dom_lca( LCA, region->in(i) );
3167   return LCA;
3170 bool PhaseIdealLoop::verify_dominance(Node* n, Node* use, Node* LCA, Node* early) {
3174     // Make sure that there's a dominance path from use to LCA
3176     while (d != LCA) {
3193   // Compute LCA over list of uses
3195   Node *LCA = NULL;
3196   for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax && LCA != early; i++) {
3205           LCA = dom_lca_for_get_late_ctrl( LCA, use, n );
3206           if (verify) had_error = verify_dominance(n, use, LCA, early) || had_error;
3212       LCA = dom_lca_for_get_late_ctrl( LCA, use, n );
3213       if (verify) had_error = verify_dominance(n, use, LCA, early) || had_error;
3217   return LCA;
3225   Node* LCA = compute_lca_of_uses(n, early);
3227   if (LCA == C->root() && LCA != early) {
3239   if (n->is_Load() && LCA != early) {
3247     while(worklist.size() != 0 && LCA != early) {
3260           LCA = dom_lca_for_get_late_ctrl(LCA, sctrl, n);
3266   assert(LCA == find_non_split_ctrl(LCA), "unexpected late control");
3267   return LCA;
3285 // Pair-wise LCA with tags.
3289 // been considered in the current LCA (which is input 'n1' by convention).
3308         return n1;    // Return the current LCA
3492   Node *LCA = get_late_ctrl( n, early );
3493   // LCA is NULL due to uses being dead
3494   if( LCA == NULL ) {
3504   assert(LCA != NULL && !LCA->is_top(), "no dead nodes");
3506   Node *legal = LCA;            // Walk 'legal' up the IDOM chain
3512       dump_bad_graph("Bad graph detected in build_loop_late", n, early, LCA);
3542     Node *legal = LCA;
3563 void PhaseIdealLoop::dump_bad_graph(const char* msg, Node* n, Node* early, Node* LCA) {
3596   tty->print("LCA(n): "); LCA->dump();
3634   Node *dbg_legal = LCA;