ush                54 lib/libz/zutil.h typedef ush FAR ushf;
ush                54 net/zlib.c     typedef ush FAR ushf;
ush               198 net/zlib.c             ush  freq;       /* frequency count */
ush               199 net/zlib.c             ush  code;       /* bit string */
ush               202 net/zlib.c             ush  dad;        /* father node in Huffman tree */
ush               203 net/zlib.c             ush  len;        /* length of bit string */
ush               220 net/zlib.c     typedef ush Pos;
ush               333 net/zlib.c         ush bl_count[MAX_BITS+1];
ush               387 net/zlib.c         ush bi_buf;
ush               511 net/zlib.c        ush good_length; /* reduce lazy search above this match length */
ush               512 net/zlib.c        ush max_lazy;    /* do not perform lazy search above this match length */
ush               513 net/zlib.c        ush nice_length; /* quit search above this match length */
ush               514 net/zlib.c        ush max_chain;
ush               652 net/zlib.c         s->pending_buf = (uchf *) ZALLOC(strm, s->lit_bufsize, 2*sizeof(ush));
ush               877 net/zlib.c         TRY_FREE(strm, state->pending_buf, state->lit_bufsize * 2 * sizeof(ush));
ush               974 net/zlib.c         ush scan_start = *(ushf*)scan;
ush               975 net/zlib.c         ush scan_end   = *(ushf*)(scan+best_len-1);
ush              1625 net/zlib.c         put_byte(s, (uch)((ush)(w) >> 8)); \
ush              1651 net/zlib.c             s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
ush              1666 net/zlib.c         s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
ush              1689 net/zlib.c         ush bl_count[MAX_BITS+1];
ush              1874 net/zlib.c         ush f;              /* frequency */
ush              1888 net/zlib.c             tree[n].Len = (ush)bits;
ush              1932 net/zlib.c                     tree[m].Len = (ush)bits;
ush              1952 net/zlib.c         ush next_code[MAX_BITS+1]; /* next code value for each bit length */
ush              1953 net/zlib.c         ush code = 0;              /* running code value */
ush              2048 net/zlib.c             tree[n].Dad = tree[m].Dad = (ush)node;
ush              2090 net/zlib.c         tree[max_code+1].Len = (ush)0xffff; /* guard */
ush              2420 net/zlib.c         s->d_buf[s->last_lit] = (ush)dist;
ush              2429 net/zlib.c             Assert((ush)dist < (ush)MAX_DIST(s) &&
ush              2430 net/zlib.c                    (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
ush              2431 net/zlib.c                    (ush)d_code(dist) < (ush)D_CODES,  "ct_tally: bad match");
ush              2594 net/zlib.c             put_short(s, (ush)len);
ush              2595 net/zlib.c             put_short(s, (ush)~len);