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