]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blob - include/linux/bio.h
ipv6: initialize route null entry in addrconf_init()
[mirror_ubuntu-artful-kernel.git] / include / linux / bio.h
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
12 *
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>
25 #include <linux/ioprio.h>
26 #include <linux/bug.h>
27
28 #ifdef CONFIG_BLOCK
29
30 #include <asm/io.h>
31
32 /* struct bio, bio_vec and BIO_* flags are defined in blk_types.h */
33 #include <linux/blk_types.h>
34
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
43 #define BIO_MAX_PAGES 256
44 #define BIO_MAX_SIZE (BIO_MAX_PAGES << PAGE_CACHE_SHIFT)
45 #define BIO_MAX_SECTORS (BIO_MAX_SIZE >> 9)
46
47 /*
48 * upper 16 bits of bi_rw define the io priority of this bio
49 */
50 #define BIO_PRIO_SHIFT (8 * sizeof(unsigned long) - IOPRIO_BITS)
51 #define bio_prio(bio) ((bio)->bi_rw >> BIO_PRIO_SHIFT)
52 #define bio_prio_valid(bio) ioprio_valid(bio_prio(bio))
53
54 #define bio_set_prio(bio, prio) do { \
55 WARN_ON(prio >= (1 << IOPRIO_BITS)); \
56 (bio)->bi_rw &= ((1UL << BIO_PRIO_SHIFT) - 1); \
57 (bio)->bi_rw |= ((unsigned long) (prio) << BIO_PRIO_SHIFT); \
58 } while (0)
59
60 /*
61 * various member access, note that bio_data should of course not be used
62 * on highmem page vectors
63 */
64 #define __bvec_iter_bvec(bvec, iter) (&(bvec)[(iter).bi_idx])
65
66 #define bvec_iter_page(bvec, iter) \
67 (__bvec_iter_bvec((bvec), (iter))->bv_page)
68
69 #define bvec_iter_len(bvec, iter) \
70 min((iter).bi_size, \
71 __bvec_iter_bvec((bvec), (iter))->bv_len - (iter).bi_bvec_done)
72
73 #define bvec_iter_offset(bvec, iter) \
74 (__bvec_iter_bvec((bvec), (iter))->bv_offset + (iter).bi_bvec_done)
75
76 #define bvec_iter_bvec(bvec, iter) \
77 ((struct bio_vec) { \
78 .bv_page = bvec_iter_page((bvec), (iter)), \
79 .bv_len = bvec_iter_len((bvec), (iter)), \
80 .bv_offset = bvec_iter_offset((bvec), (iter)), \
81 })
82
83 #define bio_iter_iovec(bio, iter) \
84 bvec_iter_bvec((bio)->bi_io_vec, (iter))
85
86 #define bio_iter_page(bio, iter) \
87 bvec_iter_page((bio)->bi_io_vec, (iter))
88 #define bio_iter_len(bio, iter) \
89 bvec_iter_len((bio)->bi_io_vec, (iter))
90 #define bio_iter_offset(bio, iter) \
91 bvec_iter_offset((bio)->bi_io_vec, (iter))
92
93 #define bio_page(bio) bio_iter_page((bio), (bio)->bi_iter)
94 #define bio_offset(bio) bio_iter_offset((bio), (bio)->bi_iter)
95 #define bio_iovec(bio) bio_iter_iovec((bio), (bio)->bi_iter)
96
97 #define bio_multiple_segments(bio) \
98 ((bio)->bi_iter.bi_size != bio_iovec(bio).bv_len)
99 #define bio_sectors(bio) ((bio)->bi_iter.bi_size >> 9)
100 #define bio_end_sector(bio) ((bio)->bi_iter.bi_sector + bio_sectors((bio)))
101
102 /*
103 * Check whether this bio carries any data or not. A NULL bio is allowed.
104 */
105 static inline bool bio_has_data(struct bio *bio)
106 {
107 if (bio &&
108 bio->bi_iter.bi_size &&
109 !(bio->bi_rw & REQ_DISCARD))
110 return true;
111
112 return false;
113 }
114
115 static inline bool bio_is_rw(struct bio *bio)
116 {
117 if (!bio_has_data(bio))
118 return false;
119
120 if (bio->bi_rw & BIO_NO_ADVANCE_ITER_MASK)
121 return false;
122
123 return true;
124 }
125
126 static inline bool bio_mergeable(struct bio *bio)
127 {
128 if (bio->bi_rw & REQ_NOMERGE_FLAGS)
129 return false;
130
131 return true;
132 }
133
134 static inline unsigned int bio_cur_bytes(struct bio *bio)
135 {
136 if (bio_has_data(bio))
137 return bio_iovec(bio).bv_len;
138 else /* dataless requests such as discard */
139 return bio->bi_iter.bi_size;
140 }
141
142 static inline void *bio_data(struct bio *bio)
143 {
144 if (bio_has_data(bio))
145 return page_address(bio_page(bio)) + bio_offset(bio);
146
147 return NULL;
148 }
149
150 /*
151 * will die
152 */
153 #define bio_to_phys(bio) (page_to_phys(bio_page((bio))) + (unsigned long) bio_offset((bio)))
154 #define bvec_to_phys(bv) (page_to_phys((bv)->bv_page) + (unsigned long) (bv)->bv_offset)
155
156 /*
157 * queues that have highmem support enabled may still need to revert to
158 * PIO transfers occasionally and thus map high pages temporarily. For
159 * permanent PIO fall back, user is probably better off disabling highmem
160 * I/O completely on that queue (see ide-dma for example)
161 */
162 #define __bio_kmap_atomic(bio, iter) \
163 (kmap_atomic(bio_iter_iovec((bio), (iter)).bv_page) + \
164 bio_iter_iovec((bio), (iter)).bv_offset)
165
166 #define __bio_kunmap_atomic(addr) kunmap_atomic(addr)
167
168 /*
169 * merge helpers etc
170 */
171
172 /* Default implementation of BIOVEC_PHYS_MERGEABLE */
173 #define __BIOVEC_PHYS_MERGEABLE(vec1, vec2) \
174 ((bvec_to_phys((vec1)) + (vec1)->bv_len) == bvec_to_phys((vec2)))
175
176 /*
177 * allow arch override, for eg virtualized architectures (put in asm/io.h)
178 */
179 #ifndef BIOVEC_PHYS_MERGEABLE
180 #define BIOVEC_PHYS_MERGEABLE(vec1, vec2) \
181 __BIOVEC_PHYS_MERGEABLE(vec1, vec2)
182 #endif
183
184 #define __BIO_SEG_BOUNDARY(addr1, addr2, mask) \
185 (((addr1) | (mask)) == (((addr2) - 1) | (mask)))
186 #define BIOVEC_SEG_BOUNDARY(q, b1, b2) \
187 __BIO_SEG_BOUNDARY(bvec_to_phys((b1)), bvec_to_phys((b2)) + (b2)->bv_len, queue_segment_boundary((q)))
188
189 /*
190 * drivers should _never_ use the all version - the bio may have been split
191 * before it got to the driver and the driver won't own all of it
192 */
193 #define bio_for_each_segment_all(bvl, bio, i) \
194 for (i = 0, bvl = (bio)->bi_io_vec; i < (bio)->bi_vcnt; i++, bvl++)
195
196 static inline void bvec_iter_advance(struct bio_vec *bv, struct bvec_iter *iter,
197 unsigned bytes)
198 {
199 WARN_ONCE(bytes > iter->bi_size,
200 "Attempted to advance past end of bvec iter\n");
201
202 while (bytes) {
203 unsigned len = min(bytes, bvec_iter_len(bv, *iter));
204
205 bytes -= len;
206 iter->bi_size -= len;
207 iter->bi_bvec_done += len;
208
209 if (iter->bi_bvec_done == __bvec_iter_bvec(bv, *iter)->bv_len) {
210 iter->bi_bvec_done = 0;
211 iter->bi_idx++;
212 }
213 }
214 }
215
216 #define for_each_bvec(bvl, bio_vec, iter, start) \
217 for (iter = (start); \
218 (iter).bi_size && \
219 ((bvl = bvec_iter_bvec((bio_vec), (iter))), 1); \
220 bvec_iter_advance((bio_vec), &(iter), (bvl).bv_len))
221
222
223 static inline void bio_advance_iter(struct bio *bio, struct bvec_iter *iter,
224 unsigned bytes)
225 {
226 iter->bi_sector += bytes >> 9;
227
228 if (bio->bi_rw & BIO_NO_ADVANCE_ITER_MASK)
229 iter->bi_size -= bytes;
230 else
231 bvec_iter_advance(bio->bi_io_vec, iter, bytes);
232 }
233
234 #define __bio_for_each_segment(bvl, bio, iter, start) \
235 for (iter = (start); \
236 (iter).bi_size && \
237 ((bvl = bio_iter_iovec((bio), (iter))), 1); \
238 bio_advance_iter((bio), &(iter), (bvl).bv_len))
239
240 #define bio_for_each_segment(bvl, bio, iter) \
241 __bio_for_each_segment(bvl, bio, iter, (bio)->bi_iter)
242
243 #define bio_iter_last(bvec, iter) ((iter).bi_size == (bvec).bv_len)
244
245 static inline unsigned bio_segments(struct bio *bio)
246 {
247 unsigned segs = 0;
248 struct bio_vec bv;
249 struct bvec_iter iter;
250
251 /*
252 * We special case discard/write same, because they interpret bi_size
253 * differently:
254 */
255
256 if (bio->bi_rw & REQ_DISCARD)
257 return 1;
258
259 if (bio->bi_rw & REQ_WRITE_SAME)
260 return 1;
261
262 bio_for_each_segment(bv, bio, iter)
263 segs++;
264
265 return segs;
266 }
267
268 /*
269 * get a reference to a bio, so it won't disappear. the intended use is
270 * something like:
271 *
272 * bio_get(bio);
273 * submit_bio(rw, bio);
274 * if (bio->bi_flags ...)
275 * do_something
276 * bio_put(bio);
277 *
278 * without the bio_get(), it could potentially complete I/O before submit_bio
279 * returns. and then bio would be freed memory when if (bio->bi_flags ...)
280 * runs
281 */
282 static inline void bio_get(struct bio *bio)
283 {
284 bio->bi_flags |= (1 << BIO_REFFED);
285 smp_mb__before_atomic();
286 atomic_inc(&bio->__bi_cnt);
287 }
288
289 static inline void bio_cnt_set(struct bio *bio, unsigned int count)
290 {
291 if (count != 1) {
292 bio->bi_flags |= (1 << BIO_REFFED);
293 smp_mb__before_atomic();
294 }
295 atomic_set(&bio->__bi_cnt, count);
296 }
297
298 static inline bool bio_flagged(struct bio *bio, unsigned int bit)
299 {
300 return (bio->bi_flags & (1U << bit)) != 0;
301 }
302
303 static inline void bio_set_flag(struct bio *bio, unsigned int bit)
304 {
305 bio->bi_flags |= (1U << bit);
306 }
307
308 static inline void bio_clear_flag(struct bio *bio, unsigned int bit)
309 {
310 bio->bi_flags &= ~(1U << bit);
311 }
312
313 static inline void bio_get_first_bvec(struct bio *bio, struct bio_vec *bv)
314 {
315 *bv = bio_iovec(bio);
316 }
317
318 static inline void bio_get_last_bvec(struct bio *bio, struct bio_vec *bv)
319 {
320 struct bvec_iter iter = bio->bi_iter;
321 int idx;
322
323 if (unlikely(!bio_multiple_segments(bio))) {
324 *bv = bio_iovec(bio);
325 return;
326 }
327
328 bio_advance_iter(bio, &iter, iter.bi_size);
329
330 if (!iter.bi_bvec_done)
331 idx = iter.bi_idx - 1;
332 else /* in the middle of bvec */
333 idx = iter.bi_idx;
334
335 *bv = bio->bi_io_vec[idx];
336
337 /*
338 * iter.bi_bvec_done records actual length of the last bvec
339 * if this bio ends in the middle of one io vector
340 */
341 if (iter.bi_bvec_done)
342 bv->bv_len = iter.bi_bvec_done;
343 }
344
345 enum bip_flags {
346 BIP_BLOCK_INTEGRITY = 1 << 0, /* block layer owns integrity data */
347 BIP_MAPPED_INTEGRITY = 1 << 1, /* ref tag has been remapped */
348 BIP_CTRL_NOCHECK = 1 << 2, /* disable HBA integrity checking */
349 BIP_DISK_NOCHECK = 1 << 3, /* disable disk integrity checking */
350 BIP_IP_CHECKSUM = 1 << 4, /* IP checksum */
351 };
352
353 /*
354 * bio integrity payload
355 */
356 struct bio_integrity_payload {
357 struct bio *bip_bio; /* parent bio */
358
359 struct bvec_iter bip_iter;
360
361 bio_end_io_t *bip_end_io; /* saved I/O completion fn */
362
363 unsigned short bip_slab; /* slab the bip came from */
364 unsigned short bip_vcnt; /* # of integrity bio_vecs */
365 unsigned short bip_max_vcnt; /* integrity bio_vec slots */
366 unsigned short bip_flags; /* control flags */
367
368 struct work_struct bip_work; /* I/O completion */
369
370 struct bio_vec *bip_vec;
371 struct bio_vec bip_inline_vecs[0];/* embedded bvec array */
372 };
373
374 #if defined(CONFIG_BLK_DEV_INTEGRITY)
375
376 static inline struct bio_integrity_payload *bio_integrity(struct bio *bio)
377 {
378 if (bio->bi_rw & REQ_INTEGRITY)
379 return bio->bi_integrity;
380
381 return NULL;
382 }
383
384 static inline bool bio_integrity_flagged(struct bio *bio, enum bip_flags flag)
385 {
386 struct bio_integrity_payload *bip = bio_integrity(bio);
387
388 if (bip)
389 return bip->bip_flags & flag;
390
391 return false;
392 }
393
394 static inline sector_t bip_get_seed(struct bio_integrity_payload *bip)
395 {
396 return bip->bip_iter.bi_sector;
397 }
398
399 static inline void bip_set_seed(struct bio_integrity_payload *bip,
400 sector_t seed)
401 {
402 bip->bip_iter.bi_sector = seed;
403 }
404
405 #endif /* CONFIG_BLK_DEV_INTEGRITY */
406
407 extern void bio_trim(struct bio *bio, int offset, int size);
408 extern struct bio *bio_split(struct bio *bio, int sectors,
409 gfp_t gfp, struct bio_set *bs);
410
411 /**
412 * bio_next_split - get next @sectors from a bio, splitting if necessary
413 * @bio: bio to split
414 * @sectors: number of sectors to split from the front of @bio
415 * @gfp: gfp mask
416 * @bs: bio set to allocate from
417 *
418 * Returns a bio representing the next @sectors of @bio - if the bio is smaller
419 * than @sectors, returns the original bio unchanged.
420 */
421 static inline struct bio *bio_next_split(struct bio *bio, int sectors,
422 gfp_t gfp, struct bio_set *bs)
423 {
424 if (sectors >= bio_sectors(bio))
425 return bio;
426
427 return bio_split(bio, sectors, gfp, bs);
428 }
429
430 extern struct bio_set *bioset_create(unsigned int, unsigned int);
431 extern struct bio_set *bioset_create_nobvec(unsigned int, unsigned int);
432 extern void bioset_free(struct bio_set *);
433 extern mempool_t *biovec_create_pool(int pool_entries);
434
435 extern struct bio *bio_alloc_bioset(gfp_t, int, struct bio_set *);
436 extern void bio_put(struct bio *);
437
438 extern void __bio_clone_fast(struct bio *, struct bio *);
439 extern struct bio *bio_clone_fast(struct bio *, gfp_t, struct bio_set *);
440 extern struct bio *bio_clone_bioset(struct bio *, gfp_t, struct bio_set *bs);
441
442 extern struct bio_set *fs_bio_set;
443
444 static inline struct bio *bio_alloc(gfp_t gfp_mask, unsigned int nr_iovecs)
445 {
446 return bio_alloc_bioset(gfp_mask, nr_iovecs, fs_bio_set);
447 }
448
449 static inline struct bio *bio_clone(struct bio *bio, gfp_t gfp_mask)
450 {
451 return bio_clone_bioset(bio, gfp_mask, fs_bio_set);
452 }
453
454 static inline struct bio *bio_kmalloc(gfp_t gfp_mask, unsigned int nr_iovecs)
455 {
456 return bio_alloc_bioset(gfp_mask, nr_iovecs, NULL);
457 }
458
459 static inline struct bio *bio_clone_kmalloc(struct bio *bio, gfp_t gfp_mask)
460 {
461 return bio_clone_bioset(bio, gfp_mask, NULL);
462
463 }
464
465 extern void bio_endio(struct bio *);
466
467 static inline void bio_io_error(struct bio *bio)
468 {
469 bio->bi_error = -EIO;
470 bio_endio(bio);
471 }
472
473 struct request_queue;
474 extern int bio_phys_segments(struct request_queue *, struct bio *);
475
476 extern int submit_bio_wait(int rw, struct bio *bio);
477 extern void bio_advance(struct bio *, unsigned);
478
479 extern void bio_init(struct bio *);
480 extern void bio_reset(struct bio *);
481 void bio_chain(struct bio *, struct bio *);
482
483 extern int bio_add_page(struct bio *, struct page *, unsigned int,unsigned int);
484 extern int bio_add_pc_page(struct request_queue *, struct bio *, struct page *,
485 unsigned int, unsigned int);
486 struct rq_map_data;
487 extern struct bio *bio_map_user_iov(struct request_queue *,
488 const struct iov_iter *, gfp_t);
489 extern void bio_unmap_user(struct bio *);
490 extern struct bio *bio_map_kern(struct request_queue *, void *, unsigned int,
491 gfp_t);
492 extern struct bio *bio_copy_kern(struct request_queue *, void *, unsigned int,
493 gfp_t, int);
494 extern void bio_set_pages_dirty(struct bio *bio);
495 extern void bio_check_pages_dirty(struct bio *bio);
496
497 void generic_start_io_acct(int rw, unsigned long sectors,
498 struct hd_struct *part);
499 void generic_end_io_acct(int rw, struct hd_struct *part,
500 unsigned long start_time);
501
502 #ifndef ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
503 # error "You should define ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE for your platform"
504 #endif
505 #if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
506 extern void bio_flush_dcache_pages(struct bio *bi);
507 #else
508 static inline void bio_flush_dcache_pages(struct bio *bi)
509 {
510 }
511 #endif
512
513 extern void bio_copy_data(struct bio *dst, struct bio *src);
514 extern int bio_alloc_pages(struct bio *bio, gfp_t gfp);
515
516 extern struct bio *bio_copy_user_iov(struct request_queue *,
517 struct rq_map_data *,
518 const struct iov_iter *,
519 gfp_t);
520 extern int bio_uncopy_user(struct bio *);
521 void zero_fill_bio(struct bio *bio);
522 extern struct bio_vec *bvec_alloc(gfp_t, int, unsigned long *, mempool_t *);
523 extern void bvec_free(mempool_t *, struct bio_vec *, unsigned int);
524 extern unsigned int bvec_nr_vecs(unsigned short idx);
525
526 #ifdef CONFIG_BLK_CGROUP
527 int bio_associate_blkcg(struct bio *bio, struct cgroup_subsys_state *blkcg_css);
528 int bio_associate_current(struct bio *bio);
529 void bio_disassociate_task(struct bio *bio);
530 void bio_clone_blkcg_association(struct bio *dst, struct bio *src);
531 #else /* CONFIG_BLK_CGROUP */
532 static inline int bio_associate_blkcg(struct bio *bio,
533 struct cgroup_subsys_state *blkcg_css) { return 0; }
534 static inline int bio_associate_current(struct bio *bio) { return -ENOENT; }
535 static inline void bio_disassociate_task(struct bio *bio) { }
536 static inline void bio_clone_blkcg_association(struct bio *dst,
537 struct bio *src) { }
538 #endif /* CONFIG_BLK_CGROUP */
539
540 #ifdef CONFIG_HIGHMEM
541 /*
542 * remember never ever reenable interrupts between a bvec_kmap_irq and
543 * bvec_kunmap_irq!
544 */
545 static inline char *bvec_kmap_irq(struct bio_vec *bvec, unsigned long *flags)
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);
554 addr = (unsigned long) kmap_atomic(bvec->bv_page);
555
556 BUG_ON(addr & ~PAGE_MASK);
557
558 return (char *) addr + bvec->bv_offset;
559 }
560
561 static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags)
562 {
563 unsigned long ptr = (unsigned long) buffer & PAGE_MASK;
564
565 kunmap_atomic((void *) ptr);
566 local_irq_restore(*flags);
567 }
568
569 #else
570 static 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
575 static inline void bvec_kunmap_irq(char *buffer, unsigned long *flags)
576 {
577 *flags = 0;
578 }
579 #endif
580
581 static inline char *__bio_kmap_irq(struct bio *bio, struct bvec_iter iter,
582 unsigned long *flags)
583 {
584 return bvec_kmap_irq(&bio_iter_iovec(bio, iter), flags);
585 }
586 #define __bio_kunmap_irq(buf, flags) bvec_kunmap_irq(buf, flags)
587
588 #define bio_kmap_irq(bio, flags) \
589 __bio_kmap_irq((bio), (bio)->bi_iter, (flags))
590 #define bio_kunmap_irq(buf,flags) __bio_kunmap_irq(buf, flags)
591
592 /*
593 * BIO list management for use by remapping drivers (e.g. DM or MD) and loop.
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 */
599 struct bio_list {
600 struct bio *head;
601 struct bio *tail;
602 };
603
604 static inline int bio_list_empty(const struct bio_list *bl)
605 {
606 return bl->head == NULL;
607 }
608
609 static inline void bio_list_init(struct bio_list *bl)
610 {
611 bl->head = bl->tail = NULL;
612 }
613
614 #define BIO_EMPTY_LIST { NULL, NULL }
615
616 #define bio_list_for_each(bio, bl) \
617 for (bio = (bl)->head; bio; bio = bio->bi_next)
618
619 static 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
630 static 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
642 static 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
652 static 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
665 static 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
679 static inline struct bio *bio_list_peek(struct bio_list *bl)
680 {
681 return bl->head;
682 }
683
684 static 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
699 static 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
708 /*
709 * bio_set is used to allow other portions of the IO system to
710 * allocate their own private memory pools for bio and iovec structures.
711 * These memory pools in turn all allocate from the bio_slab
712 * and the bvec_slabs[].
713 */
714 #define BIO_POOL_SIZE 2
715 #define BIOVEC_NR_POOLS 6
716 #define BIOVEC_MAX_IDX (BIOVEC_NR_POOLS - 1)
717
718 struct bio_set {
719 struct kmem_cache *bio_slab;
720 unsigned int front_pad;
721
722 mempool_t *bio_pool;
723 mempool_t *bvec_pool;
724 #if defined(CONFIG_BLK_DEV_INTEGRITY)
725 mempool_t *bio_integrity_pool;
726 mempool_t *bvec_integrity_pool;
727 #endif
728
729 /*
730 * Deadlock avoidance for stacking block drivers: see comments in
731 * bio_alloc_bioset() for details
732 */
733 spinlock_t rescue_lock;
734 struct bio_list rescue_list;
735 struct work_struct rescue_work;
736 struct workqueue_struct *rescue_workqueue;
737 };
738
739 struct biovec_slab {
740 int nr_vecs;
741 char *name;
742 struct kmem_cache *slab;
743 };
744
745 /*
746 * a small number of entries is fine, not going to be performance critical.
747 * basically we just need to survive
748 */
749 #define BIO_SPLIT_ENTRIES 2
750
751 #if defined(CONFIG_BLK_DEV_INTEGRITY)
752
753 #define bip_for_each_vec(bvl, bip, iter) \
754 for_each_bvec(bvl, (bip)->bip_vec, iter, (bip)->bip_iter)
755
756 #define bio_for_each_integrity_vec(_bvl, _bio, _iter) \
757 for_each_bio(_bio) \
758 bip_for_each_vec(_bvl, _bio->bi_integrity, _iter)
759
760 extern struct bio_integrity_payload *bio_integrity_alloc(struct bio *, gfp_t, unsigned int);
761 extern void bio_integrity_free(struct bio *);
762 extern int bio_integrity_add_page(struct bio *, struct page *, unsigned int, unsigned int);
763 extern bool bio_integrity_enabled(struct bio *bio);
764 extern int bio_integrity_prep(struct bio *);
765 extern void bio_integrity_endio(struct bio *);
766 extern void bio_integrity_advance(struct bio *, unsigned int);
767 extern void bio_integrity_trim(struct bio *, unsigned int, unsigned int);
768 extern int bio_integrity_clone(struct bio *, struct bio *, gfp_t);
769 extern int bioset_integrity_create(struct bio_set *, int);
770 extern void bioset_integrity_free(struct bio_set *);
771 extern void bio_integrity_init(void);
772
773 #else /* CONFIG_BLK_DEV_INTEGRITY */
774
775 static inline void *bio_integrity(struct bio *bio)
776 {
777 return NULL;
778 }
779
780 static inline bool bio_integrity_enabled(struct bio *bio)
781 {
782 return false;
783 }
784
785 static inline int bioset_integrity_create(struct bio_set *bs, int pool_size)
786 {
787 return 0;
788 }
789
790 static inline void bioset_integrity_free (struct bio_set *bs)
791 {
792 return;
793 }
794
795 static inline int bio_integrity_prep(struct bio *bio)
796 {
797 return 0;
798 }
799
800 static inline void bio_integrity_free(struct bio *bio)
801 {
802 return;
803 }
804
805 static inline int bio_integrity_clone(struct bio *bio, struct bio *bio_src,
806 gfp_t gfp_mask)
807 {
808 return 0;
809 }
810
811 static inline void bio_integrity_advance(struct bio *bio,
812 unsigned int bytes_done)
813 {
814 return;
815 }
816
817 static inline void bio_integrity_trim(struct bio *bio, unsigned int offset,
818 unsigned int sectors)
819 {
820 return;
821 }
822
823 static inline void bio_integrity_init(void)
824 {
825 return;
826 }
827
828 static inline bool bio_integrity_flagged(struct bio *bio, enum bip_flags flag)
829 {
830 return false;
831 }
832
833 static inline void *bio_integrity_alloc(struct bio * bio, gfp_t gfp,
834 unsigned int nr)
835 {
836 return ERR_PTR(-EINVAL);
837 }
838
839 static inline int bio_integrity_add_page(struct bio *bio, struct page *page,
840 unsigned int len, unsigned int offset)
841 {
842 return 0;
843 }
844
845 #endif /* CONFIG_BLK_DEV_INTEGRITY */
846
847 #endif /* CONFIG_BLOCK */
848 #endif /* __LINUX_BIO_H */