blk-mq-sched.h 2.8 KB

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