• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef INT_BLK_MQ_TAG_H
3 #define INT_BLK_MQ_TAG_H
4 
5 /*
6  * Tag address space map.
7  */
8 struct blk_mq_tags {
9 	unsigned int nr_tags;
10 	unsigned int nr_reserved_tags;
11 
12 	atomic_t active_queues;
13 
14 	struct sbitmap_queue *bitmap_tags;
15 	struct sbitmap_queue *breserved_tags;
16 
17 	struct sbitmap_queue __bitmap_tags;
18 	struct sbitmap_queue __breserved_tags;
19 
20 	struct request **rqs;
21 	struct request **static_rqs;
22 	struct list_head page_list;
23 
24 	/*
25 	 * used to clear request reference in rqs[] before freeing one
26 	 * request pool
27 	 */
28 	spinlock_t lock;
29 };
30 
31 extern struct blk_mq_tags *blk_mq_init_tags(unsigned int nr_tags,
32 					unsigned int reserved_tags,
33 					int node, unsigned int flags);
34 extern void blk_mq_free_tags(struct blk_mq_tags *tags, unsigned int flags);
35 
36 extern int blk_mq_init_shared_sbitmap(struct blk_mq_tag_set *set,
37 				      unsigned int flags);
38 extern void blk_mq_exit_shared_sbitmap(struct blk_mq_tag_set *set);
39 
40 extern unsigned int blk_mq_get_tag(struct blk_mq_alloc_data *data);
41 extern void blk_mq_put_tag(struct blk_mq_tags *tags, struct blk_mq_ctx *ctx,
42 			   unsigned int tag);
43 extern int blk_mq_tag_update_depth(struct blk_mq_hw_ctx *hctx,
44 					struct blk_mq_tags **tags,
45 					unsigned int depth, bool can_grow);
46 extern void blk_mq_tag_resize_shared_sbitmap(struct blk_mq_tag_set *set,
47 					     unsigned int size);
48 
49 extern void blk_mq_tag_wakeup_all(struct blk_mq_tags *tags, bool);
50 void blk_mq_queue_tag_busy_iter(struct request_queue *q, busy_iter_fn *fn,
51 		void *priv);
52 void blk_mq_all_tag_iter(struct blk_mq_tags *tags, busy_tag_iter_fn *fn,
53 		void *priv);
54 
bt_wait_ptr(struct sbitmap_queue * bt,struct blk_mq_hw_ctx * hctx)55 static inline struct sbq_wait_state *bt_wait_ptr(struct sbitmap_queue *bt,
56 						 struct blk_mq_hw_ctx *hctx)
57 {
58 	if (!hctx)
59 		return &bt->ws[0];
60 	return sbq_wait_ptr(bt, &hctx->wait_index);
61 }
62 
63 enum {
64 	BLK_MQ_NO_TAG		= -1U,
65 	BLK_MQ_TAG_MIN		= 1,
66 	BLK_MQ_TAG_MAX		= BLK_MQ_NO_TAG - 1,
67 };
68 
69 extern bool __blk_mq_tag_busy(struct blk_mq_hw_ctx *);
70 extern void __blk_mq_tag_idle(struct blk_mq_hw_ctx *);
71 
blk_mq_tag_busy(struct blk_mq_hw_ctx * hctx)72 static inline bool blk_mq_tag_busy(struct blk_mq_hw_ctx *hctx)
73 {
74 	if (!(hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED))
75 		return false;
76 
77 	return __blk_mq_tag_busy(hctx);
78 }
79 
blk_mq_tag_idle(struct blk_mq_hw_ctx * hctx)80 static inline void blk_mq_tag_idle(struct blk_mq_hw_ctx *hctx)
81 {
82 	if (!(hctx->flags & BLK_MQ_F_TAG_QUEUE_SHARED))
83 		return;
84 
85 	__blk_mq_tag_idle(hctx);
86 }
87 
blk_mq_tag_is_reserved(struct blk_mq_tags * tags,unsigned int tag)88 static inline bool blk_mq_tag_is_reserved(struct blk_mq_tags *tags,
89 					  unsigned int tag)
90 {
91 	return tag < tags->nr_reserved_tags;
92 }
93 
94 #endif
95