Lines Matching refs:ush
76 * void ct_init (ush *attr, int *method)
221 ush freq; /* frequency count */
222 ush code; /* bit string */
225 ush dad; /* father node in Huffman tree */
226 ush len; /* length of bit string */
276 local ush near bl_count[MAX_BITS+1];
312 local ush far d_buf[DIST_BUFSIZE]; /* buffer for distances */
315 local ush far *d_buf;
346 local ush *file_type; /* pointer to UNKNOWN, BINARY or ASCII */
406 out_buf[out_offset++] = (char) ((ush)(w) >> 8); \
473 ush *attr; /* pointer to internal file attribute */
493 d_buf = (ush far *) zcalloc(DIST_BUFSIZE, sizeof(ush));
549 static_dtree[n].Code = (ush)bi_reverse(n, 5);
652 ush f; /* frequency */
666 tree[n].Len = (ush)bits;
688 bl_count[bits+1] += (ush)2; /* move one overflow item as its brother */
706 if (tree[m].Len != (ush)bits) {
709 tree[m].Len = (ush)bits;
728 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
729 ush code = 0; /* running code value */
737 next_code[bits] = code = (ush)((code + bl_count[bits-1]) << 1);
742 Assert(code + bl_count[MAX_BITS]-1 == (1<< ((ush) MAX_BITS)) - 1,
750 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
820 tree[node].Freq = (ush)(tree[n].Freq + tree[m].Freq);
822 tree[n].Dad = tree[m].Dad = (ush)node;
865 tree[max_code+1].Len = (ush)-1; /* guard */
872 bl_tree[curlen].Freq += (ush)count;
1025 if (*file_type == (ush)UNKNOWN) set_file_type();
1155 Assert((ush)dist < (ush)MAX_DIST &&
1156 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1157 (ush)d_code(dist) < (ush)D_CODES, "ct_tally: bad match");
1162 d_buf[last_dist++] = (ush)dist;
1433 PUTSHORT((ush)len);
1434 PUTSHORT((ush)~len);