blk.h 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164
  1. #ifndef BLK_INTERNAL_H
  2. #define BLK_INTERNAL_H
  3. /* Amount of time in which a process may batch requests */
  4. #define BLK_BATCH_TIME (HZ/50UL)
  5. /* Number of requests a "batching" process may submit */
  6. #define BLK_BATCH_REQ 32
  7. extern struct kmem_cache *blk_requestq_cachep;
  8. extern struct kobj_type blk_queue_ktype;
  9. void init_request_from_bio(struct request *req, struct bio *bio);
  10. void blk_rq_bio_prep(struct request_queue *q, struct request *rq,
  11. struct bio *bio);
  12. void __blk_queue_free_tags(struct request_queue *q);
  13. void blk_unplug_work(struct work_struct *work);
  14. void blk_unplug_timeout(unsigned long data);
  15. void blk_rq_timed_out_timer(unsigned long data);
  16. void blk_delete_timer(struct request *);
  17. void blk_add_timer(struct request *);
  18. void __generic_unplug_device(struct request_queue *);
  19. /*
  20. * Internal atomic flags for request handling
  21. */
  22. enum rq_atomic_flags {
  23. REQ_ATOM_COMPLETE = 0,
  24. };
  25. /*
  26. * EH timer and IO completion will both attempt to 'grab' the request, make
  27. * sure that only one of them suceeds
  28. */
  29. static inline int blk_mark_rq_complete(struct request *rq)
  30. {
  31. return test_and_set_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags);
  32. }
  33. static inline void blk_clear_rq_complete(struct request *rq)
  34. {
  35. clear_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags);
  36. }
  37. /*
  38. * Internal elevator interface
  39. */
  40. #define ELV_ON_HASH(rq) (!hlist_unhashed(&(rq)->hash))
  41. static inline struct request *__elv_next_request(struct request_queue *q)
  42. {
  43. struct request *rq;
  44. while (1) {
  45. while (!list_empty(&q->queue_head)) {
  46. rq = list_entry_rq(q->queue_head.next);
  47. if (blk_do_ordered(q, &rq))
  48. return rq;
  49. }
  50. if (!q->elevator->ops->elevator_dispatch_fn(q, 0))
  51. return NULL;
  52. }
  53. }
  54. static inline void elv_activate_rq(struct request_queue *q, struct request *rq)
  55. {
  56. struct elevator_queue *e = q->elevator;
  57. if (e->ops->elevator_activate_req_fn)
  58. e->ops->elevator_activate_req_fn(q, rq);
  59. }
  60. static inline void elv_deactivate_rq(struct request_queue *q, struct request *rq)
  61. {
  62. struct elevator_queue *e = q->elevator;
  63. if (e->ops->elevator_deactivate_req_fn)
  64. e->ops->elevator_deactivate_req_fn(q, rq);
  65. }
  66. #ifdef CONFIG_FAIL_IO_TIMEOUT
  67. int blk_should_fake_timeout(struct request_queue *);
  68. ssize_t part_timeout_show(struct device *, struct device_attribute *, char *);
  69. ssize_t part_timeout_store(struct device *, struct device_attribute *,
  70. const char *, size_t);
  71. #else
  72. static inline int blk_should_fake_timeout(struct request_queue *q)
  73. {
  74. return 0;
  75. }
  76. #endif
  77. struct io_context *current_io_context(gfp_t gfp_flags, int node);
  78. int ll_back_merge_fn(struct request_queue *q, struct request *req,
  79. struct bio *bio);
  80. int ll_front_merge_fn(struct request_queue *q, struct request *req,
  81. struct bio *bio);
  82. int attempt_back_merge(struct request_queue *q, struct request *rq);
  83. int attempt_front_merge(struct request_queue *q, struct request *rq);
  84. void blk_recalc_rq_segments(struct request *rq);
  85. void blk_recalc_rq_sectors(struct request *rq, int nsect);
  86. void blk_queue_congestion_threshold(struct request_queue *q);
  87. int blk_dev_init(void);
  88. void elv_quiesce_start(struct request_queue *q);
  89. void elv_quiesce_end(struct request_queue *q);
  90. /*
  91. * Return the threshold (number of used requests) at which the queue is
  92. * considered to be congested. It include a little hysteresis to keep the
  93. * context switch rate down.
  94. */
  95. static inline int queue_congestion_on_threshold(struct request_queue *q)
  96. {
  97. return q->nr_congestion_on;
  98. }
  99. /*
  100. * The threshold at which a queue is considered to be uncongested
  101. */
  102. static inline int queue_congestion_off_threshold(struct request_queue *q)
  103. {
  104. return q->nr_congestion_off;
  105. }
  106. #if defined(CONFIG_BLK_DEV_INTEGRITY)
  107. #define rq_for_each_integrity_segment(bvl, _rq, _iter) \
  108. __rq_for_each_bio(_iter.bio, _rq) \
  109. bip_for_each_vec(bvl, _iter.bio->bi_integrity, _iter.i)
  110. #endif /* BLK_DEV_INTEGRITY */
  111. static inline int blk_cpu_to_group(int cpu)
  112. {
  113. #ifdef CONFIG_SCHED_MC
  114. const struct cpumask *mask = cpu_coregroup_mask(cpu);
  115. return cpumask_first(mask);
  116. #elif defined(CONFIG_SCHED_SMT)
  117. return cpumask_first(topology_thread_cpumask(cpu));
  118. #else
  119. return cpu;
  120. #endif
  121. }
  122. /*
  123. * Contribute to IO statistics IFF:
  124. *
  125. * a) it's attached to a gendisk, and
  126. * b) the queue had IO stats enabled when this request was started, and
  127. * c) it's a file system request
  128. */
  129. static inline int blk_do_io_stat(struct request *rq)
  130. {
  131. return rq->rq_disk && blk_rq_io_stat(rq) && blk_fs_request(rq);
  132. }
  133. #endif