1 //===-- LiveInterval.cpp - Live Interval Representation -------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the LiveRange and LiveInterval classes. Given some
11 // numbering of each the machine instructions an interval [i, j) is said to be a
12 // live interval for register v if there is no instruction with number j' > j
13 // such that v is live at j' abd there is no instruction with number i' < i such
14 // that v is live at i'. In this implementation intervals can have holes,
15 // i.e. an interval might look like [1,20), [50,65), [1000,1001). Each
16 // individual range is represented as an instance of LiveRange, and the whole
17 // interval is represented as an instance of LiveInterval.
19 //===----------------------------------------------------------------------===//
21 #include "llvm/CodeGen/LiveInterval.h"
22 #include "llvm/ADT/STLExtras.h"
23 #include "llvm/Target/MRegisterInfo.h"
29 // An example for liveAt():
31 // this = [1,4), liveAt(0) will return false. The instruction defining this
32 // spans slots [0,3]. The interval belongs to an spilled definition of the
33 // variable it represents. This is because slot 1 is used (def slot) and spans
34 // up to slot 3 (store slot).
36 bool LiveInterval::liveAt(unsigned I) const {
37 Ranges::const_iterator r = std::upper_bound(ranges.begin(), ranges.end(), I);
39 if (r == ranges.begin())
43 return r->contains(I);
46 // overlaps - Return true if the intersection of the two live intervals is
49 // An example for overlaps():
53 // 8: C = A + B ;; last use of A
55 // The live intervals should look like:
61 // A->overlaps(C) should return false since we want to be able to join
64 bool LiveInterval::overlapsFrom(const LiveInterval& other,
65 const_iterator StartPos) const {
66 const_iterator i = begin();
67 const_iterator ie = end();
68 const_iterator j = StartPos;
69 const_iterator je = other.end();
71 assert((StartPos->start <= i->start || StartPos == other.begin()) &&
72 StartPos != other.end() && "Bogus start position hint!");
74 if (i->start < j->start) {
75 i = std::upper_bound(i, ie, j->start);
76 if (i != ranges.begin()) --i;
77 } else if (j->start < i->start) {
79 if (StartPos != other.end() && StartPos->start <= i->start) {
80 assert(StartPos < other.end() && i < end());
81 j = std::upper_bound(j, je, i->start);
82 if (j != other.ranges.begin()) --j;
88 if (j == je) return false;
91 if (i->start > j->start) {
96 if (i->end > j->start)
104 /// NontrivialOverlap - Check to see if the two live ranges specified by i and j
105 /// overlap. If so, check to see if they have value numbers that are not
106 /// iIdx/jIdx respectively. If both conditions are true, return true.
107 static inline bool NontrivialOverlap(const LiveRange &I, const LiveRange &J,
108 unsigned iIdx, unsigned jIdx) {
109 if (I.start == J.start) {
110 // If this is not the allowed value merge, we cannot join.
111 if (I.ValId != iIdx || J.ValId != jIdx)
113 } else if (I.start < J.start) {
114 if (I.end > J.start && I.ValId != iIdx || J.ValId != jIdx) {
118 if (J.end > I.start &&
119 I.ValId != iIdx || J.ValId != jIdx)
126 /// joinable - Two intervals are joinable if the either don't overlap at all
127 /// or if the destination of the copy is a single assignment value, and it
128 /// only overlaps with one value in the source interval.
129 bool LiveInterval::joinable(const LiveInterval &other, unsigned CopyIdx) const {
130 const LiveRange *SourceLR = other.getLiveRangeContaining(CopyIdx-1);
131 const LiveRange *DestLR = getLiveRangeContaining(CopyIdx);
132 assert(SourceLR && DestLR && "Not joining due to a copy?");
133 unsigned OtherValIdx = SourceLR->ValId;
134 unsigned ThisValIdx = DestLR->ValId;
136 Ranges::const_iterator i = ranges.begin();
137 Ranges::const_iterator ie = ranges.end();
138 Ranges::const_iterator j = other.ranges.begin();
139 Ranges::const_iterator je = other.ranges.end();
141 if (i->start < j->start) {
142 i = std::upper_bound(i, ie, j->start);
143 if (i != ranges.begin()) --i;
144 } else if (j->start < i->start) {
145 j = std::upper_bound(j, je, i->start);
146 if (j != other.ranges.begin()) --j;
149 while (i != ie && j != je) {
150 if (NontrivialOverlap(*i, *j, ThisValIdx, OtherValIdx))
162 /// getOverlapingRanges - Given another live interval which is defined as a
163 /// copy from this one, return a list of all of the live ranges where the
164 /// two overlap and have different value numbers.
165 void LiveInterval::getOverlapingRanges(const LiveInterval &other,
167 std::vector<LiveRange*> &Ranges) {
168 const LiveRange *SourceLR = other.getLiveRangeContaining(CopyIdx-1);
169 const LiveRange *DestLR = getLiveRangeContaining(CopyIdx);
170 assert(SourceLR && DestLR && "Not joining due to a copy?");
171 unsigned OtherValIdx = SourceLR->ValId;
172 unsigned ThisValIdx = DestLR->ValId;
174 Ranges::iterator i = ranges.begin();
175 Ranges::iterator ie = ranges.end();
176 Ranges::const_iterator j = other.ranges.begin();
177 Ranges::const_iterator je = other.ranges.end();
179 if (i->start < j->start) {
180 i = std::upper_bound(i, ie, j->start);
181 if (i != ranges.begin()) --i;
182 } else if (j->start < i->start) {
183 j = std::upper_bound(j, je, i->start);
184 if (j != other.ranges.begin()) --j;
187 while (i != ie && j != je) {
188 if (NontrivialOverlap(*i, *j, ThisValIdx, OtherValIdx))
189 Ranges.push_back(&*i);
200 /// extendIntervalEndTo - This method is used when we want to extend the range
201 /// specified by I to end at the specified endpoint. To do this, we should
202 /// merge and eliminate all ranges that this will overlap with. The iterator is
204 void LiveInterval::extendIntervalEndTo(Ranges::iterator I, unsigned NewEnd) {
205 assert(I != ranges.end() && "Not a valid interval!");
206 unsigned ValId = I->ValId;
208 // Search for the first interval that we can't merge with.
209 Ranges::iterator MergeTo = next(I);
210 for (; MergeTo != ranges.end() && NewEnd >= MergeTo->end; ++MergeTo) {
211 assert(MergeTo->ValId == ValId && "Cannot merge with differing values!");
214 // If NewEnd was in the middle of an interval, make sure to get its endpoint.
215 I->end = std::max(NewEnd, prior(MergeTo)->end);
217 // Erase any dead ranges.
218 ranges.erase(next(I), MergeTo);
220 // If the newly formed range now touches the range after it and if they have
221 // the same value number, merge the two ranges into one range.
222 if (I != ranges.end()) {
223 Ranges::iterator Next = next(I);
224 if (Next->start == I->end && Next->ValId == ValId) {
232 /// extendIntervalStartTo - This method is used when we want to extend the range
233 /// specified by I to start at the specified endpoint. To do this, we should
234 /// merge and eliminate all ranges that this will overlap with.
235 LiveInterval::Ranges::iterator
236 LiveInterval::extendIntervalStartTo(Ranges::iterator I, unsigned NewStart) {
237 assert(I != ranges.end() && "Not a valid interval!");
238 unsigned ValId = I->ValId;
240 // Search for the first interval that we can't merge with.
241 Ranges::iterator MergeTo = I;
243 if (MergeTo == ranges.begin()) {
245 ranges.erase(MergeTo, I);
248 assert(MergeTo->ValId == ValId && "Cannot merge with differing values!");
250 } while (NewStart <= MergeTo->start);
252 // If we start in the middle of another interval, just delete a range and
253 // extend that interval.
254 if (MergeTo->end >= NewStart && MergeTo->ValId == ValId) {
255 MergeTo->end = I->end;
257 // Otherwise, extend the interval right after.
259 MergeTo->start = NewStart;
260 MergeTo->end = I->end;
263 ranges.erase(next(MergeTo), next(I));
267 LiveInterval::Ranges::iterator
268 LiveInterval::addRangeFrom(LiveRange LR, Ranges::iterator From) {
269 unsigned Start = LR.start, End = LR.end;
270 Ranges::iterator it = std::upper_bound(From, ranges.end(), Start);
272 // If the inserted interval starts in the middle or right at the end of
273 // another interval, just extend that interval to contain the range of LR.
274 if (it != ranges.begin()) {
275 Ranges::iterator B = prior(it);
276 if (LR.ValId == B->ValId) {
277 if (B->start <= Start && B->end >= Start) {
278 extendIntervalEndTo(B, End);
282 // Check to make sure that we are not overlapping two live ranges with
283 // different ValId's.
284 assert(B->end <= Start &&
285 "Cannot overlap two LiveRanges with differing ValID's"
286 " (did you def the same reg twice in a MachineInstr?)");
290 // Otherwise, if this range ends in the middle of, or right next to, another
291 // interval, merge it into that interval.
292 if (it != ranges.end())
293 if (LR.ValId == it->ValId) {
294 if (it->start <= End) {
295 it = extendIntervalStartTo(it, Start);
297 // If LR is a complete superset of an interval, we may need to grow its
300 extendIntervalEndTo(it, End);
304 // Check to make sure that we are not overlapping two live ranges with
305 // different ValId's.
306 assert(it->start >= End &&
307 "Cannot overlap two LiveRanges with differing ValID's");
310 // Otherwise, this is just a new range that doesn't interact with anything.
312 return ranges.insert(it, LR);
316 /// removeRange - Remove the specified range from this interval. Note that
317 /// the range must already be in this interval in its entirety.
318 void LiveInterval::removeRange(unsigned Start, unsigned End) {
319 // Find the LiveRange containing this span.
320 Ranges::iterator I = std::upper_bound(ranges.begin(), ranges.end(), Start);
321 assert(I != ranges.begin() && "Range is not in interval!");
323 assert(I->contains(Start) && I->contains(End-1) &&
324 "Range is not entirely in interval!");
326 // If the span we are removing is at the start of the LiveRange, adjust it.
327 if (I->start == Start) {
329 ranges.erase(I); // Removed the whole LiveRange.
335 // Otherwise if the span we are removing is at the end of the LiveRange,
336 // adjust the other way.
342 // Otherwise, we are splitting the LiveRange into two pieces.
343 unsigned OldEnd = I->end;
344 I->end = Start; // Trim the old interval.
346 // Insert the new one.
347 ranges.insert(next(I), LiveRange(End, OldEnd, I->ValId));
350 /// getLiveRangeContaining - Return the live range that contains the
351 /// specified index, or null if there is none.
352 const LiveRange *LiveInterval::getLiveRangeContaining(unsigned Idx) const {
353 Ranges::const_iterator It = std::upper_bound(ranges.begin(),ranges.end(),Idx);
354 if (It != ranges.begin()) {
355 const LiveRange &LR = *prior(It);
356 if (LR.contains(Idx))
365 /// join - Join two live intervals (this, and other) together. This operation
366 /// is the result of a copy instruction in the source program, that occurs at
367 /// index 'CopyIdx' that copies from 'Other' to 'this'.
368 void LiveInterval::join(LiveInterval &Other, unsigned CopyIdx) {
369 const LiveRange *SourceLR = Other.getLiveRangeContaining(CopyIdx-1);
370 const LiveRange *DestLR = getLiveRangeContaining(CopyIdx);
371 assert(SourceLR && DestLR && "Not joining due to a copy?");
372 unsigned MergedSrcValIdx = SourceLR->ValId;
373 unsigned MergedDstValIdx = DestLR->ValId;
375 // Try to do the least amount of work possible. In particular, if there are
376 // more liverange chunks in the other set than there are in the 'this' set,
377 // swap sets to merge the fewest chunks in possible.
378 if (Other.ranges.size() > ranges.size()) {
379 std::swap(MergedSrcValIdx, MergedDstValIdx);
380 std::swap(ranges, Other.ranges);
381 std::swap(NumValues, Other.NumValues);
384 // Join the ranges of other into the ranges of this interval.
385 Ranges::iterator InsertPos = ranges.begin();
386 std::map<unsigned, unsigned> Dst2SrcIdxMap;
387 for (Ranges::iterator I = Other.ranges.begin(),
388 E = Other.ranges.end(); I != E; ++I) {
389 // Map the ValId in the other live range to the current live range.
390 if (I->ValId == MergedSrcValIdx)
391 I->ValId = MergedDstValIdx;
393 unsigned &NV = Dst2SrcIdxMap[I->ValId];
394 if (NV == 0) NV = getNextValue();
398 InsertPos = addRangeFrom(*I, InsertPos);
401 weight += Other.weight;
404 std::ostream& llvm::operator<<(std::ostream& os, const LiveRange &LR) {
405 return os << '[' << LR.start << ',' << LR.end << ':' << LR.ValId << ")";
408 void LiveRange::dump() const {
409 std::cerr << *this << "\n";
412 void LiveInterval::print(std::ostream &OS, const MRegisterInfo *MRI) const {
413 if (MRI && MRegisterInfo::isPhysicalRegister(reg))
414 OS << MRI->getName(reg);
424 for (LiveInterval::Ranges::const_iterator I = ranges.begin(),
425 E = ranges.end(); I != E; ++I)
430 void LiveInterval::dump() const {
431 std::cerr << *this << "\n";