Home
last modified time | relevance | path

Searched refs:MAX_BITS (Results 1 – 16 of 16) sorted by relevance

/external/libnetfilter_conntrack/src/conntrack/
Dlabels.c6 #define MAX_BITS 1024 macro
129 if (value >= MAX_BITS) in xtables_parse_connlabel_numerical()
225 uint32_t bits_seen[MAX_BITS/32]; in __labelmap_new()
/external/rust/crates/libz-sys/src/zlib-ng/
Dtrees.c56 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
59 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
201 for (bits = 0; bits <= MAX_BITS; bits++) in gen_bitlen()
285 uint16_t next_code[MAX_BITS+1]; /* next code value for each bit length */ in gen_codes()
293 for (bits = 1; bits <= MAX_BITS; bits++) { in gen_codes()
300 Assert(code + bl_count[MAX_BITS]-1 == (1 << MAX_BITS)-1, "inconsistent bit counts"); in gen_codes()
Ddeflate.h50 #define MAX_BITS 15 macro
215 uint16_t bl_count[MAX_BITS+1];
/external/rust/crates/libz-sys/src/zlib-ng/tools/
Dmaketrees.c42 uint16_t bl_count[MAX_BITS+1]; in tr_static_init()
78 for (bits = 0; bits <= MAX_BITS; bits++) in tr_static_init()
/external/rappor/client/java/com/google/android/rappor/
DEncoder.java52 public static final int MAX_BITS = 4096; field in Encoder
338 numBits >= 1 && numBits <= MAX_BITS, "numBits must be on range [1, " + MAX_BITS + "]."); in Encoder()
/external/libwebsockets/win32port/zlib/
Dtrees.c131 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
134 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
248 ush bl_count[MAX_BITS+1]; in tr_static_init()
296 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
511 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
586 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
594 for (bits = 1; bits <= MAX_BITS; bits++) {
600 Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
Ddeflate.h48 #define MAX_BITS 15 macro
200 ush bl_count[MAX_BITS+1];
/external/python/cpython2/Modules/zlib/
Dtrees.c126 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
129 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
241 ush bl_count[MAX_BITS+1]; in tr_static_init()
289 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
503 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
577 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
585 for (bits = 1; bits <= MAX_BITS; bits++) {
592 Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
Ddeflate.h48 #define MAX_BITS 15 macro
206 ush bl_count[MAX_BITS+1];
/external/rust/crates/libz-sys/src/zlib/
Dtrees.c126 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
129 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
241 ush bl_count[MAX_BITS+1]; in tr_static_init()
289 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
503 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
577 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
585 for (bits = 1; bits <= MAX_BITS; bits++) {
592 Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
Ddeflate.h48 #define MAX_BITS 15 macro
206 ush bl_count[MAX_BITS+1];
/external/zlib/
Dtrees.c126 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
129 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
241 ush bl_count[MAX_BITS+1]; in tr_static_init()
289 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
503 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
577 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
585 for (bits = 1; bits <= MAX_BITS; bits++) {
592 Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
Ddeflate.h48 #define MAX_BITS 15 macro
206 ush bl_count[MAX_BITS+1];
/external/rust/crates/chrono/src/naive/
Ddate.rs48 const MAX_BITS: usize = 44; constant
130 maxsecs < (1 << MAX_BITS), in test_date_bounds()
132 MAX_BITS in test_date_bounds()
/external/rust/crates/libz-sys/src/zlib/doc/
Drfc1951.txt430 for (bits = 1; bits <= MAX_BITS; bits++) {
/external/rust/crates/libz-sys/src/zlib-ng/doc/
Drfc1951.txt430 for (bits = 1; bits <= MAX_BITS; bits++) {