blk-barrier.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350
  1. /*
  2. * Functions related to barrier IO handling
  3. */
  4. #include <linux/kernel.h>
  5. #include <linux/module.h>
  6. #include <linux/bio.h>
  7. #include <linux/blkdev.h>
  8. #include <linux/gfp.h>
  9. #include "blk.h"
  10. /**
  11. * blk_queue_ordered - does this queue support ordered writes
  12. * @q: the request queue
  13. * @ordered: one of QUEUE_ORDERED_*
  14. * @prepare_flush_fn: rq setup helper for cache flush ordered writes
  15. *
  16. * Description:
  17. * For journalled file systems, doing ordered writes on a commit
  18. * block instead of explicitly doing wait_on_buffer (which is bad
  19. * for performance) can be a big win. Block drivers supporting this
  20. * feature should call this function and indicate so.
  21. *
  22. **/
  23. int blk_queue_ordered(struct request_queue *q, unsigned ordered,
  24. prepare_flush_fn *prepare_flush_fn)
  25. {
  26. if (!prepare_flush_fn && (ordered & (QUEUE_ORDERED_DO_PREFLUSH |
  27. QUEUE_ORDERED_DO_POSTFLUSH))) {
  28. printk(KERN_ERR "%s: prepare_flush_fn required\n", __func__);
  29. return -EINVAL;
  30. }
  31. if (ordered != QUEUE_ORDERED_NONE &&
  32. ordered != QUEUE_ORDERED_DRAIN &&
  33. ordered != QUEUE_ORDERED_DRAIN_FLUSH &&
  34. ordered != QUEUE_ORDERED_DRAIN_FUA &&
  35. ordered != QUEUE_ORDERED_TAG &&
  36. ordered != QUEUE_ORDERED_TAG_FLUSH &&
  37. ordered != QUEUE_ORDERED_TAG_FUA) {
  38. printk(KERN_ERR "blk_queue_ordered: bad value %d\n", ordered);
  39. return -EINVAL;
  40. }
  41. q->ordered = ordered;
  42. q->next_ordered = ordered;
  43. q->prepare_flush_fn = prepare_flush_fn;
  44. return 0;
  45. }
  46. EXPORT_SYMBOL(blk_queue_ordered);
  47. /*
  48. * Cache flushing for ordered writes handling
  49. */
  50. unsigned blk_ordered_cur_seq(struct request_queue *q)
  51. {
  52. if (!q->ordseq)
  53. return 0;
  54. return 1 << ffz(q->ordseq);
  55. }
  56. unsigned blk_ordered_req_seq(struct request *rq)
  57. {
  58. struct request_queue *q = rq->q;
  59. BUG_ON(q->ordseq == 0);
  60. if (rq == &q->pre_flush_rq)
  61. return QUEUE_ORDSEQ_PREFLUSH;
  62. if (rq == &q->bar_rq)
  63. return QUEUE_ORDSEQ_BAR;
  64. if (rq == &q->post_flush_rq)
  65. return QUEUE_ORDSEQ_POSTFLUSH;
  66. /*
  67. * !fs requests don't need to follow barrier ordering. Always
  68. * put them at the front. This fixes the following deadlock.
  69. *
  70. * http://thread.gmane.org/gmane.linux.kernel/537473
  71. */
  72. if (rq->cmd_type != REQ_TYPE_FS)
  73. return QUEUE_ORDSEQ_DRAIN;
  74. if ((rq->cmd_flags & REQ_ORDERED_COLOR) ==
  75. (q->orig_bar_rq->cmd_flags & REQ_ORDERED_COLOR))
  76. return QUEUE_ORDSEQ_DRAIN;
  77. else
  78. return QUEUE_ORDSEQ_DONE;
  79. }
  80. bool blk_ordered_complete_seq(struct request_queue *q, unsigned seq, int error)
  81. {
  82. struct request *rq;
  83. if (error && !q->orderr)
  84. q->orderr = error;
  85. BUG_ON(q->ordseq & seq);
  86. q->ordseq |= seq;
  87. if (blk_ordered_cur_seq(q) != QUEUE_ORDSEQ_DONE)
  88. return false;
  89. /*
  90. * Okay, sequence complete.
  91. */
  92. q->ordseq = 0;
  93. rq = q->orig_bar_rq;
  94. __blk_end_request_all(rq, q->orderr);
  95. return true;
  96. }
  97. static void pre_flush_end_io(struct request *rq, int error)
  98. {
  99. elv_completed_request(rq->q, rq);
  100. blk_ordered_complete_seq(rq->q, QUEUE_ORDSEQ_PREFLUSH, error);
  101. }
  102. static void bar_end_io(struct request *rq, int error)
  103. {
  104. elv_completed_request(rq->q, rq);
  105. blk_ordered_complete_seq(rq->q, QUEUE_ORDSEQ_BAR, error);
  106. }
  107. static void post_flush_end_io(struct request *rq, int error)
  108. {
  109. elv_completed_request(rq->q, rq);
  110. blk_ordered_complete_seq(rq->q, QUEUE_ORDSEQ_POSTFLUSH, error);
  111. }
  112. static void queue_flush(struct request_queue *q, unsigned which)
  113. {
  114. struct request *rq;
  115. rq_end_io_fn *end_io;
  116. if (which == QUEUE_ORDERED_DO_PREFLUSH) {
  117. rq = &q->pre_flush_rq;
  118. end_io = pre_flush_end_io;
  119. } else {
  120. rq = &q->post_flush_rq;
  121. end_io = post_flush_end_io;
  122. }
  123. blk_rq_init(q, rq);
  124. rq->cmd_flags = REQ_HARDBARRIER | REQ_FLUSH;
  125. rq->rq_disk = q->bar_rq.rq_disk;
  126. rq->end_io = end_io;
  127. q->prepare_flush_fn(q, rq);
  128. elv_insert(q, rq, ELEVATOR_INSERT_FRONT);
  129. }
  130. static inline bool start_ordered(struct request_queue *q, struct request **rqp)
  131. {
  132. struct request *rq = *rqp;
  133. unsigned skip = 0;
  134. q->orderr = 0;
  135. q->ordered = q->next_ordered;
  136. q->ordseq |= QUEUE_ORDSEQ_STARTED;
  137. /*
  138. * For an empty barrier, there's no actual BAR request, which
  139. * in turn makes POSTFLUSH unnecessary. Mask them off.
  140. */
  141. if (!blk_rq_sectors(rq)) {
  142. q->ordered &= ~(QUEUE_ORDERED_DO_BAR |
  143. QUEUE_ORDERED_DO_POSTFLUSH);
  144. /*
  145. * Empty barrier on a write-through device w/ ordered
  146. * tag has no command to issue and without any command
  147. * to issue, ordering by tag can't be used. Drain
  148. * instead.
  149. */
  150. if ((q->ordered & QUEUE_ORDERED_BY_TAG) &&
  151. !(q->ordered & QUEUE_ORDERED_DO_PREFLUSH)) {
  152. q->ordered &= ~QUEUE_ORDERED_BY_TAG;
  153. q->ordered |= QUEUE_ORDERED_BY_DRAIN;
  154. }
  155. }
  156. /* stash away the original request */
  157. blk_dequeue_request(rq);
  158. q->orig_bar_rq = rq;
  159. rq = NULL;
  160. /*
  161. * Queue ordered sequence. As we stack them at the head, we
  162. * need to queue in reverse order. Note that we rely on that
  163. * no fs request uses ELEVATOR_INSERT_FRONT and thus no fs
  164. * request gets inbetween ordered sequence.
  165. */
  166. if (q->ordered & QUEUE_ORDERED_DO_POSTFLUSH) {
  167. queue_flush(q, QUEUE_ORDERED_DO_POSTFLUSH);
  168. rq = &q->post_flush_rq;
  169. } else
  170. skip |= QUEUE_ORDSEQ_POSTFLUSH;
  171. if (q->ordered & QUEUE_ORDERED_DO_BAR) {
  172. rq = &q->bar_rq;
  173. /* initialize proxy request and queue it */
  174. blk_rq_init(q, rq);
  175. if (bio_data_dir(q->orig_bar_rq->bio) == WRITE)
  176. rq->cmd_flags |= REQ_WRITE;
  177. if (q->ordered & QUEUE_ORDERED_DO_FUA)
  178. rq->cmd_flags |= REQ_FUA;
  179. init_request_from_bio(rq, q->orig_bar_rq->bio);
  180. rq->end_io = bar_end_io;
  181. elv_insert(q, rq, ELEVATOR_INSERT_FRONT);
  182. } else
  183. skip |= QUEUE_ORDSEQ_BAR;
  184. if (q->ordered & QUEUE_ORDERED_DO_PREFLUSH) {
  185. queue_flush(q, QUEUE_ORDERED_DO_PREFLUSH);
  186. rq = &q->pre_flush_rq;
  187. } else
  188. skip |= QUEUE_ORDSEQ_PREFLUSH;
  189. if ((q->ordered & QUEUE_ORDERED_BY_DRAIN) && queue_in_flight(q))
  190. rq = NULL;
  191. else
  192. skip |= QUEUE_ORDSEQ_DRAIN;
  193. *rqp = rq;
  194. /*
  195. * Complete skipped sequences. If whole sequence is complete,
  196. * return false to tell elevator that this request is gone.
  197. */
  198. return !blk_ordered_complete_seq(q, skip, 0);
  199. }
  200. bool blk_do_ordered(struct request_queue *q, struct request **rqp)
  201. {
  202. struct request *rq = *rqp;
  203. const int is_barrier = rq->cmd_type == REQ_TYPE_FS &&
  204. (rq->cmd_flags & REQ_HARDBARRIER);
  205. if (!q->ordseq) {
  206. if (!is_barrier)
  207. return true;
  208. if (q->next_ordered != QUEUE_ORDERED_NONE)
  209. return start_ordered(q, rqp);
  210. else {
  211. /*
  212. * Queue ordering not supported. Terminate
  213. * with prejudice.
  214. */
  215. blk_dequeue_request(rq);
  216. __blk_end_request_all(rq, -EOPNOTSUPP);
  217. *rqp = NULL;
  218. return false;
  219. }
  220. }
  221. /*
  222. * Ordered sequence in progress
  223. */
  224. /* Special requests are not subject to ordering rules. */
  225. if (rq->cmd_type != REQ_TYPE_FS &&
  226. rq != &q->pre_flush_rq && rq != &q->post_flush_rq)
  227. return true;
  228. if (q->ordered & QUEUE_ORDERED_BY_TAG) {
  229. /* Ordered by tag. Blocking the next barrier is enough. */
  230. if (is_barrier && rq != &q->bar_rq)
  231. *rqp = NULL;
  232. } else {
  233. /* Ordered by draining. Wait for turn. */
  234. WARN_ON(blk_ordered_req_seq(rq) < blk_ordered_cur_seq(q));
  235. if (blk_ordered_req_seq(rq) > blk_ordered_cur_seq(q))
  236. *rqp = NULL;
  237. }
  238. return true;
  239. }
  240. static void bio_end_empty_barrier(struct bio *bio, int err)
  241. {
  242. if (err) {
  243. if (err == -EOPNOTSUPP)
  244. set_bit(BIO_EOPNOTSUPP, &bio->bi_flags);
  245. clear_bit(BIO_UPTODATE, &bio->bi_flags);
  246. }
  247. if (bio->bi_private)
  248. complete(bio->bi_private);
  249. bio_put(bio);
  250. }
  251. /**
  252. * blkdev_issue_flush - queue a flush
  253. * @bdev: blockdev to issue flush for
  254. * @gfp_mask: memory allocation flags (for bio_alloc)
  255. * @error_sector: error sector
  256. * @flags: BLKDEV_IFL_* flags to control behaviour
  257. *
  258. * Description:
  259. * Issue a flush for the block device in question. Caller can supply
  260. * room for storing the error offset in case of a flush error, if they
  261. * wish to. If WAIT flag is not passed then caller may check only what
  262. * request was pushed in some internal queue for later handling.
  263. */
  264. int blkdev_issue_flush(struct block_device *bdev, gfp_t gfp_mask,
  265. sector_t *error_sector, unsigned long flags)
  266. {
  267. DECLARE_COMPLETION_ONSTACK(wait);
  268. struct request_queue *q;
  269. struct bio *bio;
  270. int ret = 0;
  271. if (bdev->bd_disk == NULL)
  272. return -ENXIO;
  273. q = bdev_get_queue(bdev);
  274. if (!q)
  275. return -ENXIO;
  276. bio = bio_alloc(gfp_mask, 0);
  277. bio->bi_end_io = bio_end_empty_barrier;
  278. bio->bi_bdev = bdev;
  279. if (test_bit(BLKDEV_WAIT, &flags))
  280. bio->bi_private = &wait;
  281. bio_get(bio);
  282. submit_bio(WRITE_BARRIER, bio);
  283. if (test_bit(BLKDEV_WAIT, &flags)) {
  284. wait_for_completion(&wait);
  285. /*
  286. * The driver must store the error location in ->bi_sector, if
  287. * it supports it. For non-stacked drivers, this should be
  288. * copied from blk_rq_pos(rq).
  289. */
  290. if (error_sector)
  291. *error_sector = bio->bi_sector;
  292. }
  293. if (bio_flagged(bio, BIO_EOPNOTSUPP))
  294. ret = -EOPNOTSUPP;
  295. else if (!bio_flagged(bio, BIO_UPTODATE))
  296. ret = -EIO;
  297. bio_put(bio);
  298. return ret;
  299. }
  300. EXPORT_SYMBOL(blkdev_issue_flush);