aboutsummaryrefslogtreecommitdiffstats
path: root/include/llvm/CodeGen
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2004-07-24 02:52:23 +0000
committerChris Lattner <sabre@nondot.org>2004-07-24 02:52:23 +0000
commitabf295fc6cfb438617e8b105022ce506f56674d8 (patch)
tree54dd64f03fb7e05d25edfa701315445b153fb449 /include/llvm/CodeGen
parent1be339ac4c7f1dcf32cf6f2d35bfe3d9c62a35d1 (diff)
downloadexternal_llvm-abf295fc6cfb438617e8b105022ce506f56674d8.zip
external_llvm-abf295fc6cfb438617e8b105022ce506f56674d8.tar.gz
external_llvm-abf295fc6cfb438617e8b105022ce506f56674d8.tar.bz2
Little stuff:
* Fix comment typeo * add dump() methods * add a few new methods like getLiveRangeContaining, removeRange & joinable (which is currently the same as overlaps) * Remove the unused operator== Bigger change: * In LiveInterval, instead of using a boolean isDefinedOnce to keep track of if there are > 1 definitions in a particular interval, keep a counter, NumValues to keep track of exactly how many there are. * In LiveRange, add a new ValId element to indicate which of the numbered values each LiveRange belongs to. We now no longer merge LiveRanges if they are of differing value ID's even if they are neighbors. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@15152 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm/CodeGen')
-rw-r--r--include/llvm/CodeGen/LiveInterval.h47
1 files changed, 37 insertions, 10 deletions
diff --git a/include/llvm/CodeGen/LiveInterval.h b/include/llvm/CodeGen/LiveInterval.h
index 8f6a348..75acf52 100644
--- a/include/llvm/CodeGen/LiveInterval.h
+++ b/include/llvm/CodeGen/LiveInterval.h
@@ -10,7 +10,7 @@
// This file implements the LiveRange and LiveInterval classes. Given some
// numbering of each the machine instructions an interval [i, j) is said to be a
// live interval for register v if there is no instruction with number j' > j
-// such that v is live at j' abd there is no instruction with number i' < i such
+// such that v is live at j' and there is no instruction with number i' < i such
// that v is live at i'. In this implementation intervals can have holes,
// i.e. an interval might look like [1,20), [50,65), [1000,1001). Each
// individual range is represented as an instance of LiveRange, and the whole
@@ -31,8 +31,10 @@ namespace llvm {
/// These ranges are rendered as [start,end).
struct LiveRange {
unsigned start; // Start point of the interval (inclusive)
- unsigned end; // End point of the interval (exclusive)
- LiveRange(unsigned S, unsigned E) : start(S), end(E) {
+ unsigned end; // End point of the interval (exclusive)
+ unsigned ValId; // identifier for the value contained in this interval.
+
+ LiveRange(unsigned S, unsigned E, unsigned V) : start(S), end(E), ValId(V) {
assert(S < E && "Cannot create empty or backwards range");
}
@@ -48,6 +50,9 @@ namespace llvm {
bool operator==(const LiveRange &LR) const {
return start == LR.start && end == LR.end;
}
+
+ void dump() const;
+
private:
LiveRange(); // DO NOT IMPLEMENT
};
@@ -66,13 +71,16 @@ namespace llvm {
unsigned reg; // the register of this interval
float weight; // weight of this interval
Ranges ranges; // the ranges in which this register is live
- bool isDefinedOnce; // True if this interval contains one value.
LiveInterval(unsigned Reg, float Weight)
- : reg(Reg), weight(Weight), isDefinedOnce(false) {
+ : reg(Reg), weight(Weight), NumValues(0) {
}
- bool containsOneValue() const { return isDefinedOnce; }
+ bool containsOneValue() const { return NumValues == 1; }
+
+ unsigned getNextValue() {
+ return NumValues++;
+ }
bool empty() const { return ranges.empty(); }
@@ -95,6 +103,17 @@ namespace llvm {
bool liveAt(unsigned index) const;
+ /// getLiveRangeContaining - Return the live range that contains the
+ /// specified index, or null if there is none.
+ LiveRange *getLiveRangeContaining(unsigned Idx);
+
+
+ /// joinable - Two intervals are joinable if the either don't overlap at all
+ /// or if the destination of the copy is a single assignment value, and it
+ /// only overlaps with one value in the source interval.
+ bool joinable(const LiveInterval& other, unsigned CopyIdx) const;
+
+
bool overlaps(const LiveInterval& other) const;
/// addRange - Add the specified LiveRange to this interval, merging
@@ -104,17 +123,25 @@ namespace llvm {
addRangeFrom(LR, ranges.begin());
}
- void join(const LiveInterval& other);
+ /// join - Join two live intervals (this, and other) together. This
+ /// operation is the result of a copy instruction in the source program,
+ /// that occurs at index 'CopyIdx' that copies from 'other' to 'this'. This
+ /// destroys 'other'.
+ void join(LiveInterval& other, unsigned CopyIdx);
+
+
+ /// removeRange - Remove the specified range from this interval. Note that
+ /// the range must already be in this interval in its entirety.
+ void removeRange(unsigned Start, unsigned End);
bool operator<(const LiveInterval& other) const {
return start() < other.start();
}
- bool operator==(const LiveInterval& other) const {
- return reg == other.reg;
- }
+ void dump() const;
private:
+ unsigned NumValues; // the number of distinct values in this interval.
Ranges::iterator addRangeFrom(LiveRange LR, Ranges::iterator From);
void extendIntervalEndTo(Ranges::iterator I, unsigned NewEnd);
Ranges::iterator extendIntervalStartTo(Ranges::iterator I, unsigned NewStr);