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

/* SPDX-License-Identifier: GPL-2.0 */
#ifndef BLK_INTERNAL_H
#define BLK_INTERNAL_H

#include <linux/idr.h>
#include <linux/blk-mq.h>
#include <xen/xen.h>
#include "blk-mq.h"
#include "blk-mq-sched.h"

/* Max future timer expiry for timeouts */
#define BLK_MAX_TIMEOUT		(5 * HZ)

#ifdef CONFIG_DEBUG_FS
extern struct dentry *blk_debugfs_root;
#endif

struct blk_flush_queue {
	unsigned int		flush_queue_delayed:1;
	unsigned int		flush_pending_idx:1;
	unsigned int		flush_running_idx:1;
	unsigned long		flush_pending_since;
	struct list_head	flush_queue[2];
	struct list_head	flush_data_in_flight;
	struct request		*flush_rq;

	/*
	 * flush_rq shares tag with this rq, both can't be active
	 * at the same time
	 */
	struct request		*orig_rq;
	spinlock_t		mq_flush_lock;
};

extern struct kmem_cache *blk_requestq_cachep;
extern struct kobj_type blk_queue_ktype;
extern struct ida blk_queue_ida;

static inline struct blk_flush_queue *
blk_get_flush_queue(struct request_queue *q, struct blk_mq_ctx *ctx)
{
	return blk_mq_map_queue(q, REQ_OP_FLUSH, ctx)->fq;
}

static inline void __blk_get_queue(struct request_queue *q)
{
	kobject_get(&q->kobj);
}

struct blk_flush_queue *blk_alloc_flush_queue(struct request_queue *q,
		int node, int cmd_size, gfp_t flags);
void blk_free_flush_queue(struct blk_flush_queue *q);

void blk_freeze_queue(struct request_queue *q);

static inline void blk_queue_enter_live(struct request_queue *q)
{
	/*
	 * Given that running in generic_make_request() context
	 * guarantees that a live reference against q_usage_counter has
	 * been established, further references under that same context
	 * need not check that the queue has been frozen (marked dead).
	 */
	percpu_ref_get(&q->q_usage_counter);
}

static inline bool biovec_phys_mergeable(struct request_queue *q,
		struct bio_vec *vec1, struct bio_vec *vec2)
{
	unsigned long mask = queue_segment_boundary(q);
	phys_addr_t addr1 = page_to_phys(vec1->bv_page) + vec1->bv_offset;
	phys_addr_t addr2 = page_to_phys(vec2->bv_page) + vec2->bv_offset;

	if (addr1 + vec1->bv_len != addr2)
		return false;
	if (xen_domain() && !xen_biovec_phys_mergeable(vec1, vec2->bv_page))
		return false;
	if ((addr1 | mask) != ((addr2 + vec2->bv_len - 1) | mask))
		return false;
	return true;
}

static inline bool __bvec_gap_to_prev(struct request_queue *q,
		struct bio_vec *bprv, unsigned int offset)
{
	return (offset & queue_virt_boundary(q)) ||
		((bprv->bv_offset + bprv->bv_len) & queue_virt_boundary(q));
}

/*
 * Check if adding a bio_vec after bprv with offset would create a gap in
 * the SG list. Most drivers don't care about this, but some do.
 */
static inline bool bvec_gap_to_prev(struct request_queue *q,
		struct bio_vec *bprv, unsigned int offset)
{
	if (!queue_virt_boundary(q))
		return false;
	return __bvec_gap_to_prev(q, bprv, offset);
}

static inline void blk_rq_bio_prep(struct request *rq, struct bio *bio,
		unsigned int nr_segs)
{
	rq->nr_phys_segments = nr_segs;
	rq->__data_len = bio->bi_iter.bi_size;
	rq->bio = rq->biotail = bio;
	rq->ioprio = bio_prio(bio);

	if (bio->bi_disk)
		rq->rq_disk = bio->bi_disk;
}

#ifdef CONFIG_BLK_DEV_INTEGRITY
void blk_flush_integrity(void);
bool __bio_integrity_endio(struct bio *);
static inline bool bio_integrity_endio(struct bio *bio)
{
	if (bio_integrity(bio))
		return __bio_integrity_endio(bio);
	return true;
}

