1 //===- LoopPass.cpp - Loop Pass and Loop Pass Manager ---------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by Devang Patel and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements LoopPass and LPPassManager. All loop optimization
11 // and transformation passes are derived from LoopPass. LPPassManager is
12 // responsible for managing LoopPasses.
14 //===----------------------------------------------------------------------===//
16 #include "llvm/Analysis/LoopPass.h"
20 //===----------------------------------------------------------------------===//
25 // Compare Two loops based on their depth in loop nest.
28 bool operator()( Loop *L1, Loop *L2) const {
29 return L1->getLoopDepth() > L2->getLoopDepth();
33 // Loop queue used by Loop Pass Manager. This is a wrapper class
34 // that hides implemenation detail (use of priority_queue) inside .cpp file.
37 inline void push(Loop *L) { LPQ.push(L); }
38 inline void pop() { LPQ.pop(); }
39 inline Loop *top() { return LPQ.top(); }
40 inline bool empty() { return LPQ.empty(); }
42 std::priority_queue<Loop *, std::vector<Loop *>, LoopCompare> LPQ;
45 } // End of LLVM namespace
47 //===----------------------------------------------------------------------===//
50 /// LPPassManager manages FPPassManagers and CalLGraphSCCPasses.
52 LPPassManager::LPPassManager(int Depth) : PMDataManager(Depth) {
56 LPPassManager::~LPPassManager() {
60 // Recurse through all subloops and all loops into LQ.
61 static void addLoopIntoQueue(Loop *L, LoopQueue *LQ) {
62 for (Loop::iterator I = L->begin(), E = L->end(); I != E; ++I)
63 addLoopIntoQueue(*I, LQ);
67 /// run - Execute all of the passes scheduled for execution. Keep track of
68 /// whether any of the passes modifies the function, and if so, return true.
69 bool LPPassManager::runOnFunction(Function &F) {
70 LoopInfo &LI = getAnalysis<LoopInfo>();
73 // Populate Loop Queue
74 for (LoopInfo::iterator I = LI.begin(), E = LI.end(); I != E; ++I)
75 addLoopIntoQueue(*I, LQ);
77 std::string Msg1 = "Executing Pass '";
78 std::string Msg3 = "' Made Modification '";
81 while (!LQ->empty()) {
84 // Run all passes on current SCC
85 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
87 Pass *P = getContainedPass(Index);
88 AnalysisUsage AnUsage;
89 P->getAnalysisUsage(AnUsage);
91 std::string Msg2 = "' on Loop ...\n'";
92 dumpPassInfo(P, Msg1, Msg2);
93 dumpAnalysisSetInfo("Required", P, AnUsage.getRequiredSet());
95 initializeAnalysisImpl(P);
98 LoopPass *LP = dynamic_cast<LoopPass *>(P);
99 assert (LP && "Invalid LPPassManager member");
100 LP->runOnLoop(*L, *this);
104 dumpPassInfo(P, Msg3, Msg2);
105 dumpAnalysisSetInfo("Preserved", P, AnUsage.getPreservedSet());
107 removeNotPreservedAnalysis(P);
108 recordAvailableAnalysis(P);
109 removeDeadPasses(P, Msg2);
112 // Pop the loop from queue after running all passes.