Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:include\linux\radix-tree.h Create Date:2022-07-28 05:42:21
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:adix_tree_next_slot - find next slot in chunk*@slot: pointer to current slot*@iter: pointer to interator state*@flags: RADIX_TREE_ITER_*, should be constant* Returns: pointer to next slot, or NULL if there no more left

Proto:static __always_inline void __rcu **radix_tree_next_slot(void __rcu **slot, struct radix_tree_iter *iter, unsigned flags)

Type:void

Parameter:

TypeParameterName
void __rcu **slot
struct radix_tree_iter *iter
unsignedflags
388  If flags & RADIX_TREE_ITER_TAGGED Then
389  tags >>= 1
390  If Value for the false possibility is greater at compile time(!tags) Then Return NULL
392  If Value is more likely to compile time(tags & 1ul) Then
393  index = __radix_tree_iter_add(iter, 1)
394  slot++
395  Go to found
397  If Not (flags & RADIX_TREE_ITER_CONTIG) Then
398  offset = __ffs - find first set bit in word*@word: The word to search* Undefined if no bit exists, so code should check against 0 first.
400  tags >>= offset++
401  index = __radix_tree_iter_add(iter, offset)
402  slot += offset
403  Go to found
405  Else
406  count = adix_tree_chunk_size - get current chunk size*@iter: pointer to radix tree iterator* Returns: current chunk size
408  When --count > 0 cycle
409  slot++
410  index = __radix_tree_iter_add(iter, 1)
412  If Value is more likely to compile time( * slot) Then Go to found
414  If flags & RADIX_TREE_ITER_CONTIG Then
416  next_index = 0
417  Break
421  Return NULL
423  found :
424  Return slot