dyn_ltree 938 lib/zlib/deflate.c ds->l_desc.dyn_tree = ds->dyn_ltree; dyn_ltree 192 lib/zlib/deflate.h struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ dyn_ltree 312 lib/zlib/deflate.h s->dyn_ltree[cc].Freq++; \ dyn_ltree 321 lib/zlib/deflate.h s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \ dyn_ltree 387 lib/zlib/trees.c s->l_desc.dyn_tree = s->dyn_ltree; dyn_ltree 417 lib/zlib/trees.c for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; dyn_ltree 421 lib/zlib/trees.c s->dyn_ltree[END_BLOCK].Freq = 1; dyn_ltree 809 lib/zlib/trees.c scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); dyn_ltree 857 lib/zlib/trees.c send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */ dyn_ltree 997 lib/zlib/trees.c compress_block(s, s->dyn_ltree, s->dyn_dtree); dyn_ltree 1031 lib/zlib/trees.c s->dyn_ltree[lc].Freq++; dyn_ltree 1040 lib/zlib/trees.c s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++; dyn_ltree 1132 lib/zlib/trees.c if (s->dyn_ltree[n].Freq != 0) dyn_ltree 1136 lib/zlib/trees.c if (s->dyn_ltree[n].Freq != 0)