|
LLVM
3.7.0
|
#include "llvm/ADT/DepthFirstIterator.h"#include "llvm/ADT/PostOrderIterator.h"#include "llvm/ADT/STLExtras.h"#include "llvm/Analysis/LoopInfo.h"#include "llvm/IR/Dominators.h"Go to the source code of this file.
Classes | |
| class | llvm::PopulateLoopsDFS< BlockT, LoopT > |
| Populate all loop data in a stable order during a single forward DFS. More... | |
Namespaces | |
| llvm | |
| Compute iterated dominance frontiers using a linear time algorithm. | |
Functions | |
| template<class BlockT , class LoopT > | |
| static void | llvm::discoverAndMapSubloop (LoopT *L, ArrayRef< BlockT * > Backedges, LoopInfoBase< BlockT, LoopT > *LI, DominatorTreeBase< BlockT > &DomTree) |
| Stable LoopInfo Analysis - Build a loop tree using stable iterators so the result does / not depend on use list (block predecessor) order. More... | |
1.8.6