Home
last modified time | relevance | path

Searched full:distance (Results 1 – 25 of 773) sorted by relevance

12345678910>>...31

/freebsd-src/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-src/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
/freebsd-src/sys/contrib/xz-embedded/linux/lib/xz/
H A Dxz_lzma2.h35 * - Match: Repeat a chunk of data at some distance
36 * - Long repeat: Multi-byte match at a recently seen distance
37 * - Short repeat: One-byte repeat at a recently seen distance
145 * the distance slot.
154 * The highest two bits of a 32-bit match distance are encoded using six bits.
155 * This six-bit value is called a distance slot. This way encoding a 32-bit
162 * the highest two bits (distance slot) are always encoded using six bits,
164 * distance slot itself is the same as the actual distance. DIST_MODEL_START
165 * indicates the first distance slot where at least one additional bit is
172 * - distance slot: the highest two bits
[all …]
/freebsd-src/sys/dev/cxgbe/cudbg/
H A Dfastlz.c222 unsigned int distance; in FASTLZ_COMPRESSOR() local
234 distance = 1; in FASTLZ_COMPRESSOR()
246 /* calculate distance to the match */ 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()
279 /* distance is biased */ in FASTLZ_COMPRESSOR()
280 distance--; in FASTLZ_COMPRESSOR()
[all …]
/freebsd-src/contrib/ntp/html/
H A Dstats.html50 …distance.</em> Peer jitter is determined from various jitter components as described above. It rep…
51 <p>The root distance statistic is computed as one-half the <em> root delay</em> of the primary sour…
53 …<p>Note. In order to avoid timing loops, the root distance is adjusted to the maximum of the above…
55 …distance is less than the <em>select threshold</em>, by default 1.5 s, but can be changed accordin…
56 …distance statistic is used by the select, cluster and mitigation algorithms. In this respect, it i…
58 …<li>Root distance defines the maximum error of the clock offset estimate due to all causes as long…
59 …<li>Root distance defines the upper and lower limits of the correctness interval. This interval re…
60 …<li>Root distance is used by the clock cluster algorithm as a weight factor when pruning outliers …
61 …<li>The (normalized) reciprocal of the root distance is used as a weight factor by the combine alg…
62 …<li>Root distance is used by the mitigation algorithm to select the system peer from among the clu…
[all …]
/freebsd-src/contrib/xz/src/liblzma/lzma/
H A Dlzma_common.h49 /// - Match: Repeat a chunk of data at some distance
50 /// - Long repeat: Multi-byte match at a recently seen distance
51 /// - Short repeat: One-byte repeat at a recently seen distance
187 // Match distance //
202 // The highest two bits of a match distance (distance slot) are encoded
208 // the highest two bits (distance slot) are always encoded using six bits,
210 // distance slot itself is the same as the actual distance. DIST_MODEL_START
211 // indicates the first distance slot where at least one additional bit is
216 // - distance slot: the highest two bits
222 // The distance slot value of 14 is for distances 128-191 (see the table in
[all …]
H A Dlzma_decoder.c117 /// If 1, it's a repeated match. The distance is one of rep0 .. rep3.
120 /// If 0, distance of a repeated match is rep0.
124 /// If 0, distance of a repeated match is rep1.
128 /// If 0, distance of a repeated match is rep2. Otherwise it is rep3.
135 /// Probability tree for the highest two bits of the match distance.
140 /// Probability trees for additional bits for match distance when the
141 /// distance is in the range [4, 127].
144 /// Probability tree for the lowest four bits of a match distance
164 uint32_t rep0; ///< Distance of the latest match
165 uint32_t rep1; ///< Distance of second latest match
[all …]
/freebsd-src/contrib/llvm-project/libcxx/include/__ranges/
H A Ddrop_view.h22 #include <__iterator/distance.h>
94 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::end(__rng))))
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::end(__rng));
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(__rn
[all...]
/freebsd-src/sys/contrib/zlib/
H A Dinffast.c16 Decode literal, length, and distance codes and write out the resulting
39 - The maximum input bits used by a length/distance pair is 15 bits for the
40 length code, 5 bits for the length extra, 15 bits for the distance code,
41 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
45 - The maximum bytes that a single length/distance pair can output is 258
58 unsigned dmax; /* maximum distance from zlib header */ in inflate_fast()
69 unsigned dmask; /* mask for first level of distance codes */ in inflate_fast()
74 unsigned dist; /* match distance */ in inflate_fast()
144 if (op & 16) { /* distance base */ in inflate_fast()
158 strm->msg = (char *)"invalid distance too far back"; in inflate_fast()
[all …]
H A Dinftrees.h16 distance, an end-of-block, or an invalid code. For a table
18 that table. For a length or distance, the low four bits of op
22 of a literal, the base length or distance, or the offset from
33 0001eeee - length or distance, eeee is the number of extra bits
39 1444, which is the sum of 852 for literal/length codes and 592 for distance
44 returns 852, and "enough 30 6 15" for distance codes returns 592. The
H A Dinflate.h39 CODELENS, /* i: waiting for length/lit and distance code lengths */
43 DIST, /* i: waiting for distance code */
44 DISTEXT, /* i: waiting for distance extra bits */
91 unsigned dmax; /* zlib header max distance (INFLATE_STRICT) */
106 unsigned offset; /* distance back to copy string from */
111 code const FAR *distcode; /* starting table for distance codes */
117 unsigned ndist; /* number of distance code lengths */
123 int sane; /* if false, allow invalid distance too far */
H A Ddeflate.h44 /* number of distance codes */
126 * bytes. With this organization, matches are limited to a distance of
203 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
207 struct tree_desc_s d_desc; /* desc. for distance tree */
316 /* Mapping from a distance to a distance code. dist is the distance - 1 and
340 # 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
[all …]
/freebsd-src/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-src/contrib/xz/src/liblzma/lz/
H A Dlz_decoder.h33 /// Note that memcpy() still cannot be used if distance < len.
127 dict_get(const lzma_dict *const dict, const uint32_t distance) in dict_get() argument
129 return dict->buf[dict->pos - distance - 1 in dict_get()
130 + (distance < dict->pos in dict_get()
151 /// Validate the match distance
153 dict_is_distance_valid(const lzma_dict *const dict, const size_t distance) in dict_is_distance_valid() argument
155 return dict->full > distance; in dict_is_distance_valid()
159 /// Repeat *len bytes at distance.
161 dict_repeat(lzma_dict *dict, uint32_t distance, uint32_t *len) in dict_repeat() argument
168 size_t back = dict->pos - distance - 1; in dict_repeat()
[all …]
/freebsd-src/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 Dntptrace.mdoc.in30 % ntptrace localhost: stratum 4, offset 0.0019529, synch distance 0.144135
31 server2ozo.com: stratum 2, offset 0.0124263, synch distance 0.115784 usndh.edu:
32 stratum 1, offset 0.0019298, synch distance 0.011993, refid 'WWVB'
38 synchronization distance, and (only for stratum\-1 servers) the reference clock
40 count to the primary source, while the synchronization distance is the
H A Dntptrace.1ntptracemdoc30 % ntptrace localhost: stratum 4, offset 0.0019529, synch distance 0.144135
31 server2ozo.com: stratum 2, offset 0.0124263, synch distance 0.115784 usndh.edu:
32 stratum 1, offset 0.0019298, synch distance 0.011993, refid 'WWVB'
38 synchronization distance, and (only for stratum\-1 servers) the reference clock
40 count to the primary source, while the synchronization distance is the
H A Dntptrace.1ntptraceman45 % ntptrace localhost: stratum 4, offset 0.0019529, synch distance 0.144135
46 server2ozo.com: stratum 2, offset 0.0124263, synch distance 0.115784 usndh.edu:
47 stratum 1, offset 0.0019298, synch distance 0.011993, refid 'WWVB'
54 synchronization distance, and (only for stratum\-1 servers) the reference clock
56 count to the primary source, while the synchronization distance is the
H A Dntptrace.man.in45 % ntptrace localhost: stratum 4, offset 0.0019529, synch distance 0.144135
46 server2ozo.com: stratum 2, offset 0.0124263, synch distance 0.115784 usndh.edu:
47 stratum 1, offset 0.0019298, synch distance 0.011993, refid 'WWVB'
54 synchronization distance, and (only for stratum\-1 servers) the reference clock
56 count to the primary source, while the synchronization distance is the
/freebsd-src/usr.sbin/ntp/doc/
H A Dntptrace.830 % ntptrace localhost: stratum 4, offset 0.0019529, synch distance 0.144135
31 server2ozo.com: stratum 2, offset 0.0124263, synch distance 0.115784 usndh.edu:
32 stratum 1, offset 0.0019298, synch distance 0.011993, refid 'WWVB'
38 synchronization distance, and (only for stratum\-1 servers) the reference clock
40 count to the primary source, while the synchronization distance is the
/freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/
H A Dedit_distance.h1 //===-- llvm/ADT/edit_distance.h - Array edit distance function --- C++ -*-===//
10 /// This file defines a Levenshtein distance function that works for any two
24 /// Determine the edit distance between two sequences.
37 /// \param MaxEditDistance If non-zero, the maximum edit distance that this
38 /// routine is allowed to compute. If the edit distance will exceed that
50 // distance, which is described here:
65 // distance allowed, we can bail out as we will always need at least
/freebsd-src/contrib/xz/src/liblzma/delta/
H A Ddelta_encoder.c23 const size_t distance = coder->distance; in copy_and_encode() local
27 (distance + coder->pos) & 0xFF]; in copy_and_encode()
39 const size_t distance = coder->distance; in encode_in_place() local
43 (distance + coder->pos) & 0xFF]; in encode_in_place()
/freebsd-src/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-src/contrib/llvm-project/libcxx/include/__algorithm/
H A Dinplace_merge.h23 #include <__iterator/distance.h>
161 difference_type __len11; // distance(__first, __m1) in __inplace_merge()
162 difference_type __len21; // distance(__middle, __m2) in __inplace_merge()
169 __len11 = _Ops::distance(__first, __m1); in __inplace_merge()
181 __len21 = _Ops::distance(__middle, __m2); in __inplace_merge()
183 difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) in __inplace_merge()
184 difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 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()
/freebsd-src/contrib/llvm-project/clang/include/clang/Sema/
H A DTypoCorrection.h44 // "Distance" for unusable corrections
47 // The largest distance still considered valid (larger edit distances are
51 // Relative weightings of the "edit distance" components. The higher the
53 // weights mean greater contribution to the total edit distance, with the
54 // best correction candidates having the lowest edit distance).
116 // Convert the given weighted edit distance to a roughly equivalent number of
125 /// Gets the "edit distance" of the typo correction from the typo.
126 /// If Normalized is true, scale the distance down by the CharDistanceWeight
127 /// to return the edit distance in terms of single-character edits.
292 /// determine whether to return an edit distance of 0 or InvalidDistance.
[all …]

12345678910>>...31