Go to the source code of this file.
|
| | llvm |
| | Compute iterated dominance frontiers using a linear time algorithm.
|
| |
|
| template<class BlockT , class LoopT > |
| static void | llvm::discoverAndMapSubloop (LoopT *L, ArrayRef< BlockT * > Backedges, LoopInfoBase< BlockT, LoopT > *LI, const 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...
|
| |
| template<typename T > |
| bool | llvm::compareVectors (std::vector< T > &BB1, std::vector< T > &BB2) |
| |
| template<class BlockT , class LoopT > |
| static void | llvm::addInnerLoopsToHeadersMap (DenseMap< BlockT *, const LoopT * > &LoopHeaders, const LoopInfoBase< BlockT, LoopT > &LI, const LoopT &L) |
| |