HomeSort by relevance Sort by last modified time
    Searched refs:dyn_dtree (Results 1 - 12 of 12) sorted by null

  /external/chromium_org/third_party/zlib/
deflate.h 198 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:internal_state
338 s->dyn_dtree[d_code(dist)].Freq++; \
trees.c 394 s->d_desc.dyn_tree = s->dyn_dtree;
422 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
814 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
864 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
    [all...]
deflate.c     [all...]
  /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
deflate.h 196 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:internal_state
337 s->dyn_dtree[d_code(dist)].Freq++; \
fx_zlib_trees.c 389 s->d_desc.dyn_tree = s->dyn_dtree;
416 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
808 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
858 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
    [all...]
fx_zlib_deflate.c     [all...]
  /external/qemu/distrib/zlib-1.2.8/
deflate.h 196 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:internal_state
337 s->dyn_dtree[d_code(dist)].Freq++; \
trees.c 389 s->d_desc.dyn_tree = s->dyn_dtree;
416 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
808 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
858 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
    [all...]
deflate.c     [all...]
  /external/zlib/src/
deflate.h 196 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:internal_state
337 s->dyn_dtree[d_code(dist)].Freq++; \
trees.c 389 s->d_desc.dyn_tree = s->dyn_dtree;
416 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
808 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
858 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
    [all...]
deflate.c     [all...]

Completed in 156 milliseconds