Lines Matching defs:innermost
2517 Loop* innermost = NULL; // merge of loop tree branches over all successors
2530 // succ->loop will be updated to innermost loop on a later call, when blk==succ
2565 innermost = innermost == NULL ? lp : innermost->sorted_merge(lp);
2569 if (innermost == NULL) {
2572 } else if (innermost->head() == blk) {
2574 if (blk->loop() != innermost) {
2576 assert(blk->loop()->head() == innermost->head(), "same head");
2578 for (dl = innermost; dl != NULL && dl != blk->loop(); dl = dl->parent());
2579 assert(dl == blk->loop(), "blk->loop() already in innermost list");
2581 blk->set_loop(innermost);
2583 innermost->def_locals()->add(blk->def_locals());
2584 Loop* l = innermost;
2594 blk->set_loop(innermost);
2595 innermost->def_locals()->add(blk->def_locals());