Change implementation of LiveIntervals::overlap(). This results in a

30-50% decrease in running time of the linear scan register allocator.

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

diff --git a/lib/CodeGen/LiveIntervalAnalysis.cpp b/lib/CodeGen/LiveIntervalAnalysis.cpp
index 1bd8deb37b24cac2d42039718e276429bf21ec82..fe47a3661d8e2838d8c1fdf4993684defb47b83a 100644 (file)
--- a/lib/CodeGen/LiveIntervalAnalysis.cpp
+++ b/lib/CodeGen/LiveIntervalAnalysis.cpp
@@ -386,17 +386,29 @@ bool LiveIntervals::Interval::liveAt(unsigned index) const
 
 bool LiveIntervals::Interval::overlaps(const Interval& other) const
 {
-    std::vector<bool> bitMap(end(), false);
-    for (Ranges::const_iterator r = ranges.begin(); r != ranges.end(); ++r) {
-        for (unsigned i = r->first; i < r->second; ++i)
-            bitMap[i] = true;
-    }
-    for (Ranges::const_iterator r = other.ranges.begin();
-         r != other.ranges.end(); ++r) {
-        for (unsigned i = r->first;
-             i < r->second && i < bitMap.size(); ++i)
-            if (bitMap[i])
+    Ranges::const_iterator i = ranges.begin();
+    Ranges::const_iterator j = other.ranges.begin();
+
+    while (i != ranges.end() && j != other.ranges.end()) {
+        if (i->first < j->first) {
+            if (i->second > j->first) {
+                return true;
+            }
+            else {
+                ++i;
+            }
+        }
+        else if (j->first < i->first) {
+            if (j->second > i->first) {
                 return true;
+            }
+            else {
+                ++j;
+            }
+        }
+        else {
+            return true;
+        }
     }
 
     return false;