static inline bool integrity_req_gap_back_merge(struct request *req,
		struct bio *next)
{
	struct bio_integrity_payload *bip = bio_integrity(req->bio);
	struct bio_integrity_payload *bip_next = bio_integrity(next);

	return bvec_gap_to_prev(req->q, &bip->bip_vec[bip->bip_vcnt - 1],
				bip_next->bip_vec[0].bv_offset);
}

static inline bool integrity_req_gap_front_merge(struct request *req,
		struct bio *bio)
{
	struct bio_integrity_payload *bip = bio_integrity(bio);
	struct bio_integrity_payload *bip_next = bio_integrity(req->bio);

	return bvec_gap_to_prev(req->q, &bip->bip_vec[bip->bip_vcnt - 1],
				bip_next->bip_vec[0].bv_offset);
}
#else /* CONFIG_BLK_DEV_INTEGRITY */
static inline bool integrity_req_gap_back_merge(struct request *req,
		struct bio *next)
{
	return false;
}
static inline bool integrity_req_gap_front_merge(struct request *req,
		struct bio *bio)
{
	return false;
}

static inline void blk_flush_integrity(void)
{
}
static inline bool bio_integrity_endio(struct bio *bio)
{
	return true;
}
#endif /* CONFIG_BLK_DEV_INTEGRITY */

unsigned long blk_rq_timeout(unsigned long timeout);
void blk_add_timer(struct request *req);

bool bio_attempt_front_merge(struct request *req, struct bio *bio,
		unsigned int nr_segs);
bool bio_attempt_back_merge(struct request *req, struct bio *bio,
		unsigned int nr_segs);
bool bio_attempt_discard_merge(struct request_queue *q, struct request *req,
		struct bio *bio);
bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio,
		unsigned int nr_segs, struct request **same_queue_rq);

void blk_account_io_start(struct request *req, bool new_io);
void blk_account_io_completion(struct request *req, unsigned int bytes);
void blk_account_io_done(struct request *req, u64 now);

/*
 * Internal elevator interface
 */
#define ELV_ON_HASH(rq) ((rq)->rq_flags & RQF_HASHED)

void blk_insert_flush(struct request *rq);

int elevator_init_mq(struct request_queue *q);
int elevator_switch_mq(struct request_queue *q,
			      struct elevator_type *new_e);
void __elevator_exit(struct request_queue *, struct elevator_queue *);
int elv_register_queue(struct request_queue *q);
void elv_unregister_queue(struct request_queue *q);

static inline void elevator_exit(struct request_queue *q,
		struct elevator_queue *e)
{
	blk_mq_sched_free_requests(q);
	__elevator_exit(q, e);
}

struct hd_struct *__disk_get_part(struct gendisk *disk, int partno);

#ifdef CONFIG_FAIL_IO_TIMEOUT
int blk_should_fake_timeout(struct request_queue *);
ssize_t part_timeout_show(struct device *, struct device_attribute *, char *);
ssize_t part_timeout_store(struct device *, struct device_attribute *,
				const char *, size_t);
#else
static inline int blk_should_fake_timeout(struct request_queue *q)
{
	return 0;
}
#endif

void __blk_queue_split(struct request_queue *q, struct bio **bio,
		unsigned int *nr_segs);
int ll_back_merge_fn(struct request *req, struct bio *bio,
		unsigned int nr_segs);
int ll_front_merge_fn(struct request *req,  struct bio *bio,
		unsigned int nr_segs);
struct request *attempt_back_merge(struct request_queue *q, struct request *rq);
struct request *attempt_front_merge(struct request_queue *q, struct request *rq);
int blk_attempt_req_merge(struct request_queue *q, struct request *rq,
				struct request *next);
unsigned int blk_recalc_rq_segments(struct request *rq);
void blk_rq_set_mixed_merge(struct request *rq);
bool blk_rq_merge_ok(struct request *rq, struct bio *bio);
enum elv_merge blk_try_merge(struct request *rq, struct bio *bio);

int blk_dev_init(void);

/*
 * Contribute to IO statistics IFF:
 *
 *	a) it's attached to a gendisk, and
 *	b) the queue had IO stats enabled when this request was started, and
 *	c) it's a file system request
 */
static inline bool blk_do_io_stat(struct request *rq)
{
	return rq->rq_disk &&
	       (rq->rq_flags & RQF_IO_STAT) &&
		!blk_rq_is_passthrough(rq);
}

