ush
put_byte(s, (uch)((ush)(w) >> 8)); \
s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
ush bl_count[MAX_BITS+1];
ush freq; /* frequency count */
ush f; /* frequency */
ush code; /* bit string */
tree[n].Len = (ush)bits;
ush dad; /* father node in Huffman tree */
ush len; /* length of bit string */
tree[m].Len = (ush)bits;
ush next_code[MAX_BITS+1]; /* next code value for each bit length */
ush code = 0; /* running code value */
tree[n].Dad = tree[m].Dad = (ush)node;
tree[max_code+1].Len = (ush)0xffff; /* guard */
typedef ush Pos;
s->d_buf[s->last_lit] = (ush)dist;
Assert((ush)dist < (ush)MAX_DIST(s) &&
(ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
(ush)d_code(dist) < (ush)D_CODES, "ct_tally: bad match");
put_short(s, (ush)len);
put_short(s, (ush)~len);
ush bl_count[MAX_BITS+1];
ush bi_buf;
typedef ush FAR ushf;
ush good_length; /* reduce lazy search above this match length */
ush max_lazy; /* do not perform lazy search above this match length */
ush nice_length; /* quit search above this match length */
ush max_chain;
s->pending_buf = (uchf *) ZALLOC(strm, s->lit_bufsize, 2*sizeof(ush));
TRY_FREE(strm, state->pending_buf, state->lit_bufsize * 2 * sizeof(ush));
register ush scan_start = *(ushf*)scan;
register ush scan_end = *(ushf*)(scan+best_len-1);
ush n; /* literal, length base, or distance base */
static ush cplens[] =
static ush cplext[] =
static ush cpdist[] =
static ush cpdext[] =
static ush mask_bits[] =
static int huft_build (unsigned *, unsigned, unsigned, ush *, ush *,
ush * d, /* list of base values for non-simple codes */
ush * e, /* list of extra bits for non-simple codes */
r.v.n = (ush) (*p); /* simple code is just the value */
typedef ush FAR ushf;
overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof (ush)+2);
ds->d_buf = overlay + ds->lit_bufsize/sizeof (ush);
ds->l_buf = ds->pending_buf + (1+sizeof (ush))*ds->lit_bufsize;
register ush scan_start = *(ushf*)scan;
register ush scan_end = *(ushf*)(scan+best_len-1);
put_byte(s, (uch)((ush)(w) >> 8)); \
s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
s->bi_buf = (ush)val >> (Buf_size - s->bi_valid); \
ush bl_count[MAX_BITS+1];
ush f; /* frequency */
tree[n].Len = (ush)bits;
tree[m].Len = (ush)bits;
ush next_code[MAX_BITS+1];
ush code = 0; /* running code value */
tree[n].Dad = tree[m].Dad = (ush)node;
tree[max_code+1].Len = (ush)0xffff; /* guard */
ush freq; /* frequency count */
ush code; /* bit string */
s->d_buf[s->last_lit] = (ush)dist;
Assert((ush)dist < (ush)MAX_DIST(s) &&
(ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
(ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
ush dad; /* father node in Huffman tree */
ush len; /* length of bit string */
put_short(s, (ush)len);
typedef ush Pos;
put_short(s, (ush)~len);
ush bl_count[MAX_BITS+1];
ush bi_buf;
if (*(ush *)&buf != 0)
*((ush *)&buf+1) += ((ush)((uch *)buf-0) + 15) >> 4;
*(ush *)&buf = 0;
if (*(ush*)&ptr != 0) { /* object < 64K */
ush dist = (distance); \
ush good_length; /* reduce lazy search above this match length */
ush max_lazy; /* do not perform lazy search above this match length */
ush nice_length; /* quit search above this match length */
ush max_chain;
overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof (ush)+2);
s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof (ush)+2L);
s->d_buf = overlay + s->lit_bufsize/sizeof (ush);
s->l_buf = s->pending_buf + (1+sizeof (ush))*s->lit_bufsize;