Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:dyn_ltree (Results 1 - 6 of 6) sorted by null

/external/qemu/distrib/zlib-1.2.3/
deflate.h	192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:internal_state 312 s->dyn_ltree[cc].Freq++; \ 321 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
trees.c	387 s->l_desc.dyn_tree = s->dyn_ltree; 417 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; 421 s->dyn_ltree[END_BLOCK].Freq = 1; 809 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); 857 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */     [all...]
deflate.c	[all...]
/external/zlib/
deflate.h	192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:internal_state 323 s->dyn_ltree[cc].Freq++; \ 332 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
trees.c	391 s->l_desc.dyn_tree = s->dyn_ltree; 421 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; 425 s->dyn_ltree[END_BLOCK].Freq = 1; 813 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); 861 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */     [all...]
deflate.c	[all...]

Completed in 23 milliseconds