Home
last modified time | relevance | path

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

12

/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A DInterval.h37 class Interval {
89 inline bool operator==(const Interval &I) const {
103 inline Interval::succ_iterator succ_begin(Interval *I) { in succ_begin()
106 inline Interval::succ_iterator succ_end(Interval *I) { in succ_end()
113 inline Interval::pred_iterator pred_begin(Interval *I) { in pred_begin()
116 inline Interval::pred_iterator pred_end(Interval *I) { in pred_end()
120 template <> struct GraphTraits<Interval*> {
121 using NodeRef = Interval *;
122 using ChildIteratorType = Interval::succ_iterator;
131 template <> struct GraphTraits<Inverse<Interval*>> {
[all …]
H A DIntervalPartition.h33 class Interval; variable
44 using IntervalMapTy = std::map<BasicBlock *, Interval *>;
47 using IntervalListTy = std::vector<Interval *>;
48 Interval *RootInterval = nullptr;
49 std::vector<Interval *> Intervals;
71 inline Interval *getRootInterval() { return RootInterval; } in getRootInterval()
80 inline Interval *getBlockInterval(BasicBlock *BB) { in getBlockInterval()
91 const std::vector<Interval*> &getIntervals() const { return Intervals; } in getIntervals()
100 void addIntervalToPartition(Interval *I);
106 void updatePredecessors(Interval *Int);
H A DIntervalIterator.h73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { in addNodeToInterval()
83 inline void addNodeToInterval(Interval *Int, Interval *I) { in addNodeToInterval()
91 std::vector<std::pair<Interval *, typename Interval::succ_iterator>> IntStack;
135 const Interval *operator*() const { return IntStack.back().first; }
136 Interval *operator*() { return IntStack.back().first; }
137 const Interval *operator->() const { return operator*(); }
138 Interval *operator->() { return operator*(); }
145 Interval::succ_iterator &SuccIt = IntStack.back().second,
182 Interval *Int = new Interval(Header); in ProcessInterval()
201 void ProcessNode(Interval *Int, NodeTy *Node) { in ProcessNode()
[all …]
/freebsd-12.1/contrib/llvm/lib/Support/
H A DLockFileManager.cpp299 unsigned long Interval = 1; in waitForUnlock() local
301 struct timespec Interval; in waitForUnlock() local
302 Interval.tv_sec = 0; in waitForUnlock()
303 Interval.tv_nsec = 1000000; in waitForUnlock()
314 Sleep(Interval); in waitForUnlock()
316 nanosleep(&Interval, nullptr); in waitForUnlock()
333 Interval *= 2; in waitForUnlock()
335 Interval.tv_sec *= 2; in waitForUnlock()
336 Interval.tv_nsec *= 2; in waitForUnlock()
338 ++Interval.tv_sec; in waitForUnlock()
[all …]
H A DCachePruning.cpp97 Policy.Interval = *DurationOrErr; in parseCachePruningPolicy()
190 if (!Policy.Interval) in pruneCache()
192 if (Policy.Interval != seconds(0)) { in pruneCache()
197 if (TimeStampAge <= *Policy.Interval) { in pruneCache()
/freebsd-12.1/contrib/llvm/include/llvm/LTO/legacy/
H A DThinLTOCodeGenerator.h155 void setCachePruningInterval(int Interval) { in setCachePruningInterval() argument
156 if(Interval < 0) in setCachePruningInterval()
157 CacheOptions.Policy.Interval.reset(); in setCachePruningInterval()
159 CacheOptions.Policy.Interval = std::chrono::seconds(Interval); in setCachePruningInterval()
/freebsd-12.1/contrib/llvm/lib/DebugInfo/MSF/
H A DMappedBlockStream.cpp39 using Interval = std::pair<uint32_t, uint32_t>; typedef
41 static Interval intersect(const Interval &I1, const Interval &I2) { in intersect()
113 Interval RequestExtent = std::make_pair(Offset, Offset + Size); in readBytes()
131 Interval CachedExtent = in readBytes()
136 Interval Intersection = intersect(CachedExtent, RequestExtent); in readBytes()
293 Interval WriteInterval = std::make_pair(Offset, Offset + Data.size()); in fixCacheAfterWrite()
294 Interval CachedInterval = in fixCacheAfterWrite()
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DIntervalPartition.cpp50 void IntervalPartition::addIntervalToPartition(Interval *I) { in addIntervalToPartition()
54 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end(); in addIntervalToPartition()
63 void IntervalPartition::updatePredecessors(Interval *Int) { in updatePredecessors()
H A DInterval.cpp27 bool Interval::isLoop() const { in isLoop()
37 void Interval::print(raw_ostream &OS) const { in print()
/freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/
H A DSIInsertWaitcnts.cpp496 RegInterval Interval = getRegInterval(MI, TII, MRI, TRI, OpNo, false); in setExpScore() local
501 for (signed RegNo = Interval.first; RegNo < Interval.second; ++RegNo) { in setExpScore()
631 RegInterval Interval = getRegInterval(&Inst, TII, MRI, TRI, OpNo, false); in updateByEvent()
632 for (signed RegNo = Interval.first; RegNo < Interval.second; in updateByEvent()
640 RegInterval Interval = getRegInterval(&Inst, TII, MRI, TRI, I, true); in updateByEvent() local
641 if (T == VM_CNT && Interval.first >= NUM_ALL_VGPRS) in updateByEvent()
643 for (signed RegNo = Interval.first; RegNo < Interval.second; ++RegNo) { in updateByEvent()
945 RegInterval Interval = in generateWaitcntInstBefore() local
947 for (signed RegNo = Interval.first; RegNo < Interval.second; ++RegNo) { in generateWaitcntInstBefore()
981 RegInterval Interval = in generateWaitcntInstBefore() local
[all …]
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DStackColoring.cpp1012 const LiveInterval *Interval = &*Intervals[FromSlot]; in remapInstructions() local
1013 assert(Interval->find(Index) != Interval->end() && in remapInstructions()
1109 LiveInterval *Interval = &*Intervals[Slot]; in removeInvalidSlotRanges() local
1111 if (Interval->find(Index) == Interval->end()) { in removeInvalidSlotRanges()
1112 Interval->clear(); in removeInvalidSlotRanges()
H A DLiveIntervals.cpp870 LiveInterval& Interval = createEmptyInterval(reg); in addSegmentToEndOfBlock() local
871 VNInfo *VN = Interval.getNextValue( in addSegmentToEndOfBlock()
876 Interval.addSegment(S); in addSegmentToEndOfBlock()
/freebsd-12.1/contrib/llvm/include/llvm/Support/
H A DCachePruning.h32 llvm::Optional<std::chrono::seconds> Interval = std::chrono::seconds(1200); member
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h405 void enableNodeReclamation(unsigned Interval) { in enableNodeReclamation() argument
406 ReclaimCounter = ReclaimNodeInterval = Interval; in enableNodeReclamation()
/freebsd-12.1/share/misc/
H A Dscsi_modes172 {Background Medium Scan Interval Time} i2
271 {Interval Timer} i4
H A Dusb_hid_usages1054 0x54 Trigger Repeat Interval
/freebsd-12.1/sys/contrib/dev/acpica/include/
H A Dactbl1.h517 UINT32 Interval; /* Polling interval (msec) */ member
/freebsd-12.1/sys/contrib/dev/acpica/common/
H A Ddmtbinfo1.c365 {ACPI_DMT_UINT32, ACPI_CPEP0_OFFSET (Interval), "Polling Interval", 0},
/freebsd-12.1/contrib/ntp/ntpd/
H A Dntpd-opts.def432 .Ss "Poll Interval Control"
/freebsd-12.1/usr.sbin/bsnmpd/modules/snmp_pf/
H A DBEGEMOT-PF-MIB.txt409 "Interval between purging expired states and fragments."
/freebsd-12.1/contrib/ntp/ntpq/
H A Dntpq.texi313 Interval in s between the receipt of the most recent packet from this
H A Dntpq-opts.def566 Interval in seconds between the receipt of the most recent packet from
/freebsd-12.1/sys/dev/aic7xxx/
H A Daic79xx.reg2437 * Data Group CRC Interval.
2465 * Packetized CRC Interval
/freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp5129 for (auto &Interval : EndPoint) in calculateRegisterUsage() local
5130 TransposeEnds[Interval.second].push_back(Interval.first); in calculateRegisterUsage()
/freebsd-12.1/contrib/wpa/hostapd/
H A DChangeLog1252 * added support for Acct-Interim-Interval:
1254 - use Acct-Interim-Interval attribute from Access-Accept if local

12