HomeSort by relevance Sort by last modified time
    Searched refs:best_len (Results 1 - 4 of 4) sorted by null

  /external/chromium_org/third_party/brotli/src/brotli/enc/
hash.h 201 size_t best_len = *best_len_out; local
235 if (cur_ix_masked + best_len > ring_buffer_mask ||
236 prev_ix + best_len > ring_buffer_mask ||
237 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) {
256 best_len = len;
258 *best_len_out = best_len;
259 *best_len_code_out = best_len;
287 best_len = len;
289 *best_len_out = best_len;
    [all...]
backward_references.cc 62 size_t best_len = 0; local
72 &best_len, &best_len_code, &best_dist, &best_score,
83 best_len = best_len_M1;
109 if (best_len >= 4) {
114 const int tail_length = best_len_2 - best_len + 1;
117 literal_cost[(i + best_len + k) & ringbuffer_mask] -
135 best_len = best_len_2;
147 i + 2 * best_len + random_heuristics_window_size;
150 cmd.copy_length_ = best_len;
163 for (int j = 1; j < best_len - 1; ++j)
    [all...]
  /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/tests/
opt-gvmat64.asm 259 ;;; int best_len = s->prev_length;
262 ;;; Store the sum of s->window + best_len in esi locally, and in esi.
267 ;;; register ush scan_end = *(ushf*)(scan+best_len-1);
326 ;;; if (*(ushf*)(match+best_len-1) != scan_end ||
453 ;;; best_len = len;
455 ;;; scan_end = *(ushf*)(scan+best_len-1);
475 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
  /external/chromium_org/third_party/zlib/
deflate.c 1147 int best_len = s->prev_length; \/* best match length so far *\/ local
    [all...]

Completed in 36 milliseconds