Home
last modified time | relevance | path

Searched refs:ush (Results 1 – 8 of 8) sorted by relevance

/Linux-v5.4/lib/zlib_deflate/
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)); \
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; in zlib_deflateInit2()
238 overlay = (ush *) mem->overlay_memory; in zlib_deflateInit2()
240 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L); in zlib_deflateInit2()
242 s->d_buf = overlay + s->lit_bufsize/sizeof(ush); in zlib_deflateInit2()
243 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize; in zlib_deflateInit2()
578 register ush scan_start = *(ush*)scan; in longest_match()
[all …]
Ddeftree.c140 static void gen_codes (ct_data *tree, int max_code, ush *bl_count);
196 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid); in send_bits()
211 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
233 ush bl_count[MAX_BITS+1]; in tr_static_init()
422 ush f; /* frequency */ in gen_bitlen()
436 tree[n].Len = (ush)bits; in gen_bitlen()
480 tree[m].Len = (ush)bits; in gen_bitlen()
498 ush *bl_count /* number of codes at each bit length */ in gen_codes()
501 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ in gen_codes()
502 ush code = 0; /* running code value */ in gen_codes()
[all …]
/Linux-v5.4/block/partitions/
Dsun.c19 __be16 *ush; in sun_partition() local
77 ush = ((__be16 *) (label+1)) - 1; in sun_partition()
78 for (csum = 0; ush >= ((__be16 *) label);) in sun_partition()
79 csum ^= *ush--; in sun_partition()
/Linux-v5.4/lib/
Dinflate.c143 ush n; /* literal, length base, or distance base */
151 const ush *, const ush *, struct huft **, int *));
176 static const ush cplens[] = { /* Copy lengths for literal codes 257..285 */
180 static const ush cplext[] = { /* Extra bits for literal codes 257..285 */
183 static const ush cpdist[] = { /* Copy offsets for distance codes 0..29 */
187 static const ush cpdext[] = { /* Extra bits for distance codes */
227 STATIC const ush mask_bits[] = {
326 const ush *d, /* list of base values for non-simple codes */ in huft_build()
327 const ush *e, /* list of extra bits for non-simple codes */ in huft_build()
524 r.v.n = (ush)(*p); /* simple code is just the value */ in huft_build()
/Linux-v5.4/include/linux/
Dzutil.h21 typedef unsigned short ush; typedef
/Linux-v5.4/arch/alpha/boot/
Dmisc.c39 typedef unsigned short ush; typedef
/Linux-v5.4/arch/nios2/boot/compressed/
Dmisc.c30 typedef unsigned short ush; typedef