函数逻辑报告 |
Source Code:block\bfq-wf2q.c |
Create Date:2022-07-27 19:35:01 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称：q_update_active_node - recalculate min_start.*@node: the node to update.*@node may have changed position or one of its children may have moved,* this function updates its min_start value. The left and right subtrees
函数原型：static void bfq_update_active_node(struct rb_node *node)
返回类型：void
参数：
| 类型 | 参数 | 名称 |
|---|---|---|
| struct rb_node * | node |
| 427 | entity等于rb_entry(node, structbfq_entity, rb_node) |
| 429 | * minimum start time of the (active) subtree rooted at this * entity; used for O(log N) lookups into active trees等于 B-WF2Q+ start and finish timestamps [sectors/weight] |
| 名称 | 描述 |
|---|---|
| bfq_update_active_tree | q_update_active_tree - update min_start for the whole active tree |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持：c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现：逻辑报告 代码生成和批量转换代码 |