dyn_ltree         303 lib/zlib_deflate/deftree.c     s->l_desc.dyn_tree = s->dyn_ltree;
dyn_ltree         333 lib/zlib_deflate/deftree.c     for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;
dyn_ltree         337 lib/zlib_deflate/deftree.c     s->dyn_ltree[END_BLOCK].Freq = 1;
dyn_ltree         731 lib/zlib_deflate/deftree.c     scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
dyn_ltree         782 lib/zlib_deflate/deftree.c     send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
dyn_ltree         949 lib/zlib_deflate/deftree.c         compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
dyn_ltree         979 lib/zlib_deflate/deftree.c         s->dyn_ltree[lc].Freq++;
dyn_ltree         988 lib/zlib_deflate/deftree.c         s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
dyn_ltree        1079 lib/zlib_deflate/deftree.c     while (n < 7)        bin_freq += s->dyn_ltree[n++].Freq;
dyn_ltree        1080 lib/zlib_deflate/deftree.c     while (n < 128)    ascii_freq += s->dyn_ltree[n++].Freq;
dyn_ltree        1081 lib/zlib_deflate/deftree.c     while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;
dyn_ltree         168 lib/zlib_deflate/defutil.h     struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */