| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | CoalescingBitVector.h | 57 : Alloc(&Alloc), Intervals(Alloc) {} in CoalescingBitVector()
63 : Alloc(Other.Alloc), Intervals(*Other.Alloc) { in CoalescingBitVector()
79 void clear() { Intervals.clear(); } in clear()
82 bool empty() const { return Intervals.empty(); } in empty()
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()
121 const auto It = Intervals.find(Index); in test()
122 if (It == Intervals.end()) in test()
136 auto It = Intervals.find(Index); in reset()
137 if (It == Intervals.end()) in reset()
[all …]
|
| H A D | IntervalTree.h | 287 IntervalVector Intervals; // Storage for each interval and all of the fields variable
602 Intervals.clear(); in clear()
611 Intervals.emplace_back(Left, Right, Value); in insert()
651 for (const DataType &Data : Intervals) { in create()
662 IntervalsLeft.resize(Intervals.size()); in create()
663 IntervalsRight.resize(Intervals.size()); in create()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | GCNNSAReassign.cpp | 72 bool tryAssignRegisters(SmallVectorImpl<LiveInterval *> &Intervals,
77 bool scavengeRegs(SmallVectorImpl<LiveInterval *> &Intervals) const;
116 SmallVectorImpl<LiveInterval *> &Intervals, unsigned StartReg) const { in tryAssignRegisters() argument
117 unsigned NumRegs = Intervals.size(); in tryAssignRegisters()
120 if (VRM->hasPhys(Intervals[N]->reg())) in tryAssignRegisters()
121 LRM->unassign(*Intervals[N]); in tryAssignRegisters()
124 if (LRM->checkInterference(*Intervals[N], MCRegister::from(StartReg + N))) in tryAssignRegisters()
128 LRM->assign(*Intervals[N], MCRegister::from(StartReg + N)); in tryAssignRegisters()
149 SmallVectorImpl<LiveInterval *> &Intervals) const { in scavengeRegs()
150 unsigned NumRegs = Intervals.size(); in scavengeRegs()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RenameIndependentSubregs.cpp | 78 const SmallVectorImpl<LiveInterval*> &Intervals) const;
83 const SmallVectorImpl<LiveInterval*> &Intervals) const;
88 const SmallVectorImpl<LiveInterval*> &Intervals) const;
141 SmallVector<LiveInterval*, 4> Intervals; in INITIALIZE_PASS_DEPENDENCY() local
142 Intervals.push_back(&LI); in INITIALIZE_PASS_DEPENDENCY()
150 Intervals.push_back(&NewLI); in INITIALIZE_PASS_DEPENDENCY()
155 rewriteOperands(Classes, SubRangeInfos, Intervals); in INITIALIZE_PASS_DEPENDENCY()
156 distribute(Classes, SubRangeInfos, Intervals); in INITIALIZE_PASS_DEPENDENCY()
157 computeMainRangesFixFlags(Classes, SubRangeInfos, Intervals); in INITIALIZE_PASS_DEPENDENCY()
219 const SmallVectorImpl<LiveInterval*> &Intervals) const { in rewriteOperands()
[all …]
|
| H A D | StackColoring.cpp | 413 SmallVector<std::unique_ptr<LiveInterval>, 16> Intervals; member in __anon570007070111::StackColoring
563 for (unsigned I = 0, E = Intervals.size(); I != E; ++I) { in dumpIntervals()
565 Intervals[I]->dump(); in dumpIntervals()
873 VNInfo *VNI = Intervals[Slot]->getValNumInfo(0); in calculateLiveIntervals()
874 Intervals[Slot]->addSegment( in calculateLiveIntervals()
889 VNInfo *VNI = Intervals[i]->getValNumInfo(0); in calculateLiveIntervals()
890 Intervals[i]->addSegment(LiveInterval::Segment(Starts[i], EndIdx, VNI)); in calculateLiveIntervals()
1042 const LiveInterval *Interval = &*Intervals[FromSlot]; in remapInstructions()
1157 if (Intervals[Slot]->empty()) in removeInvalidSlotRanges()
1162 LiveInterval *Interval = &*Intervals[Slot]; in removeInvalidSlotRanges()
[all …]
|
| H A D | StackSlotColoring.cpp | 267 SmallVector<Pair *, 16> Intervals; in InitializeSlots() local
269 Intervals.reserve(LS->getNumIntervals()); in InitializeSlots()
271 Intervals.push_back(&I); in InitializeSlots()
272 llvm::sort(Intervals, in InitializeSlots()
277 for (auto *I : Intervals) { in InitializeSlots()
|
| H A D | MLRegallocEvictAdvisor.cpp | |
| H A D | MLRegAllocEvictAdvisor.cpp | 335 void extractFeatures(const SmallVectorImpl<const LiveInterval *> &Intervals,
937 const SmallVectorImpl<const LiveInterval *> &Intervals, in extractFeatures() argument
958 Intervals.empty() ? 0 : std::numeric_limits<int64_t>::max(); in extractFeatures()
960 for (const auto *L : Intervals) { in extractFeatures()
996 if (!Intervals.empty()) { in extractFeatures()
1014 SET(is_free, int64_t, Intervals.empty()); in extractFeatures()
|
| /freebsd/contrib/llvm-project/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 | 508 Intervals.resize(N + 1); in UpdateCorpusDistribution()
510 std::iota(Intervals.begin(), Intervals.end(), 0); in UpdateCorpusDistribution()
566 Intervals.begin(), Intervals.end(), Weights.begin()); in UpdateCorpusDistribution()
570 std::vector<double> Intervals;
569 std::vector<double> Intervals; global() variable
|
| /freebsd/contrib/llvm-project/llvm/lib/Frontend/HLSL/ |
| H A D | RootSignatureValidations.cpp | 185 MapT::const_iterator Interval = Intervals.find(Info.LowerBound); in getOverlapping()
192 return Intervals.lookup(X, nullptr); in lookup()
195 void ResourceRange::clear() { return Intervals.clear(); } in clear()
202 MapT::iterator Interval = Intervals.begin(); in insert()
242 Intervals.insert(LowerBound, UpperBound, &Info); in insert()
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | IntervalPartition.cpp | 154 std::vector<std::pair<const Node *, CFGIntervalNode *>> Intervals; in partitionIntoIntervalsImpl() local
159 Intervals.emplace_back(EntryBlock, &Graph.back()); in partitionIntoIntervalsImpl()
171 Intervals.emplace_back(B, &Graph.back()); in partitionIntoIntervalsImpl()
175 for (auto [H, N] : Intervals) { in partitionIntoIntervalsImpl()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Frontend/HLSL/ |
| H A D | RootSignatureValidations.h | 75 MapT Intervals;
78 ResourceRange(MapT::Allocator &Allocator) : Intervals(MapT(Allocator)) {} in ResourceRange()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | MachineScheduler.h | 818 explicit ResourceSegments(const std::list<IntervalTy> &Intervals) in ResourceSegments() argument
819 : _Intervals(Intervals) { in ResourceSegments()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | DAGCombiner.cpp | 29689 IMap Intervals(A); in parallelizeChainedStores() local
29714 Intervals.insert(0, (St->getMemoryVT().getSizeInBits() + 7) / 8, in parallelizeChainedStores()
29737 auto I = Intervals.find(Offset); in parallelizeChainedStores()
29739 if (I != Intervals.end() && I.start() < (Offset + Length)) in parallelizeChainedStores()
29742 if (I != Intervals.begin() && (--I).stop() <= Offset) in parallelizeChainedStores()
29744 Intervals.insert(Offset, Offset + Length, std::monostate{}); in parallelizeChainedStores()
|