| /external/zopfli/src/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);
|
| /external/opencv/cv/src/ |
| cvconvhull.cpp | 433 int bl_count = sklansky( pointer, 0, miny_ind, bl_stack, 1, -1 ); local
434 int *br_stack = stack + bl_count;
440 CV_SWAP( bl_count, br_count, t_count );
445 int check_idx = bl_count > 2 ? bl_stack[1] :
446 bl_count + br_count > 2 ? br_stack[2-bl_count] : -1;
454 bl_count = MIN( bl_count, 2 );
461 for( i = 0; i < bl_count - 1; i++ )
470 0, bl_count-1, ptseq, &writer ))
[all...] |
| /external/opencv3/3rdparty/zlib/ |
| deflate.h | 203 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));
243 ush bl_count[MAX_BITS+1]; local
291 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
293 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; local
294 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; local
295 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; local
296 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; local
301 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
484 * array bl_count contains the frequencies for each bit length.
505 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0
[all...] |
| /external/opencv3/modules/imgproc/src/ |
| convhull.cpp | 216 int bl_count = !is_float ? local
219 int *br_stack = stack + bl_count;
227 std::swap( bl_count, br_count );
232 int check_idx = bl_count > 2 ? bl_stack[1] :
233 bl_count + br_count > 2 ? br_stack[2-bl_count] : -1;
241 bl_count = MIN( bl_count, 2 );
246 for( i = 0; i < bl_count-1; i++ )
|
| /external/pdfium/third_party/zlib_v128/ |
| deflate.h | 203 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));
243 ush bl_count[MAX_BITS+1]; local
291 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
293 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; local
294 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; local
295 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; local
296 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; local
301 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
484 * array bl_count contains the frequencies for each bit length.
505 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0
[all...] |
| /external/zlib/src/ |
| deflate.h | 203 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));
243 ush bl_count[MAX_BITS+1]; local
291 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
293 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; local
294 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; local
295 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; local
296 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; local
301 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
484 * array bl_count contains the frequencies for each bit length.
505 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0
[all...] |
