函数逻辑报告 |
Source Code:block\mq-deadline.c |
Create Date:2022-07-27 19:26:13 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:deadline_dispatch_requests selects the best request according to* read/write expire, fifo_batch, etc
函数原型:static struct request *__dd_dispatch_request(struct deadline_data *dd)
返回类型:struct request
参数:
类型 | 参数 | 名称 |
---|---|---|
struct deadline_data * | dd |
277 | 如果非链表为空则 |
279 | 删除链表项并重新初始化 |
280 | 转到:done |
289 | rq等于For the specified data direction, return the next request to* dispatch using sector position sorted lists. |
290 | 如果非rq则rq等于For the specified data direction, return the next request to* dispatch using sector position sorted lists. |
302 | 如果reads则 |
303 | BUG_ON(RB_EMPTY_ROOT( & * requests (deadline_rq s) are present on both sort_list and fifo_list[generic data direction definitions ])) |
305 | 如果For the specified data direction, return the next request to* dispatch using arrival ordered lists.且 times reads have starved writes 自加大于等于writes_starved则转到:dispatch_writes |
311 | 转到:dispatch_find_request |
318 | 如果writes则 |
319 | dispatch_writes : |
320 | BUG_ON(RB_EMPTY_ROOT( & * requests (deadline_rq s) are present on both sort_list and fifo_list[WRITE])) |
322 | times reads have starved writes 等于0 |
326 | 转到:dispatch_find_request |
329 | 返回:NULL |
331 | dispatch_find_request : |
335 | next_rq等于For the specified data direction, return the next request to* dispatch using sector position sorted lists. |
343 | 否则 |
355 | 如果非rq则返回:NULL |
360 | dispatch_request : |
366 | done : |
372 | 返回:rq |
名称 | 描述 |
---|---|
dd_dispatch_request | One confusing aspect here is that we get called for a specific* hardware queue, but we may return a request that is for a* different hardware queue. This is because mq-deadline has shared* state for all hardware queues, in terms of sorting, FIFOs, etc. |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |