38   SegmentIter SegPos = Segments.find(RegPos->start);  in unify()
41     SegPos.insert(RegPos->start, RegPos->end, &VirtReg);  in unify()
44     SegPos.advanceTo(RegPos->start);  in unify()
51   SegPos.insert(RegEnd->start, RegEnd->end, &VirtReg);  in unify()
53     SegPos.insert(RegPos->start, RegPos->end, &VirtReg);  in unify()
66   SegmentIter SegPos = Segments.find(RegPos->start);  in extract()
75     RegPos = Range.advanceTo(RegPos, SegPos.start());  in extract()
79     SegPos.advanceTo(RegPos->start);  in extract()
90     OS << " [" << SI.start() << ' ' << SI.stop()  in print()
149     LiveUnionI.find(LRI->start);  in collectInterferingVRegs()
158     while (LRI->start < LiveUnionI.stop() && LRI->end > LiveUnionI.start()) {  in collectInterferingVRegs()
176     assert(LRI->end <= LiveUnionI.start() && "Expected non-overlap");  in collectInterferingVRegs()
179     LRI = LR->advanceTo(LRI, LiveUnionI.start());  in collectInterferingVRegs()
184     if (LRI->start < LiveUnionI.stop())  in collectInterferingVRegs()
188     LiveUnionI.advanceTo(LRI->start);  in collectInterferingVRegs()