函数逻辑报告 |
Source Code:lib\rbtree.c |
Create Date:2022-07-27 07:10:00 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:This function returns the first node (in sort order) of the tree.
函数原型:struct rb_node *rb_first(const struct rb_root *root)
返回类型:struct rb_node
参数:
类型 | 参数 | 名称 |
---|---|---|
const struct rb_root * | root |
471 | 如果非n则返回:NULL |
475 | 返回:n |
名称 | 描述 |
---|---|
check | |
check_augmented | |
rbtree_test_init | |
stat_seq_start | |
stat_seq_next | |
ctx_event_to_rotate | pick an event from the flexible_groups to rotate |
first_se | |
mpol_free_shared_policy | Free a backing policy store on inode delete. |
key_user_first | |
aa_labelset_destroy | aa_labelset_destroy - remove all labels from the label set*@ls: label set to cleanup (NOT NULL)* Labels that are removed from the set may still exist beyond the set* being destroyed depending on their reference counting |
pm_show_wakelocks | |
do_mmap | handle mapping creation for uClinux |
bfq_find_next_rq | |
key_garbage_collector | Reaper for unused keys. |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |