| /external/zopfli/src/zopfli/ |
| D | tree.c | 32 size_t* bl_count = (size_t*)malloc(sizeof(size_t) * (maxbits + 1)); in ZopfliLengthsToSymbols() local
44 bl_count[bits] = 0; in ZopfliLengthsToSymbols()
48 bl_count[lengths[i]]++; in ZopfliLengthsToSymbols()
52 bl_count[0] = 0; in ZopfliLengthsToSymbols()
54 code = (code + bl_count[bits-1]) << 1; in ZopfliLengthsToSymbols()
67 free(bl_count); in ZopfliLengthsToSymbols()
|
| /external/qemu/distrib/zlib-1.2.8/ |
| D | trees.c | 142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
243 ush bl_count[MAX_BITS+1]; in tr_static_init() local
291 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
293 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
294 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
295 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
296 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
301 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
505 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
521 s->bl_count[bits]++;
[all …]
|
| D | deflate.h | 203 ush bl_count[MAX_BITS+1]; member
|
| /external/chromium_org/third_party/zlib/ |
| D | trees.c | 147 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
248 ush bl_count[MAX_BITS+1]; in tr_static_init() local
296 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
298 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
299 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
300 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
301 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
306 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
511 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
527 s->bl_count[bits]++;
[all …]
|
| D | deflate.h | 205 ush bl_count[MAX_BITS+1]; member
|
| /external/zlib/src/ |
| D | trees.c | 142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
243 ush bl_count[MAX_BITS+1]; in tr_static_init() local
291 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
293 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
294 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
295 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
296 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
301 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
505 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
521 s->bl_count[bits]++;
[all …]
|
| D | deflate.h | 203 ush bl_count[MAX_BITS+1]; member
|
| /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
| D | fx_zlib_trees.c | 142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
243 ush bl_count[MAX_BITS+1]; in tr_static_init() local
291 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
293 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
294 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
295 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
296 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
301 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
505 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0; in gen_bitlen()
521 s->bl_count[bits]++; in gen_bitlen()
[all …]
|
| D | deflate.h | 203 ush bl_count[MAX_BITS+1]; member
|
| /external/opencv/cv/src/ |
| D | cvconvhull.cpp | 433 int bl_count = sklansky( pointer, 0, miny_ind, bl_stack, 1, -1 ); in cvConvexHull2() local
434 int *br_stack = stack + bl_count; in cvConvexHull2()
440 CV_SWAP( bl_count, br_count, t_count ); in cvConvexHull2()
445 int check_idx = bl_count > 2 ? bl_stack[1] : in cvConvexHull2()
446 bl_count + br_count > 2 ? br_stack[2-bl_count] : -1; in cvConvexHull2()
454 bl_count = MIN( bl_count, 2 ); in cvConvexHull2()
461 for( i = 0; i < bl_count - 1; i++ ) in cvConvexHull2()
470 0, bl_count-1, ptseq, &writer )); in cvConvexHull2()
476 for( i = 0; i < bl_count - 1; i++ ) in cvConvexHull2()
|
| /external/chromium_org/third_party/brotli/src/brotli/enc/ |
| D | entropy_encode.cc | 481 uint16_t bl_count[kMaxBits] = { 0 }; in ConvertBitDepthsToSymbols() local
484 ++bl_count[depth[i]]; in ConvertBitDepthsToSymbols()
486 bl_count[0] = 0; in ConvertBitDepthsToSymbols()
493 code = (code + bl_count[bits - 1]) << 1; in ConvertBitDepthsToSymbols()
|
| /external/zlib/src/doc/ |
| D | rfc1951.txt | 423 bl_count[N] be the number of codes of length N, N >= 1.
429 bl_count[0] = 0;
431 code = (code + bl_count[bits-1]) << 1;
462 N bl_count[N]
|
| /external/chromium_org/third_party/brotli/src/brotli/ |
| D | brotlispec.txt | 344 bl_count[N] be the number of codes of length N, N >= 1.
350 bl_count[0] = 0;
352 code = (code + bl_count[bits-1]) << 1;
375 N bl_count[N]
|