Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:block\bfq-iosched.c Create Date:2022-07-28 17:54:22
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:bfq_find_next_rq

Proto:static struct request *bfq_find_next_rq(struct bfq_data *bfqd, struct bfq_queue *bfqq, struct request *last)

Type:struct request

Parameter:

TypeParameterName
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  If next Then Return next
903  If rbprev Then prev = rb_entry_rq(rbprev)
906  If rbnext Then next = rb_entry_rq(rbnext)
908  Else
909  rbnext = This function returns the first node (in sort order) of the tree.
910  If rbnext && rbnext != sort/lookup Then next = rb_entry_rq(rbnext)
914  Return 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.
Caller
NameDescribe
bfq_remove_request