Lines Matching defs:next
163 Node *next = ctl;
173 next = idom(ctl->in(1)->in(0));
182 next = parent_ctl->as_CountedLoopEnd()->loopnode()->init_control();
188 next = idom(parent_ctl);
194 next = parent_ctl->in(0)->in(0)->in(0);
216 next = idom(parent_ctl);
219 next = idom(ctl);
221 if (next->is_Root() || next->is_Start() || dom_depth(next) < min_dom_depth) {
224 ctl = next;
451 // in cases like next (cyclic loops):
613 // Fall into next case
643 // Fall into next case
1380 // by being much hotter than the next hottest backedge.
1453 *cp = ilt->_next; // Hang next list at end of child list
1462 pilt = &ilt->_child; // Advance to next
1790 --i; // deleted this phi; rescan starting with next position
2274 // For example, peeling. Eliminate them before next loop optimizations.
2304 for (LoopTreeIterator iter(_ltree_root); !iter.done(); iter.next()) {
2394 for (LoopTreeIterator iter(_ltree_root); !iter.done(); iter.next()) {
2541 // Find proper sibling to be next
2663 // nodes as "no depth yet" marker. The next pass then runs up
2706 IdealLoopTree **pp = &innermost; // Pointer to previous next-pointer
2808 // On next iteration, check if additional children were added.
2957 // Am I a loop header? If so fix up my parent's child and next ptrs.
2963 l->_next = p->_child; // Put self on parents 'next child'
3020 // Get parent node and next input's index from stack's top.
3056 // Get next node from nstack:
3077 nstack.push(n, i); // Save parent node and next input's index.
3102 // Process next node on the worklist.
3105 // Get saved parent node and next input's index.
3400 nstack.push(n, i); // Save parent and next use's index.
3415 // Process next node on the worklist.
3418 // Get saved parent node and next use's index. Visit the rest of uses.
3743 // Advance to next loop tree using a preorder, left-to-right traversal.
3744 void LoopTreeIterator::next() {