| /external/opencv3/3rdparty/libwebp/utils/ |
| huffman_encode.h | 31 int num_symbols; // Number of symbols. member in struct:__anon20477
|
| huffman.c | 149 int num_symbols = 0; local
159 ++num_symbols;
164 // Initialize the tree. Will fail for num_symbols = 0
165 if (!TreeInit(tree, num_symbols)) return 0;
168 if (num_symbols == 1) { // Trivial case.
208 int num_symbols) {
217 // Initialize the tree. Will fail if num_symbols = 0.
218 if (!TreeInit(tree, num_symbols)) return 0;
221 for (i = 0; i < num_symbols; ++i) {
|
| huffman_encode.c | 351 const int depth_size = tree->num_symbols;
403 len = tree->num_symbols;
429 const int num_symbols = tree->num_symbols; local
430 if (!OptimizeHuffmanForRle(num_symbols, histogram)) {
433 if (!GenerateOptimalTree(histogram, num_symbols,
|
| /external/webp/src/utils/ |
| huffman_encode.h | 31 int num_symbols; // Number of symbols. member in struct:__anon26177
|
| huffman_encode.c | 330 const int depth_size = tree->num_symbols;
382 len = tree->num_symbols;
410 const int num_symbols = huff_code->num_symbols; local
411 memset(buf_rle, 0, num_symbols * sizeof(*buf_rle));
412 OptimizeHuffmanForRle(num_symbols, buf_rle, histogram);
413 GenerateOptimalTree(histogram, num_symbols, huff_tree, tree_depth_limit,
|
| /external/webrtc/webrtc/base/ |
| latebindingsymboltable.h | 36 int num_symbols; member in struct:rtc::LateBindingSymbolTable::TableInfo
37 // Array of size num_symbols.
|
| /toolchain/binutils/binutils-2.25/include/ |
| dis-asm.h | 98 int num_symbols; member in struct:disassemble_info
|
| /external/ltrace/ |
| ltrace-elf.c | 914 size_t num_symbols = 0; local
1058 = lsearch(&key, symbols, &num_symbols,
1083 for (i = 0; i < num_symbols; ++i) {
1096 for (i = 0; i < num_symbols; ++i)
[all...] |
| /external/opencv3/3rdparty/libwebp/enc/ |
| vp8l.c | 196 const int num_symbols = (k == 0) ? VP8LHistogramNumCodes(histo) local
199 codes[k].num_symbols = num_symbols;
200 total_length_size += num_symbols;
217 const int bit_length = huffman_codes[i].num_symbols;
271 for (k = 0; k < huffman_code->num_symbols; ++k) {
277 for (k = 0; k < huffman_code->num_symbols; ++k) {
311 const int max_tokens = tree->num_symbols;
318 huffman_code.num_symbols = CODE_LENGTH_CODES;
385 for (i = 0; i < huffman_code->num_symbols && count < 3; ++i)
[all...] |
| /external/opencv3/3rdparty/libwebp/dec/ |
| vp8l.c | 172 int num_symbols, int* const code_lengths) {
189 if (max_symbol > num_symbols) {
194 max_symbol = num_symbols;
198 while (symbol < num_symbols) {
212 if (symbol + repeat > num_symbols) {
238 const int num_symbols = VP8LReadBits(br, 1) + 1; local
243 code_lengths[0] = num_symbols - 1;
245 if (num_symbols == 2) {
248 code_lengths[1] = num_symbols - 1;
251 alphabet_size, num_symbols);
[all...] |
| /external/webp/src/dec/ |
| vp8l.c | 249 int num_symbols, int* const code_lengths) {
266 if (max_symbol > num_symbols) {
270 max_symbol = num_symbols;
274 while (symbol < num_symbols) {
291 if (symbol + repeat > num_symbols) {
318 const int num_symbols = VP8LReadBits(br, 1) + 1; local
324 if (num_symbols == 2) {
[all...] |
| /external/webp/src/enc/ |
| vp8l.c | 440 const int num_symbols = local
443 codes[k].num_symbols = num_symbols;
444 total_length_size += num_symbols;
459 const int bit_length = huffman_codes[i].num_symbols;
522 for (k = 0; k < huffman_code->num_symbols; ++k) {
528 for (k = 0; k < huffman_code->num_symbols; ++k) {
564 const int max_tokens = tree->num_symbols;
567 huffman_code.num_symbols = CODE_LENGTH_CODES;
632 for (i = 0; i < huffman_code->num_symbols && count < 3; ++i)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/X11/extensions/ |
| XKBstr.h | 553 int num_symbols; member in struct:_XkbComponentList
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/X11/extensions/ |
| XKBstr.h | 553 int num_symbols; member in struct:_XkbComponentList
|
| /toolchain/binutils/binutils-2.25/bfd/ |
| elf32-ppc.c | 3702 unsigned int num_symbols = elf_symtab_hdr (abfd).sh_info; local
[all...] |
