bio.h 20.7 KB
Newer Older
1
/* SPDX-License-Identifier: GPL-2.0 */
L
Linus Torvalds 已提交
2 3 4 5 6 7 8 9
/*
 * Copyright (C) 2001 Jens Axboe <axboe@suse.de>
 */
#ifndef __LINUX_BIO_H
#define __LINUX_BIO_H

#include <linux/highmem.h>
#include <linux/mempool.h>
10
#include <linux/ioprio.h>
L
Linus Torvalds 已提交
11

12
#ifdef CONFIG_BLOCK
13 14 15
/* struct bio, bio_vec and BIO_* flags are defined in blk_types.h */
#include <linux/blk_types.h>

L
Linus Torvalds 已提交
16 17 18 19 20 21 22 23
#define BIO_DEBUG

#ifdef BIO_DEBUG
#define BIO_BUG_ON	BUG_ON
#else
#define BIO_BUG_ON
#endif

24
#define BIO_MAX_PAGES		256
L
Linus Torvalds 已提交
25

26 27
#define bio_prio(bio)			(bio)->bi_ioprio
#define bio_set_prio(bio, prio)		((bio)->bi_ioprio = prio)
28

K
Kent Overstreet 已提交
29 30 31 32 33 34 35 36 37 38 39 40 41
#define bio_iter_iovec(bio, iter)				\
	bvec_iter_bvec((bio)->bi_io_vec, (iter))

#define bio_iter_page(bio, iter)				\
	bvec_iter_page((bio)->bi_io_vec, (iter))
#define bio_iter_len(bio, iter)					\
	bvec_iter_len((bio)->bi_io_vec, (iter))
#define bio_iter_offset(bio, iter)				\
	bvec_iter_offset((bio)->bi_io_vec, (iter))

#define bio_page(bio)		bio_iter_page((bio), (bio)->bi_iter)
#define bio_offset(bio)		bio_iter_offset((bio), (bio)->bi_iter)
#define bio_iovec(bio)		bio_iter_iovec((bio), (bio)->bi_iter)
42

43 44
#define bio_multiple_segments(bio)				\
	((bio)->bi_iter.bi_size != bio_iovec(bio).bv_len)
45 46 47 48 49 50

#define bvec_iter_sectors(iter)	((iter).bi_size >> 9)
#define bvec_iter_end_sector(iter) ((iter).bi_sector + bvec_iter_sectors((iter)))

#define bio_sectors(bio)	bvec_iter_sectors((bio)->bi_iter)
#define bio_end_sector(bio)	bvec_iter_end_sector((bio)->bi_iter)
51

52 53 54 55 56 57
/*
 * Return the data direction, READ or WRITE.
 */
#define bio_data_dir(bio) \
	(op_is_write(bio_op(bio)) ? WRITE : READ)

58 59 60 61 62 63 64
/*
 * Check whether this bio carries any data or not. A NULL bio is allowed.
 */
static inline bool bio_has_data(struct bio *bio)
{
	if (bio &&
	    bio->bi_iter.bi_size &&
A
Adrian Hunter 已提交
65
	    bio_op(bio) != REQ_OP_DISCARD &&
66 67
	    bio_op(bio) != REQ_OP_SECURE_ERASE &&
	    bio_op(bio) != REQ_OP_WRITE_ZEROES)
68 69 70 71 72
		return true;

	return false;
}

73 74
static inline bool bio_no_advance_iter(struct bio *bio)
{
A
Adrian Hunter 已提交
75 76
	return bio_op(bio) == REQ_OP_DISCARD ||
	       bio_op(bio) == REQ_OP_SECURE_ERASE ||
77 78
	       bio_op(bio) == REQ_OP_WRITE_SAME ||
	       bio_op(bio) == REQ_OP_WRITE_ZEROES;
79 80
}

81 82
static inline bool bio_mergeable(struct bio *bio)
{
J
Jens Axboe 已提交
83
	if (bio->bi_opf & REQ_NOMERGE_FLAGS)
84 85 86 87 88
		return false;

	return true;
}

