Home
last modified time | relevance | path

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

12

/llvm-project-15.0.7/flang/include/flang/Common/
H A Dinterval.h22 template <typename A> class Interval {
25 constexpr Interval() {} in Interval() function
27 constexpr Interval(A &&s, std::size_t n = 1)
29 constexpr Interval(const Interval &) = default;
30 constexpr Interval(Interval &&) = default;
31 constexpr Interval &operator=(const Interval &) = default;
32 constexpr Interval &operator=(Interval &&) = default;
71 void Annex(const Interval &that) { in Annex()
81 void ExtendToCover(const Interval &that) { in ExtendToCover()
105 Interval Suffix(std::size_t n) const { in Suffix()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DInterval.h36 class Interval {
88 inline bool operator==(const Interval &I) const {
99 inline Interval::succ_iterator succ_begin(Interval *I) { in succ_begin()
102 inline Interval::succ_iterator succ_end(Interval *I) { in succ_end()
109 inline Interval::pred_iterator pred_begin(Interval *I) { in pred_begin()
112 inline Interval::pred_iterator pred_end(Interval *I) { in pred_end()
116 template <> struct GraphTraits<Interval*> {
117 using NodeRef = Interval *;
118 using ChildIteratorType = Interval::succ_iterator;
127 template <> struct GraphTraits<Inverse<Interval*>> {
[all …]
H A DIntervalPartition.h32 class Interval; variable
43 using IntervalMapTy = std::map<BasicBlock *, Interval *>;
46 using IntervalListTy = std::vector<Interval *>;
47 Interval *RootInterval = nullptr;
48 std::vector<Interval *> Intervals;
68 inline Interval *getRootInterval() { return RootInterval; } in getRootInterval()
77 inline Interval *getBlockInterval(BasicBlock *BB) { in getBlockInterval()
88 const std::vector<Interval*> &getIntervals() const { return Intervals; } in getIntervals()
97 void addIntervalToPartition(Interval *I);
103 void updatePredecessors(Interval *Int);
H A DIntervalIterator.h71 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { in addNodeToInterval()
81 inline void addNodeToInterval(Interval *Int, Interval *I) { in addNodeToInterval()
89 std::vector<std::pair<Interval *, typename Interval::succ_iterator>> IntStack;
133 const Interval *operator*() const { return IntStack.back().first; }
134 Interval *operator*() { return IntStack.back().first; }
135 const Interval *operator->() const { return operator*(); }
136 Interval *operator->() { return operator*(); }
143 Interval::succ_iterator &SuccIt = IntStack.back().second,
180 Interval *Int = new Interval(Header); in ProcessInterval()
199 void ProcessNode(Interval *Int, NodeTy *Node) { in ProcessNode()
[all …]
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DIntervalPartition.cpp39 for (Interval *I : Intervals) in releaseMemory()
47 for (const Interval *I : Intervals) in print()
54 void IntervalPartition::addIntervalToPartition(Interval *I) { in addIntervalToPartition()
58 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end(); in addIntervalToPartition()
67 void IntervalPartition::updatePredecessors(Interval *Int) { in updatePredecessors()
90 for (Interval *I : Intervals) in runOnFunction()
116 for (Interval *I : Intervals) in IntervalPartition()
H A DInterval.cpp24 void Interval::print(raw_ostream &OS) const { in print()
H A DCMakeLists.txt79 Interval.cpp
/llvm-project-15.0.7/llvm/unittests/Support/
H A DCachePruningTest.cpp18 EXPECT_EQ(std::chrono::seconds(1200), P->Interval); in TEST()
23 TEST(CachePruningPolicyParser, Interval) { in TEST() argument
26 EXPECT_EQ(std::chrono::seconds(1), P->Interval); in TEST()
29 EXPECT_EQ(std::chrono::minutes(2), *P->Interval); in TEST()
32 EXPECT_EQ(std::chrono::hours(3), *P->Interval); in TEST()
70 EXPECT_EQ(std::chrono::seconds(1200), P->Interval); in TEST()
H A DTimerTest.cpp27 struct timespec Interval; in SleepMS()
28 Interval.tv_sec = 0; in SleepMS()
29 Interval.tv_nsec = 1000000; in SleepMS()
30 nanosleep(&Interval, nullptr); in SleepMS()
/llvm-project-15.0.7/llvm/include/llvm/LTO/legacy/
H A DThinLTOCodeGenerator.h137 void setCachePruningInterval(int Interval) { in setCachePruningInterval() argument
138 if(Interval < 0) in setCachePruningInterval()
139 CacheOptions.Policy.Interval.reset(); in setCachePruningInterval()
141 CacheOptions.Policy.Interval = std::chrono::seconds(Interval); in setCachePruningInterval()
/llvm-project-15.0.7/llvm/lib/DebugInfo/MSF/
H A DMappedBlockStream.cpp37 using Interval = std::pair<uint64_t, uint64_t>; typedef
39 static Interval intersect(const Interval &I1, const Interval &I2) { in intersect()
111 Interval RequestExtent = std::make_pair(Offset, Offset + Size); in readBytes()
129 Interval CachedExtent = in readBytes()
134 Interval Intersection = intersect(CachedExtent, RequestExtent); in readBytes()
291 Interval WriteInterval = std::make_pair(Offset, Offset + Data.size()); in fixCacheAfterWrite()
292 Interval CachedInterval = in fixCacheAfterWrite()
/llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/RISCV/
H A Driscv-vector-reverse.ll89 ; CHECK-NEXT: LV(REG): At #0 Interval # 0
90 ; CHECK-NEXT: LV(REG): At #1 Interval # 1
91 ; CHECK-NEXT: LV(REG): At #2 Interval # 2
92 ; CHECK-NEXT: LV(REG): At #3 Interval # 2
93 ; CHECK-NEXT: LV(REG): At #4 Interval # 2
94 ; CHECK-NEXT: LV(REG): At #5 Interval # 3
95 ; CHECK-NEXT: LV(REG): At #6 Interval # 3
96 ; CHECK-NEXT: LV(REG): At #7 Interval # 3
97 ; CHECK-NEXT: LV(REG): At #9 Interval # 1
98 ; CHECK-NEXT: LV(REG): At #10 Interval # 2
[all …]
/llvm-project-15.0.7/llvm/lib/Support/
H A DCachePruning.cpp89 Policy.Interval = *DurationOrErr; in parseCachePruningPolicy()
182 if (!Policy.Interval) in pruneCache()
184 if (Policy.Interval != seconds(0)) { in pruneCache()
189 if (TimeStampAge <= *Policy.Interval) { in pruneCache()
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DSIInsertWaitcnts.cpp508 RegInterval Interval = getRegInterval(MI, TII, MRI, TRI, OpNo); in setExpScore() local
510 for (int RegNo = Interval.first; RegNo < Interval.second; ++RegNo) { in setExpScore()
652 for (int RegNo = Interval.first; RegNo < Interval.second; in updateByEvent()
663 RegInterval Interval = getRegInterval(&Inst, TII, MRI, TRI, I); in updateByEvent() local
665 if (Interval.first >= NUM_ALL_VGPRS) in updateByEvent()
669 for (int RegNo = Interval.first; RegNo < Interval.second; ++RegNo) in updateByEvent()
673 for (int RegNo = Interval.first; RegNo < Interval.second; ++RegNo) { in updateByEvent()
1155 RegInterval Interval = in generateWaitcntInstBefore() local
1159 for (int RegNo = Interval.first; RegNo < Interval.second; ++RegNo) { in generateWaitcntInstBefore()
1732 for (int RegNo = Interval.first; RegNo < Interval.second; ++RegNo) { in shouldFlushVmCnt()
[all …]
/llvm-project-15.0.7/compiler-rt/lib/scudo/standalone/
H A Dsecondary.h151 const s32 Interval = atomic_load_relaxed(&ReleaseToOsIntervalMs); in store() local
163 if (Interval == 0 && !SCUDO_FUCHSIA) { in store()
175 } else if (Interval == 0) { in store()
222 else if (Interval >= 0) in store()
223 releaseOlderThan(Time - static_cast<u64>(Interval) * 1000000); in store()
294 const s32 Interval = in setOption() local
298 atomic_store_relaxed(&ReleaseToOsIntervalMs, Interval); in setOption()
H A Dflags.inc46 "Interval (in milliseconds) at which to attempt release of unused "
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DStackColoring.cpp1063 const LiveInterval *Interval = &*Intervals[FromSlot]; in remapInstructions() local
1064 assert(Interval->find(Index) != Interval->end() && in remapInstructions()
1182 LiveInterval *Interval = &*Intervals[Slot]; in removeInvalidSlotRanges() local
1184 if (Interval->find(Index) == Interval->end()) { in removeInvalidSlotRanges()
1185 Interval->clear(); in removeInvalidSlotRanges()
/llvm-project-15.0.7/llvm/include/llvm/Support/
H A DCachePruning.h32 llvm::Optional<std::chrono::seconds> Interval = std::chrono::seconds(1200); member
/llvm-project-15.0.7/flang/lib/Semantics/
H A Ddata-to-inits.h30 using Range = common::Interval<common::ConstantSubscript>;
/llvm-project-15.0.7/llvm/include/llvm/Debuginfod/
H A DDebuginfod.h130 Error updateForever(std::chrono::milliseconds Interval);
/llvm-project-15.0.7/flang/include/flang/Lower/
H A DPFTBuilder.h412 using Interval = std::tuple<std::size_t, std::size_t>;
418 AggregateStore(Interval &&interval,
443 Interval interval{};
470 const Interval &getInterval() const {
/llvm-project-15.0.7/lldb/tools/lldb-test/
H A Dlldb-test.cpp1026 auto Interval = State.Allocations.find(Addr); in evalFree() local
1027 if (Interval != State.Allocations.end()) { in evalFree()
1028 outs() << formatv("Free: [{0:x}, {1:x})\n", Interval.start(), in evalFree()
1029 Interval.stop()); in evalFree()
1030 Interval.erase(); in evalFree()
/llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/
H A DO3-pipeline.ll129 ; CHECK-NEXT: Live Interval Analysis
138 ; CHECK-NEXT: Live Interval Analysis
151 ; CHECK-NEXT: Live Interval Analysis
/llvm-project-15.0.7/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h444 void enableNodeReclamation(unsigned Interval) { in enableNodeReclamation() argument
445 ReclaimCounter = ReclaimNodeInterval = Interval; in enableNodeReclamation()
/llvm-project-15.0.7/llvm/utils/gn/secondary/llvm/lib/Analysis/
H A DBUILD.gn68 "Interval.cpp",

12