[linux.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 <linux/part_stat.h>
#include <linux/blk-crypto.h>
#include <linux/memblock.h>	/* for max_pfn/max_low_pfn */
#include <xen/xen.h>
#include "blk-crypto-internal.h"
#include "blk-mq.h"
#include "blk-mq-sched.h"

struct elevator_type;

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

extern struct dentry *blk_debugfs_root;

struct blk_flush_queue {
	unsigned int		flush_pending_idx:1;
	unsigned int		flush_running_idx:1;
	blk_status_t 		rq_status;
	unsigned long		flush_pending_since;
	struct list_head	flush_queue[2];
	struct list_head	flush_data_in_flight;
	struct request		*flush_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);
}

bool is_flush_rq(struct request *req);

struct blk_flush_queue *blk_alloc_flush_queue(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);
void __blk_mq_unfreeze_queue(struct request_queue *q, bool force_atomic);
void blk_queue_start_drain(struct request_queue *q);
int __bio_queue_enter(struct request_queue *q, struct bio *bio);
bool submit_bio_checks(struct bio *bio);

static inline bool blk_try_enter_queue(struct request_queue *q, bool pm)
{
	rcu_read_lock();
	if (!percpu_ref_tryget_live_rcu(&q->q_usage_counter))
		goto fail;

	/*
	 * The code that increments the pm_only counter must ensure that the
	 * counter is globally visible before the queue is unfrozen.
	 */
	if (blk_queue_pm_only(q) &&
	    (!pm || queue_rpm_status(q) == RPM_SUSPENDED))
		goto fail_put;

	rcu_read_unlock();
	return true;

fail_put:
	blk_queue_exit(q);
fail:
	rcu_read_unlock();
	return false;
}

static inline int bio_queue_enter(struct bio *bio)
{
	struct request_queue *q = bdev_get_queue(bio->bi_bdev);

	if (blk_try_enter_queue(q, false))
		return 0;
	return __bio_queue_enter(q, bio);
}

#define BIO_INLINE_VECS 4
struct bio_vec *bvec_alloc(mempool_t *pool, unsigned short *nr_vecs,
		gfp_t gfp_mask);
void bvec_free(mempool_t *pool, struct bio_vec *bv, unsigned short nr_vecs);

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 bool rq_mergeable(struct request *rq)
{
	if (blk_rq_is_passthrough(rq))
		return false;

	if (req_op(rq) == REQ_OP_FLUSH)
		return false;

	if (req_op(rq) == REQ_OP_WRITE_ZEROES)
		return false;

	if (req_op(rq) == REQ_OP_ZONE_APPEND)
		return false;

	if (rq->cmd_flags & REQ_NOMERGE_FLAGS)
		return false;
	if (rq->rq_flags & RQF_NOMERGE_FLAGS)
		return false;

	return true;
}

/*
 * There are two different ways to handle DISCARD merges:
 *  1) If max_discard_segments > 1, the driver treats every bio as a range and
 *     send the bios to controller together. The ranges don't need to be
 *     contiguous.
 *  2) Otherwise, the request will be normal read/write requests.  The ranges
 *     need to be contiguous.
 */
static inline bool blk_discard_mergable(struct request *req)
{
	if (req_op(req) == REQ_OP_DISCARD &&
	    queue_max_discard_segments(req->q) > 1)
		return true;
	return false;
}

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

bool blk_integrity_merge_rq(struct request_queue *, struct request *,
		struct request *);
bool blk_integrity_merge_bio(struct request_queue *, struct request *,
		struct bio *);

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);
}

int blk_integrity_add(struct gendisk *disk);
void blk_integrity_del(struct gendisk *);
#else /* CONFIG_BLK_DEV_INTEGRITY */
static inline bool blk_integrity_merge_rq(struct request_queue *rq,
		struct request *r1, struct request *r2)
{
	return true;
}
static inline bool blk_integrity_merge_bio(struct request_queue *rq,
		struct request *r, struct bio *b)
{
	return true;
}
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;
}
static inline void bio_integrity_free(struct bio *bio)
{
}
static inline int blk_integrity_add(struct gendisk *disk)
{
	return 0;
}
static inline void blk_integrity_del(struct gendisk *disk)
{
}
#endif /* CONFIG_BLK_DEV_INTEGRITY */

unsigned long blk_rq_timeout(unsigned long timeout);
void blk_add_timer(struct request *req);
void blk_print_req_error(struct request *req, blk_status_t status);

bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio,
		unsigned int nr_segs, bool *same_queue_rq);
bool blk_bio_list_merge(struct request_queue *q, struct list_head *list,
			struct bio *bio, unsigned int nr_segs);

void __blk_account_io_start(struct request *req);
void __blk_account_io_done(struct request *req, u64 now);

/*
 * Plug flush limits
 */
#define BLK_MAX_REQUEST_COUNT	32
#define BLK_PLUG_FLUSH_SIZE	(128 * 1024)

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

bool blk_insert_flush(struct request *rq);

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, bool uevent);
void elv_unregister_queue(struct request_queue *q);

static inline void elevator_exit(struct request_queue *q,
		struct elevator_queue *e)
{
	lockdep_assert_held(&q->sysfs_lock);

	blk_mq_sched_free_rqs(q);
	__elevator_exit(q, e);
}

ssize_t part_size_show(struct device *dev, struct device_attribute *attr,
		char *buf);
ssize_t part_stat_show(struct device *dev, struct device_attribute *attr,
		char *buf);
ssize_t part_inflight_show(struct device *dev, struct device_attribute *attr,
		char *buf);
ssize_t part_fail_show(struct device *dev, struct device_attribute *attr,
		char *buf);
ssize_t part_fail_store(struct device *dev, struct device_attribute *attr,
		const char *buf, size_t count);
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);

static inline bool blk_may_split(struct request_queue *q, struct bio *bio)
{
	switch (bio_op(bio)) {
	case REQ_OP_DISCARD:
	case REQ_OP_SECURE_ERASE:
	case REQ_OP_WRITE_ZEROES:
	case REQ_OP_WRITE_SAME:
		return true; /* non-trivial splitting decisions */
	default:
		break;
	}

	/*
	 * All drivers must accept single-segments bios that are <= PAGE_SIZE.
	 * This is a quick and dirty check that relies on the fact that
	 * bi_io_vec[0] is always valid if a bio has data.  The check might
	 * lead to occasional false negatives when bios are cloned, but compared
	 * to the performance impact of cloned bios themselves the loop below
	 * doesn't matter anyway.
	 */
	return q->limits.chunk_sectors || bio->bi_vcnt != 1 ||
		bio->bi_io_vec->bv_len + bio->bi_io_vec->bv_offset > PAGE_SIZE;
}

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);
bool 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
 */
static inline bool blk_do_io_stat(struct request *rq)
{
	return (rq->rq_flags & RQF_IO_STAT) && rq->rq_disk;
}

static inline void blk_account_io_done(struct request *req, u64 now)
{
	/*
	 * Account IO completion.  flush_rq isn't accounted as a
	 * normal IO on queueing nor completion.  Accounting the
	 * containing request is enough.
	 */
	if (blk_do_io_stat(req) && req->part &&
	    !(req->rq_flags & RQF_FLUSH_SEQ))
		__blk_account_io_done(req, now);
}

static inline void blk_account_io_start(struct request *req)
{
	if (blk_do_io_stat(req))
		__blk_account_io_start(req);
}

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;
}

/*
 * The max bio size which is aligned to q->limits.discard_granularity. This
 * is a hint to split large discard bio in generic block layer, then if device
 * driver needs to split the discard bio into smaller ones, their bi_size can
 * be very probably and easily aligned to discard_granularity of the device's
 * queue.
 */
static inline unsigned int bio_aligned_discard_max_sectors(
					struct request_queue *q)
{
	return round_down(UINT_MAX, q->limits.discard_granularity) >>
			SECTOR_SHIFT;
}

