| /lib/ |
| D | atomic64_test.c | 20 #define TEST(bit, op, c_op, val) \ argument
22 atomic##bit##_set(&v, v0); \
24 atomic##bit##_##op(val, &v); \
26 WARN(atomic##bit##_read(&v) != r, "%Lx != %Lx\n", \
27 (unsigned long long)atomic##bit##_read(&v), \
36 #define FAMILY_TEST(test, bit, op, args...) \ argument
38 test(bit, op, ##args); \
39 test(bit, op##_acquire, ##args); \
40 test(bit, op##_release, ##args); \
41 test(bit, op##_relaxed, ##args); \
[all …]
|
| D | idr.c | 384 unsigned bit = min % IDA_BITMAP_BITS; in ida_alloc_range() local
399 bit = 0; in ida_alloc_range()
400 if (xas.xa_index * IDA_BITMAP_BITS + bit > max) in ida_alloc_range()
406 if (bit < BITS_PER_XA_VALUE) { in ida_alloc_range()
407 bit = find_next_zero_bit(&tmp, BITS_PER_XA_VALUE, bit); in ida_alloc_range()
408 if (xas.xa_index * IDA_BITMAP_BITS + bit > max) in ida_alloc_range()
410 if (bit < BITS_PER_XA_VALUE) { in ida_alloc_range()
411 tmp |= 1UL << bit; in ida_alloc_range()
430 bit = find_next_zero_bit(bitmap->bitmap, IDA_BITMAP_BITS, bit); in ida_alloc_range()
431 if (xas.xa_index * IDA_BITMAP_BITS + bit > max) in ida_alloc_range()
[all …]
|
| D | nodemask.c | 23 int w, bit = NUMA_NO_NODE; in node_random() local
27 bit = bitmap_ord_to_pos(maskp->bits, in node_random()
29 return bit; in node_random()
|
| D | packing.c | 35 unsigned int bit; in bit_reverse() local
39 bit = (val & (1 << i)) != 0; in bit_reverse()
40 new_val |= (bit << (width - i - 1)); in bit_reverse()
|
| D | Kconfig | 32 - Is little endian (bytes are reversed within a 32-bit group)
33 - The least-significant 32-bit word comes first (within a 64-bit
35 - The most significant bit of a byte is at its right (bit 0 of a
37 Drivers may use these helpers to match the bit indices as described
49 This option enables the use of hardware bit-reversal instructions on
205 This is a bit slower than slice by 8, but has a smaller 4KiB lookup
219 bool "Classic Algorithm (one bit at a time)"
221 Calculate checksum one bit at a time. This is VERY slow, but has
290 This option enables the 32 bit PRNG library functions to perform a
514 them on the stack. This is a bit more expensive, but avoids
[all …]
|
| D | decompress_unlzma.c | 362 int bit; in process_bit0() local
366 bit = match_byte & 0x100; in process_bit0()
367 prob_lit = prob + 0x100 + bit + mi; in process_bit0()
369 if (!bit) in process_bit0()
372 if (bit) in process_bit0()
|
| D | genalloc.c | 247 unsigned long bit, end_bit; in gen_pool_destroy() local
254 bit = find_next_bit(chunk->bits, end_bit, 0); in gen_pool_destroy()
255 BUG_ON(bit < end_bit); in gen_pool_destroy()
|
| D | Kconfig.ubsan | 88 bool "Perform checking for bit-shift overflows"
92 This option enables -fsanitize=shift which checks for bit-shift
|
| D | vsprintf.c | 1236 int word, bit; in bitmap_string() local
1240 bit = i % BITS_PER_LONG; in bitmap_string()
1241 val = (bitmap[word] >> bit) & chunkmask; in bitmap_string()
|
| D | Kconfig.debug | 2100 tristate "64bit/32bit division and modulo test"
|
| /lib/842/ |
| D | 842_decompress.c | 52 u8 bit; member
89 u8 *in = p->in, b = p->bit, bits = b + n; in next_bits()
120 p->bit += n; in next_bits()
122 if (p->bit > 7) { in next_bits()
123 p->in += p->bit / 8; in next_bits()
124 p->ilen -= p->bit / 8; in next_bits()
125 p->bit %= 8; in next_bits()
286 p.bit = 0; in sw842_decompress()
|
| D | 842_compress.c | 94 u8 bit; member
169 int b = p->bit, bits = b + n, s = round_up(bits, 8) - bits; in add_bits()
211 p->bit += n; in add_bits()
213 if (p->bit > 7) { in add_bits()
214 p->out += p->bit / 8; in add_bits()
215 p->olen -= p->bit / 8; in add_bits()
216 p->bit %= 8; in add_bits()
497 p->bit = 0; in sw842_compress()
587 if (p->bit) { in sw842_compress()
590 p->bit = 0; in sw842_compress()
|
| /lib/raid6/ |
| D | int.uc | 70 * bit is 1, 0x00 for any byte for which the high bit is 0.
77 vv = (vv << 1) - (vv >> 7); /* Overflow on the top bit is OK */
|
| D | s390vx.uc | 29 * vector register y left by 1 bit and stores the result in
39 * operation returns 0xFF if the high bit of the byte is 1,
40 * or 0x00 if the high bit is 0. The result is stored in vector
|
| D | altivec.uc | 57 * bit is 1, 0x00 for any byte for which the high bit is 0.
|
| D | neon.uc | 44 * bit is 1, 0x00 for any byte for which the high bit is 0.
|
| /lib/mpi/ |
| D | Makefile | 19 mpi-bit.o \
|
| /lib/vdso/ |
| D | Kconfig | 20 in 32 bit only architectures.
|
| /lib/xz/ |
| D | xz_dec_lzma2.c | 532 int bit; in rc_bit() local
539 bit = 0; in rc_bit()
544 bit = 1; in rc_bit()
547 return bit; in rc_bit()
|
| /lib/crypto/ |
| D | curve25519-hacl64.c | 550 u64 bit; in ladder_smallloop_cmult_small_loop_step() local
553 bit = (u64)(byt >> 7); in ladder_smallloop_cmult_small_loop_step()
554 point_swap_conditional(nq2, nqpq2, bit); in ladder_smallloop_cmult_small_loop_step()
|
| /lib/fonts/ |
| D | Kconfig | 59 Console font with characters just a bit smaller than the default.
|