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