[linux-2.6-block.git] / block / blk-mq.h

#ifndef INT_BLK_MQ_H
#define INT_BLK_MQ_H

struct blk_mq_tag_set;

struct blk_mq_ctx {
	struct {
		spinlock_t		lock;
		struct list_head	rq_list;
	}  ____cacheline_aligned_in_smp;

	unsigned int		cpu;
	unsigned int		index_hw;

	unsigned int		last_tag ____cacheline_aligned_in_smp;

	/* incremented at dispatch time */
	unsigned long		rq_dispatched[2];
	unsigned long		rq_merged;

	/* incremented at completion time */
	unsigned long		____cacheline_aligned_in_smp rq_completed[2];

	struct request_queue	*queue;
	struct kobject		kobj;
} ____cacheline_aligned_in_smp;

void blk_mq_run_hw_queue(struct blk_mq_hw_ctx *hctx, bool async);
void blk_mq_freeze_queue(struct request_queue *q);
void blk_mq_free_queue(struct request_queue *q);
int blk_mq_update_nr_requests(struct request_queue *q, unsigned int nr);
void blk_mq_wake_waiters(struct request_queue *q);

/*
 * CPU hotplug helpers
 */
struct blk_mq_cpu_notifier;
void blk_mq_init_cpu_notifier(struct blk_mq_cpu_notifier *notifier,
			      int (*fn)(void *, unsigned long, unsigned int),
			      void *data);
void blk_mq_register_cpu_notifier(struct blk_mq_cpu_notifier *notifier);
void blk_mq_unregister_cpu_notifier(struct blk_mq_cpu_notifier *notifier);
void blk_mq_cpu_init(void);
void blk_mq_enable_hotplug(void);
void blk_mq_disable_hotplug(void);

/*
 * CPU -> queue mappings
 */
extern unsigned int *blk_mq_make_queue_map(struct blk_mq_tag_set *set);
extern int blk_mq_update_queue_map(unsigned int *map, unsigned int nr_queues,
				   const struct cpumask *online_mask);
extern int blk_mq_hw_queue_to_node(unsigned int *map, unsigned int);

/*
 * sysfs helpers
 */
extern int blk_mq_sysfs_register(struct request_queue *q);
extern void blk_mq_sysfs_unregister(struct request_queue *q);
extern void blk_mq_hctx_kobj_init(struct blk_mq_hw_ctx *hctx);

extern void blk_mq_rq_timed_out(struct request *req, bool reserved);

void blk_mq_release(struct request_queue *q);

/*
 * Basic implementation of sparser bitmap, allowing the user to spread
 * the bits over more cachelines.
 */
struct blk_align_bitmap {
	unsigned long word;
	unsigned long depth;
} ____cacheline_aligned_in_smp;

static inline struct blk_mq_ctx *__blk_mq_get_ctx(struct request_queue *q,
					   unsigned int cpu)
{
	return per_cpu_ptr(q->queue_ctx, cpu);
}

/*
 * This assumes per-cpu software queueing queues. They could be per-node
 * as well, for instance. For now this is hardcoded as-is. Note that we don't
 * care about preemption, since we know the ctx's are persistent. This does
 * mean that we can't rely on ctx always matching the currently running CPU.
 */
static inline struct blk_mq_ctx *blk_mq_get_ctx(struct request_queue *q)
{
	return __blk_mq_get_ctx(q, get_cpu());
}

static inline void blk_mq_put_ctx(struct blk_mq_ctx *ctx)
{
	put_cpu();
}

struct blk_mq_alloc_data {
	/* input parameter */
	struct request_queue *q;
	unsigned int flags;

	/* input & output parameter */
	struct blk_mq_ctx *ctx;
	struct blk_mq_hw_ctx *hctx;
};

static inline void blk_mq_set_alloc_data(struct blk_mq_alloc_data *data,
		struct request_queue *q, unsigned int flags,
		struct blk_mq_ctx *ctx, struct blk_mq_hw_ctx *hctx)
{
	data->q = q;
	data->flags = flags;
	data->ctx = ctx;
	data->hctx = hctx;
}

static inline bool blk_mq_hw_queue_mapped(struct blk_mq_hw_ctx *hctx)
{
	return hctx->nr_ctx && hctx->tags;
}

#endif
Commit	Line	Data
320ae51f JA	1	#ifndef INT_BLK_MQ_H
	2	#define INT_BLK_MQ_H
	3
