Home
last modified time | relevance | path

Searched refs:Intervals (Results 1 – 7 of 7) sorted by relevance

/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DIntervalPartition.cpp35 for (unsigned i = 0, e = Intervals.size(); i != e; ++i) in releaseMemory()
36 delete Intervals[i]; in releaseMemory()
38 Intervals.clear(); in releaseMemory()
43 for(unsigned i = 0, e = Intervals.size(); i != e; ++i) in print()
44 Intervals[i]->print(O); in print()
51 Intervals.push_back(I); in addIntervalToPartition()
86 for (unsigned i = 0, e = Intervals.size(); i != e; ++i) in runOnFunction()
87 updatePredecessors(Intervals[i]); in runOnFunction()
112 for (unsigned i = 0, e = Intervals.size(); i != e; ++i) in IntervalPartition()
113 updatePredecessors(Intervals[i]); in IntervalPartition()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DRenameIndependentSubregs.cpp96 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 DStackColoring.cpp562 Intervals[I]->dump(); in dumpIntervals()
854 Intervals[Slot]->addSegment( in calculateLiveIntervals()
869 VNInfo *VNI = Intervals[i]->getValNumInfo(0); in calculateLiveIntervals()
1104 if (Intervals[Slot]->empty()) in removeInvalidSlotRanges()
1109 LiveInterval *Interval = &*Intervals[Slot]; in removeInvalidSlotRanges()
1146 Intervals.clear(); in runOnMachineFunction()
1158 Intervals.reserve(NumSlots); in runOnMachineFunction()
1187 Intervals.push_back(std::move(LI)); in runOnMachineFunction()
1212 if (Intervals[SortedSlots[I]]->empty()) in runOnMachineFunction()
1249 LiveInterval *First = &*Intervals[FirstSlot]; in runOnMachineFunction()
[all …]
H A DStackSlotColoring.cpp212 SmallVector<Pair *, 16> Intervals; in InitializeSlots() local
214 Intervals.reserve(LS->getNumIntervals()); in InitializeSlots()
216 Intervals.push_back(&I); in InitializeSlots()
217 llvm::sort(Intervals, in InitializeSlots()
222 for (auto *I : Intervals) { in InitializeSlots()
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DIntervalPartition.h49 std::vector<Interval *> Intervals; variable
75 bool isDegeneratePartition() { return Intervals.size() == 1; } in isDegeneratePartition()
91 const std::vector<Interval*> &getIntervals() const { return Intervals; } in getIntervals()
/freebsd-12.1/contrib/compiler-rt/lib/fuzzer/
H A DFuzzerCorpus.h273 Intervals.resize(N + 1); in UpdateCorpusDistribution()
275 std::iota(Intervals.begin(), Intervals.end(), 0); in UpdateCorpusDistribution()
289 Intervals.begin(), Intervals.end(), Weights.begin()); in UpdateCorpusDistribution()
293 Vector<double> Intervals; variable
/freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DDAGCombiner.cpp19272 IMap Intervals(A); in parallelizeChainedStores() local
19287 Intervals.insert(0, (St->getMemoryVT().getSizeInBits() + 7) / 8, Unit); in parallelizeChainedStores()
19305 auto I = Intervals.find(Offset); in parallelizeChainedStores()
19307 if (I != Intervals.end() && I.start() < (Offset + Length)) in parallelizeChainedStores()
19310 if (I != Intervals.begin() && (--I).stop() <= Offset) in parallelizeChainedStores()
19312 Intervals.insert(Offset, Offset + Length, Unit); in parallelizeChainedStores()