LiveInterval.cpp revision 9446407963005f3edfa8ac70e265c81839a416c9
1//===-- LiveInterval.cpp - Live Interval Representation -------------------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// 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 21#include "llvm/CodeGen/LiveInterval.h" 22#include "llvm/ADT/SmallSet.h" 23#include "llvm/ADT/STLExtras.h" 24#include "llvm/Support/Streams.h" 25#include "llvm/Target/TargetRegisterInfo.h" 26#include <algorithm> 27#include <ostream> 28using namespace llvm; 29 30// An example for liveAt(): 31// 32// this = [1,4), liveAt(0) will return false. The instruction defining this 33// spans slots [0,3]. The interval belongs to an spilled definition of the 34// variable it represents. This is because slot 1 is used (def slot) and spans 35// up to slot 3 (store slot). 36// 37bool LiveInterval::liveAt(unsigned I) const { 38 Ranges::const_iterator r = std::upper_bound(ranges.begin(), ranges.end(), I); 39 40 if (r == ranges.begin()) 41 return false; 42 43 --r; 44 return r->contains(I); 45} 46 47// liveBeforeAndAt - Check if the interval is live at the index and the index 48// just before it. If index is liveAt, check if it starts a new live range. 49// If it does, then check if the previous live range ends at index-1. 50bool LiveInterval::liveBeforeAndAt(unsigned I) const { 51 Ranges::const_iterator r = std::upper_bound(ranges.begin(), ranges.end(), I); 52 53 if (r == ranges.begin()) 54 return false; 55 56 --r; 57 if (!r->contains(I)) 58 return false; 59 if (I != r->start) 60 return true; 61 // I is the start of a live range. Check if the previous live range ends 62 // at I-1. 63 if (r == ranges.begin()) 64 return false; 65 return r->end == I; 66} 67 68// overlaps - Return true if the intersection of the two live intervals is 69// not empty. 70// 71// An example for overlaps(): 72// 73// 0: A = ... 74// 4: B = ... 75// 8: C = A + B ;; last use of A 76// 77// The live intervals should look like: 78// 79// A = [3, 11) 80// B = [7, x) 81// C = [11, y) 82// 83// A->overlaps(C) should return false since we want to be able to join 84// A and C. 85// 86bool LiveInterval::overlapsFrom(const LiveInterval& other, 87 const_iterator StartPos) const { 88 const_iterator i = begin(); 89 const_iterator ie = end(); 90 const_iterator j = StartPos; 91 const_iterator je = other.end(); 92 93 assert((StartPos->start <= i->start || StartPos == other.begin()) && 94 StartPos != other.end() && "Bogus start position hint!"); 95 96 if (i->start < j->start) { 97 i = std::upper_bound(i, ie, j->start); 98 if (i != ranges.begin()) --i; 99 } else if (j->start < i->start) { 100 ++StartPos; 101 if (StartPos != other.end() && StartPos->start <= i->start) { 102 assert(StartPos < other.end() && i < end()); 103 j = std::upper_bound(j, je, i->start); 104 if (j != other.ranges.begin()) --j; 105 } 106 } else { 107 return true; 108 } 109 110 if (j == je) return false; 111 112 while (i != ie) { 113 if (i->start > j->start) { 114 std::swap(i, j); 115 std::swap(ie, je); 116 } 117 118 if (i->end > j->start) 119 return true; 120 ++i; 121 } 122 123 return false; 124} 125 126/// extendIntervalEndTo - This method is used when we want to extend the range 127/// specified by I to end at the specified endpoint. To do this, we should 128/// merge and eliminate all ranges that this will overlap with. The iterator is 129/// not invalidated. 130void LiveInterval::extendIntervalEndTo(Ranges::iterator I, unsigned NewEnd) { 131 assert(I != ranges.end() && "Not a valid interval!"); 132 VNInfo *ValNo = I->valno; 133 unsigned OldEnd = I->end; 134 135 // Search for the first interval that we can't merge with. 136 Ranges::iterator MergeTo = next(I); 137 for (; MergeTo != ranges.end() && NewEnd >= MergeTo->end; ++MergeTo) { 138 assert(MergeTo->valno == ValNo && "Cannot merge with differing values!"); 139 } 140 141 // If NewEnd was in the middle of an interval, make sure to get its endpoint. 142 I->end = std::max(NewEnd, prior(MergeTo)->end); 143 144 // Erase any dead ranges. 145 ranges.erase(next(I), MergeTo); 146 147 // Update kill info. 148 removeKills(ValNo, OldEnd, I->end-1); 149 150 // If the newly formed range now touches the range after it and if they have 151 // the same value number, merge the two ranges into one range. 152 Ranges::iterator Next = next(I); 153 if (Next != ranges.end() && Next->start <= I->end && Next->valno == ValNo) { 154 I->end = Next->end; 155 ranges.erase(Next); 156 } 157} 158 159 160/// extendIntervalStartTo - This method is used when we want to extend the range 161/// specified by I to start at the specified endpoint. To do this, we should 162/// merge and eliminate all ranges that this will overlap with. 163LiveInterval::Ranges::iterator 164LiveInterval::extendIntervalStartTo(Ranges::iterator I, unsigned NewStart) { 165 assert(I != ranges.end() && "Not a valid interval!"); 166 VNInfo *ValNo = I->valno; 167 168 // Search for the first interval that we can't merge with. 169 Ranges::iterator MergeTo = I; 170 do { 171 if (MergeTo == ranges.begin()) { 172 I->start = NewStart; 173 ranges.erase(MergeTo, I); 174 return I; 175 } 176 assert(MergeTo->valno == ValNo && "Cannot merge with differing values!"); 177 --MergeTo; 178 } while (NewStart <= MergeTo->start); 179 180 // If we start in the middle of another interval, just delete a range and 181 // extend that interval. 182 if (MergeTo->end >= NewStart && MergeTo->valno == ValNo) { 183 MergeTo->end = I->end; 184 } else { 185 // Otherwise, extend the interval right after. 186 ++MergeTo; 187 MergeTo->start = NewStart; 188 MergeTo->end = I->end; 189 } 190 191 ranges.erase(next(MergeTo), next(I)); 192 return MergeTo; 193} 194 195LiveInterval::iterator 196LiveInterval::addRangeFrom(LiveRange LR, iterator From) { 197 unsigned Start = LR.start, End = LR.end; 198 iterator it = std::upper_bound(From, ranges.end(), Start); 199 200 // If the inserted interval starts in the middle or right at the end of 201 // another interval, just extend that interval to contain the range of LR. 202 if (it != ranges.begin()) { 203 iterator B = prior(it); 204 if (LR.valno == B->valno) { 205 if (B->start <= Start && B->end >= Start) { 206 extendIntervalEndTo(B, End); 207 return B; 208 } 209 } else { 210 // Check to make sure that we are not overlapping two live ranges with 211 // different valno's. 212 assert(B->end <= Start && 213 "Cannot overlap two LiveRanges with differing ValID's" 214 " (did you def the same reg twice in a MachineInstr?)"); 215 } 216 } 217 218 // Otherwise, if this range ends in the middle of, or right next to, another 219 // interval, merge it into that interval. 220 if (it != ranges.end()) { 221 if (LR.valno == it->valno) { 222 if (it->start <= End) { 223 it = extendIntervalStartTo(it, Start); 224 225 // If LR is a complete superset of an interval, we may need to grow its 226 // endpoint as well. 227 if (End > it->end) 228 extendIntervalEndTo(it, End); 229 else if (End < it->end) 230 // Overlapping intervals, there might have been a kill here. 231 removeKill(it->valno, End); 232 return it; 233 } 234 } else { 235 // Check to make sure that we are not overlapping two live ranges with 236 // different valno's. 237 assert(it->start >= End && 238 "Cannot overlap two LiveRanges with differing ValID's"); 239 } 240 } 241 242 // Otherwise, this is just a new range that doesn't interact with anything. 243 // Insert it. 244 return ranges.insert(it, LR); 245} 246 247 248/// removeRange - Remove the specified range from this interval. Note that 249/// the range must already be in this interval in its entirety. 250void LiveInterval::removeRange(unsigned Start, unsigned End, 251 bool RemoveDeadValNo) { 252 // Find the LiveRange containing this span. 253 Ranges::iterator I = std::upper_bound(ranges.begin(), ranges.end(), Start); 254 assert(I != ranges.begin() && "Range is not in interval!"); 255 --I; 256 assert(I->contains(Start) && I->contains(End-1) && 257 "Range is not entirely in interval!"); 258 259 // If the span we are removing is at the start of the LiveRange, adjust it. 260 VNInfo *ValNo = I->valno; 261 if (I->start == Start) { 262 if (I->end == End) { 263 removeKills(I->valno, Start, End); 264 if (RemoveDeadValNo) { 265 // Check if val# is dead. 266 bool isDead = true; 267 for (const_iterator II = begin(), EE = end(); II != EE; ++II) 268 if (II != I && II->valno == ValNo) { 269 isDead = false; 270 break; 271 } 272 if (isDead) { 273 // Now that ValNo is dead, remove it. If it is the largest value 274 // number, just nuke it (and any other deleted values neighboring it), 275 // otherwise mark it as ~1U so it can be nuked later. 276 if (ValNo->id == getNumValNums()-1) { 277 do { 278 VNInfo *VNI = valnos.back(); 279 valnos.pop_back(); 280 VNI->~VNInfo(); 281 } while (!valnos.empty() && valnos.back()->def == ~1U); 282 } else { 283 ValNo->def = ~1U; 284 } 285 } 286 } 287 288 ranges.erase(I); // Removed the whole LiveRange. 289 } else 290 I->start = End; 291 return; 292 } 293 294 // Otherwise if the span we are removing is at the end of the LiveRange, 295 // adjust the other way. 296 if (I->end == End) { 297 removeKills(ValNo, Start, End); 298 I->end = Start; 299 return; 300 } 301 302 // Otherwise, we are splitting the LiveRange into two pieces. 303 unsigned OldEnd = I->end; 304 I->end = Start; // Trim the old interval. 305 306 // Insert the new one. 307 ranges.insert(next(I), LiveRange(End, OldEnd, ValNo)); 308} 309 310/// removeValNo - Remove all the ranges defined by the specified value#. 311/// Also remove the value# from value# list. 312void LiveInterval::removeValNo(VNInfo *ValNo) { 313 if (empty()) return; 314 Ranges::iterator I = ranges.end(); 315 Ranges::iterator E = ranges.begin(); 316 do { 317 --I; 318 if (I->valno == ValNo) 319 ranges.erase(I); 320 } while (I != E); 321 // Now that ValNo is dead, remove it. If it is the largest value 322 // number, just nuke it (and any other deleted values neighboring it), 323 // otherwise mark it as ~1U so it can be nuked later. 324 if (ValNo->id == getNumValNums()-1) { 325 do { 326 VNInfo *VNI = valnos.back(); 327 valnos.pop_back(); 328 VNI->~VNInfo(); 329 } while (!valnos.empty() && valnos.back()->def == ~1U); 330 } else { 331 ValNo->def = ~1U; 332 } 333} 334 335/// getLiveRangeContaining - Return the live range that contains the 336/// specified index, or null if there is none. 337LiveInterval::const_iterator 338LiveInterval::FindLiveRangeContaining(unsigned Idx) const { 339 const_iterator It = std::upper_bound(begin(), end(), Idx); 340 if (It != ranges.begin()) { 341 --It; 342 if (It->contains(Idx)) 343 return It; 344 } 345 346 return end(); 347} 348 349LiveInterval::iterator 350LiveInterval::FindLiveRangeContaining(unsigned Idx) { 351 iterator It = std::upper_bound(begin(), end(), Idx); 352 if (It != begin()) { 353 --It; 354 if (It->contains(Idx)) 355 return It; 356 } 357 358 return end(); 359} 360 361/// findDefinedVNInfo - Find the VNInfo that's defined at the specified index 362/// (register interval) or defined by the specified register (stack inteval). 363VNInfo *LiveInterval::findDefinedVNInfo(unsigned DefIdxOrReg) const { 364 VNInfo *VNI = NULL; 365 for (LiveInterval::const_vni_iterator i = vni_begin(), e = vni_end(); 366 i != e; ++i) 367 if ((*i)->def == DefIdxOrReg) { 368 VNI = *i; 369 break; 370 } 371 return VNI; 372} 373 374 375/// join - Join two live intervals (this, and other) together. This applies 376/// mappings to the value numbers in the LHS/RHS intervals as specified. If 377/// the intervals are not joinable, this aborts. 378void LiveInterval::join(LiveInterval &Other, const int *LHSValNoAssignments, 379 const int *RHSValNoAssignments, 380 SmallVector<VNInfo*, 16> &NewVNInfo) { 381 // Determine if any of our live range values are mapped. This is uncommon, so 382 // we want to avoid the interval scan if not. 383 bool MustMapCurValNos = false; 384 unsigned NumVals = getNumValNums(); 385 unsigned NumNewVals = NewVNInfo.size(); 386 for (unsigned i = 0; i != NumVals; ++i) { 387 unsigned LHSValID = LHSValNoAssignments[i]; 388 if (i != LHSValID || 389 (NewVNInfo[LHSValID] && NewVNInfo[LHSValID] != getValNumInfo(i))) 390 MustMapCurValNos = true; 391 } 392 393 // If we have to apply a mapping to our base interval assignment, rewrite it 394 // now. 395 if (MustMapCurValNos) { 396 // Map the first live range. 397 iterator OutIt = begin(); 398 OutIt->valno = NewVNInfo[LHSValNoAssignments[OutIt->valno->id]]; 399 ++OutIt; 400 for (iterator I = OutIt, E = end(); I != E; ++I) { 401 OutIt->valno = NewVNInfo[LHSValNoAssignments[I->valno->id]]; 402 403 // If this live range has the same value # as its immediate predecessor, 404 // and if they are neighbors, remove one LiveRange. This happens when we 405 // have [0,3:0)[4,7:1) and map 0/1 onto the same value #. 406 if (OutIt->valno == (OutIt-1)->valno && (OutIt-1)->end == OutIt->start) { 407 (OutIt-1)->end = OutIt->end; 408 } else { 409 if (I != OutIt) { 410 OutIt->start = I->start; 411 OutIt->end = I->end; 412 } 413 414 // Didn't merge, on to the next one. 415 ++OutIt; 416 } 417 } 418 419 // If we merge some live ranges, chop off the end. 420 ranges.erase(OutIt, end()); 421 } 422 423 // Remember assignements because val# ids are changing. 424 SmallVector<unsigned, 16> OtherAssignments; 425 for (iterator I = Other.begin(), E = Other.end(); I != E; ++I) 426 OtherAssignments.push_back(RHSValNoAssignments[I->valno->id]); 427 428 // Update val# info. Renumber them and make sure they all belong to this 429 // LiveInterval now. Also remove dead val#'s. 430 unsigned NumValNos = 0; 431 for (unsigned i = 0; i < NumNewVals; ++i) { 432 VNInfo *VNI = NewVNInfo[i]; 433 if (VNI) { 434 if (i >= NumVals) 435 valnos.push_back(VNI); 436 else 437 valnos[NumValNos] = VNI; 438 VNI->id = NumValNos++; // Renumber val#. 439 } 440 } 441 if (NumNewVals < NumVals) 442 valnos.resize(NumNewVals); // shrinkify 443 444 // Okay, now insert the RHS live ranges into the LHS. 445 iterator InsertPos = begin(); 446 unsigned RangeNo = 0; 447 for (iterator I = Other.begin(), E = Other.end(); I != E; ++I, ++RangeNo) { 448 // Map the valno in the other live range to the current live range. 449 I->valno = NewVNInfo[OtherAssignments[RangeNo]]; 450 assert(I->valno && "Adding a dead range?"); 451 InsertPos = addRangeFrom(*I, InsertPos); 452 } 453 454 weight += Other.weight; 455 if (Other.preference && !preference) 456 preference = Other.preference; 457} 458 459/// MergeRangesInAsValue - Merge all of the intervals in RHS into this live 460/// interval as the specified value number. The LiveRanges in RHS are 461/// allowed to overlap with LiveRanges in the current interval, but only if 462/// the overlapping LiveRanges have the specified value number. 463void LiveInterval::MergeRangesInAsValue(const LiveInterval &RHS, 464 VNInfo *LHSValNo) { 465 // TODO: Make this more efficient. 466 iterator InsertPos = begin(); 467 for (const_iterator I = RHS.begin(), E = RHS.end(); I != E; ++I) { 468 // Map the valno in the other live range to the current live range. 469 LiveRange Tmp = *I; 470 Tmp.valno = LHSValNo; 471 InsertPos = addRangeFrom(Tmp, InsertPos); 472 } 473} 474 475 476/// MergeValueInAsValue - Merge all of the live ranges of a specific val# 477/// in RHS into this live interval as the specified value number. 478/// The LiveRanges in RHS are allowed to overlap with LiveRanges in the 479/// current interval, it will replace the value numbers of the overlaped 480/// live ranges with the specified value number. 481void LiveInterval::MergeValueInAsValue(const LiveInterval &RHS, 482 const VNInfo *RHSValNo, VNInfo *LHSValNo) { 483 SmallVector<VNInfo*, 4> ReplacedValNos; 484 iterator IP = begin(); 485 for (const_iterator I = RHS.begin(), E = RHS.end(); I != E; ++I) { 486 if (I->valno != RHSValNo) 487 continue; 488 unsigned Start = I->start, End = I->end; 489 IP = std::upper_bound(IP, end(), Start); 490 // If the start of this range overlaps with an existing liverange, trim it. 491 if (IP != begin() && IP[-1].end > Start) { 492 if (IP[-1].valno != LHSValNo) { 493 ReplacedValNos.push_back(IP[-1].valno); 494 IP[-1].valno = LHSValNo; // Update val#. 495 } 496 Start = IP[-1].end; 497 // Trimmed away the whole range? 498 if (Start >= End) continue; 499 } 500 // If the end of this range overlaps with an existing liverange, trim it. 501 if (IP != end() && End > IP->start) { 502 if (IP->valno != LHSValNo) { 503 ReplacedValNos.push_back(IP->valno); 504 IP->valno = LHSValNo; // Update val#. 505 } 506 End = IP->start; 507 // If this trimmed away the whole range, ignore it. 508 if (Start == End) continue; 509 } 510 511 // Map the valno in the other live range to the current live range. 512 IP = addRangeFrom(LiveRange(Start, End, LHSValNo), IP); 513 } 514 515 516 SmallSet<VNInfo*, 4> Seen; 517 for (unsigned i = 0, e = ReplacedValNos.size(); i != e; ++i) { 518 VNInfo *V1 = ReplacedValNos[i]; 519 if (Seen.insert(V1)) { 520 bool isDead = true; 521 for (const_iterator I = begin(), E = end(); I != E; ++I) 522 if (I->valno == V1) { 523 isDead = false; 524 break; 525 } 526 if (isDead) { 527 // Now that V1 is dead, remove it. If it is the largest value number, 528 // just nuke it (and any other deleted values neighboring it), otherwise 529 // mark it as ~1U so it can be nuked later. 530 if (V1->id == getNumValNums()-1) { 531 do { 532 VNInfo *VNI = valnos.back(); 533 valnos.pop_back(); 534 VNI->~VNInfo(); 535 } while (!valnos.empty() && valnos.back()->def == ~1U); 536 } else { 537 V1->def = ~1U; 538 } 539 } 540 } 541 } 542} 543 544 545/// MergeInClobberRanges - For any live ranges that are not defined in the 546/// current interval, but are defined in the Clobbers interval, mark them 547/// used with an unknown definition value. 548void LiveInterval::MergeInClobberRanges(const LiveInterval &Clobbers, 549 BumpPtrAllocator &VNInfoAllocator) { 550 if (Clobbers.empty()) return; 551 552 // Find a value # to use for the clobber ranges. If there is already a value# 553 // for unknown values, use it. 554 // FIXME: Use a single sentinal number for these! 555 VNInfo *ClobberValNo = getNextValue(~0U, 0, VNInfoAllocator); 556 557 iterator IP = begin(); 558 for (const_iterator I = Clobbers.begin(), E = Clobbers.end(); I != E; ++I) { 559 unsigned Start = I->start, End = I->end; 560 IP = std::upper_bound(IP, end(), Start); 561 562 // If the start of this range overlaps with an existing liverange, trim it. 563 if (IP != begin() && IP[-1].end > Start) { 564 Start = IP[-1].end; 565 // Trimmed away the whole range? 566 if (Start >= End) continue; 567 } 568 // If the end of this range overlaps with an existing liverange, trim it. 569 if (IP != end() && End > IP->start) { 570 End = IP->start; 571 // If this trimmed away the whole range, ignore it. 572 if (Start == End) continue; 573 } 574 575 // Insert the clobber interval. 576 IP = addRangeFrom(LiveRange(Start, End, ClobberValNo), IP); 577 } 578} 579 580/// MergeValueNumberInto - This method is called when two value nubmers 581/// are found to be equivalent. This eliminates V1, replacing all 582/// LiveRanges with the V1 value number with the V2 value number. This can 583/// cause merging of V1/V2 values numbers and compaction of the value space. 584void LiveInterval::MergeValueNumberInto(VNInfo *V1, VNInfo *V2) { 585 assert(V1 != V2 && "Identical value#'s are always equivalent!"); 586 587 // This code actually merges the (numerically) larger value number into the 588 // smaller value number, which is likely to allow us to compactify the value 589 // space. The only thing we have to be careful of is to preserve the 590 // instruction that defines the result value. 591 592 // Make sure V2 is smaller than V1. 593 if (V1->id < V2->id) { 594 copyValNumInfo(V1, V2); 595 std::swap(V1, V2); 596 } 597 598 // Merge V1 live ranges into V2. 599 for (iterator I = begin(); I != end(); ) { 600 iterator LR = I++; 601 if (LR->valno != V1) continue; // Not a V1 LiveRange. 602 603 // Okay, we found a V1 live range. If it had a previous, touching, V2 live 604 // range, extend it. 605 if (LR != begin()) { 606 iterator Prev = LR-1; 607 if (Prev->valno == V2 && Prev->end == LR->start) { 608 Prev->end = LR->end; 609 610 // Erase this live-range. 611 ranges.erase(LR); 612 I = Prev+1; 613 LR = Prev; 614 } 615 } 616 617 // Okay, now we have a V1 or V2 live range that is maximally merged forward. 618 // Ensure that it is a V2 live-range. 619 LR->valno = V2; 620 621 // If we can merge it into later V2 live ranges, do so now. We ignore any 622 // following V1 live ranges, as they will be merged in subsequent iterations 623 // of the loop. 624 if (I != end()) { 625 if (I->start == LR->end && I->valno == V2) { 626 LR->end = I->end; 627 ranges.erase(I); 628 I = LR+1; 629 } 630 } 631 } 632 633 // Now that V1 is dead, remove it. If it is the largest value number, just 634 // nuke it (and any other deleted values neighboring it), otherwise mark it as 635 // ~1U so it can be nuked later. 636 if (V1->id == getNumValNums()-1) { 637 do { 638 VNInfo *VNI = valnos.back(); 639 valnos.pop_back(); 640 VNI->~VNInfo(); 641 } while (valnos.back()->def == ~1U); 642 } else { 643 V1->def = ~1U; 644 } 645} 646 647void LiveInterval::Copy(const LiveInterval &RHS, 648 BumpPtrAllocator &VNInfoAllocator) { 649 ranges.clear(); 650 valnos.clear(); 651 preference = RHS.preference; 652 weight = RHS.weight; 653 for (unsigned i = 0, e = RHS.getNumValNums(); i != e; ++i) { 654 const VNInfo *VNI = RHS.getValNumInfo(i); 655 VNInfo *NewVNI = getNextValue(~0U, 0, VNInfoAllocator); 656 copyValNumInfo(NewVNI, VNI); 657 } 658 for (unsigned i = 0, e = RHS.ranges.size(); i != e; ++i) { 659 const LiveRange &LR = RHS.ranges[i]; 660 addRange(LiveRange(LR.start, LR.end, getValNumInfo(LR.valno->id))); 661 } 662} 663 664unsigned LiveInterval::getSize() const { 665 unsigned Sum = 0; 666 for (const_iterator I = begin(), E = end(); I != E; ++I) 667 Sum += I->end - I->start; 668 return Sum; 669} 670 671std::ostream& llvm::operator<<(std::ostream& os, const LiveRange &LR) { 672 return os << '[' << LR.start << ',' << LR.end << ':' << LR.valno->id << ")"; 673} 674 675void LiveRange::dump() const { 676 cerr << *this << "\n"; 677} 678 679void LiveInterval::print(std::ostream &OS, 680 const TargetRegisterInfo *TRI) const { 681 if (isStackSlot()) 682 OS << "SS#" << getStackSlotIndex(); 683 else if (TRI && TargetRegisterInfo::isPhysicalRegister(reg)) 684 OS << TRI->getName(reg); 685 else 686 OS << "%reg" << reg; 687 688 OS << ',' << weight; 689 690 if (empty()) 691 OS << " EMPTY"; 692 else { 693 OS << " = "; 694 for (LiveInterval::Ranges::const_iterator I = ranges.begin(), 695 E = ranges.end(); I != E; ++I) 696 OS << *I; 697 } 698 699 // Print value number info. 700 if (getNumValNums()) { 701 OS << " "; 702 unsigned vnum = 0; 703 for (const_vni_iterator i = vni_begin(), e = vni_end(); i != e; 704 ++i, ++vnum) { 705 const VNInfo *vni = *i; 706 if (vnum) OS << " "; 707 OS << vnum << "@"; 708 if (vni->def == ~1U) { 709 OS << "x"; 710 } else { 711 if (vni->def == ~0U) 712 OS << "?"; 713 else 714 OS << vni->def; 715 unsigned ee = vni->kills.size(); 716 if (ee || vni->hasPHIKill) { 717 OS << "-("; 718 for (unsigned j = 0; j != ee; ++j) { 719 OS << vni->kills[j]; 720 if (j != ee-1) 721 OS << " "; 722 } 723 if (vni->hasPHIKill) { 724 if (ee) 725 OS << " "; 726 OS << "phi"; 727 } 728 OS << ")"; 729 } 730 } 731 } 732 } 733} 734 735void LiveInterval::dump() const { 736 cerr << *this << "\n"; 737} 738 739 740void LiveRange::print(std::ostream &os) const { 741 os << *this; 742} 743