| /third_party/ffmpeg/libavcodec/ |
| D | mlz.c | 30 mlz->next_code = FIRST_CODE; in ff_mlz_init_dict()
46 mlz->next_code = FIRST_CODE; in ff_mlz_flush_dict()
155 if (string_code >= mlz->next_code) { in ff_mlz_decompression()
168 set_new_entry_dict(dict, mlz->next_code, last_string_code, char_code); in ff_mlz_decompression()
169 if (mlz->next_code >= TABLE_SIZE - 1) { in ff_mlz_decompression()
173 mlz->next_code++; in ff_mlz_decompression()
183 … set_new_entry_dict(dict, mlz->next_code, last_string_code, char_code); in ff_mlz_decompression()
184 if (mlz->next_code >= TABLE_SIZE - 1) { in ff_mlz_decompression()
188 mlz->next_code++; in ff_mlz_decompression()
|
| D | mss2.c | 249 int current_length = 0, read_codes = 0, next_code = 0, current_codes = 0; in decode_rle() local
293 codes[symbol] = next_code++; in decode_rle()
297 next_code <<= 1; in decode_rle()
298 remaining_codes = (1 << current_length) - next_code; in decode_rle()
308 (next_code << 1) - remaining_codes) < 0) { in decode_rle()
310 next_code <<= 1; in decode_rle()
318 next_code <<= 1; in decode_rle()
321 codes[i] = next_code++; in decode_rle()
324 if (next_code != 1 << current_length) in decode_rle()
|
| D | mlz.h | 52 int next_code; member
|
| /third_party/pcre2/pcre2/src/ |
| D | pcre2_auto_possess.c | 544 PCRE2_SPTR next_code; in compare_opcodes() local
667 next_code = code + GET(code, 1); in compare_opcodes()
673 while (*next_code == OP_ALT) in compare_opcodes()
677 code = next_code + 1 + LINK_SIZE; in compare_opcodes()
678 next_code += GET(next_code, 1); in compare_opcodes()
687 next_code = code + 1; in compare_opcodes()
688 if (*next_code != OP_BRA && *next_code != OP_CBRA && in compare_opcodes()
689 *next_code != OP_ONCE) return FALSE; in compare_opcodes()
691 do next_code += GET(next_code, 1); while (*next_code == OP_ALT); in compare_opcodes()
695 next_code += 1 + LINK_SIZE; in compare_opcodes()
[all …]
|
| /third_party/skia/third_party/externals/libwebp/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()
|
| /third_party/flutter/skia/third_party/externals/libwebp/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()
|
| /third_party/python/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)
190 self.next_code = 404
|
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| D | entropy_encode.c | 482 uint16_t next_code[MAX_HUFFMAN_BITS]; in BrotliConvertBitDepthsToSymbols() local
489 next_code[0] = 0; in BrotliConvertBitDepthsToSymbols()
492 next_code[i] = (uint16_t)code; in BrotliConvertBitDepthsToSymbols()
496 bits[i] = BrotliReverseBits(depth[i], next_code[depth[i]]++); in BrotliConvertBitDepthsToSymbols()
|
| /third_party/node/deps/brotli/c/enc/ |
| D | entropy_encode.c | 482 uint16_t next_code[MAX_HUFFMAN_BITS]; in BrotliConvertBitDepthsToSymbols() local
489 next_code[0] = 0; in BrotliConvertBitDepthsToSymbols()
492 next_code[i] = (uint16_t)code; in BrotliConvertBitDepthsToSymbols()
496 bits[i] = BrotliReverseBits(depth[i], next_code[depth[i]]++); in BrotliConvertBitDepthsToSymbols()
|
| /third_party/skia/third_party/externals/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));
|
| /third_party/node/deps/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));
|
| /third_party/flutter/skia/third_party/externals/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));
|
| /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));
|
| /third_party/libwebsockets/win32port/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));
|
| /third_party/zlib/doc/ |
| D | rfc1951.txt | 432 next_code[bits] = code;
444 tree[n].Code = next_code[len];
445 next_code[len]++;
468 Step 2 computes the following next_code values:
470 N next_code[N]
|