Home
last modified time | relevance | path

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

123

/xen/xen/arch/arm/arm64/lib/
A Dfind_next_bit.c29 offset %= BITS_PER_LONG; in find_next_bit()
37 size -= BITS_PER_LONG; in find_next_bit()
38 result += BITS_PER_LONG; in find_next_bit()
43 result += BITS_PER_LONG; in find_next_bit()
44 size -= BITS_PER_LONG; in find_next_bit()
75 offset %= BITS_PER_LONG; in find_next_zero_bit()
83 size -= BITS_PER_LONG; in find_next_zero_bit()
90 size -= BITS_PER_LONG; in find_next_zero_bit()
120 size -= BITS_PER_LONG; in find_first_bit()
167 #if BITS_PER_LONG == 64 in ext2_swabp()
[all …]
/xen/xen/arch/x86/
A Dbitops.c14 " bsf -"STR(BITS_PER_LONG/8)"(%2),%0\n\t" in __find_first_bit()
16 " lea -"STR(BITS_PER_LONG/8)"(%2),%2\n\t" in __find_first_bit()
31 unsigned int set, bit = offset & (BITS_PER_LONG - 1); in __find_next_bit()
38 set = __scanbit(*p >> bit, BITS_PER_LONG - bit); in __find_next_bit()
39 if ( set < (BITS_PER_LONG - bit) ) in __find_next_bit()
41 offset += BITS_PER_LONG - bit; in __find_next_bit()
63 " xor -"STR(BITS_PER_LONG/8)"(%2),%3\n\t" in __find_first_zero_bit()
66 " lea -"STR(BITS_PER_LONG/8)"(%2),%2\n\t" in __find_first_zero_bit()
81 unsigned int set, bit = offset & (BITS_PER_LONG - 1); in __find_next_zero_bit()
89 if ( set < (BITS_PER_LONG - bit) ) in __find_next_zero_bit()
[all …]
/xen/xen/common/
A Dbitmap.c62 if (bits % BITS_PER_LONG) in __bitmap_empty()
77 if (bits % BITS_PER_LONG) in __bitmap_full()
93 if (bits % BITS_PER_LONG) in __bitmap_equal()
107 if (bits % BITS_PER_LONG) in __bitmap_complement()
164 if (bits % BITS_PER_LONG) in __bitmap_intersects()
179 if (bits % BITS_PER_LONG) in __bitmap_subset()
186 #if BITS_PER_LONG == 32
194 if (bits % BITS_PER_LONG) in __bitmap_weight()
207 if (bits % BITS_PER_LONG) in __bitmap_weight()
219 int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG); in __bitmap_set()
[all …]
A Dpdx.c91 i = find_next_zero_bit(&mask, BITS_PER_LONG, j + 1); in pfn_pdx_hole_setup()
92 if ( i >= BITS_PER_LONG ) in pfn_pdx_hole_setup()
94 j = find_next_bit(&mask, BITS_PER_LONG, i + 1); in pfn_pdx_hole_setup()
95 if ( j >= BITS_PER_LONG ) in pfn_pdx_hole_setup()
A Dcpu.c12 = BITS_TO_LONGS(NR_CPUS) * BITS_PER_LONG; in BITS_TO_LONGS()
33 const unsigned long cpu_bit_bitmap[BITS_PER_LONG+1][BITS_TO_LONGS(NR_CPUS)] = {
37 #if BITS_PER_LONG > 32
/xen/xen/include/xen/
A Dhash.h16 #if BITS_PER_LONG == 32
19 #elif BITS_PER_LONG == 64
30 #if BITS_PER_LONG == 64 in hash_long()
51 return hash >> (BITS_PER_LONG - bits); in hash_long()
A Dbitops.h11 (((~0UL) << (l)) & (~0UL >> (BITS_PER_LONG - 1 - (h))))
84 #if BITS_PER_LONG == 64
109 #if BITS_PER_LONG == 64
187 if ( BITS_PER_LONG < 64 ) in generic_hweight64()
248 #define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
A Dcpumask.h72 #if NR_CPUS > 4 * BITS_PER_LONG
77 # define nr_cpumask_bits (BITS_TO_LONGS(NR_CPUS) * BITS_PER_LONG)
278 cpu_bit_bitmap[BITS_PER_LONG+1][BITS_TO_LONGS(NR_CPUS)];
283 BITS_PER_LONG]; in cpumask_of()
285 return (const cpumask_t *)(p - cpu / BITS_PER_LONG); in cpumask_of()
308 #if NR_CPUS > 2 * BITS_PER_LONG
A Dtypes.h9 (((bits)+BITS_PER_LONG-1)/BITS_PER_LONG)
A Dbitmap.h97 ((nbits) % BITS_PER_LONG) ? \
98 (1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL \
107 } else if (__builtin_constant_p(nbits) && n__ <= BITS_PER_LONG) { \
240 #define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) & (BITS_PER_LONG - 1)))
A Dnospec.h32 return ~(long)(index | (size - 1UL - index)) >> (BITS_PER_LONG - 1); in array_index_mask_nospec()
/xen/tools/xentrace/
A Danalyze.h21 # define BITS_PER_LONG 64 macro
23 # define BITS_PER_LONG 32 macro
27 (((bits)+BITS_PER_LONG-1)/BITS_PER_LONG)
/xen/tools/xenpaging/
A Dpolicy_default.c94 if ( (current_gfn & (BITS_PER_LONG - 1)) == 0 ) in policy_choose_victim()
99 current_gfn += BITS_PER_LONG; in policy_choose_victim()
100 i += BITS_PER_LONG; in policy_choose_victim()
/xen/xen/include/asm-arm/
A Ddiv64.h25 #if BITS_PER_LONG == 64
35 #elif BITS_PER_LONG == 32
A Dvreg.h110 #define VREG_REG_MASK(size) ((~0UL) >> (BITS_PER_LONG - ((1 << (size)) * 8)))
213 #if BITS_PER_LONG == 64
/xen/xen/include/asm-x86/
A Dbitops.h328 if ( __builtin_constant_p(max) && max == BITS_PER_LONG ) in __scanbit()
363 else if ( __builtin_constant_p(size) && s__ <= BITS_PER_LONG ) \
395 else if ( __builtin_constant_p(size) && s__ <= BITS_PER_LONG ) \
A Dconfig.h14 #define BITS_PER_LONG (BYTES_PER_LONG << 3) macro
20 #define BITS_PER_XEN_ULONG BITS_PER_LONG
/xen/xen/include/acpi/platform/
A Daclinux.h63 #define ACPI_MACHINE_WIDTH BITS_PER_LONG
/xen/xen/common/coverage/
A Dgcov.h22 #if BITS_PER_LONG >= 64
A Dllvm.c37 #if BITS_PER_LONG == 64
/xen/xen/include/asm-arm/arm64/
A Dbitops.h34 return BITS_PER_LONG - ret; in flsl()
/xen/xen/include/asm-x86/hvm/vmx/
A Dvmcs.h78 unsigned long read_low [0x2000 / BITS_PER_LONG];
79 unsigned long read_high [0x2000 / BITS_PER_LONG];
80 unsigned long write_low [0x2000 / BITS_PER_LONG];
81 unsigned long write_high[0x2000 / BITS_PER_LONG];
/xen/tools/tests/vhpet/
A Demul.h35 #define BITS_PER_LONG __WORDSIZE macro
37 (((bits) + BITS_PER_LONG - 1) / BITS_PER_LONG)
/xen/tools/libxl/
A Dlibxl_arm_acpi.c33 #ifndef BITS_PER_LONG
35 #define BITS_PER_LONG 64 macro
37 #define BITS_PER_LONG 32 macro
40 #define ACPI_MACHINE_WIDTH BITS_PER_LONG
/xen/tools/libxc/
A Dxc_bitops.h10 #define BITS_PER_LONG (sizeof(unsigned long) * 8) macro

Completed in 35 milliseconds

123