ush               124 tools/packfi2/deflate.c    ush good_length; /* reduce lazy search above this match length */
ush               125 tools/packfi2/deflate.c    ush max_lazy;    /* do not perform lazy search above this match length */
ush               126 tools/packfi2/deflate.c    ush nice_length; /* quit search above this match length */
ush               127 tools/packfi2/deflate.c    ush max_chain;
ush               293 tools/packfi2/deflate.c     overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
ush               295 tools/packfi2/deflate.c     s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
ush               304 tools/packfi2/deflate.c     s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
ush               305 tools/packfi2/deflate.c     s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
ush               411 tools/packfi2/deflate.c     strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
ush               923 tools/packfi2/deflate.c     overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);
ush               938 tools/packfi2/deflate.c     ds->d_buf = overlay + ds->lit_bufsize/sizeof(ush);
ush               939 tools/packfi2/deflate.c     ds->l_buf = ds->pending_buf + (1+sizeof(ush))*ds->lit_bufsize;
ush              1050 tools/packfi2/deflate.c     register ush scan_start = *(ushf*)scan;
ush              1051 tools/packfi2/deflate.c     register ush scan_end   = *(ushf*)(scan+best_len-1);
ush                64 tools/packfi2/deflate.h         ush  freq;       /* frequency count */
ush                65 tools/packfi2/deflate.h         ush  code;       /* bit string */
ush                68 tools/packfi2/deflate.h         ush  dad;        /* father node in Huffman tree */
ush                69 tools/packfi2/deflate.h         ush  len;        /* length of bit string */
ush                86 tools/packfi2/deflate.h typedef ush Pos;
ush               200 tools/packfi2/deflate.h     ush bl_count[MAX_BITS+1];
ush               254 tools/packfi2/deflate.h     ush bi_buf;
ush               317 tools/packfi2/deflate.h     ush dist = (distance); \
ush               182 tools/packfi2/trees.c     put_byte(s, (uch)((ush)(w) >> 8)); \
ush               208 tools/packfi2/trees.c         s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
ush               223 tools/packfi2/trees.c     s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
ush               247 tools/packfi2/trees.c     ush bl_count[MAX_BITS+1];
ush               504 tools/packfi2/trees.c     ush f;              /* frequency */
ush               518 tools/packfi2/trees.c         tree[n].Len = (ush)bits;
ush               562 tools/packfi2/trees.c                 tree[m].Len = (ush)bits;
ush               582 tools/packfi2/trees.c     ush next_code[MAX_BITS+1]; /* next code value for each bit length */
ush               583 tools/packfi2/trees.c     ush code = 0;              /* running code value */
ush               679 tools/packfi2/trees.c         tree[n].Dad = tree[m].Dad = (ush)node;
ush               721 tools/packfi2/trees.c     tree[max_code+1].Len = (ush)0xffff; /* guard */
ush              1027 tools/packfi2/trees.c     s->d_buf[s->last_lit] = (ush)dist;
ush              1036 tools/packfi2/trees.c         Assert((ush)dist < (ush)MAX_DIST(s) &&
ush              1037 tools/packfi2/trees.c                (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
ush              1038 tools/packfi2/trees.c                (ush)d_code(dist) < (ush)D_CODES,  "_tr_tally: bad match");
ush              1207 tools/packfi2/trees.c         put_short(s, (ush)len);
ush              1208 tools/packfi2/trees.c         put_short(s, (ush)~len);
ush               226 tools/packfi2/zutil.c         if (*(ush*)&buf != 0) return buf;
ush               234 tools/packfi2/zutil.c     *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
ush               235 tools/packfi2/zutil.c     *(ush*)&buf = 0;
ush               243 tools/packfi2/zutil.c     if (*(ush*)&ptr != 0) { /* object < 64K */
ush                50 tools/packfi2/zutil.h typedef ush FAR ushf;