/*
 * 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);

#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

void __blk_queue_bounce(struct request_queue *q, struct bio **bio);

static inline bool blk_queue_may_bounce(struct request_queue *q)
{
	return IS_ENABLED(CONFIG_BOUNCE) &&
		q->limits.bounce == BLK_BOUNCE_HIGH &&
		max_low_pfn >= max_pfn;
}

static inline void blk_queue_bounce(struct request_queue *q, struct bio **bio)
{
	if (unlikely(blk_queue_may_bounce(q) && bio_has_data(*bio)))
		__blk_queue_bounce(q, bio);	
}

#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);
void blk_queue_clear_zone_settings(struct request_queue *q);
#else
static inline void blk_queue_free_zone_bitmaps(struct request_queue *q) {}
static inline void blk_queue_clear_zone_settings(struct request_queue *q) {}
#endif

int blk_alloc_ext_minor(void);
void blk_free_ext_minor(unsigned int minor);
#define ADDPART_FLAG_NONE	0
#define ADDPART_FLAG_RAID	1
#define ADDPART_FLAG_WHOLEDISK	2
int bdev_add_partition(struct gendisk *disk, int partno, sector_t start,
		sector_t length);
int bdev_del_partition(struct gendisk *disk, int partno);
int bdev_resize_partition(struct gendisk *disk, int partno, sector_t start,
		sector_t length);

int bio_add_hw_page(struct request_queue *q, struct bio *bio,
		struct page *page, unsigned int len, unsigned int offset,
		unsigned int max_sectors, bool *same_page);

struct request_queue *blk_alloc_queue(int node_id);

int disk_alloc_events(struct gendisk *disk);
void disk_add_events(struct gendisk *disk);
void disk_del_events(struct gendisk *disk);
void disk_release_events(struct gendisk *disk);
extern struct device_attribute dev_attr_events;
extern struct device_attribute dev_attr_events_async;
extern struct device_attribute dev_attr_events_poll_msecs;

static inline void bio_clear_polled(struct bio *bio)
{
	/* can't support alloc cache if we turn off polling */
	bio_clear_flag(bio, BIO_PERCPU_CACHE);
	bio->bi_opf &= ~REQ_POLLED;
}

long blkdev_ioctl(struct file *file, unsigned cmd, unsigned long arg);
long compat_blkdev_ioctl(struct file *file, unsigned cmd, unsigned long arg);

extern const struct address_space_operations def_blk_aops;

int disk_register_independent_access_ranges(struct gendisk *disk,
				struct blk_independent_access_ranges *new_iars);
void disk_unregister_independent_access_ranges(struct gendisk *disk);

#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>
c6a564ff	7	#include <linux/part_stat.h>
a892c8d5	8	#include <linux/blk-crypto.h>
9bb33f24	9	#include <linux/memblock.h> /* for max_pfn/max_low_pfn */
c39ae60d	10	#include <xen/xen.h>
a892c8d5	11	#include "blk-crypto-internal.h"
f70ced09	12	#include "blk-mq.h"
c3e22192	13	#include "blk-mq-sched.h"
a73f730d	14
2e9bc346 CH	15	struct elevator_type;
2e9bc346 CH	16
0d2602ca JA	17	/* Max future timer expiry for timeouts */
	18	#define BLK_MAX_TIMEOUT (5 * HZ)
	19
18fbda91	20	extern struct dentry *blk_debugfs_root;
18fbda91	21
7c94e1c1	22	struct blk_flush_queue {
7c94e1c1 ML	23	unsigned int flush_pending_idx:1;
7c94e1c1 ML	24	unsigned int flush_running_idx:1;
8d699663	25	blk_status_t rq_status;
7c94e1c1 ML	26	unsigned long flush_pending_since;
	27	struct list_head flush_queue[2];
	28	struct list_head flush_data_in_flight;
	29	struct request *flush_rq;
0048b483	30
7c94e1c1 ML	31	spinlock_t mq_flush_lock;
	32	};
	33
8324aa91 JA	34	extern struct kmem_cache *blk_requestq_cachep;
8324aa91 JA	35	extern struct kobj_type blk_queue_ktype;
a73f730d	36	extern struct ida blk_queue_ida;
8324aa91	37
f9afca4d JA	38	static inline struct blk_flush_queue *
f9afca4d JA	39	blk_get_flush_queue(struct request_queue q, struct blk_mq_ctx ctx)
7c94e1c1	40	{
8ccdf4a3	41	return blk_mq_map_queue(q, REQ_OP_FLUSH, ctx)->fq;
7c94e1c1 ML	42	}
7c94e1c1 ML	43
09ac46c4 TH	44	static inline void __blk_get_queue(struct request_queue *q)
	45	{
	46	kobject_get(&q->kobj);
	47	}
	48
