blob: 683ff5fd8871ae271d66747a792462fc1f9f19fa [file] [log] [blame]
Christoph Hellwig8c165672019-04-30 14:42:39 -04001/* SPDX-License-Identifier: GPL-2.0 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07003 * Copyright (C) 2001 Jens Axboe <axboe@suse.de>
Linus Torvalds1da177e2005-04-16 15:20:36 -07004 */
5#ifndef __LINUX_BIO_H
6#define __LINUX_BIO_H
7
8#include <linux/highmem.h>
9#include <linux/mempool.h>
Jens Axboe22e2c502005-06-27 10:55:12 +020010#include <linux/ioprio.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070011
David Howells02a5e0a2007-08-11 22:34:32 +020012#ifdef CONFIG_BLOCK
Tejun Heo7cc01582010-08-03 13:14:58 +020013/* struct bio, bio_vec and BIO_* flags are defined in blk_types.h */
14#include <linux/blk_types.h>
15
Linus Torvalds1da177e2005-04-16 15:20:36 -070016#define BIO_DEBUG
17
18#ifdef BIO_DEBUG
19#define BIO_BUG_ON BUG_ON
20#else
21#define BIO_BUG_ON
22#endif
23
Alexey Dobriyand84a8472006-06-25 05:49:32 -070024#define BIO_MAX_PAGES 256
Linus Torvalds1da177e2005-04-16 15:20:36 -070025
Mike Christie43b62ce2016-06-05 14:32:20 -050026#define bio_prio(bio) (bio)->bi_ioprio
27#define bio_set_prio(bio, prio) ((bio)->bi_ioprio = prio)
Jens Axboe22e2c502005-06-27 10:55:12 +020028
Kent Overstreet4550dd62013-08-07 14:26:21 -070029#define bio_iter_iovec(bio, iter) \
30 bvec_iter_bvec((bio)->bi_io_vec, (iter))
31
32#define bio_iter_page(bio, iter) \
33 bvec_iter_page((bio)->bi_io_vec, (iter))
34#define bio_iter_len(bio, iter) \
35 bvec_iter_len((bio)->bi_io_vec, (iter))
36#define bio_iter_offset(bio, iter) \
37 bvec_iter_offset((bio)->bi_io_vec, (iter))
38
39#define bio_page(bio) bio_iter_page((bio), (bio)->bi_iter)
40#define bio_offset(bio) bio_iter_offset((bio), (bio)->bi_iter)
41#define bio_iovec(bio) bio_iter_iovec((bio), (bio)->bi_iter)
Kent Overstreet79886132013-11-23 17:19:00 -080042
Kent Overstreet458b76e2013-09-24 16:26:05 -070043#define bio_multiple_segments(bio) \
44 ((bio)->bi_iter.bi_size != bio_iovec(bio).bv_len)
Kent Overstreet38a72da2018-05-08 21:33:53 -040045
46#define bvec_iter_sectors(iter) ((iter).bi_size >> 9)
47#define bvec_iter_end_sector(iter) ((iter).bi_sector + bvec_iter_sectors((iter)))
48
49#define bio_sectors(bio) bvec_iter_sectors((bio)->bi_iter)
50#define bio_end_sector(bio) bvec_iter_end_sector((bio)->bi_iter)
Jens Axboebf2de6f2007-09-27 13:01:25 +020051
Kent Overstreet458b76e2013-09-24 16:26:05 -070052/*
Christoph Hellwigd3849952016-11-01 07:40:11 -060053 * Return the data direction, READ or WRITE.
54 */
55#define bio_data_dir(bio) \
56 (op_is_write(bio_op(bio)) ? WRITE : READ)
57
58/*
Kent Overstreet458b76e2013-09-24 16:26:05 -070059 * Check whether this bio carries any data or not. A NULL bio is allowed.
60 */
61static inline bool bio_has_data(struct bio *bio)
62{
63 if (bio &&
64 bio->bi_iter.bi_size &&
Adrian Hunter7afafc82016-08-16 10:59:35 +030065 bio_op(bio) != REQ_OP_DISCARD &&
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -080066 bio_op(bio) != REQ_OP_SECURE_ERASE &&
67 bio_op(bio) != REQ_OP_WRITE_ZEROES)
Kent Overstreet458b76e2013-09-24 16:26:05 -070068 return true;
69
70 return false;
71}
72
Bart Van Asschec1527c02020-05-18 21:07:35 -070073static inline bool bio_no_advance_iter(const struct bio *bio)
Mike Christie95fe6c12016-06-05 14:31:48 -050074{
Adrian Hunter7afafc82016-08-16 10:59:35 +030075 return bio_op(bio) == REQ_OP_DISCARD ||
76 bio_op(bio) == REQ_OP_SECURE_ERASE ||
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -080077 bio_op(bio) == REQ_OP_WRITE_SAME ||
78 bio_op(bio) == REQ_OP_WRITE_ZEROES;
Mike Christie95fe6c12016-06-05 14:31:48 -050079}
80
Kent Overstreet458b76e2013-09-24 16:26:05 -070081static inline bool bio_mergeable(struct bio *bio)
82{
Jens Axboe1eff9d32016-08-05 15:35:16 -060083 if (bio->bi_opf & REQ_NOMERGE_FLAGS)
Kent Overstreet458b76e2013-09-24 16:26:05 -070084 return false;
85
86 return true;
87}
88
Tejun Heo2e46e8b2009-05-07 22:24:41 +090089static inline unsigned int bio_cur_bytes(struct bio *bio)
Jens Axboebf2de6f2007-09-27 13:01:25 +020090{
Kent Overstreet458b76e2013-09-24 16:26:05 -070091 if (bio_has_data(bio))
Kent Overstreeta4ad39b12013-08-07 14:24:32 -070092 return bio_iovec(bio).bv_len;
David Woodhousefb2dce82008-08-05 18:01:53 +010093 else /* dataless requests such as discard */
Kent Overstreet4f024f32013-10-11 15:44:27 -070094 return bio->bi_iter.bi_size;
Jens Axboebf2de6f2007-09-27 13:01:25 +020095}
96
97static inline void *bio_data(struct bio *bio)
98{
Kent Overstreet458b76e2013-09-24 16:26:05 -070099 if (bio_has_data(bio))
Jens Axboebf2de6f2007-09-27 13:01:25 +0200100 return page_address(bio_page(bio)) + bio_offset(bio);
101
102 return NULL;
103}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104
Ming Lei79d08f82019-07-01 15:14:46 +0800105/**
106 * bio_full - check if the bio is full
107 * @bio: bio to check
108 * @len: length of one segment to be added
109 *
110 * Return true if @bio is full and one segment with @len bytes can't be
111 * added to the bio, otherwise return false
112 */
113static inline bool bio_full(struct bio *bio, unsigned len)
Christoph Hellwig0aa69fd2018-06-01 09:03:05 -0700114{
Ming Lei79d08f82019-07-01 15:14:46 +0800115 if (bio->bi_vcnt >= bio->bi_max_vecs)
116 return true;
117
118 if (bio->bi_iter.bi_size > UINT_MAX - len)
119 return true;
120
121 return false;
Christoph Hellwig0aa69fd2018-06-01 09:03:05 -0700122}
123
Ming Lei1200e07f2019-04-08 19:02:38 +0800124static inline bool bio_next_segment(const struct bio *bio,
125 struct bvec_iter_all *iter)
126{
127 if (iter->idx >= bio->bi_vcnt)
128 return false;
129
130 bvec_advance(&bio->bi_io_vec[iter->idx], iter);
131 return true;
132}
Ming Lei6dc4f102019-02-15 19:13:19 +0800133
Linus Torvalds1da177e2005-04-16 15:20:36 -0700134/*
Kent Overstreetd74c6d52013-02-06 12:23:11 -0800135 * drivers should _never_ use the all version - the bio may have been split
136 * before it got to the driver and the driver won't own all of it
137 */
Christoph Hellwig2b070cf2019-04-25 09:03:00 +0200138#define bio_for_each_segment_all(bvl, bio, iter) \
139 for (bvl = bvec_init_iter_all(&iter); bio_next_segment((bio), &iter); )
Kent Overstreetd74c6d52013-02-06 12:23:11 -0800140
Bart Van Asschec1527c02020-05-18 21:07:35 -0700141static inline void bio_advance_iter(const struct bio *bio,
142 struct bvec_iter *iter, unsigned int bytes)
Kent Overstreet4550dd62013-08-07 14:26:21 -0700143{
144 iter->bi_sector += bytes >> 9;
145
Ming Lei7759eb22018-09-05 15:45:54 -0600146 if (bio_no_advance_iter(bio))
Kent Overstreet4550dd62013-08-07 14:26:21 -0700147 iter->bi_size -= bytes;
Ming Lei7759eb22018-09-05 15:45:54 -0600148 else
Kent Overstreet4550dd62013-08-07 14:26:21 -0700149 bvec_iter_advance(bio->bi_io_vec, iter, bytes);
Dmitry Monakhovb1fb2c52017-06-29 11:31:13 -0700150 /* TODO: It is reasonable to complete bio with error here. */
Dmitry Monakhovf9df1cd2017-06-29 11:31:14 -0700151}
152
Kent Overstreet79886132013-11-23 17:19:00 -0800153#define __bio_for_each_segment(bvl, bio, iter, start) \
154 for (iter = (start); \
Kent Overstreet4550dd62013-08-07 14:26:21 -0700155 (iter).bi_size && \
156 ((bvl = bio_iter_iovec((bio), (iter))), 1); \
157 bio_advance_iter((bio), &(iter), (bvl).bv_len))
Kent Overstreet79886132013-11-23 17:19:00 -0800158
159#define bio_for_each_segment(bvl, bio, iter) \
160 __bio_for_each_segment(bvl, bio, iter, (bio)->bi_iter)
161
Ming Leid18d9172019-02-15 19:13:11 +0800162#define __bio_for_each_bvec(bvl, bio, iter, start) \
163 for (iter = (start); \
164 (iter).bi_size && \
165 ((bvl = mp_bvec_iter_bvec((bio)->bi_io_vec, (iter))), 1); \
166 bio_advance_iter((bio), &(iter), (bvl).bv_len))
167
168/* iterate over multi-page bvec */
169#define bio_for_each_bvec(bvl, bio, iter) \
170 __bio_for_each_bvec(bvl, bio, iter, (bio)->bi_iter)
171
Kent Overstreet4550dd62013-08-07 14:26:21 -0700172#define bio_iter_last(bvec, iter) ((iter).bi_size == (bvec).bv_len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173
Shaohua Lif4595872017-03-24 10:34:43 -0700174static inline unsigned bio_segments(struct bio *bio)
Kent Overstreet458b76e2013-09-24 16:26:05 -0700175{
176 unsigned segs = 0;
177 struct bio_vec bv;
178 struct bvec_iter iter;
179
Kent Overstreet8423ae32014-02-10 17:45:50 -0800180 /*
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800181 * We special case discard/write same/write zeroes, because they
182 * interpret bi_size differently:
Kent Overstreet8423ae32014-02-10 17:45:50 -0800183 */
184
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800185 switch (bio_op(bio)) {
186 case REQ_OP_DISCARD:
187 case REQ_OP_SECURE_ERASE:
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800188 case REQ_OP_WRITE_ZEROES:
Christoph Hellwigf9d03f92016-12-08 15:20:32 -0700189 return 0;
190 case REQ_OP_WRITE_SAME:
Kent Overstreet8423ae32014-02-10 17:45:50 -0800191 return 1;
Chaitanya Kulkarnia6f07882016-11-30 12:28:59 -0800192 default:
193 break;
194 }
Kent Overstreet8423ae32014-02-10 17:45:50 -0800195
Shaohua Lif4595872017-03-24 10:34:43 -0700196 bio_for_each_segment(bv, bio, iter)
Kent Overstreet458b76e2013-09-24 16:26:05 -0700197 segs++;
198
199 return segs;
200}
201
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202/*
203 * get a reference to a bio, so it won't disappear. the intended use is
204 * something like:
205 *
206 * bio_get(bio);
207 * submit_bio(rw, bio);
208 * if (bio->bi_flags ...)
209 * do_something
210 * bio_put(bio);
211 *
212 * without the bio_get(), it could potentially complete I/O before submit_bio
213 * returns. and then bio would be freed memory when if (bio->bi_flags ...)
214 * runs
215 */
Jens Axboedac56212015-04-17 16:23:59 -0600216static inline void bio_get(struct bio *bio)
217{
218 bio->bi_flags |= (1 << BIO_REFFED);
219 smp_mb__before_atomic();
220 atomic_inc(&bio->__bi_cnt);
221}
222
223static inline void bio_cnt_set(struct bio *bio, unsigned int count)
224{
225 if (count != 1) {
226 bio->bi_flags |= (1 << BIO_REFFED);
Andrea Parrif381c6a2019-05-20 19:23:56 +0200227 smp_mb();
Jens Axboedac56212015-04-17 16:23:59 -0600228 }
229 atomic_set(&bio->__bi_cnt, count);
230}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231
Jens Axboeb7c44ed2015-07-24 12:37:59 -0600232static inline bool bio_flagged(struct bio *bio, unsigned int bit)
233{
Jens Axboe2c68f6d2015-07-28 13:14:32 -0600234 return (bio->bi_flags & (1U << bit)) != 0;
Jens Axboeb7c44ed2015-07-24 12:37:59 -0600235}
236
237static inline void bio_set_flag(struct bio *bio, unsigned int bit)
238{
Jens Axboe2c68f6d2015-07-28 13:14:32 -0600239 bio->bi_flags |= (1U << bit);
Jens Axboeb7c44ed2015-07-24 12:37:59 -0600240}
241
242static inline void bio_clear_flag(struct bio *bio, unsigned int bit)
243{
Jens Axboe2c68f6d2015-07-28 13:14:32 -0600244 bio->bi_flags &= ~(1U << bit);
Jens Axboeb7c44ed2015-07-24 12:37:59 -0600245}
246
Ming Lei7bcd79a2016-02-26 23:40:50 +0800247static inline void bio_get_first_bvec(struct bio *bio, struct bio_vec *bv)
248{
249 *bv = bio_iovec(bio);
250}
251
252static inline void bio_get_last_bvec(struct bio *bio, struct bio_vec *bv)
253{
254 struct bvec_iter iter = bio->bi_iter;
255 int idx;
256
Ming Lei7bcd79a2016-02-26 23:40:50 +0800257 if (unlikely(!bio_multiple_segments(bio))) {
258 *bv = bio_iovec(bio);
259 return;
260 }
261
262 bio_advance_iter(bio, &iter, iter.bi_size);
263
264 if (!iter.bi_bvec_done)
265 idx = iter.bi_idx - 1;
266 else /* in the middle of bvec */
267 idx = iter.bi_idx;
268
269 *bv = bio->bi_io_vec[idx];
270
271 /*
272 * iter.bi_bvec_done records actual length of the last bvec
273 * if this bio ends in the middle of one io vector
274 */
275 if (iter.bi_bvec_done)
276 bv->bv_len = iter.bi_bvec_done;
277}
278
Ming Lei86292ab2017-12-18 20:22:03 +0800279static inline struct bio_vec *bio_first_bvec_all(struct bio *bio)
280{
281 WARN_ON_ONCE(bio_flagged(bio, BIO_CLONED));
282 return bio->bi_io_vec;
283}
284
285static inline struct page *bio_first_page_all(struct bio *bio)
286{
287 return bio_first_bvec_all(bio)->bv_page;
288}
289
290static inline struct bio_vec *bio_last_bvec_all(struct bio *bio)
291{
292 WARN_ON_ONCE(bio_flagged(bio, BIO_CLONED));
293 return &bio->bi_io_vec[bio->bi_vcnt - 1];
294}
295
Martin K. Petersenc6115292014-09-26 19:20:08 -0400296enum bip_flags {
297 BIP_BLOCK_INTEGRITY = 1 << 0, /* block layer owns integrity data */
298 BIP_MAPPED_INTEGRITY = 1 << 1, /* ref tag has been remapped */
299 BIP_CTRL_NOCHECK = 1 << 2, /* disable HBA integrity checking */
300 BIP_DISK_NOCHECK = 1 << 3, /* disable disk integrity checking */
301 BIP_IP_CHECKSUM = 1 << 4, /* IP checksum */
302};
303
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200304/*
305 * bio integrity payload
306 */
307struct bio_integrity_payload {
308 struct bio *bip_bio; /* parent bio */
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200309
Kent Overstreetd57a5f72013-11-23 17:20:16 -0800310 struct bvec_iter bip_iter;
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200311
Martin K. Petersen7878cba2009-06-26 15:37:49 +0200312 unsigned short bip_slab; /* slab the bip came from */
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200313 unsigned short bip_vcnt; /* # of integrity bio_vecs */
Gu Zhengcbcd10542014-07-01 10:36:47 -0600314 unsigned short bip_max_vcnt; /* integrity bio_vec slots */
Martin K. Petersenb1f0138852014-09-26 19:20:04 -0400315 unsigned short bip_flags; /* control flags */
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200316
Ming Lei7759eb22018-09-05 15:45:54 -0600317 struct bvec_iter bio_iter; /* for rewinding parent bio */
318
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200319 struct work_struct bip_work; /* I/O completion */
Kent Overstreet6fda9812012-10-12 13:18:27 -0700320
321 struct bio_vec *bip_vec;
Gustavo A. R. Silva0a368bf2020-03-23 16:40:21 -0500322 struct bio_vec bip_inline_vecs[];/* embedded bvec array */
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200323};
Martin K. Petersen18593082014-09-26 19:20:01 -0400324
Keith Busch06c1e392015-12-03 09:32:21 -0700325#if defined(CONFIG_BLK_DEV_INTEGRITY)
326
327static inline struct bio_integrity_payload *bio_integrity(struct bio *bio)
328{
Jens Axboe1eff9d32016-08-05 15:35:16 -0600329 if (bio->bi_opf & REQ_INTEGRITY)
Keith Busch06c1e392015-12-03 09:32:21 -0700330 return bio->bi_integrity;
331
332 return NULL;
333}
334
Martin K. Petersenc6115292014-09-26 19:20:08 -0400335static inline bool bio_integrity_flagged(struct bio *bio, enum bip_flags flag)
336{
337 struct bio_integrity_payload *bip = bio_integrity(bio);
338
339 if (bip)
340 return bip->bip_flags & flag;
341
342 return false;
343}
Martin K. Petersenb1f0138852014-09-26 19:20:04 -0400344
Martin K. Petersen18593082014-09-26 19:20:01 -0400345static inline sector_t bip_get_seed(struct bio_integrity_payload *bip)
346{
347 return bip->bip_iter.bi_sector;
348}
349
350static inline void bip_set_seed(struct bio_integrity_payload *bip,
351 sector_t seed)
352{
353 bip->bip_iter.bi_sector = seed;
354}
355
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200356#endif /* CONFIG_BLK_DEV_INTEGRITY */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700357
Kent Overstreet6678d832013-08-07 11:14:32 -0700358extern void bio_trim(struct bio *bio, int offset, int size);
Kent Overstreet20d01892013-11-23 18:21:01 -0800359extern struct bio *bio_split(struct bio *bio, int sectors,
360 gfp_t gfp, struct bio_set *bs);
361
362/**
363 * bio_next_split - get next @sectors from a bio, splitting if necessary
364 * @bio: bio to split
365 * @sectors: number of sectors to split from the front of @bio
366 * @gfp: gfp mask
367 * @bs: bio set to allocate from
368 *
369 * Returns a bio representing the next @sectors of @bio - if the bio is smaller
370 * than @sectors, returns the original bio unchanged.
371 */
372static inline struct bio *bio_next_split(struct bio *bio, int sectors,
373 gfp_t gfp, struct bio_set *bs)
374{
375 if (sectors >= bio_sectors(bio))
376 return bio;
377
378 return bio_split(bio, sectors, gfp, bs);
379}
380
NeilBrown011067b2017-06-18 14:38:57 +1000381enum {
382 BIOSET_NEED_BVECS = BIT(0),
NeilBrown47e0fb42017-06-18 14:38:57 +1000383 BIOSET_NEED_RESCUER = BIT(1),
NeilBrown011067b2017-06-18 14:38:57 +1000384};
Kent Overstreetdad08522018-05-20 18:25:58 -0400385extern int bioset_init(struct bio_set *, unsigned int, unsigned int, int flags);
386extern void bioset_exit(struct bio_set *);
Kent Overstreet8aa6ba22018-05-08 21:33:50 -0400387extern int biovec_init_pool(mempool_t *pool, int pool_entries);
Jens Axboe28e89fd92018-06-07 14:42:05 -0600388extern int bioset_init_from_src(struct bio_set *bs, struct bio_set *src);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700389
Dan Carpenter7a88fa12017-03-23 13:24:55 +0300390extern struct bio *bio_alloc_bioset(gfp_t, unsigned int, struct bio_set *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700391extern void bio_put(struct bio *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700392
Kent Overstreet59d276f2013-11-23 18:19:27 -0800393extern void __bio_clone_fast(struct bio *, struct bio *);
394extern struct bio *bio_clone_fast(struct bio *, gfp_t, struct bio_set *);
Kent Overstreetbf800ef2012-09-06 15:35:02 -0700395
Kent Overstreetf4f81542018-05-08 21:33:52 -0400396extern struct bio_set fs_bio_set;
Kent Overstreet3f86a822012-09-06 15:35:01 -0700397
398static inline struct bio *bio_alloc(gfp_t gfp_mask, unsigned int nr_iovecs)
399{
Kent Overstreetf4f81542018-05-08 21:33:52 -0400400 return bio_alloc_bioset(gfp_mask, nr_iovecs, &fs_bio_set);
Kent Overstreet3f86a822012-09-06 15:35:01 -0700401}
402
403static inline struct bio *bio_kmalloc(gfp_t gfp_mask, unsigned int nr_iovecs)
404{
405 return bio_alloc_bioset(gfp_mask, nr_iovecs, NULL);
406}
407
Christoph Hellwig1e3914d2016-11-01 07:40:12 -0600408extern blk_qc_t submit_bio(struct bio *);
409
Christoph Hellwig4246a0b2015-07-20 15:29:37 +0200410extern void bio_endio(struct bio *);
411
412static inline void bio_io_error(struct bio *bio)
413{
Christoph Hellwig4e4cbee2017-06-03 09:38:06 +0200414 bio->bi_status = BLK_STS_IOERR;
Christoph Hellwig4246a0b2015-07-20 15:29:37 +0200415 bio_endio(bio);
416}
417
Goldwyn Rodrigues03a07c92017-06-20 07:05:46 -0500418static inline void bio_wouldblock_error(struct bio *bio)
419{
Jens Axboeabb30462020-06-01 10:02:01 -0600420 bio_set_flag(bio, BIO_QUIET);
Goldwyn Rodrigues03a07c92017-06-20 07:05:46 -0500421 bio->bi_status = BLK_STS_AGAIN;
Kent Overstreetbf800ef2012-09-06 15:35:02 -0700422 bio_endio(bio);
423}
NeilBrown6712ecf2007-09-27 12:47:43 +0200424
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425struct request_queue;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700426
Mike Christie4e49ea42016-06-05 14:31:41 -0500427extern int submit_bio_wait(struct bio *bio);
Kent Overstreet054bdf62012-09-28 13:17:55 -0700428extern void bio_advance(struct bio *, unsigned);
429
Ming Lei3a83f462016-11-22 08:57:21 -0700430extern void bio_init(struct bio *bio, struct bio_vec *table,
431 unsigned short max_vecs);
Jens Axboe9ae3b3f52017-06-28 15:30:13 -0600432extern void bio_uninit(struct bio *);
Kent Overstreetf44b48c2012-09-06 15:34:58 -0700433extern void bio_reset(struct bio *);
Kent Overstreet196d38bc2013-11-23 18:34:15 -0800434void bio_chain(struct bio *, struct bio *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700435
436extern int bio_add_page(struct bio *, struct page *, unsigned int,unsigned int);
Mike Christie6e68af62005-11-11 05:30:27 -0600437extern int bio_add_pc_page(struct request_queue *, struct bio *, struct page *,
438 unsigned int, unsigned int);
Christoph Hellwig0aa69fd2018-06-01 09:03:05 -0700439bool __bio_try_merge_page(struct bio *bio, struct page *page,
Christoph Hellwigff896732019-06-17 11:14:11 +0200440 unsigned int len, unsigned int off, bool *same_page);
Christoph Hellwig0aa69fd2018-06-01 09:03:05 -0700441void __bio_add_page(struct bio *bio, struct page *page,
442 unsigned int len, unsigned int off);
Kent Overstreet2cefe4d2016-10-31 11:59:24 -0600443int bio_iov_iter_get_pages(struct bio *bio, struct iov_iter *iter);
Christoph Hellwigd241a952019-06-26 15:49:21 +0200444void bio_release_pages(struct bio *bio, bool mark_dirty);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700445extern void bio_set_pages_dirty(struct bio *bio);
446extern void bio_check_pages_dirty(struct bio *bio);
Ilya Loginov2d4dc892009-11-26 09:16:19 +0100447
Kent Overstreet45db54d2018-05-08 21:33:54 -0400448extern void bio_copy_data_iter(struct bio *dst, struct bvec_iter *dst_iter,
449 struct bio *src, struct bvec_iter *src_iter);
Kent Overstreet16ac3d62012-09-10 13:57:51 -0700450extern void bio_copy_data(struct bio *dst, struct bio *src);
Kent Overstreet45db54d2018-05-08 21:33:54 -0400451extern void bio_list_copy_data(struct bio *dst, struct bio *src);
Guoqing Jiang491221f2016-09-22 03:10:01 -0400452extern void bio_free_pages(struct bio *bio);
Kent Overstreet38a72da2018-05-08 21:33:53 -0400453void zero_fill_bio_iter(struct bio *bio, struct bvec_iter iter);
Ming Lei85a8ce62019-12-28 07:05:48 +0800454void bio_truncate(struct bio *bio, unsigned new_size);
Christoph Hellwig29125ed2020-03-25 16:48:40 +0100455void guard_bio_eod(struct bio *bio);
Kent Overstreet38a72da2018-05-08 21:33:53 -0400456
457static inline void zero_fill_bio(struct bio *bio)
458{
459 zero_fill_bio_iter(bio, bio->bi_iter);
460}
461
Kent Overstreet9f060e22012-10-12 15:29:33 -0700462extern struct bio_vec *bvec_alloc(gfp_t, int, unsigned long *, mempool_t *);
463extern void bvec_free(mempool_t *, struct bio_vec *, unsigned int);
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200464extern unsigned int bvec_nr_vecs(unsigned short idx);
Jiufei Xue9c0fb1e2018-02-27 20:10:18 +0800465extern const char *bio_devname(struct bio *bio, char *buffer);
Martin K. Petersen51d654e2008-06-17 18:59:56 +0200466
Christoph Hellwig74d46992017-08-23 19:10:32 +0200467#define bio_set_dev(bio, bdev) \
468do { \
Shaohua Li111be882017-12-20 11:10:17 -0700469 if ((bio)->bi_disk != (bdev)->bd_disk) \
470 bio_clear_flag(bio, BIO_THROTTLED);\
Christoph Hellwig74d46992017-08-23 19:10:32 +0200471 (bio)->bi_disk = (bdev)->bd_disk; \
472 (bio)->bi_partno = (bdev)->bd_partno; \
Dennis Zhou5cdf2e32018-12-05 12:10:31 -0500473 bio_associate_blkg(bio); \
Christoph Hellwig74d46992017-08-23 19:10:32 +0200474} while (0)
475
476#define bio_copy_dev(dst, src) \
477do { \
478 (dst)->bi_disk = (src)->bi_disk; \
479 (dst)->bi_partno = (src)->bi_partno; \
Dennis Zhoudb6638d2018-12-05 12:10:35 -0500480 bio_clone_blkg_association(dst, src); \
Christoph Hellwig74d46992017-08-23 19:10:32 +0200481} while (0)
482
483#define bio_dev(bio) \
484 disk_devt((bio)->bi_disk)
485
Tejun Heo0d3bd882018-07-03 11:14:54 -0400486#if defined(CONFIG_MEMCG) && defined(CONFIG_BLK_CGROUP)
Dennis Zhou6a7f6d82018-12-05 12:10:33 -0500487void bio_associate_blkg_from_page(struct bio *bio, struct page *page);
Tejun Heo0d3bd882018-07-03 11:14:54 -0400488#else
Dennis Zhou6a7f6d82018-12-05 12:10:33 -0500489static inline void bio_associate_blkg_from_page(struct bio *bio,
490 struct page *page) { }
Tejun Heo0d3bd882018-07-03 11:14:54 -0400491#endif
492
Tejun Heo852c7882012-03-05 13:15:27 -0800493#ifdef CONFIG_BLK_CGROUP
Dennis Zhou2268c0f2018-12-05 12:10:29 -0500494void bio_disassociate_blkg(struct bio *bio);
495void bio_associate_blkg(struct bio *bio);
Dennis Zhoufd42df32018-12-05 12:10:34 -0500496void bio_associate_blkg_from_css(struct bio *bio,
497 struct cgroup_subsys_state *css);
Dennis Zhoudb6638d2018-12-05 12:10:35 -0500498void bio_clone_blkg_association(struct bio *dst, struct bio *src);
Tejun Heo852c7882012-03-05 13:15:27 -0800499#else /* CONFIG_BLK_CGROUP */
Dennis Zhou2268c0f2018-12-05 12:10:29 -0500500static inline void bio_disassociate_blkg(struct bio *bio) { }
501static inline void bio_associate_blkg(struct bio *bio) { }
Dennis Zhoufd42df32018-12-05 12:10:34 -0500502static inline void bio_associate_blkg_from_css(struct bio *bio,
503 struct cgroup_subsys_state *css)
504{ }
Dennis Zhoudb6638d2018-12-05 12:10:35 -0500505static inline void bio_clone_blkg_association(struct bio *dst,
506 struct bio *src) { }
Tejun Heo852c7882012-03-05 13:15:27 -0800507#endif /* CONFIG_BLK_CGROUP */
508
Linus Torvalds1da177e2005-04-16 15:20:36 -0700509#ifdef CONFIG_HIGHMEM
510/*
Alberto Bertogli20b636b2009-02-02 12:41:07 +0100511 * remember never ever reenable interrupts between a bvec_kmap_irq and
512 * bvec_kunmap_irq!
Linus Torvalds1da177e2005-04-16 15:20:36 -0700513 */
Alberto Bertogli4f570f92009-11-02 11:40:16 +0100514static inline char *bvec_kmap_irq(struct bio_vec *bvec, unsigned long *flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700515{
516 unsigned long addr;
517
518 /*
519 * might not be a highmem page, but the preempt/irq count
520 * balancing is a lot nicer this way
521 */
522 local_irq_save(*flags);
Cong Wange8e3c3d2011-11-25 23:14:27 +0800523 addr = (unsigned long) kmap_atomic(bvec->bv_page);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700524
525 BUG_ON(addr & ~PAGE_MASK);
526
527 return (char *) addr + bvec->bv_offset;
528}
529
Alberto Bertogli4f570f92009-11-02 11:40:16 +0100530static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700531{
532 unsigned long ptr = (unsigned long) buffer & PAGE_MASK;
533
Cong Wange8e3c3d2011-11-25 23:14:27 +0800534 kunmap_atomic((void *) ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700535 local_irq_restore(*flags);
536}
537
538#else
Geert Uytterhoeven11a691b2010-10-21 10:32:29 +0200539static inline char *bvec_kmap_irq(struct bio_vec *bvec, unsigned long *flags)
540{
541 return page_address(bvec->bv_page) + bvec->bv_offset;
542}
543
544static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags)
545{
546 *flags = 0;
547}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700548#endif
549
Jens Axboe7a67f632008-08-08 11:17:12 +0200550/*
Akinobu Mitae6863072009-04-17 08:41:21 +0200551 * BIO list management for use by remapping drivers (e.g. DM or MD) and loop.
Christoph Hellwig8f3d8ba2009-04-07 19:55:13 +0200552 *
553 * A bio_list anchors a singly-linked list of bios chained through the bi_next
554 * member of the bio. The bio_list also caches the last list member to allow
555 * fast access to the tail.
556 */
557struct bio_list {
558 struct bio *head;
559 struct bio *tail;
560};
561
562static inline int bio_list_empty(const struct bio_list *bl)
563{
564 return bl->head == NULL;
565}
566
567static inline void bio_list_init(struct bio_list *bl)
568{
569 bl->head = bl->tail = NULL;
570}
571
Jens Axboe320ae512013-10-24 09:20:05 +0100572#define BIO_EMPTY_LIST { NULL, NULL }
573
Christoph Hellwig8f3d8ba2009-04-07 19:55:13 +0200574#define bio_list_for_each(bio, bl) \
575 for (bio = (bl)->head; bio; bio = bio->bi_next)
576
577static inline unsigned bio_list_size(const struct bio_list *bl)
578{
579 unsigned sz = 0;
580 struct bio *bio;
581
582 bio_list_for_each(bio, bl)
583 sz++;
584
585 return sz;
586}
587
588static inline void bio_list_add(struct bio_list *bl, struct bio *bio)
589{
590 bio->bi_next = NULL;
591
592 if (bl->tail)
593 bl->tail->bi_next = bio;
594 else
595 bl->head = bio;
596
597 bl->tail = bio;
598}
599
600static inline void bio_list_add_head(struct bio_list *bl, struct bio *bio)
601{
602 bio->bi_next = bl->head;
603
604 bl->head = bio;
605
606 if (!bl->tail)
607 bl->tail = bio;
608}
609
610static inline void bio_list_merge(struct bio_list *bl, struct bio_list *bl2)
611{
612 if (!bl2->head)
613 return;
614
615 if (bl->tail)
616 bl->tail->bi_next = bl2->head;
617 else
618 bl->head = bl2->head;
619
620 bl->tail = bl2->tail;
621}
622
623static inline void bio_list_merge_head(struct bio_list *bl,
624 struct bio_list *bl2)
625{
626 if (!bl2->head)
627 return;
628
629 if (bl->head)
630 bl2->tail->bi_next = bl->head;
631 else
632 bl->tail = bl2->tail;
633
634 bl->head = bl2->head;
635}
636
Geert Uytterhoeven13685a12009-06-10 04:38:40 +0000637static inline struct bio *bio_list_peek(struct bio_list *bl)
638{
639 return bl->head;
640}
641
Christoph Hellwig8f3d8ba2009-04-07 19:55:13 +0200642static inline struct bio *bio_list_pop(struct bio_list *bl)
643{
644 struct bio *bio = bl->head;
645
646 if (bio) {
647 bl->head = bl->head->bi_next;
648 if (!bl->head)
649 bl->tail = NULL;
650
651 bio->bi_next = NULL;
652 }
653
654 return bio;
655}
656
657static inline struct bio *bio_list_get(struct bio_list *bl)
658{
659 struct bio *bio = bl->head;
660
661 bl->head = bl->tail = NULL;
662
663 return bio;
664}
665
Kent Overstreet57fb2332012-08-24 04:56:11 -0700666/*
Mike Snitzer0ef5a502016-05-05 11:54:22 -0400667 * Increment chain count for the bio. Make sure the CHAIN flag update
668 * is visible before the raised count.
669 */
670static inline void bio_inc_remaining(struct bio *bio)
671{
672 bio_set_flag(bio, BIO_CHAIN);
673 smp_mb__before_atomic();
674 atomic_inc(&bio->__bi_remaining);
675}
676
677/*
Kent Overstreet57fb2332012-08-24 04:56:11 -0700678 * bio_set is used to allow other portions of the IO system to
679 * allocate their own private memory pools for bio and iovec structures.
680 * These memory pools in turn all allocate from the bio_slab
681 * and the bvec_slabs[].
682 */
683#define BIO_POOL_SIZE 2
Kent Overstreet57fb2332012-08-24 04:56:11 -0700684
685struct bio_set {
686 struct kmem_cache *bio_slab;
687 unsigned int front_pad;
688
Kent Overstreet8aa6ba22018-05-08 21:33:50 -0400689 mempool_t bio_pool;
690 mempool_t bvec_pool;
Kent Overstreet57fb2332012-08-24 04:56:11 -0700691#if defined(CONFIG_BLK_DEV_INTEGRITY)
Kent Overstreet8aa6ba22018-05-08 21:33:50 -0400692 mempool_t bio_integrity_pool;
693 mempool_t bvec_integrity_pool;
Kent Overstreet57fb2332012-08-24 04:56:11 -0700694#endif
Kent Overstreetdf2cb6d2012-09-10 14:33:46 -0700695
696 /*
697 * Deadlock avoidance for stacking block drivers: see comments in
698 * bio_alloc_bioset() for details
699 */
700 spinlock_t rescue_lock;
701 struct bio_list rescue_list;
702 struct work_struct rescue_work;
703 struct workqueue_struct *rescue_workqueue;
Kent Overstreet57fb2332012-08-24 04:56:11 -0700704};
705
706struct biovec_slab {
707 int nr_vecs;
708 char *name;
709 struct kmem_cache *slab;
710};
711
Kent Overstreet338aa962018-05-20 18:25:47 -0400712static inline bool bioset_initialized(struct bio_set *bs)
713{
714 return bs->bio_slab != NULL;
715}
716
Kent Overstreet57fb2332012-08-24 04:56:11 -0700717/*
718 * a small number of entries is fine, not going to be performance critical.
719 * basically we just need to survive
720 */
721#define BIO_SPLIT_ENTRIES 2
722
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200723#if defined(CONFIG_BLK_DEV_INTEGRITY)
724
Kent Overstreetd57a5f72013-11-23 17:20:16 -0800725#define bip_for_each_vec(bvl, bip, iter) \
726 for_each_bvec(bvl, (bip)->bip_vec, iter, (bip)->bip_iter)
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200727
Martin K. Petersen13f05c82010-09-10 20:50:10 +0200728#define bio_for_each_integrity_vec(_bvl, _bio, _iter) \
729 for_each_bio(_bio) \
730 bip_for_each_vec(_bvl, _bio->bi_integrity, _iter)
731
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200732extern struct bio_integrity_payload *bio_integrity_alloc(struct bio *, gfp_t, unsigned int);
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200733extern int bio_integrity_add_page(struct bio *, struct page *, unsigned int, unsigned int);
Dmitry Monakhove23947b2017-06-29 11:31:11 -0700734extern bool bio_integrity_prep(struct bio *);
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200735extern void bio_integrity_advance(struct bio *, unsigned int);
Dmitry Monakhovfbd08e72017-06-29 11:31:10 -0700736extern void bio_integrity_trim(struct bio *);
Kent Overstreet1e2a410f2012-09-06 15:34:56 -0700737extern int bio_integrity_clone(struct bio *, struct bio *, gfp_t);
Martin K. Petersen7878cba2009-06-26 15:37:49 +0200738extern int bioset_integrity_create(struct bio_set *, int);
739extern void bioset_integrity_free(struct bio_set *);
740extern void bio_integrity_init(void);
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200741
742#else /* CONFIG_BLK_DEV_INTEGRITY */
743
Martin K. Petersenc6115292014-09-26 19:20:08 -0400744static inline void *bio_integrity(struct bio *bio)
Martin K. Petersen6898e3b2012-01-13 08:15:33 +0100745{
Martin K. Petersenc6115292014-09-26 19:20:08 -0400746 return NULL;
Martin K. Petersen6898e3b2012-01-13 08:15:33 +0100747}
748
Martin K. Petersen6898e3b2012-01-13 08:15:33 +0100749static inline int bioset_integrity_create(struct bio_set *bs, int pool_size)
750{
751 return 0;
752}
753
754static inline void bioset_integrity_free (struct bio_set *bs)
755{
756 return;
757}
758
Dmitry Monakhove23947b2017-06-29 11:31:11 -0700759static inline bool bio_integrity_prep(struct bio *bio)
Martin K. Petersen6898e3b2012-01-13 08:15:33 +0100760{
Dmitry Monakhove23947b2017-06-29 11:31:11 -0700761 return true;
Martin K. Petersen6898e3b2012-01-13 08:15:33 +0100762}
763
Stephen Rothwell0c614e22011-11-16 09:21:48 +0100764static inline int bio_integrity_clone(struct bio *bio, struct bio *bio_src,
Kent Overstreet1e2a410f2012-09-06 15:34:56 -0700765 gfp_t gfp_mask)
Stephen Rothwell0c614e22011-11-16 09:21:48 +0100766{
767 return 0;
768}
Martin K. Petersen6898e3b2012-01-13 08:15:33 +0100769
Martin K. Petersen6898e3b2012-01-13 08:15:33 +0100770static inline void bio_integrity_advance(struct bio *bio,
771 unsigned int bytes_done)
772{
773 return;
774}
775
Dmitry Monakhovfbd08e72017-06-29 11:31:10 -0700776static inline void bio_integrity_trim(struct bio *bio)
Martin K. Petersen6898e3b2012-01-13 08:15:33 +0100777{
778 return;
779}
780
781static inline void bio_integrity_init(void)
782{
783 return;
784}
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200785
Martin K. Petersenc6115292014-09-26 19:20:08 -0400786static inline bool bio_integrity_flagged(struct bio *bio, enum bip_flags flag)
787{
788 return false;
789}
790
Keith Busch06c1e392015-12-03 09:32:21 -0700791static inline void *bio_integrity_alloc(struct bio * bio, gfp_t gfp,
792 unsigned int nr)
793{
794 return ERR_PTR(-EINVAL);
795}
796
797static inline int bio_integrity_add_page(struct bio *bio, struct page *page,
798 unsigned int len, unsigned int offset)
799{
800 return 0;
801}
802
Martin K. Petersen7ba1ba12008-06-30 20:04:41 +0200803#endif /* CONFIG_BLK_DEV_INTEGRITY */
804
Jens Axboe0bbb2802018-12-21 09:10:46 -0700805/*
806 * Mark a bio as polled. Note that for async polled IO, the caller must
807 * expect -EWOULDBLOCK if we cannot allocate a request (or other resources).
808 * We cannot block waiting for requests on polled IO, as those completions
809 * must be found by the caller. This is different than IRQ driven IO, where
810 * it's safe to wait for IO to complete.
811 */
812static inline void bio_set_polled(struct bio *bio, struct kiocb *kiocb)
813{
814 bio->bi_opf |= REQ_HIPRI;
815 if (!is_sync_kiocb(kiocb))
816 bio->bi_opf |= REQ_NOWAIT;
817}
818
David Howells02a5e0a2007-08-11 22:34:32 +0200819#endif /* CONFIG_BLOCK */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700820#endif /* __LINUX_BIO_H */