Searched refs:ush (Results 1 – 4 of 4) sorted by relevance
64 ush freq; /* frequency count */65 ush code; /* bit string */68 ush dad; /* father node in Huffman tree */69 ush len; /* length of bit string */86 typedef ush Pos;200 ush bl_count[MAX_BITS+1];254 ush bi_buf;328 ush dist = (distance); \
183 put_byte(s, (uch)((ush)(w) >> 8)); \207 s->bi_buf |= (ush)value << s->bi_valid;209 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);212 s->bi_buf |= (ush)value << s->bi_valid;222 s->bi_buf |= (ush)val << s->bi_valid;\224 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\227 s->bi_buf |= (ush)(value) << s->bi_valid;\248 ush bl_count[MAX_BITS+1]; in tr_static_init()508 ush f; /* frequency */522 tree[n].Len = (ush)bits;[all …]
49 typedef unsigned short ush; typedef50 typedef ush FAR ushf;
118 ush good_length; /* reduce lazy search above this match length */119 ush max_lazy; /* do not perform lazy search above this match length */120 ush nice_length; /* quit search above this match length */121 ush max_chain;289 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);291 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);300 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);301 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;407 strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));957 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);[all …]