blob: 8be967792915f29df9cc08a95ae0bf950fe580cd [file] [log] [blame]
Chris Lattnerfb449b92004-07-23 17:49:16 +00001//===-- LiveInterval.cpp - Live Interval Representation -------------------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file was developed by the LLVM research group and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
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' abd 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.
18//
19//===----------------------------------------------------------------------===//
20
Chris Lattner3c3fe462005-09-21 04:19:09 +000021#include "llvm/CodeGen/LiveInterval.h"
Reid Spencer551ccae2004-09-01 22:55:40 +000022#include "llvm/ADT/STLExtras.h"
Chris Lattner38135af2005-05-14 05:34:15 +000023#include "llvm/Target/MRegisterInfo.h"
Alkis Evlogimenosc4d3b912004-09-28 02:38:58 +000024#include <algorithm>
Chris Lattnerabf295f2004-07-24 02:52:23 +000025#include <iostream>
26#include <map>
Chris Lattnerfb449b92004-07-23 17:49:16 +000027using namespace llvm;
28
29// An example for liveAt():
30//
Chris Lattneraa141472004-07-23 18:40:00 +000031// this = [1,4), liveAt(0) will return false. The instruction defining this
32// spans slots [0,3]. The interval belongs to an spilled definition of the
33// variable it represents. This is because slot 1 is used (def slot) and spans
34// up to slot 3 (store slot).
Chris Lattnerfb449b92004-07-23 17:49:16 +000035//
Chris Lattnerebd7e6c2004-07-23 18:13:24 +000036bool LiveInterval::liveAt(unsigned I) const {
37 Ranges::const_iterator r = std::upper_bound(ranges.begin(), ranges.end(), I);
Misha Brukmanedf128a2005-04-21 22:36:52 +000038
Chris Lattnerfb449b92004-07-23 17:49:16 +000039 if (r == ranges.begin())
40 return false;
41
42 --r;
Chris Lattneraa141472004-07-23 18:40:00 +000043 return r->contains(I);
Chris Lattnerfb449b92004-07-23 17:49:16 +000044}
45
Chris Lattnerbae74d92004-11-18 03:47:34 +000046// overlaps - Return true if the intersection of the two live intervals is
47// not empty.
48//
Chris Lattnerfb449b92004-07-23 17:49:16 +000049// An example for overlaps():
50//
51// 0: A = ...
52// 4: B = ...
53// 8: C = A + B ;; last use of A
54//
55// The live intervals should look like:
56//
57// A = [3, 11)
58// B = [7, x)
59// C = [11, y)
60//
61// A->overlaps(C) should return false since we want to be able to join
62// A and C.
Chris Lattnerbae74d92004-11-18 03:47:34 +000063//
64bool LiveInterval::overlapsFrom(const LiveInterval& other,
65 const_iterator StartPos) const {
66 const_iterator i = begin();
67 const_iterator ie = end();
68 const_iterator j = StartPos;
69 const_iterator je = other.end();
70
71 assert((StartPos->start <= i->start || StartPos == other.begin()) &&
Chris Lattner8c68b6a2004-11-18 04:02:11 +000072 StartPos != other.end() && "Bogus start position hint!");
Chris Lattnerf5426492004-07-25 07:11:19 +000073
Chris Lattnerfb449b92004-07-23 17:49:16 +000074 if (i->start < j->start) {
Chris Lattneraa141472004-07-23 18:40:00 +000075 i = std::upper_bound(i, ie, j->start);
Chris Lattnerfb449b92004-07-23 17:49:16 +000076 if (i != ranges.begin()) --i;
Chris Lattneraa141472004-07-23 18:40:00 +000077 } else if (j->start < i->start) {
Chris Lattneread1b3f2004-12-04 01:22:09 +000078 ++StartPos;
79 if (StartPos != other.end() && StartPos->start <= i->start) {
80 assert(StartPos < other.end() && i < end());
Chris Lattner8c68b6a2004-11-18 04:02:11 +000081 j = std::upper_bound(j, je, i->start);
82 if (j != other.ranges.begin()) --j;
83 }
Chris Lattneraa141472004-07-23 18:40:00 +000084 } else {
85 return true;
Chris Lattnerfb449b92004-07-23 17:49:16 +000086 }
87
Chris Lattner9fddc122004-11-18 05:28:21 +000088 if (j == je) return false;
89
90 while (i != ie) {
Chris Lattnerfb449b92004-07-23 17:49:16 +000091 if (i->start > j->start) {
Alkis Evlogimenosa1613db2004-07-24 11:44:15 +000092 std::swap(i, j);
93 std::swap(ie, je);
Chris Lattnerfb449b92004-07-23 17:49:16 +000094 }
Chris Lattnerfb449b92004-07-23 17:49:16 +000095
96 if (i->end > j->start)
97 return true;
98 ++i;
99 }
100
101 return false;
102}
103
Chris Lattnerb26c2152004-07-23 19:38:44 +0000104/// extendIntervalEndTo - This method is used when we want to extend the range
105/// specified by I to end at the specified endpoint. To do this, we should
106/// merge and eliminate all ranges that this will overlap with. The iterator is
107/// not invalidated.
108void LiveInterval::extendIntervalEndTo(Ranges::iterator I, unsigned NewEnd) {
109 assert(I != ranges.end() && "Not a valid interval!");
Chris Lattnerabf295f2004-07-24 02:52:23 +0000110 unsigned ValId = I->ValId;
Chris Lattnerfb449b92004-07-23 17:49:16 +0000111
Chris Lattnerb26c2152004-07-23 19:38:44 +0000112 // Search for the first interval that we can't merge with.
113 Ranges::iterator MergeTo = next(I);
Chris Lattnerabf295f2004-07-24 02:52:23 +0000114 for (; MergeTo != ranges.end() && NewEnd >= MergeTo->end; ++MergeTo) {
115 assert(MergeTo->ValId == ValId && "Cannot merge with differing values!");
116 }
Chris Lattnerb26c2152004-07-23 19:38:44 +0000117
118 // If NewEnd was in the middle of an interval, make sure to get its endpoint.
119 I->end = std::max(NewEnd, prior(MergeTo)->end);
120
Chris Lattnerb0fa11c2005-10-20 07:39:25 +0000121 // Erase any dead ranges.
Chris Lattnerb26c2152004-07-23 19:38:44 +0000122 ranges.erase(next(I), MergeTo);
Chris Lattnerb0fa11c2005-10-20 07:39:25 +0000123
124 // If the newly formed range now touches the range after it and if they have
125 // the same value number, merge the two ranges into one range.
Chris Lattnercef60102005-10-20 22:50:10 +0000126 Ranges::iterator Next = next(I);
Chris Lattner9e20d352005-10-21 06:41:30 +0000127 if (Next != ranges.end() && Next->start <= I->end && Next->ValId == ValId) {
Chris Lattnercef60102005-10-20 22:50:10 +0000128 I->end = Next->end;
129 ranges.erase(Next);
Chris Lattnerb0fa11c2005-10-20 07:39:25 +0000130 }
Chris Lattnerb26c2152004-07-23 19:38:44 +0000131}
132
133
134/// extendIntervalStartTo - This method is used when we want to extend the range
135/// specified by I to start at the specified endpoint. To do this, we should
136/// merge and eliminate all ranges that this will overlap with.
Misha Brukmanedf128a2005-04-21 22:36:52 +0000137LiveInterval::Ranges::iterator
Chris Lattnerb26c2152004-07-23 19:38:44 +0000138LiveInterval::extendIntervalStartTo(Ranges::iterator I, unsigned NewStart) {
139 assert(I != ranges.end() && "Not a valid interval!");
Chris Lattnerabf295f2004-07-24 02:52:23 +0000140 unsigned ValId = I->ValId;
Chris Lattnerb26c2152004-07-23 19:38:44 +0000141
142 // Search for the first interval that we can't merge with.
143 Ranges::iterator MergeTo = I;
144 do {
145 if (MergeTo == ranges.begin()) {
146 I->start = NewStart;
Chris Lattnerabf295f2004-07-24 02:52:23 +0000147 ranges.erase(MergeTo, I);
Chris Lattnerb26c2152004-07-23 19:38:44 +0000148 return I;
149 }
Chris Lattnerabf295f2004-07-24 02:52:23 +0000150 assert(MergeTo->ValId == ValId && "Cannot merge with differing values!");
Chris Lattnerb26c2152004-07-23 19:38:44 +0000151 --MergeTo;
152 } while (NewStart <= MergeTo->start);
153
154 // If we start in the middle of another interval, just delete a range and
155 // extend that interval.
Chris Lattnerabf295f2004-07-24 02:52:23 +0000156 if (MergeTo->end >= NewStart && MergeTo->ValId == ValId) {
Chris Lattnerb26c2152004-07-23 19:38:44 +0000157 MergeTo->end = I->end;
158 } else {
159 // Otherwise, extend the interval right after.
160 ++MergeTo;
161 MergeTo->start = NewStart;
162 MergeTo->end = I->end;
163 }
164
165 ranges.erase(next(MergeTo), next(I));
166 return MergeTo;
167}
168
Chris Lattnerc114b2c2006-08-25 23:41:24 +0000169LiveInterval::iterator
170LiveInterval::addRangeFrom(LiveRange LR, iterator From) {
Chris Lattnerb26c2152004-07-23 19:38:44 +0000171 unsigned Start = LR.start, End = LR.end;
Chris Lattnerc114b2c2006-08-25 23:41:24 +0000172 iterator it = std::upper_bound(From, ranges.end(), Start);
Chris Lattnerb26c2152004-07-23 19:38:44 +0000173
174 // If the inserted interval starts in the middle or right at the end of
175 // another interval, just extend that interval to contain the range of LR.
176 if (it != ranges.begin()) {
Chris Lattnerc114b2c2006-08-25 23:41:24 +0000177 iterator B = prior(it);
Chris Lattnerabf295f2004-07-24 02:52:23 +0000178 if (LR.ValId == B->ValId) {
179 if (B->start <= Start && B->end >= Start) {
180 extendIntervalEndTo(B, End);
181 return B;
182 }
183 } else {
184 // Check to make sure that we are not overlapping two live ranges with
185 // different ValId's.
186 assert(B->end <= Start &&
Brian Gaeke8311bef2004-11-16 06:52:35 +0000187 "Cannot overlap two LiveRanges with differing ValID's"
188 " (did you def the same reg twice in a MachineInstr?)");
Chris Lattnerb26c2152004-07-23 19:38:44 +0000189 }
190 }
191
192 // Otherwise, if this range ends in the middle of, or right next to, another
193 // interval, merge it into that interval.
Chris Lattnerabf295f2004-07-24 02:52:23 +0000194 if (it != ranges.end())
195 if (LR.ValId == it->ValId) {
196 if (it->start <= End) {
197 it = extendIntervalStartTo(it, Start);
198
199 // If LR is a complete superset of an interval, we may need to grow its
200 // endpoint as well.
201 if (End > it->end)
202 extendIntervalEndTo(it, End);
203 return it;
204 }
205 } else {
206 // Check to make sure that we are not overlapping two live ranges with
207 // different ValId's.
208 assert(it->start >= End &&
209 "Cannot overlap two LiveRanges with differing ValID's");
210 }
Chris Lattnerb26c2152004-07-23 19:38:44 +0000211
212 // Otherwise, this is just a new range that doesn't interact with anything.
213 // Insert it.
214 return ranges.insert(it, LR);
Chris Lattnerfb449b92004-07-23 17:49:16 +0000215}
216
Chris Lattnerabf295f2004-07-24 02:52:23 +0000217
218/// removeRange - Remove the specified range from this interval. Note that
219/// the range must already be in this interval in its entirety.
220void LiveInterval::removeRange(unsigned Start, unsigned End) {
221 // Find the LiveRange containing this span.
222 Ranges::iterator I = std::upper_bound(ranges.begin(), ranges.end(), Start);
223 assert(I != ranges.begin() && "Range is not in interval!");
224 --I;
225 assert(I->contains(Start) && I->contains(End-1) &&
226 "Range is not entirely in interval!");
227
228 // If the span we are removing is at the start of the LiveRange, adjust it.
229 if (I->start == Start) {
230 if (I->end == End)
231 ranges.erase(I); // Removed the whole LiveRange.
232 else
233 I->start = End;
234 return;
235 }
236
237 // Otherwise if the span we are removing is at the end of the LiveRange,
238 // adjust the other way.
239 if (I->end == End) {
Chris Lattner6925a9f2004-07-25 05:43:53 +0000240 I->end = Start;
Chris Lattnerabf295f2004-07-24 02:52:23 +0000241 return;
242 }
243
244 // Otherwise, we are splitting the LiveRange into two pieces.
245 unsigned OldEnd = I->end;
246 I->end = Start; // Trim the old interval.
247
248 // Insert the new one.
249 ranges.insert(next(I), LiveRange(End, OldEnd, I->ValId));
250}
251
252/// getLiveRangeContaining - Return the live range that contains the
253/// specified index, or null if there is none.
Chris Lattnerf7da2c72006-08-24 22:43:55 +0000254LiveInterval::const_iterator
255LiveInterval::FindLiveRangeContaining(unsigned Idx) const {
256 const_iterator It = std::upper_bound(begin(), end(), Idx);
Chris Lattnerabf295f2004-07-24 02:52:23 +0000257 if (It != ranges.begin()) {
Chris Lattnerf7da2c72006-08-24 22:43:55 +0000258 --It;
259 if (It->contains(Idx))
260 return It;
Chris Lattnerabf295f2004-07-24 02:52:23 +0000261 }
262
Chris Lattnerf7da2c72006-08-24 22:43:55 +0000263 return end();
Chris Lattnerabf295f2004-07-24 02:52:23 +0000264}
265
Chris Lattnerf7da2c72006-08-24 22:43:55 +0000266LiveInterval::iterator
267LiveInterval::FindLiveRangeContaining(unsigned Idx) {
268 iterator It = std::upper_bound(begin(), end(), Idx);
Chris Lattner6d8fbef2006-08-29 23:18:15 +0000269 if (It != begin()) {
Chris Lattnerf7da2c72006-08-24 22:43:55 +0000270 --It;
271 if (It->contains(Idx))
272 return It;
273 }
274
275 return end();
276}
Chris Lattnerabf295f2004-07-24 02:52:23 +0000277
Chris Lattner6d8fbef2006-08-29 23:18:15 +0000278/// join - Join two live intervals (this, and other) together. This applies
279/// mappings to the value numbers in the LHS/RHS intervals as specified. If
280/// the intervals are not joinable, this aborts.
281void LiveInterval::join(LiveInterval &Other, int *LHSValNoAssignments,
282 int *RHSValNoAssignments,
283 SmallVector<unsigned, 16> &NewInstDefiningValue) {
284
Chris Lattnerdeb99712004-07-24 03:41:50 +0000285 // Try to do the least amount of work possible. In particular, if there are
286 // more liverange chunks in the other set than there are in the 'this' set,
287 // swap sets to merge the fewest chunks in possible.
Chris Lattnere7f729b2006-08-26 01:28:16 +0000288 //
289 // Also, if one range is a physreg and one is a vreg, we always merge from the
290 // vreg into the physreg, which leaves the vreg intervals pristine.
291 unsigned OtherOffs = 1, ThisOffs = 0;
292 if ((Other.ranges.size() > ranges.size() &&
293 MRegisterInfo::isVirtualRegister(reg)) ||
294 MRegisterInfo::isPhysicalRegister(Other.reg)) {
295 swap(Other);
Chris Lattner6d8fbef2006-08-29 23:18:15 +0000296 std::swap(LHSValNoAssignments, RHSValNoAssignments);
297 }
298
299 // Determine if any of our live range values are mapped. This is uncommon, so
300 // we want to avoid the interval scan if not.
301 bool MustMapCurValNos = false;
302 for (unsigned i = 0, e = getNumValNums(); i != e; ++i) {
303 if (InstDefiningValue[i] == ~2U) continue; // tombstone value #
304 if (i != (unsigned)LHSValNoAssignments[i]) {
305 MustMapCurValNos = true;
306 break;
307 }
Chris Lattnerdeb99712004-07-24 03:41:50 +0000308 }
Chris Lattnere7f729b2006-08-26 01:28:16 +0000309
Chris Lattner6d8fbef2006-08-29 23:18:15 +0000310 // If we have to apply a mapping to our base interval assignment, rewrite it
311 // now.
312 if (MustMapCurValNos) {
313 // Map the first live range.
314 iterator OutIt = begin();
315 OutIt->ValId = LHSValNoAssignments[OutIt->ValId];
316 ++OutIt;
317 for (iterator I = OutIt, E = end(); I != E; ++I) {
318 OutIt->ValId = LHSValNoAssignments[I->ValId];
319
320 // If this live range has the same value # as its immediate predecessor,
321 // and if they are neighbors, remove one LiveRange. This happens when we
322 // have [0,3:0)[4,7:1) and map 0/1 onto the same value #.
323 if (OutIt->ValId == (OutIt-1)->ValId && (OutIt-1)->end == OutIt->start) {
324 (OutIt-1)->end = OutIt->end;
325 } else {
326 if (I != OutIt) {
327 OutIt->start = I->start;
328 OutIt->end = I->end;
329 }
330
331 // Didn't merge, on to the next one.
332 ++OutIt;
333 }
334 }
335
336 // If we merge some live ranges, chop off the end.
337 ranges.erase(OutIt, end());
338 }
339
340 // Okay, now insert the RHS live ranges into the LHS.
Chris Lattnerc114b2c2006-08-25 23:41:24 +0000341 iterator InsertPos = begin();
342 for (iterator I = Other.begin(), E = Other.end(); I != E; ++I) {
Chris Lattnerabf295f2004-07-24 02:52:23 +0000343 // Map the ValId in the other live range to the current live range.
Chris Lattner6d8fbef2006-08-29 23:18:15 +0000344 I->ValId = RHSValNoAssignments[I->ValId];
Chris Lattnerabf295f2004-07-24 02:52:23 +0000345 InsertPos = addRangeFrom(*I, InsertPos);
346 }
Chris Lattner6d8fbef2006-08-29 23:18:15 +0000347
348 InstDefiningValue.clear();
349 InstDefiningValue.append(NewInstDefiningValue.begin(),
350 NewInstDefiningValue.end());
Chris Lattnerabf295f2004-07-24 02:52:23 +0000351 weight += Other.weight;
Chris Lattnerfb449b92004-07-23 17:49:16 +0000352}
353
Chris Lattnerc114b2c2006-08-25 23:41:24 +0000354/// MergeInClobberRanges - For any live ranges that are not defined in the
355/// current interval, but are defined in the Clobbers interval, mark them
356/// used with an unknown definition value.
357void LiveInterval::MergeInClobberRanges(const LiveInterval &Clobbers) {
358 if (Clobbers.begin() == Clobbers.end()) return;
359
360 // Find a value # to use for the clobber ranges. If there is already a value#
361 // for unknown values, use it.
362 // FIXME: Use a single sentinal number for these!
363 unsigned ClobberValNo = getNextValue(~0U);
364
365 iterator IP = begin();
366 for (const_iterator I = Clobbers.begin(), E = Clobbers.end(); I != E; ++I) {
367 unsigned Start = I->start, End = I->end;
368 IP = std::upper_bound(IP, end(), Start);
369
370 // If the start of this range overlaps with an existing liverange, trim it.
371 if (IP != begin() && IP[-1].end > Start) {
372 Start = IP[-1].end;
373 // Trimmed away the whole range?
374 if (Start >= End) continue;
375 }
376 // If the end of this range overlaps with an existing liverange, trim it.
377 if (IP != end() && End > IP->start) {
378 End = IP->start;
379 // If this trimmed away the whole range, ignore it.
380 if (Start == End) continue;
381 }
382
383 // Insert the clobber interval.
384 IP = addRangeFrom(LiveRange(Start, End, ClobberValNo), IP);
385 }
386}
387
Chris Lattnerf7da2c72006-08-24 22:43:55 +0000388/// MergeValueNumberInto - This method is called when two value nubmers
389/// are found to be equivalent. This eliminates V1, replacing all
390/// LiveRanges with the V1 value number with the V2 value number. This can
391/// cause merging of V1/V2 values numbers and compaction of the value space.
392void LiveInterval::MergeValueNumberInto(unsigned V1, unsigned V2) {
393 assert(V1 != V2 && "Identical value#'s are always equivalent!");
394
395 // This code actually merges the (numerically) larger value number into the
396 // smaller value number, which is likely to allow us to compactify the value
397 // space. The only thing we have to be careful of is to preserve the
398 // instruction that defines the result value.
399
400 // Make sure V2 is smaller than V1.
401 if (V1 < V2) {
402 setInstDefiningValNum(V1, getInstForValNum(V2));
403 std::swap(V1, V2);
404 }
405
406 // Merge V1 live ranges into V2.
407 for (iterator I = begin(); I != end(); ) {
408 iterator LR = I++;
409 if (LR->ValId != V1) continue; // Not a V1 LiveRange.
410
411 // Okay, we found a V1 live range. If it had a previous, touching, V2 live
412 // range, extend it.
413 if (LR != begin()) {
414 iterator Prev = LR-1;
415 if (Prev->ValId == V2 && Prev->end == LR->start) {
416 Prev->end = LR->end;
417
418 // Erase this live-range.
419 ranges.erase(LR);
420 I = Prev+1;
421 LR = Prev;
422 }
423 }
424
425 // Okay, now we have a V1 or V2 live range that is maximally merged forward.
426 // Ensure that it is a V2 live-range.
427 LR->ValId = V2;
428
429 // If we can merge it into later V2 live ranges, do so now. We ignore any
430 // following V1 live ranges, as they will be merged in subsequent iterations
431 // of the loop.
432 if (I != end()) {
433 if (I->start == LR->end && I->ValId == V2) {
434 LR->end = I->end;
435 ranges.erase(I);
436 I = LR+1;
437 }
438 }
439 }
Chris Lattnerc82b3aa2006-08-24 23:22:59 +0000440
441 // Now that V1 is dead, remove it. If it is the largest value number, just
442 // nuke it (and any other deleted values neighboring it), otherwise mark it as
443 // ~1U so it can be nuked later.
Chris Lattner6d8fbef2006-08-29 23:18:15 +0000444 if (V1 == getNumValNums()-1) {
Chris Lattnerc82b3aa2006-08-24 23:22:59 +0000445 do {
446 InstDefiningValue.pop_back();
Chris Lattnerc82b3aa2006-08-24 23:22:59 +0000447 } while (InstDefiningValue.back() == ~1U);
448 } else {
449 InstDefiningValue[V1] = ~1U;
450 }
Chris Lattnerf7da2c72006-08-24 22:43:55 +0000451}
452
453
Chris Lattnerfb449b92004-07-23 17:49:16 +0000454std::ostream& llvm::operator<<(std::ostream& os, const LiveRange &LR) {
Chris Lattnerabf295f2004-07-24 02:52:23 +0000455 return os << '[' << LR.start << ',' << LR.end << ':' << LR.ValId << ")";
Chris Lattnerfb449b92004-07-23 17:49:16 +0000456}
457
Chris Lattnerabf295f2004-07-24 02:52:23 +0000458void LiveRange::dump() const {
459 std::cerr << *this << "\n";
460}
461
Chris Lattner38135af2005-05-14 05:34:15 +0000462void LiveInterval::print(std::ostream &OS, const MRegisterInfo *MRI) const {
463 if (MRI && MRegisterInfo::isPhysicalRegister(reg))
464 OS << MRI->getName(reg);
465 else
466 OS << "%reg" << reg;
Chris Lattnerabf295f2004-07-24 02:52:23 +0000467
Chris Lattner38135af2005-05-14 05:34:15 +0000468 OS << ',' << weight;
Chris Lattnerfb449b92004-07-23 17:49:16 +0000469
Chris Lattner38135af2005-05-14 05:34:15 +0000470 if (empty())
471 OS << "EMPTY";
472 else {
473 OS << " = ";
474 for (LiveInterval::Ranges::const_iterator I = ranges.begin(),
475 E = ranges.end(); I != E; ++I)
476 OS << *I;
477 }
Chris Lattnerbe4f88a2006-08-22 18:19:46 +0000478
479 // Print value number info.
Chris Lattner6d8fbef2006-08-29 23:18:15 +0000480 if (getNumValNums()) {
Chris Lattnerbe4f88a2006-08-22 18:19:46 +0000481 OS << " ";
Chris Lattner6d8fbef2006-08-29 23:18:15 +0000482 for (unsigned i = 0; i != getNumValNums(); ++i) {
Chris Lattnerbe4f88a2006-08-22 18:19:46 +0000483 if (i) OS << " ";
484 OS << i << "@";
485 if (InstDefiningValue[i] == ~0U) {
486 OS << "?";
487 } else {
488 OS << InstDefiningValue[i];
489 }
490 }
491 }
Chris Lattnerfb449b92004-07-23 17:49:16 +0000492}
Chris Lattnerabf295f2004-07-24 02:52:23 +0000493
494void LiveInterval::dump() const {
495 std::cerr << *this << "\n";
496}