Commit | Line | Data |
---|---|---|
8c16567d | 1 | /* SPDX-License-Identifier: GPL-2.0 */ |
1da177e4 | 2 | /* |
1da177e4 | 3 | * Copyright (C) 2001 Jens Axboe <axboe@suse.de> |
1da177e4 LT |
4 | */ |
5 | #ifndef __LINUX_BIO_H | |
6 | #define __LINUX_BIO_H | |
7 | ||
1da177e4 | 8 | #include <linux/mempool.h> |
7cc01581 TH |
9 | /* struct bio, bio_vec and BIO_* flags are defined in blk_types.h */ |
10 | #include <linux/blk_types.h> | |
3e1a88ec | 11 | #include <linux/uio.h> |
7cc01581 | 12 | |
a8affc03 | 13 | #define BIO_MAX_VECS 256U |
5f7136db MWO |
14 | |
15 | static inline unsigned int bio_max_segs(unsigned int nr_segs) | |
16 | { | |
a8affc03 | 17 | return min(nr_segs, BIO_MAX_VECS); |
5f7136db | 18 | } |
1da177e4 | 19 | |
43b62ce3 MC |
20 | #define bio_prio(bio) (bio)->bi_ioprio |
21 | #define bio_set_prio(bio, prio) ((bio)->bi_ioprio = prio) | |
22e2c507 | 22 | |
4550dd6c KO |
23 | #define bio_iter_iovec(bio, iter) \ |
24 | bvec_iter_bvec((bio)->bi_io_vec, (iter)) | |
25 | ||
26 | #define bio_iter_page(bio, iter) \ | |
27 | bvec_iter_page((bio)->bi_io_vec, (iter)) | |
28 | #define bio_iter_len(bio, iter) \ | |
29 | bvec_iter_len((bio)->bi_io_vec, (iter)) | |
30 | #define bio_iter_offset(bio, iter) \ | |
31 | bvec_iter_offset((bio)->bi_io_vec, (iter)) | |
32 | ||
33 | #define bio_page(bio) bio_iter_page((bio), (bio)->bi_iter) | |
34 | #define bio_offset(bio) bio_iter_offset((bio), (bio)->bi_iter) | |
35 | #define bio_iovec(bio) bio_iter_iovec((bio), (bio)->bi_iter) | |
7988613b | 36 | |
38a72dac KO |
37 | #define bvec_iter_sectors(iter) ((iter).bi_size >> 9) |
38 | #define bvec_iter_end_sector(iter) ((iter).bi_sector + bvec_iter_sectors((iter))) | |
39 | ||
40 | #define bio_sectors(bio) bvec_iter_sectors((bio)->bi_iter) | |
41 | #define bio_end_sector(bio) bvec_iter_end_sector((bio)->bi_iter) | |
bf2de6f5 | 42 | |
d3849953 CH |
43 | /* |
44 | * Return the data direction, READ or WRITE. | |
45 | */ | |
46 | #define bio_data_dir(bio) \ | |
47 | (op_is_write(bio_op(bio)) ? WRITE : READ) | |
48 | ||
458b76ed KO |
49 | /* |
50 | * Check whether this bio carries any data or not. A NULL bio is allowed. | |
51 | */ | |
52 | static inline bool bio_has_data(struct bio *bio) | |
53 | { | |
54 | if (bio && | |
55 | bio->bi_iter.bi_size && | |
7afafc8a | 56 | bio_op(bio) != REQ_OP_DISCARD && |
a6f0788e CK |
57 | bio_op(bio) != REQ_OP_SECURE_ERASE && |
58 | bio_op(bio) != REQ_OP_WRITE_ZEROES) | |
458b76ed KO |
59 | return true; |
60 | ||
61 | return false; | |
62 | } | |
63 | ||
c1527c0e | 64 | static inline bool bio_no_advance_iter(const struct bio *bio) |
95fe6c1a | 65 | { |
7afafc8a AH |
66 | return bio_op(bio) == REQ_OP_DISCARD || |
67 | bio_op(bio) == REQ_OP_SECURE_ERASE || | |
a6f0788e | 68 | bio_op(bio) == REQ_OP_WRITE_ZEROES; |
95fe6c1a MC |
69 | } |
70 | ||
bf2de6f5 JA |
71 | static inline void *bio_data(struct bio *bio) |
72 | { | |
458b76ed | 73 | if (bio_has_data(bio)) |
bf2de6f5 JA |
74 | return page_address(bio_page(bio)) + bio_offset(bio); |
75 | ||
76 | return NULL; | |
77 | } | |
1da177e4 | 78 | |
1200e07f ML |
79 | static inline bool bio_next_segment(const struct bio *bio, |
80 | struct bvec_iter_all *iter) | |
81 | { | |
82 | if (iter->idx >= bio->bi_vcnt) | |
83 | return false; | |
84 | ||
85 | bvec_advance(&bio->bi_io_vec[iter->idx], iter); | |
86 | return true; | |
87 | } | |
6dc4f100 | 88 | |
d74c6d51 KO |
89 | /* |
90 | * drivers should _never_ use the all version - the bio may have been split | |
91 | * before it got to the driver and the driver won't own all of it | |
92 | */ | |
2b070cfe CH |
93 | #define bio_for_each_segment_all(bvl, bio, iter) \ |
94 | for (bvl = bvec_init_iter_all(&iter); bio_next_segment((bio), &iter); ) | |
d74c6d51 | 95 | |
c1527c0e BVA |
96 | static inline void bio_advance_iter(const struct bio *bio, |
97 | struct bvec_iter *iter, unsigned int bytes) | |
4550dd6c KO |
98 | { |
99 | iter->bi_sector += bytes >> 9; | |
100 | ||
7759eb23 | 101 | if (bio_no_advance_iter(bio)) |
4550dd6c | 102 | iter->bi_size -= bytes; |
7759eb23 | 103 | else |
4550dd6c | 104 | bvec_iter_advance(bio->bi_io_vec, iter, bytes); |
b1fb2c52 | 105 | /* TODO: It is reasonable to complete bio with error here. */ |
f9df1cd9 DM |
106 | } |
107 | ||
22b56c29 PB |
108 | /* @bytes should be less or equal to bvec[i->bi_idx].bv_len */ |
109 | static inline void bio_advance_iter_single(const struct bio *bio, | |
110 | struct bvec_iter *iter, | |
111 | unsigned int bytes) | |
112 | { | |
113 | iter->bi_sector += bytes >> 9; | |
114 | ||
115 | if (bio_no_advance_iter(bio)) | |
116 | iter->bi_size -= bytes; | |
117 | else | |
118 | bvec_iter_advance_single(bio->bi_io_vec, iter, bytes); | |
119 | } | |
120 | ||
d4aa57a1 JA |
121 | void __bio_advance(struct bio *, unsigned bytes); |
122 | ||
123 | /** | |
124 | * bio_advance - increment/complete a bio by some number of bytes | |
125 | * @bio: bio to advance | |
6fd3c510 | 126 | * @nbytes: number of bytes to complete |
d4aa57a1 JA |
127 | * |
128 | * This updates bi_sector, bi_size and bi_idx; if the number of bytes to | |
129 | * complete doesn't align with a bvec boundary, then bv_len and bv_offset will | |
130 | * be updated on the last bvec as well. | |
131 | * | |
132 | * @bio will then represent the remaining, uncompleted portion of the io. | |
133 | */ | |
134 | static inline void bio_advance(struct bio *bio, unsigned int nbytes) | |
135 | { | |
136 | if (nbytes == bio->bi_iter.bi_size) { | |
137 | bio->bi_iter.bi_size = 0; | |
138 | return; | |
139 | } | |
140 | __bio_advance(bio, nbytes); | |
141 | } | |
142 | ||
7988613b KO |
143 | #define __bio_for_each_segment(bvl, bio, iter, start) \ |
144 | for (iter = (start); \ | |
4550dd6c KO |
145 | (iter).bi_size && \ |
146 | ((bvl = bio_iter_iovec((bio), (iter))), 1); \ | |
22b56c29 | 147 | bio_advance_iter_single((bio), &(iter), (bvl).bv_len)) |
7988613b KO |
148 | |
149 | #define bio_for_each_segment(bvl, bio, iter) \ | |
150 | __bio_for_each_segment(bvl, bio, iter, (bio)->bi_iter) | |
151 | ||
d18d9174 ML |
152 | #define __bio_for_each_bvec(bvl, bio, iter, start) \ |
153 | for (iter = (start); \ | |
154 | (iter).bi_size && \ | |
155 | ((bvl = mp_bvec_iter_bvec((bio)->bi_io_vec, (iter))), 1); \ | |
22b56c29 | 156 | bio_advance_iter_single((bio), &(iter), (bvl).bv_len)) |
d18d9174 ML |
157 | |
158 | /* iterate over multi-page bvec */ | |
159 | #define bio_for_each_bvec(bvl, bio, iter) \ | |
160 | __bio_for_each_bvec(bvl, bio, iter, (bio)->bi_iter) | |
161 | ||
1072c12d OS |
162 | /* |
163 | * Iterate over all multi-page bvecs. Drivers shouldn't use this version for the | |
164 | * same reasons as bio_for_each_segment_all(). | |
165 | */ | |
166 | #define bio_for_each_bvec_all(bvl, bio, i) \ | |
167 | for (i = 0, bvl = bio_first_bvec_all(bio); \ | |
640d1930 | 168 | i < (bio)->bi_vcnt; i++, bvl++) |
1072c12d | 169 | |
4550dd6c | 170 | #define bio_iter_last(bvec, iter) ((iter).bi_size == (bvec).bv_len) |
1da177e4 | 171 | |
f4595875 | 172 | static inline unsigned bio_segments(struct bio *bio) |
458b76ed KO |
173 | { |
174 | unsigned segs = 0; | |
175 | struct bio_vec bv; | |
176 | struct bvec_iter iter; | |
177 | ||
8423ae3d | 178 | /* |
a6f0788e CK |
179 | * We special case discard/write same/write zeroes, because they |
180 | * interpret bi_size differently: | |
8423ae3d KO |
181 | */ |
182 | ||
a6f0788e CK |
183 | switch (bio_op(bio)) { |
184 | case REQ_OP_DISCARD: | |
185 | case REQ_OP_SECURE_ERASE: | |
a6f0788e | 186 | case REQ_OP_WRITE_ZEROES: |
f9d03f96 | 187 | return 0; |
a6f0788e CK |
188 | default: |
189 | break; | |
190 | } | |
8423ae3d | 191 | |
f4595875 | 192 | bio_for_each_segment(bv, bio, iter) |
458b76ed KO |
193 | segs++; |
194 | ||
195 | return segs; | |
196 | } | |
197 | ||
1da177e4 LT |
198 | /* |
199 | * get a reference to a bio, so it won't disappear. the intended use is | |
200 | * something like: | |
201 | * | |
202 | * bio_get(bio); | |
203 | * submit_bio(rw, bio); | |
204 | * if (bio->bi_flags ...) | |
205 | * do_something | |
206 | * bio_put(bio); | |
207 | * | |
208 | * without the bio_get(), it could potentially complete I/O before submit_bio | |
209 | * returns. and then bio would be freed memory when if (bio->bi_flags ...) | |
210 | * runs | |
211 | */ | |
dac56212 JA |
212 | static inline void bio_get(struct bio *bio) |
213 | { | |
214 | bio->bi_flags |= (1 << BIO_REFFED); | |
215 | smp_mb__before_atomic(); | |
216 | atomic_inc(&bio->__bi_cnt); | |
217 | } | |
218 | ||
219 | static inline void bio_cnt_set(struct bio *bio, unsigned int count) | |
220 | { | |
221 | if (count != 1) { | |
222 | bio->bi_flags |= (1 << BIO_REFFED); | |
f381c6a4 | 223 | smp_mb(); |
dac56212 JA |
224 | } |
225 | atomic_set(&bio->__bi_cnt, count); | |
226 | } | |
1da177e4 | 227 | |
b7c44ed9 JA |
228 | static inline bool bio_flagged(struct bio *bio, unsigned int bit) |
229 | { | |
2c68f6dc | 230 | return (bio->bi_flags & (1U << bit)) != 0; |
b7c44ed9 JA |
231 | } |
232 | ||
233 | static inline void bio_set_flag(struct bio *bio, unsigned int bit) | |
234 | { | |
2c68f6dc | 235 | bio->bi_flags |= (1U << bit); |
b7c44ed9 JA |
236 | } |
237 | ||
238 | static inline void bio_clear_flag(struct bio *bio, unsigned int bit) | |
239 | { | |
2c68f6dc | 240 | bio->bi_flags &= ~(1U << bit); |
b7c44ed9 JA |
241 | } |
242 | ||
86292abc ML |
243 | static inline struct bio_vec *bio_first_bvec_all(struct bio *bio) |
244 | { | |
245 | WARN_ON_ONCE(bio_flagged(bio, BIO_CLONED)); | |
246 | return bio->bi_io_vec; | |
247 | } | |
248 | ||
249 | static inline struct page *bio_first_page_all(struct bio *bio) | |
250 | { | |
251 | return bio_first_bvec_all(bio)->bv_page; | |
252 | } | |
253 | ||
254 | static inline struct bio_vec *bio_last_bvec_all(struct bio *bio) | |
255 | { | |
256 | WARN_ON_ONCE(bio_flagged(bio, BIO_CLONED)); | |
257 | return &bio->bi_io_vec[bio->bi_vcnt - 1]; | |
258 | } | |
259 | ||
640d1930 MWO |
260 | /** |
261 | * struct folio_iter - State for iterating all folios in a bio. | |
262 | * @folio: The current folio we're iterating. NULL after the last folio. | |
263 | * @offset: The byte offset within the current folio. | |
264 | * @length: The number of bytes in this iteration (will not cross folio | |
265 | * boundary). | |
266 | */ | |
267 | struct folio_iter { | |
268 | struct folio *folio; | |
269 | size_t offset; | |
270 | size_t length; | |
271 | /* private: for use by the iterator */ | |
272 | size_t _seg_count; | |
273 | int _i; | |
274 | }; | |
275 | ||
276 | static inline void bio_first_folio(struct folio_iter *fi, struct bio *bio, | |
277 | int i) | |
278 | { | |
279 | struct bio_vec *bvec = bio_first_bvec_all(bio) + i; | |
280 | ||
281 | fi->folio = page_folio(bvec->bv_page); | |
282 | fi->offset = bvec->bv_offset + | |
283 | PAGE_SIZE * (bvec->bv_page - &fi->folio->page); | |
284 | fi->_seg_count = bvec->bv_len; | |
285 | fi->length = min(folio_size(fi->folio) - fi->offset, fi->_seg_count); | |
286 | fi->_i = i; | |
287 | } | |
288 | ||
289 | static inline void bio_next_folio(struct folio_iter *fi, struct bio *bio) | |
290 | { | |
291 | fi->_seg_count -= fi->length; | |
292 | if (fi->_seg_count) { | |
293 | fi->folio = folio_next(fi->folio); | |
294 | fi->offset = 0; | |
295 | fi->length = min(folio_size(fi->folio), fi->_seg_count); | |
296 | } else if (fi->_i + 1 < bio->bi_vcnt) { | |
297 | bio_first_folio(fi, bio, fi->_i + 1); | |
298 | } else { | |
299 | fi->folio = NULL; | |
300 | } | |
301 | } | |
302 | ||
303 | /** | |
304 | * bio_for_each_folio_all - Iterate over each folio in a bio. | |
305 | * @fi: struct folio_iter which is updated for each folio. | |
306 | * @bio: struct bio to iterate over. | |
307 | */ | |
308 | #define bio_for_each_folio_all(fi, bio) \ | |
309 | for (bio_first_folio(&fi, bio, 0); fi.folio; bio_next_folio(&fi, bio)) | |
310 | ||
c611529e MP |
311 | enum bip_flags { |
312 | BIP_BLOCK_INTEGRITY = 1 << 0, /* block layer owns integrity data */ | |
313 | BIP_MAPPED_INTEGRITY = 1 << 1, /* ref tag has been remapped */ | |
314 | BIP_CTRL_NOCHECK = 1 << 2, /* disable HBA integrity checking */ | |
315 | BIP_DISK_NOCHECK = 1 << 3, /* disable disk integrity checking */ | |
316 | BIP_IP_CHECKSUM = 1 << 4, /* IP checksum */ | |
317 | }; | |
318 | ||
7ba1ba12 MP |
319 | /* |
320 | * bio integrity payload | |
321 | */ | |
322 | struct bio_integrity_payload { | |
323 | struct bio *bip_bio; /* parent bio */ | |
7ba1ba12 | 324 | |
d57a5f7c | 325 | struct bvec_iter bip_iter; |
7ba1ba12 | 326 | |
7ba1ba12 | 327 | unsigned short bip_vcnt; /* # of integrity bio_vecs */ |
cbcd1054 | 328 | unsigned short bip_max_vcnt; /* integrity bio_vec slots */ |
b1f01388 | 329 | unsigned short bip_flags; /* control flags */ |
7ba1ba12 | 330 | |
7759eb23 ML |
331 | struct bvec_iter bio_iter; /* for rewinding parent bio */ |
332 | ||
7ba1ba12 | 333 | struct work_struct bip_work; /* I/O completion */ |
6fda981c KO |
334 | |
335 | struct bio_vec *bip_vec; | |
0a368bf0 | 336 | struct bio_vec bip_inline_vecs[];/* embedded bvec array */ |
7ba1ba12 | 337 | }; |
18593088 | 338 | |
06c1e390 KB |
339 | #if defined(CONFIG_BLK_DEV_INTEGRITY) |
340 | ||
341 | static inline struct bio_integrity_payload *bio_integrity(struct bio *bio) | |
342 | { | |
1eff9d32 | 343 | if (bio->bi_opf & REQ_INTEGRITY) |
06c1e390 KB |
344 | return bio->bi_integrity; |
345 | ||
346 | return NULL; | |
347 | } | |
348 | ||
c611529e MP |
349 | static inline bool bio_integrity_flagged(struct bio *bio, enum bip_flags flag) |
350 | { | |
351 | struct bio_integrity_payload *bip = bio_integrity(bio); | |
352 | ||
353 | if (bip) | |
354 | return bip->bip_flags & flag; | |
355 | ||
356 | return false; | |
357 | } | |
b1f01388 | 358 | |
18593088 MP |
359 | static inline sector_t bip_get_seed(struct bio_integrity_payload *bip) |
360 | { | |
361 | return bip->bip_iter.bi_sector; | |
362 | } | |
363 | ||
364 | static inline void bip_set_seed(struct bio_integrity_payload *bip, | |
365 | sector_t seed) | |
366 | { | |
367 | bip->bip_iter.bi_sector = seed; | |
368 | } | |
369 | ||
7ba1ba12 | 370 | #endif /* CONFIG_BLK_DEV_INTEGRITY */ |
1da177e4 | 371 | |
e83502ca | 372 | void bio_trim(struct bio *bio, sector_t offset, sector_t size); |
20d0189b KO |
373 | extern struct bio *bio_split(struct bio *bio, int sectors, |
374 | gfp_t gfp, struct bio_set *bs); | |
375 | ||
376 | /** | |
377 | * bio_next_split - get next @sectors from a bio, splitting if necessary | |
378 | * @bio: bio to split | |
379 | * @sectors: number of sectors to split from the front of @bio | |
380 | * @gfp: gfp mask | |
381 | * @bs: bio set to allocate from | |
382 | * | |
6fd3c510 | 383 | * Return: a bio representing the next @sectors of @bio - if the bio is smaller |
20d0189b KO |
384 | * than @sectors, returns the original bio unchanged. |
385 | */ | |
386 | static inline struct bio *bio_next_split(struct bio *bio, int sectors, | |
387 | gfp_t gfp, struct bio_set *bs) | |
388 | { | |
389 | if (sectors >= bio_sectors(bio)) | |
390 | return bio; | |
391 | ||
392 | return bio_split(bio, sectors, gfp, bs); | |
393 | } | |
394 | ||
011067b0 N |
395 | enum { |
396 | BIOSET_NEED_BVECS = BIT(0), | |
47e0fb46 | 397 | BIOSET_NEED_RESCUER = BIT(1), |
be4d234d | 398 | BIOSET_PERCPU_CACHE = BIT(2), |
011067b0 | 399 | }; |
dad08527 KO |
400 | extern int bioset_init(struct bio_set *, unsigned int, unsigned int, int flags); |
401 | extern void bioset_exit(struct bio_set *); | |
8aa6ba2f | 402 | extern int biovec_init_pool(mempool_t *pool, int pool_entries); |
28e89fd9 | 403 | extern int bioset_init_from_src(struct bio_set *bs, struct bio_set *src); |
1da177e4 | 404 | |
0f2e6ab8 CH |
405 | struct bio *bio_alloc_bioset(gfp_t gfp, unsigned short nr_iovecs, |
406 | struct bio_set *bs); | |
be4d234d JA |
407 | struct bio *bio_alloc_kiocb(struct kiocb *kiocb, unsigned short nr_vecs, |
408 | struct bio_set *bs); | |
0f2e6ab8 | 409 | struct bio *bio_kmalloc(gfp_t gfp_mask, unsigned short nr_iovecs); |
1da177e4 LT |
410 | extern void bio_put(struct bio *); |
411 | ||
59d276fe KO |
412 | extern void __bio_clone_fast(struct bio *, struct bio *); |
413 | extern struct bio *bio_clone_fast(struct bio *, gfp_t, struct bio_set *); | |
bf800ef1 | 414 | |
f4f8154a | 415 | extern struct bio_set fs_bio_set; |
3f86a82a | 416 | |
0f2e6ab8 | 417 | static inline struct bio *bio_alloc(gfp_t gfp_mask, unsigned short nr_iovecs) |
3f86a82a | 418 | { |
f4f8154a | 419 | return bio_alloc_bioset(gfp_mask, nr_iovecs, &fs_bio_set); |
3f86a82a KO |
420 | } |
421 | ||
3e08773c | 422 | void submit_bio(struct bio *bio); |
1e3914d4 | 423 | |
4246a0b6 CH |
424 | extern void bio_endio(struct bio *); |
425 | ||
426 | static inline void bio_io_error(struct bio *bio) | |
427 | { | |
4e4cbee9 | 428 | bio->bi_status = BLK_STS_IOERR; |
4246a0b6 CH |
429 | bio_endio(bio); |
430 | } | |
431 | ||
03a07c92 GR |
432 | static inline void bio_wouldblock_error(struct bio *bio) |
433 | { | |
abb30460 | 434 | bio_set_flag(bio, BIO_QUIET); |
03a07c92 | 435 | bio->bi_status = BLK_STS_AGAIN; |
4246a0b6 CH |
436 | bio_endio(bio); |
437 | } | |
438 | ||
3e1a88ec PB |
439 | /* |
440 | * Calculate number of bvec segments that should be allocated to fit data | |
c42bca92 PB |
441 | * pointed by @iter. If @iter is backed by bvec it's going to be reused |
442 | * instead of allocating a new one. | |
3e1a88ec PB |
443 | */ |
444 | static inline int bio_iov_vecs_to_alloc(struct iov_iter *iter, int max_segs) | |
445 | { | |
c42bca92 PB |
446 | if (iov_iter_is_bvec(iter)) |
447 | return 0; | |
3e1a88ec PB |
448 | return iov_iter_npages(iter, max_segs); |
449 | } | |
450 | ||
1da177e4 | 451 | struct request_queue; |
1da177e4 | 452 | |
4e49ea4a | 453 | extern int submit_bio_wait(struct bio *bio); |
3a83f467 ML |
454 | extern void bio_init(struct bio *bio, struct bio_vec *table, |
455 | unsigned short max_vecs); | |
9ae3b3f5 | 456 | extern void bio_uninit(struct bio *); |
f44b48c7 | 457 | extern void bio_reset(struct bio *); |
196d38bc | 458 | void bio_chain(struct bio *, struct bio *); |
1da177e4 | 459 | |
85f5a74c MWO |
460 | int bio_add_page(struct bio *, struct page *, unsigned len, unsigned off); |
461 | bool bio_add_folio(struct bio *, struct folio *, size_t len, size_t off); | |
6e68af66 MC |
462 | extern int bio_add_pc_page(struct request_queue *, struct bio *, struct page *, |
463 | unsigned int, unsigned int); | |
ae29333f JT |
464 | int bio_add_zone_append_page(struct bio *bio, struct page *page, |
465 | unsigned int len, unsigned int offset); | |
0aa69fd3 CH |
466 | void __bio_add_page(struct bio *bio, struct page *page, |
467 | unsigned int len, unsigned int off); | |
2cefe4db | 468 | int bio_iov_iter_get_pages(struct bio *bio, struct iov_iter *iter); |
1bb6b810 | 469 | void bio_iov_bvec_set(struct bio *bio, struct iov_iter *iter); |
c809084a | 470 | void __bio_release_pages(struct bio *bio, bool mark_dirty); |
1da177e4 LT |
471 | extern void bio_set_pages_dirty(struct bio *bio); |
472 | extern void bio_check_pages_dirty(struct bio *bio); | |
2d4dc890 | 473 | |
45db54d5 KO |
474 | extern void bio_copy_data_iter(struct bio *dst, struct bvec_iter *dst_iter, |
475 | struct bio *src, struct bvec_iter *src_iter); | |
16ac3d63 | 476 | extern void bio_copy_data(struct bio *dst, struct bio *src); |
491221f8 | 477 | extern void bio_free_pages(struct bio *bio); |
29125ed6 | 478 | void guard_bio_eod(struct bio *bio); |
6f822e1b | 479 | void zero_fill_bio(struct bio *bio); |
38a72dac | 480 | |
c809084a PB |
481 | static inline void bio_release_pages(struct bio *bio, bool mark_dirty) |
482 | { | |
483 | if (!bio_flagged(bio, BIO_NO_PAGE_REF)) | |
484 | __bio_release_pages(bio, mark_dirty); | |
485 | } | |
486 | ||
9c0fb1e3 | 487 | extern const char *bio_devname(struct bio *bio, char *buffer); |
51d654e1 | 488 | |
74d46992 | 489 | #define bio_dev(bio) \ |
309dca30 | 490 | disk_devt((bio)->bi_bdev->bd_disk) |
74d46992 | 491 | |
852c788f | 492 | #ifdef CONFIG_BLK_CGROUP |
2268c0fe | 493 | void bio_associate_blkg(struct bio *bio); |
fd42df30 DZ |
494 | void bio_associate_blkg_from_css(struct bio *bio, |
495 | struct cgroup_subsys_state *css); | |
db6638d7 | 496 | void bio_clone_blkg_association(struct bio *dst, struct bio *src); |
852c788f | 497 | #else /* CONFIG_BLK_CGROUP */ |
2268c0fe | 498 | static inline void bio_associate_blkg(struct bio *bio) { } |
fd42df30 DZ |
499 | static inline void bio_associate_blkg_from_css(struct bio *bio, |
500 | struct cgroup_subsys_state *css) | |
501 | { } | |
db6638d7 DZ |
502 | static inline void bio_clone_blkg_association(struct bio *dst, |
503 | struct bio *src) { } | |
852c788f TH |
504 | #endif /* CONFIG_BLK_CGROUP */ |
505 | ||
cf6d6238 PB |
506 | static inline void bio_set_dev(struct bio *bio, struct block_device *bdev) |
507 | { | |
508 | bio_clear_flag(bio, BIO_REMAPPED); | |
509 | if (bio->bi_bdev != bdev) | |
510 | bio_clear_flag(bio, BIO_THROTTLED); | |
511 | bio->bi_bdev = bdev; | |
512 | bio_associate_blkg(bio); | |
513 | } | |
514 | ||
515 | static inline void bio_copy_dev(struct bio *dst, struct bio *src) | |
516 | { | |
517 | bio_clear_flag(dst, BIO_REMAPPED); | |
518 | dst->bi_bdev = src->bi_bdev; | |
519 | bio_clone_blkg_association(dst, src); | |
520 | } | |
521 | ||
8f3d8ba2 | 522 | /* |
e686307f | 523 | * BIO list management for use by remapping drivers (e.g. DM or MD) and loop. |
8f3d8ba2 CH |
524 | * |
525 | * A bio_list anchors a singly-linked list of bios chained through the bi_next | |
526 | * member of the bio. The bio_list also caches the last list member to allow | |
527 | * fast access to the tail. | |
528 | */ | |
529 | struct bio_list { | |
530 | struct bio *head; | |
531 | struct bio *tail; | |
532 | }; | |
533 | ||
534 | static inline int bio_list_empty(const struct bio_list *bl) | |
535 | { | |
536 | return bl->head == NULL; | |
537 | } | |
538 | ||
539 | static inline void bio_list_init(struct bio_list *bl) | |
540 | { | |
541 | bl->head = bl->tail = NULL; | |
542 | } | |
543 | ||
320ae51f JA |
544 | #define BIO_EMPTY_LIST { NULL, NULL } |
545 | ||
8f3d8ba2 CH |
546 | #define bio_list_for_each(bio, bl) \ |
547 | for (bio = (bl)->head; bio; bio = bio->bi_next) | |
548 | ||
549 | static inline unsigned bio_list_size(const struct bio_list *bl) | |
550 | { | |
551 | unsigned sz = 0; | |
552 | struct bio *bio; | |
553 | ||
554 | bio_list_for_each(bio, bl) | |
555 | sz++; | |
556 | ||
557 | return sz; | |
558 | } | |
559 | ||
560 | static inline void bio_list_add(struct bio_list *bl, struct bio *bio) | |
561 | { | |
562 | bio->bi_next = NULL; | |
563 | ||
564 | if (bl->tail) | |
565 | bl->tail->bi_next = bio; | |
566 | else | |
567 | bl->head = bio; | |
568 | ||
569 | bl->tail = bio; | |
570 | } | |
571 | ||
572 | static inline void bio_list_add_head(struct bio_list *bl, struct bio *bio) | |
573 | { | |
574 | bio->bi_next = bl->head; | |
575 | ||
576 | bl->head = bio; | |
577 | ||
578 | if (!bl->tail) | |
579 | bl->tail = bio; | |
580 | } | |
581 | ||
582 | static inline void bio_list_merge(struct bio_list *bl, struct bio_list *bl2) | |
583 | { | |
584 | if (!bl2->head) | |
585 | return; | |
586 | ||
587 | if (bl->tail) | |
588 | bl->tail->bi_next = bl2->head; | |
589 | else | |
590 | bl->head = bl2->head; | |
591 | ||
592 | bl->tail = bl2->tail; | |
593 | } | |
594 | ||
595 | static inline void bio_list_merge_head(struct bio_list *bl, | |
596 | struct bio_list *bl2) | |
597 | { | |
598 | if (!bl2->head) | |
599 | return; | |
600 | ||
601 | if (bl->head) | |
602 | bl2->tail->bi_next = bl->head; | |
603 | else | |
604 | bl->tail = bl2->tail; | |
605 | ||
606 | bl->head = bl2->head; | |
607 | } | |
608 | ||
13685a16 GU |
609 | static inline struct bio *bio_list_peek(struct bio_list *bl) |
610 | { | |
611 | return bl->head; | |
612 | } | |
613 | ||
8f3d8ba2 CH |
614 | static inline struct bio *bio_list_pop(struct bio_list *bl) |
615 | { | |
616 | struct bio *bio = bl->head; | |
617 | ||
618 | if (bio) { | |
619 | bl->head = bl->head->bi_next; | |
620 | if (!bl->head) | |
621 | bl->tail = NULL; | |
622 | ||
623 | bio->bi_next = NULL; | |
624 | } | |
625 | ||
626 | return bio; | |
627 | } | |
628 | ||
629 | static inline struct bio *bio_list_get(struct bio_list *bl) | |
630 | { | |
631 | struct bio *bio = bl->head; | |
632 | ||
633 | bl->head = bl->tail = NULL; | |
634 | ||
635 | return bio; | |
636 | } | |
637 | ||
0ef5a50c MS |
638 | /* |
639 | * Increment chain count for the bio. Make sure the CHAIN flag update | |
640 | * is visible before the raised count. | |
641 | */ | |
642 | static inline void bio_inc_remaining(struct bio *bio) | |
643 | { | |
644 | bio_set_flag(bio, BIO_CHAIN); | |
645 | smp_mb__before_atomic(); | |
646 | atomic_inc(&bio->__bi_remaining); | |
647 | } | |
648 | ||
57fb233f KO |
649 | /* |
650 | * bio_set is used to allow other portions of the IO system to | |
651 | * allocate their own private memory pools for bio and iovec structures. | |
652 | * These memory pools in turn all allocate from the bio_slab | |
653 | * and the bvec_slabs[]. | |
654 | */ | |
655 | #define BIO_POOL_SIZE 2 | |
57fb233f KO |
656 | |
657 | struct bio_set { | |
658 | struct kmem_cache *bio_slab; | |
659 | unsigned int front_pad; | |
660 | ||
be4d234d JA |
661 | /* |
662 | * per-cpu bio alloc cache | |
663 | */ | |
664 | struct bio_alloc_cache __percpu *cache; | |
665 | ||
8aa6ba2f KO |
666 | mempool_t bio_pool; |
667 | mempool_t bvec_pool; | |
57fb233f | 668 | #if defined(CONFIG_BLK_DEV_INTEGRITY) |
8aa6ba2f KO |
669 | mempool_t bio_integrity_pool; |
670 | mempool_t bvec_integrity_pool; | |
57fb233f | 671 | #endif |
df2cb6da | 672 | |
9f180e31 | 673 | unsigned int back_pad; |
df2cb6da KO |
674 | /* |
675 | * Deadlock avoidance for stacking block drivers: see comments in | |
676 | * bio_alloc_bioset() for details | |
677 | */ | |
678 | spinlock_t rescue_lock; | |
679 | struct bio_list rescue_list; | |
680 | struct work_struct rescue_work; | |
681 | struct workqueue_struct *rescue_workqueue; | |
be4d234d JA |
682 | |
683 | /* | |
684 | * Hot un-plug notifier for the per-cpu cache, if used | |
685 | */ | |
686 | struct hlist_node cpuhp_dead; | |
57fb233f KO |
687 | }; |
688 | ||
338aa96d KO |
689 | static inline bool bioset_initialized(struct bio_set *bs) |
690 | { | |
691 | return bs->bio_slab != NULL; | |
692 | } | |
693 | ||
7ba1ba12 MP |
694 | #if defined(CONFIG_BLK_DEV_INTEGRITY) |
695 | ||
d57a5f7c KO |
696 | #define bip_for_each_vec(bvl, bip, iter) \ |
697 | for_each_bvec(bvl, (bip)->bip_vec, iter, (bip)->bip_iter) | |
7ba1ba12 | 698 | |
13f05c8d MP |
699 | #define bio_for_each_integrity_vec(_bvl, _bio, _iter) \ |
700 | for_each_bio(_bio) \ | |
701 | bip_for_each_vec(_bvl, _bio->bi_integrity, _iter) | |
702 | ||
7ba1ba12 | 703 | extern struct bio_integrity_payload *bio_integrity_alloc(struct bio *, gfp_t, unsigned int); |
7ba1ba12 | 704 | extern int bio_integrity_add_page(struct bio *, struct page *, unsigned int, unsigned int); |
e23947bd | 705 | extern bool bio_integrity_prep(struct bio *); |
7ba1ba12 | 706 | extern void bio_integrity_advance(struct bio *, unsigned int); |
fbd08e76 | 707 | extern void bio_integrity_trim(struct bio *); |
1e2a410f | 708 | extern int bio_integrity_clone(struct bio *, struct bio *, gfp_t); |
7878cba9 MP |
709 | extern int bioset_integrity_create(struct bio_set *, int); |
710 | extern void bioset_integrity_free(struct bio_set *); | |
711 | extern void bio_integrity_init(void); | |
7ba1ba12 MP |
712 | |
713 | #else /* CONFIG_BLK_DEV_INTEGRITY */ | |
714 | ||
c611529e | 715 | static inline void *bio_integrity(struct bio *bio) |
6898e3bd | 716 | { |
c611529e | 717 | return NULL; |
6898e3bd MP |
718 | } |
719 | ||
6898e3bd MP |
720 | static inline int bioset_integrity_create(struct bio_set *bs, int pool_size) |
721 | { | |
722 | return 0; | |
723 | } | |
724 | ||
725 | static inline void bioset_integrity_free (struct bio_set *bs) | |
726 | { | |
727 | return; | |
728 | } | |
729 | ||
e23947bd | 730 | static inline bool bio_integrity_prep(struct bio *bio) |
6898e3bd | 731 | { |
e23947bd | 732 | return true; |
6898e3bd MP |
733 | } |
734 | ||
0c614e2d | 735 | static inline int bio_integrity_clone(struct bio *bio, struct bio *bio_src, |
1e2a410f | 736 | gfp_t gfp_mask) |
0c614e2d SR |
737 | { |
738 | return 0; | |
739 | } | |
6898e3bd | 740 | |
6898e3bd MP |
741 | static inline void bio_integrity_advance(struct bio *bio, |
742 | unsigned int bytes_done) | |
743 | { | |
744 | return; | |
745 | } | |
746 | ||
fbd08e76 | 747 | static inline void bio_integrity_trim(struct bio *bio) |
6898e3bd MP |
748 | { |
749 | return; | |
750 | } | |
751 | ||
752 | static inline void bio_integrity_init(void) | |
753 | { | |
754 | return; | |
755 | } | |
7ba1ba12 | 756 | |
c611529e MP |
757 | static inline bool bio_integrity_flagged(struct bio *bio, enum bip_flags flag) |
758 | { | |
759 | return false; | |
760 | } | |
761 | ||
06c1e390 KB |
762 | static inline void *bio_integrity_alloc(struct bio * bio, gfp_t gfp, |
763 | unsigned int nr) | |
764 | { | |
765 | return ERR_PTR(-EINVAL); | |
766 | } | |
767 | ||
768 | static inline int bio_integrity_add_page(struct bio *bio, struct page *page, | |
769 | unsigned int len, unsigned int offset) | |
770 | { | |
771 | return 0; | |
772 | } | |
773 | ||
7ba1ba12 MP |
774 | #endif /* CONFIG_BLK_DEV_INTEGRITY */ |
775 | ||
0bbb280d JA |
776 | /* |
777 | * Mark a bio as polled. Note that for async polled IO, the caller must | |
778 | * expect -EWOULDBLOCK if we cannot allocate a request (or other resources). | |
779 | * We cannot block waiting for requests on polled IO, as those completions | |
780 | * must be found by the caller. This is different than IRQ driven IO, where | |
781 | * it's safe to wait for IO to complete. | |
782 | */ | |
783 | static inline void bio_set_polled(struct bio *bio, struct kiocb *kiocb) | |
784 | { | |
6ce913fe | 785 | bio->bi_opf |= REQ_POLLED; |
0bbb280d JA |
786 | if (!is_sync_kiocb(kiocb)) |
787 | bio->bi_opf |= REQ_NOWAIT; | |
788 | } | |
789 | ||
c28a6147 CK |
790 | struct bio *blk_next_bio(struct bio *bio, unsigned int nr_pages, gfp_t gfp); |
791 | ||
1da177e4 | 792 | #endif /* __LINUX_BIO_H */ |