dm-rq.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853
  1. /*
  2. * Copyright (C) 2016 Red Hat, Inc. All rights reserved.
  3. *
  4. * This file is released under the GPL.
  5. */
  6. #include "dm-core.h"
  7. #include "dm-rq.h"
  8. #include <linux/elevator.h> /* for rq_end_sector() */
  9. #include <linux/blk-mq.h>
  10. #define DM_MSG_PREFIX "core-rq"
  11. #define DM_MQ_NR_HW_QUEUES 1
  12. #define DM_MQ_QUEUE_DEPTH 2048
  13. static unsigned dm_mq_nr_hw_queues = DM_MQ_NR_HW_QUEUES;
  14. static unsigned dm_mq_queue_depth = DM_MQ_QUEUE_DEPTH;
  15. /*
  16. * Request-based DM's mempools' reserved IOs set by the user.
  17. */
  18. #define RESERVED_REQUEST_BASED_IOS 256
  19. static unsigned reserved_rq_based_ios = RESERVED_REQUEST_BASED_IOS;
  20. static bool use_blk_mq = IS_ENABLED(CONFIG_DM_MQ_DEFAULT);
  21. bool dm_use_blk_mq_default(void)
  22. {
  23. return use_blk_mq;
  24. }
  25. bool dm_use_blk_mq(struct mapped_device *md)
  26. {
  27. return md->use_blk_mq;
  28. }
  29. EXPORT_SYMBOL_GPL(dm_use_blk_mq);
  30. unsigned dm_get_reserved_rq_based_ios(void)
  31. {
  32. return __dm_get_module_param(&reserved_rq_based_ios,
  33. RESERVED_REQUEST_BASED_IOS, DM_RESERVED_MAX_IOS);
  34. }
  35. EXPORT_SYMBOL_GPL(dm_get_reserved_rq_based_ios);
  36. static unsigned dm_get_blk_mq_nr_hw_queues(void)
  37. {
  38. return __dm_get_module_param(&dm_mq_nr_hw_queues, 1, 32);
  39. }
  40. static unsigned dm_get_blk_mq_queue_depth(void)
  41. {
  42. return __dm_get_module_param(&dm_mq_queue_depth,
  43. DM_MQ_QUEUE_DEPTH, BLK_MQ_MAX_DEPTH);
  44. }
  45. int dm_request_based(struct mapped_device *md)
  46. {
  47. return blk_queue_stackable(md->queue);
  48. }
  49. static void dm_old_start_queue(struct request_queue *q)
  50. {
  51. unsigned long flags;
  52. spin_lock_irqsave(q->queue_lock, flags);
  53. if (blk_queue_stopped(q))
  54. blk_start_queue(q);
  55. spin_unlock_irqrestore(q->queue_lock, flags);
  56. }
  57. static void dm_mq_start_queue(struct request_queue *q)
  58. {
  59. blk_mq_start_stopped_hw_queues(q, true);
  60. blk_mq_kick_requeue_list(q);
  61. }
  62. void dm_start_queue(struct request_queue *q)
  63. {
  64. if (!q->mq_ops)
  65. dm_old_start_queue(q);
  66. else
  67. dm_mq_start_queue(q);
  68. }
  69. static void dm_old_stop_queue(struct request_queue *q)
  70. {
  71. unsigned long flags;
  72. spin_lock_irqsave(q->queue_lock, flags);
  73. if (!blk_queue_stopped(q))
  74. blk_stop_queue(q);
  75. spin_unlock_irqrestore(q->queue_lock, flags);
  76. }
  77. static void dm_mq_stop_queue(struct request_queue *q)
  78. {
  79. if (blk_mq_queue_stopped(q))
  80. return;
  81. blk_mq_quiesce_queue(q);
  82. }
  83. void dm_stop_queue(struct request_queue *q)
  84. {
  85. if (!q->mq_ops)
  86. dm_old_stop_queue(q);
  87. else
  88. dm_mq_stop_queue(q);
  89. }
  90. /*
  91. * Partial completion handling for request-based dm
  92. */
  93. static void end_clone_bio(struct bio *clone)
  94. {
  95. struct dm_rq_clone_bio_info *info =
  96. container_of(clone, struct dm_rq_clone_bio_info, clone);
  97. struct dm_rq_target_io *tio = info->tio;
  98. struct bio *bio = info->orig;
  99. unsigned int nr_bytes = info->orig->bi_iter.bi_size;
  100. int error = clone->bi_error;
  101. bio_put(clone);
  102. if (tio->error)
  103. /*
  104. * An error has already been detected on the request.
  105. * Once error occurred, just let clone->end_io() handle
  106. * the remainder.
  107. */
  108. return;
  109. else if (error) {
  110. /*
  111. * Don't notice the error to the upper layer yet.
  112. * The error handling decision is made by the target driver,
  113. * when the request is completed.
  114. */
  115. tio->error = error;
  116. return;
  117. }
  118. /*
  119. * I/O for the bio successfully completed.
  120. * Notice the data completion to the upper layer.
  121. */
  122. /*
  123. * bios are processed from the head of the list.
  124. * So the completing bio should always be rq->bio.
  125. * If it's not, something wrong is happening.
  126. */
  127. if (tio->orig->bio != bio)
  128. DMERR("bio completion is going in the middle of the request");
  129. /*
  130. * Update the original request.
  131. * Do not use blk_end_request() here, because it may complete
  132. * the original request before the clone, and break the ordering.
  133. */
  134. blk_update_request(tio->orig, 0, nr_bytes);
  135. }
  136. static struct dm_rq_target_io *tio_from_request(struct request *rq)
  137. {
  138. return blk_mq_rq_to_pdu(rq);
  139. }
  140. static void rq_end_stats(struct mapped_device *md, struct request *orig)
  141. {
  142. if (unlikely(dm_stats_used(&md->stats))) {
  143. struct dm_rq_target_io *tio = tio_from_request(orig);
  144. tio->duration_jiffies = jiffies - tio->duration_jiffies;
  145. dm_stats_account_io(&md->stats, rq_data_dir(orig),
  146. blk_rq_pos(orig), tio->n_sectors, true,
  147. tio->duration_jiffies, &tio->stats_aux);
  148. }
  149. }
  150. /*
  151. * Don't touch any member of the md after calling this function because
  152. * the md may be freed in dm_put() at the end of this function.
  153. * Or do dm_get() before calling this function and dm_put() later.
  154. */
  155. static void rq_completed(struct mapped_device *md, int rw, bool run_queue)
  156. {
  157. struct request_queue *q = md->queue;
  158. unsigned long flags;
  159. atomic_dec(&md->pending[rw]);
  160. /* nudge anyone waiting on suspend queue */
  161. if (!md_in_flight(md))
  162. wake_up(&md->wait);
  163. /*
  164. * Run this off this callpath, as drivers could invoke end_io while
  165. * inside their request_fn (and holding the queue lock). Calling
  166. * back into ->request_fn() could deadlock attempting to grab the
  167. * queue lock again.
  168. */
  169. if (!q->mq_ops && run_queue) {
  170. spin_lock_irqsave(q->queue_lock, flags);
  171. blk_run_queue_async(q);
  172. spin_unlock_irqrestore(q->queue_lock, flags);
  173. }
  174. /*
  175. * dm_put() must be at the end of this function. See the comment above
  176. */
  177. dm_put(md);
  178. }
  179. /*
  180. * Complete the clone and the original request.
  181. * Must be called without clone's queue lock held,
  182. * see end_clone_request() for more details.
  183. */
  184. static void dm_end_request(struct request *clone, int error)
  185. {
  186. int rw = rq_data_dir(clone);
  187. struct dm_rq_target_io *tio = clone->end_io_data;
  188. struct mapped_device *md = tio->md;
  189. struct request *rq = tio->orig;
  190. blk_rq_unprep_clone(clone);
  191. tio->ti->type->release_clone_rq(clone);
  192. rq_end_stats(md, rq);
  193. if (!rq->q->mq_ops)
  194. blk_end_request_all(rq, error);
  195. else
  196. blk_mq_end_request(rq, error);
  197. rq_completed(md, rw, true);
  198. }
  199. /*
  200. * Requeue the original request of a clone.
  201. */
  202. static void dm_old_requeue_request(struct request *rq)
  203. {
  204. struct request_queue *q = rq->q;
  205. unsigned long flags;
  206. spin_lock_irqsave(q->queue_lock, flags);
  207. blk_requeue_request(q, rq);
  208. blk_run_queue_async(q);
  209. spin_unlock_irqrestore(q->queue_lock, flags);
  210. }
  211. static void __dm_mq_kick_requeue_list(struct request_queue *q, unsigned long msecs)
  212. {
  213. blk_mq_delay_kick_requeue_list(q, msecs);
  214. }
  215. void dm_mq_kick_requeue_list(struct mapped_device *md)
  216. {
  217. __dm_mq_kick_requeue_list(dm_get_md_queue(md), 0);
  218. }
  219. EXPORT_SYMBOL(dm_mq_kick_requeue_list);
  220. static void dm_mq_delay_requeue_request(struct request *rq, unsigned long msecs)
  221. {
  222. blk_mq_requeue_request(rq, false);
  223. __dm_mq_kick_requeue_list(rq->q, msecs);
  224. }
  225. static void dm_requeue_original_request(struct dm_rq_target_io *tio, bool delay_requeue)
  226. {
  227. struct mapped_device *md = tio->md;
  228. struct request *rq = tio->orig;
  229. int rw = rq_data_dir(rq);
  230. rq_end_stats(md, rq);
  231. if (tio->clone) {
  232. blk_rq_unprep_clone(tio->clone);
  233. tio->ti->type->release_clone_rq(tio->clone);
  234. }
  235. if (!rq->q->mq_ops)
  236. dm_old_requeue_request(rq);
  237. else
  238. dm_mq_delay_requeue_request(rq, delay_requeue ? 100/*ms*/ : 0);
  239. rq_completed(md, rw, false);
  240. }
  241. static void dm_done(struct request *clone, int error, bool mapped)
  242. {
  243. int r = DM_ENDIO_DONE;
  244. struct dm_rq_target_io *tio = clone->end_io_data;
  245. dm_request_endio_fn rq_end_io = NULL;
  246. if (tio->ti) {
  247. rq_end_io = tio->ti->type->rq_end_io;
  248. if (mapped && rq_end_io)
  249. r = rq_end_io(tio->ti, clone, error, &tio->info);
  250. }
  251. if (unlikely(error == -EREMOTEIO)) {
  252. if (req_op(clone) == REQ_OP_WRITE_SAME &&
  253. !clone->q->limits.max_write_same_sectors)
  254. disable_write_same(tio->md);
  255. if (req_op(clone) == REQ_OP_WRITE_ZEROES &&
  256. !clone->q->limits.max_write_zeroes_sectors)
  257. disable_write_zeroes(tio->md);
  258. }
  259. switch (r) {
  260. case DM_ENDIO_DONE:
  261. /* The target wants to complete the I/O */
  262. dm_end_request(clone, error);
  263. break;
  264. case DM_ENDIO_INCOMPLETE:
  265. /* The target will handle the I/O */
  266. return;
  267. case DM_ENDIO_REQUEUE:
  268. /* The target wants to requeue the I/O */
  269. dm_requeue_original_request(tio, false);
  270. break;
  271. default:
  272. DMWARN("unimplemented target endio return value: %d", r);
  273. BUG();
  274. }
  275. }
  276. /*
  277. * Request completion handler for request-based dm
  278. */
  279. static void dm_softirq_done(struct request *rq)
  280. {
  281. bool mapped = true;
  282. struct dm_rq_target_io *tio = tio_from_request(rq);
  283. struct request *clone = tio->clone;
  284. int rw;
  285. if (!clone) {
  286. struct mapped_device *md = tio->md;
  287. rq_end_stats(md, rq);
  288. rw = rq_data_dir(rq);
  289. if (!rq->q->mq_ops)
  290. blk_end_request_all(rq, tio->error);
  291. else
  292. blk_mq_end_request(rq, tio->error);
  293. rq_completed(md, rw, false);
  294. return;
  295. }
  296. if (rq->rq_flags & RQF_FAILED)
  297. mapped = false;
  298. dm_done(clone, tio->error, mapped);
  299. }
  300. /*
  301. * Complete the clone and the original request with the error status
  302. * through softirq context.
  303. */
  304. static void dm_complete_request(struct request *rq, int error)
  305. {
  306. struct dm_rq_target_io *tio = tio_from_request(rq);
  307. tio->error = error;
  308. if (!rq->q->mq_ops)
  309. blk_complete_request(rq);
  310. else
  311. blk_mq_complete_request(rq);
  312. }
  313. /*
  314. * Complete the not-mapped clone and the original request with the error status
  315. * through softirq context.
  316. * Target's rq_end_io() function isn't called.
  317. * This may be used when the target's map_rq() or clone_and_map_rq() functions fail.
  318. */
  319. static void dm_kill_unmapped_request(struct request *rq, int error)
  320. {
  321. rq->rq_flags |= RQF_FAILED;
  322. dm_complete_request(rq, error);
  323. }
  324. /*
  325. * Called with the clone's queue lock held (in the case of .request_fn)
  326. */
  327. static void end_clone_request(struct request *clone, int error)
  328. {
  329. struct dm_rq_target_io *tio = clone->end_io_data;
  330. /*
  331. * Actual request completion is done in a softirq context which doesn't
  332. * hold the clone's queue lock. Otherwise, deadlock could occur because:
  333. * - another request may be submitted by the upper level driver
  334. * of the stacking during the completion
  335. * - the submission which requires queue lock may be done
  336. * against this clone's queue
  337. */
  338. dm_complete_request(tio->orig, error);
  339. }
  340. static void dm_dispatch_clone_request(struct request *clone, struct request *rq)
  341. {
  342. int r;
  343. if (blk_queue_io_stat(clone->q))
  344. clone->rq_flags |= RQF_IO_STAT;
  345. clone->start_time = jiffies;
  346. r = blk_insert_cloned_request(clone->q, clone);
  347. if (r)
  348. /* must complete clone in terms of original request */
  349. dm_complete_request(rq, r);
  350. }
  351. static int dm_rq_bio_constructor(struct bio *bio, struct bio *bio_orig,
  352. void *data)
  353. {
  354. struct dm_rq_target_io *tio = data;
  355. struct dm_rq_clone_bio_info *info =
  356. container_of(bio, struct dm_rq_clone_bio_info, clone);
  357. info->orig = bio_orig;
  358. info->tio = tio;
  359. bio->bi_end_io = end_clone_bio;
  360. return 0;
  361. }
  362. static int setup_clone(struct request *clone, struct request *rq,
  363. struct dm_rq_target_io *tio, gfp_t gfp_mask)
  364. {
  365. int r;
  366. r = blk_rq_prep_clone(clone, rq, tio->md->bs, gfp_mask,
  367. dm_rq_bio_constructor, tio);
  368. if (r)
  369. return r;
  370. clone->end_io = end_clone_request;
  371. clone->end_io_data = tio;
  372. tio->clone = clone;
  373. return 0;
  374. }
  375. static void map_tio_request(struct kthread_work *work);
  376. static void init_tio(struct dm_rq_target_io *tio, struct request *rq,
  377. struct mapped_device *md)
  378. {
  379. tio->md = md;
  380. tio->ti = NULL;
  381. tio->clone = NULL;
  382. tio->orig = rq;
  383. tio->error = 0;
  384. /*
  385. * Avoid initializing info for blk-mq; it passes
  386. * target-specific data through info.ptr
  387. * (see: dm_mq_init_request)
  388. */
  389. if (!md->init_tio_pdu)
  390. memset(&tio->info, 0, sizeof(tio->info));
  391. if (md->kworker_task)
  392. kthread_init_work(&tio->work, map_tio_request);
  393. }
  394. /*
  395. * Returns:
  396. * DM_MAPIO_* : the request has been processed as indicated
  397. * DM_MAPIO_REQUEUE : the original request needs to be immediately requeued
  398. * < 0 : the request was completed due to failure
  399. */
  400. static int map_request(struct dm_rq_target_io *tio)
  401. {
  402. int r;
  403. struct dm_target *ti = tio->ti;
  404. struct mapped_device *md = tio->md;
  405. struct request *rq = tio->orig;
  406. struct request *clone = NULL;
  407. r = ti->type->clone_and_map_rq(ti, rq, &tio->info, &clone);
  408. switch (r) {
  409. case DM_MAPIO_SUBMITTED:
  410. /* The target has taken the I/O to submit by itself later */
  411. break;
  412. case DM_MAPIO_REMAPPED:
  413. if (setup_clone(clone, rq, tio, GFP_ATOMIC)) {
  414. /* -ENOMEM */
  415. ti->type->release_clone_rq(clone);
  416. return DM_MAPIO_REQUEUE;
  417. }
  418. /* The target has remapped the I/O so dispatch it */
  419. trace_block_rq_remap(clone->q, clone, disk_devt(dm_disk(md)),
  420. blk_rq_pos(rq));
  421. dm_dispatch_clone_request(clone, rq);
  422. break;
  423. case DM_MAPIO_REQUEUE:
  424. /* The target wants to requeue the I/O */
  425. break;
  426. case DM_MAPIO_DELAY_REQUEUE:
  427. /* The target wants to requeue the I/O after a delay */
  428. dm_requeue_original_request(tio, true);
  429. break;
  430. case DM_MAPIO_KILL:
  431. /* The target wants to complete the I/O */
  432. dm_kill_unmapped_request(rq, -EIO);
  433. break;
  434. default:
  435. DMWARN("unimplemented target map return value: %d", r);
  436. BUG();
  437. }
  438. return r;
  439. }
  440. static void dm_start_request(struct mapped_device *md, struct request *orig)
  441. {
  442. if (!orig->q->mq_ops)
  443. blk_start_request(orig);
  444. else
  445. blk_mq_start_request(orig);
  446. atomic_inc(&md->pending[rq_data_dir(orig)]);
  447. if (md->seq_rq_merge_deadline_usecs) {
  448. md->last_rq_pos = rq_end_sector(orig);
  449. md->last_rq_rw = rq_data_dir(orig);
  450. md->last_rq_start_time = ktime_get();
  451. }
  452. if (unlikely(dm_stats_used(&md->stats))) {
  453. struct dm_rq_target_io *tio = tio_from_request(orig);
  454. tio->duration_jiffies = jiffies;
  455. tio->n_sectors = blk_rq_sectors(orig);
  456. dm_stats_account_io(&md->stats, rq_data_dir(orig),
  457. blk_rq_pos(orig), tio->n_sectors, false, 0,
  458. &tio->stats_aux);
  459. }
  460. /*
  461. * Hold the md reference here for the in-flight I/O.
  462. * We can't rely on the reference count by device opener,
  463. * because the device may be closed during the request completion
  464. * when all bios are completed.
  465. * See the comment in rq_completed() too.
  466. */
  467. dm_get(md);
  468. }
  469. static int __dm_rq_init_rq(struct mapped_device *md, struct request *rq)
  470. {
  471. struct dm_rq_target_io *tio = blk_mq_rq_to_pdu(rq);
  472. /*
  473. * Must initialize md member of tio, otherwise it won't
  474. * be available in dm_mq_queue_rq.
  475. */
  476. tio->md = md;
  477. if (md->init_tio_pdu) {
  478. /* target-specific per-io data is immediately after the tio */
  479. tio->info.ptr = tio + 1;
  480. }
  481. return 0;
  482. }
  483. static int dm_rq_init_rq(struct request_queue *q, struct request *rq, gfp_t gfp)
  484. {
  485. return __dm_rq_init_rq(q->rq_alloc_data, rq);
  486. }
  487. static void map_tio_request(struct kthread_work *work)
  488. {
  489. struct dm_rq_target_io *tio = container_of(work, struct dm_rq_target_io, work);
  490. if (map_request(tio) == DM_MAPIO_REQUEUE)
  491. dm_requeue_original_request(tio, false);
  492. }
  493. ssize_t dm_attr_rq_based_seq_io_merge_deadline_show(struct mapped_device *md, char *buf)
  494. {
  495. return sprintf(buf, "%u\n", md->seq_rq_merge_deadline_usecs);
  496. }
  497. #define MAX_SEQ_RQ_MERGE_DEADLINE_USECS 100000
  498. ssize_t dm_attr_rq_based_seq_io_merge_deadline_store(struct mapped_device *md,
  499. const char *buf, size_t count)
  500. {
  501. unsigned deadline;
  502. if (dm_get_md_type(md) != DM_TYPE_REQUEST_BASED)
  503. return count;
  504. if (kstrtouint(buf, 10, &deadline))
  505. return -EINVAL;
  506. if (deadline > MAX_SEQ_RQ_MERGE_DEADLINE_USECS)
  507. deadline = MAX_SEQ_RQ_MERGE_DEADLINE_USECS;
  508. md->seq_rq_merge_deadline_usecs = deadline;
  509. return count;
  510. }
  511. static bool dm_old_request_peeked_before_merge_deadline(struct mapped_device *md)
  512. {
  513. ktime_t kt_deadline;
  514. if (!md->seq_rq_merge_deadline_usecs)
  515. return false;
  516. kt_deadline = ns_to_ktime((u64)md->seq_rq_merge_deadline_usecs * NSEC_PER_USEC);
  517. kt_deadline = ktime_add_safe(md->last_rq_start_time, kt_deadline);
  518. return !ktime_after(ktime_get(), kt_deadline);
  519. }
  520. /*
  521. * q->request_fn for old request-based dm.
  522. * Called with the queue lock held.
  523. */
  524. static void dm_old_request_fn(struct request_queue *q)
  525. {
  526. struct mapped_device *md = q->queuedata;
  527. struct dm_target *ti = md->immutable_target;
  528. struct request *rq;
  529. struct dm_rq_target_io *tio;
  530. sector_t pos = 0;
  531. if (unlikely(!ti)) {
  532. int srcu_idx;
  533. struct dm_table *map = dm_get_live_table(md, &srcu_idx);
  534. if (unlikely(!map)) {
  535. dm_put_live_table(md, srcu_idx);
  536. return;
  537. }
  538. ti = dm_table_find_target(map, pos);
  539. dm_put_live_table(md, srcu_idx);
  540. }
  541. /*
  542. * For suspend, check blk_queue_stopped() and increment
  543. * ->pending within a single queue_lock not to increment the
  544. * number of in-flight I/Os after the queue is stopped in
  545. * dm_suspend().
  546. */
  547. while (!blk_queue_stopped(q)) {
  548. rq = blk_peek_request(q);
  549. if (!rq)
  550. return;
  551. /* always use block 0 to find the target for flushes for now */
  552. pos = 0;
  553. if (req_op(rq) != REQ_OP_FLUSH)
  554. pos = blk_rq_pos(rq);
  555. if ((dm_old_request_peeked_before_merge_deadline(md) &&
  556. md_in_flight(md) && rq->bio && !bio_multiple_segments(rq->bio) &&
  557. md->last_rq_pos == pos && md->last_rq_rw == rq_data_dir(rq)) ||
  558. (ti->type->busy && ti->type->busy(ti))) {
  559. blk_delay_queue(q, 10);
  560. return;
  561. }
  562. dm_start_request(md, rq);
  563. tio = tio_from_request(rq);
  564. init_tio(tio, rq, md);
  565. /* Establish tio->ti before queuing work (map_tio_request) */
  566. tio->ti = ti;
  567. kthread_queue_work(&md->kworker, &tio->work);
  568. BUG_ON(!irqs_disabled());
  569. }
  570. }
  571. /*
  572. * Fully initialize a .request_fn request-based queue.
  573. */
  574. int dm_old_init_request_queue(struct mapped_device *md, struct dm_table *t)
  575. {
  576. struct dm_target *immutable_tgt;
  577. /* Fully initialize the queue */
  578. md->queue->cmd_size = sizeof(struct dm_rq_target_io);
  579. md->queue->rq_alloc_data = md;
  580. md->queue->request_fn = dm_old_request_fn;
  581. md->queue->init_rq_fn = dm_rq_init_rq;
  582. immutable_tgt = dm_table_get_immutable_target(t);
  583. if (immutable_tgt && immutable_tgt->per_io_data_size) {
  584. /* any target-specific per-io data is immediately after the tio */
  585. md->queue->cmd_size += immutable_tgt->per_io_data_size;
  586. md->init_tio_pdu = true;
  587. }
  588. if (blk_init_allocated_queue(md->queue) < 0)
  589. return -EINVAL;
  590. /* disable dm_old_request_fn's merge heuristic by default */
  591. md->seq_rq_merge_deadline_usecs = 0;
  592. dm_init_normal_md_queue(md);
  593. blk_queue_softirq_done(md->queue, dm_softirq_done);
  594. /* Initialize the request-based DM worker thread */
  595. kthread_init_worker(&md->kworker);
  596. md->kworker_task = kthread_run(kthread_worker_fn, &md->kworker,
  597. "kdmwork-%s", dm_device_name(md));
  598. if (IS_ERR(md->kworker_task)) {
  599. int error = PTR_ERR(md->kworker_task);
  600. md->kworker_task = NULL;
  601. return error;
  602. }
  603. elv_register_queue(md->queue);
  604. return 0;
  605. }
  606. static int dm_mq_init_request(struct blk_mq_tag_set *set, struct request *rq,
  607. unsigned int hctx_idx, unsigned int numa_node)
  608. {
  609. return __dm_rq_init_rq(set->driver_data, rq);
  610. }
  611. static int dm_mq_queue_rq(struct blk_mq_hw_ctx *hctx,
  612. const struct blk_mq_queue_data *bd)
  613. {
  614. struct request *rq = bd->rq;
  615. struct dm_rq_target_io *tio = blk_mq_rq_to_pdu(rq);
  616. struct mapped_device *md = tio->md;
  617. struct dm_target *ti = md->immutable_target;
  618. if (unlikely(!ti)) {
  619. int srcu_idx;
  620. struct dm_table *map = dm_get_live_table(md, &srcu_idx);
  621. ti = dm_table_find_target(map, 0);
  622. dm_put_live_table(md, srcu_idx);
  623. }
  624. if (ti->type->busy && ti->type->busy(ti))
  625. return BLK_MQ_RQ_QUEUE_BUSY;
  626. dm_start_request(md, rq);
  627. /* Init tio using md established in .init_request */
  628. init_tio(tio, rq, md);
  629. /*
  630. * Establish tio->ti before calling map_request().
  631. */
  632. tio->ti = ti;
  633. /* Direct call is fine since .queue_rq allows allocations */
  634. if (map_request(tio) == DM_MAPIO_REQUEUE) {
  635. /* Undo dm_start_request() before requeuing */
  636. rq_end_stats(md, rq);
  637. rq_completed(md, rq_data_dir(rq), false);
  638. blk_mq_delay_run_hw_queue(hctx, 100/*ms*/);
  639. return BLK_MQ_RQ_QUEUE_BUSY;
  640. }
  641. return BLK_MQ_RQ_QUEUE_OK;
  642. }
  643. static const struct blk_mq_ops dm_mq_ops = {
  644. .queue_rq = dm_mq_queue_rq,
  645. .complete = dm_softirq_done,
  646. .init_request = dm_mq_init_request,
  647. };
  648. int dm_mq_init_request_queue(struct mapped_device *md, struct dm_table *t)
  649. {
  650. struct request_queue *q;
  651. struct dm_target *immutable_tgt;
  652. int err;
  653. if (!dm_table_all_blk_mq_devices(t)) {
  654. DMERR("request-based dm-mq may only be stacked on blk-mq device(s)");
  655. return -EINVAL;
  656. }
  657. md->tag_set = kzalloc_node(sizeof(struct blk_mq_tag_set), GFP_KERNEL, md->numa_node_id);
  658. if (!md->tag_set)
  659. return -ENOMEM;
  660. md->tag_set->ops = &dm_mq_ops;
  661. md->tag_set->queue_depth = dm_get_blk_mq_queue_depth();
  662. md->tag_set->numa_node = md->numa_node_id;
  663. md->tag_set->flags = BLK_MQ_F_SHOULD_MERGE | BLK_MQ_F_SG_MERGE;
  664. md->tag_set->nr_hw_queues = dm_get_blk_mq_nr_hw_queues();
  665. md->tag_set->driver_data = md;
  666. md->tag_set->cmd_size = sizeof(struct dm_rq_target_io);
  667. immutable_tgt = dm_table_get_immutable_target(t);
  668. if (immutable_tgt && immutable_tgt->per_io_data_size) {
  669. /* any target-specific per-io data is immediately after the tio */
  670. md->tag_set->cmd_size += immutable_tgt->per_io_data_size;
  671. md->init_tio_pdu = true;
  672. }
  673. err = blk_mq_alloc_tag_set(md->tag_set);
  674. if (err)
  675. goto out_kfree_tag_set;
  676. q = blk_mq_init_allocated_queue(md->tag_set, md->queue);
  677. if (IS_ERR(q)) {
  678. err = PTR_ERR(q);
  679. goto out_tag_set;
  680. }
  681. dm_init_md_queue(md);
  682. /* backfill 'mq' sysfs registration normally done in blk_register_queue */
  683. err = blk_mq_register_dev(disk_to_dev(md->disk), q);
  684. if (err)
  685. goto out_cleanup_queue;
  686. return 0;
  687. out_cleanup_queue:
  688. blk_cleanup_queue(q);
  689. out_tag_set:
  690. blk_mq_free_tag_set(md->tag_set);
  691. out_kfree_tag_set:
  692. kfree(md->tag_set);
  693. return err;
  694. }
  695. void dm_mq_cleanup_mapped_device(struct mapped_device *md)
  696. {
  697. if (md->tag_set) {
  698. blk_mq_free_tag_set(md->tag_set);
  699. kfree(md->tag_set);
  700. }
  701. }
  702. module_param(reserved_rq_based_ios, uint, S_IRUGO | S_IWUSR);
  703. MODULE_PARM_DESC(reserved_rq_based_ios, "Reserved IOs in request-based mempools");
  704. module_param(use_blk_mq, bool, S_IRUGO | S_IWUSR);
  705. MODULE_PARM_DESC(use_blk_mq, "Use block multiqueue for request-based DM devices");
  706. module_param(dm_mq_nr_hw_queues, uint, S_IRUGO | S_IWUSR);
  707. MODULE_PARM_DESC(dm_mq_nr_hw_queues, "Number of hardware queues for request-based dm-mq devices");
  708. module_param(dm_mq_queue_depth, uint, S_IRUGO | S_IWUSR);
  709. MODULE_PARM_DESC(dm_mq_queue_depth, "Queue depth for request-based dm-mq devices");