block/blk-tag.c

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