函数逻辑报告 |
Source Code:block\bfq-wf2q.c |
Create Date:2022-07-27 19:35:07 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称: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
函数原型:static struct rb_node *bfq_find_deepest(struct rb_node *node)
返回类型:struct rb_node
参数:
类型 | 参数 | 名称 |
---|---|---|
struct rb_node * | node |
563 | 否则 |
571 | 返回:deepest |
名称 | 描述 |
---|---|
bfq_active_extract | q_active_extract - remove an entity from the active tree.*@st: the service_tree containing the tree.*@entity: the entity being removed. |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |