LLVM API Documentation
#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/Support/Compiler.h"
#include "llvm/Support/raw_ostream.h"
#include <algorithm>
Go to the source code of this file.
Classes | |
class | llvm::DominatorBase< NodeT > |
class | llvm::DomTreeNodeBase< NodeT > |
class | llvm::DominatorTreeBase< NodeT > |
struct | llvm::DominatorTreeBase< NodeT >::InfoRec |
Namespaces | |
namespace | llvm |
List of target independent CodeGen pass IDs. | |
Functions | |
template<class NodeT > | |
raw_ostream & | llvm::operator<< (raw_ostream &o, const DomTreeNodeBase< NodeT > *Node) |
template<class NodeT > | |
void | llvm::PrintDomTree (const DomTreeNodeBase< NodeT > *N, raw_ostream &o, unsigned Lev) |
template<class FuncT , class N > | |
void | llvm::Calculate (DominatorTreeBase< typename GraphTraits< N >::NodeType > &DT, FuncT &F) |
This file defines a set of templates that efficiently compute a dominator tree over a generic graph. This is used typically in LLVM for fast dominance queries on the CFG, but is fully generic w.r.t. the underlying graph types.
Definition in file GenericDomTree.h.