a9ed27a7	49	bool is_flush_rq(struct request *req);
8d699663	50
754a1572 GJ	51	struct blk_flush_queue *blk_alloc_flush_queue(int node, int cmd_size,
754a1572 GJ	52	gfp_t flags);
f70ced09	53	void blk_free_flush_queue(struct blk_flush_queue *q);
f3552655	54
3ef28e83	55	void blk_freeze_queue(struct request_queue *q);
aec89dc5	56	void __blk_mq_unfreeze_queue(struct request_queue *q, bool force_atomic);
8e141f9e	57	void blk_queue_start_drain(struct request_queue *q);
c98cb5bb	58	int __bio_queue_enter(struct request_queue q, struct bio bio);
900e0807	59	bool submit_bio_checks(struct bio *bio);
c98cb5bb JA	60
	61	static inline bool blk_try_enter_queue(struct request_queue *q, bool pm)
	62	{
	63	rcu_read_lock();
	64	if (!percpu_ref_tryget_live_rcu(&q->q_usage_counter))
	65	goto fail;
	66
	67	/*
	68	* The code that increments the pm_only counter must ensure that the
	69	* counter is globally visible before the queue is unfrozen.
	70	*/
	71	if (blk_queue_pm_only(q) &&
	72	(!pm \|\| queue_rpm_status(q) == RPM_SUSPENDED))
	73	goto fail_put;
	74
	75	rcu_read_unlock();
	76	return true;
	77
	78	fail_put:
	79	blk_queue_exit(q);
	80	fail:
	81	rcu_read_unlock();
	82	return false;
	83	}
	84
	85	static inline int bio_queue_enter(struct bio *bio)
	86	{
	87	struct request_queue *q = bdev_get_queue(bio->bi_bdev);
	88
	89	if (blk_try_enter_queue(q, false))
	90	return 0;
	91	return __bio_queue_enter(q, bio);
	92	}
3ef28e83	93
dc0b8a57	94	#define BIO_INLINE_VECS 4
7a800a20 CH	95	struct bio_vec bvec_alloc(mempool_t pool, unsigned short *nr_vecs,
	96	gfp_t gfp_mask);
	97	void bvec_free(mempool_t pool, struct bio_vec bv, unsigned short nr_vecs);
eec716a1	98
3dccdae5 CH	99	static inline bool biovec_phys_mergeable(struct request_queue *q,
3dccdae5 CH	100	struct bio_vec vec1, struct bio_vec vec2)
6a9f5f24	101	{
3dccdae5	102	unsigned long mask = queue_segment_boundary(q);
6e768461 CH	103	phys_addr_t addr1 = page_to_phys(vec1->bv_page) + vec1->bv_offset;
6e768461 CH	104	phys_addr_t addr2 = page_to_phys(vec2->bv_page) + vec2->bv_offset;
3dccdae5 CH	105
3dccdae5 CH	106	if (addr1 + vec1->bv_len != addr2)
6a9f5f24	107	return false;
0383ad43	108	if (xen_domain() && !xen_biovec_phys_mergeable(vec1, vec2->bv_page))
6a9f5f24	109	return false;
3dccdae5 CH	110	if ((addr1 \| mask) != ((addr2 + vec2->bv_len - 1) \| mask))
3dccdae5 CH	111	return false;
6a9f5f24 CH	112	return true;
	113	}
	114
27ca1d4e CH	115	static inline bool __bvec_gap_to_prev(struct request_queue *q,
	116	struct bio_vec *bprv, unsigned int offset)
	117	{
df376b2e	118	return (offset & queue_virt_boundary(q)) \|\|
27ca1d4e CH	119	((bprv->bv_offset + bprv->bv_len) & queue_virt_boundary(q));
	120	}
	121
	122	/*
	123	* Check if adding a bio_vec after bprv with offset would create a gap in
	124	* the SG list. Most drivers don't care about this, but some do.
	125	*/
	126	static inline bool bvec_gap_to_prev(struct request_queue *q,
	127	struct bio_vec *bprv, unsigned int offset)
	128	{
	129	if (!queue_virt_boundary(q))
	130	return false;
	131	return __bvec_gap_to_prev(q, bprv, offset);
	132	}
	133
