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