函数逻辑报告 |
Source Code:include\linux\rbtree.h |
Create Date:2022-07-27 06:39:32 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:rb_insert_color_cached
函数原型:static inline void rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root, bool leftmost)
返回类型:void
参数:
类型 | 参数 | 名称 |
---|---|---|
struct rb_node * | node | |
struct rb_root_cached * | root | |
bool | leftmost |
139 | 如果leftmost则rb_leftmost等于node |
141 | rb_insert_color(node, & rb_root) |
名称 | 描述 |
---|---|
timerqueue_add | 添加定时器到时钟队列 |
insert_cached | |
__enqueue_entity | Enqueue an entity into the rb-tree: |
__enqueue_dl_entity | |
rt_mutex_enqueue | |
rt_mutex_enqueue_pi | |
tg_service_queue_add | |
bfq_weights_tree_add | If the weight-counter tree passed as input contains no counter for* the weight of the input queue, then add that counter; otherwise just* increment the existing counter.* Note that weight-counter trees contain few nodes in mostly symmetric* scenarios |
ep_rbtree_insert |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |