blk-flush.c 15 KB

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