| /lib/zlib_inflate/ |
| D | inffast.c | 104 unsigned bits; /* local strm->bits */ in inflate_fast() local
131 bits = state->bits; in inflate_fast()
140 if (bits < 15) { in inflate_fast()
141 hold += (unsigned long)(PUP(in)) << bits; in inflate_fast()
142 bits += 8; in inflate_fast()
143 hold += (unsigned long)(PUP(in)) << bits; in inflate_fast()
144 bits += 8; in inflate_fast()
148 op = (unsigned)(this.bits); in inflate_fast()
150 bits -= op; in inflate_fast()
159 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()
65 unsigned int bits) in __bitmap_or_equal() argument
67 unsigned int k, lim = bits / BITS_PER_LONG; in __bitmap_or_equal()
75 if (!(bits % BITS_PER_LONG)) in __bitmap_or_equal()
79 return (tmp & BITMAP_LAST_WORD_MASK(bits)) == 0; in __bitmap_or_equal()
82 void __bitmap_complement(unsigned long *dst, const unsigned long *src, unsigned int bits) in __bitmap_complement() argument
84 unsigned int k, lim = BITS_TO_LONGS(bits); in __bitmap_complement()
[all …]
|
| D | test_printf.c | 509 unsigned long *bits = bitmap_zalloc(nbits, GFP_KERNEL); in large_bitmap() local
510 if (!bits) in large_bitmap()
513 bitmap_set(bits, 1, 20); in large_bitmap()
514 bitmap_set(bits, 60000, 15); in large_bitmap()
515 test("1-20,60000-60014", "%*pbl", nbits, bits); in large_bitmap()
516 bitmap_free(bits); in large_bitmap()
522 DECLARE_BITMAP(bits, 20); in bitmap()
526 bitmap_zero(bits, 20); in bitmap()
527 test("00000|00000", "%20pb|%*pb", bits, 20, bits); in bitmap()
528 test("|", "%20pbl|%*pbl", bits, 20, bits); in bitmap()
[all …]
|
| D | crc4.c | 25 uint8_t crc4(uint8_t c, uint64_t x, int bits) in crc4() argument
30 x &= (1ull << bits) - 1; in crc4()
33 bits = (bits + 3) & ~0x3; in crc4()
36 for (i = bits - 4; i >= 0; i -= 4) in crc4()
|
| D | test_kasan.c | 668 long *bits = kzalloc(sizeof(*bits) + 1, GFP_KERNEL); in kasan_bitops() local
669 if (!bits) in kasan_bitops()
678 set_bit(BITS_PER_LONG, bits); in kasan_bitops()
681 __set_bit(BITS_PER_LONG, bits); in kasan_bitops()
684 clear_bit(BITS_PER_LONG, bits); in kasan_bitops()
687 __clear_bit(BITS_PER_LONG, bits); in kasan_bitops()
690 clear_bit_unlock(BITS_PER_LONG, bits); in kasan_bitops()
693 __clear_bit_unlock(BITS_PER_LONG, bits); in kasan_bitops()
696 change_bit(BITS_PER_LONG, bits); in kasan_bitops()
699 __change_bit(BITS_PER_LONG, bits); in kasan_bitops()
[all …]
|
| D | list_sort.c | 220 size_t bits; in list_sort() local
224 for (bits = count; bits & 1; bits >>= 1) in list_sort()
227 if (likely(bits)) { in list_sort()
|
| D | nodemask.c | 27 bit = bitmap_ord_to_pos(maskp->bits, in node_random()
|
| D | decompress_bunzip2.c | 118 unsigned int bits = 0; in get_bits() local
138 bits = bd->inbufBits&((1 << bd->inbufBitCount)-1); in get_bits()
140 bits <<= bits_wanted; in get_bits()
149 bits |= (bd->inbufBits >> bd->inbufBitCount)&((1 << bits_wanted)-1); in get_bits()
151 return bits; in get_bits()
|
| D | genalloc.c | 252 bit = find_next_bit(chunk->bits, end_bit, 0); in gen_pool_destroy()
302 start_bit = algo(chunk->bits, end_bit, start_bit, in gen_pool_alloc_algo_owner()
306 remain = bitmap_set_ll(chunk->bits, start_bit, nbits); in gen_pool_alloc_algo_owner()
308 remain = bitmap_clear_ll(chunk->bits, start_bit, in gen_pool_alloc_algo_owner()
505 remain = bitmap_clear_ll(chunk->bits, start_bit, nbits); in gen_pool_free_owner()
|
| D | sbitmap.c | 315 unsigned int bits = min(8 - byte_bits, word_bits); in sbitmap_bitmap_show() local
317 byte |= (word & (BIT(bits) - 1)) << byte_bits; in sbitmap_bitmap_show()
318 byte_bits += bits; in sbitmap_bitmap_show()
325 word >>= bits; in sbitmap_bitmap_show()
326 word_bits -= bits; in sbitmap_bitmap_show()
|
| D | ubsan.c | 79 unsigned bits = type_bit_width(type); in is_inline_int() local
83 return bits <= inline_bits; in is_inline_int()
|
| D | Kconfig | 383 number of data bits to protect, 'm' should be chosen such
391 Constant value for error correction capability in bits 't'.
|
| /lib/842/ |
| D | 842_decompress.c | 89 u8 *in = p->in, b = p->bit, bits = b + n; in next_bits() local
99 if (bits > 64) in next_bits()
101 else if (p->ilen < 8 && bits > 32 && bits <= 56) in next_bits()
103 else if (p->ilen < 4 && bits > 16 && bits <= 24) in next_bits()
106 if (DIV_ROUND_UP(bits, 8) > p->ilen) in next_bits()
109 if (bits <= 8) in next_bits()
110 *d = *in >> (8 - bits); in next_bits()
111 else if (bits <= 16) in next_bits()
112 *d = be16_to_cpu(get_unaligned((__be16 *)in)) >> (16 - bits); in next_bits()
113 else if (bits <= 32) in next_bits()
[all …]
|
| D | 842_compress.c | 169 int b = p->bit, bits = b + n, s = round_up(bits, 8) - bits; in add_bits() local
181 if (bits > 64) in add_bits()
183 else if (p->olen < 8 && bits > 32 && bits <= 56) in add_bits()
185 else if (p->olen < 4 && bits > 16 && bits <= 24) in add_bits()
188 if (DIV_ROUND_UP(bits, 8) > p->olen) in add_bits()
194 if (bits <= 8) in add_bits()
196 else if (bits <= 16) in add_bits()
198 else if (bits <= 24) in add_bits()
200 else if (bits <= 32) in add_bits()
202 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 …]
|
| /lib/crypto/ |
| D | sha256.c | 249 __be64 bits; in __sha256_final() local
255 bits = cpu_to_be64(sctx->count << 3); in __sha256_final()
263 sha256_update(sctx, (const u8 *)&bits, sizeof(bits)); in __sha256_final()
|