HomeSort by: relevance | last modified time | path
    Searched defs:bl_count (Results 1 - 3 of 3) sorted by relevancy

  /src/common/dist/zlib/
trees.c 199 * IN assertion: the array bl_count contains the bit length statistics for
204 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) {
214 code = (code + bl_count[bits - 1]) << 1;
217 /* Check that the bit counts in bl_count are consistent. The last code
220 Assert (code + bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1,
304 ush bl_count[MAX_BITS+1]; local in function:tr_static_init
352 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
354 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
355 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
356 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++
    [all...]
deflate.h 212 ush bl_count[MAX_BITS+1]; member in struct:internal_state
  /src/sys/net/
zlib.c 473 ush bl_count[MAX_BITS+1]; member in struct:deflate_state
2246 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count);
2345 ush bl_count[MAX_BITS+1]; local in function:tr_static_init
2391 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
2393 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
2394 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
2395 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
2396 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
2401 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
2581 * array bl_count contains the frequencies for each bit length
    [all...]

Completed in 15 milliseconds