HomeSort by: relevance | last modified time | path
    Searched defs:dyn_ltree (Results 1 - 5 of 5) 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++; \
  /src/external/cddl/osnet/dist/uts/common/zmod/
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++; \
  /src/external/gpl3/binutils/dist/zlib/
deflate.h 202 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:internal_state
337 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++; \
  /src/external/gpl3/binutils.old/dist/zlib/
deflate.h 198 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:internal_state
326 s->dyn_ltree[cc].Freq++; \
336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
  /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 26 milliseconds