Implement the new Interval::isLoop method

Implement destructor to free memory

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@51 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/lib/Analysis/Interval.cpp b/lib/Analysis/Interval.cpp
index ac4846ae62020e2f26a049cdbceb4979009e66bc..05cfa7560b23c828d7c4491525c9ee5df983032c 100644 (file)
--- a/lib/Analysis/Interval.cpp
+++ b/lib/Analysis/Interval.cpp
@@ -12,6 +12,35 @@
 
 using namespace cfg;
 
+//===----------------------------------------------------------------------===//
+// Interval Implementation
+//===----------------------------------------------------------------------===//
+
+// isLoop - Find out if there is a back edge in this interval...
+//
+bool Interval::isLoop() const {
+  // There is a loop in this interval iff one of the predecessors of the header
+  // node lives in the interval.
+  for (BasicBlock::pred_iterator I = pred_begin(HeaderNode), 
+                                 E = pred_end(HeaderNode); I != E; ++I) {
+    if (contains(*I)) return true;
+  }
+  return false;
+}
+
+
+//===----------------------------------------------------------------------===//
+// IntervalPartition Implementation
+//===----------------------------------------------------------------------===//
+
+template <class T> static inline void deleter(T *Ptr) { delete Ptr; }
+
+// Destructor - Free memory
+IntervalPartition::~IntervalPartition() {
+  for_each(begin(), end(), deleter<cfg::Interval>);
+}
+
+
 // getNodeHeader - Given a source graph node and the source graph, return the 
 // BasicBlock that is the header node.  This is the opposite of
 // getSourceGraphNode.