Home
last modified time | relevance | path

Searched refs:dyn_dtree (Results 1 – 13 of 13) sorted by relevance

/netbsd-src/external/cddl/osnet/dist/uts/common/zmod/
H A Ddeflate.h193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
322 s->dyn_dtree[d_code(dist)].Freq++; \
H A Dtrees.c390 s->d_desc.dyn_tree = s->dyn_dtree;
418 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
810 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
860 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
997 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
1041 s->dyn_dtree[d_code(dist)].Freq++;
1052 out_length += (ulg)s->dyn_dtree[dcode].Freq *
H A Ddeflate.c948 ds->d_desc.dyn_tree = ds->dyn_dtree;
/netbsd-src/external/gpl3/gdb/dist/zlib/
H A Ddeflate.h199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
337 s->dyn_dtree[d_code(dist)].Freq++; \
H A Dtrees.c387 s->d_desc.dyn_tree = s->dyn_dtree;
414 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
806 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
856 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
990 (const ct_data *)s->dyn_dtree);
1035 s->dyn_dtree[d_code(dist)].Freq++;
H A Ddeflate.c1190 ds->d_desc.dyn_tree = ds->dyn_dtree;
/netbsd-src/external/gpl3/binutils.old/dist/zlib/
H A Ddeflate.h199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
337 s->dyn_dtree[d_code(dist)].Freq++; \
H A Dtrees.c387 s->d_desc.dyn_tree = s->dyn_dtree;
414 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
806 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
856 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
990 (const ct_data *)s->dyn_dtree);
1035 s->dyn_dtree[d_code(dist)].Freq++;
H A Ddeflate.c1190 ds->d_desc.dyn_tree = ds->dyn_dtree;
/netbsd-src/external/gpl3/binutils/dist/zlib/
H A Ddeflate.h199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
337 s->dyn_dtree[d_code(dist)].Freq++; \
H A Dtrees.c387 s->d_desc.dyn_tree = s->dyn_dtree;
414 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
806 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
856 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
990 (const ct_data *)s->dyn_dtree);
1035 s->dyn_dtree[d_code(dist)].Freq++;
H A Ddeflate.c1190 ds->d_desc.dyn_tree = ds->dyn_dtree;
/netbsd-src/sys/net/
H A Dzlib.c466 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
596 s->dyn_dtree[d_code(dist)].Freq++; \
1260 ds->d_desc.dyn_tree = ds->dyn_dtree;
2487 s->d_desc.dyn_tree = s->dyn_dtree; in _tr_init()
2514 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; in init_block()
2898 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); in build_bl_tree()
2947 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ in send_all_trees()
3091 compress_block(s, (const ct_data *)s->dyn_ltree, (const ct_data *)s->dyn_dtree); in _tr_flush_block()
3135 s->dyn_dtree[d_code(dist)].Freq++; in _tr_flush_block()
3146 out_length += (ulg)s->dyn_dtree[dcode].Freq * in _tr_flush_block()