| /freebsd-src/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-src/contrib/wpa/src/p2p/ |
| H A D | p2p_go_neg.c | 43 struct p2p_channels intersection; in p2p_peer_channels_check()
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()
412 * @intersection: Support channel list intersection from local and peer in p2p_reselect_channel()
421 struct p2p_channels *intersection) in p2p_reselect_channel()
435 p2p_channels_includes(intersection, op_reg_class, op_channel)) { in p2p_reselect_channel()
436 p2p_dbg(p2p, "Pick own channel preference (reg_class %u channel %u) from intersection", in p2p_reselect_channel()
42 struct p2p_channels intersection; p2p_peer_channels_check() local
384 p2p_reselect_channel(struct p2p_data * p2p,struct p2p_channels * intersection) p2p_reselect_channel() argument
517 struct p2p_channels tmp, intersection; p2p_go_select_channel() local
[all...] |
| H A D | p2p_invitation.c | 196 struct p2p_channels all_channels, intersection, *channels = NULL; in p2p_process_invitation_req()
263 &intersection); in p2p_process_invitation_req()
264 p2p_channels_dump(p2p, "intersection", &intersection); in p2p_process_invitation_req()
270 &go, group_bssid, &op_freq, persistent, &intersection, in p2p_process_invitation_req()
276 &intersection); in p2p_process_invitation_req()
277 p2p_channels_dump(p2p, "intersection(GO)", &intersection); in p2p_process_invitation_req()
278 if (intersection.reg_classes == 0) { in p2p_process_invitation_req()
295 if (!p2p_channels_includes(&intersection, reg_clas in p2p_process_invitation_req()
186 struct p2p_channels all_channels, intersection, *channels = NULL; p2p_process_invitation_req() local
436 struct p2p_channels intersection, *channels = NULL; p2p_process_invitation_resp() local
[all...] |
| H A D | p2p_utils.c | 101 * p2p_channels_intersect - Intersection of supported channel lists
104 * @res: Data structure for returning the intersection of support channels
|
| /freebsd-src/contrib/llvm-project/llvm/lib/DebugInfo/MSF/ |
| H A D | MappedBlockStream.cpp | 133 Interval Intersection = intersect(CachedExtent, RequestExtent); in readBytes() local
136 if (Intersection != RequestExtent) in readBytes()
140 AbsoluteDifference(CachedExtent.first, Intersection.first); in readBytes()
295 auto Intersection = intersect(WriteInterval, CachedInterval); in fixCacheAfterWrite() local
296 assert(Intersection.first <= Intersection.second); in fixCacheAfterWrite()
298 uint64_t Length = Intersection.second - Intersection.first; in fixCacheAfterWrite()
300 AbsoluteDifference(WriteInterval.first, Intersection.first); in fixCacheAfterWrite()
302 AbsoluteDifference(CachedInterval.first, Intersection.first); in fixCacheAfterWrite()
|
| /freebsd-src/sys/contrib/openzfs/module/zfs/ |
| H A D | space_reftree.c | 41 * intersection of multiple space maps. For example, the union of
43 * The intersection of N range trees is the subset with refcnt >= N.
|
| /freebsd-src/contrib/ncurses/man/ |
| H A D | captoinfo.1m | 153 GC intersection
164 Gc double intersection
|
| /freebsd-src/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-src/sys/contrib/device-tree/Bindings/input/ |
| 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 | twl4030-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 | mediatek,mt6779-keypad.yaml | 18 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 | brcm,bcm-keypad.txt | 5 A key can be placed at each intersection of a unique row and a unique column.
|
| /freebsd-src/contrib/sendmail/src/ |
| H A D | sasl.c | 150 ** INTERSECT -- create the intersection between two lists
157 ** the intersection of both lists.
|
| /freebsd-src/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-src/share/man/man3/ |
| H A D | pthread_sigmask.3 | 58 Intersection of the current mask and the complement of
|
| /freebsd-src/lib/libsys/ |
| H A D | sigprocmask.2 | 70 The new mask is the intersection of the current mask
|
| /freebsd-src/contrib/llvm-project/clang/include/clang/Basic/ |
| H A D | HLSLRuntime.h | 46 ENUM_COMPARE_ASSERT(Intersection)
|
| /freebsd-src/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | ConstantRange.h | 109 /// 'intersection over all y in Other . { x : icmp op x y is true }'. If the
120 /// is exactly same as the subset of intersection over all y in Other.
329 /// Return the range that results from the intersection of this range with
330 /// another range. If the intersection is disjoint, such that two results
|
| /freebsd-src/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | ThreadSafety.cpp | 647 // Computes the intersection of two contexts. The intersection is the
674 // This routine also takes the intersection of C1 and C2, but it does so by
696 // At join points in the CFG, the set is computed as the intersection of
707 // algorithm. Those definitions that remain in the intersection are from blocks
2197 /// Compute the intersection of two locksets and issue warnings for any
2203 /// are the same. In the event of a difference, we use the intersection of these
2404 // block to be the intersection of all previous locksets. in runAnalysis()
2405 // FIXME: By keeping the intersection, we may output more errors in future in runAnalysis()
2406 // for a lock which is not in the intersection, but was in the union. We in runAnalysis()
2408 // the intersection contains Mutex L, and the union contains L and M. in runAnalysis()
[all …]
|
| /freebsd-src/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | VectorUtils.cpp | 817 SmallVector<Metadata *, 4> Intersection; in propagateMetadata()
821 Intersection.push_back(MD1); in propagateMetadata()
827 Intersection.push_back(Item); in propagateMetadata()
831 if (Intersection.size() == 0)
833 if (Intersection.size() == 1) in createBitMaskForGaps()
834 return cast<MDNode>(Intersection.front()); in createBitMaskForGaps()
837 return MDNode::get(Ctx, Intersection); in createBitMaskForGaps()
762 SmallVector<Metadata *, 4> Intersection; intersectAccessGroups() local
|
| /freebsd-src/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | Errc.h | 22 // the intersection of all the ones we support.
|
| /freebsd-src/share/doc/usd/21.troff/ |
| H A D | table2 | 220 \(ca \e\|(ca cap (intersection)
|
| /freebsd-src/contrib/llvm-project/llvm/lib/TableGen/ |
| H A D | SetTheory.cpp | 61 // (and S1, S2) Set intersection.
66 PrintFatalError(Loc, "Set intersection requires two arguments: " + in apply()
|