Home
last modified time | relevance | path

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

/f-stack/dpdk/app/test/
H A Dtest_bitmap.c14 #define MAX_BITS 1000 macro
108 for (i = 0; i < MAX_BITS; i++) in test_bitmap_set_get_clear()
111 for (i = 0; i < MAX_BITS; i++) { in test_bitmap_set_get_clear()
118 for (i = 0; i < MAX_BITS; i++) in test_bitmap_set_get_clear()
121 for (i = 0; i < MAX_BITS; i++) { in test_bitmap_set_get_clear()
131 for (i = 0; i < MAX_BITS; i++) { in test_bitmap_set_get_clear()
136 for (i = 0; i < MAX_BITS; i++) { in test_bitmap_set_get_clear()
156 rte_bitmap_get_memory_footprint(MAX_BITS); in test_bitmap_all_clear()
164 bmp = rte_bitmap_init(MAX_BITS, mem, bmp_size); in test_bitmap_all_clear()
196 rte_bitmap_get_memory_footprint(MAX_BITS); in test_bitmap_all_set()
[all …]
/f-stack/freebsd/contrib/zlib/
H A 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,
H A Ddeflate.h48 #define MAX_BITS 15 macro
206 ush bl_count[MAX_BITS+1];
/f-stack/freebsd/contrib/zlib/doc/
H A Drfc1951.txt430 for (bits = 1; bits <= MAX_BITS; bits++) {