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/Support/Streams.h"
24 #include "llvm/Target/MRegisterInfo.h"
30 // An example for liveAt():
32 // this = [1,4), liveAt(0) will return false. The instruction defining this
33 // spans slots [0,3]. The interval belongs to an spilled definition of the
34 // variable it represents. This is because slot 1 is used (def slot) and spans
35 // up to slot 3 (store slot).
37 bool LiveInterval::liveAt(unsigned I) const {
38 Ranges::const_iterator r = std::upper_bound(ranges.begin(), ranges.end(), I);
40 if (r == ranges.begin())
44 return r->contains(I);
47 // overlaps - Return true if the intersection of the two live intervals is
50 // An example for overlaps():
54 // 8: C = A + B ;; last use of A
56 // The live intervals should look like:
62 // A->overlaps(C) should return false since we want to be able to join
65 bool LiveInterval::overlapsFrom(const LiveInterval& other,
66 const_iterator StartPos) const {
67 const_iterator i = begin();
68 const_iterator ie = end();
69 const_iterator j = StartPos;
70 const_iterator je = other.end();
72 assert((StartPos->start <= i->start || StartPos == other.begin()) &&
73 StartPos != other.end() && "Bogus start position hint!");
75 if (i->start < j->start) {
76 i = std::upper_bound(i, ie, j->start);
77 if (i != ranges.begin()) --i;
78 } else if (j->start < i->start) {
80 if (StartPos != other.end() && StartPos->start <= i->start) {
81 assert(StartPos < other.end() && i < end());
82 j = std::upper_bound(j, je, i->start);
83 if (j != other.ranges.begin()) --j;
89 if (j == je) return false;
92 if (i->start > j->start) {
97 if (i->end > j->start)
105 /// extendIntervalEndTo - This method is used when we want to extend the range
106 /// specified by I to end at the specified endpoint. To do this, we should
107 /// merge and eliminate all ranges that this will overlap with. The iterator is
109 void LiveInterval::extendIntervalEndTo(Ranges::iterator I, unsigned NewEnd) {
110 assert(I != ranges.end() && "Not a valid interval!");
111 unsigned ValId = I->ValId;
113 // Search for the first interval that we can't merge with.
114 Ranges::iterator MergeTo = next(I);
115 for (; MergeTo != ranges.end() && NewEnd >= MergeTo->end; ++MergeTo) {
116 assert(MergeTo->ValId == ValId && "Cannot merge with differing values!");
119 // If NewEnd was in the middle of an interval, make sure to get its endpoint.
120 I->end = std::max(NewEnd, prior(MergeTo)->end);
122 // Erase any dead ranges.
123 ranges.erase(next(I), MergeTo);
126 removeKillForValNum(ValId, I->start, I->end-1);
128 // If the newly formed range now touches the range after it and if they have
129 // the same value number, merge the two ranges into one range.
130 Ranges::iterator Next = next(I);
131 if (Next != ranges.end() && Next->start <= I->end && Next->ValId == ValId) {
138 /// extendIntervalStartTo - This method is used when we want to extend the range
139 /// specified by I to start at the specified endpoint. To do this, we should
140 /// merge and eliminate all ranges that this will overlap with.
141 LiveInterval::Ranges::iterator
142 LiveInterval::extendIntervalStartTo(Ranges::iterator I, unsigned NewStart) {
143 assert(I != ranges.end() && "Not a valid interval!");
144 unsigned ValId = I->ValId;
146 // Search for the first interval that we can't merge with.
147 Ranges::iterator MergeTo = I;
149 if (MergeTo == ranges.begin()) {
151 ranges.erase(MergeTo, I);
154 assert(MergeTo->ValId == ValId && "Cannot merge with differing values!");
156 } while (NewStart <= MergeTo->start);
158 // If we start in the middle of another interval, just delete a range and
159 // extend that interval.
160 if (MergeTo->end >= NewStart && MergeTo->ValId == ValId) {
161 MergeTo->end = I->end;
163 // Otherwise, extend the interval right after.
165 MergeTo->start = NewStart;
166 MergeTo->end = I->end;
169 ranges.erase(next(MergeTo), next(I));
173 LiveInterval::iterator
174 LiveInterval::addRangeFrom(LiveRange LR, iterator From) {
175 unsigned Start = LR.start, End = LR.end;
176 iterator it = std::upper_bound(From, ranges.end(), Start);
178 // If the inserted interval starts in the middle or right at the end of
179 // another interval, just extend that interval to contain the range of LR.
180 if (it != ranges.begin()) {
181 iterator B = prior(it);
182 if (LR.ValId == B->ValId) {
183 if (B->start <= Start && B->end >= Start) {
184 extendIntervalEndTo(B, End);
188 // Check to make sure that we are not overlapping two live ranges with
189 // different ValId's.
190 assert(B->end <= Start &&
191 "Cannot overlap two LiveRanges with differing ValID's"
192 " (did you def the same reg twice in a MachineInstr?)");
196 // Otherwise, if this range ends in the middle of, or right next to, another
197 // interval, merge it into that interval.
198 if (it != ranges.end())
199 if (LR.ValId == it->ValId) {
200 if (it->start <= End) {
201 it = extendIntervalStartTo(it, Start);
203 // If LR is a complete superset of an interval, we may need to grow its
206 extendIntervalEndTo(it, End);
210 // Check to make sure that we are not overlapping two live ranges with
211 // different ValId's.
212 assert(it->start >= End &&
213 "Cannot overlap two LiveRanges with differing ValID's");
216 // Otherwise, this is just a new range that doesn't interact with anything.
218 return ranges.insert(it, LR);
222 /// removeRange - Remove the specified range from this interval. Note that
223 /// the range must already be in this interval in its entirety.
224 void LiveInterval::removeRange(unsigned Start, unsigned End) {
225 // Find the LiveRange containing this span.
226 Ranges::iterator I = std::upper_bound(ranges.begin(), ranges.end(), Start);
227 assert(I != ranges.begin() && "Range is not in interval!");
229 assert(I->contains(Start) && I->contains(End-1) &&
230 "Range is not entirely in interval!");
232 // If the span we are removing is at the start of the LiveRange, adjust it.
233 if (I->start == Start) {
235 removeKillForValNum(I->ValId, End);
236 ranges.erase(I); // Removed the whole LiveRange.
242 // Otherwise if the span we are removing is at the end of the LiveRange,
243 // adjust the other way.
245 replaceKillForValNum(I->ValId, End, Start);
250 // Otherwise, we are splitting the LiveRange into two pieces.
251 unsigned OldEnd = I->end;
252 I->end = Start; // Trim the old interval.
254 // Insert the new one.
255 ranges.insert(next(I), LiveRange(End, OldEnd, I->ValId));
258 /// getLiveRangeContaining - Return the live range that contains the
259 /// specified index, or null if there is none.
260 LiveInterval::const_iterator
261 LiveInterval::FindLiveRangeContaining(unsigned Idx) const {
262 const_iterator It = std::upper_bound(begin(), end(), Idx);
263 if (It != ranges.begin()) {
265 if (It->contains(Idx))
272 LiveInterval::iterator
273 LiveInterval::FindLiveRangeContaining(unsigned Idx) {
274 iterator It = std::upper_bound(begin(), end(), Idx);
277 if (It->contains(Idx))
284 /// join - Join two live intervals (this, and other) together. This applies
285 /// mappings to the value numbers in the LHS/RHS intervals as specified. If
286 /// the intervals are not joinable, this aborts.
287 void LiveInterval::join(LiveInterval &Other, int *LHSValNoAssignments,
288 int *RHSValNoAssignments,
289 SmallVector<VNInfo, 16> &NewValueNumberInfo) {
291 // Try to do the least amount of work possible. In particular, if there are
292 // more liverange chunks in the other set than there are in the 'this' set,
293 // swap sets to merge the fewest chunks in possible.
295 // Also, if one range is a physreg and one is a vreg, we always merge from the
296 // vreg into the physreg, which leaves the vreg intervals pristine.
297 if ((Other.ranges.size() > ranges.size() &&
298 MRegisterInfo::isVirtualRegister(reg)) ||
299 MRegisterInfo::isPhysicalRegister(Other.reg)) {
301 std::swap(LHSValNoAssignments, RHSValNoAssignments);
304 // Determine if any of our live range values are mapped. This is uncommon, so
305 // we want to avoid the interval scan if not.
306 bool MustMapCurValNos = false;
307 for (unsigned i = 0, e = getNumValNums(); i != e; ++i) {
308 if (ValueNumberInfo[i].def == ~1U) continue; // tombstone value #
309 if (i != (unsigned)LHSValNoAssignments[i]) {
310 MustMapCurValNos = true;
315 // If we have to apply a mapping to our base interval assignment, rewrite it
317 if (MustMapCurValNos) {
318 // Map the first live range.
319 iterator OutIt = begin();
320 OutIt->ValId = LHSValNoAssignments[OutIt->ValId];
322 for (iterator I = OutIt, E = end(); I != E; ++I) {
323 OutIt->ValId = LHSValNoAssignments[I->ValId];
325 // If this live range has the same value # as its immediate predecessor,
326 // and if they are neighbors, remove one LiveRange. This happens when we
327 // have [0,3:0)[4,7:1) and map 0/1 onto the same value #.
328 if (OutIt->ValId == (OutIt-1)->ValId && (OutIt-1)->end == OutIt->start) {
329 (OutIt-1)->end = OutIt->end;
332 OutIt->start = I->start;
336 // Didn't merge, on to the next one.
341 // If we merge some live ranges, chop off the end.
342 ranges.erase(OutIt, end());
345 // Update val# info first. Increasing live ranges may invalidate some kills.
346 ValueNumberInfo.clear();
347 ValueNumberInfo.append(NewValueNumberInfo.begin(), NewValueNumberInfo.end());
349 // Okay, now insert the RHS live ranges into the LHS.
350 iterator InsertPos = begin();
351 for (iterator I = Other.begin(), E = Other.end(); I != E; ++I) {
352 // Map the ValId in the other live range to the current live range.
353 I->ValId = RHSValNoAssignments[I->ValId];
354 InsertPos = addRangeFrom(*I, InsertPos);
357 weight += Other.weight;
358 if (Other.preference && !preference)
359 preference = Other.preference;
362 /// MergeRangesInAsValue - Merge all of the intervals in RHS into this live
363 /// interval as the specified value number. The LiveRanges in RHS are
364 /// allowed to overlap with LiveRanges in the current interval, but only if
365 /// the overlapping LiveRanges have the specified value number.
366 void LiveInterval::MergeRangesInAsValue(const LiveInterval &RHS,
368 // TODO: Make this more efficient.
369 iterator InsertPos = begin();
370 for (const_iterator I = RHS.begin(), E = RHS.end(); I != E; ++I) {
371 // Map the ValId in the other live range to the current live range.
373 Tmp.ValId = LHSValNo;
374 InsertPos = addRangeFrom(Tmp, InsertPos);
379 /// MergeInClobberRanges - For any live ranges that are not defined in the
380 /// current interval, but are defined in the Clobbers interval, mark them
381 /// used with an unknown definition value.
382 void LiveInterval::MergeInClobberRanges(const LiveInterval &Clobbers) {
383 if (Clobbers.begin() == Clobbers.end()) return;
385 // Find a value # to use for the clobber ranges. If there is already a value#
386 // for unknown values, use it.
387 // FIXME: Use a single sentinal number for these!
388 unsigned ClobberValNo = getNextValue(~0U, 0);
390 iterator IP = begin();
391 for (const_iterator I = Clobbers.begin(), E = Clobbers.end(); I != E; ++I) {
392 unsigned Start = I->start, End = I->end;
393 IP = std::upper_bound(IP, end(), Start);
395 // If the start of this range overlaps with an existing liverange, trim it.
396 if (IP != begin() && IP[-1].end > Start) {
398 // Trimmed away the whole range?
399 if (Start >= End) continue;
401 // If the end of this range overlaps with an existing liverange, trim it.
402 if (IP != end() && End > IP->start) {
404 // If this trimmed away the whole range, ignore it.
405 if (Start == End) continue;
408 // Insert the clobber interval.
409 IP = addRangeFrom(LiveRange(Start, End, ClobberValNo), IP);
413 /// MergeValueNumberInto - This method is called when two value nubmers
414 /// are found to be equivalent. This eliminates V1, replacing all
415 /// LiveRanges with the V1 value number with the V2 value number. This can
416 /// cause merging of V1/V2 values numbers and compaction of the value space.
417 void LiveInterval::MergeValueNumberInto(unsigned V1, unsigned V2) {
418 assert(V1 != V2 && "Identical value#'s are always equivalent!");
420 // This code actually merges the (numerically) larger value number into the
421 // smaller value number, which is likely to allow us to compactify the value
422 // space. The only thing we have to be careful of is to preserve the
423 // instruction that defines the result value.
425 // Make sure V2 is smaller than V1.
427 copyValNumInfo(V1, V2);
431 // Merge V1 live ranges into V2.
432 for (iterator I = begin(); I != end(); ) {
434 if (LR->ValId != V1) continue; // Not a V1 LiveRange.
436 // Okay, we found a V1 live range. If it had a previous, touching, V2 live
439 iterator Prev = LR-1;
440 if (Prev->ValId == V2 && Prev->end == LR->start) {
441 bool Replaced = replaceKillForValNum(V2, Prev->end, LR->end);
445 // Erase this live-range.
452 // Okay, now we have a V1 or V2 live range that is maximally merged forward.
453 // Ensure that it is a V2 live-range.
456 // If we can merge it into later V2 live ranges, do so now. We ignore any
457 // following V1 live ranges, as they will be merged in subsequent iterations
460 if (I->start == LR->end && I->ValId == V2) {
461 removeKillForValNum(V2, LR->end);
469 // Now that V1 is dead, remove it. If it is the largest value number, just
470 // nuke it (and any other deleted values neighboring it), otherwise mark it as
471 // ~1U so it can be nuked later.
472 if (V1 == getNumValNums()-1) {
474 ValueNumberInfo.pop_back();
475 } while (ValueNumberInfo.back().def == ~1U);
477 ValueNumberInfo[V1].def = ~1U;
481 unsigned LiveInterval::getSize() const {
483 for (const_iterator I = begin(), E = end(); I != E; ++I)
484 Sum += I->end - I->start;
488 std::ostream& llvm::operator<<(std::ostream& os, const LiveRange &LR) {
489 return os << '[' << LR.start << ',' << LR.end << ':' << LR.ValId << ")";
492 void LiveRange::dump() const {
493 cerr << *this << "\n";
496 void LiveInterval::print(std::ostream &OS, const MRegisterInfo *MRI) const {
497 if (MRI && MRegisterInfo::isPhysicalRegister(reg))
498 OS << MRI->getName(reg);
508 for (LiveInterval::Ranges::const_iterator I = ranges.begin(),
509 E = ranges.end(); I != E; ++I)
513 // Print value number info.
514 if (getNumValNums()) {
516 for (unsigned i = 0; i != getNumValNums(); ++i) {
519 if (ValueNumberInfo[i].def == ~1U) {
522 if (ValueNumberInfo[i].def == ~0U)
525 OS << ValueNumberInfo[i].def;
526 unsigned e = ValueNumberInfo[i].kills.size();
529 for (unsigned j = 0; j != e; ++j) {
530 OS << ValueNumberInfo[i].kills[j];
541 void LiveInterval::dump() const {
542 cerr << *this << "\n";
546 void LiveRange::print(std::ostream &os) const {