函数逻辑报告 |
Source Code:lib\rbtree.c |
Create Date:2022-07-27 07:10:01 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:rb_next
函数原型:struct rb_node *rb_next(const struct rb_node *node)
返回类型:struct rb_node
参数:
类型 | 参数 | 名称 |
---|---|---|
const struct rb_node * | node |
503 | 如果rb_right则 |
520 | 返回:parent |
名称 | 描述 |
---|---|
timerqueue_iterate_next | merqueue_iterate_next - Returns the timer after the provided timer*@node: Pointer to a timer.* Provides the timer that is after the given node. This is used, when* necessary, to iterate through the list of timers in a timer list |
check | |
check_augmented | |
rbtree_test_init | |
pm_show_wakelocks | |
stat_seq_start | |
stat_seq_next | |
perf_event_groups_next | Like rb_entry_next_safe() for the @cpu subtree. |
build_probe_list | For a given range in vma, build a list of probes that need to be inserted. |
next_se | |
shared_policy_replace | Replace a policy range. |
mpol_free_shared_policy | Free a backing policy store on inode delete. |
deadline_latter_request | get the request after `rq' in sector-sorted order |
bfq_find_next_rq | |
bfqq_find_close | |
bfq_idle_extract | q_idle_extract - extract an entity from the idle tree.*@st: the service tree of the owning @entity.*@entity: the entity being removed. |
bfq_find_deepest | q_find_deepest - find the deepest node that an extraction can modify.*@node: the node being removed.* Do the first step of an extraction in an rb tree, looking for the* node that will replace @node, and returning the deepest node that |
key_alloc_serial | Allocate a serial number for a key. These are assigned randomly to avoid* security issues through covert channel problems. |
key_serial_next | Implement "/proc/keys" to provide a list of the keys on the system that* grant View permission to the caller. |
find_ge_key | |
__key_user_next | |
key_user_next | |
ep_show_fdinfo | |
ep_loop_check_proc | p_loop_check_proc - Callback function to be passed to the @ep_call_nested()* API, to verify that adding an epoll file inside another* epoll structure, does not violate the constraints, in* terms of closed loops, or too deep chains (which can |
__pick_next_entity | |
do_mmap | handle mapping creation for uClinux |
elv_rb_latter_request | |
key_garbage_collector | Reaper for unused keys. |
ep_free |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |