Searched refs:HEAP_SIZE (Results 1 - 7 of 7) sorted by relevance

/illumos-gate/usr/src/boot/sys/boot/ofw/common/
H A Dmain.c48 #define HEAP_SIZE 0x100000 macro
58 if ((base = ofw_alloc_heap(HEAP_SIZE)) == (void *)0xffffffff) {
64 setheap(base, (void *)((int)base + HEAP_SIZE));
/illumos-gate/usr/src/uts/common/zmod/
H A Ddeflate.h45 #define HEAP_SIZE (2*L_CODES+1) macro
192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
H A Dtrees.c514 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
549 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
634 s->heap_len = 0, s->heap_max = HEAP_SIZE;
/illumos-gate/usr/src/boot/lib/libz/
H A Ddeflate.h45 #define HEAP_SIZE (2*L_CODES+1) macro
195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
H A Dtrees.c512 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
547 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
632 s->heap_len = 0, s->heap_max = HEAP_SIZE;
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c170 #define HEAP_SIZE (2*L_CODES+1) macro
313 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
1872 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
1907 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
1992 s->heap_len = 0, s->heap_max = HEAP_SIZE;
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c316 #define HEAP_SIZE (2*L_CODES+1) macro
474 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
2682 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
2722 * frequency. h is still equal to HEAP_SIZE. (It is simpler
2819 s->heap_len = 0, s->heap_max = HEAP_SIZE;

Completed in 78 milliseconds