blk.h 14.4 KB
Newer Older
1
/* SPDX-License-Identifier: GPL-2.0 */
2 3 4
#ifndef BLK_INTERNAL_H
#define BLK_INTERNAL_H

5
#include <linux/blk-crypto.h>
6
#include <linux/memblock.h>	/* for max_pfn/max_low_pfn */
7
#include <xen/xen.h>
8
#include "blk-crypto-internal.h"
9

10 11
struct elevator_type;

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

15 16
extern struct dentry *blk_debugfs_root;

17 18 19
struct blk_flush_queue {
	unsigned int		flush_pending_idx:1;
	unsigned int		flush_running_idx:1;
20
	blk_status_t 		rq_status;
21 22 23 24
	unsigned long		flush_pending_since;
	struct list_head	flush_queue[2];
	struct list_head	flush_data_in_flight;
	struct request		*flush_rq;
25

26 27 28
	spinlock_t		mq_flush_lock;
};

M
Ming Lei 已提交
29
bool is_flush_rq(struct request *req);
30

31 32
struct blk_flush_queue *blk_alloc_flush_queue(int node, int cmd_size,
					      gfp_t flags);
33
void blk_free_flush_queue(struct blk_flush_queue *q);
34

35
void blk_freeze_queue(struct request_queue *q);
36
void __blk_mq_unfreeze_queue(struct request_queue *q, bool force_atomic);
37
void blk_queue_start_drain(struct request_queue *q);
38
int __bio_queue_enter(struct request_queue *q, struct bio *bio);
39
void submit_bio_noacct_nocheck(struct bio *bio);
40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72

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

74
#define BIO_INLINE_VECS 4
75 76 77
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);
78

79 80
static inline bool biovec_phys_mergeable(struct request_queue *q,
		struct bio_vec *vec1, struct bio_vec *vec2)
81
{
82
	unsigned long mask = queue_segment_boundary(q);
C
Christoph Hellwig 已提交
83 84
	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;
85

86 87 88 89 90 91 92
	/*
	 * Merging adjacent physical pages may not work correctly under KMSAN
	 * if their metadata pages aren't adjacent. Just disable merging.
	 */
	if (IS_ENABLED(CONFIG_KMSAN))
		return false;

93
	if (addr1 + vec1->bv_len != addr2)
94
		return false;
95
	if (xen_domain() && !xen_biovec_phys_mergeable(vec1, vec2->bv_page))
96
		return false;
97 98
	if ((addr1 | mask) != ((addr2 + vec2->bv_len - 1) | mask))
		return false;
99 100 101
	return true;
}

102
static inline bool __bvec_gap_to_prev(const struct queue_limits *lim,
103 104
		struct bio_vec *bprv, unsigned int offset)
{
105 106
	return (offset & lim->virt_boundary_mask) ||
		((bprv->bv_offset + bprv->bv_len) & lim->virt_boundary_mask);
107 108 109 110 111 112
}

/*
 * 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.
 */
113
static inline bool bvec_gap_to_prev(const struct queue_limits *lim,
114 115
		struct bio_vec *bprv, unsigned int offset)
{
116
	if (!lim->virt_boundary_mask)
117
		return false;
118
	return __bvec_gap_to_prev(lim, bprv, offset);
119 120
}

121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158
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;
}

159
static inline unsigned int blk_queue_get_max_sectors(struct request_queue *q,
160
						     enum req_op op)
161 162 163 164 165 166 167 168 169 170 171
{
	if (unlikely(op == REQ_OP_DISCARD || op == REQ_OP_SECURE_ERASE))
		return min(q->limits.max_discard_sectors,
			   UINT_MAX >> SECTOR_SHIFT);

	if (unlikely(op == REQ_OP_WRITE_ZEROES))
		return q->limits.max_write_zeroes_sectors;

	return q->limits.max_sectors;
}

172 173
#ifdef CONFIG_BLK_DEV_INTEGRITY
void blk_flush_integrity(void);
174
bool __bio_integrity_endio(struct bio *);
175
void bio_integrity_free(struct bio *bio);
176 177 178 179 180 181
static inline bool bio_integrity_endio(struct bio *bio)
{
	if (bio_integrity(bio))
		return __bio_integrity_endio(bio);
	return true;
}
182

183 184
bool blk_integrity_merge_rq(struct request_queue *, struct request *,
		struct request *);
185 186
bool blk_integrity_merge_bio(struct request_queue *, struct request *,
		struct bio *);
187

188 189 190 191 192 193
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);

194 195
	return bvec_gap_to_prev(&req->q->limits,
				&bip->bip_vec[bip->bip_vcnt - 1],
196 197 198 199 200 201 202 203 204
				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);

