HomeSort by: relevance | last modified time | path
    Searched refs:dyn_ltree (Results 1 - 4 of 4) sorted by relevancy

  /src/common/dist/zlib/
deflate.h 204 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:internal_state
339 s->dyn_ltree[cc].Freq++; \
348 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
358 s->dyn_ltree[cc].Freq++; \
368 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
trees.c 445 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
449 s->dyn_ltree[END_BLOCK].Freq = 1;
460 s->l_desc.dyn_tree = s->dyn_ltree;
804 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
850 send_tree(s, (ct_data *)s->dyn_ltree, lcodes - 1); /* literal tree */
964 * IN assertion: the fields Freq of dyn_ltree are set.
976 if ((block_mask & 1) && (s->dyn_ltree[n].Freq != 0))
980 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
981 || s->dyn_ltree[13].Freq != 0
    [all...]
deflate.c 1332 ds->l_desc.dyn_tree = ds->dyn_ltree;
  /src/sys/net/
zlib.c 465 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:deflate_state
586 s->dyn_ltree[cc].Freq++; \
595 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
1259 ds->l_desc.dyn_tree = ds->dyn_ltree;
2484 s->l_desc.dyn_tree = s->dyn_ltree;
2513 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
2517 s->dyn_ltree[END_BLOCK].Freq = 1;
2897 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
2944 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
3091 compress_block(s, (const ct_data *)s->dyn_ltree, (const ct_data *)s->dyn_dtree)
    [all...]

Completed in 24 milliseconds