dyn_dtree         942 tools/packfi2/deflate.c     ds->d_desc.dyn_tree = ds->dyn_dtree;
dyn_dtree         193 tools/packfi2/deflate.h     struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
dyn_dtree         322 tools/packfi2/deflate.h     s->dyn_dtree[d_code(dist)].Freq++; \
dyn_dtree         390 tools/packfi2/trees.c     s->d_desc.dyn_tree = s->dyn_dtree;
dyn_dtree         418 tools/packfi2/trees.c     for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;
dyn_dtree         810 tools/packfi2/trees.c     scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
dyn_dtree         860 tools/packfi2/trees.c     send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
dyn_dtree         997 tools/packfi2/trees.c         compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
dyn_dtree        1041 tools/packfi2/trees.c         s->dyn_dtree[d_code(dist)].Freq++;
dyn_dtree        1052 tools/packfi2/trees.c             out_length += (ulg)s->dyn_dtree[dcode].Freq *