radix_tree_load_root

函数名称：radix_tree_load_root

函数原型：static unsigned radix_tree_load_root(const struct xarray *root, struct radix_tree_node **nodep, unsigned long *maxindex)

返回类型：unsigned

参数：

类型	参数	名称
const struct xarray *	root
struct radix_tree_node **	nodep
unsigned long *	maxindex

401

node等于Dependency order vs. p above. (xa_head)

403

nodep等于node

405

如果此条件成立可能性大(为编译器优化)(radix_tree_is_internal_node(node))则

406

node等于entry_to_node(node)

407

maxindex等于node_maxindex(node)

408

返回:shift加adix-tree API starts here **

411

maxindex等于0

412

返回:0

**调用者**
名称	描述
__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	在radix树中找到下一个块的迭代
idr_get_free

源代码转换工具开放的插件接口	X
支持：c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现：逻辑报告代码生成和批量转换代码