Home
last modified time | relevance | path

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

12345678910>>...25

/OK3568_Linux_fs/kernel/arch/s390/lib/
H A 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 …]
/OK3568_Linux_fs/kernel/arch/s390/include/asm/
H A 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()
56 return ((unsigned char *)ptr) + ((nr ^ (BITS_PER_LONG - 8)) >> 3); in __bitops_byte()
76 mask = 1UL << (nr & (BITS_PER_LONG - 1)); in arch_set_bit()
97 mask = ~(1UL << (nr & (BITS_PER_LONG - 1))); in arch_clear_bit()
119 mask = 1UL << (nr & (BITS_PER_LONG - 1)); in arch_change_bit()
129 mask = 1UL << (nr & (BITS_PER_LONG - 1)); in arch_test_and_set_bit()
140 mask = ~(1UL << (nr & (BITS_PER_LONG - 1))); in arch_test_and_clear_bit()
151 mask = 1UL << (nr & (BITS_PER_LONG - 1)); in arch_test_and_change_bit()
218 addr += (nr ^ (BITS_PER_LONG - 8)) >> 3; in arch_test_bit()
[all …]
/OK3568_Linux_fs/kernel/include/linux/
H A Du64_stats_sync.h69 #if BITS_PER_LONG==32 && defined(CONFIG_SMP)
74 #if BITS_PER_LONG == 64
118 #if BITS_PER_LONG == 32 && defined(CONFIG_SMP)
128 #if BITS_PER_LONG==32 && defined(CONFIG_SMP) in u64_stats_update_begin()
135 #if BITS_PER_LONG==32 && defined(CONFIG_SMP) in u64_stats_update_end()
145 #if BITS_PER_LONG==32 && defined(CONFIG_SMP) in u64_stats_update_begin_irqsave()
156 #if BITS_PER_LONG==32 && defined(CONFIG_SMP) in u64_stats_update_end_irqrestore()
164 #if BITS_PER_LONG==32 && defined(CONFIG_SMP) in __u64_stats_fetch_begin()
173 #if BITS_PER_LONG==32 && !defined(CONFIG_SMP) in u64_stats_fetch_begin()
182 #if BITS_PER_LONG==32 && defined(CONFIG_SMP) in __u64_stats_fetch_retry()
[all …]
H A Dhmm.h41 HMM_PFN_VALID = 1UL << (BITS_PER_LONG - 1),
42 HMM_PFN_WRITE = 1UL << (BITS_PER_LONG - 2),
43 HMM_PFN_ERROR = 1UL << (BITS_PER_LONG - 3),
44 HMM_PFN_ORDER_SHIFT = (BITS_PER_LONG - 8),
H A Dhash.h14 #if BITS_PER_LONG == 32
17 #elif BITS_PER_LONG == 64
79 #if BITS_PER_LONG == 64 in hash_64_generic()
98 #if BITS_PER_LONG == 64 in hash32_ptr()
/OK3568_Linux_fs/kernel/lib/
H A 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 …]
H A Dfind_bit.c40 tmp = addr1[start / BITS_PER_LONG]; in _find_next_bit()
42 tmp &= addr2[start / BITS_PER_LONG]; in _find_next_bit()
52 start = round_down(start, BITS_PER_LONG); in _find_next_bit()
55 start += BITS_PER_LONG; in _find_next_bit()
59 tmp = addr1[start / BITS_PER_LONG]; in _find_next_bit()
61 tmp &= addr2[start / BITS_PER_LONG]; in _find_next_bit()
111 for (idx = 0; idx * BITS_PER_LONG < size; idx++) { in find_first_bit()
113 return min(idx * BITS_PER_LONG + __ffs(addr[idx]), size); in find_first_bit()
129 for (idx = 0; idx * BITS_PER_LONG < size; idx++) { in find_first_zero_bit()
131 return min(idx * BITS_PER_LONG + ffz(addr[idx]), size); in find_first_zero_bit()
[all …]
H A Dtest_bitmap.c277 unsigned int nlongs = DIV_ROUND_UP(nbits, BITS_PER_LONG); in test_replace()
483 round_up(nbits, BITS_PER_LONG), nbits); in test_bitmap_arr32()
484 if (next_bit < round_up(nbits, BITS_PER_LONG)) in test_bitmap_arr32()
587 { BITS_PER_LONG, BITS_PER_LONG, BITS_PER_LONG,
591 { 1, BITS_PER_LONG - 1, BITS_PER_LONG,
596 { 0, BITS_PER_LONG * 2, BITS_PER_LONG * 2 + 1,
600 { 16, BITS_PER_LONG * 2 + 1, BITS_PER_LONG * 2 + 1 + 16,
/OK3568_Linux_fs/kernel/drivers/mtd/nand/
H A Dbbt.c28 BITS_PER_LONG); in nanddev_bbt_init()
79 ((entry * bits_per_block) / BITS_PER_LONG); in nanddev_bbt_get_block_status()
80 unsigned int offs = (entry * bits_per_block) % BITS_PER_LONG; in nanddev_bbt_get_block_status()
87 if (bits_per_block + offs > BITS_PER_LONG) in nanddev_bbt_get_block_status()
88 status |= pos[1] << (BITS_PER_LONG - offs); in nanddev_bbt_get_block_status()
112 ((entry * bits_per_block) / BITS_PER_LONG); in nanddev_bbt_set_block_status()
113 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 pos[0] &= ~GENMASK(BITS_PER_LONG - 1, offs); in nanddev_bbt_set_block_status()
125 if (bits_per_block + offs > BITS_PER_LONG) { in nanddev_bbt_set_block_status()
[all …]
/OK3568_Linux_fs/kernel/tools/lib/
H A Dfind_bit.c40 tmp = addr1[start / BITS_PER_LONG]; in _find_next_bit()
42 tmp &= addr2[start / BITS_PER_LONG]; in _find_next_bit()
47 start = round_down(start, BITS_PER_LONG); in _find_next_bit()
50 start += BITS_PER_LONG; in _find_next_bit()
54 tmp = addr1[start / BITS_PER_LONG]; in _find_next_bit()
56 tmp &= addr2[start / BITS_PER_LONG]; in _find_next_bit()
83 for (idx = 0; idx * BITS_PER_LONG < size; idx++) { in find_first_bit()
85 return min(idx * BITS_PER_LONG + __ffs(addr[idx]), size); in find_first_bit()
100 for (idx = 0; idx * BITS_PER_LONG < size; idx++) { in find_first_zero_bit()
102 return min(idx * BITS_PER_LONG + ffz(addr[idx]), size); in find_first_zero_bit()
H A Dbitmap.c10 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()
/OK3568_Linux_fs/kernel/arch/mips/include/asm/
H A Dbitops.h93 int bit = nr % BITS_PER_LONG; in set_bit()
121 int bit = nr % BITS_PER_LONG; in clear_bit()
162 int bit = nr % BITS_PER_LONG; in change_bit()
184 int bit = nr % BITS_PER_LONG; in test_and_set_bit_lock()
228 int bit = nr % BITS_PER_LONG; in test_and_clear_bit()
265 int bit = nr % BITS_PER_LONG; in test_and_change_bit()
313 if (BITS_PER_LONG == 32 && !__builtin_constant_p(word) && in __fls()
326 if (BITS_PER_LONG == 64 && !__builtin_constant_p(word) && in __fls()
339 num = BITS_PER_LONG - 1; in __fls()
341 #if BITS_PER_LONG == 64 in __fls()
[all …]
/OK3568_Linux_fs/kernel/tools/include/asm-generic/bitops/
H A 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()
/OK3568_Linux_fs/u-boot/include/asm-generic/bitops/
H A D__fls.h14 int num = BITS_PER_LONG - 1; in __fls()
16 #if BITS_PER_LONG == 64 in __fls()
22 if (!(word & (~0ul << (BITS_PER_LONG-16)))) { in __fls()
26 if (!(word & (~0ul << (BITS_PER_LONG-8)))) { in __fls()
30 if (!(word & (~0ul << (BITS_PER_LONG-4)))) { in __fls()
34 if (!(word & (~0ul << (BITS_PER_LONG-2)))) { in __fls()
38 if (!(word & (~0ul << (BITS_PER_LONG-1)))) in __fls()
/OK3568_Linux_fs/kernel/include/asm-generic/bitops/
H A 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()
/OK3568_Linux_fs/kernel/drivers/reset/
H A 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()
/OK3568_Linux_fs/u-boot/drivers/mtd/nand/
H A Dbbt.c48 BITS_PER_LONG) * sizeof(*nand->bbt.cache); in nanddev_read_bbt()
118 BITS_PER_LONG) * sizeof(*nand->bbt.cache); in nanddev_write_bbt()
243 BITS_PER_LONG); in nanddev_bbt_init()
350 ((entry * bits_per_block) / BITS_PER_LONG); in nanddev_bbt_get_block_status()
351 unsigned int offs = (entry * bits_per_block) % BITS_PER_LONG; in nanddev_bbt_get_block_status()
364 if (bits_per_block + offs > BITS_PER_LONG) in nanddev_bbt_get_block_status()
365 status |= pos[1] << (BITS_PER_LONG - offs); in nanddev_bbt_get_block_status()
389 ((entry * bits_per_block) / BITS_PER_LONG); in nanddev_bbt_set_block_status()
390 unsigned int offs = (entry * bits_per_block) % BITS_PER_LONG; in nanddev_bbt_set_block_status()
396 if (offs + bits_per_block - 1 > (BITS_PER_LONG - 1)) in nanddev_bbt_set_block_status()
[all …]
/OK3568_Linux_fs/external/xserver/record/
H A Dset.c85 #define BITS_PER_LONG (sizeof(unsigned long) * 8) macro
102 return (pbitvec[pm / BITS_PER_LONG] & in BitVectorIsMemberOfSet()
103 ((unsigned long) 1 << (pm % BITS_PER_LONG))); in BitVectorIsMemberOfSet()
119 startlong = iterbit / BITS_PER_LONG; in BitVectorFindBit()
121 startbit = startlong * BITS_PER_LONG; in BitVectorFindBit()
131 startbit += BITS_PER_LONG; in BitVectorFindBit()
135 startbit += BITS_PER_LONG; in BitVectorFindBit()
144 while (walkbit < BITS_PER_LONG && in BitVectorFindBit()
183 nlongs = (maxMember + BITS_PER_LONG) / BITS_PER_LONG; in BitVectorSetMemoryRequirements()
216 pbitvec[j / BITS_PER_LONG] |= in BitVectorCreateSet()
[all …]
/OK3568_Linux_fs/kernel/arch/mips/lib/
H A 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()
/OK3568_Linux_fs/kernel/drivers/rkflash/
H A Dsfc_nand_mtd_bbt.c47 BITS_PER_LONG) * sizeof(*nand->bbt.cache); in nanddev_read_bbt()
131 BITS_PER_LONG) * sizeof(*nand->bbt.cache); in nanddev_write_bbt()
272 BITS_PER_LONG); in snanddev_bbt_init()
379 ((entry * bits_per_block) / BITS_PER_LONG); in snanddev_bbt_get_block_status()
380 unsigned int offs = (entry * bits_per_block) % BITS_PER_LONG; in snanddev_bbt_get_block_status()
393 if (bits_per_block + offs > BITS_PER_LONG) in snanddev_bbt_get_block_status()
394 status |= pos[1] << (BITS_PER_LONG - offs); in snanddev_bbt_get_block_status()
419 ((entry * bits_per_block) / BITS_PER_LONG); in snanddev_bbt_set_block_status()
420 unsigned int offs = (entry * bits_per_block) % BITS_PER_LONG; in snanddev_bbt_set_block_status()
426 if (offs + bits_per_block - 1 > (BITS_PER_LONG - 1)) in snanddev_bbt_set_block_status()
[all …]
/OK3568_Linux_fs/kernel/kernel/kcsan/
H A Dencoding.h38 #define WATCHPOINT_ADDR_BITS (BITS_PER_LONG-1 - WATCHPOINT_SIZE_BITS)
43 #define WATCHPOINT_WRITE_MASK BIT(BITS_PER_LONG-1)
45 GENMASK(BITS_PER_LONG-2, BITS_PER_LONG-2 - WATCHPOINT_SIZE_BITS)
47 GENMASK(BITS_PER_LONG-3 - WATCHPOINT_SIZE_BITS, 0)
/OK3568_Linux_fs/u-boot/include/linux/
H A Dbitops.h11 #define BIT_MASK(nr) (1UL << ((nr) % BITS_PER_LONG))
12 #define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
25 (((~0UL) << (l)) & (~0UL >> (BITS_PER_LONG - 1 - (h))))
168 #if BITS_PER_LONG == 32 in __ffs64()
171 #elif BITS_PER_LONG != 64 in __ffs64()
172 #error BITS_PER_LONG not 32 or 64 in __ffs64()
/OK3568_Linux_fs/kernel/drivers/scsi/megaraid/
H A 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
/OK3568_Linux_fs/kernel/include/linux/mtd/
H A Dmap.h72 # if BITS_PER_LONG < 64
74 # define map_bankwidth_is_large(map) (map_bankwidth(map) > BITS_PER_LONG/8)
80 # define map_bankwidth_is_large(map) (BITS_PER_LONG < 64)
95 # define map_bankwidth_is_large(map) (map_bankwidth(map) > BITS_PER_LONG/8)
115 # define map_bankwidth_is_large(map) (map_bankwidth(map) > BITS_PER_LONG/8)
167 #define MAX_MAP_LONGS (((MAX_MAP_BANKWIDTH * 8) + BITS_PER_LONG - 1) / BITS_PER_LONG)
331 #if BITS_PER_LONG >= 64 in map_word_load()
367 #if BITS_PER_LONG < 64
399 #if BITS_PER_LONG >= 64 in inline_map_read()
419 #if BITS_PER_LONG >= 64 in inline_map_write()
/OK3568_Linux_fs/kernel/tools/include/linux/
H A Dhash.h14 #if BITS_PER_LONG == 32
17 #elif BITS_PER_LONG == 64
79 #if BITS_PER_LONG == 64 in hash_64_generic()
98 #if BITS_PER_LONG == 64 in hash32_ptr()

12345678910>>...25