89
static inline unsigned int bio_cur_bytes(struct bio *bio)
90
{
91
	if (bio_has_data(bio))
92
		return bio_iovec(bio).bv_len;
D
David Woodhouse 已提交
93
	else /* dataless requests such as discard */
94
		return bio->bi_iter.bi_size;
95 96 97 98
}

static inline void *bio_data(struct bio *bio)
{
99
	if (bio_has_data(bio))
100 101 102 103
		return page_address(bio_page(bio)) + bio_offset(bio);

	return NULL;
}
L
Linus Torvalds 已提交
104

105 106 107 108 109
static inline bool bio_full(struct bio *bio)
{
	return bio->bi_vcnt >= bio->bi_max_vecs;
}

110 111 112 113 114 115 116 117 118
static inline bool bio_next_segment(const struct bio *bio,
				    struct bvec_iter_all *iter)
{
	if (iter->idx >= bio->bi_vcnt)
		return false;

	bvec_advance(&bio->bi_io_vec[iter->idx], iter);
	return true;
}
119

120 121 122 123
/*
 * drivers should _never_ use the all version - the bio may have been split
 * before it got to the driver and the driver won't own all of it
 */
124 125
#define bio_for_each_segment_all(bvl, bio, iter) \
	for (bvl = bvec_init_iter_all(&iter); bio_next_segment((bio), &iter); )
126

K
Kent Overstreet 已提交
127 128 129 130 131
static inline void bio_advance_iter(struct bio *bio, struct bvec_iter *iter,
				    unsigned bytes)
{
	iter->bi_sector += bytes >> 9;

M
Ming Lei 已提交
132
	if (bio_no_advance_iter(bio))
K
Kent Overstreet 已提交
133
		iter->bi_size -= bytes;
M
Ming Lei 已提交
134
	else
K
Kent Overstreet 已提交
135
		bvec_iter_advance(bio->bi_io_vec, iter, bytes);
136
		/* TODO: It is reasonable to complete bio with error here. */
D
Dmitry Monakhov 已提交
137 138
}

139 140
#define __bio_for_each_segment(bvl, bio, iter, start)			\
	for (iter = (start);						\
K
Kent Overstreet 已提交
141 142 143
	     (iter).bi_size &&						\
		((bvl = bio_iter_iovec((bio), (iter))), 1);		\
	     bio_advance_iter((bio), &(iter), (bvl).bv_len))
144 145 146 147

#define bio_for_each_segment(bvl, bio, iter)				\
	__bio_for_each_segment(bvl, bio, iter, (bio)->bi_iter)

148 149 150 151 152 153 154 155 156 157
#define __bio_for_each_bvec(bvl, bio, iter, start)		\
	for (iter = (start);						\
	     (iter).bi_size &&						\
		((bvl = mp_bvec_iter_bvec((bio)->bi_io_vec, (iter))), 1); \
	     bio_advance_iter((bio), &(iter), (bvl).bv_len))

/* iterate over multi-page bvec */
#define bio_for_each_bvec(bvl, bio, iter)			\
	__bio_for_each_bvec(bvl, bio, iter, (bio)->bi_iter)

K
Kent Overstreet 已提交
158
#define bio_iter_last(bvec, iter) ((iter).bi_size == (bvec).bv_len)
L
Linus Torvalds 已提交
159

160
static inline unsigned bio_segments(struct bio *bio)
161 162 163 164 165
{
	unsigned segs = 0;
	struct bio_vec bv;
	struct bvec_iter iter;

166
	/*
167 168
	 * We special case discard/write same/write zeroes, because they
	 * interpret bi_size differently:
169 170
	 */

171 172 173 174
	switch (bio_op(bio)) {
	case REQ_OP_DISCARD:
	case REQ_OP_SECURE_ERASE:
	case REQ_OP_WRITE_ZEROES:
175 176
		return 0;
	case REQ_OP_WRITE_SAME:
177
		return 1;
178 179 180
	default:
		break;
	}
181

182
	bio_for_each_segment(bv, bio, iter)
183 184 185 186 187
		segs++;

	return segs;
}

