blk.h 7.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255
  1. #ifndef BLK_INTERNAL_H
  2. #define BLK_INTERNAL_H
  3. #include <linux/idr.h>
  4. /* Amount of time in which a process may batch requests */
  5. #define BLK_BATCH_TIME (HZ/50UL)
  6. /* Number of requests a "batching" process may submit */
  7. #define BLK_BATCH_REQ 32
  8. /* Max future timer expiry for timeouts */
  9. #define BLK_MAX_TIMEOUT (5 * HZ)
  10. extern struct kmem_cache *blk_requestq_cachep;
  11. extern struct kmem_cache *request_cachep;
  12. extern struct kobj_type blk_queue_ktype;
  13. extern struct ida blk_queue_ida;
  14. static inline void __blk_get_queue(struct request_queue *q)
  15. {
  16. kobject_get(&q->kobj);
  17. }
  18. int blk_init_rl(struct request_list *rl, struct request_queue *q,
  19. gfp_t gfp_mask);
  20. void blk_exit_rl(struct request_list *rl);
  21. void init_request_from_bio(struct request *req, struct bio *bio);
  22. void blk_rq_bio_prep(struct request_queue *q, struct request *rq,
  23. struct bio *bio);
  24. int blk_rq_append_bio(struct request_queue *q, struct request *rq,
  25. struct bio *bio);
  26. void blk_queue_bypass_start(struct request_queue *q);
  27. void blk_queue_bypass_end(struct request_queue *q);
  28. void blk_dequeue_request(struct request *rq);
  29. void __blk_queue_free_tags(struct request_queue *q);
  30. bool __blk_end_bidi_request(struct request *rq, int error,
  31. unsigned int nr_bytes, unsigned int bidi_bytes);
  32. void blk_rq_timed_out_timer(unsigned long data);
  33. void blk_rq_check_expired(struct request *rq, unsigned long *next_timeout,
  34. unsigned int *next_set);
  35. unsigned long blk_rq_timeout(unsigned long timeout);
  36. void blk_add_timer(struct request *req);
  37. void blk_delete_timer(struct request *);
  38. bool bio_attempt_front_merge(struct request_queue *q, struct request *req,
  39. struct bio *bio);
  40. bool bio_attempt_back_merge(struct request_queue *q, struct request *req,
  41. struct bio *bio);
  42. bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio,
  43. unsigned int *request_count);
  44. void blk_account_io_start(struct request *req, bool new_io);
  45. void blk_account_io_completion(struct request *req, unsigned int bytes);
  46. void blk_account_io_done(struct request *req);
  47. /*
  48. * Internal atomic flags for request handling
  49. */
  50. enum rq_atomic_flags {
  51. REQ_ATOM_COMPLETE = 0,
  52. REQ_ATOM_STARTED,
  53. };
  54. /*
  55. * EH timer and IO completion will both attempt to 'grab' the request, make
  56. * sure that only one of them succeeds
  57. */
  58. static inline int blk_mark_rq_complete(struct request *rq)
  59. {
  60. return test_and_set_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags);
  61. }
  62. static inline void blk_clear_rq_complete(struct request *rq)
  63. {
  64. clear_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags);
  65. }
  66. /*
  67. * Internal elevator interface
  68. */
  69. #define ELV_ON_HASH(rq) ((rq)->cmd_flags & REQ_HASHED)
  70. void blk_insert_flush(struct request *rq);
  71. static inline struct request *__elv_next_request(struct request_queue *q)
  72. {
  73. struct request *rq;
  74. while (1) {
  75. if (!list_empty(&q->queue_head)) {
  76. rq = list_entry_rq(q->queue_head.next);
  77. return rq;
  78. }
  79. /*
  80. * Flush request is running and flush request isn't queueable
  81. * in the drive, we can hold the queue till flush request is
  82. * finished. Even we don't do this, driver can't dispatch next
  83. * requests and will requeue them. And this can improve
  84. * throughput too. For example, we have request flush1, write1,
  85. * flush 2. flush1 is dispatched, then queue is hold, write1
  86. * isn't inserted to queue. After flush1 is finished, flush2
  87. * will be dispatched. Since disk cache is already clean,
  88. * flush2 will be finished very soon, so looks like flush2 is
  89. * folded to flush1.
  90. * Since the queue is hold, a flag is set to indicate the queue
  91. * should be restarted later. Please see flush_end_io() for
  92. * details.
  93. */
  94. if (q->flush_pending_idx != q->flush_running_idx &&
  95. !queue_flush_queueable(q)) {
  96. q->flush_queue_delayed = 1;
  97. return NULL;
  98. }
  99. if (unlikely(blk_queue_bypass(q)) ||
  100. !q->elevator->type->ops.elevator_dispatch_fn(q, 0))
  101. return NULL;
  102. }
  103. }
  104. static inline void elv_activate_rq(struct request_queue *q, struct request *rq)
  105. {
  106. struct elevator_queue *e = q->elevator;
  107. if (e->type->ops.elevator_activate_req_fn)
  108. e->type->ops.elevator_activate_req_fn(q, rq);
  109. }
  110. static inline void elv_deactivate_rq(struct request_queue *q, struct request *rq)
  111. {
  112. struct elevator_queue *e = q->elevator;
  113. if (e->type->ops.elevator_deactivate_req_fn)
  114. e->type->ops.elevator_deactivate_req_fn(q, rq);
  115. }
  116. #ifdef CONFIG_FAIL_IO_TIMEOUT
  117. int blk_should_fake_timeout(struct request_queue *);
  118. ssize_t part_timeout_show(struct device *, struct device_attribute *, char *);
  119. ssize_t part_timeout_store(struct device *, struct device_attribute *,
  120. const char *, size_t);
  121. #else
  122. static inline int blk_should_fake_timeout(struct request_queue *q)
  123. {
  124. return 0;
  125. }
  126. #endif
  127. int ll_back_merge_fn(struct request_queue *q, struct request *req,
  128. struct bio *bio);
  129. int ll_front_merge_fn(struct request_queue *q, struct request *req,
  130. struct bio *bio);
  131. int attempt_back_merge(struct request_queue *q, struct request *rq);
  132. int attempt_front_merge(struct request_queue *q, struct request *rq);
  133. int blk_attempt_req_merge(struct request_queue *q, struct request *rq,
  134. struct request *next);
  135. void blk_recalc_rq_segments(struct request *rq);
  136. void blk_rq_set_mixed_merge(struct request *rq);
  137. bool blk_rq_merge_ok(struct request *rq, struct bio *bio);
  138. int blk_try_merge(struct request *rq, struct bio *bio);
  139. void blk_queue_congestion_threshold(struct request_queue *q);
  140. void __blk_run_queue_uncond(struct request_queue *q);
  141. int blk_dev_init(void);
  142. /*
  143. * Return the threshold (number of used requests) at which the queue is
  144. * considered to be congested. It include a little hysteresis to keep the
  145. * context switch rate down.
  146. */
  147. static inline int queue_congestion_on_threshold(struct request_queue *q)
  148. {
  149. return q->nr_congestion_on;
  150. }
  151. /*
  152. * The threshold at which a queue is considered to be uncongested
  153. */
  154. static inline int queue_congestion_off_threshold(struct request_queue *q)
  155. {
  156. return q->nr_congestion_off;
  157. }
  158. extern int blk_update_nr_requests(struct request_queue *, unsigned int);
  159. /*
  160. * Contribute to IO statistics IFF:
  161. *
  162. * a) it's attached to a gendisk, and
  163. * b) the queue had IO stats enabled when this request was started, and
  164. * c) it's a file system request
  165. */
  166. static inline int blk_do_io_stat(struct request *rq)
  167. {
  168. return rq->rq_disk &&
  169. (rq->cmd_flags & REQ_IO_STAT) &&
  170. (rq->cmd_type == REQ_TYPE_FS);
  171. }
  172. /*
  173. * Internal io_context interface
  174. */
  175. void get_io_context(struct io_context *ioc);
  176. struct io_cq *ioc_lookup_icq(struct io_context *ioc, struct request_queue *q);
  177. struct io_cq *ioc_create_icq(struct io_context *ioc, struct request_queue *q,
  178. gfp_t gfp_mask);
  179. void ioc_clear_queue(struct request_queue *q);
  180. int create_task_io_context(struct task_struct *task, gfp_t gfp_mask, int node);
  181. /**
  182. * create_io_context - try to create task->io_context
  183. * @gfp_mask: allocation mask
  184. * @node: allocation node
  185. *
  186. * If %current->io_context is %NULL, allocate a new io_context and install
  187. * it. Returns the current %current->io_context which may be %NULL if
  188. * allocation failed.
  189. *
  190. * Note that this function can't be called with IRQ disabled because
  191. * task_lock which protects %current->io_context is IRQ-unsafe.
  192. */
  193. static inline struct io_context *create_io_context(gfp_t gfp_mask, int node)
  194. {
  195. WARN_ON_ONCE(irqs_disabled());
  196. if (unlikely(!current->io_context))
  197. create_task_io_context(current, gfp_mask, node);
  198. return current->io_context;
  199. }
  200. /*
  201. * Internal throttling interface
  202. */
  203. #ifdef CONFIG_BLK_DEV_THROTTLING
  204. extern bool blk_throtl_bio(struct request_queue *q, struct bio *bio);
  205. extern void blk_throtl_drain(struct request_queue *q);
  206. extern int blk_throtl_init(struct request_queue *q);
  207. extern void blk_throtl_exit(struct request_queue *q);
  208. #else /* CONFIG_BLK_DEV_THROTTLING */
  209. static inline bool blk_throtl_bio(struct request_queue *q, struct bio *bio)
  210. {
  211. return false;
  212. }
  213. static inline void blk_throtl_drain(struct request_queue *q) { }
  214. static inline int blk_throtl_init(struct request_queue *q) { return 0; }
  215. static inline void blk_throtl_exit(struct request_queue *q) { }
  216. #endif /* CONFIG_BLK_DEV_THROTTLING */
  217. #endif /* BLK_INTERNAL_H */