函数逻辑报告 |
Source Code:fs\io_uring.c |
Create Date:2022-07-29 10:54:35 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:Poll for a minimum of 'min' events. Note that if min == 0 we consider that a* non-spinning poll check - we'll still enter the driver poll loop, but only* as a non-spinning completion check.
函数原型:static int io_iopoll_getevents(struct io_ring_ctx *ctx, unsigned int *nr_events, long min)
返回类型:int
参数:
类型 | 参数 | 名称 |
---|---|---|
struct io_ring_ctx * | ctx | |
unsigned int * | nr_events | |
long | min |
1252 | 当非链表为空且非need_resched()循环 |
1262 | 返回:1 |
名称 | 描述 |
---|---|
io_iopoll_reap_events | We can't just wait for polled events to come to us, we have to actively* find and complete them. |
io_iopoll_check | |
io_sq_thread |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |