#include "llvm/Analysis/LoopPass.h"
#include "llvm/IR/IRPrintingPasses.h"
#include "llvm/IR/LLVMContext.h"
+#include "llvm/IR/PassManager.h"
#include "llvm/Support/Debug.h"
#include "llvm/Support/Timer.h"
+#include "llvm/Support/raw_ostream.h"
using namespace llvm;
#define DEBUG_TYPE "loop-pass-manager"
/// PrintLoopPass - Print a Function corresponding to a Loop.
///
-class PrintLoopPass : public LoopPass {
-private:
- std::string Banner;
- raw_ostream &Out; // raw_ostream to print on.
+class PrintLoopPassWrapper : public LoopPass {
+ PrintLoopPass P;
public:
static char ID;
- PrintLoopPass(const std::string &B, raw_ostream &o)
- : LoopPass(ID), Banner(B), Out(o) {}
+ PrintLoopPassWrapper() : LoopPass(ID) {}
+ PrintLoopPassWrapper(raw_ostream &OS, const std::string &Banner)
+ : LoopPass(ID), P(OS, Banner) {}
void getAnalysisUsage(AnalysisUsage &AU) const override {
AU.setPreservesAll();
}
bool runOnLoop(Loop *L, LPPassManager &) override {
- Out << Banner;
- for (Loop::block_iterator b = L->block_begin(), be = L->block_end();
- b != be;
- ++b) {
- if (*b)
- (*b)->print(Out);
- else
- Out << "Printing <null> block";
- }
+ P.run(*L);
return false;
}
};
-char PrintLoopPass::ID = 0;
+char PrintLoopPassWrapper::ID = 0;
}
//===----------------------------------------------------------------------===//
LPPassManager::LPPassManager()
: FunctionPass(ID), PMDataManager() {
skipThisLoop = false;
- redoThisLoop = false;
LI = nullptr;
CurrentLoop = nullptr;
}
}
// Inset loop into loop nest (LoopInfo) and loop queue (LQ).
-void LPPassManager::insertLoop(Loop *L, Loop *ParentLoop) {
-
- assert (CurrentLoop != L && "Cannot insert CurrentLoop");
+Loop &LPPassManager::addLoop(Loop *ParentLoop) {
+ // Create a new loop. LI will take ownership.
+ Loop *L = new Loop();
- // Insert into loop nest
- if (ParentLoop)
- ParentLoop->addChildLoop(L);
- else
+ // Insert into the loop nest and the loop queue.
+ if (!ParentLoop) {
+ // This is the top level loop.
LI->addTopLevelLoop(L);
-
- insertLoopIntoQueue(L);
-}
-
-void LPPassManager::insertLoopIntoQueue(Loop *L) {
- // Insert L into loop queue
- if (L == CurrentLoop)
- redoLoop(L);
- else if (!L->getParentLoop())
- // This is top level loop.
LQ.push_front(L);
- else {
- // Insert L after the parent loop.
- for (std::deque<Loop *>::iterator I = LQ.begin(),
- E = LQ.end(); I != E; ++I) {
- if (*I == L->getParentLoop()) {
- // deque does not support insert after.
- ++I;
- LQ.insert(I, 1, L);
- break;
- }
- }
+ return *L;
}
-}
-// Reoptimize this loop. LPPassManager will re-insert this loop into the
-// queue. This allows LoopPass to change loop nest for the loop. This
-// utility may send LPPassManager into infinite loops so use caution.
-void LPPassManager::redoLoop(Loop *L) {
- assert (CurrentLoop == L && "Can redo only CurrentLoop");
- redoThisLoop = true;
+ ParentLoop->addChildLoop(L);
+ // Insert L into the loop queue after the parent loop.
+ for (auto I = LQ.begin(), E = LQ.end(); I != E; ++I) {
+ if (*I == L->getParentLoop()) {
+ // deque does not support insert after.
+ ++I;
+ LQ.insert(I, 1, L);
+ break;
+ }
+ }
+ return *L;
}
/// cloneBasicBlockSimpleAnalysis - Invoke cloneBasicBlockAnalysis hook for
CurrentLoop = LQ.back();
skipThisLoop = false;
- redoThisLoop = false;
// Run all passes on the current Loop.
for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
// Pop the loop from queue after running all passes.
LQ.pop_back();
-
- if (redoThisLoop)
- LQ.push_back(CurrentLoop);
}
// Finalization
Pass *LoopPass::createPrinterPass(raw_ostream &O,
const std::string &Banner) const {
- return new PrintLoopPass(Banner, O);
+ return new PrintLoopPassWrapper(O, Banner);
}
// Check if this pass is suitable for the current LPPassManager, if