函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:block\bfq-iosched.c Create Date:2022-07-27 19:30:07
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称：bfq_find_next_rq

函数原型：static struct request *bfq_find_next_rq(struct bfq_data *bfqd, struct bfq_queue *bfqq, struct request *last)

返回类型：struct request

参数：

类型参数名称
struct bfq_data *bfqd
struct bfq_queue *bfqq
struct request *last
894  rbnext等于rb_next( & sort/lookup )
895  rbprev等于rb_prev( & sort/lookup )
896  struct request * next, * prev = NULL
899  next等于Return expired entry, or NULL to just start from scratch in rbtree.
900  如果next则返回:next
903  如果rbprev则prev等于rb_entry_rq(rbprev)
906  如果rbnext则next等于rb_entry_rq(rbnext)
908  否则
909  rbnext等于This function returns the first node (in sort order) of the tree.
910  如果rbnext且rbnext不等于 sort/lookup 则next等于rb_entry_rq(rbnext)
914  返回:Lifted from AS - choose which of rq1 and rq2 that is best served now.* We choose the request that is closer to the head right now. Distance* behind the head is penalized and only allowed to a certain extent.
调用者
名称描述
bfq_remove_request