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

/macosx-10.10.1/rsync-45/rsync/zlib/
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;
/macosx-10.10.1/sudo-73/src/zlib/
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;
/macosx-10.10.1/xnu-2782.1.97/libkern/zlib/
H A Ddeflate.h72 #define HEAP_SIZE (2*L_CODES+1) macro
219 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
H A Dtrees.c541 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
576 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
661 s->heap_len = 0, s->heap_max = HEAP_SIZE;
/macosx-10.10.1/zlib-55/zlib/
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.c518 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
553 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
638 s->heap_len = 0, s->heap_max = HEAP_SIZE;
/macosx-10.10.1/ruby-106/ruby/
H A Dgc.c328 HEAP_SIZE = (HEAP_ALIGN - REQUIRED_SIZE_BY_MALLOC), enumerator in enum:__anon12174
329 HEAP_OBJ_LIMIT = (unsigned int)((HEAP_SIZE - sizeof(struct heaps_header))/sizeof(struct RVALUE)),
330 HEAP_BITMAP_LIMIT = CEILDIV(CEILDIV(HEAP_SIZE, sizeof(struct RVALUE)), sizeof(uintptr_t) * CHAR_BIT)
489 p = (RVALUE*)aligned_malloc(HEAP_ALIGN, HEAP_SIZE);
510 objs = (HEAP_SIZE - (size_t)((VALUE)p - (VALUE)membase))/sizeof(RVALUE);
/macosx-10.10.1/ppp-786.1.1/Helpers/pppdump/
H A Dzlib.c192 #define HEAP_SIZE (2*L_CODES+1) macro
335 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
1894 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
1929 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
2014 s->heap_len = 0, s->heap_max = HEAP_SIZE;
/macosx-10.10.1/ksh-23/ksh/src/cmd/INIT/
H A Dratz.c1255 #define HEAP_SIZE (2*L_CODES+1) macro
1402 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */

Completed in 196 milliseconds