L
Linus Torvalds 已提交
188 189 190 191 192 193 194 195 196 197 198 199 200 201
/*
 * get a reference to a bio, so it won't disappear. the intended use is
 * something like:
 *
 * bio_get(bio);
 * submit_bio(rw, bio);
 * if (bio->bi_flags ...)
 *	do_something
 * bio_put(bio);
 *
 * without the bio_get(), it could potentially complete I/O before submit_bio
 * returns. and then bio would be freed memory when if (bio->bi_flags ...)
 * runs
 */
202 203 204 205 206 207 208 209 210 211 212 213 214 215 216
static inline void bio_get(struct bio *bio)
{
	bio->bi_flags |= (1 << BIO_REFFED);
	smp_mb__before_atomic();
	atomic_inc(&bio->__bi_cnt);
}

static inline void bio_cnt_set(struct bio *bio, unsigned int count)
{
	if (count != 1) {
		bio->bi_flags |= (1 << BIO_REFFED);
		smp_mb__before_atomic();
	}
	atomic_set(&bio->__bi_cnt, count);
}
L
Linus Torvalds 已提交
217

218 219
static inline bool bio_flagged(struct bio *bio, unsigned int bit)
{
220
	return (bio->bi_flags & (1U << bit)) != 0;
221 222 223 224
}

static inline void bio_set_flag(struct bio *bio, unsigned int bit)
{
225
	bio->bi_flags |= (1U << bit);
226 227 228 229
}

static inline void bio_clear_flag(struct bio *bio, unsigned int bit)
{
230
	bio->bi_flags &= ~(1U << bit);
231 232
}

233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264
static inline void bio_get_first_bvec(struct bio *bio, struct bio_vec *bv)
{
	*bv = bio_iovec(bio);
}

static inline void bio_get_last_bvec(struct bio *bio, struct bio_vec *bv)
{
	struct bvec_iter iter = bio->bi_iter;
	int idx;

	if (unlikely(!bio_multiple_segments(bio))) {
		*bv = bio_iovec(bio);
		return;
	}

	bio_advance_iter(bio, &iter, iter.bi_size);

	if (!iter.bi_bvec_done)
		idx = iter.bi_idx - 1;
	else	/* in the middle of bvec */
		idx = iter.bi_idx;

	*bv = bio->bi_io_vec[idx];

	/*
	 * iter.bi_bvec_done records actual length of the last bvec
	 * if this bio ends in the middle of one io vector
	 */
	if (iter.bi_bvec_done)
		bv->bv_len = iter.bi_bvec_done;
}

265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281
static inline struct bio_vec *bio_first_bvec_all(struct bio *bio)
{
	WARN_ON_ONCE(bio_flagged(bio, BIO_CLONED));
	return bio->bi_io_vec;
}

static inline struct page *bio_first_page_all(struct bio *bio)
{
	return bio_first_bvec_all(bio)->bv_page;
}

static inline struct bio_vec *bio_last_bvec_all(struct bio *bio)
{
	WARN_ON_ONCE(bio_flagged(bio, BIO_CLONED));
	return &bio->bi_io_vec[bio->bi_vcnt - 1];
}

282 283 284 285 286 287 288 289
enum bip_flags {
	BIP_BLOCK_INTEGRITY	= 1 << 0, /* block layer owns integrity data */
	BIP_MAPPED_INTEGRITY	= 1 << 1, /* ref tag has been remapped */
	BIP_CTRL_NOCHECK	= 1 << 2, /* disable HBA integrity checking */
	BIP_DISK_NOCHECK	= 1 << 3, /* disable disk integrity checking */
	BIP_IP_CHECKSUM		= 1 << 4, /* IP checksum */
};

290 291 292 293 294 295
/*
 * bio integrity payload
 */
