6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-15 04:30:12 +00:00
Code Issues Projects Releases Wiki Activity

Add more graph traits specializations for dominator tree nodes

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@5751 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-03-20 21:21:05 +00:00
parent 3413d150dc
commit e33b796851
1 changed files with 10 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
include/llvm/Analysis/Dominators.h
View File

@ -347,12 +347,12 @@ private:
// DominatorTree GraphTraits specialization so the DominatorTree can be
// iterable by generic graph iterators.
template <> struct GraphTraits<DominatorTree*> {
template <> struct GraphTraits<DominatorTree::Node*> {
typedef DominatorTree::Node NodeType;
typedef NodeType::iterator ChildIteratorType;
static NodeType *getEntryNode(DominatorTree *DT) {
return DT->getNode(DT->getRoot());
static NodeType *getEntryNode(NodeType *N) {
return N;
}
static inline ChildIteratorType child_begin(NodeType* N) {
return N->begin();
@ -362,6 +362,13 @@ template <> struct GraphTraits<DominatorTree*> {
}
};
template <> struct GraphTraits<DominatorTree*>
: public GraphTraits<DominatorTree::Node*> {
static NodeType *getEntryNode(DominatorTree *DT) {
return DT->getNode(DT->getRoot());
}
};
//===----------------------------------------------------------------------===//
//
// DominanceFrontier - Calculate the dominance frontiers for a function.