Home
last modified time | relevance | path

Searched refs:next_code (Results 1 – 10 of 10) sorted by relevance

/external/zopfli/src/zopfli/
Dtree.c33 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/
Dpcre2_auto_possess.c523 PCRE2_SPTR next_code; in compare_opcodes() local
631 next_code = code + GET(code, 1); in compare_opcodes()
637 while (*next_code == OP_ALT) in compare_opcodes()
641 code = next_code + 1 + LINK_SIZE; in compare_opcodes()
642 next_code += GET(next_code, 1); in compare_opcodes()
651 next_code = code + 1; in compare_opcodes()
652 if (*next_code != OP_BRA && *next_code != OP_CBRA && in compare_opcodes()
653 *next_code != OP_ONCE) return FALSE; in compare_opcodes()
655 do next_code += GET(next_code, 1); while (*next_code == OP_ALT); in compare_opcodes()
659 next_code += 1 + LINK_SIZE; in compare_opcodes()
[all …]
/external/python/cpython2/Lib/distutils/tests/
Dtest_upload.py66 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/
Dhuffman_encode_utils.c378 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/
Dtest_upload.py77 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/
Dentropy_encode.c480 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/python/cpython2/Modules/zlib/
Dtrees.c577 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/zlib/src/
Dtrees.c577 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/
Dtrees.c586 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/zlib/src/doc/
Drfc1951.txt432 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]