Lines Matching defs:least
1485 assert( fall_in_cnt, "at least 1 fall-in path" );
2106 // True if the method has at least 1 irreducible loop
2367 // instance-of/check-cast pattern requires at least 2 rounds of
3507 Node *least = legal; // Best legal position so far
3516 // Find least loop nesting depth
3519 if( get_loop(legal)->_nest < get_loop(least)->_nest )
3520 least = legal;
3526 if (least != early) {
3527 Node* ctrl_out = least->unique_ctrl_out();
3529 least == ctrl_out->in(LoopNode::EntryControl)) {
3530 Node* least_dom = idom(least);
3531 if (get_loop(least_dom)->is_member(get_loop(least))) {
3532 least = least_dom;
3548 if( legal == v_ctrl ) least = legal; // Keep prior if found
3553 least = find_non_split_ctrl(least);
3554 set_ctrl(n, least);
3557 IdealLoopTree *chosen_loop = get_loop(least);