Searched defs:next_code (Results 1 - 5 of 5) sorted by relevance
/external/zopfli/src/zopfli/ |
H A D | 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/webp/src/utils/ |
H A D | huffman_encode.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/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
H A D | fx_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));
|
/external/zlib/src/ |
H A D | 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));
|
/external/pcre/dist/ |
H A D | pcre_compile.c | 3075 const pcre_uchar *next_code; local 3150 next_code = code + GET(code, 1); 3153 while (*next_code == OP_ALT) 3156 code = next_code + 1 + LINK_SIZE; 3157 next_code += GET(next_code, 1); 3166 next_code = code + 1; 3167 if (*next_code != OP_BRA && *next_code != OP_CBRA 3168 && *next_code ! [all...] |
Completed in 589 milliseconds