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