Home
last modified time | relevance | path

Searched refs:best_len (Results 1 – 17 of 17) sorted by relevance

/external/rust/crates/libz-sys/src/zlib-ng/
Dmatch_tpl.h40 uint32_t chain_length, nice_match, best_len, offset; in LONGEST_MATCH() local
52 return best_len; in LONGEST_MATCH()
57 best_len = s->prev_length ? s->prev_length : 1; in LONGEST_MATCH()
62 offset = best_len-1; in LONGEST_MATCH()
64 if (best_len >= sizeof(uint32_t)) { in LONGEST_MATCH()
67 if (best_len >= sizeof(uint64_t)) in LONGEST_MATCH()
83 if (best_len >= s->good_match) in LONGEST_MATCH()
105 if (best_len < sizeof(uint32_t)) { in LONGEST_MATCH()
113 } else if (best_len >= sizeof(uint64_t)) { in LONGEST_MATCH()
140 if (len > best_len) { in LONGEST_MATCH()
[all …]
/external/ppp/pppd/plugins/pppoatm/
Dmisc.c23 int ref_len,best_len,len; in __atmlib_fetch() local
29 best_len = 0; in __atmlib_fetch()
33 if (*value != '!' && len <= ref_len && len > best_len && in __atmlib_fetch()
36 best_len = len; in __atmlib_fetch()
40 if (best > -1) (*pos) += best_len; in __atmlib_fetch()
/external/brotli/c/enc/
Dhash_longest_match64_inc.h176 size_t best_len = out->len; in FN() local
192 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
193 prev_ix + best_len > ring_buffer_mask || in FN()
194 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
210 best_len = len; in FN()
211 out->len = best_len; in FN()
233 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
234 prev_ix + best_len > ring_buffer_mask || in FN()
235 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
249 best_len = len; in FN()
[all …]
Dhash_longest_match_inc.h172 size_t best_len = out->len; in FN() local
188 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
189 prev_ix + best_len > ring_buffer_mask || in FN()
190 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
206 best_len = len; in FN()
207 out->len = best_len; in FN()
228 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
229 prev_ix + best_len > ring_buffer_mask || in FN()
230 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
244 best_len = len; in FN()
[all …]
Dhash_to_binary_tree_inc.h116 const size_t max_backward, size_t* const BROTLI_RESTRICT best_len, in FN()
163 if (matches && len > *best_len) { in FN()
164 *best_len = len; in FN()
211 size_t best_len = 1; in FN() local
218 for (i = cur_ix - 1; i > stop && best_len <= 2; --i) { in FN()
233 if (len > best_len) { in FN()
234 best_len = len; in FN()
239 if (best_len < max_length) { in FN()
241 ring_buffer_mask, max_length, max_backward, &best_len, matches); in FN()
247 size_t minlen = BROTLI_MAX(size_t, 4, best_len + 1); in FN()
Dhash_forgetful_chain_inc.h207 size_t best_len = out->len; in FN() local
233 best_len = len; in FN()
234 out->len = best_len; in FN()
256 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
257 prev_ix + best_len > ring_buffer_mask || in FN()
258 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
272 best_len = len; in FN()
273 out->len = best_len; in FN()
Dhash_longest_match_quickly_inc.h163 size_t best_len = best_len_in; in FN() local
169 if (compare_char == data[prev_ix + best_len]) { in FN()
182 best_len = len; in FN()
229 if (compare_char != data[prev_ix + best_len]) { in FN()
241 best_len = len; in FN()
Dbackward_references_hq.c445 size_t best_len = min_len - 1; in UpdateNodes() local
447 for (; j < BROTLI_NUM_DISTANCE_SHORT_CODES && best_len < max_len; ++j) { in UpdateNodes()
453 uint8_t continuation = ringbuffer[cur_ix_masked + best_len]; in UpdateNodes()
454 if (cur_ix_masked + best_len > ringbuffer_mask) { in UpdateNodes()
468 if (prev_ix + best_len > ringbuffer_mask || in UpdateNodes()
469 continuation != ringbuffer[prev_ix + best_len]) { in UpdateNodes()
484 for (l = best_len + 1; l <= len; ++l) { in UpdateNodes()
495 best_len = l; in UpdateNodes()
/external/llvm/test/CodeGen/X86/
Dzlib-longest-match.ll81 %best_len.0 = phi i32 [ %best_len.1, %land.rhs131 ], [ %3, %entry ]
88 %idxprom25 = sext i32 %best_len.0 to i64
96 %sub30 = add nsw i32 %best_len.0, -1
197 %cmp112 = icmp sgt i32 %sub110, %best_len.0
218 …best_len.1 = phi i32 [ %best_len.0, %do.body ], [ %best_len.0, %lor.lhs.false ], [ %best_len.0, %l…
235 …%best_len.2 = phi i32 [ %best_len.1, %land.rhs131 ], [ %best_len.1, %do.cond125 ], [ %sub110, %if.…
236 %cmp137 = icmp ugt i32 %best_len.2, %11
237 %.best_len.2 = select i1 %cmp137, i32 %11, i32 %best_len.2
238 ret i32 %.best_len.2
/external/llvm-project/llvm/test/CodeGen/X86/
Dzlib-longest-match.ll81 %best_len.0 = phi i32 [ %best_len.1, %land.rhs131 ], [ %3, %entry ]
88 %idxprom25 = sext i32 %best_len.0 to i64
96 %sub30 = add nsw i32 %best_len.0, -1
197 %cmp112 = icmp sgt i32 %sub110, %best_len.0
218 …best_len.1 = phi i32 [ %best_len.0, %do.body ], [ %best_len.0, %lor.lhs.false ], [ %best_len.0, %l…
235 …%best_len.2 = phi i32 [ %best_len.1, %land.rhs131 ], [ %best_len.1, %do.cond125 ], [ %sub110, %if.…
236 %cmp137 = icmp ugt i32 %best_len.2, %11
237 %.best_len.2 = select i1 %cmp137, i32 %11, i32 %best_len.2
238 ret i32 %.best_len.2
/external/libwebsockets/win32port/zlib/
Ddeflate.c1083 int best_len = s->prev_length; /* best match length so far */ local
1099 register ush scan_end = *(ushf*)(scan+best_len-1);
1102 register Byte scan_end1 = scan[best_len-1];
1103 register Byte scan_end = scan[best_len];
1138 if (*(ushf*)(match+best_len-1) != scan_end ||
1169 if (match[best_len] != scan_end ||
1170 match[best_len-1] != scan_end1 ||
1200 if (len > best_len) {
1202 best_len = len;
1205 scan_end = *(ushf*)(scan+best_len-1);
[all …]
/external/zlib/
Ddeflate.c1289 int best_len = (int)s->prev_length; /* best match length so far */ local
1305 register ush scan_end = *(ushf*)(scan+best_len-1);
1308 register Byte scan_end1 = scan[best_len-1];
1309 register Byte scan_end = scan[best_len];
1344 if (*(ushf*)(match+best_len-1) != scan_end ||
1384 if (match[best_len] != scan_end ||
1385 match[best_len-1] != scan_end1 ||
1424 if (len > best_len) {
1426 best_len = len;
1429 scan_end = *(ushf*)(scan+best_len-1);
[all …]
/external/python/cpython2/Modules/zlib/
Ddeflate.c1244 int best_len = (int)s->prev_length; /* best match length so far */ local
1260 register ush scan_end = *(ushf*)(scan+best_len-1);
1263 register Byte scan_end1 = scan[best_len-1];
1264 register Byte scan_end = scan[best_len];
1299 if (*(ushf*)(match+best_len-1) != scan_end ||
1330 if (match[best_len] != scan_end ||
1331 match[best_len-1] != scan_end1 ||
1361 if (len > best_len) {
1363 best_len = len;
1366 scan_end = *(ushf*)(scan+best_len-1);
[all …]
/external/rust/crates/libz-sys/src/zlib/
Ddeflate.c1244 int best_len = (int)s->prev_length; /* best match length so far */ local
1260 register ush scan_end = *(ushf*)(scan+best_len-1);
1263 register Byte scan_end1 = scan[best_len-1];
1264 register Byte scan_end = scan[best_len];
1299 if (*(ushf*)(match+best_len-1) != scan_end ||
1330 if (match[best_len] != scan_end ||
1331 match[best_len-1] != scan_end1 ||
1361 if (len > best_len) {
1363 best_len = len;
1366 scan_end = *(ushf*)(scan+best_len-1);
[all …]
/external/angle/third_party/zlib/
Ddeflate.c1289 int best_len = (int)s->prev_length; /* best match length so far */ local
1305 register ush scan_end = *(ushf*)(scan+best_len-1);
1308 register Byte scan_end1 = scan[best_len-1];
1309 register Byte scan_end = scan[best_len];
1344 if (*(ushf*)(match+best_len-1) != scan_end ||
1384 if (match[best_len] != scan_end ||
1385 match[best_len-1] != scan_end1 ||
1424 if (len > best_len) {
1426 best_len = len;
1429 scan_end = *(ushf*)(scan+best_len-1);
[all …]
/external/llvm-project/llvm/test/Transforms/InstCombine/
Dgep-combine-loop-invariant.ll7 define i32 @foo(i8* nocapture readnone %match, i32 %cur_match, i32 %best_len, i32 %scan_end, i32* n…
50 %idx.ext1 = zext i32 %best_len to i64
/external/rust/crates/libz-sys/src/zlib/contrib/masmx86/
Dmatch686.asm53 best_len equ dword ptr [esp+NbStack-36] define