Home
last modified time | relevance | path

Searched refs:BITS_PER_LONG (Results 1 – 25 of 537) sorted by relevance

12345678910>>...22

/Linux-v6.1/arch/s390/lib/
Dfind.c23 while (size & ~(BITS_PER_LONG - 1)) { in find_first_bit_inv()
26 result += BITS_PER_LONG; in find_first_bit_inv()
27 size -= BITS_PER_LONG; in find_first_bit_inv()
31 tmp = (*p) & (~0UL << (BITS_PER_LONG - size)); in find_first_bit_inv()
35 return result + (__fls(tmp) ^ (BITS_PER_LONG - 1)); in find_first_bit_inv()
42 const unsigned long *p = addr + (offset / BITS_PER_LONG); in find_next_bit_inv()
43 unsigned long result = offset & ~(BITS_PER_LONG - 1); in find_next_bit_inv()
49 offset %= BITS_PER_LONG; in find_next_bit_inv()
53 if (size < BITS_PER_LONG) in find_next_bit_inv()
57 size -= BITS_PER_LONG; in find_next_bit_inv()
[all …]
/Linux-v6.1/lib/
Dbitmap.c51 unsigned int k, lim = bits/BITS_PER_LONG; in __bitmap_equal()
56 if (bits % BITS_PER_LONG) in __bitmap_equal()
69 unsigned int k, lim = bits / BITS_PER_LONG; in __bitmap_or_equal()
77 if (!(bits % BITS_PER_LONG)) in __bitmap_or_equal()
107 unsigned off = shift/BITS_PER_LONG, rem = shift % BITS_PER_LONG; in __bitmap_shift_right()
122 upper <<= (BITS_PER_LONG - rem); in __bitmap_shift_right()
153 unsigned int off = shift/BITS_PER_LONG, rem = shift % BITS_PER_LONG; in __bitmap_shift_left()
162 lower = src[k - 1] >> (BITS_PER_LONG - rem); in __bitmap_shift_left()
217 if (first % BITS_PER_LONG) { in bitmap_cut()
218 keep = src[first / BITS_PER_LONG] & in bitmap_cut()
[all …]
Dfind_bit.c32 for (idx = 0; idx * BITS_PER_LONG < sz; idx++) { \
35 sz = min(idx * BITS_PER_LONG + __ffs(MUNGE(val)), sz); \
58 idx = __start / BITS_PER_LONG; \
61 if ((idx + 1) * BITS_PER_LONG >= sz) \
66 sz = min(idx * BITS_PER_LONG + __ffs(MUNGE(tmp)), sz); \
75 for (idx = 0; (idx + 1) * BITS_PER_LONG <= sz; idx++) { \
76 if (idx * BITS_PER_LONG + nr >= sz) \
87 if (sz % BITS_PER_LONG) \
90 sz = min(idx * BITS_PER_LONG + fns(tmp, nr), sz); \
190 unsigned long idx = (size-1) / BITS_PER_LONG; in _find_last_bit()
[all …]
/Linux-v6.1/arch/s390/include/asm/
Dbitops.h42 #define __BITOPS_WORDS(bits) (((bits) + BITS_PER_LONG - 1) / BITS_PER_LONG)
49 addr = (unsigned long)ptr + ((nr ^ (nr & (BITS_PER_LONG - 1))) >> 3); in __bitops_word()
55 return 1UL << (nr & (BITS_PER_LONG - 1)); in __bitops_mask()
224 return set_bit(nr ^ (BITS_PER_LONG - 1), ptr); in set_bit_inv()
229 return clear_bit(nr ^ (BITS_PER_LONG - 1), ptr); in clear_bit_inv()
235 return test_and_clear_bit(nr ^ (BITS_PER_LONG - 1), ptr); in test_and_clear_bit_inv()
240 return __set_bit(nr ^ (BITS_PER_LONG - 1), ptr); in __set_bit_inv()
245 return __clear_bit(nr ^ (BITS_PER_LONG - 1), ptr); in __clear_bit_inv()
251 return test_bit(nr ^ (BITS_PER_LONG - 1), ptr); in test_bit_inv()
313 return __flogr(-word & word) ^ (BITS_PER_LONG - 1); in __ffs()
[all …]
/Linux-v6.1/include/asm-generic/bitops/
D__fls.h15 int num = BITS_PER_LONG - 1; in __fls()
17 #if BITS_PER_LONG == 64 in __fls()
23 if (!(word & (~0ul << (BITS_PER_LONG-16)))) { in __fls()
27 if (!(word & (~0ul << (BITS_PER_LONG-8)))) { in __fls()
31 if (!(word & (~0ul << (BITS_PER_LONG-4)))) { in __fls()
35 if (!(word & (~0ul << (BITS_PER_LONG-2)))) { in __fls()
39 if (!(word & (~0ul << (BITS_PER_LONG-1)))) in __fls()
Dsched.h15 #if BITS_PER_LONG == 64 in sched_find_first_bit()
19 #elif BITS_PER_LONG == 32 in sched_find_first_bit()
28 #error BITS_PER_LONG not defined in sched_find_first_bit()
Dfls64.h18 #if BITS_PER_LONG == 32
26 #elif BITS_PER_LONG == 64
34 #error BITS_PER_LONG not 32 or 64
/Linux-v6.1/tools/include/asm-generic/bitops/
D__fls.h15 int num = BITS_PER_LONG - 1; in __fls()
17 #if BITS_PER_LONG == 64 in __fls()
23 if (!(word & (~0ul << (BITS_PER_LONG-16)))) { in __fls()
27 if (!(word & (~0ul << (BITS_PER_LONG-8)))) { in __fls()
31 if (!(word & (~0ul << (BITS_PER_LONG-4)))) { in __fls()
35 if (!(word & (~0ul << (BITS_PER_LONG-2)))) { in __fls()
39 if (!(word & (~0ul << (BITS_PER_LONG-1)))) in __fls()
/Linux-v6.1/arch/mips/include/asm/
Dbitops.h91 int bit = nr % BITS_PER_LONG; in set_bit()
119 int bit = nr % BITS_PER_LONG; in clear_bit()
160 int bit = nr % BITS_PER_LONG; in change_bit()
182 int bit = nr % BITS_PER_LONG; in test_and_set_bit_lock()
226 int bit = nr % BITS_PER_LONG; in test_and_clear_bit()
263 int bit = nr % BITS_PER_LONG; in test_and_change_bit()
311 if (BITS_PER_LONG == 32 && !__builtin_constant_p(word) && in __fls()
324 if (BITS_PER_LONG == 64 && !__builtin_constant_p(word) && in __fls()
337 num = BITS_PER_LONG - 1; in __fls()
339 #if BITS_PER_LONG == 64 in __fls()
[all …]
/Linux-v6.1/drivers/mtd/nand/
Dbbt.c76 ((entry * bits_per_block) / BITS_PER_LONG); in nanddev_bbt_get_block_status()
77 unsigned int offs = (entry * bits_per_block) % BITS_PER_LONG; in nanddev_bbt_get_block_status()
84 if (bits_per_block + offs > BITS_PER_LONG) in nanddev_bbt_get_block_status()
85 status |= pos[1] << (BITS_PER_LONG - offs); in nanddev_bbt_get_block_status()
109 ((entry * bits_per_block) / BITS_PER_LONG); in nanddev_bbt_set_block_status()
110 unsigned int offs = (entry * bits_per_block) % BITS_PER_LONG; in nanddev_bbt_set_block_status()
119 if (bits_per_block + offs > BITS_PER_LONG) { in nanddev_bbt_set_block_status()
120 unsigned int rbits = bits_per_block + offs - BITS_PER_LONG; in nanddev_bbt_set_block_status()
/Linux-v6.1/tools/lib/
Dbitmap.c10 unsigned int k, w = 0, lim = bits/BITS_PER_LONG; in __bitmap_weight()
15 if (bits % BITS_PER_LONG) in __bitmap_weight()
64 unsigned int lim = bits/BITS_PER_LONG; in __bitmap_and()
69 if (bits % BITS_PER_LONG) in __bitmap_and()
78 unsigned int k, lim = bits/BITS_PER_LONG; in __bitmap_equal()
83 if (bits % BITS_PER_LONG) in __bitmap_equal()
93 unsigned int k, lim = bits/BITS_PER_LONG; in __bitmap_intersects()
98 if (bits % BITS_PER_LONG) in __bitmap_intersects()
Dfind_bit.c31 for (idx = 0; idx * BITS_PER_LONG < sz; idx++) { \
34 sz = min(idx * BITS_PER_LONG + __ffs(MUNGE(val)), sz); \
57 idx = __start / BITS_PER_LONG; \
60 if ((idx + 1) * BITS_PER_LONG >= sz) \
65 sz = min(idx * BITS_PER_LONG + __ffs(MUNGE(tmp)), sz); \
/Linux-v6.1/drivers/reset/
Dreset-zynq.c34 int bank = id / BITS_PER_LONG; in zynq_reset_assert()
35 int offset = id % BITS_PER_LONG; in zynq_reset_assert()
51 int bank = id / BITS_PER_LONG; in zynq_reset_deassert()
52 int offset = id % BITS_PER_LONG; in zynq_reset_deassert()
68 int bank = id / BITS_PER_LONG; in zynq_reset_status()
69 int offset = id % BITS_PER_LONG; in zynq_reset_status()
115 priv->rcdev.nr_resets = resource_size(res) / 4 * BITS_PER_LONG; in zynq_reset_probe()
/Linux-v6.1/arch/mips/lib/
Dbitops.c24 unsigned int bit = nr % BITS_PER_LONG; in __mips_set_bit()
45 unsigned int bit = nr % BITS_PER_LONG; in __mips_clear_bit()
66 unsigned int bit = nr % BITS_PER_LONG; in __mips_change_bit()
88 unsigned int bit = nr % BITS_PER_LONG; in __mips_test_and_set_bit_lock()
112 unsigned int bit = nr % BITS_PER_LONG; in __mips_test_and_clear_bit()
136 unsigned int bit = nr % BITS_PER_LONG; in __mips_test_and_change_bit()
/Linux-v6.1/include/asm-generic/
Dbitsperlong.h9 #define BITS_PER_LONG 64 macro
11 #define BITS_PER_LONG 32 macro
18 #if 0 && BITS_PER_LONG != __BITS_PER_LONG
36 (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG && (nbits) > 0)
/Linux-v6.1/tools/include/asm-generic/
Dbitsperlong.h8 #define BITS_PER_LONG (__CHAR_BIT__ * __SIZEOF_LONG__) macro
10 #define BITS_PER_LONG __WORDSIZE macro
13 #if BITS_PER_LONG != __BITS_PER_LONG
22 (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG && (nbits) > 0)
/Linux-v6.1/include/linux/
Dhmm.h36 HMM_PFN_VALID = 1UL << (BITS_PER_LONG - 1),
37 HMM_PFN_WRITE = 1UL << (BITS_PER_LONG - 2),
38 HMM_PFN_ERROR = 1UL << (BITS_PER_LONG - 3),
39 HMM_PFN_ORDER_SHIFT = (BITS_PER_LONG - 8),
Dhash.h14 #if BITS_PER_LONG == 32
17 #elif BITS_PER_LONG == 64
76 #if BITS_PER_LONG == 64 in hash_64_generic()
95 #if BITS_PER_LONG == 64 in hash32_ptr()
Dpage-flags-layout.h59 <= BITS_PER_LONG - NR_PAGEFLAGS
94 KASAN_TAG_WIDTH + LAST_CPUPID_SHIFT <= BITS_PER_LONG - NR_PAGEFLAGS
105 KASAN_TAG_WIDTH + LAST_CPUPID_WIDTH > BITS_PER_LONG - NR_PAGEFLAGS
110 #define LRU_REFS_WIDTH min(__LRU_REFS_WIDTH, BITS_PER_LONG - NR_PAGEFLAGS - \
Djoystick.h14 #if BITS_PER_LONG == 64
16 #elif BITS_PER_LONG == 32
19 #error Unexpected BITS_PER_LONG
Dcount_zeros.h26 return BITS_PER_LONG - fls(x); in count_leading_zeros()
28 return BITS_PER_LONG - fls64(x); in count_leading_zeros()
31 #define COUNT_LEADING_ZEROS_0 BITS_PER_LONG
/Linux-v6.1/drivers/scsi/megaraid/
Dmegaraid_mm.h71 #if BITS_PER_LONG == 32
75 #if BITS_PER_LONG == 64
85 #if BITS_PER_LONG == 32
89 #if BITS_PER_LONG == 64
/Linux-v6.1/tools/include/linux/
Dhash.h14 #if BITS_PER_LONG == 32
17 #elif BITS_PER_LONG == 64
76 #if BITS_PER_LONG == 64 in hash_64_generic()
95 #if BITS_PER_LONG == 64 in hash32_ptr()
/Linux-v6.1/drivers/gpu/drm/i915/gt/
Dintel_reset_types.h46 #define I915_WEDGED_ON_INIT (BITS_PER_LONG - 3)
47 #define I915_WEDGED_ON_FINI (BITS_PER_LONG - 2)
48 #define I915_WEDGED (BITS_PER_LONG - 1)
/Linux-v6.1/net/netfilter/
Dnft_set_pipapo.h58 #if BITS_PER_LONG == 64
61 #define NFT_PIPAPO_MAP_TOBITS (BITS_PER_LONG - NFT_PIPAPO_MAP_NBITS)
97 #if BITS_PER_LONG == 64
200 f->bsize * BITS_PER_LONG); in pipapo_and_field_buckets_4bit()
205 f->bsize * BITS_PER_LONG); in pipapo_and_field_buckets_4bit()
225 f->bsize * BITS_PER_LONG); in pipapo_and_field_buckets_8bit()

12345678910>>...22