Lines Matching refs:at
290 // the middle of the loop and I am looking at some trailing control-flow
416 if (bt == BoolTest::eq || // Bail out, but this loop trips at most twice!
766 // Fix all data nodes placed at the old loop head.
1069 // phi( , ) -- at top of loop type is [min_int..10)
1367 // Loop starts at 2 because slot 1 is the fall-in path
1453 *cp = ilt->_next; // Hang next list at end of child list
1485 assert( fall_in_cnt, "at least 1 fall-in path" );
1547 // Allpaths backwards scan from loop tail, terminating each path at first safepoint
1640 bool has_local_ncsfpt = false; // ncsfpt on dom-path at this loop depth
1641 Node* nonlocal_ncsfpt = NULL; // ncsfpt on dom-path at a deeper depth
1659 // If at an inner loop tail, see if the inner loop has already
1703 if (sfpt == sfpts->at(i))
1813 Node* n = sfpts->at(i);
1836 Node* n = sfpts->at(i);
2036 // expensive nodes up but stops at loops that are in a if
2106 // True if the method has at least 1 irreducible loop
2119 // Do not need a safepoint at the top level
2367 // instance-of/check-cast pattern requires at least 2 rounds of
2390 // Convert scalar to superword operations at the end of all loop opts.
2602 Node *n = _body.at(i);
2606 if( loop->_body.at(j) == n )
2620 Node *n = loop->_body.at(i2);
2624 if( _body.at(j) == n )
2709 // Insert at start of list
2750 // insert an IdealLoopTree at the target of the backedge.
2754 // where control flow can choose to change loop nests. It is at this
2757 // Note that there may not be any backedges at the decision point!
2760 // order my loops at the time I discover them. Thus at the decision point
2870 // at most 1 level.
3508 while( early != legal ) { // While not at earliest legal
3543 while( early != legal ) { // While not at earliest legal