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

/xsrc/external/mit/brotli/dist/c/enc/
H A Dhash_longest_match64_inc.h176 size_t best_len = out->len; local in function:FN
192 if (cur_ix_masked + best_len > ring_buffer_mask ||
193 prev_ix + best_len > ring_buffer_mask ||
194 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) {
210 best_len = len;
211 out->len = best_len;
233 if (cur_ix_masked + best_len > ring_buffer_mask ||
234 prev_ix + best_len > ring_buffer_mask ||
235 data[cur_ix_masked + best_len] !
[all...]
H A Dhash_longest_match_inc.h172 size_t best_len = out->len; local in function:FN
188 if (cur_ix_masked + best_len > ring_buffer_mask ||
189 prev_ix + best_len > ring_buffer_mask ||
190 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) {
206 best_len = len;
207 out->len = best_len;
228 if (cur_ix_masked + best_len > ring_buffer_mask ||
229 prev_ix + best_len > ring_buffer_mask ||
230 data[cur_ix_masked + best_len] !
[all...]
H A Dhash_to_binary_tree_inc.h116 const size_t max_backward, size_t* const BROTLI_RESTRICT best_len,
163 if (matches && len > *best_len) {
164 *best_len = len;
211 size_t best_len = 1; local in function:FN
218 for (i = cur_ix - 1; i > stop && best_len <= 2; --i) {
233 if (len > best_len) {
234 best_len = len;
239 if (best_len < max_length) {
241 ring_buffer_mask, max_length, max_backward, &best_len, matches);
247 size_t minlen = BROTLI_MAX(size_t, 4, best_len
[all...]
H A Dhash_forgetful_chain_inc.h207 size_t best_len = out->len; local in function:FN
233 best_len = len;
234 out->len = best_len;
256 if (cur_ix_masked + best_len > ring_buffer_mask ||
257 prev_ix + best_len > ring_buffer_mask ||
258 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) {
272 best_len = len;
273 out->len = best_len;
H A Dhash_longest_match_quickly_inc.h163 size_t best_len = best_len_in; local in function:FN
169 if (compare_char == data[prev_ix + best_len]) {
182 best_len = len;
229 if (compare_char != data[prev_ix + best_len]) {
241 best_len = len;
H A Dbackward_references_hq.c445 size_t best_len = min_len - 1; local in function:UpdateNodes
447 for (; j < BROTLI_NUM_DISTANCE_SHORT_CODES && best_len < max_len; ++j) {
453 uint8_t continuation = ringbuffer[cur_ix_masked + best_len];
454 if (cur_ix_masked + best_len > ringbuffer_mask) {
468 if (prev_ix + best_len > ringbuffer_mask ||
469 continuation != ringbuffer[prev_ix + best_len]) {
484 for (l = best_len + 1; l <= len; ++l) {
495 best_len = l;
/xsrc/external/mit/xterm/dist/
H A Dbutton.c4017 int best_len = -1; local in function:do_select_regex
4037 if (best_len < test) {
4038 best_len = test;
4042 best_len));
4048 int best_nxt = best_col + best_len;

Completed in 12 milliseconds