static inline void req_set_nomerge(struct request_queue *q, struct request *req)
{
	req->cmd_flags |= REQ_NOMERGE;
	if (req == q->last_merge)
		q->last_merge = NULL;
}

/*
 * The max size one bio can handle is UINT_MAX becasue bvec_iter.bi_size
 * is defined as 'unsigned int', meantime it has to aligned to with logical
 * block size which is the minimum accepted unit by hardware.
 */
static inline unsigned int bio_allowed_max_sectors(struct request_queue *q)
{
	return round_down(UINT_MAX, queue_logical_block_size(q)) >> 9;
}

/*
 * Internal io_context interface
 */
void get_io_context(struct io_context *ioc);
struct io_cq *ioc_lookup_icq(struct io_context *ioc, struct request_queue *q);
struct io_cq *ioc_create_icq(struct io_context *ioc, struct request_queue *q,
			     gfp_t gfp_mask);
void ioc_clear_queue(struct request_queue *q);

int create_task_io_context(struct task_struct *task, gfp_t gfp_mask, int node);

/**
 * create_io_context - try to create task->io_context
 * @gfp_mask: allocation mask
 * @node: allocation node
 *
 * If %current->io_context is %NULL, allocate a new io_context and install
 * it.  Returns the current %current->io_context which may be %NULL if
 * allocation failed.
 *
 * Note that this function can't be called with IRQ disabled because
 * task_lock which protects %current->io_context is IRQ-unsafe.
 */
static inline struct io_context *create_io_context(gfp_t gfp_mask, int node)
{
	WARN_ON_ONCE(irqs_disabled());
	if (unlikely(!current->io_context))
		create_task_io_context(current, gfp_mask, node);
	return current->io_context;
}

/*
 * Internal throttling interface
 */
#ifdef CONFIG_BLK_DEV_THROTTLING
extern void blk_throtl_drain(struct request_queue *q);
extern int blk_throtl_init(struct request_queue *q);
extern void blk_throtl_exit(struct request_queue *q);
extern void blk_throtl_register_queue(struct request_queue *q);
#else /* CONFIG_BLK_DEV_THROTTLING */
static inline void blk_throtl_drain(struct request_queue *q) { }
static inline int blk_throtl_init(struct request_queue *q) { return 0; }
static inline void blk_throtl_exit(struct request_queue *q) { }
static inline void blk_throtl_register_queue(struct request_queue *q) { }
#endif /* CONFIG_BLK_DEV_THROTTLING */
#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
extern ssize_t blk_throtl_sample_time_show(struct request_queue *q, char *page);
extern ssize_t blk_throtl_sample_time_store(struct request_queue *q,
	const char *page, size_t count);
extern void blk_throtl_bio_endio(struct bio *bio);
extern void blk_throtl_stat_add(struct request *rq, u64 time);
#else
static inline void blk_throtl_bio_endio(struct bio *bio) { }
static inline void blk_throtl_stat_add(struct request *rq, u64 time) { }
#endif

#ifdef CONFIG_BOUNCE
extern int init_emergency_isa_pool(void);
extern void blk_queue_bounce(struct request_queue *q, struct bio **bio);
#else
static inline int init_emergency_isa_pool(void)
{
	return 0;
}
static inline void blk_queue_bounce(struct request_queue *q, struct bio **bio)
{
}
#endif /* CONFIG_BOUNCE */

#ifdef CONFIG_BLK_CGROUP_IOLATENCY
extern int blk_iolatency_init(struct request_queue *q);
#else
static inline int blk_iolatency_init(struct request_queue *q) { return 0; }
#endif

struct bio *blk_next_bio(struct bio *bio, unsigned int nr_pages, gfp_t gfp);

#ifdef CONFIG_BLK_DEV_ZONED
void blk_queue_free_zone_bitmaps(struct request_queue *q);
#else
static inline void blk_queue_free_zone_bitmaps(struct request_queue *q) {}
#endif

#endif /* BLK_INTERNAL_H */
Commit	Line	Data
b2441318	1	/* SPDX-License-Identifier: GPL-2.0 */
8324aa91 JA	2	#ifndef BLK_INTERNAL_H
	3	#define BLK_INTERNAL_H
	4
