| /freebsd/contrib/ntp/html/ |
| H A D | select.html | 24 …intersection interval</em> is the <em>smallest interval containing points from the largest numbe…
25 …intersection interval. A candidate with a correctness interval that contains points in the inters…
27 <p>Figure 1. Intersection Interval</p>
29 …echimers A, B and C, and one falseticker D. In DTSS any point in the intersection interval can re…
30 …f candidate C is outside the intersection interval, its correctness interval contains points in co…
31 …e to the final outcome; that is, they are truechimers. Samples in the intersection interval are us…
35 …intersection interval. Then, do the same, but moving from the rightmost endpoint towards the leftm…
36 …point of the intersection interval, or if the left endpoint of the correctness interval is less th…
37 … when the candidates are multiple reference clocks. In such cases the intersection interval might …
|
| /freebsd/contrib/wpa/src/p2p/ |
| H A D | p2p_invitation.c | 241 struct p2p_channels all_channels, intersection, *channels = NULL; in p2p_process_invitation_req() local
308 &intersection); in p2p_process_invitation_req()
309 p2p_channels_dump(p2p, "intersection", &intersection); in p2p_process_invitation_req()
315 &go, group_bssid, &op_freq, persistent, &intersection, in p2p_process_invitation_req()
322 &intersection); in p2p_process_invitation_req()
323 p2p_channels_dump(p2p, "intersection(GO)", &intersection); in p2p_process_invitation_req()
324 if (intersection.reg_classes == 0) { in p2p_process_invitation_req()
341 if (!p2p_channels_includes(&intersection, reg_class, channel)) in p2p_process_invitation_req()
343 p2p_dbg(p2p, "forced freq %d MHz not in the supported channels intersection", in p2p_process_invitation_req()
350 channels = &intersection; in p2p_process_invitation_req()
[all …]
|
| H A D | p2p_go_neg.c | 43 struct p2p_channels intersection; in p2p_peer_channels_check() local
79 p2p_channels_intersect(own, &dev->channels, &intersection); in p2p_peer_channels_check()
80 p2p_dbg(p2p, "Own reg_classes %d peer reg_classes %d intersection reg_classes %d", in p2p_peer_channels_check()
83 (int) intersection.reg_classes); in p2p_peer_channels_check()
84 if (intersection.reg_classes == 0) { in p2p_peer_channels_check()
435 * @intersection: Support channel list intersection from local and peer
444 struct p2p_channels *intersection) in p2p_reselect_channel() argument
458 p2p_channels_includes(intersection, op_reg_class, op_channel)) { in p2p_reselect_channel()
459 p2p_dbg(p2p, "Pick own channel preference (reg_class %u channel %u) from intersection", in p2p_reselect_channel()
469 p2p_channels_includes(intersection, op_reg_class, op_channel)) { in p2p_reselect_channel()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/ |
| H A D | Interval.h | 16 // simple set operations, like union, intersection and others.
145 /// \Returns the intersection between this and \p Other.
150 Interval intersection(const Interval &Other) const { in intersection() function
179 Interval Intersection = intersection(Other); variable
182 if (Top != Intersection.Top)
183 Result.emplace_back(Top, Intersection.Top->getPrevNode());
185 if (Intersection.Bottom != Bottom)
186 Result.emplace_back(Intersection.Bottom->getNextNode(), Bottom);
|
| /freebsd/contrib/llvm-project/llvm/lib/DebugInfo/MSF/ |
| H A D | MappedBlockStream.cpp | 133 Interval Intersection = intersect(CachedExtent, RequestExtent); in readBytes()
136 if (Intersection != RequestExtent) in readBytes()
140 AbsoluteDifference(CachedExtent.first, Intersection.first); in readBytes()
295 auto Intersection = intersect(WriteInterval, CachedInterval); in fixCacheAfterWrite()
296 assert(Intersection.first <= Intersection.second); in fixCacheAfterWrite() local
298 uint64_t Length = Intersection.second - Intersection.first; in fixCacheAfterWrite()
300 AbsoluteDifference(WriteInterval.first, Intersection.first); in fixCacheAfterWrite()
302 AbsoluteDifference(CachedInterval.first, Intersection in fixCacheAfterWrite()
134 Interval Intersection = intersect(CachedExtent, RequestExtent); readBytes() local
[all...] |
| /freebsd/contrib/llvm-project/lldb/source/Target/ |
| H A D | CoreFileMemoryRanges.cpp | 47 // Permissions mismatch and it's not a simple intersection. in FinalizeCoreFileSaveRanges()
56 // Simple intersection, we can just not merge these. in FinalizeCoreFileSaveRanges()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | Analysis.h | 200 // The intersection requires the *union* of the explicitly not-preserved in intersect()
201 // IDs and the *intersection* of the preserved IDs. in intersect()
221 // The intersection requires the *union* of the explicitly not-preserved in intersect()
222 // IDs and the *intersection* of the preserved IDs. in intersect()
|
| H A D | ConstantFPRange.h | 114 /// 'intersection over all y in Other . { x : fcmp op x y is true }'. If the
195 /// Return the range that results from the intersection of this range with
|
| H A D | ConstantRange.h | 114 /// 'intersection over all y in Other . { x : icmp op x y is true }'. If the
125 /// is exactly same as the subset of intersection over all y in Other.
335 /// Return the range that results from the intersection of this range with
336 /// another range. If the intersection is disjoint, such that two results
|
| /freebsd/sys/contrib/openzfs/module/zfs/ |
| H A D | space_reftree.c | 32 * intersection of multiple space maps. For example, the union of
34 * The intersection of N range trees is the subset with refcnt >= N.
|
| /freebsd/contrib/ncurses/man/ |
| H A D | captoinfo.1m | 182 GC intersection
193 Gc double intersection
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | CoalescingBitVector.h | 176 /// Set intersection.
178 // Get the overlaps between the two interval maps (i.e. the intersection).
191 // If there is no overlap with Other, the intersection is empty. in intersectWithComplement()
205 "Expected some intersection!"); in intersectWithComplement()
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | ConstantRangeList.cpp | 213 // The intersection of two Ranges is (max(lowers), min(uppers)), and it's in intersectWith()
214 // possible that max(lowers) > min(uppers) if they don't have intersection. in intersectWith()
215 // Add the intersection to result only if it's non-empty. in intersectWith()
|
| /freebsd/sys/contrib/device-tree/Bindings/input/ |
| H A D | twl4030-keypad.txt | 5 A key can be placed at each intersection of a unique row and a unique column.
|
| H A D | omap-keypad.txt | 5 A key can be placed at each intersection of a unique row and a unique column.
|
| H A D | gpio-matrix-keypad.txt | 5 placed at each intersection of a unique row and a unique column. The matrix
|
| H A D | ti,twl4030-keypad.yaml | 15 A key can be placed at each intersection of a unique row and a unique column.
|
| H A D | mediatek,mt6779-keypad.yaml | 19 A key can be placed at each intersection of a unique row and a unique column.
|
| H A D | samsung-keypad.txt | 5 A key can be placed at each intersection of a unique row and a unique column.
|
| H A D | gpio-matrix-keypad.yaml | 16 placed at each intersection of a unique row and a unique column. The matrix
|
| /freebsd/contrib/sendmail/src/ |
| H A D | sasl.c | 150 ** INTERSECT -- create the intersection between two lists
157 ** the intersection of both lists.
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_range.h | 34 // Calculates intersection of two sets of regions in O(N log N) time.
|
| /freebsd/share/man/man3/ |
| H A D | pthread_sigmask.3 | 58 Intersection of the current mask and the complement of
|
| /freebsd/contrib/llvm-project/clang/include/clang/Basic/ |
| H A D | HLSLRuntime.h | 46 ENUM_COMPARE_ASSERT(Intersection)
|
| /freebsd/lib/libsys/ |
| H A D | sigprocmask.2 | 70 The new mask is the intersection of the current mask
|