struct bio_integrity_payload {
	struct bio		*bip_bio;	/* parent bio */

296
	struct bvec_iter	bip_iter;
297

298
	unsigned short		bip_slab;	/* slab the bip came from */
299
	unsigned short		bip_vcnt;	/* # of integrity bio_vecs */
300
	unsigned short		bip_max_vcnt;	/* integrity bio_vec slots */
301
	unsigned short		bip_flags;	/* control flags */
302

M
Ming Lei 已提交
303 304
	struct bvec_iter	bio_iter;	/* for rewinding parent bio */

305
	struct work_struct	bip_work;	/* I/O completion */
306 307 308

	struct bio_vec		*bip_vec;
	struct bio_vec		bip_inline_vecs[0];/* embedded bvec array */
309
};
310

311 312 313 314
#if defined(CONFIG_BLK_DEV_INTEGRITY)

static inline struct bio_integrity_payload *bio_integrity(struct bio *bio)
{
J
Jens Axboe 已提交
315
	if (bio->bi_opf & REQ_INTEGRITY)
316 317 318 319 320
		return bio->bi_integrity;

	return NULL;
}

321 322 323 324 325 326 327 328 329
static inline bool bio_integrity_flagged(struct bio *bio, enum bip_flags flag)
{
	struct bio_integrity_payload *bip = bio_integrity(bio);

	if (bip)
		return bip->bip_flags & flag;

	return false;
}
330

331 332 333 334 335 336 337 338 339 340 341
static inline sector_t bip_get_seed(struct bio_integrity_payload *bip)
{
	return bip->bip_iter.bi_sector;
}

static inline void bip_set_seed(struct bio_integrity_payload *bip,
				sector_t seed)
{
	bip->bip_iter.bi_sector = seed;
}

342
#endif /* CONFIG_BLK_DEV_INTEGRITY */
L
Linus Torvalds 已提交
343

344
extern void bio_trim(struct bio *bio, int offset, int size);
K
Kent Overstreet 已提交
345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366
extern struct bio *bio_split(struct bio *bio, int sectors,
			     gfp_t gfp, struct bio_set *bs);

/**
 * bio_next_split - get next @sectors from a bio, splitting if necessary
 * @bio:	bio to split
 * @sectors:	number of sectors to split from the front of @bio
 * @gfp:	gfp mask
 * @bs:		bio set to allocate from
 *
 * Returns a bio representing the next @sectors of @bio - if the bio is smaller
 * than @sectors, returns the original bio unchanged.
 */
static inline struct bio *bio_next_split(struct bio *bio, int sectors,
					 gfp_t gfp, struct bio_set *bs)
{
	if (sectors >= bio_sectors(bio))
		return bio;

	return bio_split(bio, sectors, gfp, bs);
}

367 368
enum {
	BIOSET_NEED_BVECS = BIT(0),
369
	BIOSET_NEED_RESCUER = BIT(1),
370
};
K
Kent Overstreet 已提交
371 372
extern int bioset_init(struct bio_set *, unsigned int, unsigned int, int flags);
extern void bioset_exit(struct bio_set *);
373
extern int biovec_init_pool(mempool_t *pool, int pool_entries);
374
extern int bioset_init_from_src(struct bio_set *bs, struct bio_set *src);
L
Linus Torvalds 已提交
375

376
extern struct bio *bio_alloc_bioset(gfp_t, unsigned int, struct bio_set *);
L
Linus Torvalds 已提交
377 378
extern void bio_put(struct bio *);

K
Kent Overstreet 已提交
379 380
extern void __bio_clone_fast(struct bio *, struct bio *);
extern struct bio *bio_clone_fast(struct bio *, gfp_t, struct bio_set *);
381

382
extern struct bio_set fs_bio_set;
383 384 385

static inline struct bio *bio_alloc(gfp_t gfp_mask, unsigned int nr_iovecs)
{
386
	return bio_alloc_bioset(gfp_mask, nr_iovecs, &fs_bio_set);
387 388 389 390 391 392 393
}

static inline struct bio *bio_kmalloc(gfp_t gfp_mask, unsigned int nr_iovecs)
{
	return bio_alloc_bioset(gfp_mask, nr_iovecs, NULL);
}

394 395
extern blk_qc_t submit_bio(struct bio *);