a73f730d	5	#include <linux/idr.h>
f70ced09	6	#include <linux/blk-mq.h>
c39ae60d	7	#include <xen/xen.h>
f70ced09	8	#include "blk-mq.h"
c3e22192	9	#include "blk-mq-sched.h"
a73f730d	10
0d2602ca JA	11	/* Max future timer expiry for timeouts */
	12	#define BLK_MAX_TIMEOUT (5 * HZ)
	13
18fbda91 OS	14	#ifdef CONFIG_DEBUG_FS
	15	extern struct dentry *blk_debugfs_root;
	16	#endif
	17
7c94e1c1 ML	18	struct blk_flush_queue {
	19	unsigned int flush_queue_delayed:1;
	20	unsigned int flush_pending_idx:1;
	21	unsigned int flush_running_idx:1;
	22	unsigned long flush_pending_since;
	23	struct list_head flush_queue[2];
	24	struct list_head flush_data_in_flight;
	25	struct request *flush_rq;
0048b483 ML	26
	27	/*
	28	* flush_rq shares tag with this rq, both can't be active
	29	* at the same time
	30	*/
	31	struct request *orig_rq;
7c94e1c1 ML	32	spinlock_t mq_flush_lock;
	33	};
	34
8324aa91 JA	35	extern struct kmem_cache *blk_requestq_cachep;
8324aa91 JA	36	extern struct kobj_type blk_queue_ktype;
a73f730d	37	extern struct ida blk_queue_ida;
8324aa91	38
f9afca4d JA	39	static inline struct blk_flush_queue *
f9afca4d JA	40	blk_get_flush_queue(struct request_queue q, struct blk_mq_ctx ctx)
7c94e1c1	41	{
8ccdf4a3	42	return blk_mq_map_queue(q, REQ_OP_FLUSH, ctx)->fq;
7c94e1c1 ML	43	}
7c94e1c1 ML	44
09ac46c4 TH	45	static inline void __blk_get_queue(struct request_queue *q)
	46	{
	47	kobject_get(&q->kobj);
	48	}
	49
f70ced09	50	struct blk_flush_queue blk_alloc_flush_queue(struct request_queue q,
5b202853	51	int node, int cmd_size, gfp_t flags);
f70ced09	52	void blk_free_flush_queue(struct blk_flush_queue *q);
f3552655	53
3ef28e83 DW	54	void blk_freeze_queue(struct request_queue *q);
	55
	56	static inline void blk_queue_enter_live(struct request_queue *q)
	57	{
	58	/*
	59	* Given that running in generic_make_request() context
	60	* guarantees that a live reference against q_usage_counter has
	61	* been established, further references under that same context
	62	* need not check that the queue has been frozen (marked dead).
	63	*/
	64	percpu_ref_get(&q->q_usage_counter);
	65	}
8324aa91	66
3dccdae5 CH	67	static inline bool biovec_phys_mergeable(struct request_queue *q,
3dccdae5 CH	68	struct bio_vec vec1, struct bio_vec vec2)
6a9f5f24	69	{
3dccdae5	70	unsigned long mask = queue_segment_boundary(q);
6e768461 CH	71	phys_addr_t addr1 = page_to_phys(vec1->bv_page) + vec1->bv_offset;
6e768461 CH	72	phys_addr_t addr2 = page_to_phys(vec2->bv_page) + vec2->bv_offset;
3dccdae5 CH	73
3dccdae5 CH	74	if (addr1 + vec1->bv_len != addr2)
6a9f5f24	75	return false;
0383ad43	76	if (xen_domain() && !xen_biovec_phys_mergeable(vec1, vec2->bv_page))
6a9f5f24	77	return false;
3dccdae5 CH	78	if ((addr1 \| mask) != ((addr2 + vec2->bv_len - 1) \| mask))
3dccdae5 CH	79	return false;
6a9f5f24 CH	80	return true;
	81	}
	82
27ca1d4e CH	83	static inline bool __bvec_gap_to_prev(struct request_queue *q,
	84	struct bio_vec *bprv, unsigned int offset)
	85	{
df376b2e	86	return (offset & queue_virt_boundary(q)) \|\|
27ca1d4e CH	87	((bprv->bv_offset + bprv->bv_len) & queue_virt_boundary(q));
	88	}
	89
	90	/*
	91	* Check if adding a bio_vec after bprv with offset would create a gap in
	92	* the SG list. Most drivers don't care about this, but some do.
	93	*/
	94	static inline bool bvec_gap_to_prev(struct request_queue *q,
	95	struct bio_vec *bprv, unsigned int offset)
	96	{
	97	if (!queue_virt_boundary(q))
	98	return false;
	99	return __bvec_gap_to_prev(q, bprv, offset);
	100	}
	101
