blk-tag.c 9.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381
  1. /*
  2. * Functions related to tagged command queuing
  3. */
  4. #include <linux/kernel.h>
  5. #include <linux/module.h>
  6. #include <linux/bio.h>
  7. #include <linux/blkdev.h>
  8. #include <linux/slab.h>
  9. #include "blk.h"
  10. /**
  11. * blk_queue_find_tag - find a request by its tag and queue
  12. * @q: The request queue for the device
  13. * @tag: The tag of the request
  14. *
  15. * Notes:
  16. * Should be used when a device returns a tag and you want to match
  17. * it with a request.
  18. *
  19. * no locks need be held.
  20. **/
  21. struct request *blk_queue_find_tag(struct request_queue *q, int tag)
  22. {
  23. return blk_map_queue_find_tag(q->queue_tags, tag);
  24. }
  25. EXPORT_SYMBOL(blk_queue_find_tag);
  26. /**
  27. * blk_free_tags - release a given set of tag maintenance info
  28. * @bqt: the tag map to free
  29. *
  30. * Drop the reference count on @bqt and frees it when the last reference
  31. * is dropped.
  32. */
  33. void blk_free_tags(struct blk_queue_tag *bqt)
  34. {
  35. if (atomic_dec_and_test(&bqt->refcnt)) {
  36. BUG_ON(find_first_bit(bqt->tag_map, bqt->max_depth) <
  37. bqt->max_depth);
  38. kfree(bqt->tag_index);
  39. bqt->tag_index = NULL;
  40. kfree(bqt->tag_map);
  41. bqt->tag_map = NULL;
  42. kfree(bqt);
  43. }
  44. }
  45. EXPORT_SYMBOL(blk_free_tags);
  46. /**
  47. * __blk_queue_free_tags - release tag maintenance info
  48. * @q: the request queue for the device
  49. *
  50. * Notes:
  51. * blk_cleanup_queue() will take care of calling this function, if tagging
  52. * has been used. So there's no need to call this directly.
  53. **/
  54. void __blk_queue_free_tags(struct request_queue *q)
  55. {
  56. struct blk_queue_tag *bqt = q->queue_tags;
  57. if (!bqt)
  58. return;
  59. blk_free_tags(bqt);
  60. q->queue_tags = NULL;
  61. queue_flag_clear_unlocked(QUEUE_FLAG_QUEUED, q);
  62. }
  63. /**
  64. * blk_queue_free_tags - release tag maintenance info
  65. * @q: the request queue for the device
  66. *
  67. * Notes:
  68. * This is used to disable tagged queuing to a device, yet leave
  69. * queue in function.
  70. **/
  71. void blk_queue_free_tags(struct request_queue *q)
  72. {
  73. queue_flag_clear_unlocked(QUEUE_FLAG_QUEUED, q);
  74. }
  75. EXPORT_SYMBOL(blk_queue_free_tags);
  76. static int
  77. init_tag_map(struct request_queue *q, struct blk_queue_tag *tags, int depth)
  78. {
  79. struct request **tag_index;
  80. unsigned long *tag_map;
  81. int nr_ulongs;
  82. if (q && depth > q->nr_requests * 2) {
  83. depth = q->nr_requests * 2;
  84. printk(KERN_ERR "%s: adjusted depth to %d\n",
  85. __func__, depth);
  86. }
  87. tag_index = kzalloc(depth * sizeof(struct request *), GFP_ATOMIC);
  88. if (!tag_index)
  89. goto fail;
  90. nr_ulongs = ALIGN(depth, BITS_PER_LONG) / BITS_PER_LONG;
  91. tag_map = kzalloc(nr_ulongs * sizeof(unsigned long), GFP_ATOMIC);
  92. if (!tag_map)
  93. goto fail;
  94. tags->real_max_depth = depth;
  95. tags->max_depth = depth;
  96. tags->tag_index = tag_index;
  97. tags->tag_map = tag_map;
  98. return 0;
  99. fail:
  100. kfree(tag_index);
  101. return -ENOMEM;
  102. }
  103. static struct blk_queue_tag *__blk_queue_init_tags(struct request_queue *q,
  104. int depth)
  105. {
  106. struct blk_queue_tag *tags;
  107. tags = kmalloc(sizeof(struct blk_queue_tag), GFP_ATOMIC);
  108. if (!tags)
  109. goto fail;
  110. if (init_tag_map(q, tags, depth))
  111. goto fail;
  112. atomic_set(&tags->refcnt, 1);
  113. return tags;
  114. fail:
  115. kfree(tags);
  116. return NULL;
  117. }
  118. /**
  119. * blk_init_tags - initialize the tag info for an external tag map
  120. * @depth: the maximum queue depth supported
  121. **/
  122. struct blk_queue_tag *blk_init_tags(int depth)
  123. {
  124. return __blk_queue_init_tags(NULL, depth);
  125. }
  126. EXPORT_SYMBOL(blk_init_tags);
  127. /**
  128. * blk_queue_init_tags - initialize the queue tag info
  129. * @q: the request queue for the device
  130. * @depth: the maximum queue depth supported
  131. * @tags: the tag to use
  132. *
  133. * Queue lock must be held here if the function is called to resize an
  134. * existing map.
  135. **/
  136. int blk_queue_init_tags(struct request_queue *q, int depth,
  137. struct blk_queue_tag *tags)
  138. {
  139. int rc;
  140. BUG_ON(tags && q->queue_tags && tags != q->queue_tags);
  141. if (!tags && !q->queue_tags) {
  142. tags = __blk_queue_init_tags(q, depth);
  143. if (!tags)
  144. goto fail;
  145. } else if (q->queue_tags) {
  146. rc = blk_queue_resize_tags(q, depth);
  147. if (rc)
  148. return rc;
  149. queue_flag_set(QUEUE_FLAG_QUEUED, q);
  150. return 0;
  151. } else
  152. atomic_inc(&tags->refcnt);
  153. /*
  154. * assign it, all done
  155. */
  156. q->queue_tags = tags;
  157. queue_flag_set_unlocked(QUEUE_FLAG_QUEUED, q);
  158. INIT_LIST_HEAD(&q->tag_busy_list);
  159. return 0;
  160. fail:
  161. kfree(tags);
  162. return -ENOMEM;
  163. }
  164. EXPORT_SYMBOL(blk_queue_init_tags);
  165. /**
  166. * blk_queue_resize_tags - change the queueing depth
  167. * @q: the request queue for the device
  168. * @new_depth: the new max command queueing depth
  169. *
  170. * Notes:
  171. * Must be called with the queue lock held.
  172. **/
  173. int blk_queue_resize_tags(struct request_queue *q, int new_depth)
  174. {
  175. struct blk_queue_tag *bqt = q->queue_tags;
  176. struct request **tag_index;
  177. unsigned long *tag_map;
  178. int max_depth, nr_ulongs;
  179. if (!bqt)
  180. return -ENXIO;
  181. /*
  182. * if we already have large enough real_max_depth. just
  183. * adjust max_depth. *NOTE* as requests with tag value
  184. * between new_depth and real_max_depth can be in-flight, tag
  185. * map can not be shrunk blindly here.
  186. */
  187. if (new_depth <= bqt->real_max_depth) {
  188. bqt->max_depth = new_depth;
  189. return 0;
  190. }
  191. /*
  192. * Currently cannot replace a shared tag map with a new
  193. * one, so error out if this is the case
  194. */
  195. if (atomic_read(&bqt->refcnt) != 1)
  196. return -EBUSY;
  197. /*
  198. * save the old state info, so we can copy it back
  199. */
  200. tag_index = bqt->tag_index;
  201. tag_map = bqt->tag_map;
  202. max_depth = bqt->real_max_depth;
  203. if (init_tag_map(q, bqt, new_depth))
  204. return -ENOMEM;
  205. memcpy(bqt->tag_index, tag_index, max_depth * sizeof(struct request *));
  206. nr_ulongs = ALIGN(max_depth, BITS_PER_LONG) / BITS_PER_LONG;
  207. memcpy(bqt->tag_map, tag_map, nr_ulongs * sizeof(unsigned long));
  208. kfree(tag_index);
  209. kfree(tag_map);
  210. return 0;
  211. }
  212. EXPORT_SYMBOL(blk_queue_resize_tags);
  213. /**
  214. * blk_queue_end_tag - end tag operations for a request
  215. * @q: the request queue for the device
  216. * @rq: the request that has completed
  217. *
  218. * Description:
  219. * Typically called when end_that_request_first() returns %0, meaning
  220. * all transfers have been done for a request. It's important to call
  221. * this function before end_that_request_last(), as that will put the
  222. * request back on the free list thus corrupting the internal tag list.
  223. *
  224. * Notes:
  225. * queue lock must be held.
  226. **/
  227. void blk_queue_end_tag(struct request_queue *q, struct request *rq)
  228. {
  229. struct blk_queue_tag *bqt = q->queue_tags;
  230. unsigned tag = rq->tag; /* negative tags invalid */
  231. BUG_ON(tag >= bqt->real_max_depth);
  232. list_del_init(&rq->queuelist);
  233. rq->cmd_flags &= ~REQ_QUEUED;
  234. rq->tag = -1;
  235. if (unlikely(bqt->tag_index[tag] == NULL))
  236. printk(KERN_ERR "%s: tag %d is missing\n",
  237. __func__, tag);
  238. bqt->tag_index[tag] = NULL;
  239. if (unlikely(!test_bit(tag, bqt->tag_map))) {
  240. printk(KERN_ERR "%s: attempt to clear non-busy tag (%d)\n",
  241. __func__, tag);
  242. return;
  243. }
  244. /*
  245. * The tag_map bit acts as a lock for tag_index[bit], so we need
  246. * unlock memory barrier semantics.
  247. */
  248. clear_bit_unlock(tag, bqt->tag_map);
  249. }
  250. EXPORT_SYMBOL(blk_queue_end_tag);
  251. /**
  252. * blk_queue_start_tag - find a free tag and assign it
  253. * @q: the request queue for the device
  254. * @rq: the block request that needs tagging
  255. *
  256. * Description:
  257. * This can either be used as a stand-alone helper, or possibly be
  258. * assigned as the queue &prep_rq_fn (in which case &struct request
  259. * automagically gets a tag assigned). Note that this function
  260. * assumes that any type of request can be queued! if this is not
  261. * true for your device, you must check the request type before
  262. * calling this function. The request will also be removed from
  263. * the request queue, so it's the drivers responsibility to readd
  264. * it if it should need to be restarted for some reason.
  265. *
  266. * Notes:
  267. * queue lock must be held.
  268. **/
  269. int blk_queue_start_tag(struct request_queue *q, struct request *rq)
  270. {
  271. struct blk_queue_tag *bqt = q->queue_tags;
  272. unsigned max_depth;
  273. int tag;
  274. if (unlikely((rq->cmd_flags & REQ_QUEUED))) {
  275. printk(KERN_ERR
  276. "%s: request %p for device [%s] already tagged %d",
  277. __func__, rq,
  278. rq->rq_disk ? rq->rq_disk->disk_name : "?", rq->tag);
  279. BUG();
  280. }
  281. /*
  282. * Protect against shared tag maps, as we may not have exclusive
  283. * access to the tag map.
  284. *
  285. * We reserve a few tags just for sync IO, since we don't want
  286. * to starve sync IO on behalf of flooding async IO.
  287. */
  288. max_depth = bqt->max_depth;
  289. if (!rq_is_sync(rq) && max_depth > 1) {
  290. max_depth -= 2;
  291. if (!max_depth)
  292. max_depth = 1;
  293. if (q->in_flight[BLK_RW_ASYNC] > max_depth)
  294. return 1;
  295. }
  296. do {
  297. tag = find_first_zero_bit(bqt->tag_map, max_depth);
  298. if (tag >= max_depth)
  299. return 1;
  300. } while (test_and_set_bit_lock(tag, bqt->tag_map));
  301. /*
  302. * We need lock ordering semantics given by test_and_set_bit_lock.
  303. * See blk_queue_end_tag for details.
  304. */
  305. rq->cmd_flags |= REQ_QUEUED;
  306. rq->tag = tag;
  307. bqt->tag_index[tag] = rq;
  308. blk_start_request(rq);
  309. list_add(&rq->queuelist, &q->tag_busy_list);
  310. return 0;
  311. }
  312. EXPORT_SYMBOL(blk_queue_start_tag);
  313. /**
  314. * blk_queue_invalidate_tags - invalidate all pending tags
  315. * @q: the request queue for the device
  316. *
  317. * Description:
  318. * Hardware conditions may dictate a need to stop all pending requests.
  319. * In this case, we will safely clear the block side of the tag queue and
  320. * readd all requests to the request queue in the right order.
  321. *
  322. * Notes:
  323. * queue lock must be held.
  324. **/
  325. void blk_queue_invalidate_tags(struct request_queue *q)
  326. {
  327. struct list_head *tmp, *n;
  328. list_for_each_safe(tmp, n, &q->tag_busy_list)
  329. blk_requeue_request(q, list_entry_rq(tmp));
  330. }
  331. EXPORT_SYMBOL(blk_queue_invalidate_tags);