dyn_dtree         306 lib/zlib_deflate/deftree.c     s->d_desc.dyn_tree = s->dyn_dtree;
dyn_dtree         334 lib/zlib_deflate/deftree.c     for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;
dyn_dtree         732 lib/zlib_deflate/deftree.c     scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
dyn_dtree         785 lib/zlib_deflate/deftree.c     send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
dyn_dtree         949 lib/zlib_deflate/deftree.c         compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
dyn_dtree         989 lib/zlib_deflate/deftree.c         s->dyn_dtree[d_code(dist)].Freq++;
dyn_dtree         999 lib/zlib_deflate/deftree.c             out_length += (ulg)s->dyn_dtree[dcode].Freq *
dyn_dtree         169 lib/zlib_deflate/defutil.h     struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */