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 */ member337 s->dyn_ltree[cc].Freq++; \346 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \356 s->dyn_ltree[cc].Freq++; \366 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
443 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; in init_block()447 s->dyn_ltree[END_BLOCK].Freq = 1; in init_block()458 s->l_desc.dyn_tree = s->dyn_ltree; in _tr_init()802 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); in build_bl_tree()974 if ((block_mask & 1) && (s->dyn_ltree[n].Freq != 0)) in detect_data_type()978 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0 in detect_data_type()979 || s->dyn_ltree[13].Freq != 0) in detect_data_type()982 if (s->dyn_ltree[n].Freq != 0) in detect_data_type()1067 compress_block(s, (const ct_data *)s->dyn_ltree,1104 s->dyn_ltree[lc].Freq++;[all …]
1330 ds->l_desc.dyn_tree = ds->dyn_ltree; in deflateCopy()