ush
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;
zmemcpy(ds->d_buf, ss->d_buf, ss->sym_next * sizeof(ush));
ush scan_start = *(ushf*)scan;
ush scan_end = *(ushf*)(scan + best_len - 1);
s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid);
ush bl_count[MAX_BITS+1];
ush bi_buf;
ush dist = (ush)(distance); \
ush dist = (ush)(distance); \
ush freq; /* frequency count */
ush code; /* bit string */
ush dad; /* father node in Huffman tree */
ush len; /* length of bit string */
typedef ush Pos;
s->d_buf[s->sym_next] = (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");
put_byte(s, (uch)((ush)(w) >> 8)); \
ush next_code[MAX_BITS+1]; /* next code value for each bit length */
next_code[bits] = (ush)code;
tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
s->bi_buf |= (ush)value << s->bi_valid;
s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
s->bi_buf |= (ush)value << s->bi_valid;
s->bi_buf |= (ush)val << s->bi_valid;\
s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
s->bi_buf |= (ush)(value) << s->bi_valid;\
ush bl_count[MAX_BITS+1];
ush f; /* frequency */
tree[n].Len = (ush)bits;
tree[m].Len = (ush)bits;
tree[n].Dad = tree[m].Dad = (ush)node;
tree[max_code + 1].Len = (ush)0xffff; /* guard */
s->bl_tree[curlen].Freq += (ush)count;
put_short(s, (ush)stored_len);
put_short(s, (ush)~stored_len);
if (*(ush*)&buf != 0) return buf;
*((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
*(ush*)&buf = 0;
if (*(ush*)&ptr != 0) { /* object < 64K */
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;
ush scan_start = *(ushf*)scan;
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]; /* 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 */
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");
put_short(s, (ush)len);
put_short(s, (ush)~len);
ush freq; /* frequency count */
ush code; /* bit string */
ush dad; /* father node in Huffman tree */
ush len; /* length of bit string */
typedef ush Pos;
ush bl_count[MAX_BITS+1];
ush bi_buf;
if (*(ush*)&buf != 0) return buf;
*((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;
typedef ush FAR ushf;