函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:include\linux\radix-tree.h Create Date:2022-07-27 06:43:52
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称:radix_tree_is_internal_node

函数原型:static inline bool radix_tree_is_internal_node(void *ptr)

返回类型:bool

参数:

类型参数名称
void *ptr
45  返回:ptr按位与The bottom two bits of the slot determine how the remaining bits in the* slot are interpreted:* 00 - data pointer* 10 - internal entry* x1 - value entry* The internal entry may be a pointer to the next level in the tree, a* sibling entry, or an indicator 的值恒等于RADIX_TREE_INTERNAL_NODE
调用者
名称描述
radix_tree_node_allocThis assumes that the caller has performed appropriate preallocation, and* that the caller has pinned this thread of control to the current CPU.
radix_tree_load_root
radix_tree_extendExtend a radix tree so it can store key @index.
radix_tree_shrink一个radix树的收缩高度最小
__radix_tree_create
radix_tree_insert在radix树中插入节点
__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_chunk在radix树中找到下一个块的迭代
radix_tree_gang_lookupadix_tree_gang_lookup - perform multiple lookup on a radix tree*@root: radix tree root*@results: where the results of the lookup are placed*@first_index: start the lookup from this key*@max_items: place up to this many items at *results
radix_tree_gang_lookup_tagadix_tree_gang_lookup_tag - perform multiple lookup on a radix tree* based on a tag*@root: radix tree root*@results: where the results of the lookup are placed*@first_index: start the lookup from this key*@max_items: place up to this many items at
idr_get_free
idr_destroydr_destroy - release all internal memory from an IDR*@idr: idr handle* After this function is called, the IDR is empty, and may be reused or* the data structure containing it may be freed
radix_tree_deref_retry检查radix_tree_deref_slot