Lines Matching refs:Loop
1 //===- LoopPass.cpp - Loop Pass and Loop Pass Manager ---------------------===//
10 // This file implements LoopPass and LPPassManager. All loop optimization
24 /// PrintLoopPass - Print a Function corresponding to a Loop.
40 bool runOnLoop(Loop *L, LPPassManager &) {
42 for (Loop::block_iterator b = L->block_begin(), be = L->block_end();
68 /// Delete loop from the loop queue and loop hierarchy (LoopInfo).
69 void LPPassManager::deleteLoopFromQueue(Loop *L) {
73 // If L is current loop then skip rest of the passes and let
84 for (std::deque<Loop *>::iterator I = LQ.begin(),
93 // Inset loop into loop nest (LoopInfo) and loop queue (LQ).
94 void LPPassManager::insertLoop(Loop *L, Loop *ParentLoop) {
98 // Insert into loop nest
107 void LPPassManager::insertLoopIntoQueue(Loop *L) {
108 // Insert L into loop queue
112 // This is top level loop.
115 // Insert L after the parent loop.
116 for (std::deque<Loop *>::iterator I = LQ.begin(),
128 // Reoptimize this loop. LPPassManager will re-insert this loop into the
129 // queue. This allows LoopPass to change loop nest for the loop. This
131 void LPPassManager::redoLoop(Loop *L) {
137 /// all loop passes.
139 BasicBlock *To, Loop *L) {
147 void LPPassManager::deleteSimpleAnalysisValue(Value *V, Loop *L) {
163 static void addLoopIntoQueue(Loop *L, std::deque<Loop *> &LQ) {
165 for (Loop::reverse_iterator I = L->rbegin(), E = L->rend(); I != E; ++I)
186 // Populate the loop queue in reverse program order. There is no clear need to
188 // advantage in deleting uses in a later loop before optimizing the
189 // definitions in an earlier loop. If we find a clear reason to process in
198 for (std::deque<Loop *>::const_iterator I = LQ.begin(), E = LQ.end();
200 Loop *L = *I;
214 // Run all passes on the current Loop.
238 // Manually check that this loop is still healthy. This is done
241 // loop in the function every time. That level of checking can be
242 // enabled with the -verify-loop-info option.
260 // Do not run other passes on this loop.
264 // If the loop was deleted, release all the loop passes. This frees up
273 // Pop the loop from queue after running all passes.
291 errs().indent(Offset*2) << "Loop Pass Manager\n";
341 // Create new Loop Pass Manager if it does not exist.
342 assert (!PMS.empty() && "Unable to create Loop Pass Manager");
345 // [1] Create new Loop Pass Manager
