Home
last modified time | relevance | path

Searched refs:num_symbols (Results 1 – 21 of 21) sorted by relevance

/external/webp/src/utils/
Dhuffman_encode_utils.c330 const int depth_size = tree->num_symbols; in VP8LCreateCompressedHuffmanTree()
382 len = tree->num_symbols; in ConvertBitDepthsToSymbols()
410 const int num_symbols = huff_code->num_symbols; in VP8LCreateHuffmanTree() local
411 memset(buf_rle, 0, num_symbols * sizeof(*buf_rle)); in VP8LCreateHuffmanTree()
412 OptimizeHuffmanForRle(num_symbols, buf_rle, histogram); in VP8LCreateHuffmanTree()
413 GenerateOptimalTree(histogram, num_symbols, huff_tree, tree_depth_limit, in VP8LCreateHuffmanTree()
Dhuffman_encode_utils.h31 int num_symbols; // Number of symbols. member
/external/tensorflow/tensorflow/contrib/legacy_seq2seq/python/ops/
Dseq2seq.py236 num_symbols, argument
286 proj_weights.get_shape().assert_is_compatible_with([None, num_symbols])
288 proj_biases.get_shape().assert_is_compatible_with([num_symbols])
291 [num_symbols, embedding_size])
413 num_symbols, argument
471 proj_weights.get_shape().assert_is_compatible_with([None, num_symbols])
473 proj_biases.get_shape().assert_is_compatible_with([num_symbols])
476 "embedding", [num_symbols, embedding_size], dtype=dtype)
485 output_symbols = num_symbols
715 num_symbols, argument
[all …]
/external/u-boot/fs/jffs2/
Dmini_inflate.c38 stream->codes.num_symbols = 19; in init_stream()
46 stream->lengths.num_symbols = 288; in init_stream()
54 stream->distance.num_symbols = 32; in init_stream()
195 for (i = 0; i < set->num_symbols; i++) { in fill_code_tables()
206 cramfs_memset(set->lengths, 0, set->num_symbols); in init_code_tables()
/external/webrtc/webrtc/modules/audio_device/linux/
Dlatebindingsymboltable_linux.cc93 int num_symbols, in InternalLoadSymbols() argument
100 for (int i = 0; i < num_symbols; ++i) { in InternalLoadSymbols()
Dlatebindingsymboltable_linux.h42 int num_symbols,
/external/webrtc/webrtc/base/
Dlatebindingsymboltable.cc125 for (int i = 0; i < info_->num_symbols; ++i) { in LoadFromPath()
153 memset(table_, 0, sizeof(void *) * info_->num_symbols); in ClearSymbols()
Dlatebindingsymboltable.h36 int num_symbols; member
/external/webp/src/enc/
Dvp8l_enc.c467 const int num_symbols = in GetHuffBitLengthsAndCodes() local
470 codes[k].num_symbols = num_symbols; in GetHuffBitLengthsAndCodes()
471 total_length_size += num_symbols; in GetHuffBitLengthsAndCodes()
486 const int bit_length = huffman_codes[i].num_symbols; in GetHuffBitLengthsAndCodes()
549 for (k = 0; k < huffman_code->num_symbols; ++k) { in ClearHuffmanTreeIfOnlyOneSymbol()
555 for (k = 0; k < huffman_code->num_symbols; ++k) { in ClearHuffmanTreeIfOnlyOneSymbol()
591 const int max_tokens = tree->num_symbols; in StoreFullHuffmanCode()
594 huffman_code.num_symbols = CODE_LENGTH_CODES; in StoreFullHuffmanCode()
664 for (i = 0; i < huffman_code->num_symbols && count < 3; ++i) { in StoreHuffmanCode()
831 if (max_tokens < codes->num_symbols) { in EncodeImageNoHuffman()
[all …]
Dbackward_references_cost_enc.c41 int num_symbols, const uint32_t population_counts[], double output[]) { in ConvertPopulationCountTableToBitEstimates() argument
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()
/external/toolchain-utils/cros_utils/
Dperf_diff.py197 def __init__(self, reports, num_symbols, common_only): argument
199 self._num_symbols = num_symbols
323 pd = PerfDiffer(reports, int(options.num_symbols), options.common_only)
/external/tensorflow/tensorflow/contrib/legacy_seq2seq/python/kernel_tests/
Dseq2seq_test.py115 dec_inp, enc_state, cell_fn(), num_symbols=4, embedding_size=2)
244 enc_inp, dec_inp, cell(), num_symbols=5, embedding_size=2)
261 num_symbols=5,
277 num_symbols=5,
292 num_symbols=5,
300 num_symbols=5,
308 num_symbols=5,
504 num_symbols=4,
/external/u-boot/include/jffs2/
Dmini_inflate.h22 int num_symbols; /* Number of symbols this code can represent */ member
/external/brotli/c/enc/
Dmetablock_inc.h47 size_t min_block_size, double split_threshold, size_t num_symbols, in FN()
49 size_t max_num_blocks = num_symbols / min_block_size + 1; in FN()
Dbrotli_bit_stream.c259 size_t num_symbols, in StoreSimpleHuffmanTree() argument
264 BrotliWriteBits(2, num_symbols - 1, storage_ix, storage); /* NSYM - 1 */ in StoreSimpleHuffmanTree()
269 for (i = 0; i < num_symbols; i++) { in StoreSimpleHuffmanTree()
271 for (j = i + 1; j < num_symbols; j++) { in StoreSimpleHuffmanTree()
279 if (num_symbols == 2) { in StoreSimpleHuffmanTree()
282 } else if (num_symbols == 3) { in StoreSimpleHuffmanTree()
Dmetablock.c342 size_t num_symbols, BlockSplit* split, HistogramLiteral** histograms, in InitContextBlockSplitter() argument
344 size_t max_num_blocks = num_symbols / min_block_size + 1; in InitContextBlockSplitter()
/external/brotli/c/dec/
Dhuffman.c264 uint32_t num_symbols) { in BrotliBuildSimpleHuffmanTable() argument
267 switch (num_symbols) { in BrotliBuildSimpleHuffmanTable()
Dhuffman.h110 int root_bits, uint16_t* symbols, uint32_t num_symbols);
Ddecode.c478 uint32_t num_symbols = s->symbol; in ReadSimpleHuffmanSymbols() local
479 while (i <= num_symbols) { in ReadSimpleHuffmanSymbols()
495 for (i = 0; i < num_symbols; ++i) { in ReadSimpleHuffmanSymbols()
497 for (; k <= num_symbols; ++k) { in ReadSimpleHuffmanSymbols()
/external/webp/src/dec/
Dvp8l_dec.c250 int num_symbols, int* const code_lengths) { in ReadHuffmanCodeLengths() argument
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()
319 const int num_symbols = VP8LReadBits(br, 1) + 1; in ReadHuffmanCode() local
325 if (num_symbols == 2) { in ReadHuffmanCode()
/external/swiftshader/third_party/llvm-7.0/llvm/tools/gold/
Dgold-plugin.cpp57 uint64_t *num_symbols, const char ***wrap_symbol_list);