dyn_ltree         325 net/zlib.c         struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */
dyn_ltree        1757 net/zlib.c         s->l_desc.dyn_tree = s->dyn_ltree;
dyn_ltree        1787 net/zlib.c         for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;
dyn_ltree        1791 net/zlib.c         s->dyn_ltree[END_BLOCK].Freq = 1;
dyn_ltree        2178 net/zlib.c         scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
dyn_ltree        2226 net/zlib.c         send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
dyn_ltree        2395 net/zlib.c             compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
dyn_ltree        2424 net/zlib.c             s->dyn_ltree[lc].Freq++;
dyn_ltree        2433 net/zlib.c             s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
dyn_ltree        2522 net/zlib.c         while (n < 7)        bin_freq += s->dyn_ltree[n++].Freq;
dyn_ltree        2523 net/zlib.c         while (n < 128)    ascii_freq += s->dyn_ltree[n++].Freq;
dyn_ltree        2524 net/zlib.c         while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;