396 397 398 399
extern void bio_endio(struct bio *);

static inline void bio_io_error(struct bio *bio)
{
400
	bio->bi_status = BLK_STS_IOERR;
401 402 403
	bio_endio(bio);
}

404 405 406
static inline void bio_wouldblock_error(struct bio *bio)
{
	bio->bi_status = BLK_STS_AGAIN;
407 408 409
	bio_endio(bio);
}

L
Linus Torvalds 已提交
410 411 412
struct request_queue;
extern int bio_phys_segments(struct request_queue *, struct bio *);

413
extern int submit_bio_wait(struct bio *bio);
K
Kent Overstreet 已提交
414 415
extern void bio_advance(struct bio *, unsigned);

416 417
extern void bio_init(struct bio *bio, struct bio_vec *table,
		     unsigned short max_vecs);
418
extern void bio_uninit(struct bio *);
K
Kent Overstreet 已提交
419
extern void bio_reset(struct bio *);
K
Kent Overstreet 已提交
420
void bio_chain(struct bio *, struct bio *);
L
Linus Torvalds 已提交
421 422

extern int bio_add_page(struct bio *, struct page *, unsigned int,unsigned int);
423 424
extern int bio_add_pc_page(struct request_queue *, struct bio *, struct page *,
			   unsigned int, unsigned int);
425
bool __bio_try_merge_page(struct bio *bio, struct page *page,
M
Ming Lei 已提交
426
		unsigned int len, unsigned int off, bool same_page);
427 428
void __bio_add_page(struct bio *bio, struct page *page,
		unsigned int len, unsigned int off);
429
int bio_iov_iter_get_pages(struct bio *bio, struct iov_iter *iter);
430
struct rq_map_data;
431
extern struct bio *bio_map_user_iov(struct request_queue *,
432
				    struct iov_iter *, gfp_t);
L
Linus Torvalds 已提交
433
extern void bio_unmap_user(struct bio *);
M
Mike Christie 已提交
434
extern struct bio *bio_map_kern(struct request_queue *, void *, unsigned int,
A
Al Viro 已提交
435
				gfp_t);
436 437
extern struct bio *bio_copy_kern(struct request_queue *, void *, unsigned int,
				 gfp_t, int);
L
Linus Torvalds 已提交
438 439
extern void bio_set_pages_dirty(struct bio *bio);
extern void bio_check_pages_dirty(struct bio *bio);
440

441
void generic_start_io_acct(struct request_queue *q, int op,
442
				unsigned long sectors, struct hd_struct *part);
443
void generic_end_io_acct(struct request_queue *q, int op,
444 445
				struct hd_struct *part,
				unsigned long start_time);
446

447 448 449 450 451 452 453 454 455 456 457
#ifndef ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
# error	"You should define ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE for your platform"
#endif
#if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
extern void bio_flush_dcache_pages(struct bio *bi);
#else
static inline void bio_flush_dcache_pages(struct bio *bi)
{
}
#endif

458 459
extern void bio_copy_data_iter(struct bio *dst, struct bvec_iter *dst_iter,
			       struct bio *src, struct bvec_iter *src_iter);
K
Kent Overstreet 已提交
460
extern void bio_copy_data(struct bio *dst, struct bio *src);
461
extern void bio_list_copy_data(struct bio *dst, struct bio *src);
462
extern void bio_free_pages(struct bio *bio);
K
Kent Overstreet 已提交
463

464
extern struct bio *bio_copy_user_iov(struct request_queue *,
465
				     struct rq_map_data *,
466
				     struct iov_iter *,
467
				     gfp_t);
L
Linus Torvalds 已提交
468
extern int bio_uncopy_user(struct bio *);
469 470 471 472 473 474 475
void zero_fill_bio_iter(struct bio *bio, struct bvec_iter iter);

static inline void zero_fill_bio(struct bio *bio)
{
	zero_fill_bio_iter(bio, bio->bi_iter);
}

