| /lib/zlib_inflate/ |
| D | inffast.c | 83 unsigned bits; /* local strm->bits */ in inflate_fast() local
110 bits = state->bits; in inflate_fast()
119 if (bits < 15) { in inflate_fast()
120 hold += (unsigned long)(*in++) << bits; in inflate_fast()
121 bits += 8; in inflate_fast()
122 hold += (unsigned long)(*in++) << bits; in inflate_fast()
123 bits += 8; in inflate_fast()
127 op = (unsigned)(this.bits); in inflate_fast()
129 bits -= op; in inflate_fast()
138 if (bits < op) { in inflate_fast()
[all …]
|
| D | inflate.c | 37 state->bits = 0; in zlib_inflateReset()
153 if (state->mode == STORED && state->bits == 0) { in zlib_inflateSyncPacket()
173 bits = state->bits; \
184 state->bits = bits; \
191 bits = 0; \
200 hold += (unsigned long)(*next++) << bits; \
201 bits += 8; \
208 while (bits < (unsigned)(n)) \
220 bits -= (unsigned)(n); \
226 hold >>= bits & 7; \
[all …]
|
| D | inftrees.c | 24 code **table, unsigned *bits, unsigned short *work) in zlib_inflate_table() argument
99 root = *bits; in zlib_inflate_table()
105 this.bits = (unsigned char)1; in zlib_inflate_table()
109 *bits = 1; in zlib_inflate_table()
204 this.bits = (unsigned char)(len - drop); in zlib_inflate_table()
272 (*table)[low].bits = (unsigned char)root; in zlib_inflate_table()
285 this.bits = (unsigned char)(len - drop); in zlib_inflate_table()
293 this.bits = (unsigned char)len; in zlib_inflate_table()
313 *bits = root; in zlib_inflate_table()
|
| D | inftrees.h | 29 unsigned char bits; /* bits in this part of the code */ member
58 unsigned *bits, unsigned short *work);
|
| D | inflate.h | 90 unsigned bits; /* number of bits in "in" */ member
|
| /lib/ |
| D | bitmap.c | 47 const unsigned long *bitmap2, unsigned int bits) in __bitmap_equal() argument
49 unsigned int k, lim = bits/BITS_PER_LONG; in __bitmap_equal()
54 if (bits % BITS_PER_LONG) in __bitmap_equal()
55 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_equal()
62 void __bitmap_complement(unsigned long *dst, const unsigned long *src, unsigned int bits) in __bitmap_complement() argument
64 unsigned int k, lim = bits/BITS_PER_LONG; in __bitmap_complement()
68 if (bits % BITS_PER_LONG) in __bitmap_complement()
155 const unsigned long *bitmap2, unsigned int bits) in __bitmap_and() argument
158 unsigned int lim = bits/BITS_PER_LONG; in __bitmap_and()
163 if (bits % BITS_PER_LONG) in __bitmap_and()
[all …]
|
| D | test_printf.c | 294 DECLARE_BITMAP(bits, 20); in bitmap()
298 bitmap_zero(bits, 20); in bitmap()
299 test("00000|00000", "%20pb|%*pb", bits, 20, bits); in bitmap()
300 test("|", "%20pbl|%*pbl", bits, 20, bits); in bitmap()
303 set_bit(primes[i], bits); in bitmap()
304 test("a28ac|a28ac", "%20pb|%*pb", bits, 20, bits); in bitmap()
305 test("2-3,5,7,11,13,17,19|2-3,5,7,11,13,17,19", "%20pbl|%*pbl", bits, 20, bits); in bitmap()
307 bitmap_fill(bits, 20); in bitmap()
308 test("fffff|fffff", "%20pb|%*pb", bits, 20, bits); in bitmap()
309 test("0-19|0-19", "%20pbl|%*pbl", bits, 20, bits); in bitmap()
|
| D | genalloc.c | 253 bit = find_next_bit(chunk->bits, end_bit, 0); in gen_pool_destroy()
296 start_bit = pool->algo(chunk->bits, end_bit, start_bit, nbits, in gen_pool_alloc()
300 remain = bitmap_set_ll(chunk->bits, start_bit, nbits); in gen_pool_alloc()
302 remain = bitmap_clear_ll(chunk->bits, start_bit, in gen_pool_alloc()
373 remain = bitmap_clear_ll(chunk->bits, start_bit, nbits); in gen_pool_free()
|
| D | decompress_bunzip2.c | 117 unsigned int bits = 0; in get_bits() local
137 bits = bd->inbufBits&((1 << bd->inbufBitCount)-1); in get_bits()
139 bits <<= bits_wanted; in get_bits()
148 bits |= (bd->inbufBits >> bd->inbufBitCount)&((1 << bits_wanted)-1); in get_bits()
150 return bits; in get_bits()
|
| D | Kconfig.kmemcheck | 81 32-bit reads from 16-bit variables where the upper 16 bits are
91 accesses where not all the bits are initialized at the same time.
|
| D | idr.c | 51 int bits = min_t(int, layers * IDR_BITS, MAX_IDR_SHIFT); in idr_max() local
53 return (1 << bits) - 1; in idr_max()
|
| D | Kconfig | 321 number of data bits to protect, 'm' should be chosen such
329 Constant value for error correction capability in bits 't'.
|
| /lib/842/ |
| D | 842_decompress.c | 98 u8 *in = p->in, b = p->bit, bits = b + n; in next_bits() local
108 if (bits > 64) in next_bits()
110 else if (p->ilen < 8 && bits > 32 && bits <= 56) in next_bits()
112 else if (p->ilen < 4 && bits > 16 && bits <= 24) in next_bits()
115 if (DIV_ROUND_UP(bits, 8) > p->ilen) in next_bits()
118 if (bits <= 8) in next_bits()
119 *d = *in >> (8 - bits); in next_bits()
120 else if (bits <= 16) in next_bits()
121 *d = be16_to_cpu(get_unaligned((__be16 *)in)) >> (16 - bits); in next_bits()
122 else if (bits <= 32) in next_bits()
[all …]
|
| D | 842_compress.c | 178 int b = p->bit, bits = b + n, s = round_up(bits, 8) - bits; in add_bits() local
190 if (bits > 64) in add_bits()
192 else if (p->olen < 8 && bits > 32 && bits <= 56) in add_bits()
194 else if (p->olen < 4 && bits > 16 && bits <= 24) in add_bits()
197 if (DIV_ROUND_UP(bits, 8) > p->olen) in add_bits()
203 if (bits <= 8) in add_bits()
205 else if (bits <= 16) in add_bits()
207 else if (bits <= 24) in add_bits()
209 else if (bits <= 32) in add_bits()
211 else if (bits <= 40) in add_bits()
[all …]
|
| /lib/zlib_deflate/ |
| D | deftree.c | 229 int bits; /* bit counter */ in tr_static_init() local
272 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
420 int bits; /* bit length */ in gen_bitlen() local
425 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0; in gen_bitlen()
434 bits = tree[tree[n].Dad].Len + 1; in gen_bitlen()
435 if (bits > max_length) bits = max_length, overflow++; in gen_bitlen()
436 tree[n].Len = (ush)bits; in gen_bitlen()
441 s->bl_count[bits]++; in gen_bitlen()
445 s->opt_len += (ulg)f * (bits + xbits); in gen_bitlen()
455 bits = max_length-1; in gen_bitlen()
[all …]
|