函数逻辑报告 |
Source Code:fs\eventpoll.c |
Create Date:2022-07-29 10:50:55 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:Adds a new entry to the tail of the list in a lockless way, i
函数原型:static inline bool list_add_tail_lockless(struct list_head *new, struct list_head *head)
返回类型:bool
参数:
类型 | 参数 | 名称 |
---|---|---|
struct list_head * | new | |
struct list_head * | head |
1145 | 返回:true |
名称 | 描述 |
---|---|
ep_poll_callback | This is the callback that is passed to the wait queue wakeup* mechanism |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |