reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
217 const_iterator begin() const { return segments.begin(); } 218 const_iterator end() const { return segments.end(); } 270 const_iterator advanceTo(const_iterator I, SlotIndex Pos) const { 270 const_iterator advanceTo(const_iterator I, SlotIndex Pos) const { 287 const_iterator find(SlotIndex Pos) const { 393 const_iterator r = find(index); 400 const_iterator I = FindSegmentContaining(Idx); 413 const_iterator I = FindSegmentContaining(Idx); 421 const_iterator I = FindSegmentContaining(Idx.getPrevSlot()); 432 const_iterator FindSegmentContaining(SlotIndex Idx) const { 433 const_iterator I = find(Idx); 460 bool overlapsFrom(const LiveRange &Other, const_iterator StartPos) const; 534 const_iterator I = find(Idx.getBaseIndex()); 535 const_iterator E = end();include/llvm/CodeGen/LiveIntervalUnion.h
112 LiveRange::const_iterator LRI; ///< current position in LR
lib/CodeGen/InterferenceCache.cpp181 LiveInterval::const_iterator I = RegUnits[i].FixedI; 182 LiveInterval::const_iterator E = RegUnits[i].Fixed->end();lib/CodeGen/LiveInterval.cpp
405 const_iterator StartPos) const { 407 const_iterator i = begin(); 408 const_iterator ie = end(); 409 const_iterator j = StartPos; 410 const_iterator je = other.end(); 452 const_iterator I = find(Other.beginIndex()); 453 const_iterator IE = end(); 456 const_iterator J = Other.find(I->start); 457 const_iterator JE = Other.end(); 490 const_iterator I = std::lower_bound(begin(), end(), End); 498 const_iterator I = begin(); 506 const_iterator Last = I; 598 for (const_iterator II = begin(), EE = end(); II != EE; ++II) 823 const_iterator SegmentI = find(*SlotI); 824 const_iterator SegmentE = end(); 1061 for (const_iterator I = begin(), E = end(); I != E; ++I) {lib/CodeGen/LiveIntervalUnion.cpp
35 LiveRange::const_iterator RegPos = Range.begin(); 36 LiveRange::const_iterator RegEnd = Range.end(); 62 LiveRange::const_iterator RegPos = Range.begin(); 63 LiveRange::const_iterator RegEnd = Range.end(); 139 LiveRange::const_iterator LREnd = LR->end();lib/CodeGen/LiveIntervals.cpp
685 SmallVector<std::pair<const LiveRange*, LiveRange::const_iterator>, 8> RU; 688 LiveRange::const_iterator>, 4> SRs; 718 for (LiveInterval::const_iterator RI = LI.begin(), RE = LI.end(); RI != RE; 737 LiveRange::const_iterator &I = RUP.second; 765 LiveRange::const_iterator &I = SRP.second; 799 LiveRange::const_iterator N = std::next(RI);lib/CodeGen/MachineVerifier.cpp
283 const LiveRange::const_iterator I, unsigned, 2457 const LiveRange::const_iterator I, 2676 for (LiveRange::const_iterator I = LR.begin(), E = LR.end(); I != E; ++I)lib/CodeGen/RegAllocGreedy.cpp
2204 LiveRange::const_iterator I = LR.find(StartIdx); 2205 LiveRange::const_iterator E = LR.end();lib/CodeGen/SplitKit.cpp
217 LiveInterval::const_iterator LVI = CurLI->begin(); 218 LiveInterval::const_iterator LVE = CurLI->end(); 344 LiveInterval::const_iterator I = Orig.find(Idx);lib/CodeGen/TwoAddressInstructionPass.cpp
257 LiveInterval::const_iterator I = LI.find(MBBEndIdx); 444 LiveInterval::const_iterator I = LI.find(useIdx); 877 LiveInterval::const_iterator I = LI.find(MBBEndIdx); 1067 LiveInterval::const_iterator I = LI.find(MBBEndIdx); 1644 LiveInterval::const_iterator I = LI.find(MIIdx);lib/CodeGen/VirtRegMap.cpp
272 std::pair<const LiveInterval::SubRange *, LiveInterval::const_iterator>; 295 LiveInterval::const_iterator &SRI = RangeIterPair.second;usr/include/c++/7.4.0/bits/range_access.h
58 begin(const _Container& __cont) -> decltype(__cont.begin()) 78 end(const _Container& __cont) -> decltype(__cont.end())