函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

函数名称：一个radix树的收缩高度最小

函数原型：static inline bool radix_tree_shrink(struct xarray *root)

返回类型：bool

参数：

类型参数名称
struct xarray *root
480  bool shrunk = false
482  循环
483  node等于Dependency order vs. p above. (xa_head)
486  如果非radix_tree_is_internal_node(node)则退出
488  node等于entry_to_node(node)
494  如果count不等于1则退出
496  child等于Dependency order vs. p above. (slots[0])
497  如果非child则退出
505  如果非shift且is_idr(root)则退出
508  如果radix_tree_is_internal_node(child)则NULL at top of tree = NULL
518  xa_head等于child
519  如果is_idr(root)且非tag_get(node, The IDR API does not expose the tagging functionality of the radix tree* to users. Use tag 0 to track whether a node has free space below it., 0)则root_tag_clear(root, The IDR API does not expose the tagging functionality of the radix tree* to users. Use tag 0 to track whether a node has free space below it.)
540  count等于0
541  如果非radix_tree_is_internal_node(child)则
542  slots[0]等于RADIX_TREE_RETRY
545  WARN_ON_ONCE(!链表为空)
546  radix_tree_node_free(node)
547  shrunk = true
550  返回:shrunk
调用者
名称描述
delete_node