Home
last modified time | relevance | path

Searched refs:max_run_length_prefix (Results 1 – 3 of 3) sorted by relevance

/external/brotli/c/enc/
Dbrotli_bit_stream.c646 uint32_t* BROTLI_RESTRICT max_run_length_prefix) { in RunLengthCodeZeros() argument
659 max_prefix = BROTLI_MIN(uint32_t, max_prefix, *max_run_length_prefix); in RunLengthCodeZeros()
660 *max_run_length_prefix = max_prefix; in RunLengthCodeZeros()
665 v[*out_size] = v[i] + *max_run_length_prefix; in RunLengthCodeZeros()
703 uint32_t max_run_length_prefix = 6; in EncodeContextMap() local
720 &num_rle_symbols, &max_run_length_prefix); in EncodeContextMap()
726 BROTLI_BOOL use_rle = TO_BROTLI_BOOL(max_run_length_prefix > 0); in EncodeContextMap()
729 BrotliWriteBits(4, max_run_length_prefix - 1, storage_ix, storage); in EncodeContextMap()
732 BuildAndStoreHuffmanTree(histogram, num_clusters + max_run_length_prefix, in EncodeContextMap()
733 num_clusters + max_run_length_prefix, in EncodeContextMap()
[all …]
/external/brotli/c/dec/
Ddecode.c1019 s->max_run_length_prefix = (bits >> 1) + 1; in DecodeContextMap()
1022 s->max_run_length_prefix = 0; in DecodeContextMap()
1025 BROTLI_LOG_UINT(s->max_run_length_prefix); in DecodeContextMap()
1031 uint32_t alphabet_size = *num_htrees + s->max_run_length_prefix; in DecodeContextMap()
1042 uint32_t max_run_length_prefix = s->max_run_length_prefix; in DecodeContextMap() local
1059 if (code > max_run_length_prefix) { in DecodeContextMap()
1061 (uint8_t)(code - max_run_length_prefix); in DecodeContextMap()
Dstate.h194 uint32_t max_run_length_prefix; member