74       assert(S->valno->def == S->start && "Inconsistent existing value def");  in createDeadDef()
83         S->start = S->valno->def = Def;  in createDeadDef()
84       return S->valno;  in createDeadDef()
104     return I->valno;  in extendInBlock()
114     VNInfo *ValNo = I->valno;  in extendSegmentEndTo()
119       assert(MergeTo->valno == ValNo && "Cannot merge with differing values!");  in extendSegmentEndTo()
127         MergeTo->valno == ValNo) {  in extendSegmentEndTo()
142     VNInfo *ValNo = I->valno;  in extendSegmentStartTo()
152       assert(MergeTo->valno == ValNo && "Cannot merge with differing values!");  in extendSegmentStartTo()
158     if (MergeTo->end >= NewStart && MergeTo->valno == ValNo) {  in extendSegmentStartTo()
180       if (S.valno == B->valno) {  in addSegment()
197       if (S.valno == I->valno) {  in addSegment()
481     VNInfo *VNI = S.valno;  in RenumberValues()
532   VNInfo *ValNo = I->valno;  in removeSegment()
539           if (II != I && II->valno == ValNo) {  in removeSegment()
575     return S.valno == ValNo;  in removeValNo()
606     OutIt->valno = NewVNInfo[LHSValNoAssignments[OutIt->valno->id]];  in join()
608       VNInfo* nextValNo = NewVNInfo[LHSValNoAssignments[I->valno->id]];  in join()
614       if (OutIt->valno == nextValNo && OutIt->end == I->start) {  in join()
619         OutIt->valno = nextValNo;  in join()
636     S.valno = NewVNInfo[RHSValNoAssignments[S.valno->id]];  in join()
681     if (S.valno == RHSValNo)  in MergeValueInAsValue()
706     if (S->valno != V1) continue;  // Not a V1 Segment.  in MergeValueNumberInto()
712       if (Prev->valno == V2 && Prev->end == S->start) {  in MergeValueNumberInto()
724     S->valno = V2;  in MergeValueNumberInto()
730       if (I->start == S->end && I->valno == V2) {  in MergeValueNumberInto()
828   return os << '[' << S.start << ',' << S.end << ':' << S.valno->id << ')';  in operator <<()
843       assert(S.valno == getValNumInfo(S.valno->id) && "Bad VNInfo");  in print()
900     assert(I->valno != nullptr);  in verify()
901     assert(I->valno->id < valnos.size());  in verify()
902     assert(I->valno == valnos[I->valno->id]);  in verify()
906         assert(I->valno != std::next(I)->valno);  in verify()
996     return A.valno == B.valno;  in coalescable()
999   assert(A.valno == B.valno && "Cannot overlap different values");  in coalescable()
1043     assert(ReadI->valno == Seg.valno && "Cannot overlap different values");  in add()