476 477
extern struct bio_vec *bvec_alloc(gfp_t, int, unsigned long *, mempool_t *);
extern void bvec_free(mempool_t *, struct bio_vec *, unsigned int);
478
extern unsigned int bvec_nr_vecs(unsigned short idx);
479
extern const char *bio_devname(struct bio *bio, char *buffer);
480

481 482
#define bio_set_dev(bio, bdev) 			\
do {						\
S
Shaohua Li 已提交
483 484
	if ((bio)->bi_disk != (bdev)->bd_disk)	\
		bio_clear_flag(bio, BIO_THROTTLED);\
485 486
	(bio)->bi_disk = (bdev)->bd_disk;	\
	(bio)->bi_partno = (bdev)->bd_partno;	\
487
	bio_associate_blkg(bio);		\
488 489 490 491 492 493
} while (0)

#define bio_copy_dev(dst, src)			\
do {						\
	(dst)->bi_disk = (src)->bi_disk;	\
	(dst)->bi_partno = (src)->bi_partno;	\
494
	bio_clone_blkg_association(dst, src);	\
495 496 497 498 499
} while (0)

#define bio_dev(bio) \
	disk_devt((bio)->bi_disk)

500
#if defined(CONFIG_MEMCG) && defined(CONFIG_BLK_CGROUP)
501
void bio_associate_blkg_from_page(struct bio *bio, struct page *page);
502
#else
503 504
static inline void bio_associate_blkg_from_page(struct bio *bio,
						struct page *page) { }
505 506
#endif

507
#ifdef CONFIG_BLK_CGROUP
508 509
void bio_disassociate_blkg(struct bio *bio);
void bio_associate_blkg(struct bio *bio);
510 511
void bio_associate_blkg_from_css(struct bio *bio,
				 struct cgroup_subsys_state *css);
512
void bio_clone_blkg_association(struct bio *dst, struct bio *src);
513
#else	/* CONFIG_BLK_CGROUP */
514 515
static inline void bio_disassociate_blkg(struct bio *bio) { }
static inline void bio_associate_blkg(struct bio *bio) { }
516 517 518
static inline void bio_associate_blkg_from_css(struct bio *bio,
					       struct cgroup_subsys_state *css)
{ }
519 520
static inline void bio_clone_blkg_association(struct bio *dst,
					      struct bio *src) { }
521 522
#endif	/* CONFIG_BLK_CGROUP */

L
Linus Torvalds 已提交
523 524
#ifdef CONFIG_HIGHMEM
/*
525 526
 * remember never ever reenable interrupts between a bvec_kmap_irq and
 * bvec_kunmap_irq!
L
Linus Torvalds 已提交
527
 */
528
static inline char *bvec_kmap_irq(struct bio_vec *bvec, unsigned long *flags)
L
Linus Torvalds 已提交
529 530 531 532 533 534 535 536
{
	unsigned long addr;

	/*
	 * might not be a highmem page, but the preempt/irq count
	 * balancing is a lot nicer this way
	 */
	local_irq_save(*flags);
537
	addr = (unsigned long) kmap_atomic(bvec->bv_page);
L
Linus Torvalds 已提交
538 539 540 541 542 543

	BUG_ON(addr & ~PAGE_MASK);

	return (char *) addr + bvec->bv_offset;
}

544
static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags)
L
Linus Torvalds 已提交
545 546 547
{
	unsigned long ptr = (unsigned long) buffer & PAGE_MASK;

548
	kunmap_atomic((void *) ptr);
L
Linus Torvalds 已提交
549 550 551 552
	local_irq_restore(*flags);
}

#else
553 554 555 556 557 558 559 560 561
static inline char *bvec_kmap_irq(struct bio_vec *bvec, unsigned long *flags)
{
	return page_address(bvec->bv_page) + bvec->bv_offset;
}

static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags)
{
	*flags = 0;
}
L
Linus Torvalds 已提交
562 563
#endif

564
/*
565
 * BIO list management for use by remapping drivers (e.g. DM or MD) and loop.
566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585
 *
 * A bio_list anchors a singly-linked list of bios chained through the bi_next
 * member of the bio.  The bio_list also caches the last list member to allow
 * fast access to the tail.
 */
