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/SmallVector.h"
25 #include "llvm/Support/Allocator.h"
31 class TargetRegisterInfo;
34 /// VNInfo - If the value number definition is undefined (e.g. phi
35 /// merge point), it contains ~0u,x. If the value number is not in use, it
36 /// contains ~1u,x to indicate that the value # is not used.
37 /// def - Instruction # of the definition.
38 /// - or reg # of the definition if it's a stack slot liveinterval.
39 /// copy - Copy iff val# is defined by a copy; zero otherwise.
40 /// hasPHIKill - One or more of the kills are PHI nodes.
41 /// kills - Instruction # of the kills.
47 SmallVector<unsigned, 4> kills;
48 VNInfo() : id(~1U), def(~1U), copy(0), hasPHIKill(false) {}
49 VNInfo(unsigned i, unsigned d, MachineInstr *c)
50 : id(i), def(d), copy(c), hasPHIKill(false) {}
53 /// LiveRange structure - This represents a simple register range in the
54 /// program, with an inclusive start point and an exclusive end point.
55 /// These ranges are rendered as [start,end).
57 unsigned start; // Start point of the interval (inclusive)
58 unsigned end; // End point of the interval (exclusive)
59 VNInfo *valno; // identifier for the value contained in this interval.
61 LiveRange(unsigned S, unsigned E, VNInfo *V) : start(S), end(E), valno(V) {
62 assert(S < E && "Cannot create empty or backwards range");
65 /// contains - Return true if the index is covered by this range.
67 bool contains(unsigned I) const {
68 return start <= I && I < end;
71 bool operator<(const LiveRange &LR) const {
72 return start < LR.start || (start == LR.start && end < LR.end);
74 bool operator==(const LiveRange &LR) const {
75 return start == LR.start && end == LR.end;
79 void print(std::ostream &os) const;
80 void print(std::ostream *os) const { if (os) print(*os); }
83 LiveRange(); // DO NOT IMPLEMENT
86 std::ostream& operator<<(std::ostream& os, const LiveRange &LR);
89 inline bool operator<(unsigned V, const LiveRange &LR) {
93 inline bool operator<(const LiveRange &LR, unsigned V) {
97 /// LiveInterval - This class represents some number of live ranges for a
98 /// register or value. This class also contains a bit of register allocator
100 struct LiveInterval {
101 typedef SmallVector<LiveRange,4> Ranges;
102 typedef SmallVector<VNInfo*,4> VNInfoList;
104 unsigned reg; // the register or stack slot of this interval
105 // if the top bits is set, it represents a stack slot.
106 unsigned preference; // preferred register to allocate for this interval
107 float weight; // weight of this interval
108 Ranges ranges; // the ranges in which this register is live
109 VNInfoList valnos; // value#'s
112 LiveInterval(unsigned Reg, float Weight, bool IsSS = false)
113 : reg(Reg), preference(0), weight(Weight) {
115 reg = reg | (1U << (sizeof(unsigned)*8-1));
118 typedef Ranges::iterator iterator;
119 iterator begin() { return ranges.begin(); }
120 iterator end() { return ranges.end(); }
122 typedef Ranges::const_iterator const_iterator;
123 const_iterator begin() const { return ranges.begin(); }
124 const_iterator end() const { return ranges.end(); }
126 typedef VNInfoList::iterator vni_iterator;
127 vni_iterator vni_begin() { return valnos.begin(); }
128 vni_iterator vni_end() { return valnos.end(); }
130 typedef VNInfoList::const_iterator const_vni_iterator;
131 const_vni_iterator vni_begin() const { return valnos.begin(); }
132 const_vni_iterator vni_end() const { return valnos.end(); }
134 /// advanceTo - Advance the specified iterator to point to the LiveRange
135 /// containing the specified position, or end() if the position is past the
136 /// end of the interval. If no LiveRange contains this position, but the
137 /// position is in a hole, this method returns an iterator pointing the the
138 /// LiveRange immediately after the hole.
139 iterator advanceTo(iterator I, unsigned Pos) {
140 if (Pos >= endNumber())
142 while (I->end <= Pos) ++I;
146 /// isStackSlot - Return true if this is a stack slot interval.
148 bool isStackSlot() const {
149 return reg & (1U << (sizeof(unsigned)*8-1));
152 /// getStackSlotIndex - Return stack slot index if this is a stack slot
154 int getStackSlotIndex() const {
155 assert(isStackSlot() && "Interval is not a stack slot interval!");
156 return reg & ~(1U << (sizeof(unsigned)*8-1));
159 bool containsOneValue() const { return valnos.size() == 1; }
161 unsigned getNumValNums() const { return (unsigned)valnos.size(); }
163 /// getValNumInfo - Returns pointer to the specified val#.
165 inline VNInfo *getValNumInfo(unsigned ValNo) {
166 return valnos[ValNo];
168 inline const VNInfo *getValNumInfo(unsigned ValNo) const {
169 return valnos[ValNo];
172 /// copyValNumInfo - Copy the value number info for one value number to
174 void copyValNumInfo(VNInfo *DstValNo, const VNInfo *SrcValNo) {
175 DstValNo->def = SrcValNo->def;
176 DstValNo->copy = SrcValNo->copy;
177 DstValNo->hasPHIKill = SrcValNo->hasPHIKill;
178 DstValNo->kills = SrcValNo->kills;
181 /// getNextValue - Create a new value number and return it. MIIdx specifies
182 /// the instruction that defines the value number.
183 VNInfo *getNextValue(unsigned MIIdx, MachineInstr *CopyMI,
184 BumpPtrAllocator &VNInfoAllocator) {
186 unsigned Alignment = (unsigned)__alignof__(VNInfo);
189 unsigned Alignment = 8;
192 static_cast<VNInfo*>(VNInfoAllocator.Allocate((unsigned)sizeof(VNInfo),
194 new (VNI) VNInfo((unsigned)valnos.size(), MIIdx, CopyMI);
195 valnos.push_back(VNI);
199 /// addKillForValNum - Add a kill instruction index to the specified value
201 static void addKill(VNInfo *VNI, unsigned KillIdx) {
202 SmallVector<unsigned, 4> &kills = VNI->kills;
204 kills.push_back(KillIdx);
206 SmallVector<unsigned, 4>::iterator
207 I = std::lower_bound(kills.begin(), kills.end(), KillIdx);
208 kills.insert(I, KillIdx);
212 /// addKills - Add a number of kills into the VNInfo kill vector. If this
213 /// interval is live at a kill point, then the kill is not added.
214 void addKills(VNInfo *VNI, const SmallVector<unsigned, 4> &kills) {
215 for (unsigned i = 0, e = static_cast<unsigned>(kills.size());
217 unsigned KillIdx = kills[i];
218 if (!liveBeforeAndAt(KillIdx)) {
219 SmallVector<unsigned, 4>::iterator
220 I = std::lower_bound(VNI->kills.begin(), VNI->kills.end(), KillIdx);
221 VNI->kills.insert(I, KillIdx);
226 /// removeKill - Remove the specified kill from the list of kills of
227 /// the specified val#.
228 static bool removeKill(VNInfo *VNI, unsigned KillIdx) {
229 SmallVector<unsigned, 4> &kills = VNI->kills;
230 SmallVector<unsigned, 4>::iterator
231 I = std::lower_bound(kills.begin(), kills.end(), KillIdx);
232 if (I != kills.end() && *I == KillIdx) {
239 /// removeKills - Remove all the kills in specified range
240 /// [Start, End] of the specified val#.
241 void removeKills(VNInfo *VNI, unsigned Start, unsigned End) {
242 SmallVector<unsigned, 4> &kills = VNI->kills;
243 SmallVector<unsigned, 4>::iterator
244 I = std::lower_bound(kills.begin(), kills.end(), Start);
245 SmallVector<unsigned, 4>::iterator
246 E = std::upper_bound(kills.begin(), kills.end(), End);
250 /// isKill - Return true if the specified index is a kill of the
252 bool isKill(const VNInfo *VNI, unsigned KillIdx) const {
253 const SmallVector<unsigned, 4> &kills = VNI->kills;
254 SmallVector<unsigned, 4>::const_iterator
255 I = std::lower_bound(kills.begin(), kills.end(), KillIdx);
256 return I != kills.end() && *I == KillIdx;
259 /// MergeValueNumberInto - This method is called when two value nubmers
260 /// are found to be equivalent. This eliminates V1, replacing all
261 /// LiveRanges with the V1 value number with the V2 value number. This can
262 /// cause merging of V1/V2 values numbers and compaction of the value space.
263 void MergeValueNumberInto(VNInfo *V1, VNInfo *V2);
265 /// MergeInClobberRanges - For any live ranges that are not defined in the
266 /// current interval, but are defined in the Clobbers interval, mark them
267 /// used with an unknown definition value. Caller must pass in reference to
268 /// VNInfoAllocator since it will create a new val#.
269 void MergeInClobberRanges(const LiveInterval &Clobbers,
270 BumpPtrAllocator &VNInfoAllocator);
272 /// MergeValueInAsValue - Merge all of the live ranges of a specific val#
273 /// in RHS into this live interval as the specified value number.
274 /// The LiveRanges in RHS are allowed to overlap with LiveRanges in the
275 /// current interval, it will replace the value numbers of the overlaped
276 /// live ranges with the specified value number.
277 void MergeRangesInAsValue(const LiveInterval &RHS, VNInfo *LHSValNo);
279 /// MergeValueInAsValue - Merge all of the live ranges of a specific val#
280 /// in RHS into this live interval as the specified value number.
281 /// The LiveRanges in RHS are allowed to overlap with LiveRanges in the
282 /// current interval, but only if the overlapping LiveRanges have the
283 /// specified value number.
284 void MergeValueInAsValue(const LiveInterval &RHS,
285 const VNInfo *RHSValNo, VNInfo *LHSValNo);
287 /// Copy - Copy the specified live interval. This copies all the fields
288 /// except for the register of the interval.
289 void Copy(const LiveInterval &RHS, BumpPtrAllocator &VNInfoAllocator);
291 bool empty() const { return ranges.empty(); }
293 /// beginNumber - Return the lowest numbered slot covered by interval.
294 unsigned beginNumber() const {
297 return ranges.front().start;
300 /// endNumber - return the maximum point of the interval of the whole,
302 unsigned endNumber() const {
305 return ranges.back().end;
308 bool expiredAt(unsigned index) const {
309 return index >= endNumber();
312 bool liveAt(unsigned index) const;
314 // liveBeforeAndAt - Check if the interval is live at the index and the
315 // index just before it. If index is liveAt, check if it starts a new live
316 // range.If it does, then check if the previous live range ends at index-1.
317 bool liveBeforeAndAt(unsigned index) const;
319 /// getLiveRangeContaining - Return the live range that contains the
320 /// specified index, or null if there is none.
321 const LiveRange *getLiveRangeContaining(unsigned Idx) const {
322 const_iterator I = FindLiveRangeContaining(Idx);
323 return I == end() ? 0 : &*I;
326 /// FindLiveRangeContaining - Return an iterator to the live range that
327 /// contains the specified index, or end() if there is none.
328 const_iterator FindLiveRangeContaining(unsigned Idx) const;
330 /// FindLiveRangeContaining - Return an iterator to the live range that
331 /// contains the specified index, or end() if there is none.
332 iterator FindLiveRangeContaining(unsigned Idx);
334 /// findDefinedVNInfo - Find the VNInfo that's defined at the specified
335 /// index (register interval) or defined by the specified register (stack
337 VNInfo *findDefinedVNInfo(unsigned DefIdxOrReg) const;
339 /// overlaps - Return true if the intersection of the two live intervals is
341 bool overlaps(const LiveInterval& other) const {
342 return overlapsFrom(other, other.begin());
345 /// overlapsFrom - Return true if the intersection of the two live intervals
346 /// is not empty. The specified iterator is a hint that we can begin
347 /// scanning the Other interval starting at I.
348 bool overlapsFrom(const LiveInterval& other, const_iterator I) const;
350 /// addRange - Add the specified LiveRange to this interval, merging
351 /// intervals as appropriate. This returns an iterator to the inserted live
352 /// range (which may have grown since it was inserted.
353 void addRange(LiveRange LR) {
354 addRangeFrom(LR, ranges.begin());
357 /// join - Join two live intervals (this, and other) together. This applies
358 /// mappings to the value numbers in the LHS/RHS intervals as specified. If
359 /// the intervals are not joinable, this aborts.
360 void join(LiveInterval &Other, const int *ValNoAssignments,
361 const int *RHSValNoAssignments,
362 SmallVector<VNInfo*, 16> &NewVNInfo);
364 /// removeRange - Remove the specified range from this interval. Note that
365 /// the range must already be in this interval in its entirety.
366 void removeRange(unsigned Start, unsigned End, bool RemoveDeadValNo = false);
368 void removeRange(LiveRange LR, bool RemoveDeadValNo = false) {
369 removeRange(LR.start, LR.end, RemoveDeadValNo);
372 /// removeValNo - Remove all the ranges defined by the specified value#.
373 /// Also remove the value# from value# list.
374 void removeValNo(VNInfo *ValNo);
376 /// getSize - Returns the sum of sizes of all the LiveRange's.
378 unsigned getSize() const;
380 bool operator<(const LiveInterval& other) const {
381 return beginNumber() < other.beginNumber();
384 void print(std::ostream &OS, const TargetRegisterInfo *TRI = 0) const;
385 void print(std::ostream *OS, const TargetRegisterInfo *TRI = 0) const {
386 if (OS) print(*OS, TRI);
391 Ranges::iterator addRangeFrom(LiveRange LR, Ranges::iterator From);
392 void extendIntervalEndTo(Ranges::iterator I, unsigned NewEnd);
393 Ranges::iterator extendIntervalStartTo(Ranges::iterator I, unsigned NewStr);
394 LiveInterval& operator=(const LiveInterval& rhs); // DO NOT IMPLEMENT
397 inline std::ostream &operator<<(std::ostream &OS, const LiveInterval &LI) {