Home
last modified time | relevance | path

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

/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
/tools/lib/
Dfind_bit.c40 tmp = addr[start / BITS_PER_LONG] ^ invert; in _find_next_bit()
44 start = round_down(start, BITS_PER_LONG); in _find_next_bit()
47 start += BITS_PER_LONG; in _find_next_bit()
51 tmp = addr[start / BITS_PER_LONG] ^ invert; in _find_next_bit()
77 for (idx = 0; idx * BITS_PER_LONG < size; idx++) { in find_first_bit()
79 return min(idx * BITS_PER_LONG + __ffs(addr[idx]), size); in find_first_bit()
94 for (idx = 0; idx * BITS_PER_LONG < size; idx++) { in find_first_zero_bit()
96 return min(idx * BITS_PER_LONG + ffz(addr[idx]), size); in find_first_zero_bit()
Dbitmap.c12 int k, w = 0, lim = bits/BITS_PER_LONG; in __bitmap_weight()
17 if (bits % BITS_PER_LONG) in __bitmap_weight()
66 unsigned int lim = bits/BITS_PER_LONG; in __bitmap_and()
71 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/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.h8 #define BIT_MASK(nr) (1UL << ((nr) % BITS_PER_LONG))
9 #define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
20 (((~0UL) - (1UL << (l)) + 1) & (~0UL >> (BITS_PER_LONG - 1 - (h))))
Dbitmap.h19 #define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) & (BITS_PER_LONG - 1)))
23 ((nbits) % BITS_PER_LONG) ? \
24 (1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL \
28 (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG)
Dbitops.h10 #ifndef BITS_PER_LONG
11 # define BITS_PER_LONG __WORDSIZE macro
/tools/perf/util/
Dvdso.c38 #if BITS_PER_LONG == 64
51 #if BITS_PER_LONG == 64 in vdso_info__new()
114 #if BITS_PER_LONG == 64 in machine__exit_vdso()
158 #if BITS_PER_LONG == 64
335 #if BITS_PER_LONG == 64 in machine__findnew_vdso()
Dauxtrace.h394 #if BITS_PER_LONG == 64 || !defined(HAVE_SYNC_COMPARE_AND_SWAP_SUPPORT) in auxtrace_mmap__read_head()
408 #if BITS_PER_LONG != 64 && defined(HAVE_SYNC_COMPARE_AND_SWAP_SUPPORT) in auxtrace_mmap__write_tail()
414 #if BITS_PER_LONG == 64 || !defined(HAVE_SYNC_COMPARE_AND_SWAP_SUPPORT) in auxtrace_mmap__write_tail()
Dhist.c57 const unsigned int unresolved_col_width = BITS_PER_LONG / 4; in hists__set_unres_dso_col_len()
67 const unsigned int unresolved_col_width = BITS_PER_LONG / 4; in hists__calc_col_len()
79 symlen += BITS_PER_LONG / 4 + 2 + 3; in hists__calc_col_len()
103 symlen += BITS_PER_LONG / 4 + 2 + 3; in hists__calc_col_len()
117 symlen += BITS_PER_LONG / 4 + 2 + 3; in hists__calc_col_len()
Dsort.c274 BITS_PER_LONG / 4 + 2, ip, o); in _hist_entry__sym_snprintf()
289 size_t len = BITS_PER_LONG / 4; in _hist_entry__sym_snprintf()
1337 size_t len = BITS_PER_LONG / 4; in hist_entry__phys_daddr_snprintf()
Dauxtrace.c85 #if BITS_PER_LONG != 64 && !defined(HAVE_SYNC_COMPARE_AND_SWAP_SUPPORT) in auxtrace_mmap__mmap()
316 } else if (BITS_PER_LONG == 32 && in auxtrace_queues__add_event_buffer()
Dannotate.c1810 printf("%*" PRIx64 ": %" PRIu64 "\n", BITS_PER_LONG / 2, in symbol__annotate_hits()
1812 printf("%*s: %" PRIu64 "\n", BITS_PER_LONG / 2, "h->nr_samples", h->nr_samples); in symbol__annotate_hits()
Dprobe-finder.c293 #define BYTES_TO_BITS(nb) ((nb) * BITS_PER_LONG / sizeof(long))
Dsession.c1821 #if BITS_PER_LONG == 64
/tools/testing/radix-tree/
Didr-test.c347 assert(!ida_get_new_above(&ida, i + BITS_PER_LONG, &id)); in ida_check_conv()
348 assert(id == i + BITS_PER_LONG); in ida_check_conv()
350 ida_remove(&ida, i + BITS_PER_LONG); in ida_check_conv()
367 for (i = 0; i < IDA_BITMAP_BITS + BITS_PER_LONG - 4; i++) { in ida_check_conv()
373 for (i = IDA_BITMAP_BITS + BITS_PER_LONG - 4; i > 0; i--) { in ida_check_conv()
382 assert((i % IDA_BITMAP_BITS) == (BITS_PER_LONG - 2)); in ida_check_conv()
386 assert((i % IDA_BITMAP_BITS) != (BITS_PER_LONG - 2)); in ida_check_conv()
Dtest.c61 assert(item->order < BITS_PER_LONG); in item_sanity()
/tools/perf/ui/browsers/
Dmap.c115 char tmp[BITS_PER_LONG / 4]; in map__browse()
/tools/perf/util/scripting-engines/
Dtrace-event-python.c666 #if BITS_PER_LONG == 64 in tuple_set_u64()
669 #if BITS_PER_LONG == 32 in tuple_set_u64()
/tools/perf/ui/
Dhist.c663 ret += 3 + BITS_PER_LONG / 4; in hists__sort_list_width()