| /external/zopfli/src/zopfli/ |
| tree.c | 33 size_t* next_code = (size_t*)malloc(sizeof(size_t) * (maxbits + 1)); local
55 next_code[bits] = code;
62 symbols[i] = next_code[len];
63 next_code[len]++;
68 free(next_code);
|
| /external/pcre/dist2/src/ |
| pcre2_auto_possess.c | 523 PCRE2_SPTR next_code; local
606 next_code = code + GET(code, 1);
609 while (*next_code == OP_ALT)
613 code = next_code + 1 + LINK_SIZE;
614 next_code += GET(next_code, 1);
623 next_code = code + 1;
624 if (*next_code != OP_BRA && *next_code != OP_CBRA
625 && *next_code != OP_ONCE && *next_code != OP_ONCE_NC) return FALSE
[all...] |
| /external/python/cpython2/Lib/distutils/tests/ |
| test_upload.py | 66 self.next_code = None
73 self.last_open = FakeOpen(url, msg=self.next_msg, code=self.next_code)
133 self.next_code = 404
|
| /external/webp/src/utils/ |
| huffman_encode_utils.c | 378 uint32_t next_code[MAX_ALLOWED_CODE_LENGTH + 1]; local
389 next_code[0] = 0;
394 next_code[i] = code;
399 tree->codes[i] = ReverseBits(code_length, next_code[code_length]++);
|
| /external/brotli/enc/ |
| entropy_encode.c | 480 uint16_t next_code[MAX_HUFFMAN_BITS]; local
487 next_code[0] = 0;
490 next_code[i] = (uint16_t)code;
494 bits[i] = BrotliReverseBits(depth[i], next_code[depth[i]]++);
|
| /external/valgrind/coregrind/m_debuginfo/ |
| tinfl.c | 346 mz_uint i, j, used_syms, total, sym_index, next_code[17], total_syms[16]; pTable = &r->m_tables[r->m_type]; MZ_CLEAR_OBJ(total_syms); MZ_CLEAR_OBJ(pTable->m_look_up); MZ_CLEAR_OBJ(pTable->m_tree); local
348 used_syms = 0, total = 0; next_code[0] = next_code[1] = 0;
349 for (i = 1; i <= 15; ++i) { used_syms += total_syms[i]; next_code[i + 1] = (total = ((total + total_syms[i]) << 1)); }
357 cur_code = next_code[code_size]++; for (l = code_size; l > 0; l--, cur_code >>= 1) rev_code = (rev_code << 1) | (cur_code & 1);
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/ |
| trees.c | 580 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
local
589 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
602 tree[n].Code = bi_reverse(next_code[len]++, len);
605 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
| trees.c | 582 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
local
591 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
604 tree[n].Code = bi_reverse(next_code[len]++, len);
607 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
[all...] |
| /external/pdfium/third_party/zlib_v128/ |
| trees.c | 580 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
589 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
602 tree[n].Code = bi_reverse(next_code[len]++, len);
605 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
[all...] |
| /external/python/cpython2/Modules/zlib/ |
| trees.c | 580 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
589 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
602 tree[n].Code = bi_reverse(next_code[len]++, len);
605 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
[all...] |
| /external/zlib/src/ |
| trees.c | 580 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
589 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
602 tree[n].Code = bi_reverse(next_code[len]++, len);
605 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
[all...] |
| /external/syslinux/com32/lib/zlib/ |
| 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));
[all...] |