205 206
	return bvec_gap_to_prev(&req->q->limits,
				&bip->bip_vec[bip->bip_vcnt - 1],
207 208
				bip_next->bip_vec[0].bv_offset);
}
209

210
int blk_integrity_add(struct gendisk *disk);
211
void blk_integrity_del(struct gendisk *);
212
#else /* CONFIG_BLK_DEV_INTEGRITY */
213 214 215 216 217
static inline bool blk_integrity_merge_rq(struct request_queue *rq,
		struct request *r1, struct request *r2)
{
	return true;
}
218 219 220 221 222
static inline bool blk_integrity_merge_bio(struct request_queue *rq,
		struct request *r, struct bio *b)
{
	return true;
}
223 224 225 226 227 228 229 230 231 232 233
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;
}

234 235 236
static inline void blk_flush_integrity(void)
{
}
237 238 239 240
static inline bool bio_integrity_endio(struct bio *bio)
{
	return true;
}
241 242 243
static inline void bio_integrity_free(struct bio *bio)
{
}
244
static inline int blk_integrity_add(struct gendisk *disk)
245
{
246
	return 0;
247 248 249 250
}
static inline void blk_integrity_del(struct gendisk *disk)
{
}
251
#endif /* CONFIG_BLK_DEV_INTEGRITY */
252

253
unsigned long blk_rq_timeout(unsigned long timeout);
254
void blk_add_timer(struct request *req);
255
const char *blk_status_to_str(blk_status_t status);
256 257

bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio,
258
		unsigned int nr_segs);
259 260
bool blk_bio_list_merge(struct request_queue *q, struct list_head *list,
			struct bio *bio, unsigned int nr_segs);
261

262 263 264 265 266 267
/*
 * Plug flush limits
 */
#define BLK_MAX_REQUEST_COUNT	32
#define BLK_PLUG_FLUSH_SIZE	(128 * 1024)

268 269 270
/*
 * Internal elevator interface
 */
271
#define ELV_ON_HASH(rq) ((rq)->rq_flags & RQF_HASHED)
272

273
void blk_insert_flush(struct request *rq);
T
Tejun Heo 已提交
274

275
int elevator_switch(struct request_queue *q, struct elevator_type *new_e);
C
Christoph Hellwig 已提交
276
void elevator_disable(struct request_queue *q);
277
void elevator_exit(struct request_queue *q);
278
int elv_register_queue(struct request_queue *q, bool uevent);
279 280
void elv_unregister_queue(struct request_queue *q);

281 282 283 284 285 286 287 288 289 290
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);
291 292 293 294
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);

295
static inline bool bio_may_exceed_limits(struct bio *bio,
296
					 const struct queue_limits *lim)
297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314
{
	switch (bio_op(bio)) {
	case REQ_OP_DISCARD:
	case REQ_OP_SECURE_ERASE:
	case REQ_OP_WRITE_ZEROES:
		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.
	 */
315
	return lim->chunk_sectors || bio->bi_vcnt != 1 ||
316 317 318
		bio->bi_io_vec->bv_len + bio->bi_io_vec->bv_offset > PAGE_SIZE;
}

319 320 321
struct bio *__bio_split_to_limits(struct bio *bio,
				  const struct queue_limits *lim,
				  unsigned int *nr_segs);
322 323
int ll_back_merge_fn(struct request *req, struct bio *bio,
		unsigned int nr_segs);
324
bool blk_attempt_req_merge(struct request_queue *q, struct request *rq,
325
				struct request *next);
326
unsigned int blk_recalc_rq_segments(struct request *rq);
327
void blk_rq_set_mixed_merge(struct request *rq);
328
bool blk_rq_merge_ok(struct request *rq, struct bio *bio);
329
enum elv_merge blk_try_merge(struct request *rq, struct bio *bio);
330

331 332
int blk_dev_init(void);

333 334 335 336
/*
 * Contribute to IO statistics IFF:
 *
 *	a) it's attached to a gendisk, and
337
 *	b) the queue had IO stats enabled when this request was started
338
 */
339
static inline bool blk_do_io_stat(struct request *rq)
340
{
341
	return (rq->rq_flags & RQF_IO_STAT) && !blk_rq_is_passthrough(rq);
342 343
}

344
void update_io_ticks(struct block_device *part, unsigned long now, bool end);
345

346 347 348 349 350 351 352
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;
}

353 354 355
/*
 * Internal io_context interface
 */
356
struct io_cq *ioc_find_get_icq(struct request_queue *q);
C
Christoph Hellwig 已提交
357
struct io_cq *ioc_lookup_icq(struct request_queue *q);
358
#ifdef CONFIG_BLK_ICQ
359
void ioc_clear_queue(struct request_queue *q);
360 361 362 363 364
#else
static inline void ioc_clear_queue(struct request_queue *q)
{
}
#endif /* CONFIG_BLK_ICQ */
365