1aa0a133 CH	102	static inline void blk_rq_bio_prep(struct request rq, struct bio bio,
	103	unsigned int nr_segs)
	104	{
	105	rq->nr_phys_segments = nr_segs;
	106	rq->__data_len = bio->bi_iter.bi_size;
	107	rq->bio = rq->biotail = bio;
	108	rq->ioprio = bio_prio(bio);
	109
	110	if (bio->bi_disk)
	111	rq->rq_disk = bio->bi_disk;
	112	}
	113
5a48fc14 DW	114	#ifdef CONFIG_BLK_DEV_INTEGRITY
5a48fc14 DW	115	void blk_flush_integrity(void);
7c20f116 CH	116	bool __bio_integrity_endio(struct bio *);
	117	static inline bool bio_integrity_endio(struct bio *bio)
	118	{
	119	if (bio_integrity(bio))
	120	return __bio_integrity_endio(bio);
	121	return true;
	122	}
43b729bf CH	123
	124	static inline bool integrity_req_gap_back_merge(struct request *req,
	125	struct bio *next)
	126	{
	127	struct bio_integrity_payload *bip = bio_integrity(req->bio);
	128	struct bio_integrity_payload *bip_next = bio_integrity(next);
	129
	130	return bvec_gap_to_prev(req->q, &bip->bip_vec[bip->bip_vcnt - 1],
	131	bip_next->bip_vec[0].bv_offset);
	132	}
	133
	134	static inline bool integrity_req_gap_front_merge(struct request *req,
	135	struct bio *bio)
	136	{
	137	struct bio_integrity_payload *bip = bio_integrity(bio);
	138	struct bio_integrity_payload *bip_next = bio_integrity(req->bio);
	139
	140	return bvec_gap_to_prev(req->q, &bip->bip_vec[bip->bip_vcnt - 1],
	141	bip_next->bip_vec[0].bv_offset);
	142	}
	143	#else /* CONFIG_BLK_DEV_INTEGRITY */
	144	static inline bool integrity_req_gap_back_merge(struct request *req,
	145	struct bio *next)
	146	{
	147	return false;
	148	}
	149	static inline bool integrity_req_gap_front_merge(struct request *req,
	150	struct bio *bio)
	151	{
	152	return false;
	153	}
	154
5a48fc14 DW	155	static inline void blk_flush_integrity(void)
	156	{
	157	}
7c20f116 CH	158	static inline bool bio_integrity_endio(struct bio *bio)
	159	{
	160	return true;
	161	}
43b729bf	162	#endif /* CONFIG_BLK_DEV_INTEGRITY */
8324aa91	163
0d2602ca	164	unsigned long blk_rq_timeout(unsigned long timeout);
87ee7b11	165	void blk_add_timer(struct request *req);
320ae51f	166
14ccb66b CH	167	bool bio_attempt_front_merge(struct request req, struct bio bio,
	168	unsigned int nr_segs);
	169	bool bio_attempt_back_merge(struct request req, struct bio bio,
	170	unsigned int nr_segs);
1e739730 CH	171	bool bio_attempt_discard_merge(struct request_queue q, struct request req,
1e739730 CH	172	struct bio *bio);
320ae51f	173	bool blk_attempt_plug_merge(struct request_queue q, struct bio bio,
14ccb66b	174	unsigned int nr_segs, struct request **same_queue_rq);
320ae51f JA	175
	176	void blk_account_io_start(struct request *req, bool new_io);
	177	void blk_account_io_completion(struct request *req, unsigned int bytes);
522a7775	178	void blk_account_io_done(struct request *req, u64 now);
320ae51f	179
158dbda0 TH	180	/*
	181	* Internal elevator interface
	182	*/
