Home
last modified time | relevance | path

Searched refs:bl_count (Results 1 – 11 of 11) sorted by relevance

/external/zopfli/src/zopfli/
Dtree.c32 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/opencv3/3rdparty/zlib/
Dtrees.c142 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 …]
Ddeflate.h203 ush bl_count[MAX_BITS+1]; member
/external/zlib/src/
Dtrees.c142 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 …]
Ddeflate.h203 ush bl_count[MAX_BITS+1]; member
/external/pdfium/third_party/zlib_v128/
Dtrees.c142 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 …]
Ddeflate.h203 ush bl_count[MAX_BITS+1]; member
/external/opencv/cv/src/
Dcvconvhull.cpp433 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/opencv3/modules/imgproc/src/
Dconvhull.cpp216 int bl_count = !is_float ? in convexHull() local
219 int *br_stack = stack + bl_count; in convexHull()
227 std::swap( bl_count, br_count ); in convexHull()
232 int check_idx = bl_count > 2 ? bl_stack[1] : in convexHull()
233 bl_count + br_count > 2 ? br_stack[2-bl_count] : -1; in convexHull()
241 bl_count = MIN( bl_count, 2 ); in convexHull()
246 for( i = 0; i < bl_count-1; i++ ) in convexHull()
/external/zlib/src/doc/
Drfc1951.txt423 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-trace/catapult/tracing/third_party/jszip/
Djszip.min.js13 …(this.bl_tree),this.l_desc=null,this.d_desc=null,this.bl_desc=null,this.bl_count=new C.Buf16(gb+1)…
14bl_count[f]=0;for(i[2*a.heap[a.heap_max]+1]=0,c=a.heap_max+1;T>c;c++)d=a.heap[c],f=i[2*i[2*d+1]+1]…