Home
last modified time | relevance | path

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

/external/linux-tools-perf/src/tools/perf/util/include/linux/
Dbitops.h12 #define BITS_PER_LONG __WORDSIZE macro
32 addr[nr / BITS_PER_LONG] |= 1UL << (nr % BITS_PER_LONG); in set_bit()
37 addr[nr / BITS_PER_LONG] &= ~(1UL << (nr % BITS_PER_LONG)); in clear_bit()
42 return ((1UL << (nr % BITS_PER_LONG)) & in test_bit()
43 (((unsigned long *)addr)[nr / BITS_PER_LONG])) != 0; in test_bit()
51 #define BITOP_WORD(nr) ((nr) / BITS_PER_LONG)
63 #if BITS_PER_LONG == 64 in __ffs()
100 while (size & ~(BITS_PER_LONG-1)) { in find_first_bit()
103 result += BITS_PER_LONG; in find_first_bit()
104 size -= BITS_PER_LONG; in find_first_bit()
[all …]
Dbitmap.h13 ((nbits) % BITS_PER_LONG) ? \
14 (1UL<<((nbits) % BITS_PER_LONG))-1 : ~0UL \
18 (__builtin_constant_p(nbits) && (nbits) <= BITS_PER_LONG)
/external/f2fs-tools/lib/
Dlibf2fs.c149 #if BITS_PER_LONG == 64 in __ffs()
180 unsigned long result = offset & ~(BITS_PER_LONG-1); in find_next_bit()
186 offset %= BITS_PER_LONG; in find_next_bit()
190 if (size < BITS_PER_LONG) in find_next_bit()
194 size -= BITS_PER_LONG; in find_next_bit()
195 result += BITS_PER_LONG; in find_next_bit()
197 while (size & ~(BITS_PER_LONG-1)) { in find_next_bit()
200 result += BITS_PER_LONG; in find_next_bit()
201 size -= BITS_PER_LONG; in find_next_bit()
208 tmp &= (~0UL >> (BITS_PER_LONG - size)); in find_next_bit()
/external/linux-tools-perf/src/include/linux/
Dhash.h25 #if BITS_PER_LONG == 32
28 #elif BITS_PER_LONG == 64
76 #if BITS_PER_LONG == 64 in hash32_ptr()
/external/fio/
Dhash.h21 #if BITS_PER_LONG == 32
24 #elif BITS_PER_LONG == 64
37 #if BITS_PER_LONG == 64 in __hash_long()
63 return __hash_long(val) >> (BITS_PER_LONG - bits); in hash_long()
/external/linux-tools-perf/src/tools/perf/util/
Dhweight.c21 #if BITS_PER_LONG == 32 in hweight64()
23 #elif BITS_PER_LONG == 64 in hweight64()
Dbitmap.c12 int k, w = 0, lim = bits/BITS_PER_LONG; in __bitmap_weight()
17 if (bits % BITS_PER_LONG) in __bitmap_weight()
Dhist.c60 const unsigned int unresolved_col_width = BITS_PER_LONG / 4; in hists__set_unres_dso_col_len()
70 const unsigned int unresolved_col_width = BITS_PER_LONG / 4; in hists__calc_col_len()
82 symlen += BITS_PER_LONG / 4 + 2 + 3; in hists__calc_col_len()
106 symlen += BITS_PER_LONG / 4 + 2 + 3; in hists__calc_col_len()
120 symlen += BITS_PER_LONG / 4 + 2 + 3; in hists__calc_col_len()
Dsort.c200 BITS_PER_LONG / 4 + 2, ip, o); in _hist_entry__sym_snprintf()
217 size_t len = BITS_PER_LONG / 4; in _hist_entry__sym_snprintf()
289 return repsep_snprintf(bf, size, "%-#*llx", BITS_PER_LONG / 4, self->ip); in hist_entry__srcline_snprintf()
Dannotate.c1209 printf("%*" PRIx64 ": %" PRIu64 "\n", BITS_PER_LONG / 2, in symbol__annotate_hits()
1211 printf("%*s: %" PRIu64 "\n", BITS_PER_LONG / 2, "h->sum", h->sum); in symbol__annotate_hits()
Dprobe-finder.c351 #define BYTES_TO_BITS(nb) ((nb) * BITS_PER_LONG / sizeof(long))
Dsession.c1295 #if BITS_PER_LONG == 64
/external/fio/crc/
Dcrc32c-intel.c25 #if BITS_PER_LONG == 64
58 #if BITS_PER_LONG == 64 in crc32c_intel()
/external/fio/lib/
Dprio_tree.c50 static unsigned long index_bits_to_maxindex[BITS_PER_LONG];
231 mask = 1UL << (BITS_PER_LONG - 1); in prio_tree_insert()
319 iter->mask = 1UL << (BITS_PER_LONG - 1); in prio_tree_left()
361 iter->mask = 1UL << (BITS_PER_LONG - 1); in prio_tree_right()
Dffz.h8 #if BITS_PER_LONG == 64 in __ffs()
Daxmap.c27 #if BITS_PER_LONG == 64
29 #elif BITS_PER_LONG == 32
204 #if BITS_PER_LONG == 64
Dhweight.c23 #if BITS_PER_LONG == 32 in hweight64()
/external/f2fs-tools/include/
Df2fs_fs.h257 #define BITS_PER_LONG 64 macro
259 #define BITS_PER_LONG 32 macro
262 #define BIT_MASK(nr) (1 << (nr % BITS_PER_LONG))
263 #define BIT_WORD(nr) (nr / BITS_PER_LONG)
/external/linux-tools-perf/src/tools/perf/ui/browsers/
Dmap.c113 char tmp[BITS_PER_LONG / 4]; in map__browse()
/external/linux-tools-perf/src/tools/perf/ui/
Dhist.c282 ret += 3 + BITS_PER_LONG / 4; in hists__sort_list_width()