Home
last modified time | relevance | path

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

12

/tools/include/asm-generic/bitops/
A D__fls.h15 unsigned int num = BITS_PER_LONG - 1; in generic___fls()
17 #if BITS_PER_LONG == 64 in generic___fls()
23 if (!(word & (~0ul << (BITS_PER_LONG-16)))) { in generic___fls()
27 if (!(word & (~0ul << (BITS_PER_LONG-8)))) { in generic___fls()
31 if (!(word & (~0ul << (BITS_PER_LONG-4)))) { in generic___fls()
35 if (!(word & (~0ul << (BITS_PER_LONG-2)))) { in generic___fls()
39 if (!(word & (~0ul << (BITS_PER_LONG-1)))) in generic___fls()
A Dfls64.h18 #if BITS_PER_LONG == 32
26 #elif BITS_PER_LONG == 64
34 #error BITS_PER_LONG not 32 or 64
A Dnon-atomic.h112 return 1UL & (addr[BIT_WORD(nr)] >> (nr & (BITS_PER_LONG-1))); in _test_bit()
/tools/lib/
A 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()
98 if (bits % BITS_PER_LONG) in __bitmap_intersects()
108 int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG); in __bitmap_set()
114 bits_to_set = BITS_PER_LONG; in __bitmap_set()
128 int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG); in __bitmap_clear()
[all …]
A 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); \
A Dhweight.c45 #if BITS_PER_LONG == 32 in __sw_hweight64()
48 #elif BITS_PER_LONG == 64 in __sw_hweight64()
/tools/include/asm-generic/
A 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)
/tools/include/linux/
A 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()
A Dbits.h10 #define BIT_MASK(nr) (UL(1) << ((nr) % BITS_PER_LONG))
11 #define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
A Dbitmap.h27 #define BITMAP_FIRST_WORD_MASK(start) (~0UL << ((start) & (BITS_PER_LONG - 1)))
28 #define BITMAP_LAST_WORD_MASK(nbits) (~0UL >> (-(nbits) & (BITS_PER_LONG - 1)))
30 #define bitmap_size(nbits) (ALIGN(nbits, BITS_PER_LONG) / BITS_PER_BYTE)
A Dbitops.h11 #ifndef BITS_PER_LONG
12 # define BITS_PER_LONG __WORDSIZE macro
/tools/perf/util/
A 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()
171 #if BITS_PER_LONG == 64
348 #if BITS_PER_LONG == 64 in machine__findnew_vdso()
A Dauxtrace.h472 #if BITS_PER_LONG == 32 in auxtrace_mmap__read_head()
488 #if BITS_PER_LONG == 32 in auxtrace_mmap__write_tail()
A Dhist.c78 const unsigned int unresolved_col_width = BITS_PER_LONG / 4; in hists__set_unres_dso_col_len()
88 const unsigned int unresolved_col_width = BITS_PER_LONG / 4; in hists__calc_col_len()
102 symlen += BITS_PER_LONG / 4 + 2 + 3; in hists__calc_col_len()
126 symlen += BITS_PER_LONG / 4 + 2 + 3; in hists__calc_col_len()
141 symlen += BITS_PER_LONG / 4 + 2 + 3; in hists__calc_col_len()
226 hists__new_col_len(hists, HISTC_ADDR, BITS_PER_LONG / 4 + 2); in hists__calc_col_len()
A Dannotate.c1198 printf("%*" PRIx64 ": %" PRIu64 "\n", BITS_PER_LONG / 2, in symbol__annotate_hits()
1201 printf("%*s: %" PRIu64 "\n", BITS_PER_LONG / 2, "h->nr_samples", h->nr_samples); in symbol__annotate_hits()
1590 notes->src->widths.target = BITS_PER_LONG / 4; in annotation__update_column_widths()
A Dsort.c409 BITS_PER_LONG / 4 + 2, rip, o); in _hist_entry__sym_snprintf()
427 size_t len = BITS_PER_LONG / 4; in _hist_entry__sym_snprintf()
1374 size_t len = BITS_PER_LONG / 4; in _hist_entry__addr_snprintf()
2026 size_t len = BITS_PER_LONG / 4; in hist_entry__phys_daddr_snprintf()
/tools/testing/selftests/kvm/include/s390/
A Dfacility.h24 return test_bit(nr ^ (BITS_PER_LONG - 1), ptr); in test_bit_inv()
/tools/testing/selftests/kvm/x86/
A Dhwcr_msr_test.c41 for (bit = 0; bit < BITS_PER_LONG; bit++) in main()
/tools/perf/ui/browsers/
A Dmap.c119 char tmp[BITS_PER_LONG / 4]; in map__browse()
/tools/testing/radix-tree/
A Dtest.c50 assert(item->order < BITS_PER_LONG); in item_sanity()
/tools/testing/selftests/user_events/
A Dabi_test.c283 #if BITS_PER_LONG == 8 in TEST_F()
/tools/perf/util/scripting-engines/
A Dtrace-event-python.c1086 #if BITS_PER_LONG == 64 in tuple_set_s64()
1089 #if BITS_PER_LONG == 32 in tuple_set_s64()
1102 #if BITS_PER_LONG == 64 in tuple_set_u64()
1105 #if BITS_PER_LONG == 32 in tuple_set_u64()
/tools/testing/selftests/kvm/
A Ddirty_log_test.c48 # define BITOP_LE_SWIZZLE ((BITS_PER_LONG-1) & ~0x7)
/tools/testing/selftests/iommu/
A Diommufd_utils.h22 #define BITS_PER_LONG __BITS_PER_LONG macro
44 return 1UL & (addr[BIT_WORD(nr)] >> (nr & (BITS_PER_LONG - 1))); in test_bit()
/tools/perf/ui/
A Dhist.c1059 ret += 3 + BITS_PER_LONG / 4; in hists__sort_list_width()

Completed in 910 milliseconds

12