e8064021	183	#define ELV_ON_HASH(rq) ((rq)->rq_flags & RQF_HASHED)
158dbda0	184
ae1b1539	185	void blk_insert_flush(struct request *rq);
dd831006	186
131d08e1	187	int elevator_init_mq(struct request_queue *q);
d48ece20 JW	188	int elevator_switch_mq(struct request_queue *q,
d48ece20 JW	189	struct elevator_type *new_e);
c3e22192	190	void __elevator_exit(struct request_queue , struct elevator_queue );
83d016ac BVA	191	int elv_register_queue(struct request_queue *q);
	192	void elv_unregister_queue(struct request_queue *q);
	193
c3e22192 ML	194	static inline void elevator_exit(struct request_queue *q,
	195	struct elevator_queue *e)
	196	{
	197	blk_mq_sched_free_requests(q);
	198	__elevator_exit(q, e);
	199	}
	200
807d4af2 CH	201	struct hd_struct __disk_get_part(struct gendisk disk, int partno);
807d4af2 CH	202
581d4e28 JA	203	#ifdef CONFIG_FAIL_IO_TIMEOUT
	204	int blk_should_fake_timeout(struct request_queue *);
	205	ssize_t part_timeout_show(struct device , struct device_attribute , char *);
	206	ssize_t part_timeout_store(struct device , struct device_attribute ,
	207	const char *, size_t);
	208	#else
	209	static inline int blk_should_fake_timeout(struct request_queue *q)
	210	{
	211	return 0;
	212	}
	213	#endif
	214
14ccb66b CH	215	void __blk_queue_split(struct request_queue q, struct bio *bio,
	216	unsigned int *nr_segs);
	217	int ll_back_merge_fn(struct request req, struct bio bio,
	218	unsigned int nr_segs);
	219	int ll_front_merge_fn(struct request req, struct bio bio,
	220	unsigned int nr_segs);
b973cb7e JA	221	struct request attempt_back_merge(struct request_queue q, struct request *rq);
b973cb7e JA	222	struct request attempt_front_merge(struct request_queue q, struct request *rq);
5e84ea3a JA	223	int blk_attempt_req_merge(struct request_queue q, struct request rq,
5e84ea3a JA	224	struct request *next);
e9cd19c0	225	unsigned int blk_recalc_rq_segments(struct request *rq);
80a761fd	226	void blk_rq_set_mixed_merge(struct request *rq);
050c8ea8	227	bool blk_rq_merge_ok(struct request rq, struct bio bio);
34fe7c05	228	enum elv_merge blk_try_merge(struct request rq, struct bio bio);
d6d48196	229
ff88972c AB	230	int blk_dev_init(void);
ff88972c AB	231
c2553b58 JA	232	/*
	233	* Contribute to IO statistics IFF:
	234	*
	235	* a) it's attached to a gendisk, and
	236	* b) the queue had IO stats enabled when this request was started, and
e2a60da7	237	* c) it's a file system request
c2553b58	238	*/
599d067d	239	static inline bool blk_do_io_stat(struct request *rq)
fb8ec18c	240	{
33659ebb	241	return rq->rq_disk &&
e8064021	242	(rq->rq_flags & RQF_IO_STAT) &&
57292b58	243	!blk_rq_is_passthrough(rq);
fb8ec18c JA	244	}
fb8ec18c JA	245
6cf7677f CH	246	static inline void req_set_nomerge(struct request_queue q, struct request req)
	247	{
	248	req->cmd_flags \|= REQ_NOMERGE;
	249	if (req == q->last_merge)
	250	q->last_merge = NULL;
	251	}
	252
1adfc5e4 ML	253	/*
	254	* The max size one bio can handle is UINT_MAX becasue bvec_iter.bi_size
	255	* is defined as 'unsigned int', meantime it has to aligned to with logical
	256	* block size which is the minimum accepted unit by hardware.
	257	*/
	258	static inline unsigned int bio_allowed_max_sectors(struct request_queue *q)
	259	{
	260	return round_down(UINT_MAX, queue_logical_block_size(q)) >> 9;
	261	}
	262
f2dbd76a TH	263	/*
	264	* Internal io_context interface
	265	*/
	266	void get_io_context(struct io_context *ioc);
