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' and 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/LiveIntervalAnalysis.h"
23 #include "llvm/CodeGen/MachineRegisterInfo.h"
24 #include "llvm/ADT/DenseMap.h"
25 #include "llvm/ADT/SmallSet.h"
26 #include "llvm/ADT/STLExtras.h"
27 #include "llvm/Support/Debug.h"
28 #include "llvm/Support/raw_ostream.h"
29 #include "llvm/Target/TargetRegisterInfo.h"
33 // An example for liveAt():
35 // this = [1,4), liveAt(0) will return false. The instruction defining this
36 // spans slots [0,3]. The interval belongs to an spilled definition of the
37 // variable it represents. This is because slot 1 is used (def slot) and spans
38 // up to slot 3 (store slot).
40 bool LiveInterval::liveAt(SlotIndex I) const {
41 Ranges::const_iterator r = std::upper_bound(ranges.begin(), ranges.end(), I);
43 if (r == ranges.begin())
47 return r->contains(I);
50 // liveBeforeAndAt - Check if the interval is live at the index and the index
51 // just before it. If index is liveAt, check if it starts a new live range.
52 // If it does, then check if the previous live range ends at index-1.
53 bool LiveInterval::liveBeforeAndAt(SlotIndex I) const {
54 Ranges::const_iterator r = std::upper_bound(ranges.begin(), ranges.end(), I);
56 if (r == ranges.begin())
64 // I is the start of a live range. Check if the previous live range ends
66 if (r == ranges.begin())
71 /// killedAt - Return true if a live range ends at index. Note that the kill
72 /// point is not contained in the half-open live range. It is usually the
73 /// getDefIndex() slot following its last use.
74 bool LiveInterval::killedAt(SlotIndex I) const {
75 Ranges::const_iterator r = std::lower_bound(ranges.begin(), ranges.end(), I);
77 // Now r points to the first interval with start >= I, or ranges.end().
78 if (r == ranges.begin())
82 // Now r points to the last interval with end <= I.
83 // r->end is the kill point.
87 /// killedInRange - Return true if the interval has kills in [Start,End).
88 bool LiveInterval::killedInRange(SlotIndex Start, SlotIndex End) const {
89 Ranges::const_iterator r =
90 std::lower_bound(ranges.begin(), ranges.end(), End);
92 // Now r points to the first interval with start >= End, or ranges.end().
93 if (r == ranges.begin())
97 // Now r points to the last interval with end <= End.
98 // r->end is the kill point.
99 return r->end >= Start && r->end < End;
102 // overlaps - Return true if the intersection of the two live intervals is
105 // An example for overlaps():
109 // 8: C = A + B ;; last use of A
111 // The live intervals should look like:
117 // A->overlaps(C) should return false since we want to be able to join
120 bool LiveInterval::overlapsFrom(const LiveInterval& other,
121 const_iterator StartPos) const {
122 assert(!empty() && "empty interval");
123 const_iterator i = begin();
124 const_iterator ie = end();
125 const_iterator j = StartPos;
126 const_iterator je = other.end();
128 assert((StartPos->start <= i->start || StartPos == other.begin()) &&
129 StartPos != other.end() && "Bogus start position hint!");
131 if (i->start < j->start) {
132 i = std::upper_bound(i, ie, j->start);
133 if (i != ranges.begin()) --i;
134 } else if (j->start < i->start) {
136 if (StartPos != other.end() && StartPos->start <= i->start) {
137 assert(StartPos < other.end() && i < end());
138 j = std::upper_bound(j, je, i->start);
139 if (j != other.ranges.begin()) --j;
145 if (j == je) return false;
148 if (i->start > j->start) {
153 if (i->end > j->start)
161 /// overlaps - Return true if the live interval overlaps a range specified
163 bool LiveInterval::overlaps(SlotIndex Start, SlotIndex End) const {
164 assert(Start < End && "Invalid range");
165 const_iterator I = std::lower_bound(begin(), end(), End);
166 return I != begin() && (--I)->end > Start;
170 /// ValNo is dead, remove it. If it is the largest value number, just nuke it
171 /// (and any other deleted values neighboring it), otherwise mark it as ~1U so
172 /// it can be nuked later.
173 void LiveInterval::markValNoForDeletion(VNInfo *ValNo) {
174 if (ValNo->id == getNumValNums()-1) {
177 } while (!valnos.empty() && valnos.back()->isUnused());
179 ValNo->setIsUnused(true);
183 /// RenumberValues - Renumber all values in order of appearance and delete the
184 /// remaining unused values.
185 void LiveInterval::RenumberValues() {
186 SmallPtrSet<VNInfo*, 8> Seen;
188 for (const_iterator I = begin(), E = end(); I != E; ++I) {
189 VNInfo *VNI = I->valno;
190 if (!Seen.insert(VNI))
192 assert(!VNI->isUnused() && "Unused valno used by live range");
193 VNI->id = (unsigned)valnos.size();
194 valnos.push_back(VNI);
198 /// extendIntervalEndTo - This method is used when we want to extend the range
199 /// specified by I to end at the specified endpoint. To do this, we should
200 /// merge and eliminate all ranges that this will overlap with. The iterator is
202 void LiveInterval::extendIntervalEndTo(Ranges::iterator I, SlotIndex NewEnd) {
203 assert(I != ranges.end() && "Not a valid interval!");
204 VNInfo *ValNo = I->valno;
206 // Search for the first interval that we can't merge with.
207 Ranges::iterator MergeTo = llvm::next(I);
208 for (; MergeTo != ranges.end() && NewEnd >= MergeTo->end; ++MergeTo) {
209 assert(MergeTo->valno == ValNo && "Cannot merge with differing values!");
212 // If NewEnd was in the middle of an interval, make sure to get its endpoint.
213 I->end = std::max(NewEnd, prior(MergeTo)->end);
215 // Erase any dead ranges.
216 ranges.erase(llvm::next(I), MergeTo);
218 // If the newly formed range now touches the range after it and if they have
219 // the same value number, merge the two ranges into one range.
220 Ranges::iterator Next = llvm::next(I);
221 if (Next != ranges.end() && Next->start <= I->end && Next->valno == ValNo) {
228 /// extendIntervalStartTo - This method is used when we want to extend the range
229 /// specified by I to start at the specified endpoint. To do this, we should
230 /// merge and eliminate all ranges that this will overlap with.
231 LiveInterval::Ranges::iterator
232 LiveInterval::extendIntervalStartTo(Ranges::iterator I, SlotIndex NewStart) {
233 assert(I != ranges.end() && "Not a valid interval!");
234 VNInfo *ValNo = I->valno;
236 // Search for the first interval that we can't merge with.
237 Ranges::iterator MergeTo = I;
239 if (MergeTo == ranges.begin()) {
241 ranges.erase(MergeTo, I);
244 assert(MergeTo->valno == ValNo && "Cannot merge with differing values!");
246 } while (NewStart <= MergeTo->start);
248 // If we start in the middle of another interval, just delete a range and
249 // extend that interval.
250 if (MergeTo->end >= NewStart && MergeTo->valno == ValNo) {
251 MergeTo->end = I->end;
253 // Otherwise, extend the interval right after.
255 MergeTo->start = NewStart;
256 MergeTo->end = I->end;
259 ranges.erase(llvm::next(MergeTo), llvm::next(I));
263 LiveInterval::iterator
264 LiveInterval::addRangeFrom(LiveRange LR, iterator From) {
265 SlotIndex Start = LR.start, End = LR.end;
266 iterator it = std::upper_bound(From, ranges.end(), Start);
268 // If the inserted interval starts in the middle or right at the end of
269 // another interval, just extend that interval to contain the range of LR.
270 if (it != ranges.begin()) {
271 iterator B = prior(it);
272 if (LR.valno == B->valno) {
273 if (B->start <= Start && B->end >= Start) {
274 extendIntervalEndTo(B, End);
278 // Check to make sure that we are not overlapping two live ranges with
279 // different valno's.
280 assert(B->end <= Start &&
281 "Cannot overlap two LiveRanges with differing ValID's"
282 " (did you def the same reg twice in a MachineInstr?)");
286 // Otherwise, if this range ends in the middle of, or right next to, another
287 // interval, merge it into that interval.
288 if (it != ranges.end()) {
289 if (LR.valno == it->valno) {
290 if (it->start <= End) {
291 it = extendIntervalStartTo(it, Start);
293 // If LR is a complete superset of an interval, we may need to grow its
296 extendIntervalEndTo(it, End);
300 // Check to make sure that we are not overlapping two live ranges with
301 // different valno's.
302 assert(it->start >= End &&
303 "Cannot overlap two LiveRanges with differing ValID's");
307 // Otherwise, this is just a new range that doesn't interact with anything.
309 return ranges.insert(it, LR);
312 /// isInOneLiveRange - Return true if the range specified is entirely in
313 /// a single LiveRange of the live interval.
314 bool LiveInterval::isInOneLiveRange(SlotIndex Start, SlotIndex End) {
315 Ranges::iterator I = std::upper_bound(ranges.begin(), ranges.end(), Start);
316 if (I == ranges.begin())
319 return I->containsRange(Start, End);
323 /// removeRange - Remove the specified range from this interval. Note that
324 /// the range must be in a single LiveRange in its entirety.
325 void LiveInterval::removeRange(SlotIndex Start, SlotIndex End,
326 bool RemoveDeadValNo) {
327 // Find the LiveRange containing this span.
328 Ranges::iterator I = std::upper_bound(ranges.begin(), ranges.end(), Start);
329 assert(I != ranges.begin() && "Range is not in interval!");
331 assert(I->containsRange(Start, End) && "Range is not entirely in interval!");
333 // If the span we are removing is at the start of the LiveRange, adjust it.
334 VNInfo *ValNo = I->valno;
335 if (I->start == Start) {
337 if (RemoveDeadValNo) {
338 // Check if val# is dead.
340 for (const_iterator II = begin(), EE = end(); II != EE; ++II)
341 if (II != I && II->valno == ValNo) {
346 // Now that ValNo is dead, remove it.
347 markValNoForDeletion(ValNo);
351 ranges.erase(I); // Removed the whole LiveRange.
357 // Otherwise if the span we are removing is at the end of the LiveRange,
358 // adjust the other way.
364 // Otherwise, we are splitting the LiveRange into two pieces.
365 SlotIndex OldEnd = I->end;
366 I->end = Start; // Trim the old interval.
368 // Insert the new one.
369 ranges.insert(llvm::next(I), LiveRange(End, OldEnd, ValNo));
372 /// removeValNo - Remove all the ranges defined by the specified value#.
373 /// Also remove the value# from value# list.
374 void LiveInterval::removeValNo(VNInfo *ValNo) {
376 Ranges::iterator I = ranges.end();
377 Ranges::iterator E = ranges.begin();
380 if (I->valno == ValNo)
383 // Now that ValNo is dead, remove it.
384 markValNoForDeletion(ValNo);
387 /// getLiveRangeContaining - Return the live range that contains the
388 /// specified index, or null if there is none.
389 LiveInterval::const_iterator
390 LiveInterval::FindLiveRangeContaining(SlotIndex Idx) const {
391 const_iterator It = std::upper_bound(begin(), end(), Idx);
392 if (It != ranges.begin()) {
394 if (It->contains(Idx))
401 LiveInterval::iterator
402 LiveInterval::FindLiveRangeContaining(SlotIndex Idx) {
403 iterator It = std::upper_bound(begin(), end(), Idx);
406 if (It->contains(Idx))
413 /// findDefinedVNInfo - Find the VNInfo defined by the specified
414 /// index (register interval).
415 VNInfo *LiveInterval::findDefinedVNInfoForRegInt(SlotIndex Idx) const {
416 for (LiveInterval::const_vni_iterator i = vni_begin(), e = vni_end();
418 if ((*i)->def == Idx)
425 /// findDefinedVNInfo - Find the VNInfo defined by the specified
426 /// register (stack inteval).
427 VNInfo *LiveInterval::findDefinedVNInfoForStackInt(unsigned reg) const {
428 for (LiveInterval::const_vni_iterator i = vni_begin(), e = vni_end();
430 if ((*i)->getReg() == reg)
436 /// join - Join two live intervals (this, and other) together. This applies
437 /// mappings to the value numbers in the LHS/RHS intervals as specified. If
438 /// the intervals are not joinable, this aborts.
439 void LiveInterval::join(LiveInterval &Other,
440 const int *LHSValNoAssignments,
441 const int *RHSValNoAssignments,
442 SmallVector<VNInfo*, 16> &NewVNInfo,
443 MachineRegisterInfo *MRI) {
444 // Determine if any of our live range values are mapped. This is uncommon, so
445 // we want to avoid the interval scan if not.
446 bool MustMapCurValNos = false;
447 unsigned NumVals = getNumValNums();
448 unsigned NumNewVals = NewVNInfo.size();
449 for (unsigned i = 0; i != NumVals; ++i) {
450 unsigned LHSValID = LHSValNoAssignments[i];
452 (NewVNInfo[LHSValID] && NewVNInfo[LHSValID] != getValNumInfo(i)))
453 MustMapCurValNos = true;
456 // If we have to apply a mapping to our base interval assignment, rewrite it
458 if (MustMapCurValNos) {
459 // Map the first live range.
460 iterator OutIt = begin();
461 OutIt->valno = NewVNInfo[LHSValNoAssignments[OutIt->valno->id]];
463 for (iterator I = OutIt, E = end(); I != E; ++I) {
464 OutIt->valno = NewVNInfo[LHSValNoAssignments[I->valno->id]];
466 // If this live range has the same value # as its immediate predecessor,
467 // and if they are neighbors, remove one LiveRange. This happens when we
468 // have [0,3:0)[4,7:1) and map 0/1 onto the same value #.
469 if (OutIt->valno == (OutIt-1)->valno && (OutIt-1)->end == OutIt->start) {
470 (OutIt-1)->end = OutIt->end;
473 OutIt->start = I->start;
477 // Didn't merge, on to the next one.
482 // If we merge some live ranges, chop off the end.
483 ranges.erase(OutIt, end());
486 // Remember assignements because val# ids are changing.
487 SmallVector<unsigned, 16> OtherAssignments;
488 for (iterator I = Other.begin(), E = Other.end(); I != E; ++I)
489 OtherAssignments.push_back(RHSValNoAssignments[I->valno->id]);
491 // Update val# info. Renumber them and make sure they all belong to this
492 // LiveInterval now. Also remove dead val#'s.
493 unsigned NumValNos = 0;
494 for (unsigned i = 0; i < NumNewVals; ++i) {
495 VNInfo *VNI = NewVNInfo[i];
497 if (NumValNos >= NumVals)
498 valnos.push_back(VNI);
500 valnos[NumValNos] = VNI;
501 VNI->id = NumValNos++; // Renumber val#.
504 if (NumNewVals < NumVals)
505 valnos.resize(NumNewVals); // shrinkify
507 // Okay, now insert the RHS live ranges into the LHS.
508 iterator InsertPos = begin();
509 unsigned RangeNo = 0;
510 for (iterator I = Other.begin(), E = Other.end(); I != E; ++I, ++RangeNo) {
511 // Map the valno in the other live range to the current live range.
512 I->valno = NewVNInfo[OtherAssignments[RangeNo]];
513 assert(I->valno && "Adding a dead range?");
514 InsertPos = addRangeFrom(*I, InsertPos);
517 ComputeJoinedWeight(Other);
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(
543 const LiveInterval &RHS,
544 const VNInfo *RHSValNo, VNInfo *LHSValNo) {
545 SmallVector<VNInfo*, 4> ReplacedValNos;
546 iterator IP = begin();
547 for (const_iterator I = RHS.begin(), E = RHS.end(); I != E; ++I) {
548 assert(I->valno == RHS.getValNumInfo(I->valno->id) && "Bad VNInfo");
549 if (I->valno != RHSValNo)
551 SlotIndex Start = I->start, End = I->end;
552 IP = std::upper_bound(IP, end(), Start);
553 // If the start of this range overlaps with an existing liverange, trim it.
554 if (IP != begin() && IP[-1].end > Start) {
555 if (IP[-1].valno != LHSValNo) {
556 ReplacedValNos.push_back(IP[-1].valno);
557 IP[-1].valno = LHSValNo; // Update val#.
560 // Trimmed away the whole range?
561 if (Start >= End) continue;
563 // If the end of this range overlaps with an existing liverange, trim it.
564 if (IP != end() && End > IP->start) {
565 if (IP->valno != LHSValNo) {
566 ReplacedValNos.push_back(IP->valno);
567 IP->valno = LHSValNo; // Update val#.
570 // If this trimmed away the whole range, ignore it.
571 if (Start == End) continue;
574 // Map the valno in the other live range to the current live range.
575 IP = addRangeFrom(LiveRange(Start, End, LHSValNo), IP);
579 SmallSet<VNInfo*, 4> Seen;
580 for (unsigned i = 0, e = ReplacedValNos.size(); i != e; ++i) {
581 VNInfo *V1 = ReplacedValNos[i];
582 if (Seen.insert(V1)) {
584 for (const_iterator I = begin(), E = end(); I != E; ++I)
585 if (I->valno == V1) {
590 // Now that V1 is dead, remove it.
591 markValNoForDeletion(V1);
598 /// MergeInClobberRanges - For any live ranges that are not defined in the
599 /// current interval, but are defined in the Clobbers interval, mark them
600 /// used with an unknown definition value.
601 void LiveInterval::MergeInClobberRanges(LiveIntervals &li_,
602 const LiveInterval &Clobbers,
603 VNInfo::Allocator &VNInfoAllocator) {
604 if (Clobbers.empty()) return;
606 DenseMap<VNInfo*, VNInfo*> ValNoMaps;
607 VNInfo *UnusedValNo = 0;
608 iterator IP = begin();
609 for (const_iterator I = Clobbers.begin(), E = Clobbers.end(); I != E; ++I) {
610 // For every val# in the Clobbers interval, create a new "unknown" val#.
611 VNInfo *ClobberValNo = 0;
612 DenseMap<VNInfo*, VNInfo*>::iterator VI = ValNoMaps.find(I->valno);
613 if (VI != ValNoMaps.end())
614 ClobberValNo = VI->second;
615 else if (UnusedValNo)
616 ClobberValNo = UnusedValNo;
618 UnusedValNo = ClobberValNo =
619 getNextValue(li_.getInvalidIndex(), 0, false, VNInfoAllocator);
620 ValNoMaps.insert(std::make_pair(I->valno, ClobberValNo));
624 SlotIndex Start = I->start, End = I->end;
625 // If a clobber range starts before an existing range and ends after
626 // it, the clobber range will need to be split into multiple ranges.
627 // Loop until the entire clobber range is handled.
630 IP = std::upper_bound(IP, end(), Start);
631 SlotIndex SubRangeStart = Start;
632 SlotIndex SubRangeEnd = End;
634 // If the start of this range overlaps with an existing liverange, trim it.
635 if (IP != begin() && IP[-1].end > SubRangeStart) {
636 SubRangeStart = IP[-1].end;
637 // Trimmed away the whole range?
638 if (SubRangeStart >= SubRangeEnd) continue;
640 // If the end of this range overlaps with an existing liverange, trim it.
641 if (IP != end() && SubRangeEnd > IP->start) {
642 // If the clobber live range extends beyond the existing live range,
643 // it'll need at least another live range, so set the flag to keep
645 if (SubRangeEnd > IP->end) {
649 SubRangeEnd = IP->start;
650 // If this trimmed away the whole range, ignore it.
651 if (SubRangeStart == SubRangeEnd) continue;
654 // Insert the clobber interval.
655 IP = addRangeFrom(LiveRange(SubRangeStart, SubRangeEnd, ClobberValNo),
662 // Delete the last unused val#.
667 void LiveInterval::MergeInClobberRange(LiveIntervals &li_,
670 VNInfo::Allocator &VNInfoAllocator) {
671 // Find a value # to use for the clobber ranges. If there is already a value#
672 // for unknown values, use it.
673 VNInfo *ClobberValNo =
674 getNextValue(li_.getInvalidIndex(), 0, false, VNInfoAllocator);
676 iterator IP = begin();
677 IP = std::upper_bound(IP, end(), Start);
679 // If the start of this range overlaps with an existing liverange, trim it.
680 if (IP != begin() && IP[-1].end > Start) {
682 // Trimmed away the whole range?
683 if (Start >= End) return;
685 // If the end of this range overlaps with an existing liverange, trim it.
686 if (IP != end() && End > IP->start) {
688 // If this trimmed away the whole range, ignore it.
689 if (Start == End) return;
692 // Insert the clobber interval.
693 addRangeFrom(LiveRange(Start, End, ClobberValNo), IP);
696 /// MergeValueNumberInto - This method is called when two value nubmers
697 /// are found to be equivalent. This eliminates V1, replacing all
698 /// LiveRanges with the V1 value number with the V2 value number. This can
699 /// cause merging of V1/V2 values numbers and compaction of the value space.
700 VNInfo* LiveInterval::MergeValueNumberInto(VNInfo *V1, VNInfo *V2) {
701 assert(V1 != V2 && "Identical value#'s are always equivalent!");
703 // This code actually merges the (numerically) larger value number into the
704 // smaller value number, which is likely to allow us to compactify the value
705 // space. The only thing we have to be careful of is to preserve the
706 // instruction that defines the result value.
708 // Make sure V2 is smaller than V1.
709 if (V1->id < V2->id) {
714 // Merge V1 live ranges into V2.
715 for (iterator I = begin(); I != end(); ) {
717 if (LR->valno != V1) continue; // Not a V1 LiveRange.
719 // Okay, we found a V1 live range. If it had a previous, touching, V2 live
722 iterator Prev = LR-1;
723 if (Prev->valno == V2 && Prev->end == LR->start) {
726 // Erase this live-range.
733 // Okay, now we have a V1 or V2 live range that is maximally merged forward.
734 // Ensure that it is a V2 live-range.
737 // If we can merge it into later V2 live ranges, do so now. We ignore any
738 // following V1 live ranges, as they will be merged in subsequent iterations
741 if (I->start == LR->end && I->valno == V2) {
749 // Now that V1 is dead, remove it.
750 markValNoForDeletion(V1);
755 void LiveInterval::Copy(const LiveInterval &RHS,
756 MachineRegisterInfo *MRI,
757 VNInfo::Allocator &VNInfoAllocator) {
760 std::pair<unsigned, unsigned> Hint = MRI->getRegAllocationHint(RHS.reg);
761 MRI->setRegAllocationHint(reg, Hint.first, Hint.second);
764 for (unsigned i = 0, e = RHS.getNumValNums(); i != e; ++i) {
765 const VNInfo *VNI = RHS.getValNumInfo(i);
766 createValueCopy(VNI, VNInfoAllocator);
768 for (unsigned i = 0, e = RHS.ranges.size(); i != e; ++i) {
769 const LiveRange &LR = RHS.ranges[i];
770 addRange(LiveRange(LR.start, LR.end, getValNumInfo(LR.valno->id)));
774 unsigned LiveInterval::getSize() const {
776 for (const_iterator I = begin(), E = end(); I != E; ++I)
777 Sum += I->start.distance(I->end);
781 /// ComputeJoinedWeight - Set the weight of a live interval Joined
782 /// after Other has been merged into it.
783 void LiveInterval::ComputeJoinedWeight(const LiveInterval &Other) {
784 // If either of these intervals was spilled, the weight is the
785 // weight of the non-spilled interval. This can only happen with
786 // iterative coalescers.
788 if (Other.weight != HUGE_VALF) {
789 weight += Other.weight;
791 else if (weight == HUGE_VALF &&
792 !TargetRegisterInfo::isPhysicalRegister(reg)) {
793 // Remove this assert if you have an iterative coalescer
794 assert(0 && "Joining to spilled interval");
795 weight = Other.weight;
798 // Otherwise the weight stays the same
799 // Remove this assert if you have an iterative coalescer
800 assert(0 && "Joining from spilled interval");
804 raw_ostream& llvm::operator<<(raw_ostream& os, const LiveRange &LR) {
805 return os << '[' << LR.start << ',' << LR.end << ':' << LR.valno->id << ")";
808 void LiveRange::dump() const {
809 dbgs() << *this << "\n";
812 void LiveInterval::print(raw_ostream &OS, const TargetRegisterInfo *TRI) const {
814 OS << "SS#" << getStackSlotIndex();
815 else if (TRI && TargetRegisterInfo::isPhysicalRegister(reg))
816 OS << TRI->getName(reg);
826 for (LiveInterval::Ranges::const_iterator I = ranges.begin(),
827 E = ranges.end(); I != E; ++I) {
829 assert(I->valno == getValNumInfo(I->valno->id) && "Bad VNInfo");
833 // Print value number info.
834 if (getNumValNums()) {
837 for (const_vni_iterator i = vni_begin(), e = vni_end(); i != e;
839 const VNInfo *vni = *i;
842 if (vni->isUnused()) {
845 if (!vni->isDefAccurate() && !vni->isPHIDef())
849 if (vni->hasPHIKill())
851 if (vni->hasRedefByEC())
858 void LiveInterval::dump() const {
859 dbgs() << *this << "\n";
863 void LiveRange::print(raw_ostream &os) const {