Home
last modified time | relevance | path

Searched refs:__ffs (Results 1 – 12 of 12) sorted by relevance

/include/asm-generic/bitops/
A Dsched.h17 return __ffs(b[0]); in sched_find_first_bit()
18 return __ffs(b[1]) + 64; in sched_find_first_bit()
21 return __ffs(b[0]); in sched_find_first_bit()
23 return __ffs(b[1]) + 32; in sched_find_first_bit()
25 return __ffs(b[2]) + 64; in sched_find_first_bit()
26 return __ffs(b[3]) + 96; in sched_find_first_bit()
A Dffz.h11 #define ffz(x) __ffs(~(x))
A Dbuiltin-__ffs.h11 static __always_inline unsigned int __ffs(unsigned long word) in __ffs() function
A D__ffs.h45 #define __ffs(word) generic___ffs(word) macro
/include/linux/
A Dcount_zeros.h50 return (x != 0) ? __ffs(x) : COUNT_TRAILING_ZEROS_0; in count_trailing_zeros()
A Dfind.h70 return val ? __ffs(val) : size; in find_next_bit()
100 return val ? __ffs(val) : size; in find_next_and_bit()
131 return val ? __ffs(val) : size; in find_next_andnot_bit()
161 return val ? __ffs(val) : size; in find_next_or_bit()
211 return val ? __ffs(val) : size; in find_first_bit()
320 return val ? __ffs(val) : size; in find_first_and_bit()
344 return val ? __ffs(val) : size; in find_first_andnot_bit()
369 return val ? __ffs(val) : size; in find_first_and_and_bit()
574 return val ? __ffs(val) : size; in find_next_bit_le()
A Dbitops.h274 return __ffs((u32)(word >> 32)) + 32; in __ffs64()
278 return __ffs((unsigned long)word); in __ffs64()
291 return word ? __ffs(word) : BITS_PER_LONG; in fns()
A Diova.h50 return __ffs(iovad->granule); in iova_shift()
A Dradix-tree.h410 unsigned offset = __ffs(iter->tags); in radix_tree_next_slot()
A Dxarray.h1754 return __ffs(data); in xas_find_chunk()
A Dmm.h4176 #define PP_DMA_INDEX_BITS MIN(32, __ffs(POISON_POINTER_DELTA) - PP_DMA_INDEX_SHIFT)
/include/sound/
A Dpcm_params.h50 return __ffs(mask->bits[i]) + (i << 5); in snd_mask_min()

Completed in 31 milliseconds