| /llvm-project-15.0.7/llvm/include/llvm/ADT/ |
| H A D | CoalescingBitVector.h | 87 for (auto It = Intervals.begin(), End = Intervals.end(); It != End; ++It) in count()
108 for (auto It = Other.Intervals.begin(), End = Other.Intervals.end(); in set()
122 if (It == Intervals.end()) in test()
137 if (It == Intervals.end()) in reset()
165 for (auto It = RHS.Intervals.begin(), End = RHS.Intervals.end();
223 auto ItL = Intervals.begin();
225 while (ItL != Intervals.end() && ItR != RHS.Intervals.end() &&
230 return ItL == Intervals.end() && ItR == RHS.Intervals.end();
378 for (auto It = Intervals.begin(), End = Intervals.end(); It != End; in print()
405 for (IntervalMapOverlaps<MapT, MapT> I(Intervals, Other.Intervals); in getOverlaps()
[all …]
|
| /llvm-project-15.0.7/llvm/lib/Target/AMDGPU/ |
| H A D | GCNNSAReassign.cpp | 111 unsigned NumRegs = Intervals.size(); in tryAssignRegisters()
114 if (VRM->hasPhys(Intervals[N]->reg())) in tryAssignRegisters()
115 LRM->unassign(*Intervals[N]); in tryAssignRegisters()
144 unsigned NumRegs = Intervals.size(); in scavengeRegs()
154 if (tryAssignRegisters(Intervals, Reg)) in scavengeRegs()
298 Intervals.clear(); in runOnMachineFunction()
301 Intervals.push_back(LI); in runOnMachineFunction()
314 if (Intervals.empty()) in runOnMachineFunction()
320 : Intervals) dbgs() in runOnMachineFunction()
324 bool Success = scavengeRegs(Intervals); in runOnMachineFunction()
[all …]
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | RenameIndependentSubregs.cpp | 96 const SmallVectorImpl<LiveInterval*> &Intervals) const;
135 SmallVector<LiveInterval*, 4> Intervals; in INITIALIZE_PASS_DEPENDENCY() local
136 Intervals.push_back(&LI); in INITIALIZE_PASS_DEPENDENCY()
144 Intervals.push_back(&NewLI); in INITIALIZE_PASS_DEPENDENCY()
149 rewriteOperands(Classes, SubRangeInfos, Intervals); in INITIALIZE_PASS_DEPENDENCY()
150 distribute(Classes, SubRangeInfos, Intervals); in INITIALIZE_PASS_DEPENDENCY()
213 const SmallVectorImpl<LiveInterval*> &Intervals) const { in rewriteOperands()
215 unsigned Reg = Intervals[0]->reg(); in rewriteOperands()
245 unsigned VReg = Intervals[ID]->reg(); in rewriteOperands()
305 for (size_t I = 0, E = Intervals.size(); I < E; ++I) { in computeMainRangesFixFlags()
[all …]
|
| H A D | StackColoring.cpp | 593 Intervals[I]->dump(); in dumpIntervals()
898 Intervals[Slot]->addSegment( in calculateLiveIntervals()
913 VNInfo *VNI = Intervals[i]->getValNumInfo(0); in calculateLiveIntervals()
1177 if (Intervals[Slot]->empty()) in removeInvalidSlotRanges()
1182 LiveInterval *Interval = &*Intervals[Slot]; in removeInvalidSlotRanges()
1219 Intervals.clear(); in runOnMachineFunction()
1231 Intervals.reserve(NumSlots); in runOnMachineFunction()
1260 Intervals.push_back(std::move(LI)); in runOnMachineFunction()
1285 if (Intervals[SortedSlots[I]]->empty()) in runOnMachineFunction()
1328 LiveInterval *First = &*Intervals[FirstSlot]; in runOnMachineFunction()
[all …]
|
| H A D | StackSlotColoring.cpp | 207 SmallVector<Pair *, 16> Intervals; in InitializeSlots() local
209 Intervals.reserve(LS->getNumIntervals()); in InitializeSlots()
211 Intervals.push_back(&I); in InitializeSlots()
212 llvm::sort(Intervals, in InitializeSlots()
217 for (auto *I : Intervals) { in InitializeSlots()
|
| H A D | MLRegallocEvictAdvisor.cpp | 288 void extractFeatures(const SmallVectorImpl<const LiveInterval *> &Intervals,
748 const SmallVectorImpl<const LiveInterval *> &Intervals, in extractFeatures() argument
768 Intervals.empty() ? 0 : std::numeric_limits<int64_t>::max(); in extractFeatures()
770 for (const auto *L : Intervals) { in extractFeatures()
799 if (!Intervals.empty()) { in extractFeatures()
817 SET(is_free, int64_t, Intervals.empty()); in extractFeatures()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | IntervalPartition.cpp | 39 for (Interval *I : Intervals) in releaseMemory()
42 Intervals.clear(); in releaseMemory()
47 for (const Interval *I : Intervals) in print()
55 Intervals.push_back(I); in addIntervalToPartition()
90 for (Interval *I : Intervals) in runOnFunction()
116 for (Interval *I : Intervals) in IntervalPartition()
|
| /llvm-project-15.0.7/llvm/test/Verifier/ |
| H A D | range-1.ll | 85 ; CHECK: Intervals are overlapping
93 ; CHECK: Intervals are contiguous
101 ; CHECK: Intervals are not in order
109 ; CHECK: Intervals are contiguous
117 ; CHECK: Intervals are overlapping
125 ; CHECK: Intervals are overlapping
133 ; CHECK: Intervals are overlapping
141 ; CHECK: Intervals are contiguous
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | IntervalPartition.h | 48 std::vector<Interval *> Intervals; variable
72 bool isDegeneratePartition() { return Intervals.size() == 1; } in isDegeneratePartition()
88 const std::vector<Interval*> &getIntervals() const { return Intervals; } in getIntervals()
|
| /llvm-project-15.0.7/compiler-rt/lib/fuzzer/ |
| H A D | FuzzerDataFlowTrace.cpp | 194 std::vector<double> Intervals(NumFunctions + 1); in Init() local
195 std::iota(Intervals.begin(), Intervals.end(), 0); in Init()
197 Intervals.begin(), Intervals.end(), Weights.begin()); in Init()
|
| H A D | FuzzerCorpus.h | 507 Intervals.resize(N + 1); in UpdateCorpusDistribution()
509 std::iota(Intervals.begin(), Intervals.end(), 0); in UpdateCorpusDistribution()
565 Intervals.begin(), Intervals.end(), Weights.begin()); in UpdateCorpusDistribution()
569 std::vector<double> Intervals; variable
|
| /llvm-project-15.0.7/llvm/test/DebugInfo/WebAssembly/ |
| H A D | dbg-value-live-interval.ll | 4 ; CHECK: {{.*}}After WebAssembly Optimize Live Intervals
|
| /llvm-project-15.0.7/llvm/docs/ |
| H A D | CodeGenerator.rst | 1194 Live Intervals
1197 Live Intervals are the ranges (intervals) where a variable is *live*. They are
1241 Live Intervals Analysis argument
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | DAGCombiner.cpp | 24872 IMap Intervals(A); in parallelizeChainedStores() local
24897 Intervals.insert(0, (St->getMemoryVT().getSizeInBits() + 7) / 8, Unit); in parallelizeChainedStores()
24919 auto I = Intervals.find(Offset); in parallelizeChainedStores()
24921 if (I != Intervals.end() && I.start() < (Offset + Length)) in parallelizeChainedStores()
24924 if (I != Intervals.begin() && (--I).stop() <= Offset) in parallelizeChainedStores()
24926 Intervals.insert(Offset, Offset + Length, Unit); in parallelizeChainedStores()
|