|
LLVM
3.7.0
|
#include "llvm/ADT/DepthFirstIterator.h"#include "llvm/ADT/PointerIntPair.h"#include "llvm/IR/CFG.h"#include "llvm/IR/Dominators.h"#include <map>#include <memory>#include <set>Go to the source code of this file.
Classes | |
| struct | llvm::RegionTraits< FuncT_ > |
| class | llvm::RegionBase< RegionTr > |
| A single entry single exit Region. More... | |
| class | llvm::RegionInfoBase< RegionTr > |
| Analysis that detects all canonical Regions. More... | |
| struct | llvm::RegionTraits< Function > |
| class | llvm::FlatIt< GraphType > |
| Marker class to iterate over the elements of a Region in flat mode. More... | |
| class | llvm::RegionNodeBase< Tr > |
| A RegionNode represents a subregion or a BasicBlock that is part of a Region. More... | |
| class | llvm::RegionBase< RegionTr > |
| A single entry single exit Region. More... | |
| class | llvm::RegionBase< RegionTr >::block_iterator_wrapper< IsConst > |
| class | llvm::RegionInfoBase< RegionTr > |
| Analysis that detects all canonical Regions. More... | |
| class | llvm::RegionNode |
| class | llvm::Region |
| class | llvm::RegionInfo |
| class | llvm::RegionInfoPass |
Namespaces | |
| llvm | |
| Compute iterated dominance frontiers using a linear time algorithm. | |
Functions | |
| template<class Tr > | |
| raw_ostream & | llvm::operator<< (raw_ostream &OS, const RegionNodeBase< Tr > &Node) |
| Print a RegionNode. More... | |
1.8.6