|
LLVM
4.0.0
|
#include "llvm/ADT/DenseMapInfo.h"#include "llvm/ADT/GraphTraits.h"#include "llvm/ADT/SmallPtrSet.h"#include "llvm/IR/CFG.h"#include "llvm/IR/PassManager.h"#include "llvm/Pass.h"#include "llvm/Support/GenericDomTree.h"Go to the source code of this file.
Classes | |
| class | llvm::BasicBlockEdge |
| struct | llvm::DenseMapInfo< BasicBlockEdge > |
| class | llvm::DominatorTree |
| Concrete subclass of DominatorTreeBase that is used to compute a normal dominator tree. More... | |
| struct | llvm::DomTreeGraphTraitsBase< Node, ChildIterator > |
| struct | llvm::GraphTraits< DomTreeNode * > |
| struct | llvm::GraphTraits< const DomTreeNode * > |
| struct | llvm::GraphTraits< DominatorTree * > |
| class | llvm::DominatorTreeAnalysis |
Analysis pass which computes a DominatorTree. More... | |
| class | llvm::DominatorTreePrinterPass |
Printer pass for the DominatorTree. More... | |
| struct | llvm::DominatorTreeVerifierPass |
Verifier pass for the DominatorTree. More... | |
| class | llvm::DominatorTreeWrapperPass |
Legacy analysis pass which computes a DominatorTree. More... | |
Namespaces | |
| llvm | |
| Compute iterated dominance frontiers using a linear time algorithm. | |
Typedefs | |
| typedef DomTreeNodeBase < BasicBlock > | llvm::DomTreeNode |
Functions | |
| template void | llvm::Calculate< Function, BasicBlock * > (DominatorTreeBaseByGraphTraits< GraphTraits< BasicBlock * >> &DT, Function &F) |
| template void | llvm::Calculate< Function, Inverse< BasicBlock * > > (DominatorTreeBaseByGraphTraits< GraphTraits< Inverse< BasicBlock * >>> &DT, Function &F) |
1.8.6