Lines Matching defs:up
143 // Fix up _idx to meet asserts.
648 // Trimming to limit allows a uint8 to handle up to 255 edges.
671 // Trimming to limit allows a uint8 to handle up to 255 edges.
1106 // Walk 'sub' backward up the chain to 'dom', watching for regions.
1107 // After seeing 'dom', continue up to Root or Start.
1111 // will either exit through the loop head, or give up.
1123 // Region nodes were visited. Continue walk up to Start or Root
1132 // (This assumption is up to the caller to ensure!)
1135 Node* up = sub->in(0);
1137 up = sub->find_exact_control(up);
1138 // If sub == up, we found a self-loop. Try to push past it.
1139 if (sub == up && sub->is_Loop()) {
1140 // Take loop entry path on the way up to 'dom'.
1141 up = sub->in(1); // in(LoopNode::EntryControl);
1142 } else if (sub == up && sub->is_Region() && sub->req() != 3) {
1143 // Always take in(1) path on the way up to 'dom' for clone regions
1146 up = sub->in(1);
1147 } else if (sub == up && sub->is_Region()) {
1157 // and worked our way up again to the loop header 'sub'.
1158 // So, take the first unexplored path on the way up to 'dom'.
1165 // Visited 2 paths, but still stuck in loop body. Give up.
1178 assert(up == sub, "");
1184 up = in;
1195 if (up == sub) {
1198 if (up == orig_sub && met_dom) {
1205 sub = up;