HEAP_SIZE
for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
s->heap_len = 0, s->heap_max = HEAP_SIZE;
struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
s->heap_len = 0, s->heap_max = HEAP_SIZE;
struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */