blk-flush.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530
  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. * fq->flush_queue[fq->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 <linux/blk-mq.h>
  72. #include "blk.h"
  73. #include "blk-mq.h"
  74. /* FLUSH/FUA sequences */
  75. enum {
  76. REQ_FSEQ_PREFLUSH = (1 << 0), /* pre-flushing in progress */
  77. REQ_FSEQ_DATA = (1 << 1), /* data write in progress */
  78. REQ_FSEQ_POSTFLUSH = (1 << 2), /* post-flushing in progress */
  79. REQ_FSEQ_DONE = (1 << 3),
  80. REQ_FSEQ_ACTIONS = REQ_FSEQ_PREFLUSH | REQ_FSEQ_DATA |
  81. REQ_FSEQ_POSTFLUSH,
  82. /*
  83. * If flush has been pending longer than the following timeout,
  84. * it's issued even if flush_data requests are still in flight.
  85. */
  86. FLUSH_PENDING_TIMEOUT = 5 * HZ,
  87. };
  88. static bool blk_kick_flush(struct request_queue *q,
  89. struct blk_flush_queue *fq);
  90. static unsigned int blk_flush_policy(unsigned int fflags, struct request *rq)
  91. {
  92. unsigned int policy = 0;
  93. if (blk_rq_sectors(rq))
  94. policy |= REQ_FSEQ_DATA;
  95. if (fflags & REQ_FLUSH) {
  96. if (rq->cmd_flags & REQ_FLUSH)
  97. policy |= REQ_FSEQ_PREFLUSH;
  98. if (!(fflags & REQ_FUA) && (rq->cmd_flags & REQ_FUA))
  99. policy |= REQ_FSEQ_POSTFLUSH;
  100. }
  101. return policy;
  102. }
  103. static unsigned int blk_flush_cur_seq(struct request *rq)
  104. {
  105. return 1 << ffz(rq->flush.seq);
  106. }
  107. static void blk_flush_restore_request(struct request *rq)
  108. {
  109. /*
  110. * After flush data completion, @rq->bio is %NULL but we need to
  111. * complete the bio again. @rq->biotail is guaranteed to equal the
  112. * original @rq->bio. Restore it.
  113. */
  114. rq->bio = rq->biotail;
  115. /* make @rq a normal request */
  116. rq->cmd_flags &= ~REQ_FLUSH_SEQ;
  117. rq->end_io = rq->flush.saved_end_io;
  118. }
  119. static bool blk_flush_queue_rq(struct request *rq, bool add_front)
  120. {
  121. if (rq->q->mq_ops) {
  122. struct request_queue *q = rq->q;
  123. blk_mq_add_to_requeue_list(rq, add_front);
  124. blk_mq_kick_requeue_list(q);
  125. return false;
  126. } else {
  127. if (add_front)
  128. list_add(&rq->queuelist, &rq->q->queue_head);
  129. else
  130. list_add_tail(&rq->queuelist, &rq->q->queue_head);
  131. return true;
  132. }
  133. }
  134. /**
  135. * blk_flush_complete_seq - complete flush sequence
  136. * @rq: FLUSH/FUA request being sequenced
  137. * @fq: flush queue
  138. * @seq: sequences to complete (mask of %REQ_FSEQ_*, can be zero)
  139. * @error: whether an error occurred
  140. *
  141. * @rq just completed @seq part of its flush sequence, record the
  142. * completion and trigger the next step.
  143. *
  144. * CONTEXT:
  145. * spin_lock_irq(q->queue_lock or fq->mq_flush_lock)
  146. *
  147. * RETURNS:
  148. * %true if requests were added to the dispatch queue, %false otherwise.
  149. */
  150. static bool blk_flush_complete_seq(struct request *rq,
  151. struct blk_flush_queue *fq,
  152. unsigned int seq, int error)
  153. {
  154. struct request_queue *q = rq->q;
  155. struct list_head *pending = &fq->flush_queue[fq->flush_pending_idx];
  156. bool queued = false, kicked;
  157. BUG_ON(rq->flush.seq & seq);
  158. rq->flush.seq |= seq;
  159. if (likely(!error))
  160. seq = blk_flush_cur_seq(rq);
  161. else
  162. seq = REQ_FSEQ_DONE;
  163. switch (seq) {
  164. case REQ_FSEQ_PREFLUSH:
  165. case REQ_FSEQ_POSTFLUSH:
  166. /* queue for flush */
  167. if (list_empty(pending))
  168. fq->flush_pending_since = jiffies;
  169. list_move_tail(&rq->flush.list, pending);
  170. break;
  171. case REQ_FSEQ_DATA:
  172. list_move_tail(&rq->flush.list, &fq->flush_data_in_flight);
  173. queued = blk_flush_queue_rq(rq, true);
  174. break;
  175. case REQ_FSEQ_DONE:
  176. /*
  177. * @rq was previously adjusted by blk_flush_issue() for
  178. * flush sequencing and may already have gone through the
  179. * flush data request completion path. Restore @rq for
  180. * normal completion and end it.
  181. */
  182. BUG_ON(!list_empty(&rq->queuelist));
  183. list_del_init(&rq->flush.list);
  184. blk_flush_restore_request(rq);
  185. if (q->mq_ops)
  186. blk_mq_end_request(rq, error);
  187. else
  188. __blk_end_request_all(rq, error);
  189. break;
  190. default:
  191. BUG();
  192. }
  193. kicked = blk_kick_flush(q, fq);
  194. return kicked | queued;
  195. }
  196. static void flush_end_io(struct request *flush_rq, int error)
  197. {
  198. struct request_queue *q = flush_rq->q;
  199. struct list_head *running;
  200. bool queued = false;
  201. struct request *rq, *n;
  202. unsigned long flags = 0;
  203. struct blk_flush_queue *fq = blk_get_flush_queue(q, flush_rq->mq_ctx);
  204. if (q->mq_ops) {
  205. spin_lock_irqsave(&fq->mq_flush_lock, flags);
  206. flush_rq->tag = -1;
  207. }
  208. running = &fq->flush_queue[fq->flush_running_idx];
  209. BUG_ON(fq->flush_pending_idx == fq->flush_running_idx);
  210. /* account completion of the flush request */
  211. fq->flush_running_idx ^= 1;
  212. if (!q->mq_ops)
  213. elv_completed_request(q, flush_rq);
  214. /* and push the waiting requests to the next stage */
  215. list_for_each_entry_safe(rq, n, running, flush.list) {
  216. unsigned int seq = blk_flush_cur_seq(rq);
  217. BUG_ON(seq != REQ_FSEQ_PREFLUSH && seq != REQ_FSEQ_POSTFLUSH);
  218. queued |= blk_flush_complete_seq(rq, fq, seq, error);
  219. }
  220. /*
  221. * Kick the queue to avoid stall for two cases:
  222. * 1. Moving a request silently to empty queue_head may stall the
  223. * queue.
  224. * 2. When flush request is running in non-queueable queue, the
  225. * queue is hold. Restart the queue after flush request is finished
  226. * to avoid stall.
  227. * This function is called from request completion path and calling
  228. * directly into request_fn may confuse the driver. Always use
  229. * kblockd.
  230. */
  231. if (queued || fq->flush_queue_delayed) {
  232. WARN_ON(q->mq_ops);
  233. blk_run_queue_async(q);
  234. }
  235. fq->flush_queue_delayed = 0;
  236. if (q->mq_ops)
  237. spin_unlock_irqrestore(&fq->mq_flush_lock, flags);
  238. }
  239. /**
  240. * blk_kick_flush - consider issuing flush request
  241. * @q: request_queue being kicked
  242. * @fq: flush queue
  243. *
  244. * Flush related states of @q have changed, consider issuing flush request.
  245. * Please read the comment at the top of this file for more info.
  246. *
  247. * CONTEXT:
  248. * spin_lock_irq(q->queue_lock or fq->mq_flush_lock)
  249. *
  250. * RETURNS:
  251. * %true if flush was issued, %false otherwise.
  252. */
  253. static bool blk_kick_flush(struct request_queue *q, struct blk_flush_queue *fq)
  254. {
  255. struct list_head *pending = &fq->flush_queue[fq->flush_pending_idx];
  256. struct request *first_rq =
  257. list_first_entry(pending, struct request, flush.list);
  258. struct request *flush_rq = fq->flush_rq;
  259. /* C1 described at the top of this file */
  260. if (fq->flush_pending_idx != fq->flush_running_idx || list_empty(pending))
  261. return false;
  262. /* C2 and C3 */
  263. if (!list_empty(&fq->flush_data_in_flight) &&
  264. time_before(jiffies,
  265. fq->flush_pending_since + FLUSH_PENDING_TIMEOUT))
  266. return false;
  267. /*
  268. * Issue flush and toggle pending_idx. This makes pending_idx
  269. * different from running_idx, which means flush is in flight.
  270. */
  271. fq->flush_pending_idx ^= 1;
  272. blk_rq_init(q, flush_rq);
  273. /*
  274. * Borrow tag from the first request since they can't
  275. * be in flight at the same time.
  276. */
  277. if (q->mq_ops) {
  278. flush_rq->mq_ctx = first_rq->mq_ctx;
  279. flush_rq->tag = first_rq->tag;
  280. }
  281. flush_rq->cmd_type = REQ_TYPE_FS;
  282. flush_rq->cmd_flags = WRITE_FLUSH | REQ_FLUSH_SEQ;
  283. flush_rq->rq_disk = first_rq->rq_disk;
  284. flush_rq->end_io = flush_end_io;
  285. return blk_flush_queue_rq(flush_rq, false);
  286. }
  287. static void flush_data_end_io(struct request *rq, int error)
  288. {
  289. struct request_queue *q = rq->q;
  290. struct blk_flush_queue *fq = blk_get_flush_queue(q, NULL);
  291. /*
  292. * After populating an empty queue, kick it to avoid stall. Read
  293. * the comment in flush_end_io().
  294. */
  295. if (blk_flush_complete_seq(rq, fq, REQ_FSEQ_DATA, error))
  296. blk_run_queue_async(q);
  297. }
  298. static void mq_flush_data_end_io(struct request *rq, int error)
  299. {
  300. struct request_queue *q = rq->q;
  301. struct blk_mq_hw_ctx *hctx;
  302. struct blk_mq_ctx *ctx = rq->mq_ctx;
  303. unsigned long flags;
  304. struct blk_flush_queue *fq = blk_get_flush_queue(q, ctx);
  305. hctx = q->mq_ops->map_queue(q, ctx->cpu);
  306. /*
  307. * After populating an empty queue, kick it to avoid stall. Read
  308. * the comment in flush_end_io().
  309. */
  310. spin_lock_irqsave(&fq->mq_flush_lock, flags);
  311. if (blk_flush_complete_seq(rq, fq, REQ_FSEQ_DATA, error))
  312. blk_mq_run_hw_queue(hctx, true);
  313. spin_unlock_irqrestore(&fq->mq_flush_lock, flags);
  314. }
  315. /**
  316. * blk_insert_flush - insert a new FLUSH/FUA request
  317. * @rq: request to insert
  318. *
  319. * To be called from __elv_add_request() for %ELEVATOR_INSERT_FLUSH insertions.
  320. * or __blk_mq_run_hw_queue() to dispatch request.
  321. * @rq is being submitted. Analyze what needs to be done and put it on the
  322. * right queue.
  323. *
  324. * CONTEXT:
  325. * spin_lock_irq(q->queue_lock) in !mq case
  326. */
  327. void blk_insert_flush(struct request *rq)
  328. {
  329. struct request_queue *q = rq->q;
  330. unsigned int fflags = q->flush_flags; /* may change, cache */
  331. unsigned int policy = blk_flush_policy(fflags, rq);
  332. struct blk_flush_queue *fq = blk_get_flush_queue(q, rq->mq_ctx);
  333. /*
  334. * @policy now records what operations need to be done. Adjust
  335. * REQ_FLUSH and FUA for the driver.
  336. */
  337. rq->cmd_flags &= ~REQ_FLUSH;
  338. if (!(fflags & REQ_FUA))
  339. rq->cmd_flags &= ~REQ_FUA;
  340. /*
  341. * An empty flush handed down from a stacking driver may
  342. * translate into nothing if the underlying device does not
  343. * advertise a write-back cache. In this case, simply
  344. * complete the request.
  345. */
  346. if (!policy) {
  347. if (q->mq_ops)
  348. blk_mq_end_request(rq, 0);
  349. else
  350. __blk_end_bidi_request(rq, 0, 0, 0);
  351. return;
  352. }
  353. BUG_ON(rq->bio != rq->biotail); /*assumes zero or single bio rq */
  354. /*
  355. * If there's data but flush is not necessary, the request can be
  356. * processed directly without going through flush machinery. Queue
  357. * for normal execution.
  358. */
  359. if ((policy & REQ_FSEQ_DATA) &&
  360. !(policy & (REQ_FSEQ_PREFLUSH | REQ_FSEQ_POSTFLUSH))) {
  361. if (q->mq_ops) {
  362. blk_mq_insert_request(rq, false, false, true);
  363. } else
  364. list_add_tail(&rq->queuelist, &q->queue_head);
  365. return;
  366. }
  367. /*
  368. * @rq should go through flush machinery. Mark it part of flush
  369. * sequence and submit for further processing.
  370. */
  371. memset(&rq->flush, 0, sizeof(rq->flush));
  372. INIT_LIST_HEAD(&rq->flush.list);
  373. rq->cmd_flags |= REQ_FLUSH_SEQ;
  374. rq->flush.saved_end_io = rq->end_io; /* Usually NULL */
  375. if (q->mq_ops) {
  376. rq->end_io = mq_flush_data_end_io;
  377. spin_lock_irq(&fq->mq_flush_lock);
  378. blk_flush_complete_seq(rq, fq, REQ_FSEQ_ACTIONS & ~policy, 0);
  379. spin_unlock_irq(&fq->mq_flush_lock);
  380. return;
  381. }
  382. rq->end_io = flush_data_end_io;
  383. blk_flush_complete_seq(rq, fq, REQ_FSEQ_ACTIONS & ~policy, 0);
  384. }
  385. /**
  386. * blkdev_issue_flush - queue a flush
  387. * @bdev: blockdev to issue flush for
  388. * @gfp_mask: memory allocation flags (for bio_alloc)
  389. * @error_sector: error sector
  390. *
  391. * Description:
  392. * Issue a flush for the block device in question. Caller can supply
  393. * room for storing the error offset in case of a flush error, if they
  394. * wish to. If WAIT flag is not passed then caller may check only what
  395. * request was pushed in some internal queue for later handling.
  396. */
  397. int blkdev_issue_flush(struct block_device *bdev, gfp_t gfp_mask,
  398. sector_t *error_sector)
  399. {
  400. struct request_queue *q;
  401. struct bio *bio;
  402. int ret = 0;
  403. if (bdev->bd_disk == NULL)
  404. return -ENXIO;
  405. q = bdev_get_queue(bdev);
  406. if (!q)
  407. return -ENXIO;
  408. /*
  409. * some block devices may not have their queue correctly set up here
  410. * (e.g. loop device without a backing file) and so issuing a flush
  411. * here will panic. Ensure there is a request function before issuing
  412. * the flush.
  413. */
  414. if (!q->make_request_fn)
  415. return -ENXIO;
  416. bio = bio_alloc(gfp_mask, 0);
  417. bio->bi_bdev = bdev;
  418. ret = submit_bio_wait(WRITE_FLUSH, bio);
  419. /*
  420. * The driver must store the error location in ->bi_sector, if
  421. * it supports it. For non-stacked drivers, this should be
  422. * copied from blk_rq_pos(rq).
  423. */
  424. if (error_sector)
  425. *error_sector = bio->bi_iter.bi_sector;
  426. bio_put(bio);
  427. return ret;
  428. }
  429. EXPORT_SYMBOL(blkdev_issue_flush);
  430. struct blk_flush_queue *blk_alloc_flush_queue(struct request_queue *q,
  431. int node, int cmd_size)
  432. {
  433. struct blk_flush_queue *fq;
  434. int rq_sz = sizeof(struct request);
  435. fq = kzalloc_node(sizeof(*fq), GFP_KERNEL, node);
  436. if (!fq)
  437. goto fail;
  438. if (q->mq_ops) {
  439. spin_lock_init(&fq->mq_flush_lock);
  440. rq_sz = round_up(rq_sz + cmd_size, cache_line_size());
  441. }
  442. fq->flush_rq = kzalloc_node(rq_sz, GFP_KERNEL, node);
  443. if (!fq->flush_rq)
  444. goto fail_rq;
  445. INIT_LIST_HEAD(&fq->flush_queue[0]);
  446. INIT_LIST_HEAD(&fq->flush_queue[1]);
  447. INIT_LIST_HEAD(&fq->flush_data_in_flight);
  448. return fq;
  449. fail_rq:
  450. kfree(fq);
  451. fail:
  452. return NULL;
  453. }
  454. void blk_free_flush_queue(struct blk_flush_queue *fq)
  455. {
  456. /* bio based request queue hasn't flush queue */
  457. if (!fq)
  458. return;
  459. kfree(fq->flush_rq);
  460. kfree(fq);
  461. }