Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\radix-tree.c Create Date:2022-07-28 06:12:55
Last Modify:2022-05-21 10:04:37 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:adix_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.

Proto:static __always_inline unsigned long radix_tree_find_next_bit(struct xa_node *node, unsigned int tag, unsigned long offset)

Type:unsigned long

Parameter:

TypeParameterName
struct xa_node *node
unsigned inttag
unsigned longoffset
192  addr = tags[tag]
194  If offset < RADIX_TREE_MAP_SIZE Then
197  addr += offset / BITS_PER_LONG
198  tmp = addr >> offset % BITS_PER_LONG
199  If tmp Then Return __ffs - find first set bit in word*@word: The word to search* Undefined if no bit exists, so code should check against 0 first. + offset
201  offset = offset + BITS_PER_LONG & ~(BITS_PER_LONG - 1)
202  When offset < RADIX_TREE_MAP_SIZE cycle
203  tmp = *++addr
204  If tmp Then Return __ffs - find first set bit in word*@word: The word to search* Undefined if no bit exists, so code should check against 0 first. + offset
206  offset += BITS_PER_LONG
209  Return RADIX_TREE_MAP_SIZE
Caller
NameDescribe
radix_tree_next_chunkadix_tree_next_chunk - find next chunk of slots for iteration*@root: radix tree root*@iter: iterator state*@flags: RADIX_TREE_ITER_* flags and tag index* Returns: pointer to chunk first slot, or NULL if iteration is over
idr_get_free