struct bio_list {
	struct bio *head;
	struct bio *tail;
};

static inline int bio_list_empty(const struct bio_list *bl)
{
	return bl->head == NULL;
}

static inline void bio_list_init(struct bio_list *bl)
{
	bl->head = bl->tail = NULL;
}

586 587
#define BIO_EMPTY_LIST	{ NULL, NULL }

588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650
#define bio_list_for_each(bio, bl) \
	for (bio = (bl)->head; bio; bio = bio->bi_next)

static inline unsigned bio_list_size(const struct bio_list *bl)
{
	unsigned sz = 0;
	struct bio *bio;

	bio_list_for_each(bio, bl)
		sz++;

	return sz;
}

static inline void bio_list_add(struct bio_list *bl, struct bio *bio)
{
	bio->bi_next = NULL;

	if (bl->tail)
		bl->tail->bi_next = bio;
	else
		bl->head = bio;

	bl->tail = bio;
}

static inline void bio_list_add_head(struct bio_list *bl, struct bio *bio)
{
	bio->bi_next = bl->head;

	bl->head = bio;

	if (!bl->tail)
		bl->tail = bio;
}

static inline void bio_list_merge(struct bio_list *bl, struct bio_list *bl2)
{
	if (!bl2->head)
		return;

	if (bl->tail)
		bl->tail->bi_next = bl2->head;
	else
		bl->head = bl2->head;

	bl->tail = bl2->tail;
}

static inline void bio_list_merge_head(struct bio_list *bl,
				       struct bio_list *bl2)
{
	if (!bl2->head)
		return;

	if (bl->head)
		bl2->tail->bi_next = bl->head;
	else
		bl->tail = bl2->tail;

	bl->head = bl2->head;
}

G
Geert Uytterhoeven 已提交
651 652 653 654 655
static inline struct bio *bio_list_peek(struct bio_list *bl)
{
	return bl->head;
}

656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679
static inline struct bio *bio_list_pop(struct bio_list *bl)
{
	struct bio *bio = bl->head;

	if (bio) {
		bl->head = bl->head->bi_next;
		if (!bl->head)
			bl->tail = NULL;

		bio->bi_next = NULL;
	}

	return bio;
}

static inline struct bio *bio_list_get(struct bio_list *bl)
{
	struct bio *bio = bl->head;

	bl->head = bl->tail = NULL;

	return bio;
}

680 681 682 683 684 685 686 687 688 689 690
/*
 * Increment chain count for the bio. Make sure the CHAIN flag update
 * is visible before the raised count.
 */
static inline void bio_inc_remaining(struct bio *bio)
{
	bio_set_flag(bio, BIO_CHAIN);
	smp_mb__before_atomic();
	atomic_inc(&bio->__bi_remaining);
}

K
Kent Overstreet 已提交
691 692 693 694 695 696 697 698 699 700 701 702
/*
 * bio_set is used to allow other portions of the IO system to
 * allocate their own private memory pools for bio and iovec structures.
 * These memory pools in turn all allocate from the bio_slab
 * and the bvec_slabs[].
 */
#define BIO_POOL_SIZE 2

struct bio_set {
	struct kmem_cache *bio_slab;
	unsigned int front_pad;

703 704
	mempool_t bio_pool;
	mempool_t bvec_pool;
K
Kent Overstreet 已提交
705
#if defined(CONFIG_BLK_DEV_INTEGRITY)
706 707
	mempool_t bio_integrity_pool;
	mempool_t bvec_integrity_pool;
K
Kent Overstreet 已提交
708
#endif
709 710 711 712 713 714 715 716 717

	/*
	 * Deadlock avoidance for stacking block drivers: see comments in
	 * bio_alloc_bioset() for details
	 */
	spinlock_t		rescue_lock;
	struct bio_list		rescue_list;
	struct work_struct	rescue_work;
	struct workqueue_struct	*rescue_workqueue;
K
Kent Overstreet 已提交
718 719 720 721 722 723 724 725
};

