Lines Matching refs:Loop
1 //===- LoopPass.cpp - Loop Pass and Loop Pass Manager ---------------------===//
10 // This file implements LoopPass and LPPassManager. All loop optimization
23 #define DEBUG_TYPE "loop-pass-manager"
27 /// PrintLoopPass - Print a Function corresponding to a Loop.
43 bool runOnLoop(Loop *L, LPPassManager &) override {
45 for (Loop::block_iterator b = L->block_begin(), be = L->block_end();
74 /// Delete loop from the loop queue and loop hierarchy (LoopInfo).
75 void LPPassManager::deleteLoopFromQueue(Loop *L) {
79 // If L is current loop then skip rest of the passes and let
90 for (std::deque<Loop *>::iterator I = LQ.begin(),
99 // Inset loop into loop nest (LoopInfo) and loop queue (LQ).
100 void LPPassManager::insertLoop(Loop *L, Loop *ParentLoop) {
104 // Insert into loop nest
113 void LPPassManager::insertLoopIntoQueue(Loop *L) {
114 // Insert L into loop queue
118 // This is top level loop.
121 // Insert L after the parent loop.
122 for (std::deque<Loop *>::iterator I = LQ.begin(),
134 // Reoptimize this loop. LPPassManager will re-insert this loop into the
135 // queue. This allows LoopPass to change loop nest for the loop. This
137 void LPPassManager::redoLoop(Loop *L) {
143 /// all loop passes.
145 BasicBlock *To, Loop *L) {
153 void LPPassManager::deleteSimpleAnalysisValue(Value *V, Loop *L) {
169 static void addLoopIntoQueue(Loop *L, std::deque<Loop *> &LQ) {
171 for (Loop::reverse_iterator I = L->rbegin(), E = L->rend(); I != E; ++I)
192 // Populate the loop queue in reverse program order. There is no clear need to
194 // advantage in deleting uses in a later loop before optimizing the
195 // definitions in an earlier loop. If we find a clear reason to process in
208 for (std::deque<Loop *>::const_iterator I = LQ.begin(), E = LQ.end();
210 Loop *L = *I;
224 // Run all passes on the current Loop.
248 // Manually check that this loop is still healthy. This is done
251 // loop in the function every time. That level of checking can be
252 // enabled with the -verify-loop-info option.
272 // Do not run other passes on this loop.
276 // If the loop was deleted, release all the loop passes. This frees up
285 // Pop the loop from queue after running all passes.
303 errs().indent(Offset*2) << "Loop Pass Manager\n";
353 // Create new Loop Pass Manager if it does not exist.
354 assert (!PMS.empty() && "Unable to create Loop Pass Manager");
357 // [1] Create new Loop Pass Manager
379 bool LoopPass::skipOptnoneFunction(const Loop *L) const {
385 // FIXME: Delete loop from pass manager's queue?
