函数逻辑报告 |
Source Code:block\bfq-wf2q.c |
Create Date:2022-07-27 19:35:42 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称:__bfq_lookup_next_entity - return the first eligible entity in @st
函数原型:static struct bfq_entity *__bfq_lookup_next_entity(struct bfq_service_tree *st, bool in_service)
返回类型:struct bfq_entity
参数:
| 类型 | 参数 | 名称 |
|---|---|---|
| struct bfq_service_tree * | st | |
| bool | in_service |
| 1414 | 如果RB_EMPTY_ROOT( & ree for active entities (i.e., those backlogged) )则返回:NULL |
| 1433 | 如果非in_service则bfq_update_vtime(st, new_vtime) |
| 1436 | entity等于q_first_active_entity - find the eligible entity with* the smallest finish time*@st: the service tree to select from |
| 1438 | 返回:entity |
| 名称 | 描述 |
|---|---|
| bfq_lookup_next_entity |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |