Home
last modified time | relevance | path

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

12345678910>>...17

/freebsd/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 described by IL and IR. Each node will contain an
[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 …]
H A DIntervalMap.h12 /// KeyT objects are mapped to ValT objects. Intervals of keys that map to the
15 /// Iterators provide ordered access to the compressed intervals rather than the
16 /// individual keys, and insert and erase operations use key intervals as well.
18 /// Like SmallVector, IntervalMap will store the first N intervals in the map
24 /// to work with both closed and half-open intervals.
123 // The IntervalMap works with closed or half-open intervals.
124 // Adjacent intervals that map to the same value are coalesced.
127 // in an interval, and if two intervals are adjacent so they can be coalesced.
128 // The provided implementation works for closed integer intervals, other keys
133 // It is assumed that (a;b] half-open intervals ar
[all...]
/freebsd/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.size(); in scavengeRegs()
[all …]
/freebsd/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) const { 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.
139 // Assignments - Color to intervals mapping.
196 // IntervalSorter - Comparison predicate that sort live intervals by
257 SmallVector<Pair *, 16> Intervals; in InitializeSlots() local
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:\n"); in InitializeSlots()
[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 __anon570007070111::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[Slot]->getValNumInfo(0); in calculateLiveIntervals()
[all …]
H A DSplitKit.h279 /// it to overlap the other intervals. If it is going to spill anyway, no
283 /// doesn't overlap any other intervals, and the original interval is
288 /// SM_Size - Overlap intervals to minimize the number of inserted COPY
295 /// SM_Speed - Overlap intervals to minimize the expected execution
302 /// Edit - The current parent register and new intervals created.
328 /// intervals. Given a pair (RegIdx, ParentVNI->id), Values contains:
347 /// complement interval can overlap the other intervals, so it gets its own
348 /// LICalc instance. When not in spill mode, all intervals can share one.
445 /// Newly created intervals will be appended to newIntervals.
/freebsd/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/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 Dassoc.html53 …e is required, it is generally best to set the minimum and maximum poll intervals of each root ser…
61 …copt.html">Miscellaneous Options</a> pages. However, when using maximum intervals much larger than…
67 …n both peers are configured in symmetric active mode with matching poll intervals of 6 (64 s).</li>
68 …elephone modem driver. In this case the recommended minimum and maximum intervals are 12 (1.1 hr) …
71 …intervals less than the poll interval. For instance, with the <tt>burst</tt> and <tt>iburst</tt> o…
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/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,
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/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/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/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/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/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.",
/freebsd/contrib/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerDataFlowTrace.cpp194 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()
/freebsd/lib/msun/ld128/
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
64 * (0.002708 is ln2/(2*INTERVALS) rounded up a little).
100 } tbl[INTERVALS] = {
246 n2 = (unsigned)n % INTERVALS; in __k_expl()
/freebsd/contrib/tzcode/
H A Dzdump.839 Output a description of time intervals.
48 Output a verbose description of time intervals.
206 at twelve-hour intervals.

12345678910>>...17