badf7f64 CH	134	static inline bool rq_mergeable(struct request *rq)
	135	{
	136	if (blk_rq_is_passthrough(rq))
	137	return false;
	138
	139	if (req_op(rq) == REQ_OP_FLUSH)
	140	return false;
	141
	142	if (req_op(rq) == REQ_OP_WRITE_ZEROES)
	143	return false;
	144
	145	if (req_op(rq) == REQ_OP_ZONE_APPEND)
	146	return false;
	147
	148	if (rq->cmd_flags & REQ_NOMERGE_FLAGS)
	149	return false;
	150	if (rq->rq_flags & RQF_NOMERGE_FLAGS)
	151	return false;
	152
	153	return true;
	154	}
	155
	156	/*
	157	* There are two different ways to handle DISCARD merges:
	158	* 1) If max_discard_segments > 1, the driver treats every bio as a range and
	159	* send the bios to controller together. The ranges don't need to be
	160	* contiguous.
	161	* 2) Otherwise, the request will be normal read/write requests. The ranges
	162	* need to be contiguous.
	163	*/
	164	static inline bool blk_discard_mergable(struct request *req)
	165	{
	166	if (req_op(req) == REQ_OP_DISCARD &&
	167	queue_max_discard_segments(req->q) > 1)
	168	return true;
	169	return false;
	170	}
	171
5a48fc14 DW	172	#ifdef CONFIG_BLK_DEV_INTEGRITY
5a48fc14 DW	173	void blk_flush_integrity(void);
7c20f116	174	bool __bio_integrity_endio(struct bio *);
ece841ab	175	void bio_integrity_free(struct bio *bio);
7c20f116 CH	176	static inline bool bio_integrity_endio(struct bio *bio)
	177	{
	178	if (bio_integrity(bio))
	179	return __bio_integrity_endio(bio);
	180	return true;
	181	}
43b729bf	182
92cf2fd1 CH	183	bool blk_integrity_merge_rq(struct request_queue , struct request ,
92cf2fd1 CH	184	struct request *);
d59da419 CH	185	bool blk_integrity_merge_bio(struct request_queue , struct request ,
d59da419 CH	186	struct bio *);
92cf2fd1	187
43b729bf CH	188	static inline bool integrity_req_gap_back_merge(struct request *req,
	189	struct bio *next)
	190	{
	191	struct bio_integrity_payload *bip = bio_integrity(req->bio);
	192	struct bio_integrity_payload *bip_next = bio_integrity(next);
	193
	194	return bvec_gap_to_prev(req->q, &bip->bip_vec[bip->bip_vcnt - 1],
	195	bip_next->bip_vec[0].bv_offset);
	196	}
	197
	198	static inline bool integrity_req_gap_front_merge(struct request *req,
	199	struct bio *bio)
	200	{
	201	struct bio_integrity_payload *bip = bio_integrity(bio);
	202	struct bio_integrity_payload *bip_next = bio_integrity(req->bio);
	203
	204	return bvec_gap_to_prev(req->q, &bip->bip_vec[bip->bip_vcnt - 1],
	205	bip_next->bip_vec[0].bv_offset);
	206	}
581e2600	207
614310c9	208	int blk_integrity_add(struct gendisk *disk);
581e2600	209	void blk_integrity_del(struct gendisk *);
43b729bf	210	#else /* CONFIG_BLK_DEV_INTEGRITY */
92cf2fd1 CH	211	static inline bool blk_integrity_merge_rq(struct request_queue *rq,
	212	struct request r1, struct request r2)
	213	{
	214	return true;
	215	}
d59da419 CH	216	static inline bool blk_integrity_merge_bio(struct request_queue *rq,
	217	struct request r, struct bio b)
	218	{
	219	return true;
	220	}
43b729bf CH	221	static inline bool integrity_req_gap_back_merge(struct request *req,
	222	struct bio *next)
	223	{
	224	return false;
	225	}
	226	static inline bool integrity_req_gap_front_merge(struct request *req,
	227	struct bio *bio)
	228	{
	229	return false;
	230	}
	231
5a48fc14 DW	232	static inline void blk_flush_integrity(void)
	233	{
	234	}
7c20f116 CH	235	static inline bool bio_integrity_endio(struct bio *bio)
	236	{
	237	return true;
	238	}
ece841ab JT	239	static inline void bio_integrity_free(struct bio *bio)
	240	{
	241	}
614310c9	242	static inline int blk_integrity_add(struct gendisk *disk)
581e2600	243	{
614310c9	244	return 0;
581e2600 CH	245	}
	246	static inline void blk_integrity_del(struct gendisk *disk)
	247	{
	248	}
