Lines Matching refs:ush
188 typedef uint16_t ush;
192 typedef ush Pos;
279 DECLARE(ush, d_buf, DIST_BUFSIZE);
298 DECLARE(ush, prev, 1L << BITS);
373 static void put_16bit(ush w)
459 G1.bi_buf = (ush) value >> (BUF_SIZE - G1.bi_valid);
842 ush freq; /* frequency count */
843 ush code; /* bit string */
846 ush dad; /* father node in Huffman tree */
847 ush len; /* length of bit string */
871 ush heap[HEAP_SIZE]; /* heap used to build the Huffman trees */
904 ush bl_count[MAX_BITS + 1];
1074 ush f; /* frequency */
1092 tree[n].Len = (ush) bits;
1160 ush next_code[MAX_BITS + 1]; /* next code value for each bit length */
1161 ush code = 0; /* running code value */
1277 tree[n].Dad = tree[m].Dad = (ush) node;
1492 Assert((ush) dist < (ush) MAX_DIST
1493 && (ush) lc <= (ush) (MAX_MATCH - MIN_MATCH)
1494 && (ush) D_CODE(dist) < (ush) D_CODES, "ct_tally: bad match"
1840 static void lm_init(ush * flagsp)
1978 ush deflate_flags = 0; /* pkzip -es, -en or -ex equivalent */
2075 ALLOC(ush, G1.d_buf, DIST_BUFSIZE);
2077 ALLOC(ush, G1.prev, 1L << BITS);