Home
last modified time | relevance | path

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

12

/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()
Dfls64.h18 #if BITS_PER_LONG == 32
26 #elif BITS_PER_LONG == 64
34 #error BITS_PER_LONG not 32 or 64
Dnon-atomic.h106 return 1UL & (addr[BIT_WORD(nr)] >> (nr & (BITS_PER_LONG-1))); in test_bit()
/tools/lib/
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()
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()
Dhweight.c45 #if BITS_PER_LONG == 32 in __sw_hweight64()
48 #elif BITS_PER_LONG == 64 in __sw_hweight64()
/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
/tools/testing/radix-tree/
Dbitmap.c9 int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG); in bitmap_clear()
15 bits_to_clear = BITS_PER_LONG; in bitmap_clear()
Dtest.c50 assert(item->order < BITS_PER_LONG); in item_sanity()
/tools/include/linux/
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()
Dbits.h10 #define BIT_MASK(nr) (UL(1) << ((nr) % BITS_PER_LONG))
11 #define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
23 (~UL(0) >> (BITS_PER_LONG - 1 - (h))))
Dbitmap.h20 #define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) & (BITS_PER_LONG - 1)))
24 ((nbits) % BITS_PER_LONG) ? \
25 (1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL \
29 (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG)
Dbitops.h11 #ifndef BITS_PER_LONG
12 # define BITS_PER_LONG __WORDSIZE macro
/tools/testing/selftests/kvm/lib/
Dkvm_util_internal.h19 #ifndef BITS_PER_LONG
20 #define BITS_PER_LONG (BITS_PER_BYTE * sizeof(long)) macro
24 #define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, BITS_PER_LONG)
/tools/perf/util/
Dvdso.c41 #if BITS_PER_LONG == 64
54 #if BITS_PER_LONG == 64 in vdso_info__new()
117 #if BITS_PER_LONG == 64 in machine__exit_vdso()
159 #if BITS_PER_LONG == 64
336 #if BITS_PER_LONG == 64 in machine__findnew_vdso()
Dauxtrace.h406 #if BITS_PER_LONG == 64 || !defined(HAVE_SYNC_COMPARE_AND_SWAP_SUPPORT) in auxtrace_mmap__read_head()
420 #if BITS_PER_LONG != 64 && defined(HAVE_SYNC_COMPARE_AND_SWAP_SUPPORT) in auxtrace_mmap__write_tail()
426 #if BITS_PER_LONG == 64 || !defined(HAVE_SYNC_COMPARE_AND_SWAP_SUPPORT) in auxtrace_mmap__write_tail()
Dhist.c69 const unsigned int unresolved_col_width = BITS_PER_LONG / 4; in hists__set_unres_dso_col_len()
79 const unsigned int unresolved_col_width = BITS_PER_LONG / 4; in hists__calc_col_len()
91 symlen += BITS_PER_LONG / 4 + 2 + 3; in hists__calc_col_len()
115 symlen += BITS_PER_LONG / 4 + 2 + 3; in hists__calc_col_len()
129 symlen += BITS_PER_LONG / 4 + 2 + 3; in hists__calc_col_len()
Dauxtrace.c87 #if BITS_PER_LONG != 64 && !defined(HAVE_SYNC_COMPARE_AND_SWAP_SUPPORT) in auxtrace_mmap__mmap()
331 } else if (BITS_PER_LONG == 32 && in auxtrace_queues__add_buffer()
Dsort.c299 BITS_PER_LONG / 4 + 2, ip, o); in _hist_entry__sym_snprintf()
317 size_t len = BITS_PER_LONG / 4; in _hist_entry__sym_snprintf()
1413 size_t len = BITS_PER_LONG / 4; in hist_entry__phys_daddr_snprintf()
Dannotate.c2252 printf("%*" PRIx64 ": %" PRIu64 "\n", BITS_PER_LONG / 2, in symbol__annotate_hits()
2254 printf("%*s: %" PRIu64 "\n", BITS_PER_LONG / 2, "h->nr_samples", h->nr_samples); in symbol__annotate_hits()
Dprobe-finder.c281 #define BYTES_TO_BITS(nb) ((nb) * BITS_PER_LONG / sizeof(long))
/tools/perf/ui/browsers/
Dmap.c117 char tmp[BITS_PER_LONG / 4]; in map__browse()
/tools/testing/selftests/kvm/
Ddirty_log_test.c41 # define BITOP_LE_SWIZZLE ((BITS_PER_LONG-1) & ~0x7)
/tools/perf/ui/
Dhist.c667 ret += 3 + BITS_PER_LONG / 4; in hists__sort_list_width()
/tools/perf/util/scripting-engines/
Dtrace-event-python.c934 #if BITS_PER_LONG == 64 in tuple_set_u64()
937 #if BITS_PER_LONG == 32 in tuple_set_u64()

12