Function report |
Source Code:lib\radix-tree.c |
Create Date:2022-07-28 06:12:54 |
Last Modify:2022-05-21 10:04:37 | Copyright©Brick |
home page | Tree |
Annotation kernel can get tool activity | Download SCCT | Chinese |
Name:radix_tree_descend
Proto:static unsigned int radix_tree_descend(const struct xa_node *parent, struct xa_node **nodep, unsigned long index)
Type:unsigned int
Parameter:
Type | Parameter | Name |
---|---|---|
const struct xa_node * | parent | |
struct xa_node ** | nodep | |
unsigned long | index |
98 | __rcu * entry = Dependency order vs. p above. (slots[offset]) |
101 | Return offset |
Name | Describe |
---|---|
__radix_tree_create | |
__radix_tree_lookup | |
radix_tree_tag_set | adix_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_clear | adix_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_get | adix_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 | adix_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 |
Source code conversion tool public plug-in interface | X |
---|---|
Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion |