函数逻辑报告 |
Source Code:lib\klist.c |
Create Date:2022-07-27 07:13:39 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称:knode_dead
函数原型:static bool knode_dead(struct klist_node *knode)
返回类型:bool
参数:
| 类型 | 参数 | 名称 |
|---|---|---|
| struct klist_node * | knode |
| 55 | 返回: never access directly 按位与Use the lowest bit of n_klist to mark deleted nodes and exclude* dead ones from iteration. |
| 名称 | 描述 |
|---|---|
| knode_set_klist | |
| knode_kill | |
| klist_release | |
| klist_prev | klist_prev - Ante up prev node in list.*@i: Iterator structure.* First grab list lock. Decrement the reference count of the previous* node, if there was one. Grab the prev node, increment its reference* count, drop the lock, and return that prev node. |
| klist_next | 列表的下一个节点 |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |