dyn_dtree         326 net/zlib.c         struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
dyn_dtree        1760 net/zlib.c         s->d_desc.dyn_tree = s->dyn_dtree;
dyn_dtree        1788 net/zlib.c         for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;
dyn_dtree        2179 net/zlib.c         scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
dyn_dtree        2229 net/zlib.c         send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
dyn_dtree        2395 net/zlib.c             compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
dyn_dtree        2434 net/zlib.c             s->dyn_dtree[d_code(dist)].Freq++;
dyn_dtree        2444 net/zlib.c                 out_length += (ulg)s->dyn_dtree[dcode].Freq *