43b729bf	249	#endif /* CONFIG_BLK_DEV_INTEGRITY */
8324aa91	250
0d2602ca	251	unsigned long blk_rq_timeout(unsigned long timeout);
87ee7b11	252	void blk_add_timer(struct request *req);
9be3e06f	253	void blk_print_req_error(struct request *req, blk_status_t status);
320ae51f	254
320ae51f	255	bool blk_attempt_plug_merge(struct request_queue q, struct bio bio,
87c037d1	256	unsigned int nr_segs, bool *same_queue_rq);
bdc6a287 BW	257	bool blk_bio_list_merge(struct request_queue q, struct list_head list,
bdc6a287 BW	258	struct bio *bio, unsigned int nr_segs);
320ae51f	259
be6bfe36 PB	260	void __blk_account_io_start(struct request *req);
be6bfe36 PB	261	void __blk_account_io_done(struct request *req, u64 now);
320ae51f	262
ba0ffdd8 JA	263	/*
	264	* Plug flush limits
	265	*/
	266	#define BLK_MAX_REQUEST_COUNT 32
	267	#define BLK_PLUG_FLUSH_SIZE (128 * 1024)
	268
158dbda0 TH	269	/*
	270	* Internal elevator interface
	271	*/
e8064021	272	#define ELV_ON_HASH(rq) ((rq)->rq_flags & RQF_HASHED)
158dbda0	273
d92ca9d8	274	bool blk_insert_flush(struct request *rq);
dd831006	275
d48ece20 JW	276	int elevator_switch_mq(struct request_queue *q,
d48ece20 JW	277	struct elevator_type *new_e);
c3e22192	278	void __elevator_exit(struct request_queue , struct elevator_queue );
cecf5d87	279	int elv_register_queue(struct request_queue *q, bool uevent);
83d016ac BVA	280	void elv_unregister_queue(struct request_queue *q);
83d016ac BVA	281
c3e22192 ML	282	static inline void elevator_exit(struct request_queue *q,
	283	struct elevator_queue *e)
	284	{
284b94be ML	285	lockdep_assert_held(&q->sysfs_lock);
284b94be ML	286
1820f4f0	287	blk_mq_sched_free_rqs(q);
c3e22192 ML	288	__elevator_exit(q, e);
	289	}
	290
3ad5cee5 CH	291	ssize_t part_size_show(struct device dev, struct device_attribute attr,
	292	char *buf);
	293	ssize_t part_stat_show(struct device dev, struct device_attribute attr,
	294	char *buf);
	295	ssize_t part_inflight_show(struct device dev, struct device_attribute attr,
	296	char *buf);
	297	ssize_t part_fail_show(struct device dev, struct device_attribute attr,
	298	char *buf);
	299	ssize_t part_fail_store(struct device dev, struct device_attribute attr,
	300	const char *buf, size_t count);
581d4e28 JA	301	ssize_t part_timeout_show(struct device , struct device_attribute , char *);
	302	ssize_t part_timeout_store(struct device , struct device_attribute ,
	303	const char *, size_t);
581d4e28	304
abd45c15 JA	305	static inline bool blk_may_split(struct request_queue q, struct bio bio)
	306	{
	307	switch (bio_op(bio)) {
	308	case REQ_OP_DISCARD:
	309	case REQ_OP_SECURE_ERASE:
	310	case REQ_OP_WRITE_ZEROES:
	311	case REQ_OP_WRITE_SAME:
	312	return true; /* non-trivial splitting decisions */
	313	default:
	314	break;
	315	}
	316
	317	/*
	318	* All drivers must accept single-segments bios that are <= PAGE_SIZE.
	319	* This is a quick and dirty check that relies on the fact that
	320	* bi_io_vec[0] is always valid if a bio has data. The check might
	321	* lead to occasional false negatives when bios are cloned, but compared
	322	* to the performance impact of cloned bios themselves the loop below
	323	* doesn't matter anyway.
	324	*/
	325	return q->limits.chunk_sectors \|\| bio->bi_vcnt != 1 \|\|
	326	bio->bi_io_vec->bv_len + bio->bi_io_vec->bv_offset > PAGE_SIZE;
	327	}
	328
	329	void __blk_queue_split(struct request_queue q, struct bio *bio,
	330	unsigned int *nr_segs);
