Lines Matching refs:Loop
38 // Can delete self loop.
42 // Loop through all of our successors and make sure they know that one
135 // Can't merge if there is PHI loop.
282 /// the loop info is updated.
291 // The new block lives in whichever loop the old one did. This preserves
294 if (Loop *L = LI->getLoopFor(Old))
324 // The rest of the logic is only relevant for updating the loop structures.
328 Loop *L = LI->getLoopFor(OldBB);
330 // If we need to preserve loop analyses, collect some information about how
338 // If we need to preserve LCSSA, determine if any of the preds is a loop
341 if (Loop *PL = LI->getLoopFor(Pred))
346 // an interesting loop boundary.
355 // Unless we have a loop for OldBB, nothing else to do here.
360 // Add the new block to the nearest enclosing loop (and not an adjacent
361 // loop). To find this, examine each of the predecessors and determine which
362 // loops enclose them, and select the most-nested loop which contains the
363 // loop containing the block being split.
364 Loop *InnermostPredLoop = nullptr;
368 if (Loop *PredLoop = LI->getLoopFor(Pred)) {
369 // Seek a loop which actually contains the block being split (to avoid
423 // NOTE! This loop walks backwards for a reason! First off, this minimizes
431 // Add an incoming value to the PHI node in the loop for the preheader
443 // NOTE! This loop walks backwards for a reason! First off, this minimizes
472 /// of the edges being split is an exit of a loop with other exits).
542 /// case where one of the edges being split is an exit of a loop with other
