Searched refs:HEAP_SIZE (Results 1 – 10 of 10) sorted by relevance
58 static const size_t HEAP_SIZE = 512; variable59 char heap [ HEAP_SIZE ] __attribute__((aligned));69 static const heap_node *list_end = (heap_node *) ( &heap [ HEAP_SIZE ] ); // one past the end of …81 freelist->len = HEAP_SIZE / sizeof (heap_node); in init_heap()89 { return ptr >= heap && ptr < ( heap + HEAP_SIZE ); } in is_fallback_ptr()
2 HEAP_SIZE = 16384 define51 .space HEAP_SIZE
69 -#define HEAP_SIZE ( 128 * 1024 )70 +#define HEAP_SIZE ( 512 * 1024 )73 static char heap[HEAP_SIZE] __attribute__ (( aligned ( __alignof__(void *) )));
45 #define HEAP_SIZE (2*L_CODES+1) macro192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
518 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {638 s->heap_len = 0, s->heap_max = HEAP_SIZE;
83 #define HEAP_SIZE ( 512 * 1024 ) macro86 static char heap[HEAP_SIZE] __attribute__ (( aligned ( __alignof__(void *) )));
45 #define HEAP_SIZE (2*L_CODES+1) macro195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
512 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {632 s->heap_len = 0, s->heap_max = HEAP_SIZE;
512 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { in gen_bitlen()632 s->heap_len = 0, s->heap_max = HEAP_SIZE; in build_tree()