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

  /external/chromium_org/third_party/zlib/
deflate.h 45 #define HEAP_SIZE (2*L_CODES+1)
197 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
trees.c 518 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
553 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
638 s->heap_len = 0, s->heap_max = HEAP_SIZE;
    [all...]
  /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
deflate.h 45 #define HEAP_SIZE (2*L_CODES+1)
195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
fx_zlib_trees.c 512 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
547 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
632 s->heap_len = 0, s->heap_max = HEAP_SIZE;
    [all...]
  /external/qemu/distrib/zlib-1.2.8/
deflate.h 45 #define HEAP_SIZE (2*L_CODES+1)
195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
trees.c 512 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
547 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
632 s->heap_len = 0, s->heap_max = HEAP_SIZE;
    [all...]
  /external/zlib/src/
deflate.h 45 #define HEAP_SIZE (2*L_CODES+1)
195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
trees.c 512 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
547 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
632 s->heap_len = 0, s->heap_max = HEAP_SIZE;
    [all...]

Completed in 576 milliseconds