47fdd4ca	267	struct io_cq ioc_lookup_icq(struct io_context ioc, struct request_queue *q);
24acfc34 TH	268	struct io_cq ioc_create_icq(struct io_context ioc, struct request_queue *q,
24acfc34 TH	269	gfp_t gfp_mask);
7e5a8794	270	void ioc_clear_queue(struct request_queue *q);
f2dbd76a	271
24acfc34	272	int create_task_io_context(struct task_struct *task, gfp_t gfp_mask, int node);
f2dbd76a TH	273
	274	/**
	275	* create_io_context - try to create task->io_context
f2dbd76a TH	276	* @gfp_mask: allocation mask
	277	* @node: allocation node
	278	*
24acfc34 TH	279	* If %current->io_context is %NULL, allocate a new io_context and install
	280	* it. Returns the current %current->io_context which may be %NULL if
	281	* allocation failed.
f2dbd76a TH	282	*
f2dbd76a TH	283	* Note that this function can't be called with IRQ disabled because
24acfc34	284	* task_lock which protects %current->io_context is IRQ-unsafe.
f2dbd76a	285	*/
24acfc34	286	static inline struct io_context *create_io_context(gfp_t gfp_mask, int node)
f2dbd76a TH	287	{
f2dbd76a TH	288	WARN_ON_ONCE(irqs_disabled());
24acfc34 TH	289	if (unlikely(!current->io_context))
	290	create_task_io_context(current, gfp_mask, node);
	291	return current->io_context;
f2dbd76a TH	292	}
	293
	294	/*
	295	* Internal throttling interface
	296	*/
bc9fcbf9	297	#ifdef CONFIG_BLK_DEV_THROTTLING
c9a929dd	298	extern void blk_throtl_drain(struct request_queue *q);
bc9fcbf9 TH	299	extern int blk_throtl_init(struct request_queue *q);
bc9fcbf9 TH	300	extern void blk_throtl_exit(struct request_queue *q);
d61fcfa4	301	extern void blk_throtl_register_queue(struct request_queue *q);
bc9fcbf9	302	#else /* CONFIG_BLK_DEV_THROTTLING */
c9a929dd	303	static inline void blk_throtl_drain(struct request_queue *q) { }
bc9fcbf9 TH	304	static inline int blk_throtl_init(struct request_queue *q) { return 0; }
bc9fcbf9 TH	305	static inline void blk_throtl_exit(struct request_queue *q) { }
d61fcfa4	306	static inline void blk_throtl_register_queue(struct request_queue *q) { }
bc9fcbf9	307	#endif /* CONFIG_BLK_DEV_THROTTLING */
297e3d85 SL	308	#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
	309	extern ssize_t blk_throtl_sample_time_show(struct request_queue q, char page);
	310	extern ssize_t blk_throtl_sample_time_store(struct request_queue *q,
	311	const char *page, size_t count);
9e234eea	312	extern void blk_throtl_bio_endio(struct bio *bio);
b9147dd1	313	extern void blk_throtl_stat_add(struct request *rq, u64 time);
9e234eea SL	314	#else
9e234eea SL	315	static inline void blk_throtl_bio_endio(struct bio *bio) { }
b9147dd1	316	static inline void blk_throtl_stat_add(struct request *rq, u64 time) { }
297e3d85	317	#endif
bc9fcbf9	318
3bce016a CH	319	#ifdef CONFIG_BOUNCE
	320	extern int init_emergency_isa_pool(void);
	321	extern void blk_queue_bounce(struct request_queue q, struct bio *bio);
	322	#else
	323	static inline int init_emergency_isa_pool(void)
	324	{
	325	return 0;
	326	}
	327	static inline void blk_queue_bounce(struct request_queue q, struct bio *bio)
	328	{
	329	}
	330	#endif /* CONFIG_BOUNCE */
	331
d7067512 JB	332	#ifdef CONFIG_BLK_CGROUP_IOLATENCY
	333	extern int blk_iolatency_init(struct request_queue *q);
	334	#else
	335	static inline int blk_iolatency_init(struct request_queue *q) { return 0; }
	336	#endif
	337
a2d6b3a2 DLM	338	struct bio blk_next_bio(struct bio bio, unsigned int nr_pages, gfp_t gfp);
a2d6b3a2 DLM	339
bf505456 DLM	340	#ifdef CONFIG_BLK_DEV_ZONED
	341	void blk_queue_free_zone_bitmaps(struct request_queue *q);
	342	#else
	343	static inline void blk_queue_free_zone_bitmaps(struct request_queue *q) {}
	344	#endif
	345
bc9fcbf9	346	#endif /* BLK_INTERNAL_H */