Home
last modified time | relevance | path

Searched refs:Interval (Results 1 – 25 of 54) sorted by relevance

123

/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/
H A DInterval.h79 template <typename T> class Interval {
84 Interval() : Top(nullptr), Bottom(nullptr) {} in Interval() function
85 Interval(T *Top, T *Bottom) : Top(Top), Bottom(Bottom) { in Interval() function
89 Interval(ArrayRef<T *> Elems) { in Interval() function
119 using iterator = IntervalIterator<T, Interval>;
125 return iterator(Top, const_cast<Interval &>(*this)); in begin()
129 const_cast<Interval &>(*this)); in end()
132 bool operator==(const Interval &Other) const {
136 bool operator!=(const Interval &Other) const { return !(*this == Other); }
139 bool comesBefore(const Interval &Other) const { in comesBefore()
[all …]
H A DDependencyGraph.h50 extern template class LLVM_TEMPLATE_ABI Interval<MemDGNode>;
317 LLVM_ABI static MemDGNode *getTopMemDGNode(const Interval<Instruction> &Intvl,
321 LLVM_ABI static MemDGNode *getBotMemDGNode(const Interval<Instruction> &Intvl,
326 LLVM_ABI static Interval<MemDGNode> make(const Interval<Instruction> &Instrs,
328 static Interval<MemDGNode> makeEmpty() { return {}; } in makeEmpty()
335 Interval<Instruction> DAGInterval;
368 void scanAndAddDeps(MemDGNode &DstN, const Interval<MemDGNode> &SrcScanRange);
372 void setDefUseUnscheduledSuccs(const Interval<Instruction> &NewInterval);
376 void createNewNodes(const Interval<Instruction> &NewInterval);
448 LLVM_ABI Interval<Instruction> extend(ArrayRef<Instruction *> Instrs);
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Frontend/HLSL/
H A DRootSignatureValidations.cpp185 MapT::const_iterator Interval = Intervals.find(Info.LowerBound); in getOverlapping() local
186 if (!Interval.valid() || Info.UpperBound < Interval.start()) in getOverlapping()
188 return Interval.value(); in getOverlapping()
202 MapT::iterator Interval = Intervals.begin(); in insert() local
208 Interval.advanceTo(LowerBound); in insert()
209 if (!Interval.valid()) // No interval found in insert()
214 if (UpperBound < Interval.start()) in insert()
218 Res = Interval.value(); in insert()
220 if (Interval.start() <= LowerBound && UpperBound <= Interval.stop()) { in insert()
224 } else if (LowerBound <= Interval.start() && in insert()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/
H A DInterval.cpp17 template <typename T> bool Interval<T>::disjoint(const Interval &Other) const { in disjoint()
26 template <typename T> void Interval<T>::print(raw_ostream &OS) const { in print()
43 template <typename T> void Interval<T>::dump() const { print(dbgs()); } in dump()
46 template class LLVM_EXPORT_TEMPLATE Interval<Instruction>; variable
47 template class LLVM_EXPORT_TEMPLATE Interval<MemDGNode>; variable
H A DDependencyGraph.cpp103 MemDGNodeIntervalBuilder::getTopMemDGNode(const Interval<Instruction> &Intvl, in getTopMemDGNode()
116 MemDGNodeIntervalBuilder::getBotMemDGNode(const Interval<Instruction> &Intvl, in getBotMemDGNode()
128 Interval<MemDGNode>
129 MemDGNodeIntervalBuilder::make(const Interval<Instruction> &Instrs, in make()
140 return Interval<MemDGNode>(TopMemN, BotMemN); in make()
228 const Interval<MemDGNode> &SrcScanRange) { in scanAndAddDeps()
242 const Interval<Instruction> &NewInterval) { in setDefUseUnscheduledSuccs()
300 void DependencyGraph::createNewNodes(const Interval<Instruction> &NewInterval) { in createNewNodes()
404 Interval<Instruction> AboveIntvl(DAGInterval.top(), I->getPrevNode()); in notifyCreateInstr()
410 Interval<Instruction> BelowIntvl(I->getNextNode(), DAGInterval.bottom()); in notifyCreateInstr()
[all …]
H A DScheduler.cpp271 Interval<Instruction> ResetIntvl(TopI, LowestI); in trimSchedule()
282 Interval<Instruction> RefillIntvl(DAG.getInterval().top(), LowestI); in trimSchedule()
332 Interval<Instruction> Extension = DAG.extend(Instrs); in trySchedule()
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DIntervalPartition.cpp42 BuildResult<Node> Interval; in buildInterval() local
43 Interval.Nodes.push_back(Header); in buildInterval()
79 return llvm::is_contained(Interval.Nodes, P); in buildInterval()
82 Interval.Nodes.push_back(B); in buildInterval()
98 if (!llvm::is_contained(Interval.Nodes, B)) in buildInterval()
99 Interval.Successors.insert(B); in buildInterval()
101 return Interval; in buildInterval()
113 CFGIntervalNode &Interval = Graph.emplace_back(Graph.size()); in fillIntervalNode() local
122 Index[getID(*N)] = &Interval; in fillIntervalNode()
126 Interval.Nodes = std::move(Result.Nodes); in fillIntervalNode()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/LTO/legacy/
H A DThinLTOCodeGenerator.h145 void setCachePruningInterval(int Interval) { in setCachePruningInterval() argument
146 if(Interval < 0) in setCachePruningInterval()
147 CacheOptions.Policy.Interval.reset(); in setCachePruningInterval()
149 CacheOptions.Policy.Interval = std::chrono::seconds(Interval); in setCachePruningInterval()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIInsertWaitcnts.cpp344 void determineWait(InstCounterType T, RegInterval Interval,
398 bool hasOtherPendingVmemTypes(RegInterval Interval, VmemType V) const { in hasOtherPendingVmemTypes() argument
399 for (int RegNo = Interval.first; RegNo < Interval.second; ++RegNo) { in hasOtherPendingVmemTypes()
407 void clearVgprVmemTypes(RegInterval Interval) { in clearVgprVmemTypes() argument
408 for (int RegNo = Interval.first; RegNo < Interval.second; ++RegNo) { in clearVgprVmemTypes()
425 RegInterval Interval) const;
460 void setScoreByInterval(RegInterval Interval, InstCounterType CntTy,
859 void WaitcntBrackets::setScoreByInterval(RegInterval Interval, in setScoreByInterval() argument
862 for (int RegNo = Interval.first; RegNo < Interval.second; ++RegNo) { in setScoreByInterval()
878 RegInterval Interval = getRegInterval(MI, MRI, TRI, Op); in setScoreByOperand() local
[all …]
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/MSF/
H A DMappedBlockStream.cpp36 using Interval = std::pair<uint64_t, uint64_t>;
38 static Interval intersect(const Interval &I1, const Interval &I2) {
110 Interval RequestExtent = std::make_pair(Offset, Offset + Size); in readBytes()
128 Interval CachedExtent = in readBytes()
133 Interval Intersection = intersect(CachedExtent, RequestExtent); in readBytes()
290 Interval WriteInterval = std::make_pair(Offset, Offset + Data.size()); in fixCacheAfterWrite()
291 Interval CachedInterval = in fixCacheAfterWrite()
37 using Interval = std::pair<uint64_t, uint64_t>; global() typedef
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DLiveIntervals.h152 auto &Interval = VirtRegIntervals[Reg.id()]; in createEmptyInterval() local
153 Interval = createInterval(Reg); in createEmptyInterval()
154 return *Interval; in createEmptyInterval()
172 auto &Interval = VirtRegIntervals[Reg]; in removeInterval() local
173 delete Interval; in removeInterval() local
174 Interval = nullptr; in removeInterval()
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DCachePruning.cpp90 Policy.Interval = *DurationOrErr; in parseCachePruningPolicy()
184 if (!Policy.Interval) in pruneCache()
186 if (Policy.Interval != seconds(0)) { in pruneCache()
191 if (TimeStampAge <= *Policy.Interval) { in pruneCache()
/freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dsecondary.h208 const s32 Interval = atomic_load_relaxed(&ReleaseToOsIntervalMs); in getStats() local
215 Interval >= 0 ? Interval : -1); in getStats()
262 const s32 Interval = atomic_load_relaxed(&ReleaseToOsIntervalMs); in store() local
273 if (Interval == 0 && !SCUDO_FUCHSIA) { in store()
347 if (Interval >= 0) { in store()
353 releaseOlderThan(Time - static_cast<u64>(Interval) * 1000000); in store()
478 const s32 Interval = Max( in setOption() local
481 atomic_store_relaxed(&ReleaseToOsIntervalMs, Interval); in setOption()
H A Dflags.inc46 "Interval (in milliseconds) at which to attempt release of unused "
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DStackColoring.cpp1042 const LiveInterval *Interval = &*Intervals[FromSlot]; in remapInstructions() local
1043 assert(Interval->find(Index) != Interval->end() && in remapInstructions()
1162 LiveInterval *Interval = &*Intervals[Slot]; in removeInvalidSlotRanges() local
1164 if (Interval->find(Index) == Interval->end()) { in removeInvalidSlotRanges()
1165 Interval->clear(); in removeInvalidSlotRanges()
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DCachePruning.h34 std::optional<std::chrono::seconds> Interval = std::chrono::seconds(1200); member
/freebsd/sys/contrib/device-tree/Bindings/power/supply/
H A Dda9150-fg.txt7 - dlg,update-interval: Interval time (milliseconds) between battery level checks.
/freebsd/sys/contrib/device-tree/Bindings/timer/
H A Djcore,pit.txt1 J-Core Programmable Interval Timer and Clocksource
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanAnalysis.cpp488 for (auto &Interval : EndPoint) in calculateRegisterUsageForPlan() local
489 TransposeEnds[Interval.second].push_back(Interval.first); in calculateRegisterUsageForPlan()
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h428 void enableNodeReclamation(unsigned Interval) { in enableNodeReclamation() argument
429 ReclaimCounter = ReclaimNodeInterval = Interval; in enableNodeReclamation()
/freebsd/contrib/llvm-project/llvm/include/llvm/Debuginfod/
H A DDebuginfod.h150 Error updateForever(std::chrono::milliseconds Interval);
/freebsd/sys/contrib/edk2/Include/IndustryStandard/
H A DUsb.h177 UINT8 Interval; member
/freebsd/sys/contrib/device-tree/Bindings/ata/
H A Dahci-ceva.txt36 RIT: Retry Interval Timer.
/freebsd/contrib/llvm-project/llvm/lib/Debuginfod/
H A DDebuginfod.cpp399 Error DebuginfodCollection::updateForever(std::chrono::milliseconds Interval) { in updateForever() argument
403 std::this_thread::sleep_for(Interval); in updateForever()
/freebsd/contrib/llvm-project/lldb/source/Core/
H A DDataFileCache.cpp36 policy.Interval = std::chrono::hours(1); in GetLLDBIndexCachePolicy()

123