Home
last modified time | relevance | path

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

12345678910>>...49

/dports/archivers/jzlib/jzlib-1.1.1/src/main/java/com/jcraft/jzlib/
H A DTree.java177 for (bits = 0; bits <= MAX_BITS; bits++) s.bl_count[bits] = 0; in gen_bitlen()
192 s.bl_count[bits]++; in gen_bitlen()
205 while(s.bl_count[bits]==0) bits--; in gen_bitlen()
206 s.bl_count[bits]--; // move one leaf down the tree in gen_bitlen()
207 s.bl_count[bits+1]+=2; // move one overflow item as its brother in gen_bitlen()
208 s.bl_count[max_length]--; in gen_bitlen()
216 n = s.bl_count[bits]; in gen_bitlen()
311 gen_codes(tree, max_code, s.bl_count); in build_tree()
323 short[] bl_count // number of codes at each bit length in gen_codes() argument
333 next_code[bits] = code = (short)((code + bl_count[bits-1]) << 1); in gen_codes()
/dports/net/tigervnc-server/tigervnc-1.12.0/java/com/jcraft/jzlib/
H A DTree.java177 for (bits = 0; bits <= MAX_BITS; bits++) s.bl_count[bits] = 0; in gen_bitlen()
192 s.bl_count[bits]++; in gen_bitlen()
205 while(s.bl_count[bits]==0) bits--; in gen_bitlen()
206 s.bl_count[bits]--; // move one leaf down the tree in gen_bitlen()
207 s.bl_count[bits+1]+=2; // move one overflow item as its brother in gen_bitlen()
208 s.bl_count[max_length]--; in gen_bitlen()
216 n = s.bl_count[bits]; in gen_bitlen()
311 gen_codes(tree, max_code, s.bl_count, s.next_code); in build_tree()
323 short[] bl_count, // number of codes at each bit length in gen_codes() argument
333 next_code[bits] = code = (short)((code + bl_count[bits-1]) << 1); in gen_codes()
/dports/net/tigervnc-viewer/tigervnc-1.12.0/java/com/jcraft/jzlib/
H A DTree.java177 for (bits = 0; bits <= MAX_BITS; bits++) s.bl_count[bits] = 0; in gen_bitlen()
192 s.bl_count[bits]++; in gen_bitlen()
205 while(s.bl_count[bits]==0) bits--; in gen_bitlen()
206 s.bl_count[bits]--; // move one leaf down the tree in gen_bitlen()
207 s.bl_count[bits+1]+=2; // move one overflow item as its brother in gen_bitlen()
208 s.bl_count[max_length]--; in gen_bitlen()
216 n = s.bl_count[bits]; in gen_bitlen()
311 gen_codes(tree, max_code, s.bl_count, s.next_code); in build_tree()
323 short[] bl_count, // number of codes at each bit length in gen_codes() argument
333 next_code[bits] = code = (short)((code + bl_count[bits-1]) << 1); in gen_codes()
/dports/archivers/zopfli/zopfli-zopfli-1.0.3/src/zopfli/
H A 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()
/dports/archivers/pigz/pigz-2.6/zopfli/src/zopfli/
H A 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()
/dports/archivers/maxcso/maxcso-1.10.0/zopfli/src/zopfli/
H A 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()
/dports/archivers/py-zopfli/zopfli-0.1.9/zopfli/src/zopfli/
H A 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()
/dports/graphics/apngasm/apngasm-2.91/zopfli/
H A 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()
/dports/archivers/advancecomp/advancecomp-2.1-6-g7b08f7a/zopfli/
H A 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()
/dports/misc/broot/broot-1.7.0/cargo-crates/libz-sys-1.1.3/src/zlib-ng/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init() local
79 bl_count[bits] = 0; in tr_static_init()
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
/dports/devel/cargo-c/cargo-c-0.9.6+cargo-0.58/cargo-crates/libz-sys-1.1.3/src/zlib-ng/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init() local
79 bl_count[bits] = 0; in tr_static_init()
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
/dports/devel/git-absorb/git-absorb-0.6.6/cargo-crates/libz-sys-1.1.2/src/zlib-ng/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init() local
79 bl_count[bits] = 0; in tr_static_init()
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
/dports/archivers/c-blosc2/c-blosc2-2.0.4/internal-complibs/zlib-ng-2.0.5/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init() local
79 bl_count[bits] = 0; in tr_static_init()
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
/dports/devel/git-delta/delta-0.9.2/cargo-crates/libz-sys-1.1.2/src/zlib-ng/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init() local
79 bl_count[bits] = 0; in tr_static_init()
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
/dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/libz-sys-1.1.2/src/zlib-ng/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init() local
79 bl_count[bits] = 0; in tr_static_init()
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
/dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/libz-sys-1.1.3/src/zlib-ng/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init() local
79 bl_count[bits] = 0; in tr_static_init()
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
/dports/devel/tokei/tokei-12.1.2/cargo-crates/libz-sys-1.1.0/src/zlib-ng/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init() local
79 bl_count[bits] = 0; in tr_static_init()
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
/dports/devel/gitui/gitui-0.10.1/cargo-crates/libz-sys-1.1.0/src/zlib-ng/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1];
79 bl_count[bits] = 0;
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in DataBuffer()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
/dports/devel/grcov/grcov-0.8.2/cargo-crates/libz-sys-1.1.3/src/zlib-ng/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init() local
79 bl_count[bits] = 0; in tr_static_init()
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
/dports/devel/cargo-generate/cargo-generate-0.9.0/cargo-crates/libz-sys-1.1.2/src/zlib-ng/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init() local
79 bl_count[bits] = 0; in tr_static_init()
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
/dports/sysutils/onefetch/onefetch-2.10.2/cargo-crates/libz-sys-1.1.3/src/zlib-ng/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init() local
79 bl_count[bits] = 0; in tr_static_init()
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
/dports/devel/pijul/pijul-1.0.0.a55/cargo-crates/libz-sys-1.1.3/src/zlib-ng/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init() local
79 bl_count[bits] = 0; in tr_static_init()
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
/dports/textproc/mdbook-linkcheck/mdbook-linkcheck-0.7.6/cargo-crates/libz-sys-1.1.3/src/zlib-ng/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init() local
79 bl_count[bits] = 0; in tr_static_init()
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
/dports/lang/rust/rustc-1.58.1-src/vendor/libz-sys/src/zlib-ng/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init() local
79 bl_count[bits] = 0; in tr_static_init()
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
/dports/textproc/bat/bat-0.18.3/cargo-crates/libz-sys-1.1.3/src/zlib-ng/tools/
H A Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init() local
79 bl_count[bits] = 0; in tr_static_init()
81 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
82 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init()
83 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init()
84 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init()
88 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()

12345678910>>...49