#include "llvm/Pass.h"
#include "llvm/ADT/GraphTraits.h"
+#include "llvm/ADT/SmallVector.h"
namespace llvm {
-class ETForest;
+class DominatorTree;
class LoopInfo;
class PHINode;
class Instruction;
/// outside of the loop. These are the blocks _inside of the current loop_
/// which branch out. The returned list is always unique.
///
- void getExitingBlocks(std::vector<BasicBlock*> &Blocks) const;
+ void getExitingBlocks(SmallVectorImpl<BasicBlock *> &Blocks) const;
/// getExitBlocks - Return all of the successor blocks of this loop. These
/// are the blocks _outside of the current loop_ which are branched to.
///
- void getExitBlocks(std::vector<BasicBlock*> &Blocks) const;
+ void getExitBlocks(SmallVectorImpl<BasicBlock* > &Blocks) const;
/// getUniqueExitBlocks - Return all unique successor blocks of this loop.
/// These are the blocks _outside of the current loop_ which are branched to.
/// This assumes that loop is in canonical form.
///
- void getUniqueExitBlocks(std::vector<BasicBlock*> &ExitBlocks) const;
+ void getUniqueExitBlocks(SmallVectorImpl<BasicBlock*> &ExitBlocks) const;
/// getLoopPreheader - If there is a preheader for this loop, return it. A
/// loop has a preheader if there is only one edge to the header of the loop
/// the mapping in the LoopInfo class.
void removeBlockFromLoop(BasicBlock *BB);
+ /// verifyLoop - Verify loop structure
+ void verifyLoop() const;
+
void print(std::ostream &O, unsigned Depth = 0) const;
void print(std::ostream *O, unsigned Depth = 0) const {
if (O) print(*O, Depth);
std::vector<Loop*> TopLevelLoops;
friend class Loop;
public:
- static const char ID; // Pass identifcation, replacement for typeid
+ static char ID; // Pass identification, replacement for typeid
- LoopInfo() : FunctionPass((intptr_t)&ID) {}
+ LoopInfo() : FunctionPass(intptr_t(&ID)) {}
~LoopInfo() { releaseMemory(); }
/// iterator/begin/end - The interface to the top-level loops in the current
void removeBlock(BasicBlock *BB);
private:
- void Calculate(ETForest &EF);
- Loop *ConsiderForLoop(BasicBlock *BB, ETForest &EF);
+ void Calculate(DominatorTree &DT);
+ Loop *ConsiderForLoop(BasicBlock *BB, DominatorTree &DT);
void MoveSiblingLoopInto(Loop *NewChild, Loop *NewParent);
void InsertLoopInto(Loop *L, Loop *Parent);
};