Subzero: Optimize live range overlaps() computation through trimming.

src/IceRegAlloc.h

 //===- subzero/src/IceRegAlloc.h - Linear-scan reg. allocation --*- C++ -*-===//
 //
 //                        The Subzero Code Generator
 //
 // This file is distributed under the University of Illinois Open Source
 // License. See LICENSE.TXT for details.
 //
 //===----------------------------------------------------------------------===//
 //
 // This file declares the data structures used during linear-scan
@@ skipping 16 matching lines @@
 // in the future, we may want to do more complex things such as live
 // range splitting, and keeping a wrapper should make that simpler.
 class LiveRangeWrapper {
 public:
   LiveRangeWrapper(Variable *Var) : Var(Var) {}
   const LiveRange &range() const { return Var->getLiveRange(); }
   bool endsBefore(const LiveRangeWrapper &Other) const {
     return range().endsBefore(Other.range());
   }
   bool overlaps(const LiveRangeWrapper &Other) const {
-    return range().overlaps(Other.range());
+    const bool UseTrimmed = true;
+    return range().overlaps(Other.range(), UseTrimmed);
   }
   bool overlapsStart(const LiveRangeWrapper &Other) const {
-    return range().overlaps(Other.range().getStart());
+    const bool UseTrimmed = true;
+    return range().overlapsInst(Other.range().getStart(), UseTrimmed);
   }
   Variable *const Var;
   void dump(const Cfg *Func) const;
 
 private:
   // LiveRangeWrapper(const LiveRangeWrapper &) = delete;
   LiveRangeWrapper &operator=(const LiveRangeWrapper &) = delete;
 };
 
 class LinearScan {
@@ skipping 24 matching lines @@
   // for faster processing.
   OrderedRanges UnhandledPrecolored;
   UnorderedRanges Active, Inactive, Handled;
   LinearScan(const LinearScan &) = delete;
   LinearScan &operator=(const LinearScan &) = delete;
 };
 
 } // end of namespace Ice
 
 #endif // SUBZERO_SRC_ICEREGALLOC_H