diff options
| -rw-r--r-- | include/llvm/Analysis/LoopInfo.h | 28 |
1 files changed, 28 insertions, 0 deletions
diff --git a/include/llvm/Analysis/LoopInfo.h b/include/llvm/Analysis/LoopInfo.h index 6b96625c63..a90296599a 100644 --- a/include/llvm/Analysis/LoopInfo.h +++ b/include/llvm/Analysis/LoopInfo.h @@ -19,6 +19,7 @@ #define LLVM_ANALYSIS_LOOP_INFO_H #include "llvm/Pass.h" +#include "Support/GraphTraits.h" #include <set> class DominatorSet; @@ -186,4 +187,31 @@ private: static IncludeFile LOOP_INFO_INCLUDE_FILE((void*)&LoopInfo::stub); +// Allow clients to walk the list of nested loops... +template <> struct GraphTraits<const Loop*> { + typedef const Loop NodeType; + typedef std::vector<Loop*>::const_iterator ChildIteratorType; + + static NodeType *getEntryNode(const Loop *L) { return L; } + static inline ChildIteratorType child_begin(NodeType *N) { + return N->getSubLoops().begin(); + } + static inline ChildIteratorType child_end(NodeType *N) { + return N->getSubLoops().end(); + } +}; + +template <> struct GraphTraits<Loop*> { + typedef Loop NodeType; + typedef std::vector<Loop*>::const_iterator ChildIteratorType; + + static NodeType *getEntryNode(Loop *L) { return L; } + static inline ChildIteratorType child_begin(NodeType *N) { + return N->getSubLoops().begin(); + } + static inline ChildIteratorType child_end(NodeType *N) { + return N->getSubLoops().end(); + } +}; + #endif |