Home
last modified time | relevance | path

Searched refs:distance (Results 1 – 25 of 315) sorted by relevance

12345678910>>...13

/freebsd/sys/dev/cxgbe/cudbg/
H A Dfastlz.c222 unsigned int distance; in FASTLZ_COMPRESSOR() local
234 distance = 1; in FASTLZ_COMPRESSOR()
247 distance = anchor - ref; in FASTLZ_COMPRESSOR()
255 if (distance == 0 || in FASTLZ_COMPRESSOR()
257 (distance >= MAX_DISTANCE) || in FASTLZ_COMPRESSOR()
259 (distance >= MAX_FARDISTANCE) || in FASTLZ_COMPRESSOR()
267 if (distance >= MAX_DISTANCE) { in FASTLZ_COMPRESSOR()
280 distance--; in FASTLZ_COMPRESSOR()
282 if (!distance) { in FASTLZ_COMPRESSOR()
333 if (distance < MAX_DISTANCE) { in FASTLZ_COMPRESSOR()
[all …]
/freebsd/sys/contrib/device-tree/Bindings/
H A Dnuma.txt36 3 - distance-map
39 The optional device tree node distance-map describes the relative
40 distance (memory latency) between all numa nodes.
42 - compatible : Should at least contain "numa-distance-map-v1".
44 - distance-matrix
47 It is represented as a list of node pairs and their relative distance.
50 1. Each entry represents distance from first node to second node.
52 2. The distance from a node to self (local distance) is represented
53 with value 10 and all internode distance should be represented with
55 3. distance-matrix should have entries in lexicographical ascending
[all …]
/freebsd/tools/diag/prtblknos/
H A DREADME16 lbn 8-11 blkno 3217864-3217895 distance 216
17 First-level indirect, blkno 3217896-3217903 distance 0
18 lbn 12-19 blkno 3217904-3217967 distance 8
19 lbn 20-75 blkno 3251816-3252263 distance 33848
20 lbn 76-83 blkno 3252368-3252431 distance 104
21 lbn 84-91 blkno 3252464-3252527 distance 32
22 lbn 92-852 blkno 3252896-3258983 distance 368
25 The distance metric is the size of the gap from the end of the
36 above are also in physical block size units. Thus a distance of 8
39 3217896-3217903, and lbn 12 starts distance 8 after lbn 11 immediately
H A Dprtblknos.c48 static const char *distance(struct fs *, ufs2_daddr_t, ufs2_daddr_t);
203 distance(struct fs *fs, ufs2_daddr_t lastblk, ufs2_daddr_t firstblk) function
276 (intmax_t)firstblk, distance(fs, lastblk, firstblk));
281 distance(fs, lastblk, firstblk));
287 distance(fs, lastblk, firstblk));
301 distance(fs, lastindirblk, blkno));
/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Ddrop_view.h94 const auto __dist = std::min(ranges::distance(__base_), __count_); in begin()
110 const auto __dist = std::min(ranges::distance(__base_), __count_); in begin()
228 …ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)), ranges::e…
231 … ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
234 …ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)), ranges::e…
245 … _RawRange(ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
247 std::__to_unsigned_like(ranges::distance(__rng) -
248 … std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n))))))
251 ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
253 std::__to_unsigned_like(ranges::distance(__rng) -
[all …]
H A Dtake_view.h269 …ranges::begin(__rng), ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward…
273 … ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)))) {
275 …ranges::begin(__rng), ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward…
292 … *(ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)))
297 … *(ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)))
301 … *(ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)))
312 …noexcept(noexcept(views::repeat(*__range.__value_, std::min<_Dist>(ranges::distance(__range), std:…
313 …-> decltype( views::repeat(*__range.__value_, std::min<_Dist>(ranges::distance(__range), std:…
314 …{ return views::repeat(*__range.__value_, std::min<_Dist>(ranges::distance(__range), std:…
/freebsd/contrib/ntp/
H A Dresults.y2kfixes10 timelord.att.com: stratum 2, offset -0.000879, synch distance 0.07207
11 timemaster.att.com: stratum 1, offset -0.004876, synch distance 0.03485, refid 'GPS'
21 timelord.att.com: stratum 2, offset 0.001383, synch distance 0.05644
22 timemaster.att.com: stratum 1, offset -0.006355, synch distance 0.04178, refid 'GPS'
32 timelord.att.com: stratum 2, offset -0.000094, synch distance 0.06522
33 timemaster.att.com: stratum 1, offset -0.010803, synch distance 0.03078, refid 'GPS'
43 timelord.att.com: stratum 2, offset -0.000719, synch distance 0.06561
44 timemaster.att.com: stratum 1, offset -0.013598, synch distance 0.03116, refid 'GPS'
/freebsd/contrib/ntp/scripts/ntptrace/
H A Dntptrace-opts.def55 % ntptrace localhost: stratum 4, offset 0.0019529, synch distance 0.144135
56 server2ozo.com: stratum 2, offset 0.0124263, synch distance 0.115784 usndh.edu:
57 stratum 1, offset 0.0019298, synch distance 0.011993, refid 'WWVB'
63 synchronization distance, and (only for stratum-1 servers) the reference clock
65 count to the primary source, while the synchronization distance is the
H A Dinvoke-ntptrace.texi23 % ntptrace localhost: stratum 4, offset 0.0019529, synch distance 0.144135
24 server2ozo.com: stratum 2, offset 0.0124263, synch distance 0.115784 usndh.edu:
25 stratum 1, offset 0.0019298, synch distance 0.011993, refid 'WWVB'
31 synchronization distance, and (only for stratum-1 servers) the reference clock
33 count to the primary source, while the synchronization distance is the
/freebsd/sys/contrib/zlib/
H A Ddeflate.h340 # define _tr_tally_dist(s, distance, length, flush) \ argument
342 ush dist = (ush)(distance); \
359 # define _tr_tally_dist(s, distance, length, flush) \ argument
361 ush dist = (ush)(distance); \
373 # define _tr_tally_dist(s, distance, length, flush) \ argument
374 flush = _tr_tally(s, distance, length)
/freebsd/sys/contrib/device-tree/src/arm64/hisilicon/
H A Dhip07-d05.dts23 distance-map {
24 compatible = "numa-distance-map-v1";
25 distance-matrix = <0 0 10>,
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Diterator_operations.h60 static constexpr auto distance = ranges::distance;
92 distance(_Iter __first, _Iter __last) {
93 return std::distance(__first, __last);
207 auto __dist = _IterOps::distance(__iter, __sentinel);
H A Dis_permutation.h129 _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1);
176 _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1);
179 _D2 __l2 = _IterOps<_AlgPolicy>::distance(__first2, __last2);
205 if (std::distance(__first1, __last1) != std::distance(__first2, __last2))
H A Dinplace_merge.h169 __len11 = _Ops::distance(__first, __m1); in __inplace_merge()
181 __len21 = _Ops::distance(__middle, __m2); in __inplace_merge()
211 difference_type __len1 = _IterOps<_AlgPolicy>::distance(__first, __middle); in __inplace_merge()
212 difference_type __len2 = _IterOps<_AlgPolicy>::distance(__middle, __last); in __inplace_merge()
H A Dranges_is_permutation.h80 if (ranges::distance(__range1) != ranges::distance(__range2))
/freebsd/sys/contrib/device-tree/Bindings/input/touchscreen/
H A Dcyttsp.txt24 - active-distance : the distance in pixels beyond which a touch must move
61 active-distance = <8>;
86 active-distance = <8>;
/freebsd/contrib/llvm-project/compiler-rt/lib/orc/tests/unit/
H A Dadt_test.cpp33 EXPECT_EQ(std::distance(S.begin(), S.end()), 5U) in TEST()
45 EXPECT_EQ(std::distance(S.begin(), S.end()), 5U) in TEST()
/freebsd/tools/tools/net80211/wesside/wesside/
H A Daircrack-ptw-lib.c53 int distance; member
169 if (a->distance > b->distance) { in comparesorthelper()
171 } else if (a->distance == b->distance) { in comparesorthelper()
395 sh[i][j-1].distance = table[i][0].votes - table[i][j].votes; in PTW_computeKey()
/freebsd/contrib/dialog/samples/copifuncs/
H A Dcopi.ifmcfg53 # or long-distance calls. In the example below, my country code is 7,
7 # "7-" is stripped and the long-distance dialing prefix "8W" substituted.
/freebsd/libexec/rtld-elf/powerpc/
H A Dreloc.c389 Elf_Addr distance; in reloc_plt_object() local
406 distance = (Elf_Addr)pltresolve - (Elf_Addr)(where + 1); in reloc_plt_object()
409 (void *)where, (void *)pltresolve, reloff, distance); in reloc_plt_object()
415 where[1] = 0x48000000 | (distance & 0x03fffffc); in reloc_plt_object()
580 int distance; in reloc_jmpslot() local
599 distance = (Elf_Addr)pltcall - (Elf_Addr)(wherep + 1); in reloc_jmpslot()
605 wherep[1] = 0x48000000 | (distance & 0x03fffffc); in reloc_jmpslot()
/freebsd/sys/contrib/zlib/doc/
H A Drfc1951.txt81 3.2.5. Compressed blocks (length and distance codes) ...... 11
206 pair <length, backward distance>. The representation used in the
522 Huffman codes for the literal/length and distance alphabets are
547 decode distance from input stream
549 move backwards distance bytes in the output
556 in a previous block; i.e., the backward distance may cross one
557 or more block boundaries. However a distance cannot refer past
568 distance can refer to that part of the output stream anyway)
571 X and Y, a string reference with <length = 5, distance = 2>
589 3.2.5. Compressed blocks (length and distance codes)
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DParallel.h117 RandomAccessIterator Mid = Start + (std::distance(Start, End) / 2); in medianOf3()
129 if (std::distance(Start, End) < detail::MinParallelSize || Depth == 0) { in parallel_quick_sort()
156 llvm::Log2_64(std::distance(Start, End)) + 1); in parallel_sort()
172 size_t NumInputs = std::distance(Begin, End); in parallel_transform_reduce()
/freebsd/contrib/llvm-project/libcxx/include/__iterator/
H A Ddistance.h46 distance(_InputIter __first, _InputIter __last) { in __distance()
52 // [range.iter.op.distance] in distance()
91 inline constexpr auto distance = __distance::__fn{}; in operator()
51 distance(_InputIter __first, _InputIter __last) distance() function
/freebsd/contrib/llvm-project/libcxx/modules/std/
H A Diterator.cppm
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DBalancedPartitioning.cpp116 unsigned NumNodes = std::distance(Nodes.begin(), Nodes.end()); in bisect()
144 unsigned MidOffset = Offset + std::distance(Nodes.begin(), NodesMid); in bisect()
169 unsigned NumNodes = std::distance(Nodes.begin(), Nodes.end()); in runIterations()
303 unsigned NumNodes = std::distance(Nodes.begin(), Nodes.end()); in split()

12345678910>>...13