1 //===-- llvm/CodeGen/LiveInterval.h - Interval representation ---*- C++ -*-===//
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 #ifndef LLVM_CODEGEN_LIVEINTERVAL_H
22 #define LLVM_CODEGEN_LIVEINTERVAL_H
24 #include "llvm/ADT/IntEqClasses.h"
25 #include "llvm/CodeGen/SlotIndexes.h"
26 #include "llvm/Support/AlignOf.h"
27 #include "llvm/Support/Allocator.h"
35 class MachineRegisterInfo;
36 class TargetRegisterInfo;
39 /// VNInfo - Value Number Information.
40 /// This class holds information about a machine level values, including
41 /// definition and use points.
45 typedef BumpPtrAllocator Allocator;
47 /// The ID number of this value.
50 /// The index of the defining instruction.
53 /// VNInfo constructor.
54 VNInfo(unsigned i, SlotIndex d)
58 /// VNInfo construtor, copies values from orig, except for the value number.
59 VNInfo(unsigned i, const VNInfo &orig)
60 : id(i), def(orig.def)
63 /// Copy from the parameter into this VNInfo.
64 void copyFrom(VNInfo &src) {
68 /// Returns true if this value is defined by a PHI instruction (or was,
69 /// PHI instrucions may have been eliminated).
70 /// PHI-defs begin at a block boundary, all other defs begin at register or
72 bool isPHIDef() const { return def.isBlock(); }
74 /// Returns true if this value is unused.
75 bool isUnused() const { return !def.isValid(); }
77 /// Mark this value as unused.
78 void markUnused() { def = SlotIndex(); }
81 /// LiveRange structure - This represents a simple register range in the
82 /// program, with an inclusive start point and an exclusive end point.
83 /// These ranges are rendered as [start,end).
85 SlotIndex start; // Start point of the interval (inclusive)
86 SlotIndex end; // End point of the interval (exclusive)
87 VNInfo *valno; // identifier for the value contained in this interval.
89 LiveRange() : valno(0) {}
91 LiveRange(SlotIndex S, SlotIndex E, VNInfo *V)
92 : start(S), end(E), valno(V) {
93 assert(S < E && "Cannot create empty or backwards range");
96 /// contains - Return true if the index is covered by this range.
98 bool contains(SlotIndex I) const {
99 return start <= I && I < end;
102 /// containsRange - Return true if the given range, [S, E), is covered by
104 bool containsRange(SlotIndex S, SlotIndex E) const {
105 assert((S < E) && "Backwards interval?");
106 return (start <= S && S < end) && (start < E && E <= end);
109 bool operator<(const LiveRange &LR) const {
110 return start < LR.start || (start == LR.start && end < LR.end);
112 bool operator==(const LiveRange &LR) const {
113 return start == LR.start && end == LR.end;
117 void print(raw_ostream &os) const;
120 template <> struct isPodLike<LiveRange> { static const bool value = true; };
122 raw_ostream& operator<<(raw_ostream& os, const LiveRange &LR);
125 inline bool operator<(SlotIndex V, const LiveRange &LR) {
129 inline bool operator<(const LiveRange &LR, SlotIndex V) {
133 /// LiveInterval - This class represents some number of live ranges for a
134 /// register or value. This class also contains a bit of register allocator
139 typedef SmallVector<LiveRange,4> Ranges;
140 typedef SmallVector<VNInfo*,4> VNInfoList;
142 const unsigned reg; // the register or stack slot of this interval.
143 float weight; // weight of this interval
144 Ranges ranges; // the ranges in which this register is live
145 VNInfoList valnos; // value#'s
147 LiveInterval(unsigned Reg, float Weight)
148 : reg(Reg), weight(Weight) {}
150 typedef Ranges::iterator iterator;
151 iterator begin() { return ranges.begin(); }
152 iterator end() { return ranges.end(); }
154 typedef Ranges::const_iterator const_iterator;
155 const_iterator begin() const { return ranges.begin(); }
156 const_iterator end() const { return ranges.end(); }
158 typedef VNInfoList::iterator vni_iterator;
159 vni_iterator vni_begin() { return valnos.begin(); }
160 vni_iterator vni_end() { return valnos.end(); }
162 typedef VNInfoList::const_iterator const_vni_iterator;
163 const_vni_iterator vni_begin() const { return valnos.begin(); }
164 const_vni_iterator vni_end() const { return valnos.end(); }
166 /// advanceTo - Advance the specified iterator to point to the LiveRange
167 /// containing the specified position, or end() if the position is past the
168 /// end of the interval. If no LiveRange contains this position, but the
169 /// position is in a hole, this method returns an iterator pointing to the
170 /// LiveRange immediately after the hole.
171 iterator advanceTo(iterator I, SlotIndex Pos) {
173 if (Pos >= endIndex())
175 while (I->end <= Pos) ++I;
179 /// find - Return an iterator pointing to the first range that ends after
180 /// Pos, or end(). This is the same as advanceTo(begin(), Pos), but faster
181 /// when searching large intervals.
183 /// If Pos is contained in a LiveRange, that range is returned.
184 /// If Pos is in a hole, the following LiveRange is returned.
185 /// If Pos is beyond endIndex, end() is returned.
186 iterator find(SlotIndex Pos);
188 const_iterator find(SlotIndex Pos) const {
189 return const_cast<LiveInterval*>(this)->find(Pos);
197 bool hasAtLeastOneValue() const { return !valnos.empty(); }
199 bool containsOneValue() const { return valnos.size() == 1; }
201 unsigned getNumValNums() const { return (unsigned)valnos.size(); }
203 /// getValNumInfo - Returns pointer to the specified val#.
205 inline VNInfo *getValNumInfo(unsigned ValNo) {
206 return valnos[ValNo];
208 inline const VNInfo *getValNumInfo(unsigned ValNo) const {
209 return valnos[ValNo];
212 /// containsValue - Returns true if VNI belongs to this interval.
213 bool containsValue(const VNInfo *VNI) const {
214 return VNI && VNI->id < getNumValNums() && VNI == getValNumInfo(VNI->id);
217 /// getNextValue - Create a new value number and return it. MIIdx specifies
218 /// the instruction that defines the value number.
219 VNInfo *getNextValue(SlotIndex def, VNInfo::Allocator &VNInfoAllocator) {
221 new (VNInfoAllocator) VNInfo((unsigned)valnos.size(), def);
222 valnos.push_back(VNI);
226 /// createDeadDef - Make sure the interval has a value defined at Def.
227 /// If one already exists, return it. Otherwise allocate a new value and
228 /// add liveness for a dead def.
229 VNInfo *createDeadDef(SlotIndex Def, VNInfo::Allocator &VNInfoAllocator);
231 /// Create a copy of the given value. The new value will be identical except
232 /// for the Value number.
233 VNInfo *createValueCopy(const VNInfo *orig,
234 VNInfo::Allocator &VNInfoAllocator) {
236 new (VNInfoAllocator) VNInfo((unsigned)valnos.size(), *orig);
237 valnos.push_back(VNI);
241 /// RenumberValues - Renumber all values in order of appearance and remove
243 void RenumberValues();
245 /// MergeValueNumberInto - This method is called when two value nubmers
246 /// are found to be equivalent. This eliminates V1, replacing all
247 /// LiveRanges with the V1 value number with the V2 value number. This can
248 /// cause merging of V1/V2 values numbers and compaction of the value space.
249 VNInfo* MergeValueNumberInto(VNInfo *V1, VNInfo *V2);
251 /// MergeValueInAsValue - Merge all of the live ranges of a specific val#
252 /// in RHS into this live interval as the specified value number.
253 /// The LiveRanges in RHS are allowed to overlap with LiveRanges in the
254 /// current interval, it will replace the value numbers of the overlaped
255 /// live ranges with the specified value number.
256 void MergeRangesInAsValue(const LiveInterval &RHS, VNInfo *LHSValNo);
258 /// MergeValueInAsValue - Merge all of the live ranges of a specific val#
259 /// in RHS into this live interval as the specified value number.
260 /// The LiveRanges in RHS are allowed to overlap with LiveRanges in the
261 /// current interval, but only if the overlapping LiveRanges have the
262 /// specified value number.
263 void MergeValueInAsValue(const LiveInterval &RHS,
264 const VNInfo *RHSValNo, VNInfo *LHSValNo);
266 bool empty() const { return ranges.empty(); }
268 /// beginIndex - Return the lowest numbered slot covered by interval.
269 SlotIndex beginIndex() const {
270 assert(!empty() && "Call to beginIndex() on empty interval.");
271 return ranges.front().start;
274 /// endNumber - return the maximum point of the interval of the whole,
276 SlotIndex endIndex() const {
277 assert(!empty() && "Call to endIndex() on empty interval.");
278 return ranges.back().end;
281 bool expiredAt(SlotIndex index) const {
282 return index >= endIndex();
285 bool liveAt(SlotIndex index) const {
286 const_iterator r = find(index);
287 return r != end() && r->start <= index;
290 /// Return true if a live range ends at the instruction at this index. Note
291 /// that the kill point is not contained in the half-open live range. It is
292 /// usually the EarlyClobber or Register slot following its last use.
293 bool isKilledAtInstr(SlotIndex index) const {
294 SlotIndex BaseIdx = index.getBaseIndex();
295 const_iterator r = find(BaseIdx);
296 return r != end() && r->end.getBaseIndex() == BaseIdx;
299 /// getLiveRangeContaining - Return the live range that contains the
300 /// specified index, or null if there is none.
301 const LiveRange *getLiveRangeContaining(SlotIndex Idx) const {
302 const_iterator I = FindLiveRangeContaining(Idx);
303 return I == end() ? 0 : &*I;
306 /// getLiveRangeContaining - Return the live range that contains the
307 /// specified index, or null if there is none.
308 LiveRange *getLiveRangeContaining(SlotIndex Idx) {
309 iterator I = FindLiveRangeContaining(Idx);
310 return I == end() ? 0 : &*I;
313 /// getVNInfoAt - Return the VNInfo that is live at Idx, or NULL.
314 VNInfo *getVNInfoAt(SlotIndex Idx) const {
315 const_iterator I = FindLiveRangeContaining(Idx);
316 return I == end() ? 0 : I->valno;
319 /// getVNInfoBefore - Return the VNInfo that is live up to but not
320 /// necessarilly including Idx, or NULL. Use this to find the reaching def
321 /// used by an instruction at this SlotIndex position.
322 VNInfo *getVNInfoBefore(SlotIndex Idx) const {
323 const_iterator I = FindLiveRangeContaining(Idx.getPrevSlot());
324 return I == end() ? 0 : I->valno;
327 /// FindLiveRangeContaining - Return an iterator to the live range that
328 /// contains the specified index, or end() if there is none.
329 iterator FindLiveRangeContaining(SlotIndex Idx) {
330 iterator I = find(Idx);
331 return I != end() && I->start <= Idx ? I : end();
334 const_iterator FindLiveRangeContaining(SlotIndex Idx) const {
335 const_iterator I = find(Idx);
336 return I != end() && I->start <= Idx ? I : end();
339 /// overlaps - Return true if the intersection of the two live intervals is
341 bool overlaps(const LiveInterval& other) const {
344 return overlapsFrom(other, other.begin());
347 /// overlaps - Return true if the two intervals have overlapping segments
348 /// that are not coalescable according to CP.
350 /// Overlapping segments where one interval is defined by a coalescable
351 /// copy are allowed.
352 bool overlaps(const LiveInterval &Other, const CoalescerPair &CP,
353 const SlotIndexes&) const;
355 /// overlaps - Return true if the live interval overlaps a range specified
357 bool overlaps(SlotIndex Start, SlotIndex End) const;
359 /// overlapsFrom - Return true if the intersection of the two live intervals
360 /// is not empty. The specified iterator is a hint that we can begin
361 /// scanning the Other interval starting at I.
362 bool overlapsFrom(const LiveInterval& other, const_iterator I) const;
364 /// addRange - Add the specified LiveRange to this interval, merging
365 /// intervals as appropriate. This returns an iterator to the inserted live
366 /// range (which may have grown since it was inserted.
367 iterator addRange(LiveRange LR) {
368 return addRangeFrom(LR, ranges.begin());
371 /// extendInBlock - If this interval is live before Kill in the basic block
372 /// that starts at StartIdx, extend it to be live up to Kill, and return
373 /// the value. If there is no live range before Kill, return NULL.
374 VNInfo *extendInBlock(SlotIndex StartIdx, SlotIndex Kill);
376 /// join - Join two live intervals (this, and other) together. This applies
377 /// mappings to the value numbers in the LHS/RHS intervals as specified. If
378 /// the intervals are not joinable, this aborts.
379 void join(LiveInterval &Other,
380 const int *ValNoAssignments,
381 const int *RHSValNoAssignments,
382 SmallVectorImpl<VNInfo *> &NewVNInfo,
383 MachineRegisterInfo *MRI);
385 /// True iff this live range is a single segment that lies between the
386 /// specified boundaries, exclusively. Vregs live across a backedge are not
387 /// considered local. The boundaries are expected to lie within an extended
388 /// basic block, so vregs that are not live out should contain no holes.
389 bool isLocal(SlotIndex Start, SlotIndex End) const {
390 return beginIndex() > Start.getBaseIndex() &&
391 endIndex() < End.getBoundaryIndex();
394 /// removeRange - Remove the specified range from this interval. Note that
395 /// the range must be a single LiveRange in its entirety.
396 void removeRange(SlotIndex Start, SlotIndex End,
397 bool RemoveDeadValNo = false);
399 void removeRange(LiveRange LR, bool RemoveDeadValNo = false) {
400 removeRange(LR.start, LR.end, RemoveDeadValNo);
403 /// removeValNo - Remove all the ranges defined by the specified value#.
404 /// Also remove the value# from value# list.
405 void removeValNo(VNInfo *ValNo);
407 /// getSize - Returns the sum of sizes of all the LiveRange's.
409 unsigned getSize() const;
411 /// Returns true if the live interval is zero length, i.e. no live ranges
412 /// span instructions. It doesn't pay to spill such an interval.
413 bool isZeroLength(SlotIndexes *Indexes) const {
414 for (const_iterator i = begin(), e = end(); i != e; ++i)
415 if (Indexes->getNextNonNullIndex(i->start).getBaseIndex() <
416 i->end.getBaseIndex())
421 /// isSpillable - Can this interval be spilled?
422 bool isSpillable() const {
423 return weight != HUGE_VALF;
426 /// markNotSpillable - Mark interval as not spillable
427 void markNotSpillable() {
431 bool operator<(const LiveInterval& other) const {
432 const SlotIndex &thisIndex = beginIndex();
433 const SlotIndex &otherIndex = other.beginIndex();
434 return (thisIndex < otherIndex ||
435 (thisIndex == otherIndex && reg < other.reg));
438 void print(raw_ostream &OS) const;
441 /// \brief Walk the interval and assert if any invariants fail to hold.
443 /// Note that this is a no-op when asserts are disabled.
445 void verify() const {}
452 Ranges::iterator addRangeFrom(LiveRange LR, Ranges::iterator From);
453 void extendIntervalEndTo(Ranges::iterator I, SlotIndex NewEnd);
454 Ranges::iterator extendIntervalStartTo(Ranges::iterator I, SlotIndex NewStr);
455 void markValNoForDeletion(VNInfo *V);
457 LiveInterval& operator=(const LiveInterval& rhs) LLVM_DELETED_FUNCTION;
461 inline raw_ostream &operator<<(raw_ostream &OS, const LiveInterval &LI) {
466 /// Helper class for performant LiveInterval bulk updates.
468 /// Calling LiveInterval::addRange() repeatedly can be expensive on large
469 /// live ranges because segments after the insertion point may need to be
470 /// shifted. The LiveRangeUpdater class can defer the shifting when adding
471 /// many segments in order.
473 /// The LiveInterval will be in an invalid state until flush() is called.
474 class LiveRangeUpdater {
477 LiveInterval::iterator WriteI;
478 LiveInterval::iterator ReadI;
479 SmallVector<LiveRange, 16> Spills;
483 /// Create a LiveRangeUpdater for adding segments to LI.
484 /// LI will temporarily be in an invalid state until flush() is called.
485 LiveRangeUpdater(LiveInterval *li = 0) : LI(li) {}
487 ~LiveRangeUpdater() { flush(); }
489 /// Add a segment to LI and coalesce when possible, just like LI.addRange().
490 /// Segments should be added in increasing start order for best performance.
493 void add(SlotIndex Start, SlotIndex End, VNInfo *VNI) {
494 add(LiveRange(Start, End, VNI));
497 /// Return true if the LI is currently in an invalid state, and flush()
498 /// needs to be called.
499 bool isDirty() const { return LastStart.isValid(); }
501 /// Flush the updater state to LI so it is valid and contains all added
505 /// Select a different destination live range.
506 void setDest(LiveInterval *li) {
507 if (LI != li && isDirty())
512 /// Get the current destination live range.
513 LiveInterval *getDest() const { return LI; }
516 void print(raw_ostream&) const;
519 inline raw_ostream &operator<<(raw_ostream &OS, const LiveRangeUpdater &X) {
524 /// LiveRangeQuery - Query information about a live range around a given
525 /// instruction. This class hides the implementation details of live ranges,
526 /// and it should be used as the primary interface for examining live ranges
527 /// around instructions.
529 class LiveRangeQuery {
536 /// Create a LiveRangeQuery for the given live range and instruction index.
537 /// The sub-instruction slot of Idx doesn't matter, only the instruction it
538 /// refers to is considered.
539 LiveRangeQuery(const LiveInterval &LI, SlotIndex Idx)
540 : EarlyVal(0), LateVal(0), Kill(false) {
541 // Find the segment that enters the instruction.
542 LiveInterval::const_iterator I = LI.find(Idx.getBaseIndex());
543 LiveInterval::const_iterator E = LI.end();
546 // Is this an instruction live-in segment?
547 // If Idx is the start index of a basic block, include live-in segments
548 // that start at Idx.getBaseIndex().
549 if (I->start <= Idx.getBaseIndex()) {
552 // Move to the potentially live-out segment.
553 if (SlotIndex::isSameInstr(Idx, I->end)) {
558 // Special case: A PHIDef value can have its def in the middle of a
559 // segment if the value happens to be live out of the layout
561 // Such a value is not live-in.
562 if (EarlyVal->def == Idx.getBaseIndex())
565 // I now points to the segment that may be live-through, or defined by
566 // this instr. Ignore segments starting after the current instr.
567 if (SlotIndex::isEarlierInstr(Idx, I->start))
573 /// Return the value that is live-in to the instruction. This is the value
574 /// that will be read by the instruction's use operands. Return NULL if no
575 /// value is live-in.
576 VNInfo *valueIn() const {
580 /// Return true if the live-in value is killed by this instruction. This
581 /// means that either the live range ends at the instruction, or it changes
583 bool isKill() const {
587 /// Return true if this instruction has a dead def.
588 bool isDeadDef() const {
589 return EndPoint.isDead();
592 /// Return the value leaving the instruction, if any. This can be a
593 /// live-through value, or a live def. A dead def returns NULL.
594 VNInfo *valueOut() const {
595 return isDeadDef() ? 0 : LateVal;
598 /// Return the value defined by this instruction, if any. This includes
599 /// dead defs, it is the value created by the instruction's def operands.
600 VNInfo *valueDefined() const {
601 return EarlyVal == LateVal ? 0 : LateVal;
604 /// Return the end point of the last live range segment to interact with
605 /// the instruction, if any.
607 /// The end point is an invalid SlotIndex only if the live range doesn't
608 /// intersect the instruction at all.
610 /// The end point may be at or past the end of the instruction's basic
611 /// block. That means the value was live out of the block.
612 SlotIndex endPoint() const {
617 /// ConnectedVNInfoEqClasses - Helper class that can divide VNInfos in a
618 /// LiveInterval into equivalence clases of connected components. A
619 /// LiveInterval that has multiple connected components can be broken into
620 /// multiple LiveIntervals.
622 /// Given a LiveInterval that may have multiple connected components, run:
624 /// unsigned numComps = ConEQ.Classify(LI);
625 /// if (numComps > 1) {
626 /// // allocate numComps-1 new LiveIntervals into LIS[1..]
627 /// ConEQ.Distribute(LIS);
630 class ConnectedVNInfoEqClasses {
632 IntEqClasses EqClass;
634 // Note that values a and b are connected.
635 void Connect(unsigned a, unsigned b);
640 explicit ConnectedVNInfoEqClasses(LiveIntervals &lis) : LIS(lis) {}
642 /// Classify - Classify the values in LI into connected components.
643 /// Return the number of connected components.
644 unsigned Classify(const LiveInterval *LI);
646 /// getEqClass - Classify creates equivalence classes numbered 0..N. Return
647 /// the equivalence class assigned the VNI.
648 unsigned getEqClass(const VNInfo *VNI) const { return EqClass[VNI->id]; }
650 /// Distribute - Distribute values in LIV[0] into a separate LiveInterval
651 /// for each connected component. LIV must have a LiveInterval for each
652 /// connected component. The LiveIntervals in Liv[1..] must be empty.
653 /// Instructions using LIV[0] are rewritten.
654 void Distribute(LiveInterval *LIV[], MachineRegisterInfo &MRI);