• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef BLK_MQ_SCHED_H
3 #define BLK_MQ_SCHED_H
4 
5 #include "blk-mq.h"
6 #include "blk-mq-tag.h"
7 
8 void blk_mq_sched_assign_ioc(struct request *rq);
9 
10 void blk_mq_sched_request_inserted(struct request *rq);
11 bool blk_mq_sched_try_merge(struct request_queue *q, struct bio *bio,
12 		unsigned int nr_segs, struct request **merged_request);
13 bool __blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio,
14 		unsigned int nr_segs);
15 bool blk_mq_sched_try_insert_merge(struct request_queue *q, struct request *rq,
16 				   struct list_head *free);
17 void blk_mq_sched_mark_restart_hctx(struct blk_mq_hw_ctx *hctx);
18 void blk_mq_sched_restart(struct blk_mq_hw_ctx *hctx);
19 
20 void blk_mq_sched_insert_request(struct request *rq, bool at_head,
21 				 bool run_queue, bool async);
22 void blk_mq_sched_insert_requests(struct blk_mq_hw_ctx *hctx,
23 				  struct blk_mq_ctx *ctx,
24 				  struct list_head *list, bool run_queue_async);
25 
26 void blk_mq_sched_dispatch_requests(struct blk_mq_hw_ctx *hctx);
27 
28 int blk_mq_init_sched(struct request_queue *q, struct elevator_type *e);
29 void blk_mq_exit_sched(struct request_queue *q, struct elevator_queue *e);
30 void blk_mq_sched_free_requests(struct request_queue *q);
31 
32 static inline bool
blk_mq_sched_bio_merge(struct request_queue * q,struct bio * bio,unsigned int nr_segs)33 blk_mq_sched_bio_merge(struct request_queue *q, struct bio *bio,
34 		unsigned int nr_segs)
35 {
36 	if (blk_queue_nomerges(q) || !bio_mergeable(bio))
37 		return false;
38 
39 	return __blk_mq_sched_bio_merge(q, bio, nr_segs);
40 }
41 
42 static inline bool
blk_mq_sched_allow_merge(struct request_queue * q,struct request * rq,struct bio * bio)43 blk_mq_sched_allow_merge(struct request_queue *q, struct request *rq,
44 			 struct bio *bio)
45 {
46 	struct elevator_queue *e = q->elevator;
47 
48 	if (e && e->type->ops.allow_merge)
49 		return e->type->ops.allow_merge(q, rq, bio);
50 
51 	return true;
52 }
53 
blk_mq_sched_completed_request(struct request * rq,u64 now)54 static inline void blk_mq_sched_completed_request(struct request *rq, u64 now)
55 {
56 	struct elevator_queue *e = rq->q->elevator;
57 
58 	if (e && e->type->ops.completed_request)
59 		e->type->ops.completed_request(rq, now);
60 }
61 
blk_mq_sched_requeue_request(struct request * rq)62 static inline void blk_mq_sched_requeue_request(struct request *rq)
63 {
64 	struct request_queue *q = rq->q;
65 	struct elevator_queue *e = q->elevator;
66 
67 	if ((rq->rq_flags & RQF_ELVPRIV) && e && e->type->ops.requeue_request)
68 		e->type->ops.requeue_request(rq);
69 }
70 
blk_mq_sched_has_work(struct blk_mq_hw_ctx * hctx)71 static inline bool blk_mq_sched_has_work(struct blk_mq_hw_ctx *hctx)
72 {
73 	struct elevator_queue *e = hctx->queue->elevator;
74 
75 	if (e && e->type->ops.has_work)
76 		return e->type->ops.has_work(hctx);
77 
78 	return false;
79 }
80 
blk_mq_sched_needs_restart(struct blk_mq_hw_ctx * hctx)81 static inline bool blk_mq_sched_needs_restart(struct blk_mq_hw_ctx *hctx)
82 {
83 	return test_bit(BLK_MQ_S_SCHED_RESTART, &hctx->state);
84 }
85 
86 #endif
87