Searched refs:dyn_dtree (Results 1 - 4 of 4) sorted by relevance
/kernel/linux/linux-5.10/lib/zlib_deflate/ |
H A D | deftree.c | 252 s->d_desc.dyn_tree = s->dyn_dtree; in zlib_tr_init() 280 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; in init_block() 678 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); in build_bl_tree() 731 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ in send_all_trees() 895 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 935 s->dyn_dtree[d_code(dist)].Freq++; 945 out_length += (ulg)s->dyn_dtree[dcode].Freq *
|
H A D | defutil.h | 171 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
|
/kernel/linux/linux-6.6/lib/zlib_deflate/ |
H A D | deftree.c | 252 s->d_desc.dyn_tree = s->dyn_dtree; in zlib_tr_init() 280 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; in init_block() 678 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); in build_bl_tree() 731 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ in send_all_trees() 895 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 935 s->dyn_dtree[d_code(dist)].Freq++; 945 out_length += (ulg)s->dyn_dtree[dcode].Freq *
|
H A D | defutil.h | 171 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
|
Completed in 6 milliseconds