Searched refs:dyn_ltree (Results 1 – 3 of 3) sorted by relevance
202 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member343 s->dyn_ltree[cc].Freq++; \352 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \362 s->dyn_ltree[cc].Freq++; \372 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
444 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; in init_block()448 s->dyn_ltree[END_BLOCK].Freq = 1; in init_block()459 s->l_desc.dyn_tree = s->dyn_ltree; in _tr_init()804 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); in build_bl_tree()850 send_tree(s, (ct_data *)s->dyn_ltree, lcodes - 1); /* literal tree */ in send_all_trees()976 if ((block_mask & 1) && (s->dyn_ltree[n].Freq != 0)) in detect_data_type()980 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0 in detect_data_type()981 || s->dyn_ltree[13].Freq != 0) in detect_data_type()984 if (s->dyn_ltree[n].Freq != 0) in detect_data_type()1069 compress_block(s, (const ct_data *)s->dyn_ltree,[all …]
1371 ds->l_desc.dyn_tree = ds->dyn_ltree; in deflateCopy()