366 367 368 369
#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);
370
extern void blk_throtl_bio_endio(struct bio *bio);
371
extern void blk_throtl_stat_add(struct request *rq, u64 time);
372 373
#else
static inline void blk_throtl_bio_endio(struct bio *bio) { }
374
static inline void blk_throtl_stat_add(struct request *rq, u64 time) { }
375
#endif
376

377
struct bio *__blk_queue_bounce(struct bio *bio, struct request_queue *q);
378 379 380 381 382 383 384 385

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

386 387
static inline struct bio *blk_queue_bounce(struct bio *bio,
		struct request_queue *q)
388
{
389 390 391
	if (unlikely(blk_queue_may_bounce(q) && bio_has_data(bio)))
		return __blk_queue_bounce(bio, q);
	return bio;
392 393
}

394
#ifdef CONFIG_BLK_CGROUP_IOLATENCY
395
int blk_iolatency_init(struct gendisk *disk);
396
#else
397
static inline int blk_iolatency_init(struct gendisk *disk) { return 0; };
398 399
#endif

400
#ifdef CONFIG_BLK_DEV_ZONED
401
void disk_free_zone_bitmaps(struct gendisk *disk);
402
void disk_clear_zone_settings(struct gendisk *disk);
403
#else
404
static inline void disk_free_zone_bitmaps(struct gendisk *disk) {}
405
static inline void disk_clear_zone_settings(struct gendisk *disk) {}
406 407
#endif

408 409
int blk_alloc_ext_minor(void);
void blk_free_ext_minor(unsigned int minor);
410 411 412
#define ADDPART_FLAG_NONE	0
#define ADDPART_FLAG_RAID	1
#define ADDPART_FLAG_WHOLEDISK	2
413 414
int bdev_add_partition(struct gendisk *disk, int partno, sector_t start,
		sector_t length);
415
int bdev_del_partition(struct gendisk *disk, int partno);
416 417
int bdev_resize_partition(struct gendisk *disk, int partno, sector_t start,
		sector_t length);
418
void blk_drop_partitions(struct gendisk *disk);
419

420 421 422
struct gendisk *__alloc_disk_node(struct request_queue *q, int node_id,
		struct lock_class_key *lkclass);

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

427
struct request_queue *blk_alloc_queue(int node_id);
428

429
int disk_scan_partitions(struct gendisk *disk, fmode_t mode, void *owner);
430

431
int disk_alloc_events(struct gendisk *disk);
432 433 434
void disk_add_events(struct gendisk *disk);
void disk_del_events(struct gendisk *disk);
void disk_release_events(struct gendisk *disk);
435 436 437
void disk_block_events(struct gendisk *disk);
void disk_unblock_events(struct gendisk *disk);
void disk_flush_events(struct gendisk *disk, unsigned int mask);
438 439 440
extern struct device_attribute dev_attr_events;
extern struct device_attribute dev_attr_events_async;
extern struct device_attribute dev_attr_events_poll_msecs;
441

442 443
extern struct attribute_group blk_trace_attr_group;

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

447 448
extern const struct address_space_operations def_blk_aops;

449
int disk_register_independent_access_ranges(struct gendisk *disk);
450 451
void disk_unregister_independent_access_ranges(struct gendisk *disk);

452 453 454 455 456 457 458 459 460 461
#ifdef CONFIG_FAIL_MAKE_REQUEST
bool should_fail_request(struct block_device *part, unsigned int bytes);
#else /* CONFIG_FAIL_MAKE_REQUEST */
static inline bool should_fail_request(struct block_device *part,
					unsigned int bytes)
{
	return false;
}
#endif /* CONFIG_FAIL_MAKE_REQUEST */

462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492
/*
 * Optimized request reference counting. Ideally we'd make timeouts be more
 * clever, as that's the only reason we need references at all... But until
 * this happens, this is faster than using refcount_t. Also see:
 *
 * abc54d634334 ("io_uring: switch to atomic_t for io_kiocb reference count")
 */
#define req_ref_zero_or_close_to_overflow(req)	\
	((unsigned int) atomic_read(&(req->ref)) + 127u <= 127u)

static inline bool req_ref_inc_not_zero(struct request *req)
{
	return atomic_inc_not_zero(&req->ref);
}

static inline bool req_ref_put_and_test(struct request *req)
{
	WARN_ON_ONCE(req_ref_zero_or_close_to_overflow(req));
	return atomic_dec_and_test(&req->ref);
}

static inline void req_ref_set(struct request *req, int value)
{
	atomic_set(&req->ref, value);
}

static inline int req_ref_read(struct request *req)
{
	return atomic_read(&req->ref);
}

493
#endif /* BLK_INTERNAL_H */