函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\radix-tree.c Create Date:2022-07-27 07:10:18
Last Modify:2022-05-21 10:04:37 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称：__radix_tree_create

函数原型：static int __radix_tree_create(struct xarray *root, unsigned long index, struct radix_tree_node **nodep, void __rcu ***slotp)

返回类型：int

参数：

类型参数名称
struct xarray *root
unsigned longindex
struct radix_tree_node **nodep
void __rcu ***slotp
612  node等于NULL
613  void __rcu * * slot = (void __rcu * * ) & xa_head
615  offset等于0
616  max等于index
617  gfp等于root_gfp_mask(root)
619  shift等于radix_tree_load_root(root, & child, & maxindex)
622  如果max大于maxindex则
623  error等于Extend a radix tree so it can store key @index.
624  如果error小于0则返回:error
626  shift等于error
627  child等于Dependency order vs. p above. (xa_head)
630  当shift大于0循环
631  shift减等于adix-tree API starts here **
632  如果(child == NULL)则
634  child等于This assumes that the caller has performed appropriate preallocation, and* that the caller has pinned this thread of control to the current CPU.
636  如果非child则返回:负ENOMEM
638  cu_assign_pointer() - assign to RCU-protected pointer*@p: pointer to assign to*@v: value to assign (publish)* Assigns the specified value to the specified RCU-protected* pointer, ensuring that any concurrent RCU readers will see* any prior initialization( * slot, node_to_entry(child))
639  如果node则count自加
641  否则如果非radix_tree_is_internal_node(child)则退出
645  node等于entry_to_node(child)
646  offset等于radix_tree_descend(node, & child, index)
647  slot等于slots[offset]
650  如果nodep则nodep等于node
652  如果slotp则slotp等于slot
654  返回:0
调用者
名称描述
radix_tree_insert在radix树中插入节点