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_complete_request(struct request *rq);
29 void blk_mq_run_hw_queue(struct blk_mq_hw_ctx *hctx, bool async);
30 void blk_mq_freeze_queue(struct request_queue *q);
31 void blk_mq_free_queue(struct request_queue *q);
32 void blk_mq_clone_flush_request(struct request *flush_rq,
33 struct request *orig_rq);
34 int blk_mq_update_nr_requests(struct request_queue *q, unsigned int nr);
35 void blk_mq_wake_waiters(struct request_queue *q);
40 struct blk_mq_cpu_notifier;
41 void blk_mq_init_cpu_notifier(struct blk_mq_cpu_notifier *notifier,
42 int (*fn)(void *, unsigned long, unsigned int),
44 void blk_mq_register_cpu_notifier(struct blk_mq_cpu_notifier *notifier);
45 void blk_mq_unregister_cpu_notifier(struct blk_mq_cpu_notifier *notifier);
46 void blk_mq_cpu_init(void);
47 void blk_mq_enable_hotplug(void);
48 void blk_mq_disable_hotplug(void);
51 * CPU -> queue mappings
53 extern unsigned int *blk_mq_make_queue_map(struct blk_mq_tag_set *set);
54 extern int blk_mq_update_queue_map(unsigned int *map, unsigned int nr_queues,
55 const struct cpumask *online_mask);
56 extern int blk_mq_hw_queue_to_node(unsigned int *map, unsigned int);
61 extern int blk_mq_sysfs_register(struct request_queue *q);
62 extern void blk_mq_sysfs_unregister(struct request_queue *q);
64 extern void blk_mq_rq_timed_out(struct request *req, bool reserved);
66 void blk_mq_release(struct request_queue *q);
69 * Basic implementation of sparser bitmap, allowing the user to spread
70 * the bits over more cachelines.
72 struct blk_align_bitmap {
75 } ____cacheline_aligned_in_smp;
77 static inline struct blk_mq_ctx *__blk_mq_get_ctx(struct request_queue *q,
80 return per_cpu_ptr(q->queue_ctx, cpu);
84 * This assumes per-cpu software queueing queues. They could be per-node
85 * as well, for instance. For now this is hardcoded as-is. Note that we don't
86 * care about preemption, since we know the ctx's are persistent. This does
87 * mean that we can't rely on ctx always matching the currently running CPU.
89 static inline struct blk_mq_ctx *blk_mq_get_ctx(struct request_queue *q)
91 return __blk_mq_get_ctx(q, get_cpu());
94 static inline void blk_mq_put_ctx(struct blk_mq_ctx *ctx)
99 struct blk_mq_alloc_data {
100 /* input parameter */
101 struct request_queue *q;
105 /* input & output parameter */
106 struct blk_mq_ctx *ctx;
107 struct blk_mq_hw_ctx *hctx;
110 static inline void blk_mq_set_alloc_data(struct blk_mq_alloc_data *data,
111 struct request_queue *q, gfp_t gfp, bool reserved,
112 struct blk_mq_ctx *ctx,
113 struct blk_mq_hw_ctx *hctx)
117 data->reserved = reserved;
122 static inline bool blk_mq_hw_queue_mapped(struct blk_mq_hw_ctx *hctx)
124 return hctx->nr_ctx && hctx->tags;