Home
last modified time | relevance | path

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

/dragonfly/sys/vfs/hammer2/zlib/
H A Dhammer2_zlib_deflate.h187 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
328 s->dyn_dtree[d_code(dist)].Freq++; \
H A Dhammer2_zlib_trees.c392 s->d_desc.dyn_tree = s->dyn_dtree; in _tr_init()
420 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; in init_block()
814 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); in build_bl_tree()
865 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ in send_all_trees()
992 (const ct_data *)s->dyn_dtree);
1035 s->dyn_dtree[d_code(dist)].Freq++;
1046 out_length += (ulg)s->dyn_dtree[dcode].Freq *
/dragonfly/usr.sbin/makefs/hammer2/zlib/
H A Dhammer2_zlib_deflate.h187 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
328 s->dyn_dtree[d_code(dist)].Freq++; \
H A Dhammer2_zlib_trees.c392 s->d_desc.dyn_tree = s->dyn_dtree; in _tr_init()
420 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; in init_block()
814 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); in build_bl_tree()
865 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ in send_all_trees()
992 (const ct_data *)s->dyn_dtree);
1035 s->dyn_dtree[d_code(dist)].Freq++;
1046 out_length += (ulg)s->dyn_dtree[dcode].Freq *
/dragonfly/sbin/hammer2/zlib/
H A Dhammer2_zlib_deflate.h187 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
328 s->dyn_dtree[d_code(dist)].Freq++; \
H A Dhammer2_zlib_trees.c392 s->d_desc.dyn_tree = s->dyn_dtree; in _tr_init()
420 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; in init_block()
814 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); in build_bl_tree()
865 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ in send_all_trees()
992 (const ct_data *)s->dyn_dtree);
1035 s->dyn_dtree[d_code(dist)].Freq++;
1046 out_length += (ulg)s->dyn_dtree[dcode].Freq *
/dragonfly/contrib/zlib-1.2/
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 */
989 (const ct_data *)s->dyn_dtree);
1033 s->dyn_dtree[d_code(dist)].Freq++;
1044 out_length += (ulg)s->dyn_dtree[dcode].Freq *
H A Ddeflate.h199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
340 s->dyn_dtree[d_code(dist)].Freq++; \
H A Ddeflate.c1150 ds->d_desc.dyn_tree = ds->dyn_dtree;
/dragonfly/sys/net/
H A Dzlib.c452 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
1179 ds->d_desc.dyn_tree = ds->dyn_dtree; in deflateCopy()
2141 s->d_desc.dyn_tree = s->dyn_dtree; in _tr_init()
2168 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; in init_block()
2572 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); in build_bl_tree()
2624 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ in send_all_trees()
2788 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
2829 s->dyn_dtree[d_code(dist)].Freq++;
2839 out_length += (ulg)s->dyn_dtree[dcode].Freq *