14ccb66b CH	331	int ll_back_merge_fn(struct request req, struct bio bio,
14ccb66b CH	332	unsigned int nr_segs);
fd2ef39c	333	bool blk_attempt_req_merge(struct request_queue q, struct request rq,
5e84ea3a	334	struct request *next);
e9cd19c0	335	unsigned int blk_recalc_rq_segments(struct request *rq);
80a761fd	336	void blk_rq_set_mixed_merge(struct request *rq);
050c8ea8	337	bool blk_rq_merge_ok(struct request rq, struct bio bio);
34fe7c05	338	enum elv_merge blk_try_merge(struct request rq, struct bio bio);
d6d48196	339
ff88972c AB	340	int blk_dev_init(void);
ff88972c AB	341
c2553b58 JA	342	/*
	343	* Contribute to IO statistics IFF:
	344	*
	345	* a) it's attached to a gendisk, and
48d9b0d4	346	* b) the queue had IO stats enabled when this request was started
c2553b58	347	*/
599d067d	348	static inline bool blk_do_io_stat(struct request *rq)
fb8ec18c	349	{
be6bfe36 PB	350	return (rq->rq_flags & RQF_IO_STAT) && rq->rq_disk;
	351	}
	352
	353	static inline void blk_account_io_done(struct request *req, u64 now)
	354	{
	355	/*
	356	* Account IO completion. flush_rq isn't accounted as a
	357	* normal IO on queueing nor completion. Accounting the
	358	* containing request is enough.
	359	*/
	360	if (blk_do_io_stat(req) && req->part &&
	361	!(req->rq_flags & RQF_FLUSH_SEQ))
	362	__blk_account_io_done(req, now);
	363	}
	364
	365	static inline void blk_account_io_start(struct request *req)
	366	{
	367	if (blk_do_io_stat(req))
	368	__blk_account_io_start(req);
fb8ec18c JA	369	}
fb8ec18c JA	370
6cf7677f CH	371	static inline void req_set_nomerge(struct request_queue q, struct request req)
	372	{
	373	req->cmd_flags \|= REQ_NOMERGE;
	374	if (req == q->last_merge)
	375	q->last_merge = NULL;
	376	}
	377
1adfc5e4 ML	378	/*
	379	* The max size one bio can handle is UINT_MAX becasue bvec_iter.bi_size
	380	* is defined as 'unsigned int', meantime it has to aligned to with logical
	381	* block size which is the minimum accepted unit by hardware.
	382	*/
	383	static inline unsigned int bio_allowed_max_sectors(struct request_queue *q)
	384	{
	385	return round_down(UINT_MAX, queue_logical_block_size(q)) >> 9;
	386	}
	387
9b15d109 CL	388	/*
	389	* The max bio size which is aligned to q->limits.discard_granularity. This
	390	* is a hint to split large discard bio in generic block layer, then if device
	391	* driver needs to split the discard bio into smaller ones, their bi_size can
	392	* be very probably and easily aligned to discard_granularity of the device's
	393	* queue.
	394	*/
	395	static inline unsigned int bio_aligned_discard_max_sectors(
	396	struct request_queue *q)
	397	{
	398	return round_down(UINT_MAX, q->limits.discard_granularity) >>
	399	SECTOR_SHIFT;
	400	}
	401
f2dbd76a TH	402	/*
	403	* Internal io_context interface
	404	*/
	405	void get_io_context(struct io_context *ioc);
47fdd4ca	406	struct io_cq ioc_lookup_icq(struct io_context ioc, struct request_queue *q);
24acfc34 TH	407	struct io_cq ioc_create_icq(struct io_context ioc, struct request_queue *q,
24acfc34 TH	408	gfp_t gfp_mask);
7e5a8794	409	void ioc_clear_queue(struct request_queue *q);
f2dbd76a	410
24acfc34	411	int create_task_io_context(struct task_struct *task, gfp_t gfp_mask, int node);
f2dbd76a	412
297e3d85 SL	413	#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
	414	extern ssize_t blk_throtl_sample_time_show(struct request_queue q, char page);
	415	extern ssize_t blk_throtl_sample_time_store(struct request_queue *q,
	416	const char *page, size_t count);
9e234eea	417	extern void blk_throtl_bio_endio(struct bio *bio);
b9147dd1	418	extern void blk_throtl_stat_add(struct request *rq, u64 time);
9e234eea SL	419	#else
9e234eea SL	420	static inline void blk_throtl_bio_endio(struct bio *bio) { }
b9147dd1	421	static inline void blk_throtl_stat_add(struct request *rq, u64 time) { }
297e3d85	422	#endif
bc9fcbf9	423
9bb33f24 CH	424	void __blk_queue_bounce(struct request_queue q, struct bio *bio);
	425
	426	static inline bool blk_queue_may_bounce(struct request_queue *q)
	427	{
	428	return IS_ENABLED(CONFIG_BOUNCE) &&
	429	q->limits.bounce == BLK_BOUNCE_HIGH &&
	430	max_low_pfn >= max_pfn;
	431	}
	432