struct biovec_slab {
	int nr_vecs;
	char *name;
	struct kmem_cache *slab;
};

726 727 728 729 730
static inline bool bioset_initialized(struct bio_set *bs)
{
	return bs->bio_slab != NULL;
}

K
Kent Overstreet 已提交
731 732 733 734 735 736
/*
 * a small number of entries is fine, not going to be performance critical.
 * basically we just need to survive
 */
#define BIO_SPLIT_ENTRIES 2

737 738
#if defined(CONFIG_BLK_DEV_INTEGRITY)

739 740
#define bip_for_each_vec(bvl, bip, iter)				\
	for_each_bvec(bvl, (bip)->bip_vec, iter, (bip)->bip_iter)
741

742 743 744 745
#define bio_for_each_integrity_vec(_bvl, _bio, _iter)			\
	for_each_bio(_bio)						\
		bip_for_each_vec(_bvl, _bio->bi_integrity, _iter)

746 747
extern struct bio_integrity_payload *bio_integrity_alloc(struct bio *, gfp_t, unsigned int);
extern int bio_integrity_add_page(struct bio *, struct page *, unsigned int, unsigned int);
748
extern bool bio_integrity_prep(struct bio *);
749
extern void bio_integrity_advance(struct bio *, unsigned int);
750
extern void bio_integrity_trim(struct bio *);
751
extern int bio_integrity_clone(struct bio *, struct bio *, gfp_t);
752 753 754
extern int bioset_integrity_create(struct bio_set *, int);
extern void bioset_integrity_free(struct bio_set *);
extern void bio_integrity_init(void);
755 756 757

#else /* CONFIG_BLK_DEV_INTEGRITY */

758
static inline void *bio_integrity(struct bio *bio)
759
{
760
	return NULL;
761 762 763 764 765 766 767 768 769 770 771 772
}

static inline int bioset_integrity_create(struct bio_set *bs, int pool_size)
{
	return 0;
}

static inline void bioset_integrity_free (struct bio_set *bs)
{
	return;
}

773
static inline bool bio_integrity_prep(struct bio *bio)
774
{
775
	return true;
776 777
}

778
static inline int bio_integrity_clone(struct bio *bio, struct bio *bio_src,
779
				      gfp_t gfp_mask)
780 781 782
{
	return 0;
}
783 784 785 786 787 788 789

static inline void bio_integrity_advance(struct bio *bio,
					 unsigned int bytes_done)
{
	return;
}

790
static inline void bio_integrity_trim(struct bio *bio)
791 792 793 794 795 796 797 798
{
	return;
}

static inline void bio_integrity_init(void)
{
	return;
}
799

800 801 802 803 804
static inline bool bio_integrity_flagged(struct bio *bio, enum bip_flags flag)
{
	return false;
}

805 806 807 808 809 810 811 812 813 814 815 816
static inline void *bio_integrity_alloc(struct bio * bio, gfp_t gfp,
								unsigned int nr)
{
	return ERR_PTR(-EINVAL);
}

static inline int bio_integrity_add_page(struct bio *bio, struct page *page,
					unsigned int len, unsigned int offset)
{
	return 0;
}

817 818
#endif /* CONFIG_BLK_DEV_INTEGRITY */

J
Jens Axboe 已提交
819 820 821 822 823 824 825 826 827 828 829 830 831 832
/*
 * Mark a bio as polled. Note that for async polled IO, the caller must
 * expect -EWOULDBLOCK if we cannot allocate a request (or other resources).
 * We cannot block waiting for requests on polled IO, as those completions
 * must be found by the caller. This is different than IRQ driven IO, where
 * it's safe to wait for IO to complete.
 */
static inline void bio_set_polled(struct bio *bio, struct kiocb *kiocb)
{
	bio->bi_opf |= REQ_HIPRI;
	if (!is_sync_kiocb(kiocb))
		bio->bi_opf |= REQ_NOWAIT;
}

833
#endif /* CONFIG_BLOCK */
L
Linus Torvalds 已提交
834
#endif /* __LINUX_BIO_H */