| /external/zopfli/src/zopfli/ |
| D | tree.c | 33 size_t* next_code = (size_t*)malloc(sizeof(size_t) * (maxbits + 1)); in ZopfliLengthsToSymbols() local
55 next_code[bits] = code; in ZopfliLengthsToSymbols()
62 symbols[i] = next_code[len]; in ZopfliLengthsToSymbols()
63 next_code[len]++; in ZopfliLengthsToSymbols()
68 free(next_code); in ZopfliLengthsToSymbols()
|
| /external/pcre/dist2/src/ |
| D | pcre2_auto_possess.c | 523 PCRE2_SPTR next_code; in compare_opcodes() local
639 next_code = code + GET(code, 1); in compare_opcodes()
645 while (*next_code == OP_ALT) in compare_opcodes()
649 code = next_code + 1 + LINK_SIZE; in compare_opcodes()
650 next_code += GET(next_code, 1); in compare_opcodes()
659 next_code = code + 1; in compare_opcodes()
660 if (*next_code != OP_BRA && *next_code != OP_CBRA && in compare_opcodes()
661 *next_code != OP_ONCE) return FALSE; in compare_opcodes()
663 do next_code += GET(next_code, 1); while (*next_code == OP_ALT); in compare_opcodes()
667 next_code += 1 + LINK_SIZE; in compare_opcodes()
[all …]
|
| /external/python/cpython2/Lib/distutils/tests/ |
| D | test_upload.py | 66 self.next_code = None
73 self.last_open = FakeOpen(url, msg=self.next_msg, code=self.next_code)
159 self.next_code = 404
|
| /external/webp/src/utils/ |
| D | huffman_encode_utils.c | 378 uint32_t next_code[MAX_ALLOWED_CODE_LENGTH + 1]; in ConvertBitDepthsToSymbols() local
389 next_code[0] = 0; in ConvertBitDepthsToSymbols()
394 next_code[i] = code; in ConvertBitDepthsToSymbols()
399 tree->codes[i] = ReverseBits(code_length, next_code[code_length]++); in ConvertBitDepthsToSymbols()
|
| /external/python/cpython3/Lib/distutils/tests/ |
| D | test_upload.py | 77 self.next_code = None
84 self.last_open = FakeOpen(url, msg=self.next_msg, code=self.next_code)
174 self.next_code = 404
|
| /external/brotli/c/enc/ |
| D | entropy_encode.c | 480 uint16_t next_code[MAX_HUFFMAN_BITS]; in BrotliConvertBitDepthsToSymbols() local
487 next_code[0] = 0; in BrotliConvertBitDepthsToSymbols()
490 next_code[i] = (uint16_t)code; in BrotliConvertBitDepthsToSymbols()
494 bits[i] = BrotliReverseBits(depth[i], next_code[depth[i]]++); in BrotliConvertBitDepthsToSymbols()
|
| /external/zlib/ |
| D | trees.c | 577 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
587 next_code[bits] = (ush)code;
600 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
603 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
|
| /external/u-boot/lib/zlib/ |
| D | trees.c | 586 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
595 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
608 tree[n].Code = bi_reverse(next_code[len]++, len);
611 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
|
| /external/python/cpython2/Modules/zlib/ |
| D | trees.c | 577 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
587 next_code[bits] = (ush)code;
600 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
603 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
|
| /external/v8/third_party/zlib/ |
| D | trees.c | 577 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
587 next_code[bits] = (ush)code;
600 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
603 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
|
| /external/OpenCL-CTS/test_common/miniz/ |
| D | miniz.c | 750 …mz_uint i, j, used_syms, total, sym_index, next_code[17], total_syms[16]; pTable = &r->m_tables[r-… in tinfl_decompress() local
752 used_syms = 0, total = 0; next_code[0] = next_code[1] = 0; in tinfl_decompress()
753 …for (i = 1; i <= 15; ++i) { used_syms += total_syms[i]; next_code[i + 1] = (total = ((total + tota… in tinfl_decompress()
761 …cur_code = next_code[code_size]++; for (l = code_size; l > 0; l--, cur_code >>= 1) rev_code = (rev… in tinfl_decompress()
1112 …int i, j, l, num_codes[1 + TDEFL_MAX_SUPPORTED_HUFF_CODESIZE]; mz_uint next_code[TDEFL_MAX_SUPPORT… in tdefl_optimize_huffman_table() local
1135 …next_code[1] = 0; for (j = 0, i = 2; i <= code_size_limit; i++) next_code[i] = j = ((j + num_codes… in tdefl_optimize_huffman_table()
1140 …code = next_code[code_size]++; for (l = code_size; l > 0; l--, code >>= 1) rev_code = (rev_code <<… in tdefl_optimize_huffman_table()
|