Home
last modified time | relevance | path

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

/Linux-v6.6/lib/zlib_deflate/
Ddefutil.h44 ush freq; /* frequency count */
45 ush code; /* bit string */
48 ush dad; /* father node in Huffman tree */
49 ush len; /* length of bit string */
66 typedef ush Pos;
178 ush bl_count[MAX_BITS+1];
216 ush *d_buf;
232 ush bi_buf;
255 ((1 << ((memLevel)+6)) * (sizeof(ush)+2))
290 put_byte(s, (uch)((ush)(w) >> 8)); \
[all …]
Ddeflate.c128 ush good_length; /* reduce lazy search above this match length */
129 ush max_lazy; /* do not perform lazy search above this match length */
130 ush nice_length; /* quit search above this match length */
131 ush max_chain;
202 ush *overlay; in zlib_deflateInit2()
267 overlay = (ush *) mem->overlay_memory; in zlib_deflateInit2()
269 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L); in zlib_deflateInit2()
271 s->d_buf = overlay + s->lit_bufsize/sizeof(ush); in zlib_deflateInit2()
272 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize; in zlib_deflateInit2()
589 register ush scan_start = *(ush*)scan; in longest_match()
[all …]
Ddeftree.c135 static void gen_codes (ct_data *tree, int max_code, ush *bl_count);
179 ush bl_count[MAX_BITS+1]; in tr_static_init()
368 ush f; /* frequency */ in gen_bitlen()
382 tree[n].Len = (ush)bits; in gen_bitlen()
426 tree[m].Len = (ush)bits; in gen_bitlen()
444 ush *bl_count /* number of codes at each bit length */ in gen_codes()
447 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ in gen_codes()
448 ush code = 0; /* running code value */ in gen_codes()
544 tree[n].Dad = tree[m].Dad = (ush)node; in build_tree()
587 tree[max_code+1].Len = (ush)0xffff; /* guard */ in scan_tree()
[all …]
/Linux-v6.6/block/partitions/
Dsun.c26 __be16 *ush; in sun_partition() local
83 ush = ((__be16 *) (label+1)) - 1; in sun_partition()
84 for (csum = 0; ush >= ((__be16 *) label);) in sun_partition()
85 csum ^= *ush--; in sun_partition()
/Linux-v6.6/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-v6.6/include/linux/
Dzutil.h21 typedef unsigned short ush; typedef
/Linux-v6.6/arch/alpha/boot/
Dmisc.c39 typedef unsigned short ush; typedef
/Linux-v6.6/arch/nios2/boot/compressed/
Dmisc.c30 typedef unsigned short ush; typedef