Home
last modified time | relevance | path

Searched refs:best_len (Results 1 - 20 of 20) sorted by relevance

/third_party/node/deps/brotli/c/enc/
H A Dhash_longest_match64_inc.h176 size_t best_len = out->len; in FindLongestMatch() local
192 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
193 prev_ix + best_len > ring_buffer_mask || in FindLongestMatch()
194 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
210 best_len = len; in FindLongestMatch()
211 out->len = best_len; in FindLongestMatch()
233 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
234 prev_ix + best_len > ring_buffer_mask || in FindLongestMatch()
235 data[cur_ix_masked + best_len] ! in FindLongestMatch()
[all...]
H A Dhash_longest_match_inc.h172 size_t best_len = out->len; in FindLongestMatch() local
188 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
189 prev_ix + best_len > ring_buffer_mask || in FindLongestMatch()
190 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
206 best_len = len; in FindLongestMatch()
207 out->len = best_len; in FindLongestMatch()
228 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
229 prev_ix + best_len > ring_buffer_mask || in FindLongestMatch()
230 data[cur_ix_masked + best_len] ! in FindLongestMatch()
[all...]
H A Dhash_to_binary_tree_inc.h116 const size_t max_backward, size_t* const BROTLI_RESTRICT best_len, in StoreAndFindMatches()
163 if (matches && len > *best_len) { in StoreAndFindMatches()
164 *best_len = len; in StoreAndFindMatches()
211 size_t best_len = 1; in FindAllMatches() local
218 for (i = cur_ix - 1; i > stop && best_len <= 2; --i) { in FindAllMatches()
233 if (len > best_len) { in FindAllMatches()
234 best_len = len; in FindAllMatches()
239 if (best_len < max_length) { in FindAllMatches()
241 ring_buffer_mask, max_length, max_backward, &best_len, matches); in FindAllMatches()
247 size_t minlen = BROTLI_MAX(size_t, 4, best_len in FindAllMatches()
113 StoreAndFindMatches( HashToBinaryTree* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data, const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length, const size_t max_backward, size_t* const BROTLI_RESTRICT best_len, BackwardMatch* BROTLI_RESTRICT matches) StoreAndFindMatches() argument
[all...]
H A Dhash_forgetful_chain_inc.h207 size_t best_len = out->len; in FindLongestMatch() local
233 best_len = len; in FindLongestMatch()
234 out->len = best_len; in FindLongestMatch()
256 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
257 prev_ix + best_len > ring_buffer_mask || in FindLongestMatch()
258 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
272 best_len = len; in FindLongestMatch()
273 out->len = best_len; in FindLongestMatch()
H A Dhash_longest_match_quickly_inc.h163 size_t best_len = best_len_in; in FindLongestMatch() local
169 if (compare_char == data[prev_ix + best_len]) { in FindLongestMatch()
182 best_len = len; in FindLongestMatch()
229 if (compare_char != data[prev_ix + best_len]) { in FindLongestMatch()
241 best_len = len; in FindLongestMatch()
H A 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()
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dhash_longest_match_inc.h172 size_t best_len = out->len; in FindLongestMatch() local
188 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
189 prev_ix + best_len > ring_buffer_mask || in FindLongestMatch()
190 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
206 best_len = len; in FindLongestMatch()
207 out->len = best_len; in FindLongestMatch()
228 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
229 prev_ix + best_len > ring_buffer_mask || in FindLongestMatch()
230 data[cur_ix_masked + best_len] ! in FindLongestMatch()
[all...]
H A Dhash_longest_match64_inc.h176 size_t best_len = out->len; in FindLongestMatch() local
192 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
193 prev_ix + best_len > ring_buffer_mask || in FindLongestMatch()
194 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
210 best_len = len; in FindLongestMatch()
211 out->len = best_len; in FindLongestMatch()
233 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
234 prev_ix + best_len > ring_buffer_mask || in FindLongestMatch()
235 data[cur_ix_masked + best_len] ! in FindLongestMatch()
[all...]
H A Dhash_to_binary_tree_inc.h116 const size_t max_backward, size_t* const BROTLI_RESTRICT best_len, in StoreAndFindMatches()
163 if (matches && len > *best_len) { in StoreAndFindMatches()
164 *best_len = len; in StoreAndFindMatches()
211 size_t best_len = 1; in FindAllMatches() local
218 for (i = cur_ix - 1; i > stop && best_len <= 2; --i) { in FindAllMatches()
233 if (len > best_len) { in FindAllMatches()
234 best_len = len; in FindAllMatches()
239 if (best_len < max_length) { in FindAllMatches()
241 ring_buffer_mask, max_length, max_backward, &best_len, matches); in FindAllMatches()
247 size_t minlen = BROTLI_MAX(size_t, 4, best_len in FindAllMatches()
113 StoreAndFindMatches( HashToBinaryTree* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data, const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length, const size_t max_backward, size_t* const BROTLI_RESTRICT best_len, BackwardMatch* BROTLI_RESTRICT matches) StoreAndFindMatches() argument
[all...]
H A Dhash_forgetful_chain_inc.h207 size_t best_len = out->len; in FindLongestMatch() local
233 best_len = len; in FindLongestMatch()
234 out->len = best_len; in FindLongestMatch()
256 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
257 prev_ix + best_len > ring_buffer_mask || in FindLongestMatch()
258 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
272 best_len = len; in FindLongestMatch()
273 out->len = best_len; in FindLongestMatch()
H A Dhash_longest_match_quickly_inc.h163 size_t best_len = best_len_in; in FindLongestMatch() local
169 if (compare_char == data[prev_ix + best_len]) { in FindLongestMatch()
182 best_len = len; in FindLongestMatch()
229 if (compare_char != data[prev_ix + best_len]) { in FindLongestMatch()
241 best_len = len; in FindLongestMatch()
H A 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()
/third_party/ntfs-3g/libntfs-3g/
H A Dcompress.c150 int best_len) in ntfs_best_match()
173 if (best_len >= max_len) { in ntfs_best_match()
188 * than 'best_len'? in ntfs_best_match()
190 * The bytes at index 'best_len' are the most likely to differ, in ntfs_best_match()
193 * The bytes at indices 'best_len - 1' and '0' are less in ntfs_best_match()
199 if (matchptr[best_len] != strptr[best_len] || in ntfs_best_match()
200 matchptr[best_len - 1] != strptr[best_len - 1] || in ntfs_best_match()
204 for (len = 1; len < best_len in ntfs_best_match()
149 ntfs_best_match(struct COMPRESS_CONTEXT *pctx, const int i, int best_len) ntfs_best_match() argument
[all...]
/third_party/libwebsockets/win32port/zlib/
H A Ddeflate.c1117 int best_len = s->prev_length; /* best match length so far */ local
1133 register ush scan_end = *(ushf*)(scan+best_len-1);
1136 register Byte scan_end1 = scan[best_len-1];
1137 register Byte scan_end = scan[best_len];
1172 if (*(ushf*)(match+best_len-1) != scan_end ||
1203 if (match[best_len] != scan_end ||
1204 match[best_len-1] != scan_end1 ||
1208 /* The check at best_len-1 can be removed because it will be made
1234 if (len > best_len) {
1236 best_len
[all...]
/third_party/node/deps/zlib/
H A Ddeflate.c1400 int best_len = (int)s->prev_length; /* best match length so far */ in longest_match() local
1416 register ush scan_end = *(ushf*)(scan + best_len - 1); in longest_match()
1419 register Byte scan_end1 = scan[best_len - 1]; in longest_match()
1420 register Byte scan_end = scan[best_len]; in longest_match()
1456 if (*(ushf*)(match + best_len - 1) != scan_end || in longest_match()
1497 if (match[best_len] != scan_end || in longest_match()
1498 match[best_len - 1] != scan_end1 || in longest_match()
1502 /* The check at best_len - 1 can be removed because it will be made in longest_match()
1538 if (len > best_len) { in longest_match()
1540 best_len in longest_match()
[all...]
/third_party/node/deps/v8/third_party/zlib/
H A Ddeflate.c1297 int best_len = (int)s->prev_length; /* best match length so far */ local
1313 register ush scan_end = *(ushf*)(scan+best_len-1);
1316 register Byte scan_end1 = scan[best_len-1];
1317 register Byte scan_end = scan[best_len];
1352 if (*(ushf*)(match+best_len-1) != scan_end ||
1392 if (match[best_len] != scan_end ||
1393 match[best_len-1] != scan_end1 ||
1397 /* The check at best_len-1 can be removed because it will be made
1432 if (len > best_len) {
1434 best_len
[all...]
/third_party/skia/third_party/externals/zlib/
H A Ddeflate.c1289 int best_len = (s->prev_length == 0) ? ACTUAL_MIN_MATCH-1 : 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 ||
1389 /* The check at best_len-1 can be removed because it will be made
1424 if (len > best_len) {
1426 best_len
[all...]
/third_party/zlib/
H A Ddeflate.c1362 int best_len = (int)s->prev_length; /* best match length so far */ in longest_match() local
1378 register ush scan_end = *(ushf*)(scan + best_len - 1); in longest_match()
1381 register Byte scan_end1 = scan[best_len - 1]; in longest_match()
1382 register Byte scan_end = scan[best_len]; in longest_match()
1418 if (*(ushf*)(match + best_len - 1) != scan_end || in longest_match()
1450 if (match[best_len] != scan_end || in longest_match()
1451 match[best_len - 1] != scan_end1 || in longest_match()
1455 /* The check at best_len - 1 can be removed because it will be made in longest_match()
1482 if (len > best_len) { in longest_match()
1484 best_len in longest_match()
[all...]
/third_party/ffmpeg/libavcodec/
H A Dffv1enc.c149 uint64_t best_len[256]; in find_best_state() local
152 best_len[j] = UINT64_MAX; in find_best_state()
169 if (len < best_len[k]) { in find_best_state()
170 best_len[k] = len; in find_best_state()
/third_party/ffmpeg/libavformat/
H A Dnutenc.c837 int best_len = 0; in find_best_header_idx() local
844 && nut->header_len[i] > best_len in find_best_header_idx()
847 best_len = nut->header_len[i]; in find_best_header_idx()

Completed in 24 milliseconds