Home
last modified time | relevance | path

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

/third_party/ffmpeg/libavcodec/
Dhuffyuv.h45 #define MAX_BITS 16 macro
46 #define MAX_N (1<<MAX_BITS)
/third_party/skia/third_party/externals/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];
/third_party/node/deps/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];
/third_party/flutter/skia/third_party/externals/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];
/third_party/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];
/third_party/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];
/third_party/libcoap/tests/
Dtest_session.c28 #define MAX_BITS 8 macro
68 return (double)(q) / (1 << MAX_BITS); in q_to_double()
/third_party/libcoap/src/
Dnet.c80 #define MAX_BITS 8 macro
958 result = SHR_FP((ACK_RANDOM_FACTOR - FP1) * r, MAX_BITS); in coap_calc_timeout()
/third_party/zlib/doc/
Drfc1951.txt430 for (bits = 1; bits <= MAX_BITS; bits++) {