Home
last modified time | relevance | path

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

/third_party/libwebsockets/win32port/zlib/
Ddeflate.h45 #define HEAP_SIZE (2*L_CODES+1) macro
192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
Dtrees.c518 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
638 s->heap_len = 0, s->heap_max = HEAP_SIZE;
/third_party/zlib/
Ddeflate.h45 #define HEAP_SIZE (2*L_CODES+1) macro
198 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
Dtrees.c510 for (h = s->heap_max + 1; h < HEAP_SIZE; h++) {
630 s->heap_len = 0, s->heap_max = HEAP_SIZE;
/third_party/skia/third_party/externals/zlib/
Ddeflate.h45 #define HEAP_SIZE (2*L_CODES+1) macro
198 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
Dtrees.c510 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
630 s->heap_len = 0, s->heap_max = HEAP_SIZE;
/third_party/node/deps/v8/third_party/zlib/
Ddeflate.h45 #define HEAP_SIZE (2*L_CODES+1) macro
198 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
Dtrees.c510 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
630 s->heap_len = 0, s->heap_max = HEAP_SIZE;
/third_party/node/deps/zlib/
Ddeflate.h49 #define HEAP_SIZE (2*L_CODES+1) macro
202 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
Dtrees.c559 for (h = s->heap_max + 1; h < HEAP_SIZE; h++) { in gen_bitlen()
637 s->heap_len = 0, s->heap_max = HEAP_SIZE; in build_tree()
/third_party/mbedtls/programs/test/
Dbenchmark.c109 #define HEAP_SIZE (1u << 16) /* 64k */ macro
526 unsigned char alloc_buf[HEAP_SIZE] = { 0 }; in main()