Function report |
Source Code:lib\radix-tree.c |
Create Date:2022-07-28 06:12:55 |
Last Modify:2022-05-21 10:04:37 | Copyright©Brick |
home page | Tree |
Annotation kernel can get tool activity | Download SCCT | Chinese |
Name:root_tag_get
Proto:static inline int root_tag_get(const struct xarray *root, unsigned tag)
Type:int
Parameter:
Type | Parameter | Name |
---|---|---|
const struct xarray * | root | |
unsigned | tag |
144 | Return private: The rest of the data structure is not to be used directly. & 1 << tag + The top bits of xa_flags are used to store the root tags |
Name | Describe |
---|---|
radix_tree_extend | Extend a radix tree so it can store key @index. |
node_tag_get | |
node_tag_set | |
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 |
node_tag_clear | |
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 |
radix_tree_tagged | adix_tree_tagged - test whether any items in the tree are tagged*@root: radix tree root*@tag: tag to test |
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 |