Searched defs:num_codes (Results 1 - 7 of 7) sorted by relevance
/external/puffin/src/ |
H A D | huffman_table.h | 52 // |num_codes| IN The number of code lengths for reading Huffman table. 55 size_t num_codes) { 56 if (num_lit_len > 286 || num_distance > 30 || num_codes > 19) { 60 << "num_codes(" << num_codes << ")"; local 237 // |num_codes| IN The size of the Huffman code length array in the input. 244 size_t num_codes, 255 // |num_codes| IN Number of Huffman code lengths to read from the 262 size_t num_codes, 53 CheckHuffmanArrayLengths(size_t num_lit_len, size_t num_distance, size_t num_codes) argument
|
H A D | huffman_table.cc | 238 // code length array (|dynamic_distance_lens_|), and the size (|num_codes|) of 255 auto num_codes = br->ReadBits(4) + 4; local 259 CheckHuffmanArrayLengths(num_lit_len, num_distance, num_codes), 264 TEST_AND_RETURN_FALSE_SET_ERROR(*length - index >= (num_codes + 1) / 2, 267 for (; idx < num_codes; idx++) { 325 size_t num_codes, 330 for (size_t idx = 0; idx < num_codes;) { 390 TEST_AND_RETURN_FALSE(lens->size() == num_codes); 426 size_t num_codes = buffer[index] + 4; local 431 CheckHuffmanArrayLengths(num_lit_len, num_distance, num_codes), 321 BuildHuffmanCodeLengths(BitReaderInterface* br, uint8_t* buffer, size_t* length, size_t max_bits, size_t num_codes, Buffer* lens, Error* error) argument 493 BuildHuffmanCodeLengths(const uint8_t* buffer, size_t* length, BitWriterInterface* bw, size_t num_codes, Buffer* lens, Error* error) argument [all...] |
/external/brotli/c/dec/ |
H A D | decode.c | 646 uint32_t num_codes = s->repeat; local 662 s->repeat = num_codes; 674 ++num_codes; 682 if (!(num_codes == 1 || space == 0)) { 720 s->repeat = 0; /* num_codes */
|
/external/brotli/c/enc/ |
H A D | brotli_bit_stream.c | 184 const int num_codes, const uint8_t* code_length_bitdepth, 210 if (num_codes > 1) { 311 int num_codes = 0; local 326 if (num_codes == 0) { 328 num_codes = 1; 329 } else if (num_codes == 1) { 330 num_codes = 2; 345 BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask(num_codes, code_length_bitdepth, 348 if (num_codes == 1) { 183 BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask( const int num_codes, const uint8_t* code_length_bitdepth, size_t* storage_ix, uint8_t* storage) argument
|
/external/webp/src/dec/ |
H A D | vp8l_dec.c | 333 const int num_codes = VP8LReadBits(br, 4) + 4; local 334 if (num_codes > NUM_CODE_LENGTH_CODES) { 339 for (i = 0; i < num_codes; ++i) {
|
/external/webp/src/enc/ |
H A D | histogram_enc.c | 431 const int num_codes = VP8LHistogramNumCodes(h->palette_code_bits_); local 432 h->literal_cost_ = PopulationCost(h->literal_, num_codes, NULL) +
|
/external/v8/src/compiler/ |
H A D | register-allocator.cc | 2965 int* num_regs, int* num_codes, 2970 *num_codes = data()->config()->num_allocatable_float_registers(); 2974 *num_codes = data()->config()->num_allocatable_simd128_registers(); 2984 int num_codes = num_allocatable_registers(); local 2989 GetFPRegisterSet(rep, &num_regs, &num_codes, &codes); 3122 int num_codes = num_allocatable_registers(); local 3127 GetFPRegisterSet(rep, &num_regs, &num_codes, &codes); 3130 DCHECK_GE(free_until_pos.length(), num_codes); 3134 for (int i = 1; i < num_codes; ++i) { 3175 int num_codes local 2964 GetFPRegisterSet(MachineRepresentation rep, int* num_regs, int* num_codes, const int** codes) const argument [all...] |
Completed in 283 milliseconds