Searched refs:ush (Results 1 - 11 of 11) sorted by relevance

/linux-4.1.27/block/partitions/
H A Dsun.c18 __be16 *ush; sun_partition() local
76 ush = ((__be16 *) (label+1)) - 1; sun_partition()
77 for (csum = 0; ush >= ((__be16 *) label);) sun_partition()
78 csum ^= *ush--; sun_partition()
/linux-4.1.27/lib/zlib_deflate/
H A Ddeflate.c107 ush good_length; /* reduce lazy search above this match length */
108 ush max_lazy; /* do not perform lazy search above this match length */
109 ush nice_length; /* quit search above this match length */
110 ush max_chain;
181 ush *overlay; zlib_deflateInit2()
238 overlay = (ush *) mem->overlay_memory; zlib_deflateInit2()
240 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L); zlib_deflateInit2()
242 s->d_buf = overlay + s->lit_bufsize/sizeof(ush); zlib_deflateInit2()
243 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize; zlib_deflateInit2()
578 register ush scan_start = *(ush*)scan; longest_match()
579 register ush scan_end = *(ush*)(scan+best_len-1); longest_match()
613 if (*(ush*)(match+best_len-1) != scan_end || longest_match()
614 *(ush*)match != scan_start) continue; longest_match()
628 } while (*(ush*)(scan+=2) == *(ush*)(match+=2) && longest_match()
629 *(ush*)(scan+=2) == *(ush*)(match+=2) && longest_match()
630 *(ush*)(scan+=2) == *(ush*)(match+=2) && longest_match()
631 *(ush*)(scan+=2) == *(ush*)(match+=2) && longest_match()
680 scan_end = *(ush*)(scan+best_len-1); longest_match()
H A Ddefutil.h42 ush freq; /* frequency count */
43 ush code; /* bit string */
46 ush dad; /* father node in Huffman tree */
47 ush len; /* length of bit string */
64 typedef ush Pos;
176 ush bl_count[MAX_BITS+1];
214 ush *d_buf;
230 ush bi_buf;
257 ((1 << ((memLevel)+6)) * (sizeof(ush)+2))
292 put_byte(s, (uch)((ush)(w) >> 8)); \
H A Ddeftree.c139 static void gen_codes (ct_data *tree, int max_code, ush *bl_count);
196 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid); send_bits()
211 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
233 ush bl_count[MAX_BITS+1]; tr_static_init()
422 ush f; /* frequency */ gen_bitlen()
436 tree[n].Len = (ush)bits; gen_bitlen()
480 tree[m].Len = (ush)bits; gen_bitlen()
498 ush *bl_count /* number of codes at each bit length */ gen_codes()
501 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ gen_codes()
502 ush code = 0; /* running code value */ gen_codes()
598 tree[n].Dad = tree[m].Dad = (ush)node; build_tree()
641 tree[max_code+1].Len = (ush)0xffff; /* guard */ scan_tree()
975 s->d_buf[s->last_lit] = (ush)dist; zlib_tr_tally()
984 Assert((ush)dist < (ush)MAX_DIST(s) && zlib_tr_tally()
985 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && zlib_tr_tally()
986 (ush)d_code(dist) < (ush)D_CODES, "zlib_tr_tally: bad match"); zlib_tr_tally()
1100 put_short(s, (ush)len); copy_block()
1101 put_short(s, (ush)~len); copy_block()
/linux-4.1.27/include/linux/
H A Dzutil.h21 typedef unsigned short ush; typedef
/linux-4.1.27/lib/
H A Dinflate.c142 ush n; /* literal, length base, or distance base */
150 const ush *, const ush *, struct huft **, int *));
175 static const ush cplens[] = { /* Copy lengths for literal codes 257..285 */
179 static const ush cplext[] = { /* Extra bits for literal codes 257..285 */
182 static const ush cpdist[] = { /* Copy offsets for distance codes 0..29 */
186 static const ush cpdext[] = { /* Extra bits for distance codes */
226 STATIC const ush mask_bits[] = {
325 const ush *d, /* list of base values for non-simple codes */ huft_build()
326 const ush *e, /* list of extra bits for non-simple codes */ huft_build()
523 r.v.n = (ush)(*p); /* simple code is just the value */ huft_build()
/linux-4.1.27/arch/nios2/boot/compressed/
H A Dmisc.c43 typedef unsigned short ush; typedef
/linux-4.1.27/arch/alpha/boot/
H A Dmisc.c38 typedef unsigned short ush; typedef
/linux-4.1.27/arch/mn10300/boot/compressed/
H A Dmisc.c82 typedef unsigned short ush; typedef
/linux-4.1.27/arch/cris/boot/compressed/
H A Dmisc.c48 typedef unsigned short ush; typedef
/linux-4.1.27/arch/mips/include/asm/
H A Duaccess.h693 case 2: __put_user_unaligned_asm("ush", ptr); break; \

Completed in 584 milliseconds