Searched defs:next_code (Results 1 - 5 of 5) sorted by relevance

/external/chromium_org/third_party/libwebp/utils/
H A Dhuffman_encode.c399 uint32_t next_code[MAX_ALLOWED_CODE_LENGTH + 1]; local
410 next_code[0] = 0;
415 next_code[i] = code;
420 tree->codes[i] = ReverseBits(code_length, next_code[code_length]++);
/external/webp/src/utils/
H A Dhuffman_encode.c399 uint32_t next_code[MAX_ALLOWED_CODE_LENGTH + 1]; local
410 next_code[0] = 0;
415 next_code[i] = code;
420 tree->codes[i] = ReverseBits(code_length, next_code[code_length]++);
/external/chromium_org/third_party/zlib/
H A 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/qemu/distrib/zlib-1.2.3/
H A Dtrees.c582 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));
/external/zlib/src/
H A Dtrees.c580 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));

Completed in 141 milliseconds