Function report | 
Source Code:lib\radix-tree.c | 
Create Date:2022-07-28 06:13:07 | 
| Last Modify:2022-05-21 10:04:37 | Copyright©Brick | 
| home page | Tree | 
| Annotation kernel can get tool activity | Download SCCT | Chinese | 
Name: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
Proto:int radix_tree_tag_get(const struct xarray *root, unsigned long index, unsigned int tag)
Type:int
Parameter:
| Type | Parameter | Name | 
|---|---|---|
| const struct xarray * | root | |
| unsigned long | index | |
| unsigned int | tag | 
| 1096 | If Not root_tag_get(root, tag) Then Return 0 | 
| 1099 | radix_tree_load_root(root, & node, & maxindex) | 
| 1103 | When radix_tree_is_internal_node(node) cycle | 
| 1106 | parent = entry_to_node(node) | 
| 1107 | offset = radix_tree_descend(parent, & node, index) | 
| 1111 | If node == RADIX_TREE_RETRY Then Break | 
| 1115 | Return 1 | 
| Name | Describe | 
|---|---|
| idr_replace | dr_replace() - replace pointer for given ID | 
| 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  |