Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:arch\x86\include\asm\bitops.h Create Date:2022-07-28 05:34:10
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:__ffs - find first set bit in word*@word: The word to search* Undefined if no bit exists, so code should check against 0 first.

Proto:static __always_inline unsigned long __ffs(unsigned long word)

Type:unsigned long

Parameter:

TypeParameterName
unsigned longword
235  asm("rep; bsf %1,%0":"=r"(word):"rm"(word))
238  Return word
Caller
NameDescribe
radix_tree_find_next_bitadix_tree_find_next_bit - find the next set bit in a memory region*@addr: The address to base the search on*@size: The bitmap size in bits*@offset: The bitnumber to start searching at* Unrollable variant of find_next_bit() for constant size arrays.
xa_store_rangexa_store_range() - Store this entry at a range of indices in the XArray
__ctzsi2
__ctzdi2
_find_next_bitThis is a common helper function for find_next_bit, find_next_zero_bit, and* find_next_and_bit. The differences are:* - The "invert" argument, which is XORed with each fetched word before* searching it for one bits.
gcdgcd - calculate and return the greatest common divisor of 2 unsigned longs*@a: first value*@b: second value
assoc_array_insert_mid_shortcutHandle insertion into the middle of a shortcut.
irq_gc_get_irq_data
__next_base
pcpu_block_updatepcpu_block_update - updates a block given a free area*@block: block of interest*@start: start offset in block*@end: end offset in block* Updates a block given a known free area. The region [start, end) is
pcpu_find_zero_areapcpu_find_zero_area - modified from bitmap_find_next_zero_area_off()*@map: the address to base the search on*@size: the bitmap size in bits*@start: the bitnumber to start searching at*@nr: the number of zeroed bits we're looking for*@align_mask: alignment
__free_pages_memory
keyring_diff_objectsCompare the index keys of a pair of objects and determine the bit position* at which they differ - if they differ.
sched_find_first_bitEvery architecture must define this function. It's the fastest* way of searching a 100-bit bitmap. It's guaranteed that at least* one of the 100 bits is cleared.
__ffs64__ffs64 - find first set bit in a 64 bit word*@word: The 64 bit word* On 64 bit arches this is a synomyn for __ffs* The result is not defined if no bits are set, so check that @word* is non-zero before calling this.