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 // overlaps - Return true if the intersection of the two live intervals is
74 // An example for overlaps():
78 // 8: C = A + B ;; last use of A
80 // The live intervals should look like:
86 // A->overlaps(C) should return false since we want to be able to join
89 bool LiveInterval::overlapsFrom(const LiveInterval& other,
90 const_iterator StartPos) const {
91 const_iterator i = begin();
92 const_iterator ie = end();
93 const_iterator j = StartPos;
94 const_iterator je = other.end();
96 assert((StartPos->start <= i->start || StartPos == other.begin()) &&
97 StartPos != other.end() && "Bogus start position hint!");
99 if (i->start < j->start) {
100 i = std::upper_bound(i, ie, j->start);
101 if (i != ranges.begin()) --i;
102 } else if (j->start < i->start) {
104 if (StartPos != other.end() && StartPos->start <= i->start) {
105 assert(StartPos < other.end() && i < end());
106 j = std::upper_bound(j, je, i->start);
107 if (j != other.ranges.begin()) --j;
113 if (j == je) return false;
116 if (i->start > j->start) {
121 if (i->end > j->start)
129 /// overlaps - Return true if the live interval overlaps a range specified
131 bool LiveInterval::overlaps(SlotIndex Start, SlotIndex End) const {
132 assert(Start < End && "Invalid range");
133 const_iterator I = begin();
134 const_iterator E = end();
135 const_iterator si = std::upper_bound(I, E, Start);
136 const_iterator ei = std::upper_bound(I, E, End);
142 return si->contains(Start);
145 /// extendIntervalEndTo - This method is used when we want to extend the range
146 /// specified by I to end at the specified endpoint. To do this, we should
147 /// merge and eliminate all ranges that this will overlap with. The iterator is
149 void LiveInterval::extendIntervalEndTo(Ranges::iterator I, SlotIndex NewEnd) {
150 assert(I != ranges.end() && "Not a valid interval!");
151 VNInfo *ValNo = I->valno;
152 SlotIndex OldEnd = I->end;
154 // Search for the first interval that we can't merge with.
155 Ranges::iterator MergeTo = next(I);
156 for (; MergeTo != ranges.end() && NewEnd >= MergeTo->end; ++MergeTo) {
157 assert(MergeTo->valno == ValNo && "Cannot merge with differing values!");
160 // If NewEnd was in the middle of an interval, make sure to get its endpoint.
161 I->end = std::max(NewEnd, prior(MergeTo)->end);
163 // Erase any dead ranges.
164 ranges.erase(next(I), MergeTo);
167 ValNo->removeKills(OldEnd, I->end.getPrevSlot());
169 // If the newly formed range now touches the range after it and if they have
170 // the same value number, merge the two ranges into one range.
171 Ranges::iterator Next = next(I);
172 if (Next != ranges.end() && Next->start <= I->end && Next->valno == ValNo) {
179 /// extendIntervalStartTo - This method is used when we want to extend the range
180 /// specified by I to start at the specified endpoint. To do this, we should
181 /// merge and eliminate all ranges that this will overlap with.
182 LiveInterval::Ranges::iterator
183 LiveInterval::extendIntervalStartTo(Ranges::iterator I, SlotIndex NewStart) {
184 assert(I != ranges.end() && "Not a valid interval!");
185 VNInfo *ValNo = I->valno;
187 // Search for the first interval that we can't merge with.
188 Ranges::iterator MergeTo = I;
190 if (MergeTo == ranges.begin()) {
192 ranges.erase(MergeTo, I);
195 assert(MergeTo->valno == ValNo && "Cannot merge with differing values!");
197 } while (NewStart <= MergeTo->start);
199 // If we start in the middle of another interval, just delete a range and
200 // extend that interval.
201 if (MergeTo->end >= NewStart && MergeTo->valno == ValNo) {
202 MergeTo->end = I->end;
204 // Otherwise, extend the interval right after.
206 MergeTo->start = NewStart;
207 MergeTo->end = I->end;
210 ranges.erase(next(MergeTo), next(I));
214 LiveInterval::iterator
215 LiveInterval::addRangeFrom(LiveRange LR, iterator From) {
216 SlotIndex Start = LR.start, End = LR.end;
217 iterator it = std::upper_bound(From, ranges.end(), Start);
219 // If the inserted interval starts in the middle or right at the end of
220 // another interval, just extend that interval to contain the range of LR.
221 if (it != ranges.begin()) {
222 iterator B = prior(it);
223 if (LR.valno == B->valno) {
224 if (B->start <= Start && B->end >= Start) {
225 extendIntervalEndTo(B, End);
229 // Check to make sure that we are not overlapping two live ranges with
230 // different valno's.
231 assert(B->end <= Start &&
232 "Cannot overlap two LiveRanges with differing ValID's"
233 " (did you def the same reg twice in a MachineInstr?)");
237 // Otherwise, if this range ends in the middle of, or right next to, another
238 // interval, merge it into that interval.
239 if (it != ranges.end()) {
240 if (LR.valno == it->valno) {
241 if (it->start <= End) {
242 it = extendIntervalStartTo(it, Start);
244 // If LR is a complete superset of an interval, we may need to grow its
247 extendIntervalEndTo(it, End);
248 else if (End < it->end)
249 // Overlapping intervals, there might have been a kill here.
250 it->valno->removeKill(End);
254 // Check to make sure that we are not overlapping two live ranges with
255 // different valno's.
256 assert(it->start >= End &&
257 "Cannot overlap two LiveRanges with differing ValID's");
261 // Otherwise, this is just a new range that doesn't interact with anything.
263 return ranges.insert(it, LR);
266 /// isInOneLiveRange - Return true if the range specified is entirely in
267 /// a single LiveRange of the live interval.
268 bool LiveInterval::isInOneLiveRange(SlotIndex Start, SlotIndex End) {
269 Ranges::iterator I = std::upper_bound(ranges.begin(), ranges.end(), Start);
270 if (I == ranges.begin())
273 return I->containsRange(Start, End);
277 /// removeRange - Remove the specified range from this interval. Note that
278 /// the range must be in a single LiveRange in its entirety.
279 void LiveInterval::removeRange(SlotIndex Start, SlotIndex End,
280 bool RemoveDeadValNo) {
281 // Find the LiveRange containing this span.
282 Ranges::iterator I = std::upper_bound(ranges.begin(), ranges.end(), Start);
283 assert(I != ranges.begin() && "Range is not in interval!");
285 assert(I->containsRange(Start, End) && "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 ValNo->removeKills(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) {
307 } while (!valnos.empty() && valnos.back()->isUnused());
309 ValNo->setIsUnused(true);
314 ranges.erase(I); // Removed the whole LiveRange.
320 // Otherwise if the span we are removing is at the end of the LiveRange,
321 // adjust the other way.
323 ValNo->removeKills(Start, End);
328 // Otherwise, we are splitting the LiveRange into two pieces.
329 SlotIndex OldEnd = I->end;
330 I->end = Start; // Trim the old interval.
332 // Insert the new one.
333 ranges.insert(next(I), LiveRange(End, OldEnd, ValNo));
336 /// removeValNo - Remove all the ranges defined by the specified value#.
337 /// Also remove the value# from value# list.
338 void LiveInterval::removeValNo(VNInfo *ValNo) {
340 Ranges::iterator I = ranges.end();
341 Ranges::iterator E = ranges.begin();
344 if (I->valno == ValNo)
347 // Now that ValNo is dead, remove it. If it is the largest value
348 // number, just nuke it (and any other deleted values neighboring it),
349 // otherwise mark it as ~1U so it can be nuked later.
350 if (ValNo->id == getNumValNums()-1) {
353 } while (!valnos.empty() && valnos.back()->isUnused());
355 ValNo->setIsUnused(true);
359 /// getLiveRangeContaining - Return the live range that contains the
360 /// specified index, or null if there is none.
361 LiveInterval::const_iterator
362 LiveInterval::FindLiveRangeContaining(SlotIndex Idx) const {
363 const_iterator It = std::upper_bound(begin(), end(), Idx);
364 if (It != ranges.begin()) {
366 if (It->contains(Idx))
373 LiveInterval::iterator
374 LiveInterval::FindLiveRangeContaining(SlotIndex Idx) {
375 iterator It = std::upper_bound(begin(), end(), Idx);
378 if (It->contains(Idx))
385 /// findDefinedVNInfo - Find the VNInfo defined by the specified
386 /// index (register interval).
387 VNInfo *LiveInterval::findDefinedVNInfoForRegInt(SlotIndex Idx) const {
388 for (LiveInterval::const_vni_iterator i = vni_begin(), e = vni_end();
390 if ((*i)->def == Idx)
397 /// findDefinedVNInfo - Find the VNInfo defined by the specified
398 /// register (stack inteval).
399 VNInfo *LiveInterval::findDefinedVNInfoForStackInt(unsigned reg) const {
400 for (LiveInterval::const_vni_iterator i = vni_begin(), e = vni_end();
402 if ((*i)->getReg() == reg)
408 /// join - Join two live intervals (this, and other) together. This applies
409 /// mappings to the value numbers in the LHS/RHS intervals as specified. If
410 /// the intervals are not joinable, this aborts.
411 void LiveInterval::join(LiveInterval &Other,
412 const int *LHSValNoAssignments,
413 const int *RHSValNoAssignments,
414 SmallVector<VNInfo*, 16> &NewVNInfo,
415 MachineRegisterInfo *MRI) {
416 // Determine if any of our live range values are mapped. This is uncommon, so
417 // we want to avoid the interval scan if not.
418 bool MustMapCurValNos = false;
419 unsigned NumVals = getNumValNums();
420 unsigned NumNewVals = NewVNInfo.size();
421 for (unsigned i = 0; i != NumVals; ++i) {
422 unsigned LHSValID = LHSValNoAssignments[i];
424 (NewVNInfo[LHSValID] && NewVNInfo[LHSValID] != getValNumInfo(i)))
425 MustMapCurValNos = true;
428 // If we have to apply a mapping to our base interval assignment, rewrite it
430 if (MustMapCurValNos) {
431 // Map the first live range.
432 iterator OutIt = begin();
433 OutIt->valno = NewVNInfo[LHSValNoAssignments[OutIt->valno->id]];
435 for (iterator I = OutIt, E = end(); I != E; ++I) {
436 OutIt->valno = NewVNInfo[LHSValNoAssignments[I->valno->id]];
438 // If this live range has the same value # as its immediate predecessor,
439 // and if they are neighbors, remove one LiveRange. This happens when we
440 // have [0,3:0)[4,7:1) and map 0/1 onto the same value #.
441 if (OutIt->valno == (OutIt-1)->valno && (OutIt-1)->end == OutIt->start) {
442 (OutIt-1)->end = OutIt->end;
445 OutIt->start = I->start;
449 // Didn't merge, on to the next one.
454 // If we merge some live ranges, chop off the end.
455 ranges.erase(OutIt, end());
458 // Remember assignements because val# ids are changing.
459 SmallVector<unsigned, 16> OtherAssignments;
460 for (iterator I = Other.begin(), E = Other.end(); I != E; ++I)
461 OtherAssignments.push_back(RHSValNoAssignments[I->valno->id]);
463 // Update val# info. Renumber them and make sure they all belong to this
464 // LiveInterval now. Also remove dead val#'s.
465 unsigned NumValNos = 0;
466 for (unsigned i = 0; i < NumNewVals; ++i) {
467 VNInfo *VNI = NewVNInfo[i];
469 if (NumValNos >= NumVals)
470 valnos.push_back(VNI);
472 valnos[NumValNos] = VNI;
473 VNI->id = NumValNos++; // Renumber val#.
476 if (NumNewVals < NumVals)
477 valnos.resize(NumNewVals); // shrinkify
479 // Okay, now insert the RHS live ranges into the LHS.
480 iterator InsertPos = begin();
481 unsigned RangeNo = 0;
482 for (iterator I = Other.begin(), E = Other.end(); I != E; ++I, ++RangeNo) {
483 // Map the valno in the other live range to the current live range.
484 I->valno = NewVNInfo[OtherAssignments[RangeNo]];
485 assert(I->valno && "Adding a dead range?");
486 InsertPos = addRangeFrom(*I, InsertPos);
487 InsertPos->valno->removeKills(InsertPos->start,
488 InsertPos->end.getPrevSlot());
491 ComputeJoinedWeight(Other);
493 // Update regalloc hint if currently there isn't one.
494 if (TargetRegisterInfo::isVirtualRegister(reg) &&
495 TargetRegisterInfo::isVirtualRegister(Other.reg)) {
496 std::pair<unsigned, unsigned> Hint = MRI->getRegAllocationHint(reg);
497 if (Hint.first == 0 && Hint.second == 0) {
498 std::pair<unsigned, unsigned> OtherHint =
499 MRI->getRegAllocationHint(Other.reg);
500 if (OtherHint.first || OtherHint.second)
501 MRI->setRegAllocationHint(reg, OtherHint.first, OtherHint.second);
506 /// MergeRangesInAsValue - Merge all of the intervals in RHS into this live
507 /// interval as the specified value number. The LiveRanges in RHS are
508 /// allowed to overlap with LiveRanges in the current interval, but only if
509 /// the overlapping LiveRanges have the specified value number.
510 void LiveInterval::MergeRangesInAsValue(const LiveInterval &RHS,
512 // TODO: Make this more efficient.
513 iterator InsertPos = begin();
514 for (const_iterator I = RHS.begin(), E = RHS.end(); I != E; ++I) {
515 // Map the valno in the other live range to the current live range.
517 Tmp.valno = LHSValNo;
518 InsertPos = addRangeFrom(Tmp, InsertPos);
523 /// MergeValueInAsValue - Merge all of the live ranges of a specific val#
524 /// in RHS into this live interval as the specified value number.
525 /// The LiveRanges in RHS are allowed to overlap with LiveRanges in the
526 /// current interval, it will replace the value numbers of the overlaped
527 /// live ranges with the specified value number.
528 void LiveInterval::MergeValueInAsValue(
529 const LiveInterval &RHS,
530 const VNInfo *RHSValNo, VNInfo *LHSValNo) {
531 SmallVector<VNInfo*, 4> ReplacedValNos;
532 iterator IP = begin();
533 for (const_iterator I = RHS.begin(), E = RHS.end(); I != E; ++I) {
534 assert(I->valno == RHS.getValNumInfo(I->valno->id) && "Bad VNInfo");
535 if (I->valno != RHSValNo)
537 SlotIndex Start = I->start, End = I->end;
538 IP = std::upper_bound(IP, end(), Start);
539 // If the start of this range overlaps with an existing liverange, trim it.
540 if (IP != begin() && IP[-1].end > Start) {
541 if (IP[-1].valno != LHSValNo) {
542 ReplacedValNos.push_back(IP[-1].valno);
543 IP[-1].valno = LHSValNo; // Update val#.
546 // Trimmed away the whole range?
547 if (Start >= End) continue;
549 // If the end of this range overlaps with an existing liverange, trim it.
550 if (IP != end() && End > IP->start) {
551 if (IP->valno != LHSValNo) {
552 ReplacedValNos.push_back(IP->valno);
553 IP->valno = LHSValNo; // Update val#.
556 // If this trimmed away the whole range, ignore it.
557 if (Start == End) continue;
560 // Map the valno in the other live range to the current live range.
561 IP = addRangeFrom(LiveRange(Start, End, LHSValNo), IP);
565 SmallSet<VNInfo*, 4> Seen;
566 for (unsigned i = 0, e = ReplacedValNos.size(); i != e; ++i) {
567 VNInfo *V1 = ReplacedValNos[i];
568 if (Seen.insert(V1)) {
570 for (const_iterator I = begin(), E = end(); I != E; ++I)
571 if (I->valno == V1) {
576 // Now that V1 is dead, remove it. If it is the largest value number,
577 // just nuke it (and any other deleted values neighboring it), otherwise
578 // mark it as ~1U so it can be nuked later.
579 if (V1->id == getNumValNums()-1) {
582 } while (!valnos.empty() && valnos.back()->isUnused());
584 V1->setIsUnused(true);
592 /// MergeInClobberRanges - For any live ranges that are not defined in the
593 /// current interval, but are defined in the Clobbers interval, mark them
594 /// used with an unknown definition value.
595 void LiveInterval::MergeInClobberRanges(LiveIntervals &li_,
596 const LiveInterval &Clobbers,
597 VNInfo::Allocator &VNInfoAllocator) {
598 if (Clobbers.empty()) return;
600 DenseMap<VNInfo*, VNInfo*> ValNoMaps;
601 VNInfo *UnusedValNo = 0;
602 iterator IP = begin();
603 for (const_iterator I = Clobbers.begin(), E = Clobbers.end(); I != E; ++I) {
604 // For every val# in the Clobbers interval, create a new "unknown" val#.
605 VNInfo *ClobberValNo = 0;
606 DenseMap<VNInfo*, VNInfo*>::iterator VI = ValNoMaps.find(I->valno);
607 if (VI != ValNoMaps.end())
608 ClobberValNo = VI->second;
609 else if (UnusedValNo)
610 ClobberValNo = UnusedValNo;
612 UnusedValNo = ClobberValNo =
613 getNextValue(li_.getInvalidIndex(), 0, false, VNInfoAllocator);
614 ValNoMaps.insert(std::make_pair(I->valno, ClobberValNo));
618 SlotIndex Start = I->start, End = I->end;
619 // If a clobber range starts before an existing range and ends after
620 // it, the clobber range will need to be split into multiple ranges.
621 // Loop until the entire clobber range is handled.
624 IP = std::upper_bound(IP, end(), Start);
625 SlotIndex SubRangeStart = Start;
626 SlotIndex SubRangeEnd = End;
628 // If the start of this range overlaps with an existing liverange, trim it.
629 if (IP != begin() && IP[-1].end > SubRangeStart) {
630 SubRangeStart = IP[-1].end;
631 // Trimmed away the whole range?
632 if (SubRangeStart >= SubRangeEnd) continue;
634 // If the end of this range overlaps with an existing liverange, trim it.
635 if (IP != end() && SubRangeEnd > IP->start) {
636 // If the clobber live range extends beyond the existing live range,
637 // it'll need at least another live range, so set the flag to keep
639 if (SubRangeEnd > IP->end) {
643 SubRangeEnd = IP->start;
644 // If this trimmed away the whole range, ignore it.
645 if (SubRangeStart == SubRangeEnd) continue;
648 // Insert the clobber interval.
649 IP = addRangeFrom(LiveRange(SubRangeStart, SubRangeEnd, ClobberValNo),
656 // Delete the last unused val#.
661 void LiveInterval::MergeInClobberRange(LiveIntervals &li_,
664 VNInfo::Allocator &VNInfoAllocator) {
665 // Find a value # to use for the clobber ranges. If there is already a value#
666 // for unknown values, use it.
667 VNInfo *ClobberValNo =
668 getNextValue(li_.getInvalidIndex(), 0, false, VNInfoAllocator);
670 iterator IP = begin();
671 IP = std::upper_bound(IP, end(), Start);
673 // If the start of this range overlaps with an existing liverange, trim it.
674 if (IP != begin() && IP[-1].end > Start) {
676 // Trimmed away the whole range?
677 if (Start >= End) return;
679 // If the end of this range overlaps with an existing liverange, trim it.
680 if (IP != end() && End > IP->start) {
682 // If this trimmed away the whole range, ignore it.
683 if (Start == End) return;
686 // Insert the clobber interval.
687 addRangeFrom(LiveRange(Start, End, ClobberValNo), IP);
690 /// MergeValueNumberInto - This method is called when two value nubmers
691 /// are found to be equivalent. This eliminates V1, replacing all
692 /// LiveRanges with the V1 value number with the V2 value number. This can
693 /// cause merging of V1/V2 values numbers and compaction of the value space.
694 VNInfo* LiveInterval::MergeValueNumberInto(VNInfo *V1, VNInfo *V2) {
695 assert(V1 != V2 && "Identical value#'s are always equivalent!");
697 // This code actually merges the (numerically) larger value number into the
698 // smaller value number, which is likely to allow us to compactify the value
699 // space. The only thing we have to be careful of is to preserve the
700 // instruction that defines the result value.
702 // Make sure V2 is smaller than V1.
703 if (V1->id < V2->id) {
708 // Merge V1 live ranges into V2.
709 for (iterator I = begin(); I != end(); ) {
711 if (LR->valno != V1) continue; // Not a V1 LiveRange.
713 // Okay, we found a V1 live range. If it had a previous, touching, V2 live
716 iterator Prev = LR-1;
717 if (Prev->valno == V2 && Prev->end == LR->start) {
720 // Erase this live-range.
727 // Okay, now we have a V1 or V2 live range that is maximally merged forward.
728 // Ensure that it is a V2 live-range.
731 // If we can merge it into later V2 live ranges, do so now. We ignore any
732 // following V1 live ranges, as they will be merged in subsequent iterations
735 if (I->start == LR->end && I->valno == V2) {
743 // Now that V1 is dead, remove it. If it is the largest value number, just
744 // nuke it (and any other deleted values neighboring it), otherwise mark it as
745 // ~1U so it can be nuked later.
746 if (V1->id == getNumValNums()-1) {
749 } while (valnos.back()->isUnused());
751 V1->setIsUnused(true);
757 void LiveInterval::Copy(const LiveInterval &RHS,
758 MachineRegisterInfo *MRI,
759 VNInfo::Allocator &VNInfoAllocator) {
762 std::pair<unsigned, unsigned> Hint = MRI->getRegAllocationHint(RHS.reg);
763 MRI->setRegAllocationHint(reg, Hint.first, Hint.second);
766 for (unsigned i = 0, e = RHS.getNumValNums(); i != e; ++i) {
767 const VNInfo *VNI = RHS.getValNumInfo(i);
768 createValueCopy(VNI, VNInfoAllocator);
770 for (unsigned i = 0, e = RHS.ranges.size(); i != e; ++i) {
771 const LiveRange &LR = RHS.ranges[i];
772 addRange(LiveRange(LR.start, LR.end, getValNumInfo(LR.valno->id)));
776 unsigned LiveInterval::getSize() const {
778 for (const_iterator I = begin(), E = end(); I != E; ++I)
779 Sum += I->start.distance(I->end);
783 /// ComputeJoinedWeight - Set the weight of a live interval Joined
784 /// after Other has been merged into it.
785 void LiveInterval::ComputeJoinedWeight(const LiveInterval &Other) {
786 // If either of these intervals was spilled, the weight is the
787 // weight of the non-spilled interval. This can only happen with
788 // iterative coalescers.
790 if (Other.weight != HUGE_VALF) {
791 weight += Other.weight;
793 else if (weight == HUGE_VALF &&
794 !TargetRegisterInfo::isPhysicalRegister(reg)) {
795 // Remove this assert if you have an iterative coalescer
796 assert(0 && "Joining to spilled interval");
797 weight = Other.weight;
800 // Otherwise the weight stays the same
801 // Remove this assert if you have an iterative coalescer
802 assert(0 && "Joining from spilled interval");
806 raw_ostream& llvm::operator<<(raw_ostream& os, const LiveRange &LR) {
807 return os << '[' << LR.start << ',' << LR.end << ':' << LR.valno->id << ")";
810 void LiveRange::dump() const {
811 dbgs() << *this << "\n";
814 void LiveInterval::print(raw_ostream &OS, const TargetRegisterInfo *TRI) const {
816 OS << "SS#" << getStackSlotIndex();
817 else if (TRI && TargetRegisterInfo::isPhysicalRegister(reg))
818 OS << TRI->getName(reg);
828 for (LiveInterval::Ranges::const_iterator I = ranges.begin(),
829 E = ranges.end(); I != E; ++I) {
831 assert(I->valno == getValNumInfo(I->valno->id) && "Bad VNInfo");
835 // Print value number info.
836 if (getNumValNums()) {
839 for (const_vni_iterator i = vni_begin(), e = vni_end(); i != e;
841 const VNInfo *vni = *i;
844 if (vni->isUnused()) {
847 if (!vni->isDefAccurate() && !vni->isPHIDef())
851 unsigned ee = vni->kills.size();
852 if (ee || vni->hasPHIKill()) {
854 for (unsigned j = 0; j != ee; ++j) {
859 if (vni->hasPHIKill()) {
871 void LiveInterval::dump() const {
872 dbgs() << *this << "\n";
876 void LiveRange::print(raw_ostream &os) const {