| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | CoalescingBitVector.h | 86 for (auto It = Intervals.begin(), End = Intervals.end(); It != End; ++It) in count()
107 for (auto It = Other.Intervals.begin(), End = Other.Intervals.end(); in set()
121 if (It == Intervals.end()) in test()
136 if (It == Intervals.end()) in reset()
164 for (auto It = RHS.Intervals.begin(), End = RHS.Intervals.end();
222 auto ItL = Intervals.begin();
224 while (ItL != Intervals.end() && ItR != RHS.Intervals.end() &&
229 return ItL == Intervals.end() && ItR == RHS.Intervals.end();
377 for (auto It = Intervals.begin(), End = Intervals.end(); It != End; in print()
404 for (IntervalMapOverlaps<MapT, MapT> I(Intervals, Other.Intervals); in getOverlaps()
[all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | GCNNSAReassign.cpp | 109 unsigned NumRegs = Intervals.size(); in tryAssignRegisters()
112 if (VRM->hasPhys(Intervals[N]->reg())) in tryAssignRegisters()
113 LRM->unassign(*Intervals[N]); in tryAssignRegisters()
142 unsigned NumRegs = Intervals.size(); in scavengeRegs()
152 if (tryAssignRegisters(Intervals, Reg)) in scavengeRegs()
287 Intervals.clear(); in runOnMachineFunction()
290 Intervals.push_back(LI); in runOnMachineFunction()
303 if (Intervals.empty()) in runOnMachineFunction()
309 : Intervals) dbgs() in runOnMachineFunction()
313 bool Success = scavengeRegs(Intervals); in runOnMachineFunction()
[all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | IntervalPartition.cpp | 39 for (unsigned i = 0, e = Intervals.size(); i != e; ++i) in releaseMemory()
40 delete Intervals[i]; in releaseMemory()
42 Intervals.clear(); in releaseMemory()
47 for(unsigned i = 0, e = Intervals.size(); i != e; ++i) in print()
48 Intervals[i]->print(O); in print()
55 Intervals.push_back(I); in addIntervalToPartition()
90 for (unsigned i = 0, e = Intervals.size(); i != e; ++i) in runOnFunction()
91 updatePredecessors(Intervals[i]); in runOnFunction()
116 for (unsigned i = 0, e = Intervals.size(); i != e; ++i) in IntervalPartition()
117 updatePredecessors(Intervals[i]); in IntervalPartition()
|
| /freebsd-13.1/contrib/llvm-project/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 | 595 Intervals[I]->dump(); in dumpIntervals()
898 Intervals[Slot]->addSegment( in calculateLiveIntervals()
913 VNInfo *VNI = Intervals[i]->getValNumInfo(0); in calculateLiveIntervals()
1174 if (Intervals[Slot]->empty()) in removeInvalidSlotRanges()
1179 LiveInterval *Interval = &*Intervals[Slot]; in removeInvalidSlotRanges()
1216 Intervals.clear(); in runOnMachineFunction()
1228 Intervals.reserve(NumSlots); in runOnMachineFunction()
1257 Intervals.push_back(std::move(LI)); in runOnMachineFunction()
1282 if (Intervals[SortedSlots[I]]->empty()) in runOnMachineFunction()
1320 LiveInterval *First = &*Intervals[FirstSlot]; in runOnMachineFunction()
[all …]
|
| H A D | StackSlotColoring.cpp | 209 SmallVector<Pair *, 16> Intervals; in InitializeSlots() local
211 Intervals.reserve(LS->getNumIntervals()); in InitializeSlots()
213 Intervals.push_back(&I); in InitializeSlots()
214 llvm::sort(Intervals, in InitializeSlots()
219 for (auto *I : Intervals) { in InitializeSlots()
|
| /freebsd-13.1/contrib/llvm-project/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()
|
| /freebsd-13.1/contrib/llvm-project/compiler-rt/lib/fuzzer/ |
| H A D | FuzzerDataFlowTrace.cpp | 194 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 | 504 Intervals.resize(N + 1); in UpdateCorpusDistribution()
506 std::iota(Intervals.begin(), Intervals.end(), 0); in UpdateCorpusDistribution()
562 Intervals.begin(), Intervals.end(), Weights.begin()); in UpdateCorpusDistribution()
566 Vector<double> Intervals; variable
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | DAGCombiner.cpp | 23293 IMap Intervals(A); in parallelizeChainedStores() local
23318 Intervals.insert(0, (St->getMemoryVT().getSizeInBits() + 7) / 8, Unit); in parallelizeChainedStores()
23340 auto I = Intervals.find(Offset); in parallelizeChainedStores()
23342 if (I != Intervals.end() && I.start() < (Offset + Length)) in parallelizeChainedStores()
23345 if (I != Intervals.begin() && (--I).stop() <= Offset) in parallelizeChainedStores()
23347 Intervals.insert(Offset, Offset + Length, Unit); in parallelizeChainedStores()
|