HomeSort by: relevance | last modified time | path
    Searched refs:next_code (Results 1 - 6 of 6) sorted by relevancy

  /src/common/dist/zlib/
trees.c 205 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
215 next_code[bits] = (ush)code;
228 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
231 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len] - 1));
trees.c 205 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
215 next_code[bits] = (ush)code;
228 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
231 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len] - 1));
  /src/sys/dev/stbi/
stb_image.c 2220 int code, next_code[16], sizes[17]; local
2232 next_code[i] = code;
2246 int c = next_code[s] - z->firstcode[s] + z->firstsymbol[s];
2250 int m = bit_reverse(next_code[s],s);
2256 ++next_code[s];
stb_image.c 2220 int code, next_code[16], sizes[17]; local
2232 next_code[i] = code;
2246 int c = next_code[s] - z->firstcode[s] + z->firstsymbol[s];
2250 int m = bit_reverse(next_code[s],s);
2256 ++next_code[s];
  /src/sys/net/
zlib.c 2675 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
2684 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
2697 tree[n].Code = bi_reverse(next_code[len]++, len);
2700 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
zlib.c 2675 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
2684 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
2697 tree[n].Code = bi_reverse(next_code[len]++, len);
2700 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));

Completed in 81 milliseconds