Lines Matching defs:legal
86 // Compute earliest legal control
132 // Return earliest legal location
144 // Move node up the dominator tree as high as legal while still beneficial
238 // Set earliest legal control
242 // Record earliest legal location
2217 // _nodes array holds the earliest legal controlling CFG node.
2231 // Given early legal placement, try finding counted loops. This placement
3036 // case, it is legal (and expected) to change what loop a Node
3097 // Record earliest legal location
3221 // Compute latest legal control.
3375 // Second pass finds latest legal placement, and ideal loop placement.
3430 // Second pass finds latest legal placement, and ideal loop placement.
3506 Node *legal = LCA; // Walk 'legal' up the IDOM chain
3507 Node *least = legal; // Best legal position so far
3508 while( early != legal ) { // While not at earliest legal
3510 if (legal->is_Start() && !early->is_Root()) {
3517 legal = idom(legal); // Bump up the IDOM tree
3519 if( get_loop(legal)->_nest < get_loop(least)->_nest )
3520 least = legal;
3522 assert(early == legal || legal != C->root(), "bad dominance of inputs");
3538 // If verifying, verify that 'verify_me' has a legal location
3542 Node *legal = LCA;
3543 while( early != legal ) { // While not at earliest legal
3544 if( legal == v_ctrl ) break; // Check for prior good location
3545 legal = idom(legal) ;// Bump up the IDOM tree
3548 if( legal == v_ctrl ) least = legal; // Keep prior if found