Home
last modified time | relevance | path

Searched refs:HEAP_SIZE (Results 1 – 19 of 19) 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/uboot/u-boot-2020.01/lib/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/boost/libs/beast/test/extern/zlib-1.2.11/
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/boost/tools/boost_install/test/iostreams/zlib-1.2.11/
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/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/flutter/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/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/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/boost/boost/beast/zlib/detail/
Ddeflate_stream.hpp121 static std::uint16_t constexpr HEAP_SIZE = 2 * lCodes + 1; member in boost::beast::zlib::detail::deflate_stream
346 HEAP_SIZE]; // literal and length tree
Ddeflate_stream.ipp787 for(h = heap_max_+1; h < HEAP_SIZE; h++) {
826 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
871 heap_max_ = HEAP_SIZE;
/third_party/mbedtls/programs/test/
Dbenchmark.c125 #define HEAP_SIZE (1u << 16) // 64k macro
305 unsigned char alloc_buf[HEAP_SIZE] = { 0 }; in main()