9 struct list_head rq_list;
10 } ____cacheline_aligned_in_smp;
13 unsigned int index_hw;
15 unsigned int last_tag ____cacheline_aligned_in_smp;
17 /* incremented at dispatch time */
18 unsigned long rq_dispatched[2];
19 unsigned long rq_merged;
21 /* incremented at completion time */
22 unsigned long ____cacheline_aligned_in_smp rq_completed[2];
24 struct request_queue *queue;
26 } ____cacheline_aligned_in_smp;
28 void blk_mq_run_hw_queue(struct blk_mq_hw_ctx *hctx, bool async);
29 void blk_mq_freeze_queue(struct request_queue *q);
30 void blk_mq_free_queue(struct request_queue *q);
31 int blk_mq_update_nr_requests(struct request_queue *q, unsigned int nr);
32 void blk_mq_wake_waiters(struct request_queue *q);
37 struct blk_mq_cpu_notifier;
38 void blk_mq_init_cpu_notifier(struct blk_mq_cpu_notifier *notifier,
39 int (*fn)(void *, unsigned long, unsigned int),
41 void blk_mq_register_cpu_notifier(struct blk_mq_cpu_notifier *notifier);
42 void blk_mq_unregister_cpu_notifier(struct blk_mq_cpu_notifier *notifier);
43 void blk_mq_cpu_init(void);
44 void blk_mq_enable_hotplug(void);
45 void blk_mq_disable_hotplug(void);
48 * CPU -> queue mappings
50 extern unsigned int *blk_mq_make_queue_map(struct blk_mq_tag_set *set);
51 extern int blk_mq_hw_queue_to_node(unsigned int *map, unsigned int);
56 extern int blk_mq_sysfs_register(struct request_queue *q);
57 extern void blk_mq_sysfs_unregister(struct request_queue *q);
59 extern void blk_mq_rq_timed_out(struct request *req, bool reserved);
61 void blk_mq_release(struct request_queue *q);
64 * Basic implementation of sparser bitmap, allowing the user to spread
65 * the bits over more cachelines.
67 struct blk_align_bitmap {
70 } ____cacheline_aligned_in_smp;
72 static inline struct blk_mq_ctx *__blk_mq_get_ctx(struct request_queue *q,
75 return per_cpu_ptr(q->queue_ctx, cpu);
79 * This assumes per-cpu software queueing queues. They could be per-node
80 * as well, for instance. For now this is hardcoded as-is. Note that we don't
81 * care about preemption, since we know the ctx's are persistent. This does
82 * mean that we can't rely on ctx always matching the currently running CPU.
84 static inline struct blk_mq_ctx *blk_mq_get_ctx(struct request_queue *q)
86 return __blk_mq_get_ctx(q, get_cpu());
89 static inline void blk_mq_put_ctx(struct blk_mq_ctx *ctx)
94 struct blk_mq_alloc_data {
96 struct request_queue *q;
100 /* input & output parameter */
101 struct blk_mq_ctx *ctx;
102 struct blk_mq_hw_ctx *hctx;
105 static inline void blk_mq_set_alloc_data(struct blk_mq_alloc_data *data,
106 struct request_queue *q, gfp_t gfp, bool reserved,
107 struct blk_mq_ctx *ctx,
108 struct blk_mq_hw_ctx *hctx)
112 data->reserved = reserved;
117 static inline bool blk_mq_hw_queue_mapped(struct blk_mq_hw_ctx *hctx)
119 return hctx->nr_ctx && hctx->tags;