Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * fs/direct-io.c | |
3 | * | |
4 | * Copyright (C) 2002, Linus Torvalds. | |
5 | * | |
6 | * O_DIRECT | |
7 | * | |
e1f8e874 | 8 | * 04Jul2002 Andrew Morton |
1da177e4 LT |
9 | * Initial version |
10 | * 11Sep2002 janetinc@us.ibm.com | |
11 | * added readv/writev support. | |
e1f8e874 | 12 | * 29Oct2002 Andrew Morton |
1da177e4 LT |
13 | * rewrote bio_add_page() support. |
14 | * 30Oct2002 pbadari@us.ibm.com | |
15 | * added support for non-aligned IO. | |
16 | * 06Nov2002 pbadari@us.ibm.com | |
17 | * added asynchronous IO support. | |
18 | * 21Jul2003 nathans@sgi.com | |
19 | * added IO completion notifier. | |
20 | */ | |
21 | ||
22 | #include <linux/kernel.h> | |
23 | #include <linux/module.h> | |
24 | #include <linux/types.h> | |
25 | #include <linux/fs.h> | |
26 | #include <linux/mm.h> | |
27 | #include <linux/slab.h> | |
28 | #include <linux/highmem.h> | |
29 | #include <linux/pagemap.h> | |
98c4d57d | 30 | #include <linux/task_io_accounting_ops.h> |
1da177e4 LT |
31 | #include <linux/bio.h> |
32 | #include <linux/wait.h> | |
33 | #include <linux/err.h> | |
34 | #include <linux/blkdev.h> | |
35 | #include <linux/buffer_head.h> | |
36 | #include <linux/rwsem.h> | |
37 | #include <linux/uio.h> | |
60063497 | 38 | #include <linux/atomic.h> |
65dd2aa9 | 39 | #include <linux/prefetch.h> |
1da177e4 LT |
40 | |
41 | /* | |
42 | * How many user pages to map in one call to get_user_pages(). This determines | |
cde1ecb3 | 43 | * the size of a structure in the slab cache |
1da177e4 LT |
44 | */ |
45 | #define DIO_PAGES 64 | |
46 | ||
47 | /* | |
48 | * This code generally works in units of "dio_blocks". A dio_block is | |
49 | * somewhere between the hard sector size and the filesystem block size. it | |
50 | * is determined on a per-invocation basis. When talking to the filesystem | |
51 | * we need to convert dio_blocks to fs_blocks by scaling the dio_block quantity | |
52 | * down by dio->blkfactor. Similarly, fs-blocksize quantities are converted | |
53 | * to bio_block quantities by shifting left by blkfactor. | |
54 | * | |
55 | * If blkfactor is zero then the user's request was aligned to the filesystem's | |
56 | * blocksize. | |
1da177e4 LT |
57 | */ |
58 | ||
eb28be2b AK |
59 | /* dio_state only used in the submission path */ |
60 | ||
61 | struct dio_submit { | |
1da177e4 | 62 | struct bio *bio; /* bio under assembly */ |
1da177e4 LT |
63 | unsigned blkbits; /* doesn't change */ |
64 | unsigned blkfactor; /* When we're using an alignment which | |
65 | is finer than the filesystem's soft | |
66 | blocksize, this specifies how much | |
67 | finer. blkfactor=2 means 1/4-block | |
68 | alignment. Does not change */ | |
69 | unsigned start_zero_done; /* flag: sub-blocksize zeroing has | |
70 | been performed at the start of a | |
71 | write */ | |
72 | int pages_in_io; /* approximate total IO pages */ | |
1da177e4 LT |
73 | sector_t block_in_file; /* Current offset into the underlying |
74 | file in dio_block units. */ | |
75 | unsigned blocks_available; /* At block_in_file. changes */ | |
0dc2bc49 | 76 | int reap_counter; /* rate limit reaping */ |
1da177e4 | 77 | sector_t final_block_in_request;/* doesn't change */ |
1da177e4 | 78 | int boundary; /* prev block is at a boundary */ |
1d8fa7a2 | 79 | get_block_t *get_block; /* block mapping function */ |
facd07b0 | 80 | dio_submit_t *submit_io; /* IO submition function */ |
eb28be2b | 81 | |
facd07b0 | 82 | loff_t logical_offset_in_bio; /* current first logical block in bio */ |
1da177e4 LT |
83 | sector_t final_block_in_bio; /* current final block in bio + 1 */ |
84 | sector_t next_block_for_io; /* next block to be put under IO, | |
85 | in dio_blocks units */ | |
1da177e4 LT |
86 | |
87 | /* | |
88 | * Deferred addition of a page to the dio. These variables are | |
89 | * private to dio_send_cur_page(), submit_page_section() and | |
90 | * dio_bio_add_page(). | |
91 | */ | |
92 | struct page *cur_page; /* The page */ | |
93 | unsigned cur_page_offset; /* Offset into it, in bytes */ | |
94 | unsigned cur_page_len; /* Nr of bytes at cur_page_offset */ | |
95 | sector_t cur_page_block; /* Where it starts */ | |
facd07b0 | 96 | loff_t cur_page_fs_offset; /* Offset in file */ |
1da177e4 | 97 | |
7b2c99d1 | 98 | struct iov_iter *iter; |
1da177e4 LT |
99 | /* |
100 | * Page queue. These variables belong to dio_refill_pages() and | |
101 | * dio_get_page(). | |
102 | */ | |
1da177e4 LT |
103 | unsigned head; /* next page to process */ |
104 | unsigned tail; /* last valid page + 1 */ | |
7b2c99d1 | 105 | size_t from, to; |
eb28be2b AK |
106 | }; |
107 | ||
108 | /* dio_state communicated between submission path and end_io */ | |
109 | struct dio { | |
110 | int flags; /* doesn't change */ | |
eb28be2b | 111 | int rw; |
15c4f638 JA |
112 | blk_qc_t bio_cookie; |
113 | struct block_device *bio_bdev; | |
0dc2bc49 | 114 | struct inode *inode; |
eb28be2b AK |
115 | loff_t i_size; /* i_size when submitted */ |
116 | dio_iodone_t *end_io; /* IO completion function */ | |
eb28be2b | 117 | |
18772641 | 118 | void *private; /* copy from map_bh.b_private */ |
eb28be2b AK |
119 | |
120 | /* BIO completion state */ | |
121 | spinlock_t bio_lock; /* protects BIO fields below */ | |
0dc2bc49 AK |
122 | int page_errors; /* errno from get_user_pages() */ |
123 | int is_async; /* is IO async ? */ | |
7b7a8665 | 124 | bool defer_completion; /* defer AIO completion to workqueue? */ |
53cbf3b1 | 125 | bool should_dirty; /* if pages should be dirtied */ |
0dc2bc49 | 126 | int io_error; /* IO error in completion path */ |
eb28be2b AK |
127 | unsigned long refcount; /* direct_io_worker() and bios */ |
128 | struct bio *bio_list; /* singly linked via bi_private */ | |
129 | struct task_struct *waiter; /* waiting task (NULL if none) */ | |
130 | ||
131 | /* AIO related stuff */ | |
132 | struct kiocb *iocb; /* kiocb */ | |
eb28be2b AK |
133 | ssize_t result; /* IO result */ |
134 | ||
23aee091 JM |
135 | /* |
136 | * pages[] (and any fields placed after it) are not zeroed out at | |
137 | * allocation time. Don't add new fields after pages[] unless you | |
138 | * wish that they not be zeroed. | |
139 | */ | |
7b7a8665 CH |
140 | union { |
141 | struct page *pages[DIO_PAGES]; /* page buffer */ | |
142 | struct work_struct complete_work;/* deferred AIO completion */ | |
143 | }; | |
6e8267f5 AK |
144 | } ____cacheline_aligned_in_smp; |
145 | ||
146 | static struct kmem_cache *dio_cache __read_mostly; | |
1da177e4 LT |
147 | |
148 | /* | |
149 | * How many pages are in the queue? | |
150 | */ | |
eb28be2b | 151 | static inline unsigned dio_pages_present(struct dio_submit *sdio) |
1da177e4 | 152 | { |
eb28be2b | 153 | return sdio->tail - sdio->head; |
1da177e4 LT |
154 | } |
155 | ||
156 | /* | |
157 | * Go grab and pin some userspace pages. Typically we'll get 64 at a time. | |
158 | */ | |
ba253fbf | 159 | static inline int dio_refill_pages(struct dio *dio, struct dio_submit *sdio) |
1da177e4 | 160 | { |
7b2c99d1 | 161 | ssize_t ret; |
1da177e4 | 162 | |
2c80929c | 163 | ret = iov_iter_get_pages(sdio->iter, dio->pages, LONG_MAX, DIO_PAGES, |
7b2c99d1 | 164 | &sdio->from); |
1da177e4 | 165 | |
eb28be2b | 166 | if (ret < 0 && sdio->blocks_available && (dio->rw & WRITE)) { |
557ed1fa | 167 | struct page *page = ZERO_PAGE(0); |
1da177e4 LT |
168 | /* |
169 | * A memory fault, but the filesystem has some outstanding | |
170 | * mapped blocks. We need to use those blocks up to avoid | |
171 | * leaking stale data in the file. | |
172 | */ | |
173 | if (dio->page_errors == 0) | |
174 | dio->page_errors = ret; | |
09cbfeaf | 175 | get_page(page); |
b5810039 | 176 | dio->pages[0] = page; |
eb28be2b AK |
177 | sdio->head = 0; |
178 | sdio->tail = 1; | |
7b2c99d1 AV |
179 | sdio->from = 0; |
180 | sdio->to = PAGE_SIZE; | |
181 | return 0; | |
1da177e4 LT |
182 | } |
183 | ||
184 | if (ret >= 0) { | |
7b2c99d1 AV |
185 | iov_iter_advance(sdio->iter, ret); |
186 | ret += sdio->from; | |
eb28be2b | 187 | sdio->head = 0; |
7b2c99d1 AV |
188 | sdio->tail = (ret + PAGE_SIZE - 1) / PAGE_SIZE; |
189 | sdio->to = ((ret - 1) & (PAGE_SIZE - 1)) + 1; | |
190 | return 0; | |
1da177e4 | 191 | } |
1da177e4 LT |
192 | return ret; |
193 | } | |
194 | ||
195 | /* | |
196 | * Get another userspace page. Returns an ERR_PTR on error. Pages are | |
197 | * buffered inside the dio so that we can call get_user_pages() against a | |
198 | * decent number of pages, less frequently. To provide nicer use of the | |
199 | * L1 cache. | |
200 | */ | |
ba253fbf | 201 | static inline struct page *dio_get_page(struct dio *dio, |
6fcc5420 | 202 | struct dio_submit *sdio) |
1da177e4 | 203 | { |
eb28be2b | 204 | if (dio_pages_present(sdio) == 0) { |
1da177e4 LT |
205 | int ret; |
206 | ||
eb28be2b | 207 | ret = dio_refill_pages(dio, sdio); |
1da177e4 LT |
208 | if (ret) |
209 | return ERR_PTR(ret); | |
eb28be2b | 210 | BUG_ON(dio_pages_present(sdio) == 0); |
1da177e4 | 211 | } |
6fcc5420 | 212 | return dio->pages[sdio->head]; |
1da177e4 LT |
213 | } |
214 | ||
6d544bb4 ZB |
215 | /** |
216 | * dio_complete() - called when all DIO BIO I/O has been completed | |
217 | * @offset: the byte offset in the file of the completed operation | |
218 | * | |
7b7a8665 CH |
219 | * This drops i_dio_count, lets interested parties know that a DIO operation |
220 | * has completed, and calculates the resulting return code for the operation. | |
6d544bb4 ZB |
221 | * |
222 | * It lets the filesystem know if it registered an interest earlier via | |
223 | * get_block. Pass the private field of the map buffer_head so that | |
224 | * filesystems can use it to hold additional state between get_block calls and | |
225 | * dio_complete. | |
1da177e4 | 226 | */ |
716b9bc0 | 227 | static ssize_t dio_complete(struct dio *dio, ssize_t ret, bool is_async) |
1da177e4 | 228 | { |
716b9bc0 | 229 | loff_t offset = dio->iocb->ki_pos; |
6d544bb4 ZB |
230 | ssize_t transferred = 0; |
231 | ||
8459d86a ZB |
232 | /* |
233 | * AIO submission can race with bio completion to get here while | |
234 | * expecting to have the last io completed by bio completion. | |
235 | * In that case -EIOCBQUEUED is in fact not an error we want | |
236 | * to preserve through this call. | |
237 | */ | |
238 | if (ret == -EIOCBQUEUED) | |
239 | ret = 0; | |
240 | ||
6d544bb4 ZB |
241 | if (dio->result) { |
242 | transferred = dio->result; | |
243 | ||
244 | /* Check for short read case */ | |
245 | if ((dio->rw == READ) && ((offset + transferred) > dio->i_size)) | |
246 | transferred = dio->i_size - offset; | |
247 | } | |
248 | ||
6d544bb4 ZB |
249 | if (ret == 0) |
250 | ret = dio->page_errors; | |
251 | if (ret == 0) | |
252 | ret = dio->io_error; | |
253 | if (ret == 0) | |
254 | ret = transferred; | |
255 | ||
187372a3 CH |
256 | if (dio->end_io) { |
257 | int err; | |
258 | ||
e2592217 | 259 | // XXX: ki_pos?? |
187372a3 CH |
260 | err = dio->end_io(dio->iocb, offset, ret, dio->private); |
261 | if (err) | |
262 | ret = err; | |
263 | } | |
7b7a8665 | 264 | |
fe0f07d0 JA |
265 | if (!(dio->flags & DIO_SKIP_DIO_COUNT)) |
266 | inode_dio_end(dio->inode); | |
267 | ||
02afc27f | 268 | if (is_async) { |
e2592217 CH |
269 | /* |
270 | * generic_write_sync expects ki_pos to have been updated | |
271 | * already, but the submission path only does this for | |
272 | * synchronous I/O. | |
273 | */ | |
274 | dio->iocb->ki_pos += transferred; | |
02afc27f | 275 | |
e2592217 CH |
276 | if (dio->rw & WRITE) |
277 | ret = generic_write_sync(dio->iocb, transferred); | |
04b2fa9f | 278 | dio->iocb->ki_complete(dio->iocb, ret, 0); |
02afc27f | 279 | } |
40e2e973 | 280 | |
7b7a8665 | 281 | kmem_cache_free(dio_cache, dio); |
6d544bb4 | 282 | return ret; |
1da177e4 LT |
283 | } |
284 | ||
7b7a8665 CH |
285 | static void dio_aio_complete_work(struct work_struct *work) |
286 | { | |
287 | struct dio *dio = container_of(work, struct dio, complete_work); | |
288 | ||
716b9bc0 | 289 | dio_complete(dio, 0, true); |
7b7a8665 CH |
290 | } |
291 | ||
1da177e4 | 292 | static int dio_bio_complete(struct dio *dio, struct bio *bio); |
7b7a8665 | 293 | |
1da177e4 LT |
294 | /* |
295 | * Asynchronous IO callback. | |
296 | */ | |
4246a0b6 | 297 | static void dio_bio_end_aio(struct bio *bio) |
1da177e4 LT |
298 | { |
299 | struct dio *dio = bio->bi_private; | |
5eb6c7a2 ZB |
300 | unsigned long remaining; |
301 | unsigned long flags; | |
1da177e4 | 302 | |
1da177e4 LT |
303 | /* cleanup the bio */ |
304 | dio_bio_complete(dio, bio); | |
0273201e | 305 | |
5eb6c7a2 ZB |
306 | spin_lock_irqsave(&dio->bio_lock, flags); |
307 | remaining = --dio->refcount; | |
308 | if (remaining == 1 && dio->waiter) | |
20258b2b | 309 | wake_up_process(dio->waiter); |
5eb6c7a2 | 310 | spin_unlock_irqrestore(&dio->bio_lock, flags); |
20258b2b | 311 | |
8459d86a | 312 | if (remaining == 0) { |
7b7a8665 CH |
313 | if (dio->result && dio->defer_completion) { |
314 | INIT_WORK(&dio->complete_work, dio_aio_complete_work); | |
315 | queue_work(dio->inode->i_sb->s_dio_done_wq, | |
316 | &dio->complete_work); | |
317 | } else { | |
716b9bc0 | 318 | dio_complete(dio, 0, true); |
7b7a8665 | 319 | } |
8459d86a | 320 | } |
1da177e4 LT |
321 | } |
322 | ||
323 | /* | |
324 | * The BIO completion handler simply queues the BIO up for the process-context | |
325 | * handler. | |
326 | * | |
327 | * During I/O bi_private points at the dio. After I/O, bi_private is used to | |
328 | * implement a singly-linked list of completed BIOs, at dio->bio_list. | |
329 | */ | |
4246a0b6 | 330 | static void dio_bio_end_io(struct bio *bio) |
1da177e4 LT |
331 | { |
332 | struct dio *dio = bio->bi_private; | |
333 | unsigned long flags; | |
334 | ||
1da177e4 LT |
335 | spin_lock_irqsave(&dio->bio_lock, flags); |
336 | bio->bi_private = dio->bio_list; | |
337 | dio->bio_list = bio; | |
5eb6c7a2 | 338 | if (--dio->refcount == 1 && dio->waiter) |
1da177e4 LT |
339 | wake_up_process(dio->waiter); |
340 | spin_unlock_irqrestore(&dio->bio_lock, flags); | |
1da177e4 LT |
341 | } |
342 | ||
facd07b0 JB |
343 | /** |
344 | * dio_end_io - handle the end io action for the given bio | |
345 | * @bio: The direct io bio thats being completed | |
346 | * @error: Error if there was one | |
347 | * | |
348 | * This is meant to be called by any filesystem that uses their own dio_submit_t | |
349 | * so that the DIO specific endio actions are dealt with after the filesystem | |
350 | * has done it's completion work. | |
351 | */ | |
352 | void dio_end_io(struct bio *bio, int error) | |
353 | { | |
354 | struct dio *dio = bio->bi_private; | |
355 | ||
356 | if (dio->is_async) | |
4246a0b6 | 357 | dio_bio_end_aio(bio); |
facd07b0 | 358 | else |
4246a0b6 | 359 | dio_bio_end_io(bio); |
facd07b0 JB |
360 | } |
361 | EXPORT_SYMBOL_GPL(dio_end_io); | |
362 | ||
ba253fbf | 363 | static inline void |
eb28be2b AK |
364 | dio_bio_alloc(struct dio *dio, struct dio_submit *sdio, |
365 | struct block_device *bdev, | |
366 | sector_t first_sector, int nr_vecs) | |
1da177e4 LT |
367 | { |
368 | struct bio *bio; | |
369 | ||
20d9600c DD |
370 | /* |
371 | * bio_alloc() is guaranteed to return a bio when called with | |
71baba4b | 372 | * __GFP_RECLAIM and we request a valid number of vectors. |
20d9600c | 373 | */ |
1da177e4 | 374 | bio = bio_alloc(GFP_KERNEL, nr_vecs); |
1da177e4 LT |
375 | |
376 | bio->bi_bdev = bdev; | |
4f024f37 | 377 | bio->bi_iter.bi_sector = first_sector; |
4e49ea4a | 378 | bio->bi_rw = dio->rw; |
1da177e4 LT |
379 | if (dio->is_async) |
380 | bio->bi_end_io = dio_bio_end_aio; | |
381 | else | |
382 | bio->bi_end_io = dio_bio_end_io; | |
383 | ||
eb28be2b AK |
384 | sdio->bio = bio; |
385 | sdio->logical_offset_in_bio = sdio->cur_page_fs_offset; | |
1da177e4 LT |
386 | } |
387 | ||
388 | /* | |
389 | * In the AIO read case we speculatively dirty the pages before starting IO. | |
390 | * During IO completion, any of these pages which happen to have been written | |
391 | * back will be redirtied by bio_check_pages_dirty(). | |
0273201e ZB |
392 | * |
393 | * bios hold a dio reference between submit_bio and ->end_io. | |
1da177e4 | 394 | */ |
ba253fbf | 395 | static inline void dio_bio_submit(struct dio *dio, struct dio_submit *sdio) |
1da177e4 | 396 | { |
eb28be2b | 397 | struct bio *bio = sdio->bio; |
5eb6c7a2 | 398 | unsigned long flags; |
1da177e4 LT |
399 | |
400 | bio->bi_private = dio; | |
5eb6c7a2 ZB |
401 | |
402 | spin_lock_irqsave(&dio->bio_lock, flags); | |
403 | dio->refcount++; | |
404 | spin_unlock_irqrestore(&dio->bio_lock, flags); | |
405 | ||
53cbf3b1 | 406 | if (dio->is_async && dio->rw == READ && dio->should_dirty) |
1da177e4 | 407 | bio_set_pages_dirty(bio); |
5eb6c7a2 | 408 | |
c1c53460 JA |
409 | dio->bio_bdev = bio->bi_bdev; |
410 | ||
15c4f638 | 411 | if (sdio->submit_io) { |
eb28be2b AK |
412 | sdio->submit_io(dio->rw, bio, dio->inode, |
413 | sdio->logical_offset_in_bio); | |
15c4f638 | 414 | dio->bio_cookie = BLK_QC_T_NONE; |
c1c53460 | 415 | } else |
4e49ea4a | 416 | dio->bio_cookie = submit_bio(bio); |
1da177e4 | 417 | |
eb28be2b AK |
418 | sdio->bio = NULL; |
419 | sdio->boundary = 0; | |
420 | sdio->logical_offset_in_bio = 0; | |
1da177e4 LT |
421 | } |
422 | ||
423 | /* | |
424 | * Release any resources in case of a failure | |
425 | */ | |
ba253fbf | 426 | static inline void dio_cleanup(struct dio *dio, struct dio_submit *sdio) |
1da177e4 | 427 | { |
7b2c99d1 | 428 | while (sdio->head < sdio->tail) |
09cbfeaf | 429 | put_page(dio->pages[sdio->head++]); |
1da177e4 LT |
430 | } |
431 | ||
432 | /* | |
0273201e ZB |
433 | * Wait for the next BIO to complete. Remove it and return it. NULL is |
434 | * returned once all BIOs have been completed. This must only be called once | |
435 | * all bios have been issued so that dio->refcount can only decrease. This | |
436 | * requires that that the caller hold a reference on the dio. | |
1da177e4 LT |
437 | */ |
438 | static struct bio *dio_await_one(struct dio *dio) | |
439 | { | |
440 | unsigned long flags; | |
0273201e | 441 | struct bio *bio = NULL; |
1da177e4 LT |
442 | |
443 | spin_lock_irqsave(&dio->bio_lock, flags); | |
5eb6c7a2 ZB |
444 | |
445 | /* | |
446 | * Wait as long as the list is empty and there are bios in flight. bio | |
447 | * completion drops the count, maybe adds to the list, and wakes while | |
448 | * holding the bio_lock so we don't need set_current_state()'s barrier | |
449 | * and can call it after testing our condition. | |
450 | */ | |
451 | while (dio->refcount > 1 && dio->bio_list == NULL) { | |
452 | __set_current_state(TASK_UNINTERRUPTIBLE); | |
453 | dio->waiter = current; | |
454 | spin_unlock_irqrestore(&dio->bio_lock, flags); | |
c43c83a2 CH |
455 | if (!(dio->iocb->ki_flags & IOCB_HIPRI) || |
456 | !blk_poll(bdev_get_queue(dio->bio_bdev), dio->bio_cookie)) | |
15c4f638 | 457 | io_schedule(); |
5eb6c7a2 ZB |
458 | /* wake up sets us TASK_RUNNING */ |
459 | spin_lock_irqsave(&dio->bio_lock, flags); | |
460 | dio->waiter = NULL; | |
1da177e4 | 461 | } |
0273201e ZB |
462 | if (dio->bio_list) { |
463 | bio = dio->bio_list; | |
464 | dio->bio_list = bio->bi_private; | |
465 | } | |
1da177e4 LT |
466 | spin_unlock_irqrestore(&dio->bio_lock, flags); |
467 | return bio; | |
468 | } | |
469 | ||
470 | /* | |
471 | * Process one completed BIO. No locks are held. | |
472 | */ | |
473 | static int dio_bio_complete(struct dio *dio, struct bio *bio) | |
474 | { | |
cb34e057 KO |
475 | struct bio_vec *bvec; |
476 | unsigned i; | |
9b81c842 | 477 | int err; |
1da177e4 | 478 | |
4246a0b6 | 479 | if (bio->bi_error) |
174e27c6 | 480 | dio->io_error = -EIO; |
1da177e4 | 481 | |
53cbf3b1 | 482 | if (dio->is_async && dio->rw == READ && dio->should_dirty) { |
9b81c842 | 483 | err = bio->bi_error; |
7ddc971f | 484 | bio_check_pages_dirty(bio); /* transfers ownership */ |
1da177e4 | 485 | } else { |
cb34e057 KO |
486 | bio_for_each_segment_all(bvec, bio, i) { |
487 | struct page *page = bvec->bv_page; | |
1da177e4 | 488 | |
53cbf3b1 ML |
489 | if (dio->rw == READ && !PageCompound(page) && |
490 | dio->should_dirty) | |
1da177e4 | 491 | set_page_dirty_lock(page); |
09cbfeaf | 492 | put_page(page); |
1da177e4 | 493 | } |
9b81c842 | 494 | err = bio->bi_error; |
1da177e4 LT |
495 | bio_put(bio); |
496 | } | |
9b81c842 | 497 | return err; |
1da177e4 LT |
498 | } |
499 | ||
500 | /* | |
0273201e ZB |
501 | * Wait on and process all in-flight BIOs. This must only be called once |
502 | * all bios have been issued so that the refcount can only decrease. | |
503 | * This just waits for all bios to make it through dio_bio_complete. IO | |
beb7dd86 | 504 | * errors are propagated through dio->io_error and should be propagated via |
0273201e | 505 | * dio_complete(). |
1da177e4 | 506 | */ |
6d544bb4 | 507 | static void dio_await_completion(struct dio *dio) |
1da177e4 | 508 | { |
0273201e ZB |
509 | struct bio *bio; |
510 | do { | |
511 | bio = dio_await_one(dio); | |
512 | if (bio) | |
513 | dio_bio_complete(dio, bio); | |
514 | } while (bio); | |
1da177e4 LT |
515 | } |
516 | ||
517 | /* | |
518 | * A really large O_DIRECT read or write can generate a lot of BIOs. So | |
519 | * to keep the memory consumption sane we periodically reap any completed BIOs | |
520 | * during the BIO generation phase. | |
521 | * | |
522 | * This also helps to limit the peak amount of pinned userspace memory. | |
523 | */ | |
ba253fbf | 524 | static inline int dio_bio_reap(struct dio *dio, struct dio_submit *sdio) |
1da177e4 LT |
525 | { |
526 | int ret = 0; | |
527 | ||
eb28be2b | 528 | if (sdio->reap_counter++ >= 64) { |
1da177e4 LT |
529 | while (dio->bio_list) { |
530 | unsigned long flags; | |
531 | struct bio *bio; | |
532 | int ret2; | |
533 | ||
534 | spin_lock_irqsave(&dio->bio_lock, flags); | |
535 | bio = dio->bio_list; | |
536 | dio->bio_list = bio->bi_private; | |
537 | spin_unlock_irqrestore(&dio->bio_lock, flags); | |
538 | ret2 = dio_bio_complete(dio, bio); | |
539 | if (ret == 0) | |
540 | ret = ret2; | |
541 | } | |
eb28be2b | 542 | sdio->reap_counter = 0; |
1da177e4 LT |
543 | } |
544 | return ret; | |
545 | } | |
546 | ||
7b7a8665 CH |
547 | /* |
548 | * Create workqueue for deferred direct IO completions. We allocate the | |
549 | * workqueue when it's first needed. This avoids creating workqueue for | |
550 | * filesystems that don't need it and also allows us to create the workqueue | |
551 | * late enough so the we can include s_id in the name of the workqueue. | |
552 | */ | |
553 | static int sb_init_dio_done_wq(struct super_block *sb) | |
554 | { | |
45150c43 | 555 | struct workqueue_struct *old; |
7b7a8665 CH |
556 | struct workqueue_struct *wq = alloc_workqueue("dio/%s", |
557 | WQ_MEM_RECLAIM, 0, | |
558 | sb->s_id); | |
559 | if (!wq) | |
560 | return -ENOMEM; | |
561 | /* | |
562 | * This has to be atomic as more DIOs can race to create the workqueue | |
563 | */ | |
45150c43 | 564 | old = cmpxchg(&sb->s_dio_done_wq, NULL, wq); |
7b7a8665 | 565 | /* Someone created workqueue before us? Free ours... */ |
45150c43 | 566 | if (old) |
7b7a8665 CH |
567 | destroy_workqueue(wq); |
568 | return 0; | |
569 | } | |
570 | ||
571 | static int dio_set_defer_completion(struct dio *dio) | |
572 | { | |
573 | struct super_block *sb = dio->inode->i_sb; | |
574 | ||
575 | if (dio->defer_completion) | |
576 | return 0; | |
577 | dio->defer_completion = true; | |
578 | if (!sb->s_dio_done_wq) | |
579 | return sb_init_dio_done_wq(sb); | |
580 | return 0; | |
581 | } | |
582 | ||
1da177e4 LT |
583 | /* |
584 | * Call into the fs to map some more disk blocks. We record the current number | |
eb28be2b | 585 | * of available blocks at sdio->blocks_available. These are in units of the |
1da177e4 LT |
586 | * fs blocksize, (1 << inode->i_blkbits). |
587 | * | |
588 | * The fs is allowed to map lots of blocks at once. If it wants to do that, | |
589 | * it uses the passed inode-relative block number as the file offset, as usual. | |
590 | * | |
1d8fa7a2 | 591 | * get_block() is passed the number of i_blkbits-sized blocks which direct_io |
1da177e4 LT |
592 | * has remaining to do. The fs should not map more than this number of blocks. |
593 | * | |
594 | * If the fs has mapped a lot of blocks, it should populate bh->b_size to | |
595 | * indicate how much contiguous disk space has been made available at | |
596 | * bh->b_blocknr. | |
597 | * | |
598 | * If *any* of the mapped blocks are new, then the fs must set buffer_new(). | |
599 | * This isn't very efficient... | |
600 | * | |
601 | * In the case of filesystem holes: the fs may return an arbitrarily-large | |
602 | * hole by returning an appropriate value in b_size and by clearing | |
603 | * buffer_mapped(). However the direct-io code will only process holes one | |
1d8fa7a2 | 604 | * block at a time - it will repeatedly call get_block() as it walks the hole. |
1da177e4 | 605 | */ |
18772641 AK |
606 | static int get_more_blocks(struct dio *dio, struct dio_submit *sdio, |
607 | struct buffer_head *map_bh) | |
1da177e4 LT |
608 | { |
609 | int ret; | |
1da177e4 | 610 | sector_t fs_startblk; /* Into file, in filesystem-sized blocks */ |
ae55e1aa | 611 | sector_t fs_endblk; /* Into file, in filesystem-sized blocks */ |
1da177e4 | 612 | unsigned long fs_count; /* Number of filesystem-sized blocks */ |
1da177e4 | 613 | int create; |
ab73857e | 614 | unsigned int i_blkbits = sdio->blkbits + sdio->blkfactor; |
1da177e4 LT |
615 | |
616 | /* | |
617 | * If there was a memory error and we've overwritten all the | |
618 | * mapped blocks then we can now return that memory error | |
619 | */ | |
620 | ret = dio->page_errors; | |
621 | if (ret == 0) { | |
eb28be2b AK |
622 | BUG_ON(sdio->block_in_file >= sdio->final_block_in_request); |
623 | fs_startblk = sdio->block_in_file >> sdio->blkfactor; | |
ae55e1aa TM |
624 | fs_endblk = (sdio->final_block_in_request - 1) >> |
625 | sdio->blkfactor; | |
626 | fs_count = fs_endblk - fs_startblk + 1; | |
1da177e4 | 627 | |
3c674e74 | 628 | map_bh->b_state = 0; |
ab73857e | 629 | map_bh->b_size = fs_count << i_blkbits; |
3c674e74 | 630 | |
5fe878ae | 631 | /* |
9ecd10b7 EG |
632 | * For writes that could fill holes inside i_size on a |
633 | * DIO_SKIP_HOLES filesystem we forbid block creations: only | |
634 | * overwrites are permitted. We will return early to the caller | |
635 | * once we see an unmapped buffer head returned, and the caller | |
636 | * will fall back to buffered I/O. | |
5fe878ae CH |
637 | * |
638 | * Otherwise the decision is left to the get_blocks method, | |
639 | * which may decide to handle it or also return an unmapped | |
640 | * buffer head. | |
641 | */ | |
b31dc66a | 642 | create = dio->rw & WRITE; |
5fe878ae | 643 | if (dio->flags & DIO_SKIP_HOLES) { |
9ecd10b7 EG |
644 | if (fs_startblk <= ((i_size_read(dio->inode) - 1) >> |
645 | i_blkbits)) | |
1da177e4 | 646 | create = 0; |
1da177e4 | 647 | } |
3c674e74 | 648 | |
eb28be2b | 649 | ret = (*sdio->get_block)(dio->inode, fs_startblk, |
1da177e4 | 650 | map_bh, create); |
18772641 AK |
651 | |
652 | /* Store for completion */ | |
653 | dio->private = map_bh->b_private; | |
7b7a8665 CH |
654 | |
655 | if (ret == 0 && buffer_defer_completion(map_bh)) | |
656 | ret = dio_set_defer_completion(dio); | |
1da177e4 LT |
657 | } |
658 | return ret; | |
659 | } | |
660 | ||
661 | /* | |
662 | * There is no bio. Make one now. | |
663 | */ | |
ba253fbf AK |
664 | static inline int dio_new_bio(struct dio *dio, struct dio_submit *sdio, |
665 | sector_t start_sector, struct buffer_head *map_bh) | |
1da177e4 LT |
666 | { |
667 | sector_t sector; | |
668 | int ret, nr_pages; | |
669 | ||
eb28be2b | 670 | ret = dio_bio_reap(dio, sdio); |
1da177e4 LT |
671 | if (ret) |
672 | goto out; | |
eb28be2b | 673 | sector = start_sector << (sdio->blkbits - 9); |
b54ffb73 | 674 | nr_pages = min(sdio->pages_in_io, BIO_MAX_PAGES); |
1da177e4 | 675 | BUG_ON(nr_pages <= 0); |
18772641 | 676 | dio_bio_alloc(dio, sdio, map_bh->b_bdev, sector, nr_pages); |
eb28be2b | 677 | sdio->boundary = 0; |
1da177e4 LT |
678 | out: |
679 | return ret; | |
680 | } | |
681 | ||
682 | /* | |
683 | * Attempt to put the current chunk of 'cur_page' into the current BIO. If | |
684 | * that was successful then update final_block_in_bio and take a ref against | |
685 | * the just-added page. | |
686 | * | |
687 | * Return zero on success. Non-zero means the caller needs to start a new BIO. | |
688 | */ | |
ba253fbf | 689 | static inline int dio_bio_add_page(struct dio_submit *sdio) |
1da177e4 LT |
690 | { |
691 | int ret; | |
692 | ||
eb28be2b AK |
693 | ret = bio_add_page(sdio->bio, sdio->cur_page, |
694 | sdio->cur_page_len, sdio->cur_page_offset); | |
695 | if (ret == sdio->cur_page_len) { | |
1da177e4 LT |
696 | /* |
697 | * Decrement count only, if we are done with this page | |
698 | */ | |
eb28be2b AK |
699 | if ((sdio->cur_page_len + sdio->cur_page_offset) == PAGE_SIZE) |
700 | sdio->pages_in_io--; | |
09cbfeaf | 701 | get_page(sdio->cur_page); |
eb28be2b AK |
702 | sdio->final_block_in_bio = sdio->cur_page_block + |
703 | (sdio->cur_page_len >> sdio->blkbits); | |
1da177e4 LT |
704 | ret = 0; |
705 | } else { | |
706 | ret = 1; | |
707 | } | |
708 | return ret; | |
709 | } | |
710 | ||
711 | /* | |
712 | * Put cur_page under IO. The section of cur_page which is described by | |
713 | * cur_page_offset,cur_page_len is put into a BIO. The section of cur_page | |
714 | * starts on-disk at cur_page_block. | |
715 | * | |
716 | * We take a ref against the page here (on behalf of its presence in the bio). | |
717 | * | |
718 | * The caller of this function is responsible for removing cur_page from the | |
719 | * dio, and for dropping the refcount which came from that presence. | |
720 | */ | |
ba253fbf AK |
721 | static inline int dio_send_cur_page(struct dio *dio, struct dio_submit *sdio, |
722 | struct buffer_head *map_bh) | |
1da177e4 LT |
723 | { |
724 | int ret = 0; | |
725 | ||
eb28be2b AK |
726 | if (sdio->bio) { |
727 | loff_t cur_offset = sdio->cur_page_fs_offset; | |
728 | loff_t bio_next_offset = sdio->logical_offset_in_bio + | |
4f024f37 | 729 | sdio->bio->bi_iter.bi_size; |
c2c6ca41 | 730 | |
1da177e4 | 731 | /* |
c2c6ca41 JB |
732 | * See whether this new request is contiguous with the old. |
733 | * | |
f0940cee NK |
734 | * Btrfs cannot handle having logically non-contiguous requests |
735 | * submitted. For example if you have | |
c2c6ca41 JB |
736 | * |
737 | * Logical: [0-4095][HOLE][8192-12287] | |
f0940cee | 738 | * Physical: [0-4095] [4096-8191] |
c2c6ca41 JB |
739 | * |
740 | * We cannot submit those pages together as one BIO. So if our | |
741 | * current logical offset in the file does not equal what would | |
742 | * be the next logical offset in the bio, submit the bio we | |
743 | * have. | |
1da177e4 | 744 | */ |
eb28be2b | 745 | if (sdio->final_block_in_bio != sdio->cur_page_block || |
c2c6ca41 | 746 | cur_offset != bio_next_offset) |
eb28be2b | 747 | dio_bio_submit(dio, sdio); |
1da177e4 LT |
748 | } |
749 | ||
eb28be2b | 750 | if (sdio->bio == NULL) { |
18772641 | 751 | ret = dio_new_bio(dio, sdio, sdio->cur_page_block, map_bh); |
1da177e4 LT |
752 | if (ret) |
753 | goto out; | |
754 | } | |
755 | ||
eb28be2b AK |
756 | if (dio_bio_add_page(sdio) != 0) { |
757 | dio_bio_submit(dio, sdio); | |
18772641 | 758 | ret = dio_new_bio(dio, sdio, sdio->cur_page_block, map_bh); |
1da177e4 | 759 | if (ret == 0) { |
eb28be2b | 760 | ret = dio_bio_add_page(sdio); |
1da177e4 LT |
761 | BUG_ON(ret != 0); |
762 | } | |
763 | } | |
764 | out: | |
765 | return ret; | |
766 | } | |
767 | ||
768 | /* | |
769 | * An autonomous function to put a chunk of a page under deferred IO. | |
770 | * | |
771 | * The caller doesn't actually know (or care) whether this piece of page is in | |
772 | * a BIO, or is under IO or whatever. We just take care of all possible | |
773 | * situations here. The separation between the logic of do_direct_IO() and | |
774 | * that of submit_page_section() is important for clarity. Please don't break. | |
775 | * | |
776 | * The chunk of page starts on-disk at blocknr. | |
777 | * | |
778 | * We perform deferred IO, by recording the last-submitted page inside our | |
779 | * private part of the dio structure. If possible, we just expand the IO | |
780 | * across that page here. | |
781 | * | |
782 | * If that doesn't work out then we put the old page into the bio and add this | |
783 | * page to the dio instead. | |
784 | */ | |
ba253fbf | 785 | static inline int |
eb28be2b | 786 | submit_page_section(struct dio *dio, struct dio_submit *sdio, struct page *page, |
18772641 AK |
787 | unsigned offset, unsigned len, sector_t blocknr, |
788 | struct buffer_head *map_bh) | |
1da177e4 LT |
789 | { |
790 | int ret = 0; | |
791 | ||
98c4d57d AM |
792 | if (dio->rw & WRITE) { |
793 | /* | |
794 | * Read accounting is performed in submit_bio() | |
795 | */ | |
796 | task_io_account_write(len); | |
797 | } | |
798 | ||
1da177e4 LT |
799 | /* |
800 | * Can we just grow the current page's presence in the dio? | |
801 | */ | |
eb28be2b AK |
802 | if (sdio->cur_page == page && |
803 | sdio->cur_page_offset + sdio->cur_page_len == offset && | |
804 | sdio->cur_page_block + | |
805 | (sdio->cur_page_len >> sdio->blkbits) == blocknr) { | |
806 | sdio->cur_page_len += len; | |
1da177e4 LT |
807 | goto out; |
808 | } | |
809 | ||
810 | /* | |
811 | * If there's a deferred page already there then send it. | |
812 | */ | |
eb28be2b | 813 | if (sdio->cur_page) { |
18772641 | 814 | ret = dio_send_cur_page(dio, sdio, map_bh); |
09cbfeaf | 815 | put_page(sdio->cur_page); |
eb28be2b | 816 | sdio->cur_page = NULL; |
1da177e4 | 817 | if (ret) |
b1058b98 | 818 | return ret; |
1da177e4 LT |
819 | } |
820 | ||
09cbfeaf | 821 | get_page(page); /* It is in dio */ |
eb28be2b AK |
822 | sdio->cur_page = page; |
823 | sdio->cur_page_offset = offset; | |
824 | sdio->cur_page_len = len; | |
825 | sdio->cur_page_block = blocknr; | |
826 | sdio->cur_page_fs_offset = sdio->block_in_file << sdio->blkbits; | |
1da177e4 | 827 | out: |
b1058b98 JK |
828 | /* |
829 | * If sdio->boundary then we want to schedule the IO now to | |
830 | * avoid metadata seeks. | |
831 | */ | |
832 | if (sdio->boundary) { | |
833 | ret = dio_send_cur_page(dio, sdio, map_bh); | |
834 | dio_bio_submit(dio, sdio); | |
09cbfeaf | 835 | put_page(sdio->cur_page); |
b1058b98 JK |
836 | sdio->cur_page = NULL; |
837 | } | |
1da177e4 LT |
838 | return ret; |
839 | } | |
840 | ||
841 | /* | |
842 | * Clean any dirty buffers in the blockdev mapping which alias newly-created | |
843 | * file blocks. Only called for S_ISREG files - blockdevs do not set | |
844 | * buffer_new | |
845 | */ | |
18772641 | 846 | static void clean_blockdev_aliases(struct dio *dio, struct buffer_head *map_bh) |
1da177e4 LT |
847 | { |
848 | unsigned i; | |
849 | unsigned nblocks; | |
850 | ||
18772641 | 851 | nblocks = map_bh->b_size >> dio->inode->i_blkbits; |
1da177e4 LT |
852 | |
853 | for (i = 0; i < nblocks; i++) { | |
18772641 AK |
854 | unmap_underlying_metadata(map_bh->b_bdev, |
855 | map_bh->b_blocknr + i); | |
1da177e4 LT |
856 | } |
857 | } | |
858 | ||
859 | /* | |
860 | * If we are not writing the entire block and get_block() allocated | |
861 | * the block for us, we need to fill-in the unused portion of the | |
862 | * block with zeros. This happens only if user-buffer, fileoffset or | |
863 | * io length is not filesystem block-size multiple. | |
864 | * | |
865 | * `end' is zero if we're doing the start of the IO, 1 at the end of the | |
866 | * IO. | |
867 | */ | |
ba253fbf AK |
868 | static inline void dio_zero_block(struct dio *dio, struct dio_submit *sdio, |
869 | int end, struct buffer_head *map_bh) | |
1da177e4 LT |
870 | { |
871 | unsigned dio_blocks_per_fs_block; | |
872 | unsigned this_chunk_blocks; /* In dio_blocks */ | |
873 | unsigned this_chunk_bytes; | |
874 | struct page *page; | |
875 | ||
eb28be2b | 876 | sdio->start_zero_done = 1; |
18772641 | 877 | if (!sdio->blkfactor || !buffer_new(map_bh)) |
1da177e4 LT |
878 | return; |
879 | ||
eb28be2b AK |
880 | dio_blocks_per_fs_block = 1 << sdio->blkfactor; |
881 | this_chunk_blocks = sdio->block_in_file & (dio_blocks_per_fs_block - 1); | |
1da177e4 LT |
882 | |
883 | if (!this_chunk_blocks) | |
884 | return; | |
885 | ||
886 | /* | |
887 | * We need to zero out part of an fs block. It is either at the | |
888 | * beginning or the end of the fs block. | |
889 | */ | |
890 | if (end) | |
891 | this_chunk_blocks = dio_blocks_per_fs_block - this_chunk_blocks; | |
892 | ||
eb28be2b | 893 | this_chunk_bytes = this_chunk_blocks << sdio->blkbits; |
1da177e4 | 894 | |
557ed1fa | 895 | page = ZERO_PAGE(0); |
eb28be2b | 896 | if (submit_page_section(dio, sdio, page, 0, this_chunk_bytes, |
18772641 | 897 | sdio->next_block_for_io, map_bh)) |
1da177e4 LT |
898 | return; |
899 | ||
eb28be2b | 900 | sdio->next_block_for_io += this_chunk_blocks; |
1da177e4 LT |
901 | } |
902 | ||
903 | /* | |
904 | * Walk the user pages, and the file, mapping blocks to disk and generating | |
905 | * a sequence of (page,offset,len,block) mappings. These mappings are injected | |
906 | * into submit_page_section(), which takes care of the next stage of submission | |
907 | * | |
908 | * Direct IO against a blockdev is different from a file. Because we can | |
909 | * happily perform page-sized but 512-byte aligned IOs. It is important that | |
910 | * blockdev IO be able to have fine alignment and large sizes. | |
911 | * | |
1d8fa7a2 | 912 | * So what we do is to permit the ->get_block function to populate bh.b_size |
1da177e4 LT |
913 | * with the size of IO which is permitted at this offset and this i_blkbits. |
914 | * | |
915 | * For best results, the blockdev should be set up with 512-byte i_blkbits and | |
1d8fa7a2 | 916 | * it should set b_size to PAGE_SIZE or more inside get_block(). This gives |
1da177e4 LT |
917 | * fine alignment but still allows this function to work in PAGE_SIZE units. |
918 | */ | |
18772641 AK |
919 | static int do_direct_IO(struct dio *dio, struct dio_submit *sdio, |
920 | struct buffer_head *map_bh) | |
1da177e4 | 921 | { |
eb28be2b | 922 | const unsigned blkbits = sdio->blkbits; |
1da177e4 LT |
923 | int ret = 0; |
924 | ||
eb28be2b | 925 | while (sdio->block_in_file < sdio->final_block_in_request) { |
7b2c99d1 AV |
926 | struct page *page; |
927 | size_t from, to; | |
6fcc5420 BH |
928 | |
929 | page = dio_get_page(dio, sdio); | |
1da177e4 LT |
930 | if (IS_ERR(page)) { |
931 | ret = PTR_ERR(page); | |
932 | goto out; | |
933 | } | |
6fcc5420 BH |
934 | from = sdio->head ? 0 : sdio->from; |
935 | to = (sdio->head == sdio->tail - 1) ? sdio->to : PAGE_SIZE; | |
936 | sdio->head++; | |
1da177e4 | 937 | |
7b2c99d1 | 938 | while (from < to) { |
1da177e4 LT |
939 | unsigned this_chunk_bytes; /* # of bytes mapped */ |
940 | unsigned this_chunk_blocks; /* # of blocks */ | |
941 | unsigned u; | |
942 | ||
eb28be2b | 943 | if (sdio->blocks_available == 0) { |
1da177e4 LT |
944 | /* |
945 | * Need to go and map some more disk | |
946 | */ | |
947 | unsigned long blkmask; | |
948 | unsigned long dio_remainder; | |
949 | ||
18772641 | 950 | ret = get_more_blocks(dio, sdio, map_bh); |
1da177e4 | 951 | if (ret) { |
09cbfeaf | 952 | put_page(page); |
1da177e4 LT |
953 | goto out; |
954 | } | |
955 | if (!buffer_mapped(map_bh)) | |
956 | goto do_holes; | |
957 | ||
eb28be2b AK |
958 | sdio->blocks_available = |
959 | map_bh->b_size >> sdio->blkbits; | |
960 | sdio->next_block_for_io = | |
961 | map_bh->b_blocknr << sdio->blkfactor; | |
1da177e4 | 962 | if (buffer_new(map_bh)) |
18772641 | 963 | clean_blockdev_aliases(dio, map_bh); |
1da177e4 | 964 | |
eb28be2b | 965 | if (!sdio->blkfactor) |
1da177e4 LT |
966 | goto do_holes; |
967 | ||
eb28be2b AK |
968 | blkmask = (1 << sdio->blkfactor) - 1; |
969 | dio_remainder = (sdio->block_in_file & blkmask); | |
1da177e4 LT |
970 | |
971 | /* | |
972 | * If we are at the start of IO and that IO | |
973 | * starts partway into a fs-block, | |
974 | * dio_remainder will be non-zero. If the IO | |
975 | * is a read then we can simply advance the IO | |
976 | * cursor to the first block which is to be | |
977 | * read. But if the IO is a write and the | |
978 | * block was newly allocated we cannot do that; | |
979 | * the start of the fs block must be zeroed out | |
980 | * on-disk | |
981 | */ | |
982 | if (!buffer_new(map_bh)) | |
eb28be2b AK |
983 | sdio->next_block_for_io += dio_remainder; |
984 | sdio->blocks_available -= dio_remainder; | |
1da177e4 LT |
985 | } |
986 | do_holes: | |
987 | /* Handle holes */ | |
988 | if (!buffer_mapped(map_bh)) { | |
35dc8161 | 989 | loff_t i_size_aligned; |
1da177e4 LT |
990 | |
991 | /* AKPM: eargh, -ENOTBLK is a hack */ | |
b31dc66a | 992 | if (dio->rw & WRITE) { |
09cbfeaf | 993 | put_page(page); |
1da177e4 LT |
994 | return -ENOTBLK; |
995 | } | |
996 | ||
35dc8161 JM |
997 | /* |
998 | * Be sure to account for a partial block as the | |
999 | * last block in the file | |
1000 | */ | |
1001 | i_size_aligned = ALIGN(i_size_read(dio->inode), | |
1002 | 1 << blkbits); | |
eb28be2b | 1003 | if (sdio->block_in_file >= |
35dc8161 | 1004 | i_size_aligned >> blkbits) { |
1da177e4 | 1005 | /* We hit eof */ |
09cbfeaf | 1006 | put_page(page); |
1da177e4 LT |
1007 | goto out; |
1008 | } | |
7b2c99d1 | 1009 | zero_user(page, from, 1 << blkbits); |
eb28be2b | 1010 | sdio->block_in_file++; |
7b2c99d1 | 1011 | from += 1 << blkbits; |
3320c60b | 1012 | dio->result += 1 << blkbits; |
1da177e4 LT |
1013 | goto next_block; |
1014 | } | |
1015 | ||
1016 | /* | |
1017 | * If we're performing IO which has an alignment which | |
1018 | * is finer than the underlying fs, go check to see if | |
1019 | * we must zero out the start of this block. | |
1020 | */ | |
eb28be2b | 1021 | if (unlikely(sdio->blkfactor && !sdio->start_zero_done)) |
18772641 | 1022 | dio_zero_block(dio, sdio, 0, map_bh); |
1da177e4 LT |
1023 | |
1024 | /* | |
1025 | * Work out, in this_chunk_blocks, how much disk we | |
1026 | * can add to this page | |
1027 | */ | |
eb28be2b | 1028 | this_chunk_blocks = sdio->blocks_available; |
7b2c99d1 | 1029 | u = (to - from) >> blkbits; |
1da177e4 LT |
1030 | if (this_chunk_blocks > u) |
1031 | this_chunk_blocks = u; | |
eb28be2b | 1032 | u = sdio->final_block_in_request - sdio->block_in_file; |
1da177e4 LT |
1033 | if (this_chunk_blocks > u) |
1034 | this_chunk_blocks = u; | |
1035 | this_chunk_bytes = this_chunk_blocks << blkbits; | |
1036 | BUG_ON(this_chunk_bytes == 0); | |
1037 | ||
092c8d46 JK |
1038 | if (this_chunk_blocks == sdio->blocks_available) |
1039 | sdio->boundary = buffer_boundary(map_bh); | |
eb28be2b | 1040 | ret = submit_page_section(dio, sdio, page, |
7b2c99d1 | 1041 | from, |
eb28be2b | 1042 | this_chunk_bytes, |
18772641 AK |
1043 | sdio->next_block_for_io, |
1044 | map_bh); | |
1da177e4 | 1045 | if (ret) { |
09cbfeaf | 1046 | put_page(page); |
1da177e4 LT |
1047 | goto out; |
1048 | } | |
eb28be2b | 1049 | sdio->next_block_for_io += this_chunk_blocks; |
1da177e4 | 1050 | |
eb28be2b | 1051 | sdio->block_in_file += this_chunk_blocks; |
7b2c99d1 AV |
1052 | from += this_chunk_bytes; |
1053 | dio->result += this_chunk_bytes; | |
eb28be2b | 1054 | sdio->blocks_available -= this_chunk_blocks; |
1da177e4 | 1055 | next_block: |
eb28be2b AK |
1056 | BUG_ON(sdio->block_in_file > sdio->final_block_in_request); |
1057 | if (sdio->block_in_file == sdio->final_block_in_request) | |
1da177e4 LT |
1058 | break; |
1059 | } | |
1060 | ||
1061 | /* Drop the ref which was taken in get_user_pages() */ | |
09cbfeaf | 1062 | put_page(page); |
1da177e4 LT |
1063 | } |
1064 | out: | |
1065 | return ret; | |
1066 | } | |
1067 | ||
847cc637 | 1068 | static inline int drop_refcount(struct dio *dio) |
1da177e4 | 1069 | { |
847cc637 | 1070 | int ret2; |
5eb6c7a2 | 1071 | unsigned long flags; |
1da177e4 | 1072 | |
8459d86a ZB |
1073 | /* |
1074 | * Sync will always be dropping the final ref and completing the | |
5eb6c7a2 ZB |
1075 | * operation. AIO can if it was a broken operation described above or |
1076 | * in fact if all the bios race to complete before we get here. In | |
1077 | * that case dio_complete() translates the EIOCBQUEUED into the proper | |
04b2fa9f | 1078 | * return code that the caller will hand to ->complete(). |
5eb6c7a2 ZB |
1079 | * |
1080 | * This is managed by the bio_lock instead of being an atomic_t so that | |
1081 | * completion paths can drop their ref and use the remaining count to | |
1082 | * decide to wake the submission path atomically. | |
8459d86a | 1083 | */ |
5eb6c7a2 ZB |
1084 | spin_lock_irqsave(&dio->bio_lock, flags); |
1085 | ret2 = --dio->refcount; | |
1086 | spin_unlock_irqrestore(&dio->bio_lock, flags); | |
847cc637 | 1087 | return ret2; |
1da177e4 LT |
1088 | } |
1089 | ||
eafdc7d1 CH |
1090 | /* |
1091 | * This is a library function for use by filesystem drivers. | |
1092 | * | |
1093 | * The locking rules are governed by the flags parameter: | |
1094 | * - if the flags value contains DIO_LOCKING we use a fancy locking | |
1095 | * scheme for dumb filesystems. | |
1096 | * For writes this function is called under i_mutex and returns with | |
1097 | * i_mutex held, for reads, i_mutex is not held on entry, but it is | |
1098 | * taken and dropped again before returning. | |
eafdc7d1 CH |
1099 | * - if the flags value does NOT contain DIO_LOCKING we don't use any |
1100 | * internal locking but rather rely on the filesystem to synchronize | |
1101 | * direct I/O reads/writes versus each other and truncate. | |
df2d6f26 CH |
1102 | * |
1103 | * To help with locking against truncate we incremented the i_dio_count | |
1104 | * counter before starting direct I/O, and decrement it once we are done. | |
1105 | * Truncate can wait for it to reach zero to provide exclusion. It is | |
1106 | * expected that filesystem provide exclusion between new direct I/O | |
1107 | * and truncates. For DIO_LOCKING filesystems this is done by i_mutex, | |
1108 | * but other filesystems need to take care of this on their own. | |
ba253fbf AK |
1109 | * |
1110 | * NOTE: if you pass "sdio" to anything by pointer make sure that function | |
1111 | * is always inlined. Otherwise gcc is unable to split the structure into | |
1112 | * individual fields and will generate much worse code. This is important | |
1113 | * for the whole file. | |
eafdc7d1 | 1114 | */ |
65dd2aa9 | 1115 | static inline ssize_t |
17f8c842 OS |
1116 | do_blockdev_direct_IO(struct kiocb *iocb, struct inode *inode, |
1117 | struct block_device *bdev, struct iov_iter *iter, | |
c8b8e32d | 1118 | get_block_t get_block, dio_iodone_t end_io, |
17f8c842 | 1119 | dio_submit_t submit_io, int flags) |
1da177e4 | 1120 | { |
ab73857e LT |
1121 | unsigned i_blkbits = ACCESS_ONCE(inode->i_blkbits); |
1122 | unsigned blkbits = i_blkbits; | |
1da177e4 LT |
1123 | unsigned blocksize_mask = (1 << blkbits) - 1; |
1124 | ssize_t retval = -EINVAL; | |
af436472 | 1125 | size_t count = iov_iter_count(iter); |
c8b8e32d | 1126 | loff_t offset = iocb->ki_pos; |
af436472 | 1127 | loff_t end = offset + count; |
1da177e4 | 1128 | struct dio *dio; |
eb28be2b | 1129 | struct dio_submit sdio = { 0, }; |
847cc637 | 1130 | struct buffer_head map_bh = { 0, }; |
647d1e4c | 1131 | struct blk_plug plug; |
886a3911 | 1132 | unsigned long align = offset | iov_iter_alignment(iter); |
1da177e4 | 1133 | |
65dd2aa9 AK |
1134 | /* |
1135 | * Avoid references to bdev if not absolutely needed to give | |
1136 | * the early prefetch in the caller enough time. | |
1137 | */ | |
1da177e4 | 1138 | |
886a3911 | 1139 | if (align & blocksize_mask) { |
1da177e4 | 1140 | if (bdev) |
65dd2aa9 | 1141 | blkbits = blksize_bits(bdev_logical_block_size(bdev)); |
1da177e4 | 1142 | blocksize_mask = (1 << blkbits) - 1; |
886a3911 | 1143 | if (align & blocksize_mask) |
1da177e4 LT |
1144 | goto out; |
1145 | } | |
1146 | ||
f9b5570d | 1147 | /* watch out for a 0 len io from a tricksy fs */ |
17f8c842 | 1148 | if (iov_iter_rw(iter) == READ && !iov_iter_count(iter)) |
f9b5570d CH |
1149 | return 0; |
1150 | ||
6e8267f5 | 1151 | dio = kmem_cache_alloc(dio_cache, GFP_KERNEL); |
1da177e4 LT |
1152 | retval = -ENOMEM; |
1153 | if (!dio) | |
1154 | goto out; | |
23aee091 JM |
1155 | /* |
1156 | * Believe it or not, zeroing out the page array caused a .5% | |
1157 | * performance regression in a database benchmark. So, we take | |
1158 | * care to only zero out what's needed. | |
1159 | */ | |
1160 | memset(dio, 0, offsetof(struct dio, pages)); | |
1da177e4 | 1161 | |
5fe878ae CH |
1162 | dio->flags = flags; |
1163 | if (dio->flags & DIO_LOCKING) { | |
17f8c842 | 1164 | if (iov_iter_rw(iter) == READ) { |
5fe878ae CH |
1165 | struct address_space *mapping = |
1166 | iocb->ki_filp->f_mapping; | |
1da177e4 | 1167 | |
5fe878ae | 1168 | /* will be released by direct_io_worker */ |
5955102c | 1169 | inode_lock(inode); |
1da177e4 LT |
1170 | |
1171 | retval = filemap_write_and_wait_range(mapping, offset, | |
1172 | end - 1); | |
1173 | if (retval) { | |
5955102c | 1174 | inode_unlock(inode); |
6e8267f5 | 1175 | kmem_cache_free(dio_cache, dio); |
1da177e4 LT |
1176 | goto out; |
1177 | } | |
1da177e4 | 1178 | } |
1da177e4 LT |
1179 | } |
1180 | ||
74cedf9b JK |
1181 | /* Once we sampled i_size check for reads beyond EOF */ |
1182 | dio->i_size = i_size_read(inode); | |
1183 | if (iov_iter_rw(iter) == READ && offset >= dio->i_size) { | |
1184 | if (dio->flags & DIO_LOCKING) | |
5955102c | 1185 | inode_unlock(inode); |
74cedf9b | 1186 | kmem_cache_free(dio_cache, dio); |
2d4594ac | 1187 | retval = 0; |
74cedf9b JK |
1188 | goto out; |
1189 | } | |
1190 | ||
1da177e4 | 1191 | /* |
60392573 CH |
1192 | * For file extending writes updating i_size before data writeouts |
1193 | * complete can expose uninitialized blocks in dumb filesystems. | |
1194 | * In that case we need to wait for I/O completion even if asked | |
1195 | * for an asynchronous write. | |
1da177e4 | 1196 | */ |
60392573 CH |
1197 | if (is_sync_kiocb(iocb)) |
1198 | dio->is_async = false; | |
1199 | else if (!(dio->flags & DIO_ASYNC_EXTEND) && | |
17f8c842 | 1200 | iov_iter_rw(iter) == WRITE && end > i_size_read(inode)) |
60392573 CH |
1201 | dio->is_async = false; |
1202 | else | |
1203 | dio->is_async = true; | |
1204 | ||
847cc637 | 1205 | dio->inode = inode; |
17f8c842 | 1206 | dio->rw = iov_iter_rw(iter) == WRITE ? WRITE_ODIRECT : READ; |
02afc27f CH |
1207 | |
1208 | /* | |
1209 | * For AIO O_(D)SYNC writes we need to defer completions to a workqueue | |
1210 | * so that we can call ->fsync. | |
1211 | */ | |
17f8c842 | 1212 | if (dio->is_async && iov_iter_rw(iter) == WRITE && |
02afc27f CH |
1213 | ((iocb->ki_filp->f_flags & O_DSYNC) || |
1214 | IS_SYNC(iocb->ki_filp->f_mapping->host))) { | |
1215 | retval = dio_set_defer_completion(dio); | |
1216 | if (retval) { | |
1217 | /* | |
1218 | * We grab i_mutex only for reads so we don't have | |
1219 | * to release it here | |
1220 | */ | |
1221 | kmem_cache_free(dio_cache, dio); | |
1222 | goto out; | |
1223 | } | |
1224 | } | |
1225 | ||
1226 | /* | |
1227 | * Will be decremented at I/O completion time. | |
1228 | */ | |
fe0f07d0 JA |
1229 | if (!(dio->flags & DIO_SKIP_DIO_COUNT)) |
1230 | inode_dio_begin(inode); | |
02afc27f CH |
1231 | |
1232 | retval = 0; | |
847cc637 | 1233 | sdio.blkbits = blkbits; |
ab73857e | 1234 | sdio.blkfactor = i_blkbits - blkbits; |
847cc637 AK |
1235 | sdio.block_in_file = offset >> blkbits; |
1236 | ||
1237 | sdio.get_block = get_block; | |
1238 | dio->end_io = end_io; | |
1239 | sdio.submit_io = submit_io; | |
1240 | sdio.final_block_in_bio = -1; | |
1241 | sdio.next_block_for_io = -1; | |
1242 | ||
1243 | dio->iocb = iocb; | |
847cc637 AK |
1244 | |
1245 | spin_lock_init(&dio->bio_lock); | |
1246 | dio->refcount = 1; | |
1247 | ||
53cbf3b1 | 1248 | dio->should_dirty = (iter->type == ITER_IOVEC); |
7b2c99d1 AV |
1249 | sdio.iter = iter; |
1250 | sdio.final_block_in_request = | |
1251 | (offset + iov_iter_count(iter)) >> blkbits; | |
1252 | ||
847cc637 AK |
1253 | /* |
1254 | * In case of non-aligned buffers, we may need 2 more | |
1255 | * pages since we need to zero out first and last block. | |
1256 | */ | |
1257 | if (unlikely(sdio.blkfactor)) | |
1258 | sdio.pages_in_io = 2; | |
1259 | ||
f67da30c | 1260 | sdio.pages_in_io += iov_iter_npages(iter, INT_MAX); |
847cc637 | 1261 | |
647d1e4c FW |
1262 | blk_start_plug(&plug); |
1263 | ||
7b2c99d1 AV |
1264 | retval = do_direct_IO(dio, &sdio, &map_bh); |
1265 | if (retval) | |
1266 | dio_cleanup(dio, &sdio); | |
847cc637 AK |
1267 | |
1268 | if (retval == -ENOTBLK) { | |
1269 | /* | |
1270 | * The remaining part of the request will be | |
1271 | * be handled by buffered I/O when we return | |
1272 | */ | |
1273 | retval = 0; | |
1274 | } | |
1275 | /* | |
1276 | * There may be some unwritten disk at the end of a part-written | |
1277 | * fs-block-sized block. Go zero that now. | |
1278 | */ | |
1279 | dio_zero_block(dio, &sdio, 1, &map_bh); | |
1280 | ||
1281 | if (sdio.cur_page) { | |
1282 | ssize_t ret2; | |
1283 | ||
1284 | ret2 = dio_send_cur_page(dio, &sdio, &map_bh); | |
1285 | if (retval == 0) | |
1286 | retval = ret2; | |
09cbfeaf | 1287 | put_page(sdio.cur_page); |
847cc637 AK |
1288 | sdio.cur_page = NULL; |
1289 | } | |
1290 | if (sdio.bio) | |
1291 | dio_bio_submit(dio, &sdio); | |
1292 | ||
647d1e4c FW |
1293 | blk_finish_plug(&plug); |
1294 | ||
847cc637 AK |
1295 | /* |
1296 | * It is possible that, we return short IO due to end of file. | |
1297 | * In that case, we need to release all the pages we got hold on. | |
1298 | */ | |
1299 | dio_cleanup(dio, &sdio); | |
1300 | ||
1301 | /* | |
1302 | * All block lookups have been performed. For READ requests | |
1303 | * we can let i_mutex go now that its achieved its purpose | |
1304 | * of protecting us from looking up uninitialized blocks. | |
1305 | */ | |
17f8c842 | 1306 | if (iov_iter_rw(iter) == READ && (dio->flags & DIO_LOCKING)) |
5955102c | 1307 | inode_unlock(dio->inode); |
847cc637 AK |
1308 | |
1309 | /* | |
1310 | * The only time we want to leave bios in flight is when a successful | |
1311 | * partial aio read or full aio write have been setup. In that case | |
1312 | * bio completion will call aio_complete. The only time it's safe to | |
1313 | * call aio_complete is when we return -EIOCBQUEUED, so we key on that. | |
1314 | * This had *better* be the only place that raises -EIOCBQUEUED. | |
1315 | */ | |
1316 | BUG_ON(retval == -EIOCBQUEUED); | |
1317 | if (dio->is_async && retval == 0 && dio->result && | |
17f8c842 | 1318 | (iov_iter_rw(iter) == READ || dio->result == count)) |
847cc637 | 1319 | retval = -EIOCBQUEUED; |
af436472 | 1320 | else |
847cc637 AK |
1321 | dio_await_completion(dio); |
1322 | ||
1323 | if (drop_refcount(dio) == 0) { | |
716b9bc0 | 1324 | retval = dio_complete(dio, retval, false); |
847cc637 AK |
1325 | } else |
1326 | BUG_ON(retval != -EIOCBQUEUED); | |
1da177e4 | 1327 | |
7bb46a67 | 1328 | out: |
1329 | return retval; | |
1330 | } | |
65dd2aa9 | 1331 | |
17f8c842 OS |
1332 | ssize_t __blockdev_direct_IO(struct kiocb *iocb, struct inode *inode, |
1333 | struct block_device *bdev, struct iov_iter *iter, | |
c8b8e32d | 1334 | get_block_t get_block, |
17f8c842 OS |
1335 | dio_iodone_t end_io, dio_submit_t submit_io, |
1336 | int flags) | |
65dd2aa9 AK |
1337 | { |
1338 | /* | |
1339 | * The block device state is needed in the end to finally | |
1340 | * submit everything. Since it's likely to be cache cold | |
1341 | * prefetch it here as first thing to hide some of the | |
1342 | * latency. | |
1343 | * | |
1344 | * Attempt to prefetch the pieces we likely need later. | |
1345 | */ | |
1346 | prefetch(&bdev->bd_disk->part_tbl); | |
1347 | prefetch(bdev->bd_queue); | |
1348 | prefetch((char *)bdev->bd_queue + SMP_CACHE_BYTES); | |
1349 | ||
c8b8e32d | 1350 | return do_blockdev_direct_IO(iocb, inode, bdev, iter, get_block, |
17f8c842 | 1351 | end_io, submit_io, flags); |
65dd2aa9 AK |
1352 | } |
1353 | ||
1da177e4 | 1354 | EXPORT_SYMBOL(__blockdev_direct_IO); |
6e8267f5 AK |
1355 | |
1356 | static __init int dio_init(void) | |
1357 | { | |
1358 | dio_cache = KMEM_CACHE(dio, SLAB_PANIC); | |
1359 | return 0; | |
1360 | } | |
1361 | module_init(dio_init) |