blk-flush.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578
  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_PREFLUSH makes sense, which
  14. * indicates a simple flush request. If there is data, REQ_PREFLUSH 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_PREFLUSH 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_PREFLUSH
  27. * is 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. * REQ_OP_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 RQF_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. #include "blk-mq-tag.h"
  75. /* FLUSH/FUA sequences */
  76. enum {
  77. REQ_FSEQ_PREFLUSH = (1 << 0), /* pre-flushing in progress */
  78. REQ_FSEQ_DATA = (1 << 1), /* data write in progress */
  79. REQ_FSEQ_POSTFLUSH = (1 << 2), /* post-flushing in progress */
  80. REQ_FSEQ_DONE = (1 << 3),
  81. REQ_FSEQ_ACTIONS = REQ_FSEQ_PREFLUSH | REQ_FSEQ_DATA |
  82. REQ_FSEQ_POSTFLUSH,
  83. /*
  84. * If flush has been pending longer than the following timeout,
  85. * it's issued even if flush_data requests are still in flight.
  86. */
  87. FLUSH_PENDING_TIMEOUT = 5 * HZ,
  88. };
  89. static bool blk_kick_flush(struct request_queue *q,
  90. struct blk_flush_queue *fq);
  91. static unsigned int blk_flush_policy(unsigned long fflags, struct request *rq)
  92. {
  93. unsigned int policy = 0;
  94. if (blk_rq_sectors(rq))
  95. policy |= REQ_FSEQ_DATA;
  96. if (fflags & (1UL << QUEUE_FLAG_WC)) {
  97. if (rq->cmd_flags & REQ_PREFLUSH)
  98. policy |= REQ_FSEQ_PREFLUSH;
  99. if (!(fflags & (1UL << QUEUE_FLAG_FUA)) &&
  100. (rq->cmd_flags & REQ_FUA))
  101. policy |= REQ_FSEQ_POSTFLUSH;
  102. }
  103. return policy;
  104. }
  105. static unsigned int blk_flush_cur_seq(struct request *rq)
  106. {
  107. return 1 << ffz(rq->flush.seq);
  108. }
  109. static void blk_flush_restore_request(struct request *rq)
  110. {
  111. /*
  112. * After flush data completion, @rq->bio is %NULL but we need to
  113. * complete the bio again. @rq->biotail is guaranteed to equal the
  114. * original @rq->bio. Restore it.
  115. */
  116. rq->bio = rq->biotail;
  117. /* make @rq a normal request */
  118. rq->rq_flags &= ~RQF_FLUSH_SEQ;
  119. rq->end_io = rq->flush.saved_end_io;
  120. }
  121. static bool blk_flush_queue_rq(struct request *rq, bool add_front)
  122. {
  123. if (rq->q->mq_ops) {
  124. blk_mq_add_to_requeue_list(rq, add_front, true);
  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. struct blk_mq_hw_ctx *hctx;
  206. /* release the tag's ownership to the req cloned from */
  207. spin_lock_irqsave(&fq->mq_flush_lock, flags);
  208. hctx = blk_mq_map_queue(q, flush_rq->mq_ctx->cpu);
  209. blk_mq_tag_set_rq(hctx, flush_rq->tag, fq->orig_rq);
  210. flush_rq->tag = -1;
  211. }
  212. running = &fq->flush_queue[fq->flush_running_idx];
  213. BUG_ON(fq->flush_pending_idx == fq->flush_running_idx);
  214. /* account completion of the flush request */
  215. fq->flush_running_idx ^= 1;
  216. if (!q->mq_ops)
  217. elv_completed_request(q, flush_rq);
  218. /* and push the waiting requests to the next stage */
  219. list_for_each_entry_safe(rq, n, running, flush.list) {
  220. unsigned int seq = blk_flush_cur_seq(rq);
  221. BUG_ON(seq != REQ_FSEQ_PREFLUSH && seq != REQ_FSEQ_POSTFLUSH);
  222. queued |= blk_flush_complete_seq(rq, fq, seq, error);
  223. }
  224. /*
  225. * Kick the queue to avoid stall for two cases:
  226. * 1. Moving a request silently to empty queue_head may stall the
  227. * queue.
  228. * 2. When flush request is running in non-queueable queue, the
  229. * queue is hold. Restart the queue after flush request is finished
  230. * to avoid stall.
  231. * This function is called from request completion path and calling
  232. * directly into request_fn may confuse the driver. Always use
  233. * kblockd.
  234. */
  235. if (queued || fq->flush_queue_delayed) {
  236. WARN_ON(q->mq_ops);
  237. blk_run_queue_async(q);
  238. }
  239. fq->flush_queue_delayed = 0;
  240. if (q->mq_ops)
  241. spin_unlock_irqrestore(&fq->mq_flush_lock, flags);
  242. }
  243. /**
  244. * blk_kick_flush - consider issuing flush request
  245. * @q: request_queue being kicked
  246. * @fq: flush queue
  247. *
  248. * Flush related states of @q have changed, consider issuing flush request.
  249. * Please read the comment at the top of this file for more info.
  250. *
  251. * CONTEXT:
  252. * spin_lock_irq(q->queue_lock or fq->mq_flush_lock)
  253. *
  254. * RETURNS:
  255. * %true if flush was issued, %false otherwise.
  256. */
  257. static bool blk_kick_flush(struct request_queue *q, struct blk_flush_queue *fq)
  258. {
  259. struct list_head *pending = &fq->flush_queue[fq->flush_pending_idx];
  260. struct request *first_rq =
  261. list_first_entry(pending, struct request, flush.list);
  262. struct request *flush_rq = fq->flush_rq;
  263. /* C1 described at the top of this file */
  264. if (fq->flush_pending_idx != fq->flush_running_idx || list_empty(pending))
  265. return false;
  266. /* C2 and C3 */
  267. if (!list_empty(&fq->flush_data_in_flight) &&
  268. time_before(jiffies,
  269. fq->flush_pending_since + FLUSH_PENDING_TIMEOUT))
  270. return false;
  271. /*
  272. * Issue flush and toggle pending_idx. This makes pending_idx
  273. * different from running_idx, which means flush is in flight.
  274. */
  275. fq->flush_pending_idx ^= 1;
  276. blk_rq_init(q, flush_rq);
  277. /*
  278. * Borrow tag from the first request since they can't
  279. * be in flight at the same time. And acquire the tag's
  280. * ownership for flush req.
  281. */
  282. if (q->mq_ops) {
  283. struct blk_mq_hw_ctx *hctx;
  284. flush_rq->mq_ctx = first_rq->mq_ctx;
  285. flush_rq->tag = first_rq->tag;
  286. fq->orig_rq = first_rq;
  287. hctx = blk_mq_map_queue(q, first_rq->mq_ctx->cpu);
  288. blk_mq_tag_set_rq(hctx, first_rq->tag, flush_rq);
  289. }
  290. flush_rq->cmd_type = REQ_TYPE_FS;
  291. flush_rq->cmd_flags = REQ_OP_FLUSH | REQ_PREFLUSH;
  292. flush_rq->rq_flags |= RQF_FLUSH_SEQ;
  293. flush_rq->rq_disk = first_rq->rq_disk;
  294. flush_rq->end_io = flush_end_io;
  295. return blk_flush_queue_rq(flush_rq, false);
  296. }
  297. static void flush_data_end_io(struct request *rq, int error)
  298. {
  299. struct request_queue *q = rq->q;
  300. struct blk_flush_queue *fq = blk_get_flush_queue(q, NULL);
  301. /*
  302. * Updating q->in_flight[] here for making this tag usable
  303. * early. Because in blk_queue_start_tag(),
  304. * q->in_flight[BLK_RW_ASYNC] is used to limit async I/O and
  305. * reserve tags for sync I/O.
  306. *
  307. * More importantly this way can avoid the following I/O
  308. * deadlock:
  309. *
  310. * - suppose there are 40 fua requests comming to flush queue
  311. * and queue depth is 31
  312. * - 30 rqs are scheduled then blk_queue_start_tag() can't alloc
  313. * tag for async I/O any more
  314. * - all the 30 rqs are completed before FLUSH_PENDING_TIMEOUT
  315. * and flush_data_end_io() is called
  316. * - the other rqs still can't go ahead if not updating
  317. * q->in_flight[BLK_RW_ASYNC] here, meantime these rqs
  318. * are held in flush data queue and make no progress of
  319. * handling post flush rq
  320. * - only after the post flush rq is handled, all these rqs
  321. * can be completed
  322. */
  323. elv_completed_request(q, rq);
  324. /* for avoiding double accounting */
  325. rq->rq_flags &= ~RQF_STARTED;
  326. /*
  327. * After populating an empty queue, kick it to avoid stall. Read
  328. * the comment in flush_end_io().
  329. */
  330. if (blk_flush_complete_seq(rq, fq, REQ_FSEQ_DATA, error))
  331. blk_run_queue_async(q);
  332. }
  333. static void mq_flush_data_end_io(struct request *rq, int error)
  334. {
  335. struct request_queue *q = rq->q;
  336. struct blk_mq_hw_ctx *hctx;
  337. struct blk_mq_ctx *ctx = rq->mq_ctx;
  338. unsigned long flags;
  339. struct blk_flush_queue *fq = blk_get_flush_queue(q, ctx);
  340. hctx = blk_mq_map_queue(q, ctx->cpu);
  341. /*
  342. * After populating an empty queue, kick it to avoid stall. Read
  343. * the comment in flush_end_io().
  344. */
  345. spin_lock_irqsave(&fq->mq_flush_lock, flags);
  346. if (blk_flush_complete_seq(rq, fq, REQ_FSEQ_DATA, error))
  347. blk_mq_run_hw_queue(hctx, true);
  348. spin_unlock_irqrestore(&fq->mq_flush_lock, flags);
  349. }
  350. /**
  351. * blk_insert_flush - insert a new FLUSH/FUA request
  352. * @rq: request to insert
  353. *
  354. * To be called from __elv_add_request() for %ELEVATOR_INSERT_FLUSH insertions.
  355. * or __blk_mq_run_hw_queue() to dispatch request.
  356. * @rq is being submitted. Analyze what needs to be done and put it on the
  357. * right queue.
  358. *
  359. * CONTEXT:
  360. * spin_lock_irq(q->queue_lock) in !mq case
  361. */
  362. void blk_insert_flush(struct request *rq)
  363. {
  364. struct request_queue *q = rq->q;
  365. unsigned long fflags = q->queue_flags; /* may change, cache */
  366. unsigned int policy = blk_flush_policy(fflags, rq);
  367. struct blk_flush_queue *fq = blk_get_flush_queue(q, rq->mq_ctx);
  368. /*
  369. * @policy now records what operations need to be done. Adjust
  370. * REQ_PREFLUSH and FUA for the driver.
  371. */
  372. rq->cmd_flags &= ~REQ_PREFLUSH;
  373. if (!(fflags & (1UL << QUEUE_FLAG_FUA)))
  374. rq->cmd_flags &= ~REQ_FUA;
  375. /*
  376. * REQ_PREFLUSH|REQ_FUA implies REQ_SYNC, so if we clear any
  377. * of those flags, we have to set REQ_SYNC to avoid skewing
  378. * the request accounting.
  379. */
  380. rq->cmd_flags |= REQ_SYNC;
  381. /*
  382. * An empty flush handed down from a stacking driver may
  383. * translate into nothing if the underlying device does not
  384. * advertise a write-back cache. In this case, simply
  385. * complete the request.
  386. */
  387. if (!policy) {
  388. if (q->mq_ops)
  389. blk_mq_end_request(rq, 0);
  390. else
  391. __blk_end_bidi_request(rq, 0, 0, 0);
  392. return;
  393. }
  394. BUG_ON(rq->bio != rq->biotail); /*assumes zero or single bio rq */
  395. /*
  396. * If there's data but flush is not necessary, the request can be
  397. * processed directly without going through flush machinery. Queue
  398. * for normal execution.
  399. */
  400. if ((policy & REQ_FSEQ_DATA) &&
  401. !(policy & (REQ_FSEQ_PREFLUSH | REQ_FSEQ_POSTFLUSH))) {
  402. if (q->mq_ops) {
  403. blk_mq_insert_request(rq, false, true, false);
  404. } else
  405. list_add_tail(&rq->queuelist, &q->queue_head);
  406. return;
  407. }
  408. /*
  409. * @rq should go through flush machinery. Mark it part of flush
  410. * sequence and submit for further processing.
  411. */
  412. memset(&rq->flush, 0, sizeof(rq->flush));
  413. INIT_LIST_HEAD(&rq->flush.list);
  414. rq->rq_flags |= RQF_FLUSH_SEQ;
  415. rq->flush.saved_end_io = rq->end_io; /* Usually NULL */
  416. if (q->mq_ops) {
  417. rq->end_io = mq_flush_data_end_io;
  418. spin_lock_irq(&fq->mq_flush_lock);
  419. blk_flush_complete_seq(rq, fq, REQ_FSEQ_ACTIONS & ~policy, 0);
  420. spin_unlock_irq(&fq->mq_flush_lock);
  421. return;
  422. }
  423. rq->end_io = flush_data_end_io;
  424. blk_flush_complete_seq(rq, fq, REQ_FSEQ_ACTIONS & ~policy, 0);
  425. }
  426. /**
  427. * blkdev_issue_flush - queue a flush
  428. * @bdev: blockdev to issue flush for
  429. * @gfp_mask: memory allocation flags (for bio_alloc)
  430. * @error_sector: error sector
  431. *
  432. * Description:
  433. * Issue a flush for the block device in question. Caller can supply
  434. * room for storing the error offset in case of a flush error, if they
  435. * wish to. If WAIT flag is not passed then caller may check only what
  436. * request was pushed in some internal queue for later handling.
  437. */
  438. int blkdev_issue_flush(struct block_device *bdev, gfp_t gfp_mask,
  439. sector_t *error_sector)
  440. {
  441. struct request_queue *q;
  442. struct bio *bio;
  443. int ret = 0;
  444. if (bdev->bd_disk == NULL)
  445. return -ENXIO;
  446. q = bdev_get_queue(bdev);
  447. if (!q)
  448. return -ENXIO;
  449. /*
  450. * some block devices may not have their queue correctly set up here
  451. * (e.g. loop device without a backing file) and so issuing a flush
  452. * here will panic. Ensure there is a request function before issuing
  453. * the flush.
  454. */
  455. if (!q->make_request_fn)
  456. return -ENXIO;
  457. bio = bio_alloc(gfp_mask, 0);
  458. bio->bi_bdev = bdev;
  459. bio->bi_opf = REQ_OP_WRITE | REQ_PREFLUSH;
  460. ret = submit_bio_wait(bio);
  461. /*
  462. * The driver must store the error location in ->bi_sector, if
  463. * it supports it. For non-stacked drivers, this should be
  464. * copied from blk_rq_pos(rq).
  465. */
  466. if (error_sector)
  467. *error_sector = bio->bi_iter.bi_sector;
  468. bio_put(bio);
  469. return ret;
  470. }
  471. EXPORT_SYMBOL(blkdev_issue_flush);
  472. struct blk_flush_queue *blk_alloc_flush_queue(struct request_queue *q,
  473. int node, int cmd_size)
  474. {
  475. struct blk_flush_queue *fq;
  476. int rq_sz = sizeof(struct request);
  477. fq = kzalloc_node(sizeof(*fq), GFP_KERNEL, node);
  478. if (!fq)
  479. goto fail;
  480. if (q->mq_ops) {
  481. spin_lock_init(&fq->mq_flush_lock);
  482. rq_sz = round_up(rq_sz + cmd_size, cache_line_size());
  483. }
  484. fq->flush_rq = kzalloc_node(rq_sz, GFP_KERNEL, node);
  485. if (!fq->flush_rq)
  486. goto fail_rq;
  487. INIT_LIST_HEAD(&fq->flush_queue[0]);
  488. INIT_LIST_HEAD(&fq->flush_queue[1]);
  489. INIT_LIST_HEAD(&fq->flush_data_in_flight);
  490. return fq;
  491. fail_rq:
  492. kfree(fq);
  493. fail:
  494. return NULL;
  495. }
  496. void blk_free_flush_queue(struct blk_flush_queue *fq)
  497. {
  498. /* bio based request queue hasn't flush queue */
  499. if (!fq)
  500. return;
  501. kfree(fq->flush_rq);
  502. kfree(fq);
  503. }