]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * 2.5 block I/O model | |
3 | * | |
4 | * Copyright (C) 2001 Jens Axboe <axboe@suse.de> | |
5 | * | |
6 | * This program is free software; you can redistribute it and/or modify | |
7 | * it under the terms of the GNU General Public License version 2 as | |
8 | * published by the Free Software Foundation. | |
9 | * | |
10 | * This program is distributed in the hope that it will be useful, | |
11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
7cc01581 | 12 | * |
1da177e4 LT |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * GNU General Public License for more details. | |
15 | * | |
16 | * You should have received a copy of the GNU General Public Licens | |
17 | * along with this program; if not, write to the Free Software | |
18 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111- | |
19 | */ | |
20 | #ifndef __LINUX_BIO_H | |
21 | #define __LINUX_BIO_H | |
22 | ||
23 | #include <linux/highmem.h> | |
24 | #include <linux/mempool.h> | |
22e2c507 | 25 | #include <linux/ioprio.h> |
187f1882 | 26 | #include <linux/bug.h> |
1da177e4 | 27 | |
02a5e0ac DH |
28 | #ifdef CONFIG_BLOCK |
29 | ||
1da177e4 LT |
30 | #include <asm/io.h> |
31 | ||
7cc01581 TH |
32 | /* struct bio, bio_vec and BIO_* flags are defined in blk_types.h */ |
33 | #include <linux/blk_types.h> | |
34 | ||
1da177e4 LT |
35 | #define BIO_DEBUG |
36 | ||
37 | #ifdef BIO_DEBUG | |
38 | #define BIO_BUG_ON BUG_ON | |
39 | #else | |
40 | #define BIO_BUG_ON | |
41 | #endif | |
42 | ||
d84a8477 | 43 | #define BIO_MAX_PAGES 256 |
09cbfeaf | 44 | #define BIO_MAX_SIZE (BIO_MAX_PAGES << PAGE_SHIFT) |
1da177e4 LT |
45 | #define BIO_MAX_SECTORS (BIO_MAX_SIZE >> 9) |
46 | ||
f2150821 MC |
47 | #define bio_op(bio) (op_from_rq_bits((bio)->bi_rw)) |
48 | #define bio_set_op_attrs(bio, op, flags) ((bio)->bi_rw |= (op | flags)) | |
49 | ||
22e2c507 JA |
50 | /* |
51 | * upper 16 bits of bi_rw define the io priority of this bio | |
52 | */ | |
53 | #define BIO_PRIO_SHIFT (8 * sizeof(unsigned long) - IOPRIO_BITS) | |
54 | #define bio_prio(bio) ((bio)->bi_rw >> BIO_PRIO_SHIFT) | |
55 | #define bio_prio_valid(bio) ioprio_valid(bio_prio(bio)) | |
56 | ||
57 | #define bio_set_prio(bio, prio) do { \ | |
58 | WARN_ON(prio >= (1 << IOPRIO_BITS)); \ | |
59 | (bio)->bi_rw &= ((1UL << BIO_PRIO_SHIFT) - 1); \ | |
60 | (bio)->bi_rw |= ((unsigned long) (prio) << BIO_PRIO_SHIFT); \ | |
61 | } while (0) | |
62 | ||
1da177e4 LT |
63 | /* |
64 | * various member access, note that bio_data should of course not be used | |
65 | * on highmem page vectors | |
66 | */ | |
4550dd6c | 67 | #define __bvec_iter_bvec(bvec, iter) (&(bvec)[(iter).bi_idx]) |
a4ad39b1 | 68 | |
4550dd6c KO |
69 | #define bvec_iter_page(bvec, iter) \ |
70 | (__bvec_iter_bvec((bvec), (iter))->bv_page) | |
71 | ||
72 | #define bvec_iter_len(bvec, iter) \ | |
73 | min((iter).bi_size, \ | |
74 | __bvec_iter_bvec((bvec), (iter))->bv_len - (iter).bi_bvec_done) | |
75 | ||
76 | #define bvec_iter_offset(bvec, iter) \ | |
77 | (__bvec_iter_bvec((bvec), (iter))->bv_offset + (iter).bi_bvec_done) | |
78 | ||
79 | #define bvec_iter_bvec(bvec, iter) \ | |
80 | ((struct bio_vec) { \ | |
81 | .bv_page = bvec_iter_page((bvec), (iter)), \ | |
82 | .bv_len = bvec_iter_len((bvec), (iter)), \ | |
83 | .bv_offset = bvec_iter_offset((bvec), (iter)), \ | |
84 | }) | |
85 | ||
86 | #define bio_iter_iovec(bio, iter) \ | |
87 | bvec_iter_bvec((bio)->bi_io_vec, (iter)) | |
88 | ||
89 | #define bio_iter_page(bio, iter) \ | |
90 | bvec_iter_page((bio)->bi_io_vec, (iter)) | |
91 | #define bio_iter_len(bio, iter) \ | |
92 | bvec_iter_len((bio)->bi_io_vec, (iter)) | |
93 | #define bio_iter_offset(bio, iter) \ | |
94 | bvec_iter_offset((bio)->bi_io_vec, (iter)) | |
95 | ||
96 | #define bio_page(bio) bio_iter_page((bio), (bio)->bi_iter) | |
97 | #define bio_offset(bio) bio_iter_offset((bio), (bio)->bi_iter) | |
98 | #define bio_iovec(bio) bio_iter_iovec((bio), (bio)->bi_iter) | |
7988613b | 99 | |
458b76ed KO |
100 | #define bio_multiple_segments(bio) \ |
101 | ((bio)->bi_iter.bi_size != bio_iovec(bio).bv_len) | |
4f024f37 KO |
102 | #define bio_sectors(bio) ((bio)->bi_iter.bi_size >> 9) |
103 | #define bio_end_sector(bio) ((bio)->bi_iter.bi_sector + bio_sectors((bio))) | |
bf2de6f5 | 104 | |
458b76ed KO |
105 | /* |
106 | * Check whether this bio carries any data or not. A NULL bio is allowed. | |
107 | */ | |
108 | static inline bool bio_has_data(struct bio *bio) | |
109 | { | |
110 | if (bio && | |
111 | bio->bi_iter.bi_size && | |
95fe6c1a | 112 | bio_op(bio) != REQ_OP_DISCARD) |
458b76ed KO |
113 | return true; |
114 | ||
115 | return false; | |
116 | } | |
117 | ||
95fe6c1a MC |
118 | static inline bool bio_no_advance_iter(struct bio *bio) |
119 | { | |
120 | return bio_op(bio) == REQ_OP_DISCARD || bio_op(bio) == REQ_OP_WRITE_SAME; | |
121 | } | |
122 | ||
458b76ed KO |
123 | static inline bool bio_is_rw(struct bio *bio) |
124 | { | |
125 | if (!bio_has_data(bio)) | |
126 | return false; | |
127 | ||
95fe6c1a | 128 | if (bio_no_advance_iter(bio)) |
458b76ed KO |
129 | return false; |
130 | ||
131 | return true; | |
132 | } | |
133 | ||
134 | static inline bool bio_mergeable(struct bio *bio) | |
135 | { | |
136 | if (bio->bi_rw & REQ_NOMERGE_FLAGS) | |
137 | return false; | |
138 | ||
139 | return true; | |
140 | } | |
141 | ||
2e46e8b2 | 142 | static inline unsigned int bio_cur_bytes(struct bio *bio) |
bf2de6f5 | 143 | { |
458b76ed | 144 | if (bio_has_data(bio)) |
a4ad39b1 | 145 | return bio_iovec(bio).bv_len; |
fb2dce86 | 146 | else /* dataless requests such as discard */ |
4f024f37 | 147 | return bio->bi_iter.bi_size; |
bf2de6f5 JA |
148 | } |
149 | ||
150 | static inline void *bio_data(struct bio *bio) | |
151 | { | |
458b76ed | 152 | if (bio_has_data(bio)) |
bf2de6f5 JA |
153 | return page_address(bio_page(bio)) + bio_offset(bio); |
154 | ||
155 | return NULL; | |
156 | } | |
1da177e4 LT |
157 | |
158 | /* | |
159 | * will die | |
160 | */ | |
161 | #define bio_to_phys(bio) (page_to_phys(bio_page((bio))) + (unsigned long) bio_offset((bio))) | |
162 | #define bvec_to_phys(bv) (page_to_phys((bv)->bv_page) + (unsigned long) (bv)->bv_offset) | |
163 | ||
164 | /* | |
165 | * queues that have highmem support enabled may still need to revert to | |
166 | * PIO transfers occasionally and thus map high pages temporarily. For | |
167 | * permanent PIO fall back, user is probably better off disabling highmem | |
168 | * I/O completely on that queue (see ide-dma for example) | |
169 | */ | |
f619d254 KO |
170 | #define __bio_kmap_atomic(bio, iter) \ |
171 | (kmap_atomic(bio_iter_iovec((bio), (iter)).bv_page) + \ | |
172 | bio_iter_iovec((bio), (iter)).bv_offset) | |
1da177e4 | 173 | |
f619d254 | 174 | #define __bio_kunmap_atomic(addr) kunmap_atomic(addr) |
1da177e4 LT |
175 | |
176 | /* | |
177 | * merge helpers etc | |
178 | */ | |
179 | ||
f92131c3 JF |
180 | /* Default implementation of BIOVEC_PHYS_MERGEABLE */ |
181 | #define __BIOVEC_PHYS_MERGEABLE(vec1, vec2) \ | |
182 | ((bvec_to_phys((vec1)) + (vec1)->bv_len) == bvec_to_phys((vec2))) | |
183 | ||
1da177e4 LT |
184 | /* |
185 | * allow arch override, for eg virtualized architectures (put in asm/io.h) | |
186 | */ | |
187 | #ifndef BIOVEC_PHYS_MERGEABLE | |
188 | #define BIOVEC_PHYS_MERGEABLE(vec1, vec2) \ | |
f92131c3 | 189 | __BIOVEC_PHYS_MERGEABLE(vec1, vec2) |
1da177e4 LT |
190 | #endif |
191 | ||
1da177e4 LT |
192 | #define __BIO_SEG_BOUNDARY(addr1, addr2, mask) \ |
193 | (((addr1) | (mask)) == (((addr2) - 1) | (mask))) | |
194 | #define BIOVEC_SEG_BOUNDARY(q, b1, b2) \ | |
ae03bf63 | 195 | __BIO_SEG_BOUNDARY(bvec_to_phys((b1)), bvec_to_phys((b2)) + (b2)->bv_len, queue_segment_boundary((q))) |
1da177e4 | 196 | |
d74c6d51 KO |
197 | /* |
198 | * drivers should _never_ use the all version - the bio may have been split | |
199 | * before it got to the driver and the driver won't own all of it | |
200 | */ | |
201 | #define bio_for_each_segment_all(bvl, bio, i) \ | |
f619d254 | 202 | for (i = 0, bvl = (bio)->bi_io_vec; i < (bio)->bi_vcnt; i++, bvl++) |
d74c6d51 | 203 | |
4550dd6c KO |
204 | static inline void bvec_iter_advance(struct bio_vec *bv, struct bvec_iter *iter, |
205 | unsigned bytes) | |
206 | { | |
207 | WARN_ONCE(bytes > iter->bi_size, | |
208 | "Attempted to advance past end of bvec iter\n"); | |
209 | ||
210 | while (bytes) { | |
211 | unsigned len = min(bytes, bvec_iter_len(bv, *iter)); | |
212 | ||
213 | bytes -= len; | |
214 | iter->bi_size -= len; | |
215 | iter->bi_bvec_done += len; | |
216 | ||
217 | if (iter->bi_bvec_done == __bvec_iter_bvec(bv, *iter)->bv_len) { | |
218 | iter->bi_bvec_done = 0; | |
219 | iter->bi_idx++; | |
220 | } | |
221 | } | |
222 | } | |
223 | ||
224 | #define for_each_bvec(bvl, bio_vec, iter, start) \ | |
b7aa84d9 MP |
225 | for (iter = (start); \ |
226 | (iter).bi_size && \ | |
227 | ((bvl = bvec_iter_bvec((bio_vec), (iter))), 1); \ | |
4550dd6c KO |
228 | bvec_iter_advance((bio_vec), &(iter), (bvl).bv_len)) |
229 | ||
230 | ||
231 | static inline void bio_advance_iter(struct bio *bio, struct bvec_iter *iter, | |
232 | unsigned bytes) | |
233 | { | |
234 | iter->bi_sector += bytes >> 9; | |
235 | ||
95fe6c1a | 236 | if (bio_no_advance_iter(bio)) |
4550dd6c KO |
237 | iter->bi_size -= bytes; |
238 | else | |
239 | bvec_iter_advance(bio->bi_io_vec, iter, bytes); | |
240 | } | |
241 | ||
7988613b KO |
242 | #define __bio_for_each_segment(bvl, bio, iter, start) \ |
243 | for (iter = (start); \ | |
4550dd6c KO |
244 | (iter).bi_size && \ |
245 | ((bvl = bio_iter_iovec((bio), (iter))), 1); \ | |
246 | bio_advance_iter((bio), &(iter), (bvl).bv_len)) | |
7988613b KO |
247 | |
248 | #define bio_for_each_segment(bvl, bio, iter) \ | |
249 | __bio_for_each_segment(bvl, bio, iter, (bio)->bi_iter) | |
250 | ||
4550dd6c | 251 | #define bio_iter_last(bvec, iter) ((iter).bi_size == (bvec).bv_len) |
1da177e4 | 252 | |
458b76ed KO |
253 | static inline unsigned bio_segments(struct bio *bio) |
254 | { | |
255 | unsigned segs = 0; | |
256 | struct bio_vec bv; | |
257 | struct bvec_iter iter; | |
258 | ||
8423ae3d KO |
259 | /* |
260 | * We special case discard/write same, because they interpret bi_size | |
261 | * differently: | |
262 | */ | |
263 | ||
95fe6c1a | 264 | if (bio_op(bio) == REQ_OP_DISCARD) |
8423ae3d KO |
265 | return 1; |
266 | ||
95fe6c1a | 267 | if (bio_op(bio) == REQ_OP_WRITE_SAME) |
8423ae3d KO |
268 | return 1; |
269 | ||
458b76ed KO |
270 | bio_for_each_segment(bv, bio, iter) |
271 | segs++; | |
272 | ||
273 | return segs; | |
274 | } | |
275 | ||
1da177e4 LT |
276 | /* |
277 | * get a reference to a bio, so it won't disappear. the intended use is | |
278 | * something like: | |
279 | * | |
280 | * bio_get(bio); | |
281 | * submit_bio(rw, bio); | |
282 | * if (bio->bi_flags ...) | |
283 | * do_something | |
284 | * bio_put(bio); | |
285 | * | |
286 | * without the bio_get(), it could potentially complete I/O before submit_bio | |
287 | * returns. and then bio would be freed memory when if (bio->bi_flags ...) | |
288 | * runs | |
289 | */ | |
dac56212 JA |
290 | static inline void bio_get(struct bio *bio) |
291 | { | |
292 | bio->bi_flags |= (1 << BIO_REFFED); | |
293 | smp_mb__before_atomic(); | |
294 | atomic_inc(&bio->__bi_cnt); | |
295 | } | |
296 | ||
297 | static inline void bio_cnt_set(struct bio *bio, unsigned int count) | |
298 | { | |
299 | if (count != 1) { | |
300 | bio->bi_flags |= (1 << BIO_REFFED); | |
301 | smp_mb__before_atomic(); | |
302 | } | |
303 | atomic_set(&bio->__bi_cnt, count); | |
304 | } | |
1da177e4 | 305 | |
b7c44ed9 JA |
306 | static inline bool bio_flagged(struct bio *bio, unsigned int bit) |
307 | { | |
2c68f6dc | 308 | return (bio->bi_flags & (1U << bit)) != 0; |
b7c44ed9 JA |
309 | } |
310 | ||
311 | static inline void bio_set_flag(struct bio *bio, unsigned int bit) | |
312 | { | |
2c68f6dc | 313 | bio->bi_flags |= (1U << bit); |
b7c44ed9 JA |
314 | } |
315 | ||
316 | static inline void bio_clear_flag(struct bio *bio, unsigned int bit) | |
317 | { | |
2c68f6dc | 318 | bio->bi_flags &= ~(1U << bit); |
b7c44ed9 JA |
319 | } |
320 | ||
7bcd79ac ML |
321 | static inline void bio_get_first_bvec(struct bio *bio, struct bio_vec *bv) |
322 | { | |
323 | *bv = bio_iovec(bio); | |
324 | } | |
325 | ||
326 | static inline void bio_get_last_bvec(struct bio *bio, struct bio_vec *bv) | |
327 | { | |
328 | struct bvec_iter iter = bio->bi_iter; | |
329 | int idx; | |
330 | ||
7bcd79ac ML |
331 | if (unlikely(!bio_multiple_segments(bio))) { |
332 | *bv = bio_iovec(bio); | |
333 | return; | |
334 | } | |
335 | ||
336 | bio_advance_iter(bio, &iter, iter.bi_size); | |
337 | ||
338 | if (!iter.bi_bvec_done) | |
339 | idx = iter.bi_idx - 1; | |
340 | else /* in the middle of bvec */ | |
341 | idx = iter.bi_idx; | |
342 | ||
343 | *bv = bio->bi_io_vec[idx]; | |
344 | ||
345 | /* | |
346 | * iter.bi_bvec_done records actual length of the last bvec | |
347 | * if this bio ends in the middle of one io vector | |
348 | */ | |
349 | if (iter.bi_bvec_done) | |
350 | bv->bv_len = iter.bi_bvec_done; | |
351 | } | |
352 | ||
c611529e MP |
353 | enum bip_flags { |
354 | BIP_BLOCK_INTEGRITY = 1 << 0, /* block layer owns integrity data */ | |
355 | BIP_MAPPED_INTEGRITY = 1 << 1, /* ref tag has been remapped */ | |
356 | BIP_CTRL_NOCHECK = 1 << 2, /* disable HBA integrity checking */ | |
357 | BIP_DISK_NOCHECK = 1 << 3, /* disable disk integrity checking */ | |
358 | BIP_IP_CHECKSUM = 1 << 4, /* IP checksum */ | |
359 | }; | |
360 | ||
7ba1ba12 MP |
361 | /* |
362 | * bio integrity payload | |
363 | */ | |
364 | struct bio_integrity_payload { | |
365 | struct bio *bip_bio; /* parent bio */ | |
7ba1ba12 | 366 | |
d57a5f7c | 367 | struct bvec_iter bip_iter; |
7ba1ba12 | 368 | |
d57a5f7c | 369 | bio_end_io_t *bip_end_io; /* saved I/O completion fn */ |
7ba1ba12 | 370 | |
7878cba9 | 371 | unsigned short bip_slab; /* slab the bip came from */ |
7ba1ba12 | 372 | unsigned short bip_vcnt; /* # of integrity bio_vecs */ |
cbcd1054 | 373 | unsigned short bip_max_vcnt; /* integrity bio_vec slots */ |
b1f01388 | 374 | unsigned short bip_flags; /* control flags */ |
7ba1ba12 MP |
375 | |
376 | struct work_struct bip_work; /* I/O completion */ | |
6fda981c KO |
377 | |
378 | struct bio_vec *bip_vec; | |
379 | struct bio_vec bip_inline_vecs[0];/* embedded bvec array */ | |
7ba1ba12 | 380 | }; |
18593088 | 381 | |
06c1e390 KB |
382 | #if defined(CONFIG_BLK_DEV_INTEGRITY) |
383 | ||
384 | static inline struct bio_integrity_payload *bio_integrity(struct bio *bio) | |
385 | { | |
386 | if (bio->bi_rw & REQ_INTEGRITY) | |
387 | return bio->bi_integrity; | |
388 | ||
389 | return NULL; | |
390 | } | |
391 | ||
c611529e MP |
392 | static inline bool bio_integrity_flagged(struct bio *bio, enum bip_flags flag) |
393 | { | |
394 | struct bio_integrity_payload *bip = bio_integrity(bio); | |
395 | ||
396 | if (bip) | |
397 | return bip->bip_flags & flag; | |
398 | ||
399 | return false; | |
400 | } | |
b1f01388 | 401 | |
18593088 MP |
402 | static inline sector_t bip_get_seed(struct bio_integrity_payload *bip) |
403 | { | |
404 | return bip->bip_iter.bi_sector; | |
405 | } | |
406 | ||
407 | static inline void bip_set_seed(struct bio_integrity_payload *bip, | |
408 | sector_t seed) | |
409 | { | |
410 | bip->bip_iter.bi_sector = seed; | |
411 | } | |
412 | ||
7ba1ba12 | 413 | #endif /* CONFIG_BLK_DEV_INTEGRITY */ |
1da177e4 | 414 | |
6678d83f | 415 | extern void bio_trim(struct bio *bio, int offset, int size); |
20d0189b KO |
416 | extern struct bio *bio_split(struct bio *bio, int sectors, |
417 | gfp_t gfp, struct bio_set *bs); | |
418 | ||
419 | /** | |
420 | * bio_next_split - get next @sectors from a bio, splitting if necessary | |
421 | * @bio: bio to split | |
422 | * @sectors: number of sectors to split from the front of @bio | |
423 | * @gfp: gfp mask | |
424 | * @bs: bio set to allocate from | |
425 | * | |
426 | * Returns a bio representing the next @sectors of @bio - if the bio is smaller | |
427 | * than @sectors, returns the original bio unchanged. | |
428 | */ | |
429 | static inline struct bio *bio_next_split(struct bio *bio, int sectors, | |
430 | gfp_t gfp, struct bio_set *bs) | |
431 | { | |
432 | if (sectors >= bio_sectors(bio)) | |
433 | return bio; | |
434 | ||
435 | return bio_split(bio, sectors, gfp, bs); | |
436 | } | |
437 | ||
bb799ca0 | 438 | extern struct bio_set *bioset_create(unsigned int, unsigned int); |
d8f429e1 | 439 | extern struct bio_set *bioset_create_nobvec(unsigned int, unsigned int); |
1da177e4 | 440 | extern void bioset_free(struct bio_set *); |
a6c39cb4 | 441 | extern mempool_t *biovec_create_pool(int pool_entries); |
1da177e4 | 442 | |
dd0fc66f | 443 | extern struct bio *bio_alloc_bioset(gfp_t, int, struct bio_set *); |
1da177e4 LT |
444 | extern void bio_put(struct bio *); |
445 | ||
59d276fe KO |
446 | extern void __bio_clone_fast(struct bio *, struct bio *); |
447 | extern struct bio *bio_clone_fast(struct bio *, gfp_t, struct bio_set *); | |
bf800ef1 KO |
448 | extern struct bio *bio_clone_bioset(struct bio *, gfp_t, struct bio_set *bs); |
449 | ||
3f86a82a KO |
450 | extern struct bio_set *fs_bio_set; |
451 | ||
452 | static inline struct bio *bio_alloc(gfp_t gfp_mask, unsigned int nr_iovecs) | |
453 | { | |
454 | return bio_alloc_bioset(gfp_mask, nr_iovecs, fs_bio_set); | |
455 | } | |
456 | ||
bf800ef1 KO |
457 | static inline struct bio *bio_clone(struct bio *bio, gfp_t gfp_mask) |
458 | { | |
459 | return bio_clone_bioset(bio, gfp_mask, fs_bio_set); | |
460 | } | |
461 | ||
3f86a82a KO |
462 | static inline struct bio *bio_kmalloc(gfp_t gfp_mask, unsigned int nr_iovecs) |
463 | { | |
464 | return bio_alloc_bioset(gfp_mask, nr_iovecs, NULL); | |
465 | } | |
466 | ||
bf800ef1 KO |
467 | static inline struct bio *bio_clone_kmalloc(struct bio *bio, gfp_t gfp_mask) |
468 | { | |
469 | return bio_clone_bioset(bio, gfp_mask, NULL); | |
470 | ||
471 | } | |
472 | ||
4246a0b6 CH |
473 | extern void bio_endio(struct bio *); |
474 | ||
475 | static inline void bio_io_error(struct bio *bio) | |
476 | { | |
477 | bio->bi_error = -EIO; | |
478 | bio_endio(bio); | |
479 | } | |
480 | ||
1da177e4 LT |
481 | struct request_queue; |
482 | extern int bio_phys_segments(struct request_queue *, struct bio *); | |
1da177e4 | 483 | |
4e49ea4a | 484 | extern int submit_bio_wait(struct bio *bio); |
054bdf64 KO |
485 | extern void bio_advance(struct bio *, unsigned); |
486 | ||
1da177e4 | 487 | extern void bio_init(struct bio *); |
f44b48c7 | 488 | extern void bio_reset(struct bio *); |
196d38bc | 489 | void bio_chain(struct bio *, struct bio *); |
1da177e4 LT |
490 | |
491 | extern int bio_add_page(struct bio *, struct page *, unsigned int,unsigned int); | |
6e68af66 MC |
492 | extern int bio_add_pc_page(struct request_queue *, struct bio *, struct page *, |
493 | unsigned int, unsigned int); | |
152e283f | 494 | struct rq_map_data; |
f1970baf | 495 | extern struct bio *bio_map_user_iov(struct request_queue *, |
26e49cfc | 496 | const struct iov_iter *, gfp_t); |
1da177e4 | 497 | extern void bio_unmap_user(struct bio *); |
df46b9a4 | 498 | extern struct bio *bio_map_kern(struct request_queue *, void *, unsigned int, |
27496a8c | 499 | gfp_t); |
68154e90 FT |
500 | extern struct bio *bio_copy_kern(struct request_queue *, void *, unsigned int, |
501 | gfp_t, int); | |
1da177e4 LT |
502 | extern void bio_set_pages_dirty(struct bio *bio); |
503 | extern void bio_check_pages_dirty(struct bio *bio); | |
2d4dc890 | 504 | |
394ffa50 GZ |
505 | void generic_start_io_acct(int rw, unsigned long sectors, |
506 | struct hd_struct *part); | |
507 | void generic_end_io_acct(int rw, struct hd_struct *part, | |
508 | unsigned long start_time); | |
509 | ||
2d4dc890 IL |
510 | #ifndef ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE |
511 | # error "You should define ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE for your platform" | |
512 | #endif | |
513 | #if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE | |
514 | extern void bio_flush_dcache_pages(struct bio *bi); | |
515 | #else | |
516 | static inline void bio_flush_dcache_pages(struct bio *bi) | |
517 | { | |
518 | } | |
519 | #endif | |
520 | ||
16ac3d63 | 521 | extern void bio_copy_data(struct bio *dst, struct bio *src); |
a0787606 | 522 | extern int bio_alloc_pages(struct bio *bio, gfp_t gfp); |
16ac3d63 | 523 | |
152e283f | 524 | extern struct bio *bio_copy_user_iov(struct request_queue *, |
86d564c8 | 525 | struct rq_map_data *, |
26e49cfc KO |
526 | const struct iov_iter *, |
527 | gfp_t); | |
1da177e4 LT |
528 | extern int bio_uncopy_user(struct bio *); |
529 | void zero_fill_bio(struct bio *bio); | |
9f060e22 KO |
530 | extern struct bio_vec *bvec_alloc(gfp_t, int, unsigned long *, mempool_t *); |
531 | extern void bvec_free(mempool_t *, struct bio_vec *, unsigned int); | |
7ba1ba12 | 532 | extern unsigned int bvec_nr_vecs(unsigned short idx); |
51d654e1 | 533 | |
852c788f | 534 | #ifdef CONFIG_BLK_CGROUP |
1d933cf0 | 535 | int bio_associate_blkcg(struct bio *bio, struct cgroup_subsys_state *blkcg_css); |
852c788f TH |
536 | int bio_associate_current(struct bio *bio); |
537 | void bio_disassociate_task(struct bio *bio); | |
538 | #else /* CONFIG_BLK_CGROUP */ | |
1d933cf0 TH |
539 | static inline int bio_associate_blkcg(struct bio *bio, |
540 | struct cgroup_subsys_state *blkcg_css) { return 0; } | |
852c788f TH |
541 | static inline int bio_associate_current(struct bio *bio) { return -ENOENT; } |
542 | static inline void bio_disassociate_task(struct bio *bio) { } | |
543 | #endif /* CONFIG_BLK_CGROUP */ | |
544 | ||
1da177e4 LT |
545 | #ifdef CONFIG_HIGHMEM |
546 | /* | |
20b636bf AB |
547 | * remember never ever reenable interrupts between a bvec_kmap_irq and |
548 | * bvec_kunmap_irq! | |
1da177e4 | 549 | */ |
4f570f99 | 550 | static inline char *bvec_kmap_irq(struct bio_vec *bvec, unsigned long *flags) |
1da177e4 LT |
551 | { |
552 | unsigned long addr; | |
553 | ||
554 | /* | |
555 | * might not be a highmem page, but the preempt/irq count | |
556 | * balancing is a lot nicer this way | |
557 | */ | |
558 | local_irq_save(*flags); | |
e8e3c3d6 | 559 | addr = (unsigned long) kmap_atomic(bvec->bv_page); |
1da177e4 LT |
560 | |
561 | BUG_ON(addr & ~PAGE_MASK); | |
562 | ||
563 | return (char *) addr + bvec->bv_offset; | |
564 | } | |
565 | ||
4f570f99 | 566 | static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags) |
1da177e4 LT |
567 | { |
568 | unsigned long ptr = (unsigned long) buffer & PAGE_MASK; | |
569 | ||
e8e3c3d6 | 570 | kunmap_atomic((void *) ptr); |
1da177e4 LT |
571 | local_irq_restore(*flags); |
572 | } | |
573 | ||
574 | #else | |
11a691be GU |
575 | static inline char *bvec_kmap_irq(struct bio_vec *bvec, unsigned long *flags) |
576 | { | |
577 | return page_address(bvec->bv_page) + bvec->bv_offset; | |
578 | } | |
579 | ||
580 | static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags) | |
581 | { | |
582 | *flags = 0; | |
583 | } | |
1da177e4 LT |
584 | #endif |
585 | ||
f619d254 | 586 | static inline char *__bio_kmap_irq(struct bio *bio, struct bvec_iter iter, |
1da177e4 LT |
587 | unsigned long *flags) |
588 | { | |
f619d254 | 589 | return bvec_kmap_irq(&bio_iter_iovec(bio, iter), flags); |
1da177e4 LT |
590 | } |
591 | #define __bio_kunmap_irq(buf, flags) bvec_kunmap_irq(buf, flags) | |
592 | ||
593 | #define bio_kmap_irq(bio, flags) \ | |
f619d254 | 594 | __bio_kmap_irq((bio), (bio)->bi_iter, (flags)) |
1da177e4 LT |
595 | #define bio_kunmap_irq(buf,flags) __bio_kunmap_irq(buf, flags) |
596 | ||
8f3d8ba2 | 597 | /* |
e686307f | 598 | * BIO list management for use by remapping drivers (e.g. DM or MD) and loop. |
8f3d8ba2 CH |
599 | * |
600 | * A bio_list anchors a singly-linked list of bios chained through the bi_next | |
601 | * member of the bio. The bio_list also caches the last list member to allow | |
602 | * fast access to the tail. | |
603 | */ | |
604 | struct bio_list { | |
605 | struct bio *head; | |
606 | struct bio *tail; | |
607 | }; | |
608 | ||
609 | static inline int bio_list_empty(const struct bio_list *bl) | |
610 | { | |
611 | return bl->head == NULL; | |
612 | } | |
613 | ||
614 | static inline void bio_list_init(struct bio_list *bl) | |
615 | { | |
616 | bl->head = bl->tail = NULL; | |
617 | } | |
618 | ||
320ae51f JA |
619 | #define BIO_EMPTY_LIST { NULL, NULL } |
620 | ||
8f3d8ba2 CH |
621 | #define bio_list_for_each(bio, bl) \ |
622 | for (bio = (bl)->head; bio; bio = bio->bi_next) | |
623 | ||
624 | static inline unsigned bio_list_size(const struct bio_list *bl) | |
625 | { | |
626 | unsigned sz = 0; | |
627 | struct bio *bio; | |
628 | ||
629 | bio_list_for_each(bio, bl) | |
630 | sz++; | |
631 | ||
632 | return sz; | |
633 | } | |
634 | ||
635 | static inline void bio_list_add(struct bio_list *bl, struct bio *bio) | |
636 | { | |
637 | bio->bi_next = NULL; | |
638 | ||
639 | if (bl->tail) | |
640 | bl->tail->bi_next = bio; | |
641 | else | |
642 | bl->head = bio; | |
643 | ||
644 | bl->tail = bio; | |
645 | } | |
646 | ||
647 | static inline void bio_list_add_head(struct bio_list *bl, struct bio *bio) | |
648 | { | |
649 | bio->bi_next = bl->head; | |
650 | ||
651 | bl->head = bio; | |
652 | ||
653 | if (!bl->tail) | |
654 | bl->tail = bio; | |
655 | } | |
656 | ||
657 | static inline void bio_list_merge(struct bio_list *bl, struct bio_list *bl2) | |
658 | { | |
659 | if (!bl2->head) | |
660 | return; | |
661 | ||
662 | if (bl->tail) | |
663 | bl->tail->bi_next = bl2->head; | |
664 | else | |
665 | bl->head = bl2->head; | |
666 | ||
667 | bl->tail = bl2->tail; | |
668 | } | |
669 | ||
670 | static inline void bio_list_merge_head(struct bio_list *bl, | |
671 | struct bio_list *bl2) | |
672 | { | |
673 | if (!bl2->head) | |
674 | return; | |
675 | ||
676 | if (bl->head) | |
677 | bl2->tail->bi_next = bl->head; | |
678 | else | |
679 | bl->tail = bl2->tail; | |
680 | ||
681 | bl->head = bl2->head; | |
682 | } | |
683 | ||
13685a16 GU |
684 | static inline struct bio *bio_list_peek(struct bio_list *bl) |
685 | { | |
686 | return bl->head; | |
687 | } | |
688 | ||
8f3d8ba2 CH |
689 | static inline struct bio *bio_list_pop(struct bio_list *bl) |
690 | { | |
691 | struct bio *bio = bl->head; | |
692 | ||
693 | if (bio) { | |
694 | bl->head = bl->head->bi_next; | |
695 | if (!bl->head) | |
696 | bl->tail = NULL; | |
697 | ||
698 | bio->bi_next = NULL; | |
699 | } | |
700 | ||
701 | return bio; | |
702 | } | |
703 | ||
704 | static inline struct bio *bio_list_get(struct bio_list *bl) | |
705 | { | |
706 | struct bio *bio = bl->head; | |
707 | ||
708 | bl->head = bl->tail = NULL; | |
709 | ||
710 | return bio; | |
711 | } | |
712 | ||
0ef5a50c MS |
713 | /* |
714 | * Increment chain count for the bio. Make sure the CHAIN flag update | |
715 | * is visible before the raised count. | |
716 | */ | |
717 | static inline void bio_inc_remaining(struct bio *bio) | |
718 | { | |
719 | bio_set_flag(bio, BIO_CHAIN); | |
720 | smp_mb__before_atomic(); | |
721 | atomic_inc(&bio->__bi_remaining); | |
722 | } | |
723 | ||
57fb233f KO |
724 | /* |
725 | * bio_set is used to allow other portions of the IO system to | |
726 | * allocate their own private memory pools for bio and iovec structures. | |
727 | * These memory pools in turn all allocate from the bio_slab | |
728 | * and the bvec_slabs[]. | |
729 | */ | |
730 | #define BIO_POOL_SIZE 2 | |
731 | #define BIOVEC_NR_POOLS 6 | |
732 | #define BIOVEC_MAX_IDX (BIOVEC_NR_POOLS - 1) | |
733 | ||
734 | struct bio_set { | |
735 | struct kmem_cache *bio_slab; | |
736 | unsigned int front_pad; | |
737 | ||
738 | mempool_t *bio_pool; | |
9f060e22 | 739 | mempool_t *bvec_pool; |
57fb233f KO |
740 | #if defined(CONFIG_BLK_DEV_INTEGRITY) |
741 | mempool_t *bio_integrity_pool; | |
9f060e22 | 742 | mempool_t *bvec_integrity_pool; |
57fb233f | 743 | #endif |
df2cb6da KO |
744 | |
745 | /* | |
746 | * Deadlock avoidance for stacking block drivers: see comments in | |
747 | * bio_alloc_bioset() for details | |
748 | */ | |
749 | spinlock_t rescue_lock; | |
750 | struct bio_list rescue_list; | |
751 | struct work_struct rescue_work; | |
752 | struct workqueue_struct *rescue_workqueue; | |
57fb233f KO |
753 | }; |
754 | ||
755 | struct biovec_slab { | |
756 | int nr_vecs; | |
757 | char *name; | |
758 | struct kmem_cache *slab; | |
759 | }; | |
760 | ||
761 | /* | |
762 | * a small number of entries is fine, not going to be performance critical. | |
763 | * basically we just need to survive | |
764 | */ | |
765 | #define BIO_SPLIT_ENTRIES 2 | |
766 | ||
7ba1ba12 MP |
767 | #if defined(CONFIG_BLK_DEV_INTEGRITY) |
768 | ||
d57a5f7c KO |
769 | #define bip_for_each_vec(bvl, bip, iter) \ |
770 | for_each_bvec(bvl, (bip)->bip_vec, iter, (bip)->bip_iter) | |
7ba1ba12 | 771 | |
13f05c8d MP |
772 | #define bio_for_each_integrity_vec(_bvl, _bio, _iter) \ |
773 | for_each_bio(_bio) \ | |
774 | bip_for_each_vec(_bvl, _bio->bi_integrity, _iter) | |
775 | ||
7ba1ba12 | 776 | extern struct bio_integrity_payload *bio_integrity_alloc(struct bio *, gfp_t, unsigned int); |
1e2a410f | 777 | extern void bio_integrity_free(struct bio *); |
7ba1ba12 | 778 | extern int bio_integrity_add_page(struct bio *, struct page *, unsigned int, unsigned int); |
e7258c1a | 779 | extern bool bio_integrity_enabled(struct bio *bio); |
7ba1ba12 | 780 | extern int bio_integrity_prep(struct bio *); |
4246a0b6 | 781 | extern void bio_integrity_endio(struct bio *); |
7ba1ba12 MP |
782 | extern void bio_integrity_advance(struct bio *, unsigned int); |
783 | extern void bio_integrity_trim(struct bio *, unsigned int, unsigned int); | |
1e2a410f | 784 | extern int bio_integrity_clone(struct bio *, struct bio *, gfp_t); |
7878cba9 MP |
785 | extern int bioset_integrity_create(struct bio_set *, int); |
786 | extern void bioset_integrity_free(struct bio_set *); | |
787 | extern void bio_integrity_init(void); | |
7ba1ba12 MP |
788 | |
789 | #else /* CONFIG_BLK_DEV_INTEGRITY */ | |
790 | ||
c611529e | 791 | static inline void *bio_integrity(struct bio *bio) |
6898e3bd | 792 | { |
c611529e | 793 | return NULL; |
6898e3bd MP |
794 | } |
795 | ||
e7258c1a | 796 | static inline bool bio_integrity_enabled(struct bio *bio) |
6898e3bd | 797 | { |
e7258c1a | 798 | return false; |
6898e3bd MP |
799 | } |
800 | ||
801 | static inline int bioset_integrity_create(struct bio_set *bs, int pool_size) | |
802 | { | |
803 | return 0; | |
804 | } | |
805 | ||
806 | static inline void bioset_integrity_free (struct bio_set *bs) | |
807 | { | |
808 | return; | |
809 | } | |
810 | ||
811 | static inline int bio_integrity_prep(struct bio *bio) | |
812 | { | |
813 | return 0; | |
814 | } | |
815 | ||
1e2a410f | 816 | static inline void bio_integrity_free(struct bio *bio) |
6898e3bd MP |
817 | { |
818 | return; | |
819 | } | |
820 | ||
0c614e2d | 821 | static inline int bio_integrity_clone(struct bio *bio, struct bio *bio_src, |
1e2a410f | 822 | gfp_t gfp_mask) |
0c614e2d SR |
823 | { |
824 | return 0; | |
825 | } | |
6898e3bd | 826 | |
6898e3bd MP |
827 | static inline void bio_integrity_advance(struct bio *bio, |
828 | unsigned int bytes_done) | |
829 | { | |
830 | return; | |
831 | } | |
832 | ||
833 | static inline void bio_integrity_trim(struct bio *bio, unsigned int offset, | |
834 | unsigned int sectors) | |
835 | { | |
836 | return; | |
837 | } | |
838 | ||
839 | static inline void bio_integrity_init(void) | |
840 | { | |
841 | return; | |
842 | } | |
7ba1ba12 | 843 | |
c611529e MP |
844 | static inline bool bio_integrity_flagged(struct bio *bio, enum bip_flags flag) |
845 | { | |
846 | return false; | |
847 | } | |
848 | ||
06c1e390 KB |
849 | static inline void *bio_integrity_alloc(struct bio * bio, gfp_t gfp, |
850 | unsigned int nr) | |
851 | { | |
852 | return ERR_PTR(-EINVAL); | |
853 | } | |
854 | ||
855 | static inline int bio_integrity_add_page(struct bio *bio, struct page *page, | |
856 | unsigned int len, unsigned int offset) | |
857 | { | |
858 | return 0; | |
859 | } | |
860 | ||
7ba1ba12 MP |
861 | #endif /* CONFIG_BLK_DEV_INTEGRITY */ |
862 | ||
02a5e0ac | 863 | #endif /* CONFIG_BLOCK */ |
1da177e4 | 864 | #endif /* __LINUX_BIO_H */ |