Searched refs:distance (Results 1 - 25 of 247) sorted by relevance

12345678910

/freebsd-current/contrib/xz/src/liblzma/delta/
H A Ddelta_private.h22 /// Delta distance
23 size_t distance; member in struct:__anon83
H A Ddelta_encoder.c24 const size_t distance = coder->distance; local
28 (distance + coder->pos) & 0xFF];
40 const size_t distance = coder->distance; local
44 (distance + coder->pos) & 0xFF];
H A Ddelta_decoder.c20 const size_t distance = coder->distance; local
23 buffer[i] += coder->history[(distance + coder->pos) & 0xFF];
H A Ddelta_common.c49 // Set the delta distance.
51 coder->distance = opt->dist;
/freebsd-current/sys/dev/cxgbe/cudbg/
H A Dfastlz.c222 unsigned int distance; local
234 distance = 1;
246 /* calculate distance to the match */
247 distance = anchor - ref;
255 if (distance == 0 ||
257 (distance >= MAX_DISTANCE) ||
259 (distance >= MAX_FARDISTANCE) ||
267 if (distance >= MAX_DISTANCE) {
279 /* distance is biased */
280 distance
[all...]
/freebsd-current/contrib/xz/src/liblzma/lz/
H A Dlz_decoder.h103 dict_get(const lzma_dict *const dict, const uint32_t distance) argument
105 return dict->buf[dict->pos - distance - 1
106 + (distance < dict->pos ? 0 : dict->size)];
118 /// Validate the match distance
120 dict_is_distance_valid(const lzma_dict *const dict, const size_t distance) argument
122 return dict->full > distance;
126 /// Repeat *len bytes at distance.
128 dict_repeat(lzma_dict *dict, uint32_t distance, uint32_t *len) argument
138 if (distance < left) {
142 dict->buf[dict->pos] = dict_get(dict, distance);
[all...]
/freebsd-current/contrib/llvm-project/libcxx/include/__algorithm/
H A Dpartition_point.h15 #include <__iterator/distance.h>
28 difference_type __len = std::distance(__first, __last);
H A Dupper_bound.h19 #include <__iterator/distance.h>
36 auto __len = _IterOps<_AlgPolicy>::distance(__first, __last);
H A Dlower_bound.h19 #include <__iterator/distance.h>
33 auto __len = _IterOps<_AlgPolicy>::distance(__first, __last);
H A Diterator_operations.h16 #include <__iterator/distance.h>
59 static constexpr auto distance = ranges::distance; member in struct:_IterOps
88 // distance
91 distance(_Iter __first, _Iter __last) { function in struct:_IterOps
92 return std::distance(__first, __last);
H A Dranges_search.h19 #include <__iterator/distance.h>
48 auto __size2 = ranges::distance(__first2, __last2);
53 auto __size1 = ranges::distance(__first1, __last1);
H A Dranges_equal.h19 #include <__iterator/distance.h>
80 if (ranges::distance(__range1) != ranges::distance(__range2))
H A Dranges_is_permutation.h18 #include <__iterator/distance.h>
80 if (ranges::distance(__range1) != ranges::distance(__range2))
H A Dis_permutation.h19 #include <__iterator/distance.h>
129 _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1);
144 // 2+2 iterators, predicate, non-constant time `distance`.
176 _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1);
179 _D2 __l2 = _IterOps<_AlgPolicy>::distance(__first2, __last2);
187 // 2+2 iterators, predicate, specialization for constant-time `distance` call.
205 if (std::distance(__first1, __last1) != std::distance(__first2, __last2))
H A Dranges_partition_point.h17 #include <__iterator/distance.h>
45 auto __len = ranges::distance(__first, __last);
/freebsd-current/contrib/llvm-project/compiler-rt/lib/orc/tests/unit/
H A Dadt_test.cpp33 EXPECT_EQ(std::distance(S.begin(), S.end()), 5U)
45 EXPECT_EQ(std::distance(S.begin(), S.end()), 5U)
/freebsd-current/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_);
110 const auto __dist = std::min(ranges::distance(__base_), __count_);
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...]
H A Dtake_view.h25 #include <__iterator/distance.h>
269 ranges::begin(__rng), ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)))))
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<_Np>(__n)));
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::forward<_Np>(__n)))))
313 -> decltype( views::repeat(*__range.__value_, std::min<_Dist>(ranges::distance(__range), std::forward<_Np>(__n))))
314 { return views::repeat(*__range.__value_, std::min<_Dist>(ranges::distance(__rang
[all...]
/freebsd-current/sys/contrib/zlib/
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) \
342 ush dist = (ush)(distance); \
359 # define _tr_tally_dist(s, distance, lengt
[all...]
/freebsd-current/tools/diag/prtblknos/
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
215 snprintf(buf, 100, " distance %jd", (intmax_t)delta);
276 (intmax_t)firstblk, distance(fs, lastblk, firstblk));
281 distance(fs, lastblk, firstblk));
287 distance(fs, lastblk, firstblk));
301 distance(fs, lastindirblk, blkno));
/freebsd-current/contrib/llvm-project/libcxx/include/__iterator/
H A Ddistance.h46 distance(_InputIter __first, _InputIter __last) { function
52 // [range.iter.op.distance]
91 inline constexpr auto distance = __distance::__fn{}; member in namespace:ranges::__cpo
/freebsd-current/contrib/wpa/wpa_supplicant/
H A Dwnm_sta.h37 u32 distance; /* valid if bearing_present=1 */ member in struct:neighbor_report
/freebsd-current/contrib/llvm-project/llvm/lib/MCA/Stages/
H A DInstructionTables.cpp33 unsigned Index = std::distance(Masks.begin(), find(Masks, Resource.first));
H A DEntryStage.cpp75 NumRetired = std::distance(Instructions.begin(), It);
/freebsd-current/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/
H A DDWARFAttribute.cpp26 return std::distance(beg, pos);

Completed in 160 milliseconds

12345678910