24d2f903 CH	4	struct blk_mq_tag_set;
24d2f903 CH	5
320ae51f JA	6	struct blk_mq_ctx {
	7	struct {
	8	spinlock_t lock;
	9	struct list_head rq_list;
	10	} ____cacheline_aligned_in_smp;
	11
	12	unsigned int cpu;
	13	unsigned int index_hw;
320ae51f	14
4bb659b1 JA	15	unsigned int last_tag ____cacheline_aligned_in_smp;
4bb659b1 JA	16
320ae51f JA	17	/* incremented at dispatch time */
	18	unsigned long rq_dispatched[2];
	19	unsigned long rq_merged;
	20
	21	/* incremented at completion time */
	22	unsigned long ____cacheline_aligned_in_smp rq_completed[2];
	23
	24	struct request_queue *queue;
	25	struct kobject kobj;
4bb659b1	26	} ____cacheline_aligned_in_smp;
320ae51f	27
320ae51f	28	void blk_mq_run_hw_queue(struct blk_mq_hw_ctx *hctx, bool async);
780db207	29	void blk_mq_freeze_queue(struct request_queue *q);
3edcc0ce	30	void blk_mq_free_queue(struct request_queue *q);
e3a2b3f9	31	int blk_mq_update_nr_requests(struct request_queue *q, unsigned int nr);
aed3ea94	32	void blk_mq_wake_waiters(struct request_queue *q);
320ae51f JA	33
	34	/*
	35	* CPU hotplug helpers
	36	*/
	37	struct blk_mq_cpu_notifier;
	38	void blk_mq_init_cpu_notifier(struct blk_mq_cpu_notifier *notifier,
e814e71b	39	int (fn)(void , unsigned long, unsigned int),
320ae51f JA	40	void *data);
	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);
676141e4 JA	44	void blk_mq_enable_hotplug(void);
676141e4 JA	45	void blk_mq_disable_hotplug(void);
320ae51f JA	46
	47	/*
	48	* CPU -> queue mappings
	49	*/
24d2f903	50	extern unsigned int blk_mq_make_queue_map(struct blk_mq_tag_set set);
5778322e AM	51	extern int blk_mq_update_queue_map(unsigned int *map, unsigned int nr_queues,
5778322e AM	52	const struct cpumask *online_mask);
f14bbe77	53	extern int blk_mq_hw_queue_to_node(unsigned int *map, unsigned int);
320ae51f	54
67aec14c JA	55	/*
	56	* sysfs helpers
	57	*/
	58	extern int blk_mq_sysfs_register(struct request_queue *q);
	59	extern void blk_mq_sysfs_unregister(struct request_queue *q);
868f2f0b	60	extern void blk_mq_hctx_kobj_init(struct blk_mq_hw_ctx *hctx);
67aec14c	61
90415837 CH	62	extern void blk_mq_rq_timed_out(struct request *req, bool reserved);
90415837 CH	63
e09aae7e ML	64	void blk_mq_release(struct request_queue *q);
e09aae7e ML	65
e93ecf60 JA	66	/*
	67	* Basic implementation of sparser bitmap, allowing the user to spread
	68	* the bits over more cachelines.
	69	*/
	70	struct blk_align_bitmap {
	71	unsigned long word;
	72	unsigned long depth;
	73	} ____cacheline_aligned_in_smp;
	74
1aecfe48 ML	75	static inline struct blk_mq_ctx __blk_mq_get_ctx(struct request_queue q,
	76	unsigned int cpu)
	77	{
	78	return per_cpu_ptr(q->queue_ctx, cpu);
	79	}
	80
	81	/*
	82	* This assumes per-cpu software queueing queues. They could be per-node
	83	* as well, for instance. For now this is hardcoded as-is. Note that we don't
	84	* care about preemption, since we know the ctx's are persistent. This does
	85	* mean that we can't rely on ctx always matching the currently running CPU.
	86	*/
	87	static inline struct blk_mq_ctx blk_mq_get_ctx(struct request_queue q)
	88	{
	89	return __blk_mq_get_ctx(q, get_cpu());
	90	}
	91
	92	static inline void blk_mq_put_ctx(struct blk_mq_ctx *ctx)
	93	{
	94	put_cpu();
	95	}
	96
cb96a42c ML	97	struct blk_mq_alloc_data {
	98	/* input parameter */
	99	struct request_queue *q;
6f3b0e8b	100	unsigned int flags;
cb96a42c ML	101
	102	/* input & output parameter */
	103	struct blk_mq_ctx *ctx;
	104	struct blk_mq_hw_ctx *hctx;
	105	};
	106
	107	static inline void blk_mq_set_alloc_data(struct blk_mq_alloc_data *data,
6f3b0e8b CH	108	struct request_queue *q, unsigned int flags,
6f3b0e8b CH	109	struct blk_mq_ctx ctx, struct blk_mq_hw_ctx hctx)
cb96a42c ML	110	{
cb96a42c ML	111	data->q = q;
6f3b0e8b	112	data->flags = flags;
cb96a42c ML	113	data->ctx = ctx;
	114	data->hctx = hctx;
	115	}
	116
19c66e59 ML	117	static inline bool blk_mq_hw_queue_mapped(struct blk_mq_hw_ctx *hctx)
	118	{
	119	return hctx->nr_ctx && hctx->tags;
	120	}
	121
320ae51f	122	#endif