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

  /external/brotli/c/enc/
brotli_bit_stream.c 184 const int num_codes, const uint8_t* code_length_bitdepth,
212 if (code_length_bitdepth[kStorageOrder[codes_to_store - 1]] != 0) {
217 if (code_length_bitdepth[kStorageOrder[0]] == 0 &&
218 code_length_bitdepth[kStorageOrder[1]] == 0) {
220 if (code_length_bitdepth[kStorageOrder[2]] == 0) {
228 size_t l = code_length_bitdepth[kStorageOrder[i]];
237 const uint8_t* huffman_tree_extra_bits, const uint8_t* code_length_bitdepth,
243 BrotliWriteBits(code_length_bitdepth[ix], code_length_bitdepth_symbols[ix],
307 uint8_t code_length_bitdepth[BROTLI_CODE_LENGTH_CODES] = { 0 }; local
339 5, tree, code_length_bitdepth);
    [all...]
  /external/webp/src/enc/
vp8l_enc.c 526 VP8LBitWriter* const bw, const uint8_t* code_length_bitdepth) {
537 if (code_length_bitdepth[kStorageOrder[codes_to_store - 1]] != 0) {
543 VP8LPutBits(bw, code_length_bitdepth[kStorageOrder[i]], 3);
591 uint8_t code_length_bitdepth[CODE_LENGTH_CODES] = { 0 }; local
597 huffman_code.code_lengths = code_length_bitdepth;
613 StoreHuffmanTreeOfHuffmanTreeToBitMask(bw, code_length_bitdepth);
625 trailing_zero_bits += code_length_bitdepth[ix];
    [all...]

Completed in 88 milliseconds