]> git.ipfire.org Git - thirdparty/kernel/linux.git/blame - include/linux/bio.h
block: return from __bio_try_merge_page if merging occured in the same page
[thirdparty/kernel/linux.git] / include / linux / bio.h
CommitLineData
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
8#include <linux/highmem.h>
9#include <linux/mempool.h>
22e2c507 10#include <linux/ioprio.h>
1da177e4 11
02a5e0ac 12#ifdef CONFIG_BLOCK
7cc01581
TH
13/* struct bio, bio_vec and BIO_* flags are defined in blk_types.h */
14#include <linux/blk_types.h>
15
1da177e4
LT
16#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
d84a8477 24#define BIO_MAX_PAGES 256
1da177e4 25
43b62ce3
MC
26#define bio_prio(bio) (bio)->bi_ioprio
27#define bio_set_prio(bio, prio) ((bio)->bi_ioprio = prio)
22e2c507 28
4550dd6c
KO
29#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)
7988613b 42
458b76ed
KO
43#define bio_multiple_segments(bio) \
44 ((bio)->bi_iter.bi_size != bio_iovec(bio).bv_len)
38a72dac
KO
45
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)
bf2de6f5 51
d3849953
CH
52/*
53 * Return the data direction, READ or WRITE.
54 */
55#define bio_data_dir(bio) \
56 (op_is_write(bio_op(bio)) ? WRITE : READ)
57
458b76ed
KO
58/*
59 * 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 &&
7afafc8a 65 bio_op(bio) != REQ_OP_DISCARD &&
a6f0788e
CK
66 bio_op(bio) != REQ_OP_SECURE_ERASE &&
67 bio_op(bio) != REQ_OP_WRITE_ZEROES)
458b76ed
KO
68 return true;
69
70 return false;
71}
72
95fe6c1a
MC
73static inline bool bio_no_advance_iter(struct bio *bio)
74{
7afafc8a
AH
75 return bio_op(bio) == REQ_OP_DISCARD ||
76 bio_op(bio) == REQ_OP_SECURE_ERASE ||
a6f0788e
CK
77 bio_op(bio) == REQ_OP_WRITE_SAME ||
78 bio_op(bio) == REQ_OP_WRITE_ZEROES;
95fe6c1a
MC
79}
80
458b76ed
KO
81static inline bool bio_mergeable(struct bio *bio)
82{
1eff9d32 83 if (bio->bi_opf & REQ_NOMERGE_FLAGS)
458b76ed
KO
84 return false;
85
86 return true;
87}
88
2e46e8b2 89static inline unsigned int bio_cur_bytes(struct bio *bio)
bf2de6f5 90{
458b76ed 91 if (bio_has_data(bio))
a4ad39b1 92 return bio_iovec(bio).bv_len;
fb2dce86 93 else /* dataless requests such as discard */
4f024f37 94 return bio->bi_iter.bi_size;
bf2de6f5
JA
95}
96
97static inline void *bio_data(struct bio *bio)
98{
458b76ed 99 if (bio_has_data(bio))
bf2de6f5
JA
100 return page_address(bio_page(bio)) + bio_offset(bio);
101
102 return NULL;
103}
1da177e4 104
0aa69fd3
CH
105static inline bool bio_full(struct bio *bio)
106{
107 return bio->bi_vcnt >= bio->bi_max_vecs;
108}
109
1200e07f
ML
110static inline bool bio_next_segment(const struct bio *bio,
111 struct bvec_iter_all *iter)
112{
113 if (iter->idx >= bio->bi_vcnt)
114 return false;
115
116 bvec_advance(&bio->bi_io_vec[iter->idx], iter);
117 return true;
118}
6dc4f100 119
d74c6d51
KO
120/*
121 * drivers should _never_ use the all version - the bio may have been split
122 * before it got to the driver and the driver won't own all of it
123 */
2b070cfe
CH
124#define bio_for_each_segment_all(bvl, bio, iter) \
125 for (bvl = bvec_init_iter_all(&iter); bio_next_segment((bio), &iter); )
d74c6d51 126
4550dd6c
KO
127static inline void bio_advance_iter(struct bio *bio, struct bvec_iter *iter,
128 unsigned bytes)
129{
130 iter->bi_sector += bytes >> 9;
131
7759eb23 132 if (bio_no_advance_iter(bio))
4550dd6c 133 iter->bi_size -= bytes;
7759eb23 134 else
4550dd6c 135 bvec_iter_advance(bio->bi_io_vec, iter, bytes);
b1fb2c52 136 /* TODO: It is reasonable to complete bio with error here. */
f9df1cd9
DM
137}
138
7988613b
KO
139#define __bio_for_each_segment(bvl, bio, iter, start) \
140 for (iter = (start); \
4550dd6c
KO
141 (iter).bi_size && \
142 ((bvl = bio_iter_iovec((bio), (iter))), 1); \
143 bio_advance_iter((bio), &(iter), (bvl).bv_len))
7988613b
KO
144
145#define bio_for_each_segment(bvl, bio, iter) \
146 __bio_for_each_segment(bvl, bio, iter, (bio)->bi_iter)
147
d18d9174
ML
148#define __bio_for_each_bvec(bvl, bio, iter, start) \
149 for (iter = (start); \
150 (iter).bi_size && \
151 ((bvl = mp_bvec_iter_bvec((bio)->bi_io_vec, (iter))), 1); \
152 bio_advance_iter((bio), &(iter), (bvl).bv_len))
153
154/* iterate over multi-page bvec */
155#define bio_for_each_bvec(bvl, bio, iter) \
156 __bio_for_each_bvec(bvl, bio, iter, (bio)->bi_iter)
157
4550dd6c 158#define bio_iter_last(bvec, iter) ((iter).bi_size == (bvec).bv_len)
1da177e4 159
f4595875 160static inline unsigned bio_segments(struct bio *bio)
458b76ed
KO
161{
162 unsigned segs = 0;
163 struct bio_vec bv;
164 struct bvec_iter iter;
165
8423ae3d 166 /*
a6f0788e
CK
167 * We special case discard/write same/write zeroes, because they
168 * interpret bi_size differently:
8423ae3d
KO
169 */
170
a6f0788e
CK
171 switch (bio_op(bio)) {
172 case REQ_OP_DISCARD:
173 case REQ_OP_SECURE_ERASE:
a6f0788e 174 case REQ_OP_WRITE_ZEROES:
f9d03f96
CH
175 return 0;
176 case REQ_OP_WRITE_SAME:
8423ae3d 177 return 1;
a6f0788e
CK
178 default:
179 break;
180 }
8423ae3d 181
f4595875 182 bio_for_each_segment(bv, bio, iter)
458b76ed
KO
183 segs++;
184
185 return segs;
186}
187
1da177e4
LT
188/*
189 * get a reference to a bio, so it won't disappear. the intended use is
190 * something like:
191 *
192 * bio_get(bio);
193 * submit_bio(rw, bio);
194 * if (bio->bi_flags ...)
195 * do_something
196 * bio_put(bio);
197 *
198 * without the bio_get(), it could potentially complete I/O before submit_bio
199 * returns. and then bio would be freed memory when if (bio->bi_flags ...)
200 * runs
201 */
dac56212
JA
202static inline void bio_get(struct bio *bio)
203{
204 bio->bi_flags |= (1 << BIO_REFFED);
205 smp_mb__before_atomic();
206 atomic_inc(&bio->__bi_cnt);
207}
208
209static inline void bio_cnt_set(struct bio *bio, unsigned int count)
210{
211 if (count != 1) {
212 bio->bi_flags |= (1 << BIO_REFFED);
f381c6a4 213 smp_mb();
dac56212
JA
214 }
215 atomic_set(&bio->__bi_cnt, count);
216}
1da177e4 217
b7c44ed9
JA
218static inline bool bio_flagged(struct bio *bio, unsigned int bit)
219{
2c68f6dc 220 return (bio->bi_flags & (1U << bit)) != 0;
b7c44ed9
JA
221}
222
223static inline void bio_set_flag(struct bio *bio, unsigned int bit)
224{
2c68f6dc 225 bio->bi_flags |= (1U << bit);
b7c44ed9
JA
226}
227
228static inline void bio_clear_flag(struct bio *bio, unsigned int bit)
229{
2c68f6dc 230 bio->bi_flags &= ~(1U << bit);
b7c44ed9
JA
231}
232
7bcd79ac
ML
233static inline void bio_get_first_bvec(struct bio *bio, struct bio_vec *bv)
234{
235 *bv = bio_iovec(bio);
236}
237
238static inline void bio_get_last_bvec(struct bio *bio, struct bio_vec *bv)
239{
240 struct bvec_iter iter = bio->bi_iter;
241 int idx;
242
7bcd79ac
ML
243 if (unlikely(!bio_multiple_segments(bio))) {
244 *bv = bio_iovec(bio);
245 return;
246 }
247
248 bio_advance_iter(bio, &iter, iter.bi_size);
249
250 if (!iter.bi_bvec_done)
251 idx = iter.bi_idx - 1;
252 else /* in the middle of bvec */
253 idx = iter.bi_idx;
254
255 *bv = bio->bi_io_vec[idx];
256
257 /*
258 * iter.bi_bvec_done records actual length of the last bvec
259 * if this bio ends in the middle of one io vector
260 */
261 if (iter.bi_bvec_done)
262 bv->bv_len = iter.bi_bvec_done;
263}
264
86292abc
ML
265static inline struct bio_vec *bio_first_bvec_all(struct bio *bio)
266{
267 WARN_ON_ONCE(bio_flagged(bio, BIO_CLONED));
268 return bio->bi_io_vec;
269}
270
271static inline struct page *bio_first_page_all(struct bio *bio)
272{
273 return bio_first_bvec_all(bio)->bv_page;
274}
275
276static inline struct bio_vec *bio_last_bvec_all(struct bio *bio)
277{
278 WARN_ON_ONCE(bio_flagged(bio, BIO_CLONED));
279 return &bio->bi_io_vec[bio->bi_vcnt - 1];
280}
281
c611529e
MP
282enum bip_flags {
283 BIP_BLOCK_INTEGRITY = 1 << 0, /* block layer owns integrity data */
284 BIP_MAPPED_INTEGRITY = 1 << 1, /* ref tag has been remapped */
285 BIP_CTRL_NOCHECK = 1 << 2, /* disable HBA integrity checking */
286 BIP_DISK_NOCHECK = 1 << 3, /* disable disk integrity checking */
287 BIP_IP_CHECKSUM = 1 << 4, /* IP checksum */
288};
289
7ba1ba12
MP
290/*
291 * bio integrity payload
292 */
293struct bio_integrity_payload {
294 struct bio *bip_bio; /* parent bio */
7ba1ba12 295
d57a5f7c 296 struct bvec_iter bip_iter;
7ba1ba12 297
7878cba9 298 unsigned short bip_slab; /* slab the bip came from */
7ba1ba12 299 unsigned short bip_vcnt; /* # of integrity bio_vecs */
cbcd1054 300 unsigned short bip_max_vcnt; /* integrity bio_vec slots */
b1f01388 301 unsigned short bip_flags; /* control flags */
7ba1ba12 302
7759eb23
ML
303 struct bvec_iter bio_iter; /* for rewinding parent bio */
304
7ba1ba12 305 struct work_struct bip_work; /* I/O completion */
6fda981c
KO
306
307 struct bio_vec *bip_vec;
308 struct bio_vec bip_inline_vecs[0];/* embedded bvec array */
7ba1ba12 309};
18593088 310
06c1e390
KB
311#if defined(CONFIG_BLK_DEV_INTEGRITY)
312
313static inline struct bio_integrity_payload *bio_integrity(struct bio *bio)
314{
1eff9d32 315 if (bio->bi_opf & REQ_INTEGRITY)
06c1e390
KB
316 return bio->bi_integrity;
317
318 return NULL;
319}
320
c611529e
MP
321static inline bool bio_integrity_flagged(struct bio *bio, enum bip_flags flag)
322{
323 struct bio_integrity_payload *bip = bio_integrity(bio);
324
325 if (bip)
326 return bip->bip_flags & flag;
327
328 return false;
329}
b1f01388 330
18593088
MP
331static inline sector_t bip_get_seed(struct bio_integrity_payload *bip)
332{
333 return bip->bip_iter.bi_sector;
334}
335
336static inline void bip_set_seed(struct bio_integrity_payload *bip,
337 sector_t seed)
338{
339 bip->bip_iter.bi_sector = seed;
340}
341
7ba1ba12 342#endif /* CONFIG_BLK_DEV_INTEGRITY */
1da177e4 343
6678d83f 344extern void bio_trim(struct bio *bio, int offset, int size);
20d0189b
KO
345extern struct bio *bio_split(struct bio *bio, int sectors,
346 gfp_t gfp, struct bio_set *bs);
347
348/**
349 * bio_next_split - get next @sectors from a bio, splitting if necessary
350 * @bio: bio to split
351 * @sectors: number of sectors to split from the front of @bio
352 * @gfp: gfp mask
353 * @bs: bio set to allocate from
354 *
355 * Returns a bio representing the next @sectors of @bio - if the bio is smaller
356 * than @sectors, returns the original bio unchanged.
357 */
358static inline struct bio *bio_next_split(struct bio *bio, int sectors,
359 gfp_t gfp, struct bio_set *bs)
360{
361 if (sectors >= bio_sectors(bio))
362 return bio;
363
364 return bio_split(bio, sectors, gfp, bs);
365}
366
011067b0
N
367enum {
368 BIOSET_NEED_BVECS = BIT(0),
47e0fb46 369 BIOSET_NEED_RESCUER = BIT(1),
011067b0 370};
dad08527
KO
371extern int bioset_init(struct bio_set *, unsigned int, unsigned int, int flags);
372extern void bioset_exit(struct bio_set *);
8aa6ba2f 373extern int biovec_init_pool(mempool_t *pool, int pool_entries);
28e89fd9 374extern int bioset_init_from_src(struct bio_set *bs, struct bio_set *src);
1da177e4 375
7a88fa19 376extern struct bio *bio_alloc_bioset(gfp_t, unsigned int, struct bio_set *);
1da177e4
LT
377extern void bio_put(struct bio *);
378
59d276fe
KO
379extern void __bio_clone_fast(struct bio *, struct bio *);
380extern struct bio *bio_clone_fast(struct bio *, gfp_t, struct bio_set *);
bf800ef1 381
f4f8154a 382extern struct bio_set fs_bio_set;
3f86a82a
KO
383
384static inline struct bio *bio_alloc(gfp_t gfp_mask, unsigned int nr_iovecs)
385{
f4f8154a 386 return bio_alloc_bioset(gfp_mask, nr_iovecs, &fs_bio_set);
3f86a82a
KO
387}
388
389static inline struct bio *bio_kmalloc(gfp_t gfp_mask, unsigned int nr_iovecs)
390{
391 return bio_alloc_bioset(gfp_mask, nr_iovecs, NULL);
392}
393
1e3914d4
CH
394extern blk_qc_t submit_bio(struct bio *);
395
4246a0b6
CH
396extern void bio_endio(struct bio *);
397
398static inline void bio_io_error(struct bio *bio)
399{
4e4cbee9 400 bio->bi_status = BLK_STS_IOERR;
4246a0b6
CH
401 bio_endio(bio);
402}
403
03a07c92
GR
404static inline void bio_wouldblock_error(struct bio *bio)
405{
406 bio->bi_status = BLK_STS_AGAIN;
4246a0b6
CH
407 bio_endio(bio);
408}
409
1da177e4
LT
410struct request_queue;
411extern int bio_phys_segments(struct request_queue *, struct bio *);
1da177e4 412
4e49ea4a 413extern int submit_bio_wait(struct bio *bio);
054bdf64
KO
414extern void bio_advance(struct bio *, unsigned);
415
3a83f467
ML
416extern void bio_init(struct bio *bio, struct bio_vec *table,
417 unsigned short max_vecs);
9ae3b3f5 418extern void bio_uninit(struct bio *);
f44b48c7 419extern void bio_reset(struct bio *);
196d38bc 420void bio_chain(struct bio *, struct bio *);
1da177e4
LT
421
422extern int bio_add_page(struct bio *, struct page *, unsigned int,unsigned int);
6e68af66
MC
423extern int bio_add_pc_page(struct request_queue *, struct bio *, struct page *,
424 unsigned int, unsigned int);
0aa69fd3 425bool __bio_try_merge_page(struct bio *bio, struct page *page,
ff896738 426 unsigned int len, unsigned int off, bool *same_page);
0aa69fd3
CH
427void __bio_add_page(struct bio *bio, struct page *page,
428 unsigned int len, unsigned int off);
2cefe4db 429int bio_iov_iter_get_pages(struct bio *bio, struct iov_iter *iter);
152e283f 430struct rq_map_data;
f1970baf 431extern struct bio *bio_map_user_iov(struct request_queue *,
e81cef5d 432 struct iov_iter *, gfp_t);
1da177e4 433extern void bio_unmap_user(struct bio *);
df46b9a4 434extern struct bio *bio_map_kern(struct request_queue *, void *, unsigned int,
27496a8c 435 gfp_t);
68154e90
FT
436extern struct bio *bio_copy_kern(struct request_queue *, void *, unsigned int,
437 gfp_t, int);
1da177e4
LT
438extern void bio_set_pages_dirty(struct bio *bio);
439extern void bio_check_pages_dirty(struct bio *bio);
2d4dc890 440
ddcf35d3 441void generic_start_io_acct(struct request_queue *q, int op,
d62e26b3 442 unsigned long sectors, struct hd_struct *part);
ddcf35d3 443void generic_end_io_acct(struct request_queue *q, int op,
d62e26b3
JA
444 struct hd_struct *part,
445 unsigned long start_time);
394ffa50 446
2d4dc890
IL
447#ifndef ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
448# error "You should define ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE for your platform"
449#endif
450#if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
451extern void bio_flush_dcache_pages(struct bio *bi);
452#else
453static inline void bio_flush_dcache_pages(struct bio *bi)
454{
455}
456#endif
457
45db54d5
KO
458extern void bio_copy_data_iter(struct bio *dst, struct bvec_iter *dst_iter,
459 struct bio *src, struct bvec_iter *src_iter);
16ac3d63 460extern void bio_copy_data(struct bio *dst, struct bio *src);
45db54d5 461extern void bio_list_copy_data(struct bio *dst, struct bio *src);
491221f8 462extern void bio_free_pages(struct bio *bio);
16ac3d63 463
152e283f 464extern struct bio *bio_copy_user_iov(struct request_queue *,
86d564c8 465 struct rq_map_data *,
e81cef5d 466 struct iov_iter *,
26e49cfc 467 gfp_t);
1da177e4 468extern int bio_uncopy_user(struct bio *);
38a72dac
KO
469void zero_fill_bio_iter(struct bio *bio, struct bvec_iter iter);
470
471static inline void zero_fill_bio(struct bio *bio)
472{
473 zero_fill_bio_iter(bio, bio->bi_iter);
474}
475
9f060e22
KO
476extern struct bio_vec *bvec_alloc(gfp_t, int, unsigned long *, mempool_t *);
477extern void bvec_free(mempool_t *, struct bio_vec *, unsigned int);
7ba1ba12 478extern unsigned int bvec_nr_vecs(unsigned short idx);
9c0fb1e3 479extern const char *bio_devname(struct bio *bio, char *buffer);
51d654e1 480
74d46992
CH
481#define bio_set_dev(bio, bdev) \
482do { \
111be883
SL
483 if ((bio)->bi_disk != (bdev)->bd_disk) \
484 bio_clear_flag(bio, BIO_THROTTLED);\
74d46992
CH
485 (bio)->bi_disk = (bdev)->bd_disk; \
486 (bio)->bi_partno = (bdev)->bd_partno; \
5cdf2e3f 487 bio_associate_blkg(bio); \
74d46992
CH
488} while (0)
489
490#define bio_copy_dev(dst, src) \
491do { \
492 (dst)->bi_disk = (src)->bi_disk; \
493 (dst)->bi_partno = (src)->bi_partno; \
db6638d7 494 bio_clone_blkg_association(dst, src); \
74d46992
CH
495} while (0)
496
497#define bio_dev(bio) \
498 disk_devt((bio)->bi_disk)
499
0d3bd88d 500#if defined(CONFIG_MEMCG) && defined(CONFIG_BLK_CGROUP)
6a7f6d86 501void bio_associate_blkg_from_page(struct bio *bio, struct page *page);
0d3bd88d 502#else
6a7f6d86
DZ
503static inline void bio_associate_blkg_from_page(struct bio *bio,
504 struct page *page) { }
0d3bd88d
TH
505#endif
506
852c788f 507#ifdef CONFIG_BLK_CGROUP
2268c0fe
DZ
508void bio_disassociate_blkg(struct bio *bio);
509void bio_associate_blkg(struct bio *bio);
fd42df30
DZ
510void bio_associate_blkg_from_css(struct bio *bio,
511 struct cgroup_subsys_state *css);
db6638d7 512void bio_clone_blkg_association(struct bio *dst, struct bio *src);
852c788f 513#else /* CONFIG_BLK_CGROUP */
2268c0fe
DZ
514static inline void bio_disassociate_blkg(struct bio *bio) { }
515static inline void bio_associate_blkg(struct bio *bio) { }
fd42df30
DZ
516static inline void bio_associate_blkg_from_css(struct bio *bio,
517 struct cgroup_subsys_state *css)
518{ }
db6638d7
DZ
519static inline void bio_clone_blkg_association(struct bio *dst,
520 struct bio *src) { }
852c788f
TH
521#endif /* CONFIG_BLK_CGROUP */
522
1da177e4
LT
523#ifdef CONFIG_HIGHMEM
524/*
20b636bf
AB
525 * remember never ever reenable interrupts between a bvec_kmap_irq and
526 * bvec_kunmap_irq!
1da177e4 527 */
4f570f99 528static inline char *bvec_kmap_irq(struct bio_vec *bvec, unsigned long *flags)
1da177e4
LT
529{
530 unsigned long addr;
531
532 /*
533 * might not be a highmem page, but the preempt/irq count
534 * balancing is a lot nicer this way
535 */
536 local_irq_save(*flags);
e8e3c3d6 537 addr = (unsigned long) kmap_atomic(bvec->bv_page);
1da177e4
LT
538
539 BUG_ON(addr & ~PAGE_MASK);
540
541 return (char *) addr + bvec->bv_offset;
542}
543
4f570f99 544static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags)
1da177e4
LT
545{
546 unsigned long ptr = (unsigned long) buffer & PAGE_MASK;
547
e8e3c3d6 548 kunmap_atomic((void *) ptr);
1da177e4
LT
549 local_irq_restore(*flags);
550}
551
552#else
11a691be
GU
553static inline char *bvec_kmap_irq(struct bio_vec *bvec, unsigned long *flags)
554{
555 return page_address(bvec->bv_page) + bvec->bv_offset;
556}
557
558static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags)
559{
560 *flags = 0;
561}
1da177e4
LT
562#endif
563
8f3d8ba2 564/*
e686307f 565 * BIO list management for use by remapping drivers (e.g. DM or MD) and loop.
8f3d8ba2
CH
566 *
567 * A bio_list anchors a singly-linked list of bios chained through the bi_next
568 * member of the bio. The bio_list also caches the last list member to allow
569 * fast access to the tail.
570 */
571struct bio_list {
572 struct bio *head;
573 struct bio *tail;
574};
575
576static inline int bio_list_empty(const struct bio_list *bl)
577{
578 return bl->head == NULL;
579}
580
581static inline void bio_list_init(struct bio_list *bl)
582{
583 bl->head = bl->tail = NULL;
584}
585
320ae51f
JA
586#define BIO_EMPTY_LIST { NULL, NULL }
587
8f3d8ba2
CH
588#define bio_list_for_each(bio, bl) \
589 for (bio = (bl)->head; bio; bio = bio->bi_next)
590
591static inline unsigned bio_list_size(const struct bio_list *bl)
592{
593 unsigned sz = 0;
594 struct bio *bio;
595
596 bio_list_for_each(bio, bl)
597 sz++;
598
599 return sz;
600}
601
602static inline void bio_list_add(struct bio_list *bl, struct bio *bio)
603{
604 bio->bi_next = NULL;
605
606 if (bl->tail)
607 bl->tail->bi_next = bio;
608 else
609 bl->head = bio;
610
611 bl->tail = bio;
612}
613
614static inline void bio_list_add_head(struct bio_list *bl, struct bio *bio)
615{
616 bio->bi_next = bl->head;
617
618 bl->head = bio;
619
620 if (!bl->tail)
621 bl->tail = bio;
622}
623
624static inline void bio_list_merge(struct bio_list *bl, struct bio_list *bl2)
625{
626 if (!bl2->head)
627 return;
628
629 if (bl->tail)
630 bl->tail->bi_next = bl2->head;
631 else
632 bl->head = bl2->head;
633
634 bl->tail = bl2->tail;
635}
636
637static inline void bio_list_merge_head(struct bio_list *bl,
638 struct bio_list *bl2)
639{
640 if (!bl2->head)
641 return;
642
643 if (bl->head)
644 bl2->tail->bi_next = bl->head;
645 else
646 bl->tail = bl2->tail;
647
648 bl->head = bl2->head;
649}
650
13685a16
GU
651static inline struct bio *bio_list_peek(struct bio_list *bl)
652{
653 return bl->head;
654}
655
8f3d8ba2
CH
656static inline struct bio *bio_list_pop(struct bio_list *bl)
657{
658 struct bio *bio = bl->head;
659
660 if (bio) {
661 bl->head = bl->head->bi_next;
662 if (!bl->head)
663 bl->tail = NULL;
664
665 bio->bi_next = NULL;
666 }
667
668 return bio;
669}
670
671static inline struct bio *bio_list_get(struct bio_list *bl)
672{
673 struct bio *bio = bl->head;
674
675 bl->head = bl->tail = NULL;
676
677 return bio;
678}
679
0ef5a50c
MS
680/*
681 * Increment chain count for the bio. Make sure the CHAIN flag update
682 * is visible before the raised count.
683 */
684static inline void bio_inc_remaining(struct bio *bio)
685{
686 bio_set_flag(bio, BIO_CHAIN);
687 smp_mb__before_atomic();
688 atomic_inc(&bio->__bi_remaining);
689}
690
57fb233f
KO
691/*
692 * bio_set is used to allow other portions of the IO system to
693 * allocate their own private memory pools for bio and iovec structures.
694 * These memory pools in turn all allocate from the bio_slab
695 * and the bvec_slabs[].
696 */
697#define BIO_POOL_SIZE 2
57fb233f
KO
698
699struct bio_set {
700 struct kmem_cache *bio_slab;
701 unsigned int front_pad;
702
8aa6ba2f
KO
703 mempool_t bio_pool;
704 mempool_t bvec_pool;
57fb233f 705#if defined(CONFIG_BLK_DEV_INTEGRITY)
8aa6ba2f
KO
706 mempool_t bio_integrity_pool;
707 mempool_t bvec_integrity_pool;
57fb233f 708#endif
df2cb6da
KO
709
710 /*
711 * Deadlock avoidance for stacking block drivers: see comments in
712 * bio_alloc_bioset() for details
713 */
714 spinlock_t rescue_lock;
715 struct bio_list rescue_list;
716 struct work_struct rescue_work;
717 struct workqueue_struct *rescue_workqueue;
57fb233f
KO
718};
719
720struct biovec_slab {
721 int nr_vecs;
722 char *name;
723 struct kmem_cache *slab;
724};
725
338aa96d
KO
726static inline bool bioset_initialized(struct bio_set *bs)
727{
728 return bs->bio_slab != NULL;
729}
730
57fb233f
KO
731/*
732 * a small number of entries is fine, not going to be performance critical.
733 * basically we just need to survive
734 */
735#define BIO_SPLIT_ENTRIES 2
736
7ba1ba12
MP
737#if defined(CONFIG_BLK_DEV_INTEGRITY)
738
d57a5f7c
KO
739#define bip_for_each_vec(bvl, bip, iter) \
740 for_each_bvec(bvl, (bip)->bip_vec, iter, (bip)->bip_iter)
7ba1ba12 741
13f05c8d
MP
742#define bio_for_each_integrity_vec(_bvl, _bio, _iter) \
743 for_each_bio(_bio) \
744 bip_for_each_vec(_bvl, _bio->bi_integrity, _iter)
745
7ba1ba12 746extern struct bio_integrity_payload *bio_integrity_alloc(struct bio *, gfp_t, unsigned int);
7ba1ba12 747extern int bio_integrity_add_page(struct bio *, struct page *, unsigned int, unsigned int);
e23947bd 748extern bool bio_integrity_prep(struct bio *);
7ba1ba12 749extern void bio_integrity_advance(struct bio *, unsigned int);
fbd08e76 750extern void bio_integrity_trim(struct bio *);
1e2a410f 751extern int bio_integrity_clone(struct bio *, struct bio *, gfp_t);
7878cba9
MP
752extern int bioset_integrity_create(struct bio_set *, int);
753extern void bioset_integrity_free(struct bio_set *);
754extern void bio_integrity_init(void);
7ba1ba12
MP
755
756#else /* CONFIG_BLK_DEV_INTEGRITY */
757
c611529e 758static inline void *bio_integrity(struct bio *bio)
6898e3bd 759{
c611529e 760 return NULL;
6898e3bd
MP
761}
762
6898e3bd
MP
763static inline int bioset_integrity_create(struct bio_set *bs, int pool_size)
764{
765 return 0;
766}
767
768static inline void bioset_integrity_free (struct bio_set *bs)
769{
770 return;
771}
772
e23947bd 773static inline bool bio_integrity_prep(struct bio *bio)
6898e3bd 774{
e23947bd 775 return true;
6898e3bd
MP
776}
777
0c614e2d 778static inline int bio_integrity_clone(struct bio *bio, struct bio *bio_src,
1e2a410f 779 gfp_t gfp_mask)
0c614e2d
SR
780{
781 return 0;
782}
6898e3bd 783
6898e3bd
MP
784static inline void bio_integrity_advance(struct bio *bio,
785 unsigned int bytes_done)
786{
787 return;
788}
789
fbd08e76 790static inline void bio_integrity_trim(struct bio *bio)
6898e3bd
MP
791{
792 return;
793}
794
795static inline void bio_integrity_init(void)
796{
797 return;
798}
7ba1ba12 799
c611529e
MP
800static inline bool bio_integrity_flagged(struct bio *bio, enum bip_flags flag)
801{
802 return false;
803}
804
06c1e390
KB
805static inline void *bio_integrity_alloc(struct bio * bio, gfp_t gfp,
806 unsigned int nr)
807{
808 return ERR_PTR(-EINVAL);
809}
810
811static inline int bio_integrity_add_page(struct bio *bio, struct page *page,
812 unsigned int len, unsigned int offset)
813{
814 return 0;
815}
816
7ba1ba12
MP
817#endif /* CONFIG_BLK_DEV_INTEGRITY */
818
0bbb280d
JA
819/*
820 * Mark a bio as polled. Note that for async polled IO, the caller must
821 * expect -EWOULDBLOCK if we cannot allocate a request (or other resources).
822 * We cannot block waiting for requests on polled IO, as those completions
823 * must be found by the caller. This is different than IRQ driven IO, where
824 * it's safe to wait for IO to complete.
825 */
826static inline void bio_set_polled(struct bio *bio, struct kiocb *kiocb)
827{
828 bio->bi_opf |= REQ_HIPRI;
829 if (!is_sync_kiocb(kiocb))
830 bio->bi_opf |= REQ_NOWAIT;
831}
832
02a5e0ac 833#endif /* CONFIG_BLOCK */
1da177e4 834#endif /* __LINUX_BIO_H */