ush                19 block/partitions/sun.c 	__be16 *ush;
ush                77 block/partitions/sun.c 	ush = ((__be16 *) (label+1)) - 1;
ush                78 block/partitions/sun.c 	for (csum = 0; ush >= ((__be16 *) label);)
ush                79 block/partitions/sun.c 		csum ^= *ush--;
ush               143 lib/inflate.c      ush n;              /* literal, length base, or distance base */
ush               151 lib/inflate.c  		const ush *, const ush *, struct huft **, int *));
ush               176 lib/inflate.c  static const ush cplens[] = {         /* Copy lengths for literal codes 257..285 */
ush               180 lib/inflate.c  static const ush cplext[] = {         /* Extra bits for literal codes 257..285 */
ush               183 lib/inflate.c  static const ush cpdist[] = {         /* Copy offsets for distance codes 0..29 */
ush               187 lib/inflate.c  static const ush cpdext[] = {         /* Extra bits for distance codes */
ush               227 lib/inflate.c  STATIC const ush mask_bits[] = {
ush               326 lib/inflate.c  	const ush *d,           /* list of base values for non-simple codes */
ush               327 lib/inflate.c  	const ush *e,           /* list of extra bits for non-simple codes */
ush               524 lib/inflate.c          r.v.n = (ush)(*p);             /* simple code is just the value */
ush               107 lib/zlib_deflate/deflate.c    ush good_length; /* reduce lazy search above this match length */
ush               108 lib/zlib_deflate/deflate.c    ush max_lazy;    /* do not perform lazy search above this match length */
ush               109 lib/zlib_deflate/deflate.c    ush nice_length; /* quit search above this match length */
ush               110 lib/zlib_deflate/deflate.c    ush max_chain;
ush               181 lib/zlib_deflate/deflate.c     ush *overlay;
ush               238 lib/zlib_deflate/deflate.c     overlay = (ush *) mem->overlay_memory;
ush               240 lib/zlib_deflate/deflate.c     s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
ush               242 lib/zlib_deflate/deflate.c     s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
ush               243 lib/zlib_deflate/deflate.c     s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
ush               578 lib/zlib_deflate/deflate.c     register ush scan_start = *(ush*)scan;
ush               579 lib/zlib_deflate/deflate.c     register ush scan_end   = *(ush*)(scan+best_len-1);
ush               613 lib/zlib_deflate/deflate.c         if (*(ush*)(match+best_len-1) != scan_end ||
ush               614 lib/zlib_deflate/deflate.c             *(ush*)match != scan_start) continue;
ush               628 lib/zlib_deflate/deflate.c         } while (*(ush*)(scan+=2) == *(ush*)(match+=2) &&
ush               629 lib/zlib_deflate/deflate.c                  *(ush*)(scan+=2) == *(ush*)(match+=2) &&
ush               630 lib/zlib_deflate/deflate.c                  *(ush*)(scan+=2) == *(ush*)(match+=2) &&
ush               631 lib/zlib_deflate/deflate.c                  *(ush*)(scan+=2) == *(ush*)(match+=2) &&
ush               680 lib/zlib_deflate/deflate.c             scan_end = *(ush*)(scan+best_len-1);
ush               140 lib/zlib_deflate/deftree.c static void gen_codes      (ct_data *tree, int max_code, ush *bl_count);
ush               196 lib/zlib_deflate/deftree.c         s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
ush               211 lib/zlib_deflate/deftree.c     s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
ush               233 lib/zlib_deflate/deftree.c     ush bl_count[MAX_BITS+1];
ush               422 lib/zlib_deflate/deftree.c     ush f;              /* frequency */
ush               436 lib/zlib_deflate/deftree.c         tree[n].Len = (ush)bits;
ush               480 lib/zlib_deflate/deftree.c                 tree[m].Len = (ush)bits;
ush               498 lib/zlib_deflate/deftree.c 	ush *bl_count             /* number of codes at each bit length */
ush               501 lib/zlib_deflate/deftree.c     ush next_code[MAX_BITS+1]; /* next code value for each bit length */
ush               502 lib/zlib_deflate/deftree.c     ush code = 0;              /* running code value */
ush               598 lib/zlib_deflate/deftree.c         tree[n].Dad = tree[m].Dad = (ush)node;
ush               641 lib/zlib_deflate/deftree.c     tree[max_code+1].Len = (ush)0xffff; /* guard */
ush               975 lib/zlib_deflate/deftree.c     s->d_buf[s->last_lit] = (ush)dist;
ush               984 lib/zlib_deflate/deftree.c         Assert((ush)dist < (ush)MAX_DIST(s) &&
ush               985 lib/zlib_deflate/deftree.c                (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
ush               986 lib/zlib_deflate/deftree.c                (ush)d_code(dist) < (ush)D_CODES,  "zlib_tr_tally: bad match");
ush              1100 lib/zlib_deflate/deftree.c         put_short(s, (ush)len);   
ush              1101 lib/zlib_deflate/deftree.c         put_short(s, (ush)~len);
ush                42 lib/zlib_deflate/defutil.h         ush  freq;       /* frequency count */
ush                43 lib/zlib_deflate/defutil.h         ush  code;       /* bit string */
ush                46 lib/zlib_deflate/defutil.h         ush  dad;        /* father node in Huffman tree */
ush                47 lib/zlib_deflate/defutil.h         ush  len;        /* length of bit string */
ush                64 lib/zlib_deflate/defutil.h typedef ush Pos;
ush               176 lib/zlib_deflate/defutil.h     ush bl_count[MAX_BITS+1];
ush               214 lib/zlib_deflate/defutil.h     ush *d_buf;
ush               230 lib/zlib_deflate/defutil.h     ush bi_buf;
ush               257 lib/zlib_deflate/defutil.h 	((1 << ((memLevel)+6)) * (sizeof(ush)+2))
ush               292 lib/zlib_deflate/defutil.h     put_byte(s, (uch)((ush)(w) >> 8)); \