1 //===-- LiveInterval.cpp - Live Interval Representation -------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // 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/CodeGen/MachineRegisterInfo.h"
23 #include "llvm/ADT/DenseMap.h"
24 #include "llvm/ADT/SmallSet.h"
25 #include "llvm/ADT/STLExtras.h"
26 #include "llvm/Support/Streams.h"
27 #include "llvm/Target/TargetRegisterInfo.h"
32 // An example for liveAt():
34 // this = [1,4), liveAt(0) will return false. The instruction defining this
35 // spans slots [0,3]. The interval belongs to an spilled definition of the
36 // variable it represents. This is because slot 1 is used (def slot) and spans
37 // up to slot 3 (store slot).
39 bool LiveInterval::liveAt(unsigned I) const {
40 Ranges::const_iterator r = std::upper_bound(ranges.begin(), ranges.end(), I);
42 if (r == ranges.begin())
46 return r->contains(I);
49 // liveBeforeAndAt - Check if the interval is live at the index and the index
50 // just before it. If index is liveAt, check if it starts a new live range.
51 // If it does, then check if the previous live range ends at index-1.
52 bool LiveInterval::liveBeforeAndAt(unsigned I) const {
53 Ranges::const_iterator r = std::upper_bound(ranges.begin(), ranges.end(), I);
55 if (r == ranges.begin())
63 // I is the start of a live range. Check if the previous live range ends
65 if (r == ranges.begin())
70 // overlaps - Return true if the intersection of the two live intervals is
73 // An example for overlaps():
77 // 8: C = A + B ;; last use of A
79 // The live intervals should look like:
85 // A->overlaps(C) should return false since we want to be able to join
88 bool LiveInterval::overlapsFrom(const LiveInterval& other,
89 const_iterator StartPos) const {
90 const_iterator i = begin();
91 const_iterator ie = end();
92 const_iterator j = StartPos;
93 const_iterator je = other.end();
95 assert((StartPos->start <= i->start || StartPos == other.begin()) &&
96 StartPos != other.end() && "Bogus start position hint!");
98 if (i->start < j->start) {
99 i = std::upper_bound(i, ie, j->start);
100 if (i != ranges.begin()) --i;
101 } else if (j->start < i->start) {
103 if (StartPos != other.end() && StartPos->start <= i->start) {
104 assert(StartPos < other.end() && i < end());
105 j = std::upper_bound(j, je, i->start);
106 if (j != other.ranges.begin()) --j;
112 if (j == je) return false;
115 if (i->start > j->start) {
120 if (i->end > j->start)
128 /// overlaps - Return true if the live interval overlaps a range specified
130 bool LiveInterval::overlaps(unsigned Start, unsigned End) const {
131 assert(Start < End && "Invalid range");
132 const_iterator I = begin();
133 const_iterator E = end();
134 const_iterator si = std::upper_bound(I, E, Start);
135 const_iterator ei = std::upper_bound(I, E, End);
141 return si->contains(Start);
144 /// extendIntervalEndTo - This method is used when we want to extend the range
145 /// specified by I to end at the specified endpoint. To do this, we should
146 /// merge and eliminate all ranges that this will overlap with. The iterator is
148 void LiveInterval::extendIntervalEndTo(Ranges::iterator I, unsigned NewEnd) {
149 assert(I != ranges.end() && "Not a valid interval!");
150 VNInfo *ValNo = I->valno;
151 unsigned OldEnd = I->end;
153 // Search for the first interval that we can't merge with.
154 Ranges::iterator MergeTo = next(I);
155 for (; MergeTo != ranges.end() && NewEnd >= MergeTo->end; ++MergeTo) {
156 assert(MergeTo->valno == ValNo && "Cannot merge with differing values!");
159 // If NewEnd was in the middle of an interval, make sure to get its endpoint.
160 I->end = std::max(NewEnd, prior(MergeTo)->end);
162 // Erase any dead ranges.
163 ranges.erase(next(I), MergeTo);
166 removeKills(ValNo, OldEnd, I->end-1);
168 // If the newly formed range now touches the range after it and if they have
169 // the same value number, merge the two ranges into one range.
170 Ranges::iterator Next = next(I);
171 if (Next != ranges.end() && Next->start <= I->end && Next->valno == ValNo) {
178 /// extendIntervalStartTo - This method is used when we want to extend the range
179 /// specified by I to start at the specified endpoint. To do this, we should
180 /// merge and eliminate all ranges that this will overlap with.
181 LiveInterval::Ranges::iterator
182 LiveInterval::extendIntervalStartTo(Ranges::iterator I, unsigned NewStart) {
183 assert(I != ranges.end() && "Not a valid interval!");
184 VNInfo *ValNo = I->valno;
186 // Search for the first interval that we can't merge with.
187 Ranges::iterator MergeTo = I;
189 if (MergeTo == ranges.begin()) {
191 ranges.erase(MergeTo, I);
194 assert(MergeTo->valno == ValNo && "Cannot merge with differing values!");
196 } while (NewStart <= MergeTo->start);
198 // If we start in the middle of another interval, just delete a range and
199 // extend that interval.
200 if (MergeTo->end >= NewStart && MergeTo->valno == ValNo) {
201 MergeTo->end = I->end;
203 // Otherwise, extend the interval right after.
205 MergeTo->start = NewStart;
206 MergeTo->end = I->end;
209 ranges.erase(next(MergeTo), next(I));
213 LiveInterval::iterator
214 LiveInterval::addRangeFrom(LiveRange LR, iterator From) {
215 unsigned Start = LR.start, End = LR.end;
216 iterator it = std::upper_bound(From, ranges.end(), Start);
218 // If the inserted interval starts in the middle or right at the end of
219 // another interval, just extend that interval to contain the range of LR.
220 if (it != ranges.begin()) {
221 iterator B = prior(it);
222 if (LR.valno == B->valno) {
223 if (B->start <= Start && B->end >= Start) {
224 extendIntervalEndTo(B, End);
228 // Check to make sure that we are not overlapping two live ranges with
229 // different valno's.
230 assert(B->end <= Start &&
231 "Cannot overlap two LiveRanges with differing ValID's"
232 " (did you def the same reg twice in a MachineInstr?)");
236 // Otherwise, if this range ends in the middle of, or right next to, another
237 // interval, merge it into that interval.
238 if (it != ranges.end()) {
239 if (LR.valno == it->valno) {
240 if (it->start <= End) {
241 it = extendIntervalStartTo(it, Start);
243 // If LR is a complete superset of an interval, we may need to grow its
246 extendIntervalEndTo(it, End);
247 else if (End < it->end)
248 // Overlapping intervals, there might have been a kill here.
249 removeKill(it->valno, End);
253 // Check to make sure that we are not overlapping two live ranges with
254 // different valno's.
255 assert(it->start >= End &&
256 "Cannot overlap two LiveRanges with differing ValID's");
260 // Otherwise, this is just a new range that doesn't interact with anything.
262 return ranges.insert(it, LR);
265 /// isInOneLiveRange - Return true if the range specified is entirely in the
266 /// a single LiveRange of the live interval.
267 bool LiveInterval::isInOneLiveRange(unsigned Start, unsigned End) {
268 Ranges::iterator I = std::upper_bound(ranges.begin(), ranges.end(), Start);
269 if (I == ranges.begin())
272 return I->contains(Start) && I->contains(End-1);
276 /// removeRange - Remove the specified range from this interval. Note that
277 /// the range must be in a single LiveRange in its entirety.
278 void LiveInterval::removeRange(unsigned Start, unsigned End,
279 bool RemoveDeadValNo) {
280 // Find the LiveRange containing this span.
281 Ranges::iterator I = std::upper_bound(ranges.begin(), ranges.end(), Start);
282 assert(I != ranges.begin() && "Range is not in interval!");
284 assert(I->contains(Start) && I->contains(End-1) &&
285 "Range is not entirely in interval!");
287 // If the span we are removing is at the start of the LiveRange, adjust it.
288 VNInfo *ValNo = I->valno;
289 if (I->start == Start) {
291 removeKills(I->valno, Start, End);
292 if (RemoveDeadValNo) {
293 // Check if val# is dead.
295 for (const_iterator II = begin(), EE = end(); II != EE; ++II)
296 if (II != I && II->valno == ValNo) {
301 // Now that ValNo is dead, remove it. If it is the largest value
302 // number, just nuke it (and any other deleted values neighboring it),
303 // otherwise mark it as ~1U so it can be nuked later.
304 if (ValNo->id == getNumValNums()-1) {
306 VNInfo *VNI = valnos.back();
309 } while (!valnos.empty() && valnos.back()->isUnused());
311 ValNo->setIsUnused(true);
316 ranges.erase(I); // Removed the whole LiveRange.
322 // Otherwise if the span we are removing is at the end of the LiveRange,
323 // adjust the other way.
325 removeKills(ValNo, Start, End);
330 // Otherwise, we are splitting the LiveRange into two pieces.
331 unsigned OldEnd = I->end;
332 I->end = Start; // Trim the old interval.
334 // Insert the new one.
335 ranges.insert(next(I), LiveRange(End, OldEnd, ValNo));
338 /// removeValNo - Remove all the ranges defined by the specified value#.
339 /// Also remove the value# from value# list.
340 void LiveInterval::removeValNo(VNInfo *ValNo) {
342 Ranges::iterator I = ranges.end();
343 Ranges::iterator E = ranges.begin();
346 if (I->valno == ValNo)
349 // Now that ValNo is dead, remove it. If it is the largest value
350 // number, just nuke it (and any other deleted values neighboring it),
351 // otherwise mark it as ~1U so it can be nuked later.
352 if (ValNo->id == getNumValNums()-1) {
354 VNInfo *VNI = valnos.back();
357 } while (!valnos.empty() && valnos.back()->isUnused());
359 ValNo->setIsUnused(true);
363 /// scaleNumbering - Renumber VNI and ranges to provide gaps for new
365 void LiveInterval::scaleNumbering(unsigned factor) {
367 for (iterator RI = begin(), RE = end(); RI != RE; ++RI) {
368 RI->start = InstrSlots::scale(RI->start, factor);
369 RI->end = InstrSlots::scale(RI->end, factor);
373 for (vni_iterator VNI = vni_begin(), VNIE = vni_end(); VNI != VNIE; ++VNI) {
376 if (vni->isDefAccurate())
377 vni->def = InstrSlots::scale(vni->def, factor);
379 for (unsigned i = 0; i < vni->kills.size(); ++i) {
380 if (vni->kills[i] != 0)
381 vni->kills[i] = InstrSlots::scale(vni->kills[i], factor);
386 /// getLiveRangeContaining - Return the live range that contains the
387 /// specified index, or null if there is none.
388 LiveInterval::const_iterator
389 LiveInterval::FindLiveRangeContaining(unsigned Idx) const {
390 const_iterator It = std::upper_bound(begin(), end(), Idx);
391 if (It != ranges.begin()) {
393 if (It->contains(Idx))
400 LiveInterval::iterator
401 LiveInterval::FindLiveRangeContaining(unsigned Idx) {
402 iterator It = std::upper_bound(begin(), end(), Idx);
405 if (It->contains(Idx))
412 /// findDefinedVNInfo - Find the VNInfo that's defined at the specified index
413 /// (register interval) or defined by the specified register (stack inteval).
414 VNInfo *LiveInterval::findDefinedVNInfo(unsigned DefIdxOrReg) const {
416 for (LiveInterval::const_vni_iterator i = vni_begin(), e = vni_end();
418 if ((*i)->def == DefIdxOrReg) {
425 /// join - Join two live intervals (this, and other) together. This applies
426 /// mappings to the value numbers in the LHS/RHS intervals as specified. If
427 /// the intervals are not joinable, this aborts.
428 void LiveInterval::join(LiveInterval &Other, const int *LHSValNoAssignments,
429 const int *RHSValNoAssignments,
430 SmallVector<VNInfo*, 16> &NewVNInfo,
431 MachineRegisterInfo *MRI) {
432 // Determine if any of our live range values are mapped. This is uncommon, so
433 // we want to avoid the interval scan if not.
434 bool MustMapCurValNos = false;
435 unsigned NumVals = getNumValNums();
436 unsigned NumNewVals = NewVNInfo.size();
437 for (unsigned i = 0; i != NumVals; ++i) {
438 unsigned LHSValID = LHSValNoAssignments[i];
440 (NewVNInfo[LHSValID] && NewVNInfo[LHSValID] != getValNumInfo(i)))
441 MustMapCurValNos = true;
444 // If we have to apply a mapping to our base interval assignment, rewrite it
446 if (MustMapCurValNos) {
447 // Map the first live range.
448 iterator OutIt = begin();
449 OutIt->valno = NewVNInfo[LHSValNoAssignments[OutIt->valno->id]];
451 for (iterator I = OutIt, E = end(); I != E; ++I) {
452 OutIt->valno = NewVNInfo[LHSValNoAssignments[I->valno->id]];
454 // If this live range has the same value # as its immediate predecessor,
455 // and if they are neighbors, remove one LiveRange. This happens when we
456 // have [0,3:0)[4,7:1) and map 0/1 onto the same value #.
457 if (OutIt->valno == (OutIt-1)->valno && (OutIt-1)->end == OutIt->start) {
458 (OutIt-1)->end = OutIt->end;
461 OutIt->start = I->start;
465 // Didn't merge, on to the next one.
470 // If we merge some live ranges, chop off the end.
471 ranges.erase(OutIt, end());
474 // Remember assignements because val# ids are changing.
475 SmallVector<unsigned, 16> OtherAssignments;
476 for (iterator I = Other.begin(), E = Other.end(); I != E; ++I)
477 OtherAssignments.push_back(RHSValNoAssignments[I->valno->id]);
479 // Update val# info. Renumber them and make sure they all belong to this
480 // LiveInterval now. Also remove dead val#'s.
481 unsigned NumValNos = 0;
482 for (unsigned i = 0; i < NumNewVals; ++i) {
483 VNInfo *VNI = NewVNInfo[i];
485 if (NumValNos >= NumVals)
486 valnos.push_back(VNI);
488 valnos[NumValNos] = VNI;
489 VNI->id = NumValNos++; // Renumber val#.
492 if (NumNewVals < NumVals)
493 valnos.resize(NumNewVals); // shrinkify
495 // Okay, now insert the RHS live ranges into the LHS.
496 iterator InsertPos = begin();
497 unsigned RangeNo = 0;
498 for (iterator I = Other.begin(), E = Other.end(); I != E; ++I, ++RangeNo) {
499 // Map the valno in the other live range to the current live range.
500 I->valno = NewVNInfo[OtherAssignments[RangeNo]];
501 assert(I->valno && "Adding a dead range?");
502 InsertPos = addRangeFrom(*I, InsertPos);
505 weight += Other.weight;
507 // Update regalloc hint if currently there isn't one.
508 if (TargetRegisterInfo::isVirtualRegister(reg) &&
509 TargetRegisterInfo::isVirtualRegister(Other.reg)) {
510 std::pair<unsigned, unsigned> Hint = MRI->getRegAllocationHint(reg);
511 if (Hint.first == 0 && Hint.second == 0) {
512 std::pair<unsigned, unsigned> OtherHint =
513 MRI->getRegAllocationHint(Other.reg);
514 if (OtherHint.first || OtherHint.second)
515 MRI->setRegAllocationHint(reg, OtherHint.first, OtherHint.second);
520 /// MergeRangesInAsValue - Merge all of the intervals in RHS into this live
521 /// interval as the specified value number. The LiveRanges in RHS are
522 /// allowed to overlap with LiveRanges in the current interval, but only if
523 /// the overlapping LiveRanges have the specified value number.
524 void LiveInterval::MergeRangesInAsValue(const LiveInterval &RHS,
526 // TODO: Make this more efficient.
527 iterator InsertPos = begin();
528 for (const_iterator I = RHS.begin(), E = RHS.end(); I != E; ++I) {
529 // Map the valno in the other live range to the current live range.
531 Tmp.valno = LHSValNo;
532 InsertPos = addRangeFrom(Tmp, InsertPos);
537 /// MergeValueInAsValue - Merge all of the live ranges of a specific val#
538 /// in RHS into this live interval as the specified value number.
539 /// The LiveRanges in RHS are allowed to overlap with LiveRanges in the
540 /// current interval, it will replace the value numbers of the overlaped
541 /// live ranges with the specified value number.
542 void LiveInterval::MergeValueInAsValue(const LiveInterval &RHS,
543 const VNInfo *RHSValNo, VNInfo *LHSValNo) {
544 SmallVector<VNInfo*, 4> ReplacedValNos;
545 iterator IP = begin();
546 for (const_iterator I = RHS.begin(), E = RHS.end(); I != E; ++I) {
547 if (I->valno != RHSValNo)
549 unsigned Start = I->start, End = I->end;
550 IP = std::upper_bound(IP, end(), Start);
551 // If the start of this range overlaps with an existing liverange, trim it.
552 if (IP != begin() && IP[-1].end > Start) {
553 if (IP[-1].valno != LHSValNo) {
554 ReplacedValNos.push_back(IP[-1].valno);
555 IP[-1].valno = LHSValNo; // Update val#.
558 // Trimmed away the whole range?
559 if (Start >= End) continue;
561 // If the end of this range overlaps with an existing liverange, trim it.
562 if (IP != end() && End > IP->start) {
563 if (IP->valno != LHSValNo) {
564 ReplacedValNos.push_back(IP->valno);
565 IP->valno = LHSValNo; // Update val#.
568 // If this trimmed away the whole range, ignore it.
569 if (Start == End) continue;
572 // Map the valno in the other live range to the current live range.
573 IP = addRangeFrom(LiveRange(Start, End, LHSValNo), IP);
577 SmallSet<VNInfo*, 4> Seen;
578 for (unsigned i = 0, e = ReplacedValNos.size(); i != e; ++i) {
579 VNInfo *V1 = ReplacedValNos[i];
580 if (Seen.insert(V1)) {
582 for (const_iterator I = begin(), E = end(); I != E; ++I)
583 if (I->valno == V1) {
588 // Now that V1 is dead, remove it. If it is the largest value number,
589 // just nuke it (and any other deleted values neighboring it), otherwise
590 // mark it as ~1U so it can be nuked later.
591 if (V1->id == getNumValNums()-1) {
593 VNInfo *VNI = valnos.back();
596 } while (!valnos.empty() && valnos.back()->isUnused());
598 V1->setIsUnused(true);
606 /// MergeInClobberRanges - For any live ranges that are not defined in the
607 /// current interval, but are defined in the Clobbers interval, mark them
608 /// used with an unknown definition value.
609 void LiveInterval::MergeInClobberRanges(const LiveInterval &Clobbers,
610 BumpPtrAllocator &VNInfoAllocator) {
611 if (Clobbers.empty()) return;
613 DenseMap<VNInfo*, VNInfo*> ValNoMaps;
614 VNInfo *UnusedValNo = 0;
615 iterator IP = begin();
616 for (const_iterator I = Clobbers.begin(), E = Clobbers.end(); I != E; ++I) {
617 // For every val# in the Clobbers interval, create a new "unknown" val#.
618 VNInfo *ClobberValNo = 0;
619 DenseMap<VNInfo*, VNInfo*>::iterator VI = ValNoMaps.find(I->valno);
620 if (VI != ValNoMaps.end())
621 ClobberValNo = VI->second;
622 else if (UnusedValNo)
623 ClobberValNo = UnusedValNo;
625 UnusedValNo = ClobberValNo = getNextValue(0, 0, false, VNInfoAllocator);
626 ValNoMaps.insert(std::make_pair(I->valno, ClobberValNo));
630 unsigned Start = I->start, End = I->end;
631 // If a clobber range starts before an existing range and ends after
632 // it, the clobber range will need to be split into multiple ranges.
633 // Loop until the entire clobber range is handled.
636 IP = std::upper_bound(IP, end(), Start);
637 unsigned SubRangeStart = Start;
638 unsigned SubRangeEnd = End;
640 // If the start of this range overlaps with an existing liverange, trim it.
641 if (IP != begin() && IP[-1].end > SubRangeStart) {
642 SubRangeStart = IP[-1].end;
643 // Trimmed away the whole range?
644 if (SubRangeStart >= SubRangeEnd) continue;
646 // If the end of this range overlaps with an existing liverange, trim it.
647 if (IP != end() && SubRangeEnd > IP->start) {
648 // If the clobber live range extends beyond the existing live range,
649 // it'll need at least another live range, so set the flag to keep
651 if (SubRangeEnd > IP->end) {
655 SubRangeEnd = IP->start;
656 // If this trimmed away the whole range, ignore it.
657 if (SubRangeStart == SubRangeEnd) continue;
660 // Insert the clobber interval.
661 IP = addRangeFrom(LiveRange(SubRangeStart, SubRangeEnd, ClobberValNo),
668 // Delete the last unused val#.
670 UnusedValNo->~VNInfo();
674 void LiveInterval::MergeInClobberRange(unsigned Start, unsigned End,
675 BumpPtrAllocator &VNInfoAllocator) {
676 // Find a value # to use for the clobber ranges. If there is already a value#
677 // for unknown values, use it.
678 VNInfo *ClobberValNo = getNextValue(0, 0, false, VNInfoAllocator);
680 iterator IP = begin();
681 IP = std::upper_bound(IP, end(), Start);
683 // If the start of this range overlaps with an existing liverange, trim it.
684 if (IP != begin() && IP[-1].end > Start) {
686 // Trimmed away the whole range?
687 if (Start >= End) return;
689 // If the end of this range overlaps with an existing liverange, trim it.
690 if (IP != end() && End > IP->start) {
692 // If this trimmed away the whole range, ignore it.
693 if (Start == End) return;
696 // Insert the clobber interval.
697 addRangeFrom(LiveRange(Start, End, ClobberValNo), IP);
700 /// MergeValueNumberInto - This method is called when two value nubmers
701 /// are found to be equivalent. This eliminates V1, replacing all
702 /// LiveRanges with the V1 value number with the V2 value number. This can
703 /// cause merging of V1/V2 values numbers and compaction of the value space.
704 VNInfo* LiveInterval::MergeValueNumberInto(VNInfo *V1, VNInfo *V2) {
705 assert(V1 != V2 && "Identical value#'s are always equivalent!");
707 // This code actually merges the (numerically) larger value number into the
708 // smaller value number, which is likely to allow us to compactify the value
709 // space. The only thing we have to be careful of is to preserve the
710 // instruction that defines the result value.
712 // Make sure V2 is smaller than V1.
713 if (V1->id < V2->id) {
714 copyValNumInfo(V1, V2);
718 // Merge V1 live ranges into V2.
719 for (iterator I = begin(); I != end(); ) {
721 if (LR->valno != V1) continue; // Not a V1 LiveRange.
723 // Okay, we found a V1 live range. If it had a previous, touching, V2 live
726 iterator Prev = LR-1;
727 if (Prev->valno == V2 && Prev->end == LR->start) {
730 // Erase this live-range.
737 // Okay, now we have a V1 or V2 live range that is maximally merged forward.
738 // Ensure that it is a V2 live-range.
741 // If we can merge it into later V2 live ranges, do so now. We ignore any
742 // following V1 live ranges, as they will be merged in subsequent iterations
745 if (I->start == LR->end && I->valno == V2) {
753 // Now that V1 is dead, remove it. If it is the largest value number, just
754 // nuke it (and any other deleted values neighboring it), otherwise mark it as
755 // ~1U so it can be nuked later.
756 if (V1->id == getNumValNums()-1) {
758 VNInfo *VNI = valnos.back();
761 } while (valnos.back()->isUnused());
763 V1->setIsUnused(true);
769 void LiveInterval::Copy(const LiveInterval &RHS,
770 MachineRegisterInfo *MRI,
771 BumpPtrAllocator &VNInfoAllocator) {
774 std::pair<unsigned, unsigned> Hint = MRI->getRegAllocationHint(RHS.reg);
775 MRI->setRegAllocationHint(reg, Hint.first, Hint.second);
778 for (unsigned i = 0, e = RHS.getNumValNums(); i != e; ++i) {
779 const VNInfo *VNI = RHS.getValNumInfo(i);
780 createValueCopy(VNI, VNInfoAllocator);
782 for (unsigned i = 0, e = RHS.ranges.size(); i != e; ++i) {
783 const LiveRange &LR = RHS.ranges[i];
784 addRange(LiveRange(LR.start, LR.end, getValNumInfo(LR.valno->id)));
788 unsigned LiveInterval::getSize() const {
790 for (const_iterator I = begin(), E = end(); I != E; ++I)
791 Sum += I->end - I->start;
795 std::ostream& llvm::operator<<(std::ostream& os, const LiveRange &LR) {
796 return os << '[' << LR.start << ',' << LR.end << ':' << LR.valno->id << ")";
799 void LiveRange::dump() const {
800 cerr << *this << "\n";
803 void LiveInterval::print(std::ostream &OS,
804 const TargetRegisterInfo *TRI) const {
806 OS << "SS#" << getStackSlotIndex();
807 else if (TRI && TargetRegisterInfo::isPhysicalRegister(reg))
808 OS << TRI->getName(reg);
818 for (LiveInterval::Ranges::const_iterator I = ranges.begin(),
819 E = ranges.end(); I != E; ++I)
823 // Print value number info.
824 if (getNumValNums()) {
827 for (const_vni_iterator i = vni_begin(), e = vni_end(); i != e;
829 const VNInfo *vni = *i;
832 if (vni->isUnused()) {
835 if (!vni->isDefAccurate())
839 unsigned ee = vni->kills.size();
840 if (ee || vni->hasPHIKill()) {
842 for (unsigned j = 0; j != ee; ++j) {
847 if (vni->hasPHIKill()) {
859 void LiveInterval::dump() const {
860 cerr << *this << "\n";
864 void LiveRange::print(std::ostream &os) const {