Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

Name:radix_tree_load_root

Proto:static unsigned radix_tree_load_root(const struct xarray *root, struct radix_tree_node **nodep, unsigned long *maxindex)

Type:unsigned

Parameter:

TypeParameterName
const struct xarray *root
struct radix_tree_node **nodep
unsigned long *maxindex
401  node = Dependency order vs. p above. (xa_head)
403  nodep = node
405  If Value is more likely to compile time(radix_tree_is_internal_node(node)) Then
406  node = entry_to_node(node)
407  maxindex = node_maxindex(node)
408  Return shift + adix-tree API starts here **
411  maxindex = 0
412  Return 0
Caller
NameDescribe
__radix_tree_create
__radix_tree_lookup
radix_tree_tag_setadix_tree_tag_set - set a tag on a radix tree node*@root: radix tree root*@index: index key*@tag: tag index* Set the search tag (which must be < RADIX_TREE_MAX_TAGS)* corresponding to @index in the radix tree. From
radix_tree_tag_clearadix_tree_tag_clear - clear a tag on a radix tree node*@root: radix tree root*@index: index key*@tag: tag index* Clear the search tag (which must be < RADIX_TREE_MAX_TAGS)* corresponding to @index in the radix tree
radix_tree_tag_getadix_tree_tag_get - get a tag on a radix tree node*@root: radix tree root*@index: index key*@tag: tag index (< RADIX_TREE_MAX_TAGS)* Return values:* 0: tag not present or not set* 1: tag set* Note that the return value of this function may not be relied
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