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 range 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 ranges can have holes,
15 // i.e. a range might look like [1,20), [50,65), [1000,1001). Each
16 // individual segment is represented as an instance of LiveRange::Segment,
17 // and the whole range is represented as an instance of LiveRange.
19 //===----------------------------------------------------------------------===//
21 #include "llvm/CodeGen/LiveInterval.h"
22 #include "RegisterCoalescer.h"
23 #include "llvm/ADT/DenseMap.h"
24 #include "llvm/ADT/STLExtras.h"
25 #include "llvm/ADT/SmallSet.h"
26 #include "llvm/CodeGen/LiveIntervalAnalysis.h"
27 #include "llvm/CodeGen/MachineRegisterInfo.h"
28 #include "llvm/Support/Debug.h"
29 #include "llvm/Support/Format.h"
30 #include "llvm/Support/raw_ostream.h"
31 #include "llvm/Target/TargetRegisterInfo.h"
35 //===----------------------------------------------------------------------===//
36 // Implementation of various methods necessary for calculation of live ranges.
37 // The implementation of the methods abstracts from the concrete type of the
38 // segment collection.
40 // Implementation of the class follows the Template design pattern. The base
41 // class contains generic algorithms that call collection-specific methods,
42 // which are provided in concrete subclasses. In order to avoid virtual calls
43 // these methods are provided by means of C++ template instantiation.
44 // The base class calls the methods of the subclass through method impl(),
45 // which casts 'this' pointer to the type of the subclass.
47 //===----------------------------------------------------------------------===//
49 template <typename ImplT, typename IteratorT, typename CollectionT>
50 class CalcLiveRangeUtilBase {
55 CalcLiveRangeUtilBase(LiveRange *LR) : LR(LR) {}
58 typedef LiveRange::Segment Segment;
59 typedef IteratorT iterator;
61 VNInfo *createDeadDef(SlotIndex Def, VNInfo::Allocator &VNInfoAllocator) {
62 assert(!Def.isDead() && "Cannot define a value at the dead slot");
64 iterator I = impl().find(Def);
65 if (I == segments().end()) {
66 VNInfo *VNI = LR->getNextValue(Def, VNInfoAllocator);
67 impl().insertAtEnd(Segment(Def, Def.getDeadSlot(), VNI));
71 Segment *S = segmentAt(I);
72 if (SlotIndex::isSameInstr(Def, S->start)) {
73 assert(S->valno->def == S->start && "Inconsistent existing value def");
75 // It is possible to have both normal and early-clobber defs of the same
76 // register on an instruction. It doesn't make a lot of sense, but it is
77 // possible to specify in inline assembly.
79 // Just convert everything to early-clobber.
80 Def = std::min(Def, S->start);
82 S->start = S->valno->def = Def;
85 assert(SlotIndex::isEarlierInstr(Def, S->start) && "Already live at def");
86 VNInfo *VNI = LR->getNextValue(Def, VNInfoAllocator);
87 segments().insert(I, Segment(Def, Def.getDeadSlot(), VNI));
91 VNInfo *extendInBlock(SlotIndex StartIdx, SlotIndex Use) {
92 if (segments().empty())
95 impl().findInsertPos(Segment(Use.getPrevSlot(), Use, nullptr));
96 if (I == segments().begin())
99 if (I->end <= StartIdx)
102 extendSegmentEndTo(I, Use);
106 /// This method is used when we want to extend the segment specified
107 /// by I to end at the specified endpoint. To do this, we should
108 /// merge and eliminate all segments that this will overlap
109 /// with. The iterator is not invalidated.
110 void extendSegmentEndTo(iterator I, SlotIndex NewEnd) {
111 assert(I != segments().end() && "Not a valid segment!");
112 Segment *S = segmentAt(I);
113 VNInfo *ValNo = I->valno;
115 // Search for the first segment that we can't merge with.
116 iterator MergeTo = std::next(I);
117 for (; MergeTo != segments().end() && NewEnd >= MergeTo->end; ++MergeTo)
118 assert(MergeTo->valno == ValNo && "Cannot merge with differing values!");
120 // If NewEnd was in the middle of a segment, make sure to get its endpoint.
121 S->end = std::max(NewEnd, std::prev(MergeTo)->end);
123 // If the newly formed segment now touches the segment after it and if they
124 // have the same value number, merge the two segments into one segment.
125 if (MergeTo != segments().end() && MergeTo->start <= I->end &&
126 MergeTo->valno == ValNo) {
127 S->end = MergeTo->end;
131 // Erase any dead segments.
132 segments().erase(std::next(I), MergeTo);
135 /// This method is used when we want to extend the segment specified
136 /// by I to start at the specified endpoint. To do this, we should
137 /// merge and eliminate all segments that this will overlap with.
138 iterator extendSegmentStartTo(iterator I, SlotIndex NewStart) {
139 assert(I != segments().end() && "Not a valid segment!");
140 Segment *S = segmentAt(I);
141 VNInfo *ValNo = I->valno;
143 // Search for the first segment that we can't merge with.
144 iterator MergeTo = I;
146 if (MergeTo == segments().begin()) {
148 segments().erase(MergeTo, I);
151 assert(MergeTo->valno == ValNo && "Cannot merge with differing values!");
153 } while (NewStart <= MergeTo->start);
155 // If we start in the middle of another segment, just delete a range and
156 // extend that segment.
157 if (MergeTo->end >= NewStart && MergeTo->valno == ValNo) {
158 segmentAt(MergeTo)->end = S->end;
160 // Otherwise, extend the segment right after.
162 Segment *MergeToSeg = segmentAt(MergeTo);
163 MergeToSeg->start = NewStart;
164 MergeToSeg->end = S->end;
167 segments().erase(std::next(MergeTo), std::next(I));
171 iterator addSegment(Segment S) {
172 SlotIndex Start = S.start, End = S.end;
173 iterator I = impl().findInsertPos(S);
175 // If the inserted segment starts in the middle or right at the end of
176 // another segment, just extend that segment to contain the segment of S.
177 if (I != segments().begin()) {
178 iterator B = std::prev(I);
179 if (S.valno == B->valno) {
180 if (B->start <= Start && B->end >= Start) {
181 extendSegmentEndTo(B, End);
185 // Check to make sure that we are not overlapping two live segments with
186 // different valno's.
187 assert(B->end <= Start &&
188 "Cannot overlap two segments with differing ValID's"
189 " (did you def the same reg twice in a MachineInstr?)");
193 // Otherwise, if this segment ends in the middle of, or right next
194 // to, another segment, merge it into that segment.
195 if (I != segments().end()) {
196 if (S.valno == I->valno) {
197 if (I->start <= End) {
198 I = extendSegmentStartTo(I, Start);
200 // If S is a complete superset of a segment, we may need to grow its
203 extendSegmentEndTo(I, End);
207 // Check to make sure that we are not overlapping two live segments with
208 // different valno's.
209 assert(I->start >= End &&
210 "Cannot overlap two segments with differing ValID's");
214 // Otherwise, this is just a new segment that doesn't interact with
217 return segments().insert(I, S);
221 ImplT &impl() { return *static_cast<ImplT *>(this); }
223 CollectionT &segments() { return impl().segmentsColl(); }
225 Segment *segmentAt(iterator I) { return const_cast<Segment *>(&(*I)); }
228 //===----------------------------------------------------------------------===//
229 // Instantiation of the methods for calculation of live ranges
230 // based on a segment vector.
231 //===----------------------------------------------------------------------===//
233 class CalcLiveRangeUtilVector;
234 typedef CalcLiveRangeUtilBase<CalcLiveRangeUtilVector, LiveRange::iterator,
235 LiveRange::Segments> CalcLiveRangeUtilVectorBase;
237 class CalcLiveRangeUtilVector : public CalcLiveRangeUtilVectorBase {
239 CalcLiveRangeUtilVector(LiveRange *LR) : CalcLiveRangeUtilVectorBase(LR) {}
242 friend CalcLiveRangeUtilVectorBase;
244 LiveRange::Segments &segmentsColl() { return LR->segments; }
246 void insertAtEnd(const Segment &S) { LR->segments.push_back(S); }
248 iterator find(SlotIndex Pos) { return LR->find(Pos); }
250 iterator findInsertPos(Segment S) {
251 return std::upper_bound(LR->begin(), LR->end(), S.start);
255 //===----------------------------------------------------------------------===//
256 // Instantiation of the methods for calculation of live ranges
257 // based on a segment set.
258 //===----------------------------------------------------------------------===//
260 class CalcLiveRangeUtilSet;
261 typedef CalcLiveRangeUtilBase<CalcLiveRangeUtilSet,
262 LiveRange::SegmentSet::iterator,
263 LiveRange::SegmentSet> CalcLiveRangeUtilSetBase;
265 class CalcLiveRangeUtilSet : public CalcLiveRangeUtilSetBase {
267 CalcLiveRangeUtilSet(LiveRange *LR) : CalcLiveRangeUtilSetBase(LR) {}
270 friend CalcLiveRangeUtilSetBase;
272 LiveRange::SegmentSet &segmentsColl() { return *LR->segmentSet; }
274 void insertAtEnd(const Segment &S) {
275 LR->segmentSet->insert(LR->segmentSet->end(), S);
278 iterator find(SlotIndex Pos) {
280 LR->segmentSet->upper_bound(Segment(Pos, Pos.getNextSlot(), nullptr));
281 if (I == LR->segmentSet->begin())
283 iterator PrevI = std::prev(I);
284 if (Pos < (*PrevI).end)
289 iterator findInsertPos(Segment S) {
290 iterator I = LR->segmentSet->upper_bound(S);
291 if (I != LR->segmentSet->end() && !(S.start < *I))
297 //===----------------------------------------------------------------------===//
299 //===----------------------------------------------------------------------===//
301 LiveRange::iterator LiveRange::find(SlotIndex Pos) {
302 // This algorithm is basically std::upper_bound.
303 // Unfortunately, std::upper_bound cannot be used with mixed types until we
304 // adopt C++0x. Many libraries can do it, but not all.
305 if (empty() || Pos >= endIndex())
307 iterator I = begin();
310 size_t Mid = Len >> 1;
311 if (Pos < I[Mid].end)
314 I += Mid + 1, Len -= Mid + 1;
319 VNInfo *LiveRange::createDeadDef(SlotIndex Def,
320 VNInfo::Allocator &VNInfoAllocator) {
321 // Use the segment set, if it is available.
322 if (segmentSet != nullptr)
323 return CalcLiveRangeUtilSet(this).createDeadDef(Def, VNInfoAllocator);
324 // Otherwise use the segment vector.
325 return CalcLiveRangeUtilVector(this).createDeadDef(Def, VNInfoAllocator);
328 // overlaps - Return true if the intersection of the two live ranges is
331 // An example for overlaps():
335 // 8: C = A + B ;; last use of A
337 // The live ranges should look like:
343 // A->overlaps(C) should return false since we want to be able to join
346 bool LiveRange::overlapsFrom(const LiveRange& other,
347 const_iterator StartPos) const {
348 assert(!empty() && "empty range");
349 const_iterator i = begin();
350 const_iterator ie = end();
351 const_iterator j = StartPos;
352 const_iterator je = other.end();
354 assert((StartPos->start <= i->start || StartPos == other.begin()) &&
355 StartPos != other.end() && "Bogus start position hint!");
357 if (i->start < j->start) {
358 i = std::upper_bound(i, ie, j->start);
359 if (i != begin()) --i;
360 } else if (j->start < i->start) {
362 if (StartPos != other.end() && StartPos->start <= i->start) {
363 assert(StartPos < other.end() && i < end());
364 j = std::upper_bound(j, je, i->start);
365 if (j != other.begin()) --j;
371 if (j == je) return false;
374 if (i->start > j->start) {
379 if (i->end > j->start)
387 bool LiveRange::overlaps(const LiveRange &Other, const CoalescerPair &CP,
388 const SlotIndexes &Indexes) const {
389 assert(!empty() && "empty range");
393 // Use binary searches to find initial positions.
394 const_iterator I = find(Other.beginIndex());
395 const_iterator IE = end();
398 const_iterator J = Other.find(I->start);
399 const_iterator JE = Other.end();
404 // J has just been advanced to satisfy:
405 assert(J->end >= I->start);
406 // Check for an overlap.
407 if (J->start < I->end) {
408 // I and J are overlapping. Find the later start.
409 SlotIndex Def = std::max(I->start, J->start);
410 // Allow the overlap if Def is a coalescable copy.
412 !CP.isCoalescable(Indexes.getInstructionFromIndex(Def)))
415 // Advance the iterator that ends first to check for more overlaps.
416 if (J->end > I->end) {
420 // Advance J until J->end >= I->start.
424 while (J->end < I->start);
428 /// overlaps - Return true if the live range overlaps an interval specified
430 bool LiveRange::overlaps(SlotIndex Start, SlotIndex End) const {
431 assert(Start < End && "Invalid range");
432 const_iterator I = std::lower_bound(begin(), end(), End);
433 return I != begin() && (--I)->end > Start;
436 bool LiveRange::covers(const LiveRange &Other) const {
438 return Other.empty();
440 const_iterator I = begin();
441 for (const Segment &O : Other.segments) {
442 I = advanceTo(I, O.start);
443 if (I == end() || I->start > O.start)
446 // Check adjacent live segments and see if we can get behind O.end.
447 while (I->end < O.end) {
448 const_iterator Last = I;
449 // Get next segment and abort if it was not adjacent.
451 if (I == end() || Last->end != I->start)
458 /// ValNo is dead, remove it. If it is the largest value number, just nuke it
459 /// (and any other deleted values neighboring it), otherwise mark it as ~1U so
460 /// it can be nuked later.
461 void LiveRange::markValNoForDeletion(VNInfo *ValNo) {
462 if (ValNo->id == getNumValNums()-1) {
465 } while (!valnos.empty() && valnos.back()->isUnused());
471 /// RenumberValues - Renumber all values in order of appearance and delete the
472 /// remaining unused values.
473 void LiveRange::RenumberValues() {
474 SmallPtrSet<VNInfo*, 8> Seen;
476 for (const Segment &S : segments) {
477 VNInfo *VNI = S.valno;
478 if (!Seen.insert(VNI).second)
480 assert(!VNI->isUnused() && "Unused valno used by live segment");
481 VNI->id = (unsigned)valnos.size();
482 valnos.push_back(VNI);
486 void LiveRange::addSegmentToSet(Segment S) {
487 CalcLiveRangeUtilSet(this).addSegment(S);
490 LiveRange::iterator LiveRange::addSegment(Segment S) {
491 // Use the segment set, if it is available.
492 if (segmentSet != nullptr) {
496 // Otherwise use the segment vector.
497 return CalcLiveRangeUtilVector(this).addSegment(S);
500 void LiveRange::append(const Segment S) {
501 // Check that the segment belongs to the back of the list.
502 assert(segments.empty() || segments.back().end <= S.start);
503 segments.push_back(S);
506 /// extendInBlock - If this range is live before Kill in the basic
507 /// block that starts at StartIdx, extend it to be live up to Kill and return
508 /// the value. If there is no live range before Kill, return NULL.
509 VNInfo *LiveRange::extendInBlock(SlotIndex StartIdx, SlotIndex Kill) {
510 // Use the segment set, if it is available.
511 if (segmentSet != nullptr)
512 return CalcLiveRangeUtilSet(this).extendInBlock(StartIdx, Kill);
513 // Otherwise use the segment vector.
514 return CalcLiveRangeUtilVector(this).extendInBlock(StartIdx, Kill);
517 /// Remove the specified segment from this range. Note that the segment must
518 /// be in a single Segment in its entirety.
519 void LiveRange::removeSegment(SlotIndex Start, SlotIndex End,
520 bool RemoveDeadValNo) {
521 // Find the Segment containing this span.
522 iterator I = find(Start);
523 assert(I != end() && "Segment is not in range!");
524 assert(I->containsInterval(Start, End)
525 && "Segment is not entirely in range!");
527 // If the span we are removing is at the start of the Segment, adjust it.
528 VNInfo *ValNo = I->valno;
529 if (I->start == Start) {
531 if (RemoveDeadValNo) {
532 // Check if val# is dead.
534 for (const_iterator II = begin(), EE = end(); II != EE; ++II)
535 if (II != I && II->valno == ValNo) {
540 // Now that ValNo is dead, remove it.
541 markValNoForDeletion(ValNo);
545 segments.erase(I); // Removed the whole Segment.
551 // Otherwise if the span we are removing is at the end of the Segment,
552 // adjust the other way.
558 // Otherwise, we are splitting the Segment into two pieces.
559 SlotIndex OldEnd = I->end;
560 I->end = Start; // Trim the old segment.
562 // Insert the new one.
563 segments.insert(std::next(I), Segment(End, OldEnd, ValNo));
566 /// removeValNo - Remove all the segments defined by the specified value#.
567 /// Also remove the value# from value# list.
568 void LiveRange::removeValNo(VNInfo *ValNo) {
571 iterator E = begin();
574 if (I->valno == ValNo)
577 // Now that ValNo is dead, remove it.
578 markValNoForDeletion(ValNo);
581 void LiveRange::join(LiveRange &Other,
582 const int *LHSValNoAssignments,
583 const int *RHSValNoAssignments,
584 SmallVectorImpl<VNInfo *> &NewVNInfo) {
587 // Determine if any of our values are mapped. This is uncommon, so we want
588 // to avoid the range scan if not.
589 bool MustMapCurValNos = false;
590 unsigned NumVals = getNumValNums();
591 unsigned NumNewVals = NewVNInfo.size();
592 for (unsigned i = 0; i != NumVals; ++i) {
593 unsigned LHSValID = LHSValNoAssignments[i];
595 (NewVNInfo[LHSValID] && NewVNInfo[LHSValID] != getValNumInfo(i))) {
596 MustMapCurValNos = true;
601 // If we have to apply a mapping to our base range assignment, rewrite it now.
602 if (MustMapCurValNos && !empty()) {
603 // Map the first live range.
605 iterator OutIt = begin();
606 OutIt->valno = NewVNInfo[LHSValNoAssignments[OutIt->valno->id]];
607 for (iterator I = std::next(OutIt), E = end(); I != E; ++I) {
608 VNInfo* nextValNo = NewVNInfo[LHSValNoAssignments[I->valno->id]];
609 assert(nextValNo && "Huh?");
611 // If this live range has the same value # as its immediate predecessor,
612 // and if they are neighbors, remove one Segment. This happens when we
613 // have [0,4:0)[4,7:1) and map 0/1 onto the same value #.
614 if (OutIt->valno == nextValNo && OutIt->end == I->start) {
617 // Didn't merge. Move OutIt to the next segment,
619 OutIt->valno = nextValNo;
621 OutIt->start = I->start;
626 // If we merge some segments, chop off the end.
628 segments.erase(OutIt, end());
631 // Rewrite Other values before changing the VNInfo ids.
632 // This can leave Other in an invalid state because we're not coalescing
633 // touching segments that now have identical values. That's OK since Other is
634 // not supposed to be valid after calling join();
635 for (Segment &S : Other.segments)
636 S.valno = NewVNInfo[RHSValNoAssignments[S.valno->id]];
638 // Update val# info. Renumber them and make sure they all belong to this
639 // LiveRange now. Also remove dead val#'s.
640 unsigned NumValNos = 0;
641 for (unsigned i = 0; i < NumNewVals; ++i) {
642 VNInfo *VNI = NewVNInfo[i];
644 if (NumValNos >= NumVals)
645 valnos.push_back(VNI);
647 valnos[NumValNos] = VNI;
648 VNI->id = NumValNos++; // Renumber val#.
651 if (NumNewVals < NumVals)
652 valnos.resize(NumNewVals); // shrinkify
654 // Okay, now insert the RHS live segments into the LHS.
655 LiveRangeUpdater Updater(this);
656 for (Segment &S : Other.segments)
660 /// Merge all of the segments in RHS into this live range as the specified
661 /// value number. The segments in RHS are allowed to overlap with segments in
662 /// the current range, but only if the overlapping segments have the
663 /// specified value number.
664 void LiveRange::MergeSegmentsInAsValue(const LiveRange &RHS,
666 LiveRangeUpdater Updater(this);
667 for (const Segment &S : RHS.segments)
668 Updater.add(S.start, S.end, LHSValNo);
671 /// MergeValueInAsValue - Merge all of the live segments of a specific val#
672 /// in RHS into this live range as the specified value number.
673 /// The segments in RHS are allowed to overlap with segments in the
674 /// current range, it will replace the value numbers of the overlaped
675 /// segments with the specified value number.
676 void LiveRange::MergeValueInAsValue(const LiveRange &RHS,
677 const VNInfo *RHSValNo,
679 LiveRangeUpdater Updater(this);
680 for (const Segment &S : RHS.segments)
681 if (S.valno == RHSValNo)
682 Updater.add(S.start, S.end, LHSValNo);
685 /// MergeValueNumberInto - This method is called when two value nubmers
686 /// are found to be equivalent. This eliminates V1, replacing all
687 /// segments with the V1 value number with the V2 value number. This can
688 /// cause merging of V1/V2 values numbers and compaction of the value space.
689 VNInfo *LiveRange::MergeValueNumberInto(VNInfo *V1, VNInfo *V2) {
690 assert(V1 != V2 && "Identical value#'s are always equivalent!");
692 // This code actually merges the (numerically) larger value number into the
693 // smaller value number, which is likely to allow us to compactify the value
694 // space. The only thing we have to be careful of is to preserve the
695 // instruction that defines the result value.
697 // Make sure V2 is smaller than V1.
698 if (V1->id < V2->id) {
703 // Merge V1 segments into V2.
704 for (iterator I = begin(); I != end(); ) {
706 if (S->valno != V1) continue; // Not a V1 Segment.
708 // Okay, we found a V1 live range. If it had a previous, touching, V2 live
712 if (Prev->valno == V2 && Prev->end == S->start) {
715 // Erase this live-range.
722 // Okay, now we have a V1 or V2 live range that is maximally merged forward.
723 // Ensure that it is a V2 live-range.
726 // If we can merge it into later V2 segments, do so now. We ignore any
727 // following V1 segments, as they will be merged in subsequent iterations
730 if (I->start == S->end && I->valno == V2) {
738 // Now that V1 is dead, remove it.
739 markValNoForDeletion(V1);
744 void LiveRange::flushSegmentSet() {
745 assert(segmentSet != nullptr && "segment set must have been created");
748 "segment set can be used only initially before switching to the array");
749 segments.append(segmentSet->begin(), segmentSet->end());
751 segmentSet = nullptr;
755 void LiveInterval::freeSubRange(SubRange *S) {
757 // Memory was allocated with BumpPtr allocator and is not freed here.
760 void LiveInterval::removeEmptySubRanges() {
761 SubRange **NextPtr = &SubRanges;
762 SubRange *I = *NextPtr;
763 while (I != nullptr) {
769 // Skip empty subranges until we find the first nonempty one.
771 SubRange *Next = I->Next;
774 } while (I != nullptr && I->empty());
779 void LiveInterval::clearSubRanges() {
780 for (SubRange *I = SubRanges, *Next; I != nullptr; I = Next) {
787 /// Helper function for constructMainRangeFromSubranges(): Search the CFG
788 /// backwards until we find a place covered by a LiveRange segment that actually
790 static VNInfo *searchForVNI(const SlotIndexes &Indexes, LiveRange &LR,
791 const MachineBasicBlock *MBB,
792 SmallPtrSetImpl<const MachineBasicBlock*> &Visited) {
793 // We start the search at the end of MBB.
794 SlotIndex EndIdx = Indexes.getMBBEndIdx(MBB);
795 // In our use case we can't live the area covered by the live segments without
796 // finding an actual VNI def.
797 LiveRange::iterator I = LR.find(EndIdx.getPrevSlot());
798 assert(I != LR.end());
799 LiveRange::Segment &S = *I;
800 if (S.valno != nullptr)
803 VNInfo *VNI = nullptr;
804 // Continue at predecessors (we could even go to idom with domtree available).
805 for (const MachineBasicBlock *Pred : MBB->predecessors()) {
806 // Avoid going in circles.
807 if (!Visited.insert(Pred).second)
810 VNI = searchForVNI(Indexes, LR, Pred, Visited);
811 if (VNI != nullptr) {
820 static void determineMissingVNIs(const SlotIndexes &Indexes, LiveInterval &LI) {
821 SmallPtrSet<const MachineBasicBlock*, 5> Visited;
822 for (LiveRange::Segment &S : LI.segments) {
823 if (S.valno != nullptr)
825 // This can only happen at the begin of a basic block.
826 assert(S.start.isBlock() && "valno should only be missing at block begin");
829 const MachineBasicBlock *MBB = Indexes.getMBBFromIndex(S.start);
830 for (const MachineBasicBlock *Pred : MBB->predecessors()) {
831 VNInfo *VNI = searchForVNI(Indexes, LI, Pred, Visited);
832 if (VNI != nullptr) {
837 assert(S.valno != nullptr && "could not determine valno");
841 void LiveInterval::constructMainRangeFromSubranges(
842 const SlotIndexes &Indexes, VNInfo::Allocator &VNIAllocator) {
843 // The basic observations on which this algorithm is based:
844 // - Each Def/ValNo in a subrange must have a corresponding def on the main
845 // range, but not further defs/valnos are necessary.
846 // - If any of the subranges is live at a point the main liverange has to be
847 // live too, conversily if no subrange is live the main range mustn't be
849 // We do this by scannig through all the subranges simultaneously creating new
850 // segments in the main range as segments start/ends come up in the subranges.
851 assert(hasSubRanges() && "expected subranges to be present");
852 assert(segments.empty() && valnos.empty() && "expected empty main range");
854 // Collect subrange, iterator pairs for the walk and determine first and last
855 // SlotIndex involved.
856 SmallVector<std::pair<const SubRange*, const_iterator>, 4> SRs;
859 for (const SubRange &SR : subranges()) {
862 SRs.push_back(std::make_pair(&SR, SR.begin()));
863 if (!First.isValid() || SR.segments.front().start < First)
864 First = SR.segments.front().start;
865 if (!Last.isValid() || SR.segments.back().end > Last)
866 Last = SR.segments.back().end;
869 // Walk over all subranges simultaneously.
870 Segment CurrentSegment;
871 bool ConstructingSegment = false;
872 bool NeedVNIFixup = false;
873 unsigned ActiveMask = 0;
874 SlotIndex Pos = First;
876 SlotIndex NextPos = Last;
882 // Which subregister lanes are affected by the current event.
883 unsigned EventMask = 0;
884 // Whether a BEGIN_SEGMENT is also a valno definition point.
886 // Find the next begin or end of a subrange segment. Combine masks if we
887 // have multiple begins/ends at the same position. Ends take precedence over
889 for (auto &SRP : SRs) {
890 const SubRange &SR = *SRP.first;
891 const_iterator &I = SRP.second;
892 // Advance iterator of subrange to a segment involving Pos; the earlier
893 // segments are already merged at this point.
894 while (I != SR.end() &&
896 (I->end == Pos && (ActiveMask & SR.LaneMask) == 0)))
900 if ((ActiveMask & SR.LaneMask) == 0 &&
901 Pos <= I->start && I->start <= NextPos) {
902 // Merge multiple begins at the same position.
903 if (I->start == NextPos && Event == BEGIN_SEGMENT) {
904 EventMask |= SR.LaneMask;
905 IsDef |= I->valno->def == I->start;
906 } else if (I->start < NextPos || Event != END_SEGMENT) {
907 Event = BEGIN_SEGMENT;
909 EventMask = SR.LaneMask;
910 IsDef = I->valno->def == I->start;
913 if ((ActiveMask & SR.LaneMask) != 0 &&
914 Pos <= I->end && I->end <= NextPos) {
915 // Merge multiple ends at the same position.
916 if (I->end == NextPos && Event == END_SEGMENT)
917 EventMask |= SR.LaneMask;
921 EventMask = SR.LaneMask;
926 // Advance scan position.
928 if (Event == BEGIN_SEGMENT) {
929 if (ConstructingSegment && IsDef) {
930 // Finish previous segment because we have to start a new one.
931 CurrentSegment.end = Pos;
932 append(CurrentSegment);
933 ConstructingSegment = false;
936 // Start a new segment if necessary.
937 if (!ConstructingSegment) {
938 // Determine value number for the segment.
941 VNI = getNextValue(Pos, VNIAllocator);
943 // We have to reuse an existing value number, if we are lucky
944 // then we already passed one of the predecessor blocks and determined
945 // its value number (with blocks in reverse postorder this would be
946 // always true but we have no such guarantee).
947 assert(Pos.isBlock());
948 const MachineBasicBlock *MBB = Indexes.getMBBFromIndex(Pos);
949 // See if any of the predecessor blocks has a lower number and a VNI
950 for (const MachineBasicBlock *Pred : MBB->predecessors()) {
951 SlotIndex PredEnd = Indexes.getMBBEndIdx(Pred);
952 VNI = getVNInfoBefore(PredEnd);
956 // Def will come later: We have to do an extra fixup pass.
961 CurrentSegment.start = Pos;
962 CurrentSegment.valno = VNI;
963 ConstructingSegment = true;
965 ActiveMask |= EventMask;
966 } else if (Event == END_SEGMENT) {
967 assert(ConstructingSegment);
968 // Finish segment if no lane is active anymore.
969 ActiveMask &= ~EventMask;
970 if (ActiveMask == 0) {
971 CurrentSegment.end = Pos;
972 append(CurrentSegment);
973 ConstructingSegment = false;
976 // We reached the end of the last subranges and can stop.
977 assert(Event == NOTHING);
982 // We might not be able to assign new valnos for all segments if the basic
983 // block containing the definition comes after a segment using the valno.
984 // Do a fixup pass for this uncommon case.
986 determineMissingVNIs(Indexes, *this);
988 assert(ActiveMask == 0 && !ConstructingSegment && "all segments ended");
992 unsigned LiveInterval::getSize() const {
994 for (const Segment &S : segments)
995 Sum += S.start.distance(S.end);
999 raw_ostream& llvm::operator<<(raw_ostream& os, const LiveRange::Segment &S) {
1000 return os << '[' << S.start << ',' << S.end << ':' << S.valno->id << ")";
1003 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1004 void LiveRange::Segment::dump() const {
1005 dbgs() << *this << "\n";
1009 void LiveRange::print(raw_ostream &OS) const {
1013 for (const Segment &S : segments) {
1015 assert(S.valno == getValNumInfo(S.valno->id) && "Bad VNInfo");
1019 // Print value number info.
1020 if (getNumValNums()) {
1023 for (const_vni_iterator i = vni_begin(), e = vni_end(); i != e;
1025 const VNInfo *vni = *i;
1026 if (vnum) OS << " ";
1028 if (vni->isUnused()) {
1032 if (vni->isPHIDef())
1039 void LiveInterval::print(raw_ostream &OS) const {
1040 OS << PrintReg(reg) << ' ';
1043 for (const SubRange &SR : subranges()) {
1044 OS << format(" L%04X ", SR.LaneMask) << SR;
1048 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1049 void LiveRange::dump() const {
1050 dbgs() << *this << "\n";
1053 void LiveInterval::dump() const {
1054 dbgs() << *this << "\n";
1059 void LiveRange::verify() const {
1060 for (const_iterator I = begin(), E = end(); I != E; ++I) {
1061 assert(I->start.isValid());
1062 assert(I->end.isValid());
1063 assert(I->start < I->end);
1064 assert(I->valno != nullptr);
1065 assert(I->valno->id < valnos.size());
1066 assert(I->valno == valnos[I->valno->id]);
1067 if (std::next(I) != E) {
1068 assert(I->end <= std::next(I)->start);
1069 if (I->end == std::next(I)->start)
1070 assert(I->valno != std::next(I)->valno);
1075 void LiveInterval::verify(const MachineRegisterInfo *MRI) const {
1078 // Make sure SubRanges are fine and LaneMasks are disjunct.
1080 unsigned MaxMask = MRI != nullptr ? MRI->getMaxLaneMaskForVReg(reg) : ~0u;
1081 for (const SubRange &SR : subranges()) {
1082 // Subrange lanemask should be disjunct to any previous subrange masks.
1083 assert((Mask & SR.LaneMask) == 0);
1084 Mask |= SR.LaneMask;
1086 // subrange mask should not contained in maximum lane mask for the vreg.
1087 assert((Mask & ~MaxMask) == 0);
1090 // Main liverange should cover subrange.
1097 //===----------------------------------------------------------------------===//
1098 // LiveRangeUpdater class
1099 //===----------------------------------------------------------------------===//
1101 // The LiveRangeUpdater class always maintains these invariants:
1103 // - When LastStart is invalid, Spills is empty and the iterators are invalid.
1104 // This is the initial state, and the state created by flush().
1105 // In this state, isDirty() returns false.
1107 // Otherwise, segments are kept in three separate areas:
1109 // 1. [begin; WriteI) at the front of LR.
1110 // 2. [ReadI; end) at the back of LR.
1113 // - LR.begin() <= WriteI <= ReadI <= LR.end().
1114 // - Segments in all three areas are fully ordered and coalesced.
1115 // - Segments in area 1 precede and can't coalesce with segments in area 2.
1116 // - Segments in Spills precede and can't coalesce with segments in area 2.
1117 // - No coalescing is possible between segments in Spills and segments in area
1118 // 1, and there are no overlapping segments.
1120 // The segments in Spills are not ordered with respect to the segments in area
1121 // 1. They need to be merged.
1123 // When they exist, Spills.back().start <= LastStart,
1124 // and WriteI[-1].start <= LastStart.
1126 void LiveRangeUpdater::print(raw_ostream &OS) const {
1129 OS << "Clean updater: " << *LR << '\n';
1131 OS << "Null updater.\n";
1134 assert(LR && "Can't have null LR in dirty updater.");
1135 OS << " updater with gap = " << (ReadI - WriteI)
1136 << ", last start = " << LastStart
1138 for (const auto &S : make_range(LR->begin(), WriteI))
1141 for (unsigned I = 0, E = Spills.size(); I != E; ++I)
1142 OS << ' ' << Spills[I];
1144 for (const auto &S : make_range(ReadI, LR->end()))
1149 void LiveRangeUpdater::dump() const
1154 // Determine if A and B should be coalesced.
1155 static inline bool coalescable(const LiveRange::Segment &A,
1156 const LiveRange::Segment &B) {
1157 assert(A.start <= B.start && "Unordered live segments.");
1158 if (A.end == B.start)
1159 return A.valno == B.valno;
1160 if (A.end < B.start)
1162 assert(A.valno == B.valno && "Cannot overlap different values");
1166 void LiveRangeUpdater::add(LiveRange::Segment Seg) {
1167 assert(LR && "Cannot add to a null destination");
1169 // Fall back to the regular add method if the live range
1170 // is using the segment set instead of the segment vector.
1171 if (LR->segmentSet != nullptr) {
1172 LR->addSegmentToSet(Seg);
1176 // Flush the state if Start moves backwards.
1177 if (!LastStart.isValid() || LastStart > Seg.start) {
1180 // This brings us to an uninitialized state. Reinitialize.
1181 assert(Spills.empty() && "Leftover spilled segments");
1182 WriteI = ReadI = LR->begin();
1185 // Remember start for next time.
1186 LastStart = Seg.start;
1188 // Advance ReadI until it ends after Seg.start.
1189 LiveRange::iterator E = LR->end();
1190 if (ReadI != E && ReadI->end <= Seg.start) {
1191 // First try to close the gap between WriteI and ReadI with spills.
1192 if (ReadI != WriteI)
1194 // Then advance ReadI.
1195 if (ReadI == WriteI)
1196 ReadI = WriteI = LR->find(Seg.start);
1198 while (ReadI != E && ReadI->end <= Seg.start)
1199 *WriteI++ = *ReadI++;
1202 assert(ReadI == E || ReadI->end > Seg.start);
1204 // Check if the ReadI segment begins early.
1205 if (ReadI != E && ReadI->start <= Seg.start) {
1206 assert(ReadI->valno == Seg.valno && "Cannot overlap different values");
1207 // Bail if Seg is completely contained in ReadI.
1208 if (ReadI->end >= Seg.end)
1210 // Coalesce into Seg.
1211 Seg.start = ReadI->start;
1215 // Coalesce as much as possible from ReadI into Seg.
1216 while (ReadI != E && coalescable(Seg, *ReadI)) {
1217 Seg.end = std::max(Seg.end, ReadI->end);
1221 // Try coalescing Spills.back() into Seg.
1222 if (!Spills.empty() && coalescable(Spills.back(), Seg)) {
1223 Seg.start = Spills.back().start;
1224 Seg.end = std::max(Spills.back().end, Seg.end);
1228 // Try coalescing Seg into WriteI[-1].
1229 if (WriteI != LR->begin() && coalescable(WriteI[-1], Seg)) {
1230 WriteI[-1].end = std::max(WriteI[-1].end, Seg.end);
1234 // Seg doesn't coalesce with anything, and needs to be inserted somewhere.
1235 if (WriteI != ReadI) {
1240 // Finally, append to LR or Spills.
1242 LR->segments.push_back(Seg);
1243 WriteI = ReadI = LR->end();
1245 Spills.push_back(Seg);
1248 // Merge as many spilled segments as possible into the gap between WriteI
1249 // and ReadI. Advance WriteI to reflect the inserted instructions.
1250 void LiveRangeUpdater::mergeSpills() {
1251 // Perform a backwards merge of Spills and [SpillI;WriteI).
1252 size_t GapSize = ReadI - WriteI;
1253 size_t NumMoved = std::min(Spills.size(), GapSize);
1254 LiveRange::iterator Src = WriteI;
1255 LiveRange::iterator Dst = Src + NumMoved;
1256 LiveRange::iterator SpillSrc = Spills.end();
1257 LiveRange::iterator B = LR->begin();
1259 // This is the new WriteI position after merging spills.
1262 // Now merge Src and Spills backwards.
1263 while (Src != Dst) {
1264 if (Src != B && Src[-1].start > SpillSrc[-1].start)
1267 *--Dst = *--SpillSrc;
1269 assert(NumMoved == size_t(Spills.end() - SpillSrc));
1270 Spills.erase(SpillSrc, Spills.end());
1273 void LiveRangeUpdater::flush() {
1276 // Clear the dirty state.
1277 LastStart = SlotIndex();
1279 assert(LR && "Cannot add to a null destination");
1281 // Nothing to merge?
1282 if (Spills.empty()) {
1283 LR->segments.erase(WriteI, ReadI);
1288 // Resize the WriteI - ReadI gap to match Spills.
1289 size_t GapSize = ReadI - WriteI;
1290 if (GapSize < Spills.size()) {
1291 // The gap is too small. Make some room.
1292 size_t WritePos = WriteI - LR->begin();
1293 LR->segments.insert(ReadI, Spills.size() - GapSize, LiveRange::Segment());
1294 // This also invalidated ReadI, but it is recomputed below.
1295 WriteI = LR->begin() + WritePos;
1297 // Shrink the gap if necessary.
1298 LR->segments.erase(WriteI + Spills.size(), ReadI);
1300 ReadI = WriteI + Spills.size();
1305 unsigned ConnectedVNInfoEqClasses::Classify(const LiveInterval *LI) {
1306 // Create initial equivalence classes.
1308 EqClass.grow(LI->getNumValNums());
1310 const VNInfo *used = nullptr, *unused = nullptr;
1312 // Determine connections.
1313 for (const VNInfo *VNI : LI->valnos) {
1314 // Group all unused values into one class.
1315 if (VNI->isUnused()) {
1317 EqClass.join(unused->id, VNI->id);
1322 if (VNI->isPHIDef()) {
1323 const MachineBasicBlock *MBB = LIS.getMBBFromIndex(VNI->def);
1324 assert(MBB && "Phi-def has no defining MBB");
1325 // Connect to values live out of predecessors.
1326 for (MachineBasicBlock::const_pred_iterator PI = MBB->pred_begin(),
1327 PE = MBB->pred_end(); PI != PE; ++PI)
1328 if (const VNInfo *PVNI = LI->getVNInfoBefore(LIS.getMBBEndIdx(*PI)))
1329 EqClass.join(VNI->id, PVNI->id);
1331 // Normal value defined by an instruction. Check for two-addr redef.
1332 // FIXME: This could be coincidental. Should we really check for a tied
1333 // operand constraint?
1334 // Note that VNI->def may be a use slot for an early clobber def.
1335 if (const VNInfo *UVNI = LI->getVNInfoBefore(VNI->def))
1336 EqClass.join(VNI->id, UVNI->id);
1340 // Lump all the unused values in with the last used value.
1342 EqClass.join(used->id, unused->id);
1345 return EqClass.getNumClasses();
1348 void ConnectedVNInfoEqClasses::Distribute(LiveInterval *LIV[],
1349 MachineRegisterInfo &MRI) {
1350 assert(LIV[0] && "LIV[0] must be set");
1351 LiveInterval &LI = *LIV[0];
1353 // Rewrite instructions.
1354 for (MachineRegisterInfo::reg_iterator RI = MRI.reg_begin(LI.reg),
1355 RE = MRI.reg_end(); RI != RE;) {
1356 MachineOperand &MO = *RI;
1357 MachineInstr *MI = RI->getParent();
1359 // DBG_VALUE instructions don't have slot indexes, so get the index of the
1360 // instruction before them.
1361 // Normally, DBG_VALUE instructions are removed before this function is
1362 // called, but it is not a requirement.
1364 if (MI->isDebugValue())
1365 Idx = LIS.getSlotIndexes()->getIndexBefore(MI);
1367 Idx = LIS.getInstructionIndex(MI);
1368 LiveQueryResult LRQ = LI.Query(Idx);
1369 const VNInfo *VNI = MO.readsReg() ? LRQ.valueIn() : LRQ.valueDefined();
1370 // In the case of an <undef> use that isn't tied to any def, VNI will be
1371 // NULL. If the use is tied to a def, VNI will be the defined value.
1374 MO.setReg(LIV[getEqClass(VNI)]->reg);
1377 // Move runs to new intervals.
1378 LiveInterval::iterator J = LI.begin(), E = LI.end();
1379 while (J != E && EqClass[J->valno->id] == 0)
1381 for (LiveInterval::iterator I = J; I != E; ++I) {
1382 if (unsigned eq = EqClass[I->valno->id]) {
1383 assert((LIV[eq]->empty() || LIV[eq]->expiredAt(I->start)) &&
1384 "New intervals should be empty");
1385 LIV[eq]->segments.push_back(*I);
1389 // TODO: do not cheat anymore by simply cleaning all subranges
1390 LI.clearSubRanges();
1391 LI.segments.erase(J, E);
1393 // Transfer VNInfos to their new owners and renumber them.
1394 unsigned j = 0, e = LI.getNumValNums();
1395 while (j != e && EqClass[j] == 0)
1397 for (unsigned i = j; i != e; ++i) {
1398 VNInfo *VNI = LI.getValNumInfo(i);
1399 if (unsigned eq = EqClass[i]) {
1400 VNI->id = LIV[eq]->getNumValNums();
1401 LIV[eq]->valnos.push_back(VNI);
1404 LI.valnos[j++] = VNI;
1407 LI.valnos.resize(j);