• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/block/

Lines Matching defs:tag

13  * blk_queue_find_tag - find a request by its tag and queue
15 * @tag: The tag of the request
18 * Should be used when a device returns a tag and you want to match
23 struct request *blk_queue_find_tag(struct request_queue *q, int tag)
25 return blk_map_queue_find_tag(q->queue_tags, tag);
30 * __blk_free_tags - release a given set of tag maintenance info
31 * @bqt: the tag map to free
58 * __blk_queue_free_tags - release tag maintenance info
79 * blk_free_tags - release a given set of tag maintenance info
80 * @bqt: the tag map to free
84 * might have been using this tag map.
94 * blk_queue_free_tags - release tag maintenance info
160 * blk_init_tags - initialize the tag info for an external tag map
170 * blk_queue_init_tags - initialize the queue tag info
173 * @tags: the tag to use
232 * adjust max_depth. *NOTE* as requests with tag value
233 * between new_depth and real_max_depth can be in-flight, tag
242 * Currently cannot replace a shared tag map with a new
269 * blk_queue_end_tag - end tag operations for a request
277 * request back on the free list thus corrupting the internal tag list.
285 int tag = rq->tag;
287 BUG_ON(tag == -1);
289 if (unlikely(tag >= bqt->real_max_depth))
294 rq->tag = -1;
296 if (unlikely(bqt->tag_index[tag] == NULL))
297 printk(KERN_ERR "%s: tag %d is missing\n",
298 __func__, tag);
300 bqt->tag_index[tag] = NULL;
302 if (unlikely(!test_bit(tag, bqt->tag_map))) {
303 printk(KERN_ERR "%s: attempt to clear non-busy tag (%d)\n",
304 __func__, tag);
311 clear_bit_unlock(tag, bqt->tag_map);
316 * blk_queue_start_tag - find a free tag and assign it
323 * automagically gets a tag assigned). Note that this function
337 int tag;
343 rq->rq_disk ? rq->rq_disk->disk_name : "?", rq->tag);
348 * Protect against shared tag maps, as we may not have exclusive
349 * access to the tag map.
364 tag = find_first_zero_bit(bqt->tag_map, max_depth);
365 if (tag >= max_depth)
368 } while (test_and_set_bit_lock(tag, bqt->tag_map));
375 rq->tag = tag;
376 bqt->tag_index[tag] = rq;
389 * In this case, we will safely clear the block side of the tag queue and