Lines Matching refs:ValNo
62 assert(I->valno->def == I->start && "Inconsistent existing value def");
71 I->start = I->valno->def = Def;
72 return I->valno;
190 /// ValNo is dead, remove it. If it is the largest value number, just nuke it
193 void LiveInterval::markValNoForDeletion(VNInfo *ValNo) {
194 if (ValNo->id == getNumValNums()-1) {
199 ValNo->markUnused();
209 VNInfo *VNI = I->valno;
212 assert(!VNI->isUnused() && "Unused valno used by live range");
224 VNInfo *ValNo = I->valno;
229 assert(MergeTo->valno == ValNo && "Cannot merge with differing values!");
238 MergeTo->valno == ValNo) {
254 VNInfo *ValNo = I->valno;
264 assert(MergeTo->valno == ValNo && "Cannot merge with differing values!");
270 if (MergeTo->end >= NewStart && MergeTo->valno == ValNo) {
292 if (LR.valno == B->valno) {
299 // different valno's.
309 if (LR.valno == it->valno) {
321 // different valno's.
346 return I->valno;
359 VNInfo *ValNo = I->valno;
366 if (II != I && II->valno == ValNo) {
371 // Now that ValNo is dead, remove it.
372 markValNoForDeletion(ValNo);
394 ranges.insert(llvm::next(I), LiveRange(End, OldEnd, ValNo));
399 void LiveInterval::removeValNo(VNInfo *ValNo) {
405 if (I->valno == ValNo)
408 // Now that ValNo is dead, remove it.
409 markValNoForDeletion(ValNo);
442 OutIt->valno = NewVNInfo[LHSValNoAssignments[OutIt->valno->id]];
444 VNInfo* nextValNo = NewVNInfo[LHSValNoAssignments[I->valno->id]];
450 if (OutIt->valno == nextValNo && OutIt->end == I->start) {
455 OutIt->valno = nextValNo;
472 I->valno = NewVNInfo[RHSValNoAssignments[I->valno->id]];
517 if (I->valno == RHSValNo)
542 if (LR->valno != V1) continue; // Not a V1 LiveRange.
548 if (Prev->valno == V2 && Prev->end == LR->start) {
560 LR->valno = V2;
566 if (I->start == LR->end && I->valno == V2) {
588 return os << '[' << LR.start << ',' << LR.end << ':' << LR.valno->id << ")";
604 assert(I->valno == getValNumInfo(I->valno->id) && "Bad VNInfo");
640 assert(I->valno != 0);
641 assert(I->valno == valnos[I->valno->id]);
645 assert(I->valno != llvm::next(I)->valno);
717 return A.valno == B.valno;
720 assert(A.valno == B.valno && "Cannot overlap different values");
757 assert(ReadI->valno == Seg.valno && "Cannot overlap different values");
932 while (J != E && EqClass[J->valno->id] == 0)
935 if (unsigned eq = EqClass[I->valno->id]) {
