|
LLVM
3.7.0
|
#include "llvm/ADT/DenseMap.h"#include "llvm/ADT/DepthFirstIterator.h"#include "llvm/ADT/GraphTraits.h"#include "llvm/ADT/SmallPtrSet.h"#include "llvm/ADT/SmallVector.h"#include "llvm/IR/BasicBlock.h"#include "llvm/IR/CFG.h"#include "llvm/IR/Function.h"#include "llvm/Pass.h"#include "llvm/Support/Compiler.h"#include "llvm/Support/GenericDomTree.h"#include "llvm/Support/raw_ostream.h"#include <algorithm>Go to the source code of this file.
Classes | |
| class | llvm::AnalysisManager< IRUnitT > |
| A generic analysis pass manager with lazy running and caching of results. More... | |
| class | llvm::BasicBlockEdge |
| class | llvm::DominatorTree |
| Concrete subclass of DominatorTreeBase that is used to compute a normal dominator tree. More... | |
| struct | llvm::GraphTraits< 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. | |
Functions | |
| template void | llvm::Calculate< Function, BasicBlock * > (DominatorTreeBase< GraphTraits< BasicBlock * >::NodeType > &DT, Function &F) |
| template void | llvm::Calculate< Function, Inverse< BasicBlock * > > (DominatorTreeBase< GraphTraits< Inverse< BasicBlock * >>::NodeType > &DT, Function &F) |
1.8.6