Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

Name:bfq_request_merged

Proto:static void bfq_request_merged(struct request_queue *q, struct request *req, enum elv_merge type)

Type:void

Parameter:

TypeParameterName
struct request_queue *q
struct request *req
enum elv_mergetype
2266  If type == ELEVATOR_FRONT_MERGE && rb_prev( & sort/lookup ) && lk_rq_pos() : the current sector* blk_rq_bytes() : bytes left in the entire request* blk_rq_cur_bytes() : bytes left in the current segment* blk_rq_err_bytes() : bytes left till the next error boundary* blk_rq_sectors() : sectors left in the entire < lk_rq_pos() : the current sector* blk_rq_bytes() : bytes left in the entire request* blk_rq_cur_bytes() : bytes left in the current segment* blk_rq_err_bytes() : bytes left till the next error boundary* blk_rq_sectors() : sectors left in the entire Then
2271  bfqq = bfq_init_rq(req)
2275  If Not bfqq Then Return
2278  bfqd = parent bfq_data
2281  elv_rb_del( & sorted list of pending requests , req)
2282  RB-tree support functions for inserting/lookup/removal of requests* in a sorted RB tree.
2285  prev = fifo isn't expired, next request to serve
2286  next_rq = 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.
2288  fifo isn't expired, next request to serve = next_rq