3bce016a CH	433	static inline void blk_queue_bounce(struct request_queue q, struct bio *bio)
3bce016a CH	434	{
9bb33f24 CH	435	if (unlikely(blk_queue_may_bounce(q) && bio_has_data(*bio)))
9bb33f24 CH	436	__blk_queue_bounce(q, bio);
3bce016a	437	}
3bce016a	438
d7067512 JB	439	#ifdef CONFIG_BLK_CGROUP_IOLATENCY
	440	extern int blk_iolatency_init(struct request_queue *q);
	441	#else
	442	static inline int blk_iolatency_init(struct request_queue *q) { return 0; }
	443	#endif
	444
a2d6b3a2 DLM	445	struct bio blk_next_bio(struct bio bio, unsigned int nr_pages, gfp_t gfp);
a2d6b3a2 DLM	446
bf505456 DLM	447	#ifdef CONFIG_BLK_DEV_ZONED
bf505456 DLM	448	void blk_queue_free_zone_bitmaps(struct request_queue *q);
508aebb8	449	void blk_queue_clear_zone_settings(struct request_queue *q);
bf505456 DLM	450	#else
bf505456 DLM	451	static inline void blk_queue_free_zone_bitmaps(struct request_queue *q) {}
508aebb8	452	static inline void blk_queue_clear_zone_settings(struct request_queue *q) {}
bf505456 DLM	453	#endif
bf505456 DLM	454
7c3f828b CH	455	int blk_alloc_ext_minor(void);
7c3f828b CH	456	void blk_free_ext_minor(unsigned int minor);
581e2600 CH	457	#define ADDPART_FLAG_NONE 0
	458	#define ADDPART_FLAG_RAID 1
	459	#define ADDPART_FLAG_WHOLEDISK 2
7f6be376 CH	460	int bdev_add_partition(struct gendisk *disk, int partno, sector_t start,
7f6be376 CH	461	sector_t length);
926fbb16	462	int bdev_del_partition(struct gendisk *disk, int partno);
3d2e7989 CH	463	int bdev_resize_partition(struct gendisk *disk, int partno, sector_t start,
3d2e7989 CH	464	sector_t length);
581e2600	465
e4581105	466	int bio_add_hw_page(struct request_queue q, struct bio bio,
130879f1	467	struct page *page, unsigned int len, unsigned int offset,
e4581105	468	unsigned int max_sectors, bool *same_page);
130879f1	469
da7ba729 CH	470	struct request_queue *blk_alloc_queue(int node_id);
da7ba729 CH	471
92e7755e	472	int disk_alloc_events(struct gendisk *disk);
d5870edf CH	473	void disk_add_events(struct gendisk *disk);
	474	void disk_del_events(struct gendisk *disk);
	475	void disk_release_events(struct gendisk *disk);
2bc8cda5 CH	476	extern struct device_attribute dev_attr_events;
	477	extern struct device_attribute dev_attr_events_async;
	478	extern struct device_attribute dev_attr_events_poll_msecs;
d5870edf	479
6ce913fe	480	static inline void bio_clear_polled(struct bio *bio)
270a1c91 JA	481	{
	482	/* can't support alloc cache if we turn off polling */
	483	bio_clear_flag(bio, BIO_PERCPU_CACHE);
6ce913fe	484	bio->bi_opf &= ~REQ_POLLED;
270a1c91 JA	485	}
270a1c91 JA	486
8a709512	487	long blkdev_ioctl(struct file *file, unsigned cmd, unsigned long arg);
84b8514b CH	488	long compat_blkdev_ioctl(struct file *file, unsigned cmd, unsigned long arg);
84b8514b CH	489
cd82cca7 CH	490	extern const struct address_space_operations def_blk_aops;
cd82cca7 CH	491
a2247f19 DLM	492	int disk_register_independent_access_ranges(struct gendisk *disk,
	493	struct blk_independent_access_ranges *new_iars);
	494	void disk_unregister_independent_access_ranges(struct gendisk *disk);
	495
bc9fcbf9	496	#endif /* BLK_INTERNAL_H */