blk-flush.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429
  1. /*
  2. * Functions to sequence FLUSH and FUA writes.
  3. *
  4. * Copyright (C) 2011 Max Planck Institute for Gravitational Physics
  5. * Copyright (C) 2011 Tejun Heo <tj@kernel.org>
  6. *
  7. * This file is released under the GPLv2.
  8. *
  9. * REQ_{FLUSH|FUA} requests are decomposed to sequences consisted of three
  10. * optional steps - PREFLUSH, DATA and POSTFLUSH - according to the request
  11. * properties and hardware capability.
  12. *
  13. * If a request doesn't have data, only REQ_FLUSH makes sense, which
  14. * indicates a simple flush request. If there is data, REQ_FLUSH indicates
  15. * that the device cache should be flushed before the data is executed, and
  16. * REQ_FUA means that the data must be on non-volatile media on request
  17. * completion.
  18. *
  19. * If the device doesn't have writeback cache, FLUSH and FUA don't make any
  20. * difference. The requests are either completed immediately if there's no
  21. * data or executed as normal requests otherwise.
  22. *
  23. * If the device has writeback cache and supports FUA, REQ_FLUSH is
  24. * translated to PREFLUSH but REQ_FUA is passed down directly with DATA.
  25. *
  26. * If the device has writeback cache and doesn't support FUA, REQ_FLUSH is
  27. * translated to PREFLUSH and REQ_FUA to POSTFLUSH.
  28. *
  29. * The actual execution of flush is double buffered. Whenever a request
  30. * needs to execute PRE or POSTFLUSH, it queues at
  31. * q->flush_queue[q->flush_pending_idx]. Once certain criteria are met, a
  32. * flush is issued and the pending_idx is toggled. When the flush
  33. * completes, all the requests which were pending are proceeded to the next
  34. * step. This allows arbitrary merging of different types of FLUSH/FUA
  35. * requests.
  36. *
  37. * Currently, the following conditions are used to determine when to issue
  38. * flush.
  39. *
  40. * C1. At any given time, only one flush shall be in progress. This makes
  41. * double buffering sufficient.
  42. *
  43. * C2. Flush is deferred if any request is executing DATA of its sequence.
  44. * This avoids issuing separate POSTFLUSHes for requests which shared
  45. * PREFLUSH.
  46. *
  47. * C3. The second condition is ignored if there is a request which has
  48. * waited longer than FLUSH_PENDING_TIMEOUT. This is to avoid
  49. * starvation in the unlikely case where there are continuous stream of
  50. * FUA (without FLUSH) requests.
  51. *
  52. * For devices which support FUA, it isn't clear whether C2 (and thus C3)
  53. * is beneficial.
  54. *
  55. * Note that a sequenced FLUSH/FUA request with DATA is completed twice.
  56. * Once while executing DATA and again after the whole sequence is
  57. * complete. The first completion updates the contained bio but doesn't
  58. * finish it so that the bio submitter is notified only after the whole
  59. * sequence is complete. This is implemented by testing REQ_FLUSH_SEQ in
  60. * req_bio_endio().
  61. *
  62. * The above peculiarity requires that each FLUSH/FUA request has only one
  63. * bio attached to it, which is guaranteed as they aren't allowed to be
  64. * merged in the usual way.
  65. */
  66. #include <linux/kernel.h>
  67. #include <linux/module.h>
  68. #include <linux/bio.h>
  69. #include <linux/blkdev.h>
  70. #include <linux/gfp.h>
  71. #include "blk.h"
  72. /* FLUSH/FUA sequences */
  73. enum {
  74. REQ_FSEQ_PREFLUSH = (1 << 0), /* pre-flushing in progress */
  75. REQ_FSEQ_DATA = (1 << 1), /* data write in progress */
  76. REQ_FSEQ_POSTFLUSH = (1 << 2), /* post-flushing in progress */
  77. REQ_FSEQ_DONE = (1 << 3),
  78. REQ_FSEQ_ACTIONS = REQ_FSEQ_PREFLUSH | REQ_FSEQ_DATA |
  79. REQ_FSEQ_POSTFLUSH,
  80. /*
  81. * If flush has been pending longer than the following timeout,
  82. * it's issued even if flush_data requests are still in flight.
  83. */
  84. FLUSH_PENDING_TIMEOUT = 5 * HZ,
  85. };
  86. static bool blk_kick_flush(struct request_queue *q);
  87. static unsigned int blk_flush_policy(unsigned int fflags, struct request *rq)
  88. {
  89. unsigned int policy = 0;
  90. if (fflags & REQ_FLUSH) {
  91. if (rq->cmd_flags & REQ_FLUSH)
  92. policy |= REQ_FSEQ_PREFLUSH;
  93. if (blk_rq_sectors(rq))
  94. policy |= REQ_FSEQ_DATA;
  95. if (!(fflags & REQ_FUA) && (rq->cmd_flags & REQ_FUA))
  96. policy |= REQ_FSEQ_POSTFLUSH;
  97. }
  98. return policy;
  99. }
  100. static unsigned int blk_flush_cur_seq(struct request *rq)
  101. {
  102. return 1 << ffz(rq->flush.seq);
  103. }
  104. static void blk_flush_restore_request(struct request *rq)
  105. {
  106. /*
  107. * After flush data completion, @rq->bio is %NULL but we need to
  108. * complete the bio again. @rq->biotail is guaranteed to equal the
  109. * original @rq->bio. Restore it.
  110. */
  111. rq->bio = rq->biotail;
  112. /* make @rq a normal request */
  113. rq->cmd_flags &= ~REQ_FLUSH_SEQ;
  114. rq->end_io = NULL;
  115. }
  116. /**
  117. * blk_flush_complete_seq - complete flush sequence
  118. * @rq: FLUSH/FUA request being sequenced
  119. * @seq: sequences to complete (mask of %REQ_FSEQ_*, can be zero)
  120. * @error: whether an error occurred
  121. *
  122. * @rq just completed @seq part of its flush sequence, record the
  123. * completion and trigger the next step.
  124. *
  125. * CONTEXT:
  126. * spin_lock_irq(q->queue_lock)
  127. *
  128. * RETURNS:
  129. * %true if requests were added to the dispatch queue, %false otherwise.
  130. */
  131. static bool blk_flush_complete_seq(struct request *rq, unsigned int seq,
  132. int error)
  133. {
  134. struct request_queue *q = rq->q;
  135. struct list_head *pending = &q->flush_queue[q->flush_pending_idx];
  136. bool queued = false;
  137. BUG_ON(rq->flush.seq & seq);
  138. rq->flush.seq |= seq;
  139. if (likely(!error))
  140. seq = blk_flush_cur_seq(rq);
  141. else
  142. seq = REQ_FSEQ_DONE;
  143. switch (seq) {
  144. case REQ_FSEQ_PREFLUSH:
  145. case REQ_FSEQ_POSTFLUSH:
  146. /* queue for flush */
  147. if (list_empty(pending))
  148. q->flush_pending_since = jiffies;
  149. list_move_tail(&rq->flush.list, pending);
  150. break;
  151. case REQ_FSEQ_DATA:
  152. list_move_tail(&rq->flush.list, &q->flush_data_in_flight);
  153. list_add(&rq->queuelist, &q->queue_head);
  154. queued = true;
  155. break;
  156. case REQ_FSEQ_DONE:
  157. /*
  158. * @rq was previously adjusted by blk_flush_issue() for
  159. * flush sequencing and may already have gone through the
  160. * flush data request completion path. Restore @rq for
  161. * normal completion and end it.
  162. */
  163. BUG_ON(!list_empty(&rq->queuelist));
  164. list_del_init(&rq->flush.list);
  165. blk_flush_restore_request(rq);
  166. __blk_end_request_all(rq, error);
  167. break;
  168. default:
  169. BUG();
  170. }
  171. return blk_kick_flush(q) | queued;
  172. }
  173. static void flush_end_io(struct request *flush_rq, int error)
  174. {
  175. struct request_queue *q = flush_rq->q;
  176. struct list_head *running = &q->flush_queue[q->flush_running_idx];
  177. bool queued = false;
  178. struct request *rq, *n;
  179. BUG_ON(q->flush_pending_idx == q->flush_running_idx);
  180. /* account completion of the flush request */
  181. q->flush_running_idx ^= 1;
  182. elv_completed_request(q, flush_rq);
  183. /* and push the waiting requests to the next stage */
  184. list_for_each_entry_safe(rq, n, running, flush.list) {
  185. unsigned int seq = blk_flush_cur_seq(rq);
  186. BUG_ON(seq != REQ_FSEQ_PREFLUSH && seq != REQ_FSEQ_POSTFLUSH);
  187. queued |= blk_flush_complete_seq(rq, seq, error);
  188. }
  189. /* after populating an empty queue, kick it to avoid stall */
  190. if (queued)
  191. __blk_run_queue(q);
  192. }
  193. /**
  194. * blk_kick_flush - consider issuing flush request
  195. * @q: request_queue being kicked
  196. *
  197. * Flush related states of @q have changed, consider issuing flush request.
  198. * Please read the comment at the top of this file for more info.
  199. *
  200. * CONTEXT:
  201. * spin_lock_irq(q->queue_lock)
  202. *
  203. * RETURNS:
  204. * %true if flush was issued, %false otherwise.
  205. */
  206. static bool blk_kick_flush(struct request_queue *q)
  207. {
  208. struct list_head *pending = &q->flush_queue[q->flush_pending_idx];
  209. struct request *first_rq =
  210. list_first_entry(pending, struct request, flush.list);
  211. /* C1 described at the top of this file */
  212. if (q->flush_pending_idx != q->flush_running_idx || list_empty(pending))
  213. return false;
  214. /* C2 and C3 */
  215. if (!list_empty(&q->flush_data_in_flight) &&
  216. time_before(jiffies,
  217. q->flush_pending_since + FLUSH_PENDING_TIMEOUT))
  218. return false;
  219. /*
  220. * Issue flush and toggle pending_idx. This makes pending_idx
  221. * different from running_idx, which means flush is in flight.
  222. */
  223. blk_rq_init(q, &q->flush_rq);
  224. q->flush_rq.cmd_type = REQ_TYPE_FS;
  225. q->flush_rq.cmd_flags = WRITE_FLUSH | REQ_FLUSH_SEQ;
  226. q->flush_rq.rq_disk = first_rq->rq_disk;
  227. q->flush_rq.end_io = flush_end_io;
  228. q->flush_pending_idx ^= 1;
  229. elv_insert(q, &q->flush_rq, ELEVATOR_INSERT_FRONT);
  230. return true;
  231. }
  232. static void flush_data_end_io(struct request *rq, int error)
  233. {
  234. struct request_queue *q = rq->q;
  235. /* after populating an empty queue, kick it to avoid stall */
  236. if (blk_flush_complete_seq(rq, REQ_FSEQ_DATA, error))
  237. __blk_run_queue(q);
  238. }
  239. /**
  240. * blk_insert_flush - insert a new FLUSH/FUA request
  241. * @rq: request to insert
  242. *
  243. * To be called from elv_insert() for %ELEVATOR_INSERT_FLUSH insertions.
  244. * @rq is being submitted. Analyze what needs to be done and put it on the
  245. * right queue.
  246. *
  247. * CONTEXT:
  248. * spin_lock_irq(q->queue_lock)
  249. */
  250. void blk_insert_flush(struct request *rq)
  251. {
  252. struct request_queue *q = rq->q;
  253. unsigned int fflags = q->flush_flags; /* may change, cache */
  254. unsigned int policy = blk_flush_policy(fflags, rq);
  255. BUG_ON(rq->end_io);
  256. BUG_ON(!rq->bio || rq->bio != rq->biotail);
  257. /*
  258. * @policy now records what operations need to be done. Adjust
  259. * REQ_FLUSH and FUA for the driver.
  260. */
  261. rq->cmd_flags &= ~REQ_FLUSH;
  262. if (!(fflags & REQ_FUA))
  263. rq->cmd_flags &= ~REQ_FUA;
  264. /*
  265. * If there's data but flush is not necessary, the request can be
  266. * processed directly without going through flush machinery. Queue
  267. * for normal execution.
  268. */
  269. if ((policy & REQ_FSEQ_DATA) &&
  270. !(policy & (REQ_FSEQ_PREFLUSH | REQ_FSEQ_POSTFLUSH))) {
  271. list_add(&rq->queuelist, &q->queue_head);
  272. return;
  273. }
  274. /*
  275. * @rq should go through flush machinery. Mark it part of flush
  276. * sequence and submit for further processing.
  277. */
  278. memset(&rq->flush, 0, sizeof(rq->flush));
  279. INIT_LIST_HEAD(&rq->flush.list);
  280. rq->cmd_flags |= REQ_FLUSH_SEQ;
  281. rq->end_io = flush_data_end_io;
  282. blk_flush_complete_seq(rq, REQ_FSEQ_ACTIONS & ~policy, 0);
  283. }
  284. /**
  285. * blk_abort_flushes - @q is being aborted, abort flush requests
  286. * @q: request_queue being aborted
  287. *
  288. * To be called from elv_abort_queue(). @q is being aborted. Prepare all
  289. * FLUSH/FUA requests for abortion.
  290. *
  291. * CONTEXT:
  292. * spin_lock_irq(q->queue_lock)
  293. */
  294. void blk_abort_flushes(struct request_queue *q)
  295. {
  296. struct request *rq, *n;
  297. int i;
  298. /*
  299. * Requests in flight for data are already owned by the dispatch
  300. * queue or the device driver. Just restore for normal completion.
  301. */
  302. list_for_each_entry_safe(rq, n, &q->flush_data_in_flight, flush.list) {
  303. list_del_init(&rq->flush.list);
  304. blk_flush_restore_request(rq);
  305. }
  306. /*
  307. * We need to give away requests on flush queues. Restore for
  308. * normal completion and put them on the dispatch queue.
  309. */
  310. for (i = 0; i < ARRAY_SIZE(q->flush_queue); i++) {
  311. list_for_each_entry_safe(rq, n, &q->flush_queue[i],
  312. flush.list) {
  313. list_del_init(&rq->flush.list);
  314. blk_flush_restore_request(rq);
  315. list_add_tail(&rq->queuelist, &q->queue_head);
  316. }
  317. }
  318. }
  319. static void bio_end_flush(struct bio *bio, int err)
  320. {
  321. if (err)
  322. clear_bit(BIO_UPTODATE, &bio->bi_flags);
  323. if (bio->bi_private)
  324. complete(bio->bi_private);
  325. bio_put(bio);
  326. }
  327. /**
  328. * blkdev_issue_flush - queue a flush
  329. * @bdev: blockdev to issue flush for
  330. * @gfp_mask: memory allocation flags (for bio_alloc)
  331. * @error_sector: error sector
  332. *
  333. * Description:
  334. * Issue a flush for the block device in question. Caller can supply
  335. * room for storing the error offset in case of a flush error, if they
  336. * wish to. If WAIT flag is not passed then caller may check only what
  337. * request was pushed in some internal queue for later handling.
  338. */
  339. int blkdev_issue_flush(struct block_device *bdev, gfp_t gfp_mask,
  340. sector_t *error_sector)
  341. {
  342. DECLARE_COMPLETION_ONSTACK(wait);
  343. struct request_queue *q;
  344. struct bio *bio;
  345. int ret = 0;
  346. if (bdev->bd_disk == NULL)
  347. return -ENXIO;
  348. q = bdev_get_queue(bdev);
  349. if (!q)
  350. return -ENXIO;
  351. /*
  352. * some block devices may not have their queue correctly set up here
  353. * (e.g. loop device without a backing file) and so issuing a flush
  354. * here will panic. Ensure there is a request function before issuing
  355. * the flush.
  356. */
  357. if (!q->make_request_fn)
  358. return -ENXIO;
  359. bio = bio_alloc(gfp_mask, 0);
  360. bio->bi_end_io = bio_end_flush;
  361. bio->bi_bdev = bdev;
  362. bio->bi_private = &wait;
  363. bio_get(bio);
  364. submit_bio(WRITE_FLUSH, bio);
  365. wait_for_completion(&wait);
  366. /*
  367. * The driver must store the error location in ->bi_sector, if
  368. * it supports it. For non-stacked drivers, this should be
  369. * copied from blk_rq_pos(rq).
  370. */
  371. if (error_sector)
  372. *error_sector = bio->bi_sector;
  373. if (!bio_flagged(bio, BIO_UPTODATE))
  374. ret = -EIO;
  375. bio_put(bio);
  376. return ret;
  377. }
  378. EXPORT_SYMBOL(blkdev_issue_flush);