mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-12-15 15:48:38 +00:00
Add more graph traits specializations for dominator tree nodes
llvm-svn: 5751
This commit is contained in:
parent
03fab572fb
commit
cf6eb5232a
@ -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.
|
||||
|
Loading…
Reference in New Issue
Block a user