Home
last modified time | relevance | path

Searched full:intervals (Results 1 – 25 of 415) sorted by relevance

12345678910>>...17

/freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/
H A DIntervalTree.h27 // IntervalTree is a light tree data structure to hold intervals. It allows
28 // finding all intervals that overlap with any given point. At this time,
35 // Closed intervals delimited by PointT objects are mapped to ValueT objects.
54 // static void sortIntervals(IntervalReferences &Intervals, Sorting Sort);
82 // The data represents a set of overlapping intervals:
94 // IL: All intervals whose left value are completely to the left of the middle
96 // IR: All intervals whose right value are completely to the right of the
101 // As IL and IR will contain the same intervals, in order to optimize space,
102 // instead of storing intervals on each node, we use two vectors that will
103 // contain the intervals describe
287 IntervalVector Intervals; // Storage for each interval and all of the fields global() variable
[all...]
H A DCoalescingBitVector.h11 /// into intervals.
30 /// elements into intervals. Good for representing sets which predominantly
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()
[all …]
/freebsd-src/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DIntervalPartition.h1 //===- IntervalPartition.h - CFG Partitioning into Intervals -----*- C++-*-===//
9 // This file defines functionality for partitioning a CFG into intervals and
45 /// intervals) if and only if it is reducible (its limit flow graph has one
70 // blocks or from a graph of other intervals. Each interval has one _header_
89 // Unique identifier of this interval relative to other intervals in the same
95 // Predessor intervals of this interval: those intervals for which there
100 // Successor intervals of this interval: those intervals for which there
112 // Partitions `Cfg` into intervals and constructs the graph of the intervals
113 // based on the edges between nodes in these intervals.
116 // (Further) partitions `Graph` into intervals and constructs the graph of the
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNNSAReassign.cpp85 bool tryAssignRegisters(SmallVectorImpl<LiveInterval *> &Intervals,
90 bool scavengeRegs(SmallVectorImpl<LiveInterval *> &Intervals) const;
109 GCNNSAReassign::tryAssignRegisters(SmallVectorImpl<LiveInterval *> &Intervals, in tryAssignRegisters() argument
111 unsigned NumRegs = Intervals.size(); in tryAssignRegisters()
114 if (VRM->hasPhys(Intervals[N]->reg())) in tryAssignRegisters()
115 LRM->unassign(*Intervals[N]); in tryAssignRegisters()
118 if (LRM->checkInterference(*Intervals[N], MCRegister::from(StartReg + N))) in tryAssignRegisters()
122 LRM->assign(*Intervals[N], MCRegister::from(StartReg + N)); in tryAssignRegisters()
143 GCNNSAReassign::scavengeRegs(SmallVectorImpl<LiveInterval *> &Intervals) const { in scavengeRegs()
144 unsigned NumRegs = Intervals in scavengeRegs()
289 SmallVector<LiveInterval *, 16> Intervals; runOnMachineFunction() local
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Analysis/
H A DIntervalPartition.cpp
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DIntervalPartition.h
H A DIntervalIterator.h
H A DInterval.h
/freebsd-src/contrib/llvm-project/llvm/lib/CodeGen/
H A DRenameIndependentSubregs.cpp91 const SmallVectorImpl<LiveInterval*> &Intervals) const;
96 const SmallVectorImpl<LiveInterval*> &Intervals) const;
101 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()
151 computeMainRangesFixFlags(Classes, SubRangeInfos, Intervals); in INITIALIZE_PASS_DEPENDENCY()
213 const SmallVectorImpl<LiveInterval*> &Intervals) cons in rewriteOperands()
[all...]
H A DStackSlotColoring.cpp70 // SSIntervals - Spill slot intervals.
97 // Join all intervals sharing one color into a single LiveIntervalUnion to
115 // intervals that have already been assigned to this color. in overlaps()
139 // Assignments - Color to intervals mapping.
196 // IntervalSorter - Comparison predicate that sort live intervals by
257 SmallVector<Pair *, 16> Intervals; in InitializeSlots()
259 Intervals.reserve(LS->getNumIntervals()); in InitializeSlots()
261 Intervals.push_back(&I); in InitializeSlots()
262 llvm::sort(Intervals, in InitializeSlots()
266 LLVM_DEBUG(dbgs() << "Spill slot intervals in InitializeSlots()
250 SmallVector<Pair *, 16> Intervals; InitializeSlots() local
[all...]
H A DStackColoring.cpp275 // If we create live intervals for the variables above strictly based
276 // on the lifetime markers, we'll get the set of intervals on the
279 // var, then we get the intervals on the right.
288 // For the intervals on the left, the best we can do is overlap two
351 // now larger than if we were computing live intervals strictly based
412 SmallVector<std::unique_ptr<LiveInterval>, 16> Intervals; member in __anonb9a8fc190111::StackColoring
558 for (unsigned I = 0, E = Intervals.size(); I != E; ++I) { in dumpIntervals()
560 Intervals[I]->dump(); in dumpIntervals()
834 // and update the live intervals. in calculateLiveIntervals()
868 VNInfo *VNI = Intervals[Slo in calculateLiveIntervals()
[all...]
/freebsd-src/bin/sleep/
H A Dsleep.155 Intervals can be written in any form allowed by
57 If multiple intervals are given, they are added together.
126 Support for non-integer intervals, units other than seconds, and
127 multiple intervals which are added together are non-portable
/freebsd-src/contrib/llvm-project/clang/lib/Analysis/
H A DIntervalPartition.cpp1 //===- IntervalPartition.cpp - CFG Partitioning into Intervals --*- C++ -*-===//
9 // This file defines functionality for partitioning a CFG into intervals.
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()
174 // Go back and patch up all the Intervals -- the successors and predecessors. in partitionIntoIntervalsImpl()
175 for (auto [H, N] : Intervals) { in partitionIntoIntervalsImpl()
/freebsd-src/contrib/ntp/html/
H A Dselect.html24 …intervals, which represent truechimers and which represent falsetickers. The principles must be gi…
29 <p>Figure 1 shows correctness intervals for each of four candidates A, B, C and D. We need to find…
31 …t correctness intervals that cannot contribute to the final outcome; that is, they are falseticke…
36 <p>The clock select algorithm again scans the correctness intervals. If the right endpoint of the c…
H A Dclock.html20 <li class="inline"><a href="#inter">Operating Intervals</a></li>
35 …up intervals described below. At the beginning of the interval the hold timer is set to the stepou…
36 <h4 id="inter">Operating Intervals</h4>
37 <p>The state machine operates in one of four nonoverlapping intervals.</p>
46 …<dd> This interval is implicit; that is, it is used when none of the above intervals are used.</dd>
H A Ddiscipline.html24 …Operation is in two modes, phase-lock loop (PLL), which is used at poll intervals below the Allan …
33 …intervals are expressed as exponents of 2. By construction, the time constant exponent is five ti…
36 <p>Since the PLL is linear, the response with different offset step amplitudes and poll intervals h…
43 …measures the clock oscillator frequency and updates a frequency file at intervals of one hour or m…
45 …en this option is enabled, the client sends a volley of six requests at intervals of two seconds. …
H A Dpoll.html15 <p>The poll process sends NTP packets at intervals determined by the clock discipline algorithm.…
17 …intervals. This is designed to reduce the time to synchronize the clock at initial startup (<tt>ib…
/freebsd-src/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DCalcSpillWeights.h36 // accidental SlotIndex gaps for small intervals. The effect is that small in normalizeSpillWeight()
37 // intervals have a spill weight that is mostly proportional to the number in normalizeSpillWeight()
38 // of uses, while large intervals get a spill weight that is closer to a use in normalizeSpillWeight()
68 /// live intervals.
H A DLiveIntervals.h14 /// this implementation intervals can have holes, i.e. an interval might look
319 /// moved within a basic block. This will update the live intervals for all
322 /// \param UpdateFlags Update live intervals for nonallocatable physregs.
325 /// Update intervals of operands of all instructions in the newly
328 /// \param UpdateFlags Update live intervals for nonallocatable physregs.
336 /// Update live intervals for instructions in a range of iterators. It is
357 // the live intervals for individual physical registers. Instead, in getRegMaskSlotsInBlock()
448 /// Split separate components in LiveInterval \p LI into separate intervals.
458 /// Compute live intervals for all virtual registers.
H A DLiveIntervalUnion.h38 /// Union of live intervals that are strong candidates for coalescing into a
40 /// expect the constituent live intervals to be disjoint, although we may
45 // Mapping SlotIndex intervals to virtual register numbers.
103 // Verify the live intervals in this union and add them to the visited set.
/freebsd-src/share/doc/psd/05.sysman/
H A D1.4.t73 #define ITIMER_REAL 0 /* real time intervals */
74 #define ITIMER_VIRTUAL 1 /* virtual time intervals */
112 The system rounds argument timer intervals to be not less than the
/freebsd-src/lib/libsys/
H A Dntp_adjtime.2100 long calcnt; /* calibration intervals (ro) */
214 Count of calibration intervals (PPS, read-only).
216 Number of calibration intervals that have been discarded because the
222 Number of calibration intervals that have been discarded because the
/freebsd-src/lib/msun/ld80/
H A Dk_expl.h40 #define INTERVALS 128 macro
46 * ln2/INTERVALS = L1+L2 (hi+lo decomposition for multiplication). L1 must
47 * have at least 22 (= log2(|LDBL_MIN_EXP-extras|) + log2(INTERVALS)) lowest
56 * (0.002708 is ln2/(2*INTERVALS) rounded up a little).
65 * 2^(i/INTERVALS) for i in [0,INTERVALS] is represented by two values where
76 } tbl[INTERVALS] = {
228 n2 = (unsigned)n % INTERVALS; in __k_expl()
/freebsd-src/lib/libpmc/pmu-events/arch/x86/ivybridge/
H A Dother.json13 "BriefDescription": "Number of intervals between processor halts while thread is in ring 0",
20 … "PublicDescription": "Number of intervals between processor halts while thread is in ring 0.",
/freebsd-src/lib/libpmc/pmu-events/arch/x86/ivytown/
H A Dother.json13 "BriefDescription": "Number of intervals between processor halts while thread is in ring 0",
20 … "PublicDescription": "Number of intervals between processor halts while thread is in ring 0.",

12345678910>>...17