Home
last modified time | relevance | path

Searched refs:dictionary_start (Results 1 – 2 of 2) sorted by relevance

/external/brotli/c/enc/
Dbackward_references_inc.h43 size_t dictionary_start = BROTLI_MIN(size_t, in EXPORT_FN() local
52 max_distance, dictionary_start + gap, params->dist.max_distance, &sr); in EXPORT_FN()
66 dictionary_start = BROTLI_MIN(size_t, in EXPORT_FN()
71 max_distance, dictionary_start + gap, params->dist.max_distance, in EXPORT_FN()
88 dictionary_start = BROTLI_MIN(size_t, in EXPORT_FN()
94 sr.distance, dictionary_start + gap, dist_cache); in EXPORT_FN()
95 if ((sr.distance <= (dictionary_start + gap)) && distance_code > 0) { in EXPORT_FN()
Dbackward_references_hq.c413 const size_t dictionary_start = BROTLI_MIN(size_t, in UpdateNodes() local
457 if (BROTLI_PREDICT_FALSE(backward > dictionary_start + gap)) { in UpdateNodes()
512 TO_BROTLI_BOOL(dist > dictionary_start + gap); in UpdateNodes()
594 size_t dictionary_start = BROTLI_MIN(size_t, in BrotliZopfliCreateCommands() local
597 TO_BROTLI_BOOL(distance > dictionary_start + gap); in BrotliZopfliCreateCommands()
683 const size_t dictionary_start = BROTLI_MIN(size_t, in BrotliZopfliComputeShortestPath() local
690 dictionary_start + gap, params, &matches[lz_matches_offset]); in BrotliZopfliComputeShortestPath()
769 size_t dictionary_start = BROTLI_MIN(size_t, in BrotliCreateHqZopfliBackwardReferences() local
782 max_distance, dictionary_start + gap, params, in BrotliCreateHqZopfliBackwardReferences()