| /src/external/zlib/pigz/dist/zopfli/ |
| tree.c | 32 size_t* bl_count = (size_t*)malloc(sizeof(size_t) * (maxbits + 1)); local
41 /* 1) Count the number of codes for each code length. Let bl_count[N] be the
44 bl_count[bits] = 0;
48 bl_count[lengths[i]]++;
52 bl_count[0] = 0;
54 code = (code + bl_count[bits-1]) << 1;
67 free(bl_count);
|
| /src/common/dist/zlib/ |
| deflate.h | 212 ush bl_count[MAX_BITS+1]; member in struct:internal_state
|
| 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
352 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
354 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; local
355 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; local
356 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++ local
357 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; local
[all...] |
| /src/external/cddl/osnet/dist/uts/common/zmod/ |
| deflate.h | 200 ush bl_count[MAX_BITS+1]; member in struct:internal_state
|
| trees.c | 146 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
247 ush bl_count[MAX_BITS+1]; local
293 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
295 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; local
296 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; local
297 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; local
298 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; local
303 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
486 * array bl_count contains the frequencies for each bit length.
507 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0
[all...] |
| /src/external/gpl3/binutils/dist/zlib/ |
| deflate.h | 210 ush bl_count[MAX_BITS+1]; member in struct:internal_state
|
| trees.c | 197 * IN assertion: the array bl_count contains the bit length statistics for
202 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) {
212 code = (code + bl_count[bits - 1]) << 1;
215 /* Check that the bit counts in bl_count are consistent. The last code
218 Assert (code + bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1,
302 ush bl_count[MAX_BITS+1]; local
350 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
352 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; local
353 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; local
354 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++ local
355 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; local
[all...] |
| /src/external/gpl3/binutils.old/dist/zlib/ |
| deflate.h | 206 ush bl_count[MAX_BITS+1]; member in struct:internal_state
|
| trees.c | 142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
241 ush bl_count[MAX_BITS+1]; local
289 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
291 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; local
292 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; local
293 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; local
294 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; local
299 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
482 * array bl_count contains the frequencies for each bit length.
503 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0
[all...] |
| /src/external/gpl3/gdb.old/dist/zlib/ |
| deflate.h | 206 ush bl_count[MAX_BITS+1]; member in struct:internal_state
|
| trees.c | 142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
241 ush bl_count[MAX_BITS+1]; local
289 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
291 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; local
292 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; local
293 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; local
294 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; local
299 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
482 * array bl_count contains the frequencies for each bit length.
503 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0
[all...] |
| /src/external/gpl3/gdb/dist/zlib/ |
| deflate.h | 210 ush bl_count[MAX_BITS+1]; member in struct:internal_state
|
| trees.c | 197 * IN assertion: the array bl_count contains the bit length statistics for
202 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) {
212 code = (code + bl_count[bits - 1]) << 1;
215 /* Check that the bit counts in bl_count are consistent. The last code
218 Assert (code + bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1,
302 ush bl_count[MAX_BITS+1]; local
350 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
352 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; local
353 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; local
354 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++ local
355 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; local
[all...] |
| /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
2391 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
2393 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; local
2394 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; local
2395 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; local
2396 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; local
2401 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
2581 * array bl_count contains the frequencies for each bit length
[all...] |
