函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\rbtree.c Create Date:2022-07-27 07:10:01
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称:rb_next

函数原型:struct rb_node *rb_next(const struct rb_node *node)

返回类型:struct rb_node

参数:

类型参数名称
const struct rb_node *node
496  如果'empty' nodes are nodes that are known not to be inserted in an rbtree (node)则返回:NULL
503  如果rb_right
504  node等于rb_right
505 rb_left循环
506  node等于rb_left
507  返回:node
517 parent等于rb_parent(node)且node恒等于rb_right循环
518  node等于parent
520  返回:parent
调用者
名称描述
timerqueue_iterate_nextmerqueue_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_nextLike rb_entry_next_safe() for the @cpu subtree.
build_probe_listFor a given range in vma, build a list of probes that need to be inserted.
next_se
shared_policy_replaceReplace a policy range.
mpol_free_shared_policyFree a backing policy store on inode delete.
deadline_latter_requestget the request after `rq' in sector-sorted order
bfq_find_next_rq
bfqq_find_close
bfq_idle_extractq_idle_extract - extract an entity from the idle tree.*@st: the service tree of the owning @entity.*@entity: the entity being removed.
bfq_find_deepestq_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_serialAllocate a serial number for a key. These are assigned randomly to avoid* security issues through covert channel problems.
key_serial_nextImplement "/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_procp_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_mmaphandle mapping creation for uClinux
elv_rb_latter_request
key_garbage_collectorReaper for unused keys.
ep_free