Home
last modified time | relevance | path

Searched refs:num_codes (Results 1 - 13 of 13) sorted by relevance

/third_party/ffmpeg/libavcodec/
H A Dcllc.c49 int num_lens, num_codes, num_codes_sum; in read_code_table() local
63 num_codes = get_bits(gb, 9); in read_code_table()
64 num_codes_sum += num_codes; in read_code_table()
72 for (j = 0; j < num_codes; j++) { in read_code_table()
H A Datrac3.c216 * @param num_codes number of values to get
220 int num_codes) in read_quant_spectral_coeffs()
225 num_codes /= 2; in read_quant_spectral_coeffs()
232 for (i = 0; i < num_codes; i++) { in read_quant_spectral_coeffs()
240 for (i = 0; i < num_codes; i++) { in read_quant_spectral_coeffs()
252 for (i = 0; i < num_codes; i++) { in read_quant_spectral_coeffs()
257 for (i = 0; i < num_codes; i++) { in read_quant_spectral_coeffs()
218 read_quant_spectral_coeffs(GetBitContext *gb, int selector, int coding_flag, int *mantissas, int num_codes) read_quant_spectral_coeffs() argument
H A Dmjpegenc.c269 size_t num_mbs, num_blocks, num_codes; in alloc_huffman() local
286 num_codes = num_blocks * 64; in alloc_huffman()
288 m->huff_buffer = av_malloc_array(num_codes, sizeof(MJpegHuffmanCode)); in alloc_huffman()
H A Dwebp.c338 int num_codes = 4 + get_bits(&s->gb, 4); in read_huffman_code_normal() local
340 av_assert1(num_codes <= NUM_CODE_LENGTH_CODES); in read_huffman_code_normal()
342 for (i = 0; i < num_codes; i++) in read_huffman_code_normal()
/third_party/node/deps/brotli/c/enc/
H A Dbrotli_bit_stream.c169 const int num_codes, const uint8_t* code_length_bitdepth, in BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask()
195 if (num_codes > 1) { in BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask()
296 int num_codes = 0; in BrotliStoreHuffmanTree() local
311 if (num_codes == 0) { in BrotliStoreHuffmanTree()
313 num_codes = 1; in BrotliStoreHuffmanTree()
314 } else if (num_codes == 1) { in BrotliStoreHuffmanTree()
315 num_codes = 2; in BrotliStoreHuffmanTree()
330 BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask(num_codes, code_length_bitdepth, in BrotliStoreHuffmanTree()
333 if (num_codes == 1) { in BrotliStoreHuffmanTree()
168 BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask( const int num_codes, const uint8_t* code_length_bitdepth, size_t* storage_ix, uint8_t* storage) BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask() argument
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dbrotli_bit_stream.c169 const int num_codes, const uint8_t* code_length_bitdepth, in BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask()
195 if (num_codes > 1) { in BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask()
296 int num_codes = 0; in BrotliStoreHuffmanTree() local
311 if (num_codes == 0) { in BrotliStoreHuffmanTree()
313 num_codes = 1; in BrotliStoreHuffmanTree()
314 } else if (num_codes == 1) { in BrotliStoreHuffmanTree()
315 num_codes = 2; in BrotliStoreHuffmanTree()
330 BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask(num_codes, code_length_bitdepth, in BrotliStoreHuffmanTree()
333 if (num_codes == 1) { in BrotliStoreHuffmanTree()
168 BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask( const int num_codes, const uint8_t* code_length_bitdepth, size_t* storage_ix, uint8_t* storage) BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask() argument
/third_party/node/deps/v8/src/compiler/backend/
H A Dregister-allocator.cc3390 int num_codes = num_allocatable_registers(); in ComputeStateFromManyPredecessors()
3395 GetFPRegisterSet(rep, &num_regs, &num_codes, &codes); in ComputeStateFromManyPredecessors()
3997 int* num_regs, int* num_codes, in GetFPRegisterSet()
4002 *num_codes = data()->config()->num_allocatable_float_registers(); in GetFPRegisterSet()
4006 *num_codes = data()->config()->num_allocatable_simd128_registers(); in GetFPRegisterSet()
4013 void LinearScanAllocator::GetSIMD128RegisterSet(int* num_regs, int* num_codes, in GetSIMD128RegisterSet() argument
4018 *num_codes = data()->config()->num_allocatable_simd128_registers(); in GetSIMD128RegisterSet()
4025 int num_codes = num_allocatable_registers(); in FindFreeRegistersForRange() local
4031 GetFPRegisterSet(rep, &num_regs, &num_codes, &codes); in FindFreeRegistersForRange()
4034 GetSIMD128RegisterSet(&num_regs, &num_codes, in FindFreeRegistersForRange()
3996 GetFPRegisterSet(MachineRepresentation rep, int* num_regs, int* num_codes, const int** codes) const GetFPRegisterSet() argument
4146 int num_codes = num_allocatable_registers(); PickRegisterThatIsAvailableLongest() local
[all...]
H A Dregister-allocator.h1489 int* num_codes, const int** codes) const;
1490 void GetSIMD128RegisterSet(int* num_regs, int* num_codes,
/third_party/node/deps/brotli/c/dec/
H A Ddecode.c695 uint32_t num_codes = h->repeat; in ReadCodeLengthCodeLengths() local
711 h->repeat = num_codes; in ReadCodeLengthCodeLengths()
723 ++num_codes; in ReadCodeLengthCodeLengths()
731 if (!(num_codes == 1 || space == 0)) { in ReadCodeLengthCodeLengths()
768 h->repeat = 0; /* num_codes */ in ReadHuffmanCode()
/third_party/skia/third_party/externals/brotli/c/dec/
H A Ddecode.c695 uint32_t num_codes = h->repeat; in ReadCodeLengthCodeLengths() local
711 h->repeat = num_codes; in ReadCodeLengthCodeLengths()
723 ++num_codes; in ReadCodeLengthCodeLengths()
731 if (!(num_codes == 1 || space == 0)) { in ReadCodeLengthCodeLengths()
768 h->repeat = 0; /* num_codes */ in ReadHuffmanCode()
/third_party/skia/third_party/externals/libwebp/src/enc/
H A Dhistogram_enc.c514 const int num_codes = VP8LHistogramNumCodes(h->palette_code_bits_); in UpdateHistogramCost() local
516 PopulationCost(h->literal_, num_codes, NULL, &h->is_used_[0]) + in UpdateHistogramCost()
/third_party/skia/third_party/externals/libwebp/src/dec/
H A Dvp8l_dec.c335 const int num_codes = VP8LReadBits(br, 4) + 4; in ReadHuffmanCode() local
336 if (num_codes > NUM_CODE_LENGTH_CODES) { in ReadHuffmanCode()
341 for (i = 0; i < num_codes; ++i) { in ReadHuffmanCode()
/third_party/astc-encoder/Source/
H A Dtinyexr.h3293 int i, j, l, num_codes[1 + TDEFL_MAX_SUPPORTED_HUFF_CODESIZE]; in tdefl_optimize_huffman_table() local
3295 MZ_CLEAR_OBJ(num_codes); in tdefl_optimize_huffman_table()
3298 num_codes[d->m_huff_code_sizes[table_num][i]]++; in tdefl_optimize_huffman_table()
3313 for (i = 0; i < num_used_syms; i++) num_codes[pSyms[i].m_key]++; in tdefl_optimize_huffman_table()
3315 tdefl_huffman_enforce_max_code_size(num_codes, num_used_syms, in tdefl_optimize_huffman_table()
3321 for (l = num_codes[i]; l > 0; l--) in tdefl_optimize_huffman_table()
3327 next_code[i] = j = ((j + num_codes[i - 1]) << 1); in tdefl_optimize_huffman_table()

Completed in 53 milliseconds