Home
last modified time | relevance | path

Searched refs:num_symbols (Results 1 - 18 of 18) sorted by relevance

/third_party/skia/third_party/externals/libwebp/src/utils/
H A Dhuffman_encode_utils.c330 const int depth_size = tree->num_symbols; in VP8LCreateCompressedHuffmanTree()
382 len = tree->num_symbols; in ConvertBitDepthsToSymbols()
409 const int num_symbols = huff_code->num_symbols; in VP8LCreateHuffmanTree() local
410 memset(buf_rle, 0, num_symbols * sizeof(*buf_rle)); in VP8LCreateHuffmanTree()
411 OptimizeHuffmanForRle(num_symbols, buf_rle, histogram); in VP8LCreateHuffmanTree()
412 GenerateOptimalTree(histogram, num_symbols, huff_tree, tree_depth_limit, in VP8LCreateHuffmanTree()
H A Dhuffman_encode_utils.h31 int num_symbols; // Number of symbols. member
/third_party/mesa3d/src/amd/common/
H A Dac_rtld.c144 static bool layout_symbols(struct ac_rtld_symbol *symbols, unsigned num_symbols, in layout_symbols() argument
147 qsort(symbols, num_symbols, sizeof(*symbols), compare_symbol_by_align); in layout_symbols()
151 for (unsigned i = 0; i < num_symbols; ++i) { in layout_symbols()
201 size_t num_symbols = symbols_data->d_size / sizeof(Elf64_Sym); in read_private_lds_symbols() local
203 for (size_t j = 0; j < num_symbols; ++j, ++symbol) { in read_private_lds_symbols()
641 size_t num_symbols = symbols_data->d_size / sizeof(Elf64_Sym); in apply_relocs() local
666 report_elf_if(r_sym >= num_symbols); in apply_relocs()
/third_party/node/deps/brotli/c/enc/
H A Dmetablock_inc.h47 size_t min_block_size, double split_threshold, size_t num_symbols, in InitBlockSplitter()
49 size_t max_num_blocks = num_symbols / min_block_size + 1; in InitBlockSplitter()
45 InitBlockSplitter( MemoryManager* m, FN(BlockSplitter)* self, size_t alphabet_size, size_t min_block_size, double split_threshold, size_t num_symbols, BlockSplit* split, HistogramType** histograms, size_t* histograms_size) InitBlockSplitter() argument
H A Dbrotli_bit_stream.c244 size_t num_symbols, in StoreSimpleHuffmanTree()
249 BrotliWriteBits(2, num_symbols - 1, storage_ix, storage); /* NSYM - 1 */ in StoreSimpleHuffmanTree()
254 for (i = 0; i < num_symbols; i++) { in StoreSimpleHuffmanTree()
256 for (j = i + 1; j < num_symbols; j++) { in StoreSimpleHuffmanTree()
264 if (num_symbols == 2) { in StoreSimpleHuffmanTree()
267 } else if (num_symbols == 3) { in StoreSimpleHuffmanTree()
242 StoreSimpleHuffmanTree(const uint8_t* depths, size_t symbols[4], size_t num_symbols, size_t max_bits, size_t* storage_ix, uint8_t* storage) StoreSimpleHuffmanTree() argument
H A Dmetablock.c338 size_t num_symbols, BlockSplit* split, HistogramLiteral** histograms, in InitContextBlockSplitter()
340 size_t max_num_blocks = num_symbols / min_block_size + 1; in InitContextBlockSplitter()
335 InitContextBlockSplitter( MemoryManager* m, ContextBlockSplitter* self, size_t alphabet_size, size_t num_contexts, size_t min_block_size, double split_threshold, size_t num_symbols, BlockSplit* split, HistogramLiteral** histograms, size_t* histograms_size) InitContextBlockSplitter() argument
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dmetablock_inc.h47 size_t min_block_size, double split_threshold, size_t num_symbols, in InitBlockSplitter()
49 size_t max_num_blocks = num_symbols / min_block_size + 1; in InitBlockSplitter()
45 InitBlockSplitter( MemoryManager* m, FN(BlockSplitter)* self, size_t alphabet_size, size_t min_block_size, double split_threshold, size_t num_symbols, BlockSplit* split, HistogramType** histograms, size_t* histograms_size) InitBlockSplitter() argument
H A Dbrotli_bit_stream.c244 size_t num_symbols, in StoreSimpleHuffmanTree()
249 BrotliWriteBits(2, num_symbols - 1, storage_ix, storage); /* NSYM - 1 */ in StoreSimpleHuffmanTree()
254 for (i = 0; i < num_symbols; i++) { in StoreSimpleHuffmanTree()
256 for (j = i + 1; j < num_symbols; j++) { in StoreSimpleHuffmanTree()
264 if (num_symbols == 2) { in StoreSimpleHuffmanTree()
267 } else if (num_symbols == 3) { in StoreSimpleHuffmanTree()
242 StoreSimpleHuffmanTree(const uint8_t* depths, size_t symbols[4], size_t num_symbols, size_t max_bits, size_t* storage_ix, uint8_t* storage) StoreSimpleHuffmanTree() argument
H A Dmetablock.c338 size_t num_symbols, BlockSplit* split, HistogramLiteral** histograms, in InitContextBlockSplitter()
340 size_t max_num_blocks = num_symbols / min_block_size + 1; in InitContextBlockSplitter()
335 InitContextBlockSplitter( MemoryManager* m, ContextBlockSplitter* self, size_t alphabet_size, size_t num_contexts, size_t min_block_size, double split_threshold, size_t num_symbols, BlockSplit* split, HistogramLiteral** histograms, size_t* histograms_size) InitContextBlockSplitter() argument
/third_party/skia/third_party/externals/libwebp/src/enc/
H A Dvp8l_enc.c708 const int num_symbols = in GetHuffBitLengthsAndCodes() local
711 codes[k].num_symbols = num_symbols; in GetHuffBitLengthsAndCodes()
712 total_length_size += num_symbols; in GetHuffBitLengthsAndCodes()
727 const int bit_length = huffman_codes[i].num_symbols; in GetHuffBitLengthsAndCodes()
790 for (k = 0; k < huffman_code->num_symbols; ++k) { in ClearHuffmanTreeIfOnlyOneSymbol()
796 for (k = 0; k < huffman_code->num_symbols; ++k) { in ClearHuffmanTreeIfOnlyOneSymbol()
832 const int max_tokens = tree->num_symbols; in StoreFullHuffmanCode()
835 huffman_code.num_symbols = CODE_LENGTH_CODES; in StoreFullHuffmanCode()
905 for (i = 0; i < huffman_code->num_symbols in StoreHuffmanCode()
[all...]
H A Dbackward_references_cost_enc.c41 int num_symbols, const uint32_t population_counts[], double output[]) { in ConvertPopulationCountTableToBitEstimates()
45 for (i = 0; i < num_symbols; ++i) { in ConvertPopulationCountTableToBitEstimates()
52 memset(output, 0, num_symbols * sizeof(*output)); in ConvertPopulationCountTableToBitEstimates()
55 for (i = 0; i < num_symbols; ++i) { in ConvertPopulationCountTableToBitEstimates()
40 ConvertPopulationCountTableToBitEstimates( int num_symbols, const uint32_t population_counts[], double output[]) ConvertPopulationCountTableToBitEstimates() argument
/third_party/node/deps/brotli/c/dec/
H A Dhuffman.h99 /* Builds a simple Huffman table. The |num_symbols| parameter is to be
104 int root_bits, uint16_t* symbols, uint32_t num_symbols);
H A Dhuffman.c264 uint32_t num_symbols) { in BrotliBuildSimpleHuffmanTable()
267 switch (num_symbols) { in BrotliBuildSimpleHuffmanTable()
261 BrotliBuildSimpleHuffmanTable(HuffmanCode* table, int root_bits, uint16_t* val, uint32_t num_symbols) BrotliBuildSimpleHuffmanTable() argument
H A Ddecode.c483 uint32_t num_symbols = h->symbol; in ReadSimpleHuffmanSymbols() local
484 while (i <= num_symbols) { in ReadSimpleHuffmanSymbols()
500 for (i = 0; i < num_symbols; ++i) { in ReadSimpleHuffmanSymbols()
502 for (; k <= num_symbols; ++k) { in ReadSimpleHuffmanSymbols()
780 if (!BrotliSafeReadBits(br, 2, &h->symbol)) { /* num_symbols */ in ReadHuffmanCode()
/third_party/skia/third_party/externals/brotli/c/dec/
H A Dhuffman.h99 /* Builds a simple Huffman table. The |num_symbols| parameter is to be
104 int root_bits, uint16_t* symbols, uint32_t num_symbols);
H A Dhuffman.c264 uint32_t num_symbols) { in BrotliBuildSimpleHuffmanTable()
267 switch (num_symbols) { in BrotliBuildSimpleHuffmanTable()
261 BrotliBuildSimpleHuffmanTable(HuffmanCode* table, int root_bits, uint16_t* val, uint32_t num_symbols) BrotliBuildSimpleHuffmanTable() argument
H A Ddecode.c483 uint32_t num_symbols = h->symbol; in ReadSimpleHuffmanSymbols() local
484 while (i <= num_symbols) { in ReadSimpleHuffmanSymbols()
500 for (i = 0; i < num_symbols; ++i) { in ReadSimpleHuffmanSymbols()
502 for (; k <= num_symbols; ++k) { in ReadSimpleHuffmanSymbols()
780 if (!BrotliSafeReadBits(br, 2, &h->symbol)) { /* num_symbols */ in ReadHuffmanCode()
/third_party/skia/third_party/externals/libwebp/src/dec/
H A Dvp8l_dec.c250 int num_symbols, int* const code_lengths) { in ReadHuffmanCodeLengths()
267 if (max_symbol > num_symbols) { in ReadHuffmanCodeLengths()
271 max_symbol = num_symbols; in ReadHuffmanCodeLengths()
275 while (symbol < num_symbols) { in ReadHuffmanCodeLengths()
292 if (symbol + repeat > num_symbols) { in ReadHuffmanCodeLengths()
321 const int num_symbols = VP8LReadBits(br, 1) + 1; in ReadHuffmanCode() local
327 if (num_symbols == 2) { in ReadHuffmanCode()
248 ReadHuffmanCodeLengths( VP8LDecoder* const dec, const int* const code_length_code_lengths, int num_symbols, int* const code_lengths) ReadHuffmanCodeLengths() argument

Completed in 36 milliseconds