Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * linux/mm/filemap.c | |
3 | * | |
4 | * Copyright (C) 1994-1999 Linus Torvalds | |
5 | */ | |
6 | ||
7 | /* | |
8 | * This file handles the generic file mmap semantics used by | |
9 | * most "normal" filesystems (but you don't /have/ to use this: | |
10 | * the NFS filesystem used to do this differently, for example) | |
11 | */ | |
b95f1b31 | 12 | #include <linux/export.h> |
1da177e4 LT |
13 | #include <linux/compiler.h> |
14 | #include <linux/fs.h> | |
c22ce143 | 15 | #include <linux/uaccess.h> |
1da177e4 | 16 | #include <linux/aio.h> |
c59ede7b | 17 | #include <linux/capability.h> |
1da177e4 | 18 | #include <linux/kernel_stat.h> |
5a0e3ad6 | 19 | #include <linux/gfp.h> |
1da177e4 LT |
20 | #include <linux/mm.h> |
21 | #include <linux/swap.h> | |
22 | #include <linux/mman.h> | |
23 | #include <linux/pagemap.h> | |
24 | #include <linux/file.h> | |
25 | #include <linux/uio.h> | |
26 | #include <linux/hash.h> | |
27 | #include <linux/writeback.h> | |
53253383 | 28 | #include <linux/backing-dev.h> |
1da177e4 LT |
29 | #include <linux/pagevec.h> |
30 | #include <linux/blkdev.h> | |
31 | #include <linux/security.h> | |
44110fe3 | 32 | #include <linux/cpuset.h> |
2f718ffc | 33 | #include <linux/hardirq.h> /* for BUG_ON(!in_atomic()) only */ |
8a9f3ccd | 34 | #include <linux/memcontrol.h> |
c515e1fd | 35 | #include <linux/cleancache.h> |
0f8053a5 NP |
36 | #include "internal.h" |
37 | ||
fe0bfaaf RJ |
38 | #define CREATE_TRACE_POINTS |
39 | #include <trace/events/filemap.h> | |
40 | ||
1da177e4 | 41 | /* |
1da177e4 LT |
42 | * FIXME: remove all knowledge of the buffer layer from the core VM |
43 | */ | |
148f948b | 44 | #include <linux/buffer_head.h> /* for try_to_free_buffers */ |
1da177e4 | 45 | |
1da177e4 LT |
46 | #include <asm/mman.h> |
47 | ||
48 | /* | |
49 | * Shared mappings implemented 30.11.1994. It's not fully working yet, | |
50 | * though. | |
51 | * | |
52 | * Shared mappings now work. 15.8.1995 Bruno. | |
53 | * | |
54 | * finished 'unifying' the page and buffer cache and SMP-threaded the | |
55 | * page-cache, 21.05.1999, Ingo Molnar <mingo@redhat.com> | |
56 | * | |
57 | * SMP-threaded pagemap-LRU 1999, Andrea Arcangeli <andrea@suse.de> | |
58 | */ | |
59 | ||
60 | /* | |
61 | * Lock ordering: | |
62 | * | |
3d48ae45 | 63 | * ->i_mmap_mutex (truncate_pagecache) |
1da177e4 | 64 | * ->private_lock (__free_pte->__set_page_dirty_buffers) |
5d337b91 HD |
65 | * ->swap_lock (exclusive_swap_page, others) |
66 | * ->mapping->tree_lock | |
1da177e4 | 67 | * |
1b1dcc1b | 68 | * ->i_mutex |
3d48ae45 | 69 | * ->i_mmap_mutex (truncate->unmap_mapping_range) |
1da177e4 LT |
70 | * |
71 | * ->mmap_sem | |
3d48ae45 | 72 | * ->i_mmap_mutex |
b8072f09 | 73 | * ->page_table_lock or pte_lock (various, mainly in memory.c) |
1da177e4 LT |
74 | * ->mapping->tree_lock (arch-dependent flush_dcache_mmap_lock) |
75 | * | |
76 | * ->mmap_sem | |
77 | * ->lock_page (access_process_vm) | |
78 | * | |
82591e6e NP |
79 | * ->i_mutex (generic_file_buffered_write) |
80 | * ->mmap_sem (fault_in_pages_readable->do_page_fault) | |
1da177e4 | 81 | * |
f758eeab | 82 | * bdi->wb.list_lock |
a66979ab | 83 | * sb_lock (fs/fs-writeback.c) |
1da177e4 LT |
84 | * ->mapping->tree_lock (__sync_single_inode) |
85 | * | |
3d48ae45 | 86 | * ->i_mmap_mutex |
1da177e4 LT |
87 | * ->anon_vma.lock (vma_adjust) |
88 | * | |
89 | * ->anon_vma.lock | |
b8072f09 | 90 | * ->page_table_lock or pte_lock (anon_vma_prepare and various) |
1da177e4 | 91 | * |
b8072f09 | 92 | * ->page_table_lock or pte_lock |
5d337b91 | 93 | * ->swap_lock (try_to_unmap_one) |
1da177e4 LT |
94 | * ->private_lock (try_to_unmap_one) |
95 | * ->tree_lock (try_to_unmap_one) | |
96 | * ->zone.lru_lock (follow_page->mark_page_accessed) | |
053837fc | 97 | * ->zone.lru_lock (check_pte_range->isolate_lru_page) |
1da177e4 LT |
98 | * ->private_lock (page_remove_rmap->set_page_dirty) |
99 | * ->tree_lock (page_remove_rmap->set_page_dirty) | |
f758eeab | 100 | * bdi.wb->list_lock (page_remove_rmap->set_page_dirty) |
250df6ed | 101 | * ->inode->i_lock (page_remove_rmap->set_page_dirty) |
f758eeab | 102 | * bdi.wb->list_lock (zap_pte_range->set_page_dirty) |
250df6ed | 103 | * ->inode->i_lock (zap_pte_range->set_page_dirty) |
1da177e4 LT |
104 | * ->private_lock (zap_pte_range->__set_page_dirty_buffers) |
105 | * | |
9a3c531d AK |
106 | * ->i_mmap_mutex |
107 | * ->tasklist_lock (memory_failure, collect_procs_ao) | |
1da177e4 LT |
108 | */ |
109 | ||
91b0abe3 JW |
110 | static void page_cache_tree_delete(struct address_space *mapping, |
111 | struct page *page, void *shadow) | |
112 | { | |
113 | if (shadow) { | |
114 | void **slot; | |
115 | ||
116 | slot = radix_tree_lookup_slot(&mapping->page_tree, page->index); | |
117 | radix_tree_replace_slot(slot, shadow); | |
118 | mapping->nrshadows++; | |
119 | /* | |
120 | * Make sure the nrshadows update is committed before | |
121 | * the nrpages update so that final truncate racing | |
122 | * with reclaim does not see both counters 0 at the | |
123 | * same time and miss a shadow entry. | |
124 | */ | |
125 | smp_wmb(); | |
126 | } else | |
127 | radix_tree_delete(&mapping->page_tree, page->index); | |
128 | mapping->nrpages--; | |
129 | } | |
130 | ||
1da177e4 | 131 | /* |
e64a782f | 132 | * Delete a page from the page cache and free it. Caller has to make |
1da177e4 | 133 | * sure the page is locked and that nobody else uses it - or that usage |
19fd6231 | 134 | * is safe. The caller must hold the mapping's tree_lock. |
1da177e4 | 135 | */ |
91b0abe3 | 136 | void __delete_from_page_cache(struct page *page, void *shadow) |
1da177e4 LT |
137 | { |
138 | struct address_space *mapping = page->mapping; | |
139 | ||
fe0bfaaf | 140 | trace_mm_filemap_delete_from_page_cache(page); |
c515e1fd DM |
141 | /* |
142 | * if we're uptodate, flush out into the cleancache, otherwise | |
143 | * invalidate any existing cleancache entries. We can't leave | |
144 | * stale data around in the cleancache once our page is gone | |
145 | */ | |
146 | if (PageUptodate(page) && PageMappedToDisk(page)) | |
147 | cleancache_put_page(page); | |
148 | else | |
3167760f | 149 | cleancache_invalidate_page(mapping, page); |
c515e1fd | 150 | |
91b0abe3 JW |
151 | page_cache_tree_delete(mapping, page, shadow); |
152 | ||
1da177e4 | 153 | page->mapping = NULL; |
b85e0eff | 154 | /* Leave page->index set: truncation lookup relies upon it */ |
91b0abe3 | 155 | |
347ce434 | 156 | __dec_zone_page_state(page, NR_FILE_PAGES); |
4b02108a KM |
157 | if (PageSwapBacked(page)) |
158 | __dec_zone_page_state(page, NR_SHMEM); | |
45426812 | 159 | BUG_ON(page_mapped(page)); |
3a692790 LT |
160 | |
161 | /* | |
162 | * Some filesystems seem to re-dirty the page even after | |
163 | * the VM has canceled the dirty bit (eg ext3 journaling). | |
164 | * | |
165 | * Fix it up by doing a final dirty accounting check after | |
166 | * having removed the page entirely. | |
167 | */ | |
168 | if (PageDirty(page) && mapping_cap_account_dirty(mapping)) { | |
169 | dec_zone_page_state(page, NR_FILE_DIRTY); | |
170 | dec_bdi_stat(mapping->backing_dev_info, BDI_RECLAIMABLE); | |
171 | } | |
1da177e4 LT |
172 | } |
173 | ||
702cfbf9 MK |
174 | /** |
175 | * delete_from_page_cache - delete page from page cache | |
176 | * @page: the page which the kernel is trying to remove from page cache | |
177 | * | |
178 | * This must be called only on pages that have been verified to be in the page | |
179 | * cache and locked. It will never put the page into the free list, the caller | |
180 | * has a reference on the page. | |
181 | */ | |
182 | void delete_from_page_cache(struct page *page) | |
1da177e4 LT |
183 | { |
184 | struct address_space *mapping = page->mapping; | |
6072d13c | 185 | void (*freepage)(struct page *); |
1da177e4 | 186 | |
cd7619d6 | 187 | BUG_ON(!PageLocked(page)); |
1da177e4 | 188 | |
6072d13c | 189 | freepage = mapping->a_ops->freepage; |
19fd6231 | 190 | spin_lock_irq(&mapping->tree_lock); |
91b0abe3 | 191 | __delete_from_page_cache(page, NULL); |
19fd6231 | 192 | spin_unlock_irq(&mapping->tree_lock); |
e767e056 | 193 | mem_cgroup_uncharge_cache_page(page); |
6072d13c LT |
194 | |
195 | if (freepage) | |
196 | freepage(page); | |
97cecb5a MK |
197 | page_cache_release(page); |
198 | } | |
199 | EXPORT_SYMBOL(delete_from_page_cache); | |
200 | ||
7eaceacc | 201 | static int sleep_on_page(void *word) |
1da177e4 | 202 | { |
1da177e4 LT |
203 | io_schedule(); |
204 | return 0; | |
205 | } | |
206 | ||
7eaceacc | 207 | static int sleep_on_page_killable(void *word) |
2687a356 | 208 | { |
7eaceacc | 209 | sleep_on_page(word); |
2687a356 MW |
210 | return fatal_signal_pending(current) ? -EINTR : 0; |
211 | } | |
212 | ||
865ffef3 DM |
213 | static int filemap_check_errors(struct address_space *mapping) |
214 | { | |
215 | int ret = 0; | |
216 | /* Check for outstanding write errors */ | |
217 | if (test_and_clear_bit(AS_ENOSPC, &mapping->flags)) | |
218 | ret = -ENOSPC; | |
219 | if (test_and_clear_bit(AS_EIO, &mapping->flags)) | |
220 | ret = -EIO; | |
221 | return ret; | |
222 | } | |
223 | ||
1da177e4 | 224 | /** |
485bb99b | 225 | * __filemap_fdatawrite_range - start writeback on mapping dirty pages in range |
67be2dd1 MW |
226 | * @mapping: address space structure to write |
227 | * @start: offset in bytes where the range starts | |
469eb4d0 | 228 | * @end: offset in bytes where the range ends (inclusive) |
67be2dd1 | 229 | * @sync_mode: enable synchronous operation |
1da177e4 | 230 | * |
485bb99b RD |
231 | * Start writeback against all of a mapping's dirty pages that lie |
232 | * within the byte offsets <start, end> inclusive. | |
233 | * | |
1da177e4 | 234 | * If sync_mode is WB_SYNC_ALL then this is a "data integrity" operation, as |
485bb99b | 235 | * opposed to a regular memory cleansing writeback. The difference between |
1da177e4 LT |
236 | * these two operations is that if a dirty page/buffer is encountered, it must |
237 | * be waited upon, and not just skipped over. | |
238 | */ | |
ebcf28e1 AM |
239 | int __filemap_fdatawrite_range(struct address_space *mapping, loff_t start, |
240 | loff_t end, int sync_mode) | |
1da177e4 LT |
241 | { |
242 | int ret; | |
243 | struct writeback_control wbc = { | |
244 | .sync_mode = sync_mode, | |
05fe478d | 245 | .nr_to_write = LONG_MAX, |
111ebb6e OH |
246 | .range_start = start, |
247 | .range_end = end, | |
1da177e4 LT |
248 | }; |
249 | ||
250 | if (!mapping_cap_writeback_dirty(mapping)) | |
251 | return 0; | |
252 | ||
253 | ret = do_writepages(mapping, &wbc); | |
254 | return ret; | |
255 | } | |
256 | ||
257 | static inline int __filemap_fdatawrite(struct address_space *mapping, | |
258 | int sync_mode) | |
259 | { | |
111ebb6e | 260 | return __filemap_fdatawrite_range(mapping, 0, LLONG_MAX, sync_mode); |
1da177e4 LT |
261 | } |
262 | ||
263 | int filemap_fdatawrite(struct address_space *mapping) | |
264 | { | |
265 | return __filemap_fdatawrite(mapping, WB_SYNC_ALL); | |
266 | } | |
267 | EXPORT_SYMBOL(filemap_fdatawrite); | |
268 | ||
f4c0a0fd | 269 | int filemap_fdatawrite_range(struct address_space *mapping, loff_t start, |
ebcf28e1 | 270 | loff_t end) |
1da177e4 LT |
271 | { |
272 | return __filemap_fdatawrite_range(mapping, start, end, WB_SYNC_ALL); | |
273 | } | |
f4c0a0fd | 274 | EXPORT_SYMBOL(filemap_fdatawrite_range); |
1da177e4 | 275 | |
485bb99b RD |
276 | /** |
277 | * filemap_flush - mostly a non-blocking flush | |
278 | * @mapping: target address_space | |
279 | * | |
1da177e4 LT |
280 | * This is a mostly non-blocking flush. Not suitable for data-integrity |
281 | * purposes - I/O may not be started against all dirty pages. | |
282 | */ | |
283 | int filemap_flush(struct address_space *mapping) | |
284 | { | |
285 | return __filemap_fdatawrite(mapping, WB_SYNC_NONE); | |
286 | } | |
287 | EXPORT_SYMBOL(filemap_flush); | |
288 | ||
485bb99b | 289 | /** |
94004ed7 CH |
290 | * filemap_fdatawait_range - wait for writeback to complete |
291 | * @mapping: address space structure to wait for | |
292 | * @start_byte: offset in bytes where the range starts | |
293 | * @end_byte: offset in bytes where the range ends (inclusive) | |
485bb99b | 294 | * |
94004ed7 CH |
295 | * Walk the list of under-writeback pages of the given address space |
296 | * in the given range and wait for all of them. | |
1da177e4 | 297 | */ |
94004ed7 CH |
298 | int filemap_fdatawait_range(struct address_space *mapping, loff_t start_byte, |
299 | loff_t end_byte) | |
1da177e4 | 300 | { |
94004ed7 CH |
301 | pgoff_t index = start_byte >> PAGE_CACHE_SHIFT; |
302 | pgoff_t end = end_byte >> PAGE_CACHE_SHIFT; | |
1da177e4 LT |
303 | struct pagevec pvec; |
304 | int nr_pages; | |
865ffef3 | 305 | int ret2, ret = 0; |
1da177e4 | 306 | |
94004ed7 | 307 | if (end_byte < start_byte) |
865ffef3 | 308 | goto out; |
1da177e4 LT |
309 | |
310 | pagevec_init(&pvec, 0); | |
1da177e4 LT |
311 | while ((index <= end) && |
312 | (nr_pages = pagevec_lookup_tag(&pvec, mapping, &index, | |
313 | PAGECACHE_TAG_WRITEBACK, | |
314 | min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1)) != 0) { | |
315 | unsigned i; | |
316 | ||
317 | for (i = 0; i < nr_pages; i++) { | |
318 | struct page *page = pvec.pages[i]; | |
319 | ||
320 | /* until radix tree lookup accepts end_index */ | |
321 | if (page->index > end) | |
322 | continue; | |
323 | ||
324 | wait_on_page_writeback(page); | |
212260aa | 325 | if (TestClearPageError(page)) |
1da177e4 LT |
326 | ret = -EIO; |
327 | } | |
328 | pagevec_release(&pvec); | |
329 | cond_resched(); | |
330 | } | |
865ffef3 DM |
331 | out: |
332 | ret2 = filemap_check_errors(mapping); | |
333 | if (!ret) | |
334 | ret = ret2; | |
1da177e4 LT |
335 | |
336 | return ret; | |
337 | } | |
d3bccb6f JK |
338 | EXPORT_SYMBOL(filemap_fdatawait_range); |
339 | ||
1da177e4 | 340 | /** |
485bb99b | 341 | * filemap_fdatawait - wait for all under-writeback pages to complete |
1da177e4 | 342 | * @mapping: address space structure to wait for |
485bb99b RD |
343 | * |
344 | * Walk the list of under-writeback pages of the given address space | |
345 | * and wait for all of them. | |
1da177e4 LT |
346 | */ |
347 | int filemap_fdatawait(struct address_space *mapping) | |
348 | { | |
349 | loff_t i_size = i_size_read(mapping->host); | |
350 | ||
351 | if (i_size == 0) | |
352 | return 0; | |
353 | ||
94004ed7 | 354 | return filemap_fdatawait_range(mapping, 0, i_size - 1); |
1da177e4 LT |
355 | } |
356 | EXPORT_SYMBOL(filemap_fdatawait); | |
357 | ||
358 | int filemap_write_and_wait(struct address_space *mapping) | |
359 | { | |
28fd1298 | 360 | int err = 0; |
1da177e4 LT |
361 | |
362 | if (mapping->nrpages) { | |
28fd1298 OH |
363 | err = filemap_fdatawrite(mapping); |
364 | /* | |
365 | * Even if the above returned error, the pages may be | |
366 | * written partially (e.g. -ENOSPC), so we wait for it. | |
367 | * But the -EIO is special case, it may indicate the worst | |
368 | * thing (e.g. bug) happened, so we avoid waiting for it. | |
369 | */ | |
370 | if (err != -EIO) { | |
371 | int err2 = filemap_fdatawait(mapping); | |
372 | if (!err) | |
373 | err = err2; | |
374 | } | |
865ffef3 DM |
375 | } else { |
376 | err = filemap_check_errors(mapping); | |
1da177e4 | 377 | } |
28fd1298 | 378 | return err; |
1da177e4 | 379 | } |
28fd1298 | 380 | EXPORT_SYMBOL(filemap_write_and_wait); |
1da177e4 | 381 | |
485bb99b RD |
382 | /** |
383 | * filemap_write_and_wait_range - write out & wait on a file range | |
384 | * @mapping: the address_space for the pages | |
385 | * @lstart: offset in bytes where the range starts | |
386 | * @lend: offset in bytes where the range ends (inclusive) | |
387 | * | |
469eb4d0 AM |
388 | * Write out and wait upon file offsets lstart->lend, inclusive. |
389 | * | |
390 | * Note that `lend' is inclusive (describes the last byte to be written) so | |
391 | * that this function can be used to write to the very end-of-file (end = -1). | |
392 | */ | |
1da177e4 LT |
393 | int filemap_write_and_wait_range(struct address_space *mapping, |
394 | loff_t lstart, loff_t lend) | |
395 | { | |
28fd1298 | 396 | int err = 0; |
1da177e4 LT |
397 | |
398 | if (mapping->nrpages) { | |
28fd1298 OH |
399 | err = __filemap_fdatawrite_range(mapping, lstart, lend, |
400 | WB_SYNC_ALL); | |
401 | /* See comment of filemap_write_and_wait() */ | |
402 | if (err != -EIO) { | |
94004ed7 CH |
403 | int err2 = filemap_fdatawait_range(mapping, |
404 | lstart, lend); | |
28fd1298 OH |
405 | if (!err) |
406 | err = err2; | |
407 | } | |
865ffef3 DM |
408 | } else { |
409 | err = filemap_check_errors(mapping); | |
1da177e4 | 410 | } |
28fd1298 | 411 | return err; |
1da177e4 | 412 | } |
f6995585 | 413 | EXPORT_SYMBOL(filemap_write_and_wait_range); |
1da177e4 | 414 | |
ef6a3c63 MS |
415 | /** |
416 | * replace_page_cache_page - replace a pagecache page with a new one | |
417 | * @old: page to be replaced | |
418 | * @new: page to replace with | |
419 | * @gfp_mask: allocation mode | |
420 | * | |
421 | * This function replaces a page in the pagecache with a new one. On | |
422 | * success it acquires the pagecache reference for the new page and | |
423 | * drops it for the old page. Both the old and new pages must be | |
424 | * locked. This function does not add the new page to the LRU, the | |
425 | * caller must do that. | |
426 | * | |
427 | * The remove + add is atomic. The only way this function can fail is | |
428 | * memory allocation failure. | |
429 | */ | |
430 | int replace_page_cache_page(struct page *old, struct page *new, gfp_t gfp_mask) | |
431 | { | |
432 | int error; | |
ef6a3c63 | 433 | |
309381fe SL |
434 | VM_BUG_ON_PAGE(!PageLocked(old), old); |
435 | VM_BUG_ON_PAGE(!PageLocked(new), new); | |
436 | VM_BUG_ON_PAGE(new->mapping, new); | |
ef6a3c63 | 437 | |
ef6a3c63 MS |
438 | error = radix_tree_preload(gfp_mask & ~__GFP_HIGHMEM); |
439 | if (!error) { | |
440 | struct address_space *mapping = old->mapping; | |
441 | void (*freepage)(struct page *); | |
442 | ||
443 | pgoff_t offset = old->index; | |
444 | freepage = mapping->a_ops->freepage; | |
445 | ||
446 | page_cache_get(new); | |
447 | new->mapping = mapping; | |
448 | new->index = offset; | |
449 | ||
450 | spin_lock_irq(&mapping->tree_lock); | |
91b0abe3 | 451 | __delete_from_page_cache(old, NULL); |
ef6a3c63 MS |
452 | error = radix_tree_insert(&mapping->page_tree, offset, new); |
453 | BUG_ON(error); | |
454 | mapping->nrpages++; | |
455 | __inc_zone_page_state(new, NR_FILE_PAGES); | |
456 | if (PageSwapBacked(new)) | |
457 | __inc_zone_page_state(new, NR_SHMEM); | |
458 | spin_unlock_irq(&mapping->tree_lock); | |
ab936cbc KH |
459 | /* mem_cgroup codes must not be called under tree_lock */ |
460 | mem_cgroup_replace_page_cache(old, new); | |
ef6a3c63 MS |
461 | radix_tree_preload_end(); |
462 | if (freepage) | |
463 | freepage(old); | |
464 | page_cache_release(old); | |
ef6a3c63 MS |
465 | } |
466 | ||
467 | return error; | |
468 | } | |
469 | EXPORT_SYMBOL_GPL(replace_page_cache_page); | |
470 | ||
0cd6144a | 471 | static int page_cache_tree_insert(struct address_space *mapping, |
a528910e | 472 | struct page *page, void **shadowp) |
0cd6144a JW |
473 | { |
474 | void **slot; | |
475 | int error; | |
476 | ||
477 | slot = radix_tree_lookup_slot(&mapping->page_tree, page->index); | |
478 | if (slot) { | |
479 | void *p; | |
480 | ||
481 | p = radix_tree_deref_slot_protected(slot, &mapping->tree_lock); | |
482 | if (!radix_tree_exceptional_entry(p)) | |
483 | return -EEXIST; | |
484 | radix_tree_replace_slot(slot, page); | |
91b0abe3 | 485 | mapping->nrshadows--; |
0cd6144a | 486 | mapping->nrpages++; |
a528910e JW |
487 | if (shadowp) |
488 | *shadowp = p; | |
0cd6144a JW |
489 | return 0; |
490 | } | |
491 | error = radix_tree_insert(&mapping->page_tree, page->index, page); | |
492 | if (!error) | |
493 | mapping->nrpages++; | |
494 | return error; | |
495 | } | |
496 | ||
a528910e JW |
497 | static int __add_to_page_cache_locked(struct page *page, |
498 | struct address_space *mapping, | |
499 | pgoff_t offset, gfp_t gfp_mask, | |
500 | void **shadowp) | |
1da177e4 | 501 | { |
e286781d NP |
502 | int error; |
503 | ||
309381fe SL |
504 | VM_BUG_ON_PAGE(!PageLocked(page), page); |
505 | VM_BUG_ON_PAGE(PageSwapBacked(page), page); | |
e286781d NP |
506 | |
507 | error = mem_cgroup_cache_charge(page, current->mm, | |
2c26fdd7 | 508 | gfp_mask & GFP_RECLAIM_MASK); |
35c754d7 | 509 | if (error) |
66a0c8ee | 510 | return error; |
1da177e4 | 511 | |
5e4c0d97 | 512 | error = radix_tree_maybe_preload(gfp_mask & ~__GFP_HIGHMEM); |
66a0c8ee | 513 | if (error) { |
69029cd5 | 514 | mem_cgroup_uncharge_cache_page(page); |
66a0c8ee KS |
515 | return error; |
516 | } | |
517 | ||
518 | page_cache_get(page); | |
519 | page->mapping = mapping; | |
520 | page->index = offset; | |
521 | ||
522 | spin_lock_irq(&mapping->tree_lock); | |
a528910e | 523 | error = page_cache_tree_insert(mapping, page, shadowp); |
66a0c8ee KS |
524 | radix_tree_preload_end(); |
525 | if (unlikely(error)) | |
526 | goto err_insert; | |
66a0c8ee KS |
527 | __inc_zone_page_state(page, NR_FILE_PAGES); |
528 | spin_unlock_irq(&mapping->tree_lock); | |
529 | trace_mm_filemap_add_to_page_cache(page); | |
530 | return 0; | |
531 | err_insert: | |
532 | page->mapping = NULL; | |
533 | /* Leave page->index set: truncation relies upon it */ | |
534 | spin_unlock_irq(&mapping->tree_lock); | |
535 | mem_cgroup_uncharge_cache_page(page); | |
536 | page_cache_release(page); | |
1da177e4 LT |
537 | return error; |
538 | } | |
a528910e JW |
539 | |
540 | /** | |
541 | * add_to_page_cache_locked - add a locked page to the pagecache | |
542 | * @page: page to add | |
543 | * @mapping: the page's address_space | |
544 | * @offset: page index | |
545 | * @gfp_mask: page allocation mode | |
546 | * | |
547 | * This function is used to add a page to the pagecache. It must be locked. | |
548 | * This function does not add the page to the LRU. The caller must do that. | |
549 | */ | |
550 | int add_to_page_cache_locked(struct page *page, struct address_space *mapping, | |
551 | pgoff_t offset, gfp_t gfp_mask) | |
552 | { | |
553 | return __add_to_page_cache_locked(page, mapping, offset, | |
554 | gfp_mask, NULL); | |
555 | } | |
e286781d | 556 | EXPORT_SYMBOL(add_to_page_cache_locked); |
1da177e4 LT |
557 | |
558 | int add_to_page_cache_lru(struct page *page, struct address_space *mapping, | |
6daa0e28 | 559 | pgoff_t offset, gfp_t gfp_mask) |
1da177e4 | 560 | { |
a528910e | 561 | void *shadow = NULL; |
4f98a2fe RR |
562 | int ret; |
563 | ||
a528910e JW |
564 | __set_page_locked(page); |
565 | ret = __add_to_page_cache_locked(page, mapping, offset, | |
566 | gfp_mask, &shadow); | |
567 | if (unlikely(ret)) | |
568 | __clear_page_locked(page); | |
569 | else { | |
570 | /* | |
571 | * The page might have been evicted from cache only | |
572 | * recently, in which case it should be activated like | |
573 | * any other repeatedly accessed page. | |
574 | */ | |
575 | if (shadow && workingset_refault(shadow)) { | |
576 | SetPageActive(page); | |
577 | workingset_activation(page); | |
578 | } else | |
579 | ClearPageActive(page); | |
580 | lru_cache_add(page); | |
581 | } | |
1da177e4 LT |
582 | return ret; |
583 | } | |
18bc0bbd | 584 | EXPORT_SYMBOL_GPL(add_to_page_cache_lru); |
1da177e4 | 585 | |
44110fe3 | 586 | #ifdef CONFIG_NUMA |
2ae88149 | 587 | struct page *__page_cache_alloc(gfp_t gfp) |
44110fe3 | 588 | { |
c0ff7453 MX |
589 | int n; |
590 | struct page *page; | |
591 | ||
44110fe3 | 592 | if (cpuset_do_page_mem_spread()) { |
cc9a6c87 MG |
593 | unsigned int cpuset_mems_cookie; |
594 | do { | |
d26914d1 | 595 | cpuset_mems_cookie = read_mems_allowed_begin(); |
cc9a6c87 MG |
596 | n = cpuset_mem_spread_node(); |
597 | page = alloc_pages_exact_node(n, gfp, 0); | |
d26914d1 | 598 | } while (!page && read_mems_allowed_retry(cpuset_mems_cookie)); |
cc9a6c87 | 599 | |
c0ff7453 | 600 | return page; |
44110fe3 | 601 | } |
2ae88149 | 602 | return alloc_pages(gfp, 0); |
44110fe3 | 603 | } |
2ae88149 | 604 | EXPORT_SYMBOL(__page_cache_alloc); |
44110fe3 PJ |
605 | #endif |
606 | ||
1da177e4 LT |
607 | /* |
608 | * In order to wait for pages to become available there must be | |
609 | * waitqueues associated with pages. By using a hash table of | |
610 | * waitqueues where the bucket discipline is to maintain all | |
611 | * waiters on the same queue and wake all when any of the pages | |
612 | * become available, and for the woken contexts to check to be | |
613 | * sure the appropriate page became available, this saves space | |
614 | * at a cost of "thundering herd" phenomena during rare hash | |
615 | * collisions. | |
616 | */ | |
617 | static wait_queue_head_t *page_waitqueue(struct page *page) | |
618 | { | |
619 | const struct zone *zone = page_zone(page); | |
620 | ||
621 | return &zone->wait_table[hash_ptr(page, zone->wait_table_bits)]; | |
622 | } | |
623 | ||
624 | static inline void wake_up_page(struct page *page, int bit) | |
625 | { | |
626 | __wake_up_bit(page_waitqueue(page), &page->flags, bit); | |
627 | } | |
628 | ||
920c7a5d | 629 | void wait_on_page_bit(struct page *page, int bit_nr) |
1da177e4 LT |
630 | { |
631 | DEFINE_WAIT_BIT(wait, &page->flags, bit_nr); | |
632 | ||
633 | if (test_bit(bit_nr, &page->flags)) | |
7eaceacc | 634 | __wait_on_bit(page_waitqueue(page), &wait, sleep_on_page, |
1da177e4 LT |
635 | TASK_UNINTERRUPTIBLE); |
636 | } | |
637 | EXPORT_SYMBOL(wait_on_page_bit); | |
638 | ||
f62e00cc KM |
639 | int wait_on_page_bit_killable(struct page *page, int bit_nr) |
640 | { | |
641 | DEFINE_WAIT_BIT(wait, &page->flags, bit_nr); | |
642 | ||
643 | if (!test_bit(bit_nr, &page->flags)) | |
644 | return 0; | |
645 | ||
646 | return __wait_on_bit(page_waitqueue(page), &wait, | |
647 | sleep_on_page_killable, TASK_KILLABLE); | |
648 | } | |
649 | ||
385e1ca5 DH |
650 | /** |
651 | * add_page_wait_queue - Add an arbitrary waiter to a page's wait queue | |
697f619f RD |
652 | * @page: Page defining the wait queue of interest |
653 | * @waiter: Waiter to add to the queue | |
385e1ca5 DH |
654 | * |
655 | * Add an arbitrary @waiter to the wait queue for the nominated @page. | |
656 | */ | |
657 | void add_page_wait_queue(struct page *page, wait_queue_t *waiter) | |
658 | { | |
659 | wait_queue_head_t *q = page_waitqueue(page); | |
660 | unsigned long flags; | |
661 | ||
662 | spin_lock_irqsave(&q->lock, flags); | |
663 | __add_wait_queue(q, waiter); | |
664 | spin_unlock_irqrestore(&q->lock, flags); | |
665 | } | |
666 | EXPORT_SYMBOL_GPL(add_page_wait_queue); | |
667 | ||
1da177e4 | 668 | /** |
485bb99b | 669 | * unlock_page - unlock a locked page |
1da177e4 LT |
670 | * @page: the page |
671 | * | |
672 | * Unlocks the page and wakes up sleepers in ___wait_on_page_locked(). | |
673 | * Also wakes sleepers in wait_on_page_writeback() because the wakeup | |
674 | * mechananism between PageLocked pages and PageWriteback pages is shared. | |
675 | * But that's OK - sleepers in wait_on_page_writeback() just go back to sleep. | |
676 | * | |
8413ac9d NP |
677 | * The mb is necessary to enforce ordering between the clear_bit and the read |
678 | * of the waitqueue (to avoid SMP races with a parallel wait_on_page_locked()). | |
1da177e4 | 679 | */ |
920c7a5d | 680 | void unlock_page(struct page *page) |
1da177e4 | 681 | { |
309381fe | 682 | VM_BUG_ON_PAGE(!PageLocked(page), page); |
8413ac9d NP |
683 | clear_bit_unlock(PG_locked, &page->flags); |
684 | smp_mb__after_clear_bit(); | |
1da177e4 LT |
685 | wake_up_page(page, PG_locked); |
686 | } | |
687 | EXPORT_SYMBOL(unlock_page); | |
688 | ||
485bb99b RD |
689 | /** |
690 | * end_page_writeback - end writeback against a page | |
691 | * @page: the page | |
1da177e4 LT |
692 | */ |
693 | void end_page_writeback(struct page *page) | |
694 | { | |
ac6aadb2 MS |
695 | if (TestClearPageReclaim(page)) |
696 | rotate_reclaimable_page(page); | |
697 | ||
698 | if (!test_clear_page_writeback(page)) | |
699 | BUG(); | |
700 | ||
1da177e4 LT |
701 | smp_mb__after_clear_bit(); |
702 | wake_up_page(page, PG_writeback); | |
703 | } | |
704 | EXPORT_SYMBOL(end_page_writeback); | |
705 | ||
485bb99b RD |
706 | /** |
707 | * __lock_page - get a lock on the page, assuming we need to sleep to get it | |
708 | * @page: the page to lock | |
1da177e4 | 709 | */ |
920c7a5d | 710 | void __lock_page(struct page *page) |
1da177e4 LT |
711 | { |
712 | DEFINE_WAIT_BIT(wait, &page->flags, PG_locked); | |
713 | ||
7eaceacc | 714 | __wait_on_bit_lock(page_waitqueue(page), &wait, sleep_on_page, |
1da177e4 LT |
715 | TASK_UNINTERRUPTIBLE); |
716 | } | |
717 | EXPORT_SYMBOL(__lock_page); | |
718 | ||
b5606c2d | 719 | int __lock_page_killable(struct page *page) |
2687a356 MW |
720 | { |
721 | DEFINE_WAIT_BIT(wait, &page->flags, PG_locked); | |
722 | ||
723 | return __wait_on_bit_lock(page_waitqueue(page), &wait, | |
7eaceacc | 724 | sleep_on_page_killable, TASK_KILLABLE); |
2687a356 | 725 | } |
18bc0bbd | 726 | EXPORT_SYMBOL_GPL(__lock_page_killable); |
2687a356 | 727 | |
d065bd81 ML |
728 | int __lock_page_or_retry(struct page *page, struct mm_struct *mm, |
729 | unsigned int flags) | |
730 | { | |
37b23e05 KM |
731 | if (flags & FAULT_FLAG_ALLOW_RETRY) { |
732 | /* | |
733 | * CAUTION! In this case, mmap_sem is not released | |
734 | * even though return 0. | |
735 | */ | |
736 | if (flags & FAULT_FLAG_RETRY_NOWAIT) | |
737 | return 0; | |
738 | ||
739 | up_read(&mm->mmap_sem); | |
740 | if (flags & FAULT_FLAG_KILLABLE) | |
741 | wait_on_page_locked_killable(page); | |
742 | else | |
318b275f | 743 | wait_on_page_locked(page); |
d065bd81 | 744 | return 0; |
37b23e05 KM |
745 | } else { |
746 | if (flags & FAULT_FLAG_KILLABLE) { | |
747 | int ret; | |
748 | ||
749 | ret = __lock_page_killable(page); | |
750 | if (ret) { | |
751 | up_read(&mm->mmap_sem); | |
752 | return 0; | |
753 | } | |
754 | } else | |
755 | __lock_page(page); | |
756 | return 1; | |
d065bd81 ML |
757 | } |
758 | } | |
759 | ||
e7b563bb JW |
760 | /** |
761 | * page_cache_next_hole - find the next hole (not-present entry) | |
762 | * @mapping: mapping | |
763 | * @index: index | |
764 | * @max_scan: maximum range to search | |
765 | * | |
766 | * Search the set [index, min(index+max_scan-1, MAX_INDEX)] for the | |
767 | * lowest indexed hole. | |
768 | * | |
769 | * Returns: the index of the hole if found, otherwise returns an index | |
770 | * outside of the set specified (in which case 'return - index >= | |
771 | * max_scan' will be true). In rare cases of index wrap-around, 0 will | |
772 | * be returned. | |
773 | * | |
774 | * page_cache_next_hole may be called under rcu_read_lock. However, | |
775 | * like radix_tree_gang_lookup, this will not atomically search a | |
776 | * snapshot of the tree at a single point in time. For example, if a | |
777 | * hole is created at index 5, then subsequently a hole is created at | |
778 | * index 10, page_cache_next_hole covering both indexes may return 10 | |
779 | * if called under rcu_read_lock. | |
780 | */ | |
781 | pgoff_t page_cache_next_hole(struct address_space *mapping, | |
782 | pgoff_t index, unsigned long max_scan) | |
783 | { | |
784 | unsigned long i; | |
785 | ||
786 | for (i = 0; i < max_scan; i++) { | |
0cd6144a JW |
787 | struct page *page; |
788 | ||
789 | page = radix_tree_lookup(&mapping->page_tree, index); | |
790 | if (!page || radix_tree_exceptional_entry(page)) | |
e7b563bb JW |
791 | break; |
792 | index++; | |
793 | if (index == 0) | |
794 | break; | |
795 | } | |
796 | ||
797 | return index; | |
798 | } | |
799 | EXPORT_SYMBOL(page_cache_next_hole); | |
800 | ||
801 | /** | |
802 | * page_cache_prev_hole - find the prev hole (not-present entry) | |
803 | * @mapping: mapping | |
804 | * @index: index | |
805 | * @max_scan: maximum range to search | |
806 | * | |
807 | * Search backwards in the range [max(index-max_scan+1, 0), index] for | |
808 | * the first hole. | |
809 | * | |
810 | * Returns: the index of the hole if found, otherwise returns an index | |
811 | * outside of the set specified (in which case 'index - return >= | |
812 | * max_scan' will be true). In rare cases of wrap-around, ULONG_MAX | |
813 | * will be returned. | |
814 | * | |
815 | * page_cache_prev_hole may be called under rcu_read_lock. However, | |
816 | * like radix_tree_gang_lookup, this will not atomically search a | |
817 | * snapshot of the tree at a single point in time. For example, if a | |
818 | * hole is created at index 10, then subsequently a hole is created at | |
819 | * index 5, page_cache_prev_hole covering both indexes may return 5 if | |
820 | * called under rcu_read_lock. | |
821 | */ | |
822 | pgoff_t page_cache_prev_hole(struct address_space *mapping, | |
823 | pgoff_t index, unsigned long max_scan) | |
824 | { | |
825 | unsigned long i; | |
826 | ||
827 | for (i = 0; i < max_scan; i++) { | |
0cd6144a JW |
828 | struct page *page; |
829 | ||
830 | page = radix_tree_lookup(&mapping->page_tree, index); | |
831 | if (!page || radix_tree_exceptional_entry(page)) | |
e7b563bb JW |
832 | break; |
833 | index--; | |
834 | if (index == ULONG_MAX) | |
835 | break; | |
836 | } | |
837 | ||
838 | return index; | |
839 | } | |
840 | EXPORT_SYMBOL(page_cache_prev_hole); | |
841 | ||
485bb99b | 842 | /** |
0cd6144a | 843 | * find_get_entry - find and get a page cache entry |
485bb99b | 844 | * @mapping: the address_space to search |
0cd6144a JW |
845 | * @offset: the page cache index |
846 | * | |
847 | * Looks up the page cache slot at @mapping & @offset. If there is a | |
848 | * page cache page, it is returned with an increased refcount. | |
485bb99b | 849 | * |
0cd6144a JW |
850 | * If the slot holds a shadow entry of a previously evicted page, it |
851 | * is returned. | |
852 | * | |
853 | * Otherwise, %NULL is returned. | |
1da177e4 | 854 | */ |
0cd6144a | 855 | struct page *find_get_entry(struct address_space *mapping, pgoff_t offset) |
1da177e4 | 856 | { |
a60637c8 | 857 | void **pagep; |
1da177e4 LT |
858 | struct page *page; |
859 | ||
a60637c8 NP |
860 | rcu_read_lock(); |
861 | repeat: | |
862 | page = NULL; | |
863 | pagep = radix_tree_lookup_slot(&mapping->page_tree, offset); | |
864 | if (pagep) { | |
865 | page = radix_tree_deref_slot(pagep); | |
27d20fdd NP |
866 | if (unlikely(!page)) |
867 | goto out; | |
a2c16d6c | 868 | if (radix_tree_exception(page)) { |
8079b1c8 HD |
869 | if (radix_tree_deref_retry(page)) |
870 | goto repeat; | |
871 | /* | |
872 | * Otherwise, shmem/tmpfs must be storing a swap entry | |
873 | * here as an exceptional entry: so return it without | |
874 | * attempting to raise page count. | |
875 | */ | |
876 | goto out; | |
a2c16d6c | 877 | } |
a60637c8 NP |
878 | if (!page_cache_get_speculative(page)) |
879 | goto repeat; | |
880 | ||
881 | /* | |
882 | * Has the page moved? | |
883 | * This is part of the lockless pagecache protocol. See | |
884 | * include/linux/pagemap.h for details. | |
885 | */ | |
886 | if (unlikely(page != *pagep)) { | |
887 | page_cache_release(page); | |
888 | goto repeat; | |
889 | } | |
890 | } | |
27d20fdd | 891 | out: |
a60637c8 NP |
892 | rcu_read_unlock(); |
893 | ||
1da177e4 LT |
894 | return page; |
895 | } | |
0cd6144a | 896 | EXPORT_SYMBOL(find_get_entry); |
1da177e4 | 897 | |
1da177e4 | 898 | /** |
0cd6144a | 899 | * find_get_page - find and get a page reference |
67be2dd1 MW |
900 | * @mapping: the address_space to search |
901 | * @offset: the page index | |
1da177e4 | 902 | * |
0cd6144a JW |
903 | * Looks up the page cache slot at @mapping & @offset. If there is a |
904 | * page cache page, it is returned with an increased refcount. | |
1da177e4 | 905 | * |
0cd6144a | 906 | * Otherwise, %NULL is returned. |
1da177e4 | 907 | */ |
0cd6144a JW |
908 | struct page *find_get_page(struct address_space *mapping, pgoff_t offset) |
909 | { | |
910 | struct page *page = find_get_entry(mapping, offset); | |
911 | ||
912 | if (radix_tree_exceptional_entry(page)) | |
913 | page = NULL; | |
914 | return page; | |
915 | } | |
916 | EXPORT_SYMBOL(find_get_page); | |
917 | ||
918 | /** | |
919 | * find_lock_entry - locate, pin and lock a page cache entry | |
920 | * @mapping: the address_space to search | |
921 | * @offset: the page cache index | |
922 | * | |
923 | * Looks up the page cache slot at @mapping & @offset. If there is a | |
924 | * page cache page, it is returned locked and with an increased | |
925 | * refcount. | |
926 | * | |
927 | * If the slot holds a shadow entry of a previously evicted page, it | |
928 | * is returned. | |
929 | * | |
930 | * Otherwise, %NULL is returned. | |
931 | * | |
932 | * find_lock_entry() may sleep. | |
933 | */ | |
934 | struct page *find_lock_entry(struct address_space *mapping, pgoff_t offset) | |
1da177e4 LT |
935 | { |
936 | struct page *page; | |
937 | ||
1da177e4 | 938 | repeat: |
0cd6144a | 939 | page = find_get_entry(mapping, offset); |
a2c16d6c | 940 | if (page && !radix_tree_exception(page)) { |
a60637c8 NP |
941 | lock_page(page); |
942 | /* Has the page been truncated? */ | |
943 | if (unlikely(page->mapping != mapping)) { | |
944 | unlock_page(page); | |
945 | page_cache_release(page); | |
946 | goto repeat; | |
1da177e4 | 947 | } |
309381fe | 948 | VM_BUG_ON_PAGE(page->index != offset, page); |
1da177e4 | 949 | } |
1da177e4 LT |
950 | return page; |
951 | } | |
0cd6144a JW |
952 | EXPORT_SYMBOL(find_lock_entry); |
953 | ||
954 | /** | |
955 | * find_lock_page - locate, pin and lock a pagecache page | |
956 | * @mapping: the address_space to search | |
957 | * @offset: the page index | |
958 | * | |
959 | * Looks up the page cache slot at @mapping & @offset. If there is a | |
960 | * page cache page, it is returned locked and with an increased | |
961 | * refcount. | |
962 | * | |
963 | * Otherwise, %NULL is returned. | |
964 | * | |
965 | * find_lock_page() may sleep. | |
966 | */ | |
967 | struct page *find_lock_page(struct address_space *mapping, pgoff_t offset) | |
968 | { | |
969 | struct page *page = find_lock_entry(mapping, offset); | |
970 | ||
971 | if (radix_tree_exceptional_entry(page)) | |
972 | page = NULL; | |
973 | return page; | |
974 | } | |
1da177e4 LT |
975 | EXPORT_SYMBOL(find_lock_page); |
976 | ||
977 | /** | |
978 | * find_or_create_page - locate or add a pagecache page | |
67be2dd1 MW |
979 | * @mapping: the page's address_space |
980 | * @index: the page's index into the mapping | |
981 | * @gfp_mask: page allocation mode | |
1da177e4 | 982 | * |
0cd6144a JW |
983 | * Looks up the page cache slot at @mapping & @offset. If there is a |
984 | * page cache page, it is returned locked and with an increased | |
985 | * refcount. | |
986 | * | |
987 | * If the page is not present, a new page is allocated using @gfp_mask | |
988 | * and added to the page cache and the VM's LRU list. The page is | |
989 | * returned locked and with an increased refcount. | |
1da177e4 | 990 | * |
0cd6144a | 991 | * On memory exhaustion, %NULL is returned. |
1da177e4 | 992 | * |
0cd6144a JW |
993 | * find_or_create_page() may sleep, even if @gfp_flags specifies an |
994 | * atomic allocation! | |
1da177e4 LT |
995 | */ |
996 | struct page *find_or_create_page(struct address_space *mapping, | |
57f6b96c | 997 | pgoff_t index, gfp_t gfp_mask) |
1da177e4 | 998 | { |
eb2be189 | 999 | struct page *page; |
1da177e4 LT |
1000 | int err; |
1001 | repeat: | |
1002 | page = find_lock_page(mapping, index); | |
1003 | if (!page) { | |
eb2be189 NP |
1004 | page = __page_cache_alloc(gfp_mask); |
1005 | if (!page) | |
1006 | return NULL; | |
67d58ac4 NP |
1007 | /* |
1008 | * We want a regular kernel memory (not highmem or DMA etc) | |
1009 | * allocation for the radix tree nodes, but we need to honour | |
1010 | * the context-specific requirements the caller has asked for. | |
1011 | * GFP_RECLAIM_MASK collects those requirements. | |
1012 | */ | |
1013 | err = add_to_page_cache_lru(page, mapping, index, | |
1014 | (gfp_mask & GFP_RECLAIM_MASK)); | |
eb2be189 NP |
1015 | if (unlikely(err)) { |
1016 | page_cache_release(page); | |
1017 | page = NULL; | |
1018 | if (err == -EEXIST) | |
1019 | goto repeat; | |
1da177e4 | 1020 | } |
1da177e4 | 1021 | } |
1da177e4 LT |
1022 | return page; |
1023 | } | |
1da177e4 LT |
1024 | EXPORT_SYMBOL(find_or_create_page); |
1025 | ||
0cd6144a JW |
1026 | /** |
1027 | * find_get_entries - gang pagecache lookup | |
1028 | * @mapping: The address_space to search | |
1029 | * @start: The starting page cache index | |
1030 | * @nr_entries: The maximum number of entries | |
1031 | * @entries: Where the resulting entries are placed | |
1032 | * @indices: The cache indices corresponding to the entries in @entries | |
1033 | * | |
1034 | * find_get_entries() will search for and return a group of up to | |
1035 | * @nr_entries entries in the mapping. The entries are placed at | |
1036 | * @entries. find_get_entries() takes a reference against any actual | |
1037 | * pages it returns. | |
1038 | * | |
1039 | * The search returns a group of mapping-contiguous page cache entries | |
1040 | * with ascending indexes. There may be holes in the indices due to | |
1041 | * not-present pages. | |
1042 | * | |
1043 | * Any shadow entries of evicted pages are included in the returned | |
1044 | * array. | |
1045 | * | |
1046 | * find_get_entries() returns the number of pages and shadow entries | |
1047 | * which were found. | |
1048 | */ | |
1049 | unsigned find_get_entries(struct address_space *mapping, | |
1050 | pgoff_t start, unsigned int nr_entries, | |
1051 | struct page **entries, pgoff_t *indices) | |
1052 | { | |
1053 | void **slot; | |
1054 | unsigned int ret = 0; | |
1055 | struct radix_tree_iter iter; | |
1056 | ||
1057 | if (!nr_entries) | |
1058 | return 0; | |
1059 | ||
1060 | rcu_read_lock(); | |
1061 | restart: | |
1062 | radix_tree_for_each_slot(slot, &mapping->page_tree, &iter, start) { | |
1063 | struct page *page; | |
1064 | repeat: | |
1065 | page = radix_tree_deref_slot(slot); | |
1066 | if (unlikely(!page)) | |
1067 | continue; | |
1068 | if (radix_tree_exception(page)) { | |
1069 | if (radix_tree_deref_retry(page)) | |
1070 | goto restart; | |
1071 | /* | |
1072 | * Otherwise, we must be storing a swap entry | |
1073 | * here as an exceptional entry: so return it | |
1074 | * without attempting to raise page count. | |
1075 | */ | |
1076 | goto export; | |
1077 | } | |
1078 | if (!page_cache_get_speculative(page)) | |
1079 | goto repeat; | |
1080 | ||
1081 | /* Has the page moved? */ | |
1082 | if (unlikely(page != *slot)) { | |
1083 | page_cache_release(page); | |
1084 | goto repeat; | |
1085 | } | |
1086 | export: | |
1087 | indices[ret] = iter.index; | |
1088 | entries[ret] = page; | |
1089 | if (++ret == nr_entries) | |
1090 | break; | |
1091 | } | |
1092 | rcu_read_unlock(); | |
1093 | return ret; | |
1094 | } | |
1095 | ||
1da177e4 LT |
1096 | /** |
1097 | * find_get_pages - gang pagecache lookup | |
1098 | * @mapping: The address_space to search | |
1099 | * @start: The starting page index | |
1100 | * @nr_pages: The maximum number of pages | |
1101 | * @pages: Where the resulting pages are placed | |
1102 | * | |
1103 | * find_get_pages() will search for and return a group of up to | |
1104 | * @nr_pages pages in the mapping. The pages are placed at @pages. | |
1105 | * find_get_pages() takes a reference against the returned pages. | |
1106 | * | |
1107 | * The search returns a group of mapping-contiguous pages with ascending | |
1108 | * indexes. There may be holes in the indices due to not-present pages. | |
1109 | * | |
1110 | * find_get_pages() returns the number of pages which were found. | |
1111 | */ | |
1112 | unsigned find_get_pages(struct address_space *mapping, pgoff_t start, | |
1113 | unsigned int nr_pages, struct page **pages) | |
1114 | { | |
0fc9d104 KK |
1115 | struct radix_tree_iter iter; |
1116 | void **slot; | |
1117 | unsigned ret = 0; | |
1118 | ||
1119 | if (unlikely(!nr_pages)) | |
1120 | return 0; | |
a60637c8 NP |
1121 | |
1122 | rcu_read_lock(); | |
1123 | restart: | |
0fc9d104 | 1124 | radix_tree_for_each_slot(slot, &mapping->page_tree, &iter, start) { |
a60637c8 NP |
1125 | struct page *page; |
1126 | repeat: | |
0fc9d104 | 1127 | page = radix_tree_deref_slot(slot); |
a60637c8 NP |
1128 | if (unlikely(!page)) |
1129 | continue; | |
9d8aa4ea | 1130 | |
a2c16d6c | 1131 | if (radix_tree_exception(page)) { |
8079b1c8 HD |
1132 | if (radix_tree_deref_retry(page)) { |
1133 | /* | |
1134 | * Transient condition which can only trigger | |
1135 | * when entry at index 0 moves out of or back | |
1136 | * to root: none yet gotten, safe to restart. | |
1137 | */ | |
0fc9d104 | 1138 | WARN_ON(iter.index); |
8079b1c8 HD |
1139 | goto restart; |
1140 | } | |
a2c16d6c | 1141 | /* |
8079b1c8 HD |
1142 | * Otherwise, shmem/tmpfs must be storing a swap entry |
1143 | * here as an exceptional entry: so skip over it - | |
1144 | * we only reach this from invalidate_mapping_pages(). | |
a2c16d6c | 1145 | */ |
8079b1c8 | 1146 | continue; |
27d20fdd | 1147 | } |
a60637c8 NP |
1148 | |
1149 | if (!page_cache_get_speculative(page)) | |
1150 | goto repeat; | |
1151 | ||
1152 | /* Has the page moved? */ | |
0fc9d104 | 1153 | if (unlikely(page != *slot)) { |
a60637c8 NP |
1154 | page_cache_release(page); |
1155 | goto repeat; | |
1156 | } | |
1da177e4 | 1157 | |
a60637c8 | 1158 | pages[ret] = page; |
0fc9d104 KK |
1159 | if (++ret == nr_pages) |
1160 | break; | |
a60637c8 | 1161 | } |
5b280c0c | 1162 | |
a60637c8 | 1163 | rcu_read_unlock(); |
1da177e4 LT |
1164 | return ret; |
1165 | } | |
1166 | ||
ebf43500 JA |
1167 | /** |
1168 | * find_get_pages_contig - gang contiguous pagecache lookup | |
1169 | * @mapping: The address_space to search | |
1170 | * @index: The starting page index | |
1171 | * @nr_pages: The maximum number of pages | |
1172 | * @pages: Where the resulting pages are placed | |
1173 | * | |
1174 | * find_get_pages_contig() works exactly like find_get_pages(), except | |
1175 | * that the returned number of pages are guaranteed to be contiguous. | |
1176 | * | |
1177 | * find_get_pages_contig() returns the number of pages which were found. | |
1178 | */ | |
1179 | unsigned find_get_pages_contig(struct address_space *mapping, pgoff_t index, | |
1180 | unsigned int nr_pages, struct page **pages) | |
1181 | { | |
0fc9d104 KK |
1182 | struct radix_tree_iter iter; |
1183 | void **slot; | |
1184 | unsigned int ret = 0; | |
1185 | ||
1186 | if (unlikely(!nr_pages)) | |
1187 | return 0; | |
a60637c8 NP |
1188 | |
1189 | rcu_read_lock(); | |
1190 | restart: | |
0fc9d104 | 1191 | radix_tree_for_each_contig(slot, &mapping->page_tree, &iter, index) { |
a60637c8 NP |
1192 | struct page *page; |
1193 | repeat: | |
0fc9d104 KK |
1194 | page = radix_tree_deref_slot(slot); |
1195 | /* The hole, there no reason to continue */ | |
a60637c8 | 1196 | if (unlikely(!page)) |
0fc9d104 | 1197 | break; |
9d8aa4ea | 1198 | |
a2c16d6c | 1199 | if (radix_tree_exception(page)) { |
8079b1c8 HD |
1200 | if (radix_tree_deref_retry(page)) { |
1201 | /* | |
1202 | * Transient condition which can only trigger | |
1203 | * when entry at index 0 moves out of or back | |
1204 | * to root: none yet gotten, safe to restart. | |
1205 | */ | |
1206 | goto restart; | |
1207 | } | |
a2c16d6c | 1208 | /* |
8079b1c8 HD |
1209 | * Otherwise, shmem/tmpfs must be storing a swap entry |
1210 | * here as an exceptional entry: so stop looking for | |
1211 | * contiguous pages. | |
a2c16d6c | 1212 | */ |
8079b1c8 | 1213 | break; |
a2c16d6c | 1214 | } |
ebf43500 | 1215 | |
a60637c8 NP |
1216 | if (!page_cache_get_speculative(page)) |
1217 | goto repeat; | |
1218 | ||
1219 | /* Has the page moved? */ | |
0fc9d104 | 1220 | if (unlikely(page != *slot)) { |
a60637c8 NP |
1221 | page_cache_release(page); |
1222 | goto repeat; | |
1223 | } | |
1224 | ||
9cbb4cb2 NP |
1225 | /* |
1226 | * must check mapping and index after taking the ref. | |
1227 | * otherwise we can get both false positives and false | |
1228 | * negatives, which is just confusing to the caller. | |
1229 | */ | |
0fc9d104 | 1230 | if (page->mapping == NULL || page->index != iter.index) { |
9cbb4cb2 NP |
1231 | page_cache_release(page); |
1232 | break; | |
1233 | } | |
1234 | ||
a60637c8 | 1235 | pages[ret] = page; |
0fc9d104 KK |
1236 | if (++ret == nr_pages) |
1237 | break; | |
ebf43500 | 1238 | } |
a60637c8 NP |
1239 | rcu_read_unlock(); |
1240 | return ret; | |
ebf43500 | 1241 | } |
ef71c15c | 1242 | EXPORT_SYMBOL(find_get_pages_contig); |
ebf43500 | 1243 | |
485bb99b RD |
1244 | /** |
1245 | * find_get_pages_tag - find and return pages that match @tag | |
1246 | * @mapping: the address_space to search | |
1247 | * @index: the starting page index | |
1248 | * @tag: the tag index | |
1249 | * @nr_pages: the maximum number of pages | |
1250 | * @pages: where the resulting pages are placed | |
1251 | * | |
1da177e4 | 1252 | * Like find_get_pages, except we only return pages which are tagged with |
485bb99b | 1253 | * @tag. We update @index to index the next page for the traversal. |
1da177e4 LT |
1254 | */ |
1255 | unsigned find_get_pages_tag(struct address_space *mapping, pgoff_t *index, | |
1256 | int tag, unsigned int nr_pages, struct page **pages) | |
1257 | { | |
0fc9d104 KK |
1258 | struct radix_tree_iter iter; |
1259 | void **slot; | |
1260 | unsigned ret = 0; | |
1261 | ||
1262 | if (unlikely(!nr_pages)) | |
1263 | return 0; | |
a60637c8 NP |
1264 | |
1265 | rcu_read_lock(); | |
1266 | restart: | |
0fc9d104 KK |
1267 | radix_tree_for_each_tagged(slot, &mapping->page_tree, |
1268 | &iter, *index, tag) { | |
a60637c8 NP |
1269 | struct page *page; |
1270 | repeat: | |
0fc9d104 | 1271 | page = radix_tree_deref_slot(slot); |
a60637c8 NP |
1272 | if (unlikely(!page)) |
1273 | continue; | |
9d8aa4ea | 1274 | |
a2c16d6c | 1275 | if (radix_tree_exception(page)) { |
8079b1c8 HD |
1276 | if (radix_tree_deref_retry(page)) { |
1277 | /* | |
1278 | * Transient condition which can only trigger | |
1279 | * when entry at index 0 moves out of or back | |
1280 | * to root: none yet gotten, safe to restart. | |
1281 | */ | |
1282 | goto restart; | |
1283 | } | |
a2c16d6c | 1284 | /* |
8079b1c8 HD |
1285 | * This function is never used on a shmem/tmpfs |
1286 | * mapping, so a swap entry won't be found here. | |
a2c16d6c | 1287 | */ |
8079b1c8 | 1288 | BUG(); |
a2c16d6c | 1289 | } |
a60637c8 NP |
1290 | |
1291 | if (!page_cache_get_speculative(page)) | |
1292 | goto repeat; | |
1293 | ||
1294 | /* Has the page moved? */ | |
0fc9d104 | 1295 | if (unlikely(page != *slot)) { |
a60637c8 NP |
1296 | page_cache_release(page); |
1297 | goto repeat; | |
1298 | } | |
1299 | ||
1300 | pages[ret] = page; | |
0fc9d104 KK |
1301 | if (++ret == nr_pages) |
1302 | break; | |
a60637c8 | 1303 | } |
5b280c0c | 1304 | |
a60637c8 | 1305 | rcu_read_unlock(); |
1da177e4 | 1306 | |
1da177e4 LT |
1307 | if (ret) |
1308 | *index = pages[ret - 1]->index + 1; | |
a60637c8 | 1309 | |
1da177e4 LT |
1310 | return ret; |
1311 | } | |
ef71c15c | 1312 | EXPORT_SYMBOL(find_get_pages_tag); |
1da177e4 | 1313 | |
485bb99b RD |
1314 | /** |
1315 | * grab_cache_page_nowait - returns locked page at given index in given cache | |
1316 | * @mapping: target address_space | |
1317 | * @index: the page index | |
1318 | * | |
72fd4a35 | 1319 | * Same as grab_cache_page(), but do not wait if the page is unavailable. |
1da177e4 LT |
1320 | * This is intended for speculative data generators, where the data can |
1321 | * be regenerated if the page couldn't be grabbed. This routine should | |
1322 | * be safe to call while holding the lock for another page. | |
1323 | * | |
1324 | * Clear __GFP_FS when allocating the page to avoid recursion into the fs | |
1325 | * and deadlock against the caller's locked page. | |
1326 | */ | |
1327 | struct page * | |
57f6b96c | 1328 | grab_cache_page_nowait(struct address_space *mapping, pgoff_t index) |
1da177e4 LT |
1329 | { |
1330 | struct page *page = find_get_page(mapping, index); | |
1da177e4 LT |
1331 | |
1332 | if (page) { | |
529ae9aa | 1333 | if (trylock_page(page)) |
1da177e4 LT |
1334 | return page; |
1335 | page_cache_release(page); | |
1336 | return NULL; | |
1337 | } | |
2ae88149 | 1338 | page = __page_cache_alloc(mapping_gfp_mask(mapping) & ~__GFP_FS); |
67d58ac4 | 1339 | if (page && add_to_page_cache_lru(page, mapping, index, GFP_NOFS)) { |
1da177e4 LT |
1340 | page_cache_release(page); |
1341 | page = NULL; | |
1342 | } | |
1343 | return page; | |
1344 | } | |
1da177e4 LT |
1345 | EXPORT_SYMBOL(grab_cache_page_nowait); |
1346 | ||
76d42bd9 WF |
1347 | /* |
1348 | * CD/DVDs are error prone. When a medium error occurs, the driver may fail | |
1349 | * a _large_ part of the i/o request. Imagine the worst scenario: | |
1350 | * | |
1351 | * ---R__________________________________________B__________ | |
1352 | * ^ reading here ^ bad block(assume 4k) | |
1353 | * | |
1354 | * read(R) => miss => readahead(R...B) => media error => frustrating retries | |
1355 | * => failing the whole request => read(R) => read(R+1) => | |
1356 | * readahead(R+1...B+1) => bang => read(R+2) => read(R+3) => | |
1357 | * readahead(R+3...B+2) => bang => read(R+3) => read(R+4) => | |
1358 | * readahead(R+4...B+3) => bang => read(R+4) => read(R+5) => ...... | |
1359 | * | |
1360 | * It is going insane. Fix it by quickly scaling down the readahead size. | |
1361 | */ | |
1362 | static void shrink_readahead_size_eio(struct file *filp, | |
1363 | struct file_ra_state *ra) | |
1364 | { | |
76d42bd9 | 1365 | ra->ra_pages /= 4; |
76d42bd9 WF |
1366 | } |
1367 | ||
485bb99b | 1368 | /** |
36e78914 | 1369 | * do_generic_file_read - generic file read routine |
485bb99b RD |
1370 | * @filp: the file to read |
1371 | * @ppos: current file position | |
1372 | * @desc: read_descriptor | |
485bb99b | 1373 | * |
1da177e4 | 1374 | * This is a generic file read routine, and uses the |
485bb99b | 1375 | * mapping->a_ops->readpage() function for the actual low-level stuff. |
1da177e4 LT |
1376 | * |
1377 | * This is really ugly. But the goto's actually try to clarify some | |
1378 | * of the logic when it comes to error handling etc. | |
1da177e4 | 1379 | */ |
36e78914 | 1380 | static void do_generic_file_read(struct file *filp, loff_t *ppos, |
b77d88d4 | 1381 | read_descriptor_t *desc) |
1da177e4 | 1382 | { |
36e78914 | 1383 | struct address_space *mapping = filp->f_mapping; |
1da177e4 | 1384 | struct inode *inode = mapping->host; |
36e78914 | 1385 | struct file_ra_state *ra = &filp->f_ra; |
57f6b96c FW |
1386 | pgoff_t index; |
1387 | pgoff_t last_index; | |
1388 | pgoff_t prev_index; | |
1389 | unsigned long offset; /* offset into pagecache page */ | |
ec0f1637 | 1390 | unsigned int prev_offset; |
1da177e4 | 1391 | int error; |
1da177e4 | 1392 | |
1da177e4 | 1393 | index = *ppos >> PAGE_CACHE_SHIFT; |
7ff81078 FW |
1394 | prev_index = ra->prev_pos >> PAGE_CACHE_SHIFT; |
1395 | prev_offset = ra->prev_pos & (PAGE_CACHE_SIZE-1); | |
1da177e4 LT |
1396 | last_index = (*ppos + desc->count + PAGE_CACHE_SIZE-1) >> PAGE_CACHE_SHIFT; |
1397 | offset = *ppos & ~PAGE_CACHE_MASK; | |
1398 | ||
1da177e4 LT |
1399 | for (;;) { |
1400 | struct page *page; | |
57f6b96c | 1401 | pgoff_t end_index; |
a32ea1e1 | 1402 | loff_t isize; |
1da177e4 LT |
1403 | unsigned long nr, ret; |
1404 | ||
1da177e4 | 1405 | cond_resched(); |
1da177e4 LT |
1406 | find_page: |
1407 | page = find_get_page(mapping, index); | |
3ea89ee8 | 1408 | if (!page) { |
cf914a7d | 1409 | page_cache_sync_readahead(mapping, |
7ff81078 | 1410 | ra, filp, |
3ea89ee8 FW |
1411 | index, last_index - index); |
1412 | page = find_get_page(mapping, index); | |
1413 | if (unlikely(page == NULL)) | |
1414 | goto no_cached_page; | |
1415 | } | |
1416 | if (PageReadahead(page)) { | |
cf914a7d | 1417 | page_cache_async_readahead(mapping, |
7ff81078 | 1418 | ra, filp, page, |
3ea89ee8 | 1419 | index, last_index - index); |
1da177e4 | 1420 | } |
8ab22b9a HH |
1421 | if (!PageUptodate(page)) { |
1422 | if (inode->i_blkbits == PAGE_CACHE_SHIFT || | |
1423 | !mapping->a_ops->is_partially_uptodate) | |
1424 | goto page_not_up_to_date; | |
529ae9aa | 1425 | if (!trylock_page(page)) |
8ab22b9a | 1426 | goto page_not_up_to_date; |
8d056cb9 DH |
1427 | /* Did it get truncated before we got the lock? */ |
1428 | if (!page->mapping) | |
1429 | goto page_not_up_to_date_locked; | |
8ab22b9a HH |
1430 | if (!mapping->a_ops->is_partially_uptodate(page, |
1431 | desc, offset)) | |
1432 | goto page_not_up_to_date_locked; | |
1433 | unlock_page(page); | |
1434 | } | |
1da177e4 | 1435 | page_ok: |
a32ea1e1 N |
1436 | /* |
1437 | * i_size must be checked after we know the page is Uptodate. | |
1438 | * | |
1439 | * Checking i_size after the check allows us to calculate | |
1440 | * the correct value for "nr", which means the zero-filled | |
1441 | * part of the page is not copied back to userspace (unless | |
1442 | * another truncate extends the file - this is desired though). | |
1443 | */ | |
1444 | ||
1445 | isize = i_size_read(inode); | |
1446 | end_index = (isize - 1) >> PAGE_CACHE_SHIFT; | |
1447 | if (unlikely(!isize || index > end_index)) { | |
1448 | page_cache_release(page); | |
1449 | goto out; | |
1450 | } | |
1451 | ||
1452 | /* nr is the maximum number of bytes to copy from this page */ | |
1453 | nr = PAGE_CACHE_SIZE; | |
1454 | if (index == end_index) { | |
1455 | nr = ((isize - 1) & ~PAGE_CACHE_MASK) + 1; | |
1456 | if (nr <= offset) { | |
1457 | page_cache_release(page); | |
1458 | goto out; | |
1459 | } | |
1460 | } | |
1461 | nr = nr - offset; | |
1da177e4 LT |
1462 | |
1463 | /* If users can be writing to this page using arbitrary | |
1464 | * virtual addresses, take care about potential aliasing | |
1465 | * before reading the page on the kernel side. | |
1466 | */ | |
1467 | if (mapping_writably_mapped(mapping)) | |
1468 | flush_dcache_page(page); | |
1469 | ||
1470 | /* | |
ec0f1637 JK |
1471 | * When a sequential read accesses a page several times, |
1472 | * only mark it as accessed the first time. | |
1da177e4 | 1473 | */ |
ec0f1637 | 1474 | if (prev_index != index || offset != prev_offset) |
1da177e4 LT |
1475 | mark_page_accessed(page); |
1476 | prev_index = index; | |
1477 | ||
1478 | /* | |
1479 | * Ok, we have the page, and it's up-to-date, so | |
1480 | * now we can copy it to user space... | |
1481 | * | |
b77d88d4 KS |
1482 | * The file_read_actor routine returns how many bytes were |
1483 | * actually used.. | |
1da177e4 LT |
1484 | * NOTE! This may not be the same as how much of a user buffer |
1485 | * we filled up (we may be padding etc), so we can only update | |
1486 | * "pos" here (the actor routine has to update the user buffer | |
1487 | * pointers and the remaining count). | |
1488 | */ | |
b77d88d4 | 1489 | ret = file_read_actor(desc, page, offset, nr); |
1da177e4 LT |
1490 | offset += ret; |
1491 | index += offset >> PAGE_CACHE_SHIFT; | |
1492 | offset &= ~PAGE_CACHE_MASK; | |
6ce745ed | 1493 | prev_offset = offset; |
1da177e4 LT |
1494 | |
1495 | page_cache_release(page); | |
1496 | if (ret == nr && desc->count) | |
1497 | continue; | |
1498 | goto out; | |
1499 | ||
1500 | page_not_up_to_date: | |
1501 | /* Get exclusive access to the page ... */ | |
85462323 ON |
1502 | error = lock_page_killable(page); |
1503 | if (unlikely(error)) | |
1504 | goto readpage_error; | |
1da177e4 | 1505 | |
8ab22b9a | 1506 | page_not_up_to_date_locked: |
da6052f7 | 1507 | /* Did it get truncated before we got the lock? */ |
1da177e4 LT |
1508 | if (!page->mapping) { |
1509 | unlock_page(page); | |
1510 | page_cache_release(page); | |
1511 | continue; | |
1512 | } | |
1513 | ||
1514 | /* Did somebody else fill it already? */ | |
1515 | if (PageUptodate(page)) { | |
1516 | unlock_page(page); | |
1517 | goto page_ok; | |
1518 | } | |
1519 | ||
1520 | readpage: | |
91803b49 JM |
1521 | /* |
1522 | * A previous I/O error may have been due to temporary | |
1523 | * failures, eg. multipath errors. | |
1524 | * PG_error will be set again if readpage fails. | |
1525 | */ | |
1526 | ClearPageError(page); | |
1da177e4 LT |
1527 | /* Start the actual read. The read will unlock the page. */ |
1528 | error = mapping->a_ops->readpage(filp, page); | |
1529 | ||
994fc28c ZB |
1530 | if (unlikely(error)) { |
1531 | if (error == AOP_TRUNCATED_PAGE) { | |
1532 | page_cache_release(page); | |
1533 | goto find_page; | |
1534 | } | |
1da177e4 | 1535 | goto readpage_error; |
994fc28c | 1536 | } |
1da177e4 LT |
1537 | |
1538 | if (!PageUptodate(page)) { | |
85462323 ON |
1539 | error = lock_page_killable(page); |
1540 | if (unlikely(error)) | |
1541 | goto readpage_error; | |
1da177e4 LT |
1542 | if (!PageUptodate(page)) { |
1543 | if (page->mapping == NULL) { | |
1544 | /* | |
2ecdc82e | 1545 | * invalidate_mapping_pages got it |
1da177e4 LT |
1546 | */ |
1547 | unlock_page(page); | |
1548 | page_cache_release(page); | |
1549 | goto find_page; | |
1550 | } | |
1551 | unlock_page(page); | |
7ff81078 | 1552 | shrink_readahead_size_eio(filp, ra); |
85462323 ON |
1553 | error = -EIO; |
1554 | goto readpage_error; | |
1da177e4 LT |
1555 | } |
1556 | unlock_page(page); | |
1557 | } | |
1558 | ||
1da177e4 LT |
1559 | goto page_ok; |
1560 | ||
1561 | readpage_error: | |
1562 | /* UHHUH! A synchronous read error occurred. Report it */ | |
1563 | desc->error = error; | |
1564 | page_cache_release(page); | |
1565 | goto out; | |
1566 | ||
1567 | no_cached_page: | |
1568 | /* | |
1569 | * Ok, it wasn't cached, so we need to create a new | |
1570 | * page.. | |
1571 | */ | |
eb2be189 NP |
1572 | page = page_cache_alloc_cold(mapping); |
1573 | if (!page) { | |
1574 | desc->error = -ENOMEM; | |
1575 | goto out; | |
1da177e4 | 1576 | } |
eb2be189 | 1577 | error = add_to_page_cache_lru(page, mapping, |
1da177e4 LT |
1578 | index, GFP_KERNEL); |
1579 | if (error) { | |
eb2be189 | 1580 | page_cache_release(page); |
1da177e4 LT |
1581 | if (error == -EEXIST) |
1582 | goto find_page; | |
1583 | desc->error = error; | |
1584 | goto out; | |
1585 | } | |
1da177e4 LT |
1586 | goto readpage; |
1587 | } | |
1588 | ||
1589 | out: | |
7ff81078 FW |
1590 | ra->prev_pos = prev_index; |
1591 | ra->prev_pos <<= PAGE_CACHE_SHIFT; | |
1592 | ra->prev_pos |= prev_offset; | |
1da177e4 | 1593 | |
f4e6b498 | 1594 | *ppos = ((loff_t)index << PAGE_CACHE_SHIFT) + offset; |
0c6aa263 | 1595 | file_accessed(filp); |
1da177e4 | 1596 | } |
1da177e4 LT |
1597 | |
1598 | int file_read_actor(read_descriptor_t *desc, struct page *page, | |
1599 | unsigned long offset, unsigned long size) | |
1600 | { | |
1601 | char *kaddr; | |
1602 | unsigned long left, count = desc->count; | |
1603 | ||
1604 | if (size > count) | |
1605 | size = count; | |
1606 | ||
1607 | /* | |
1608 | * Faults on the destination of a read are common, so do it before | |
1609 | * taking the kmap. | |
1610 | */ | |
1611 | if (!fault_in_pages_writeable(desc->arg.buf, size)) { | |
9b04c5fe | 1612 | kaddr = kmap_atomic(page); |
1da177e4 LT |
1613 | left = __copy_to_user_inatomic(desc->arg.buf, |
1614 | kaddr + offset, size); | |
9b04c5fe | 1615 | kunmap_atomic(kaddr); |
1da177e4 LT |
1616 | if (left == 0) |
1617 | goto success; | |
1618 | } | |
1619 | ||
1620 | /* Do it the slow way */ | |
1621 | kaddr = kmap(page); | |
1622 | left = __copy_to_user(desc->arg.buf, kaddr + offset, size); | |
1623 | kunmap(page); | |
1624 | ||
1625 | if (left) { | |
1626 | size -= left; | |
1627 | desc->error = -EFAULT; | |
1628 | } | |
1629 | success: | |
1630 | desc->count = count - size; | |
1631 | desc->written += size; | |
1632 | desc->arg.buf += size; | |
1633 | return size; | |
1634 | } | |
1635 | ||
0ceb3314 DM |
1636 | /* |
1637 | * Performs necessary checks before doing a write | |
1638 | * @iov: io vector request | |
1639 | * @nr_segs: number of segments in the iovec | |
1640 | * @count: number of bytes to write | |
1641 | * @access_flags: type of access: %VERIFY_READ or %VERIFY_WRITE | |
1642 | * | |
1643 | * Adjust number of segments and amount of bytes to write (nr_segs should be | |
1644 | * properly initialized first). Returns appropriate error code that caller | |
1645 | * should return or zero in case that write should be allowed. | |
1646 | */ | |
1647 | int generic_segment_checks(const struct iovec *iov, | |
1648 | unsigned long *nr_segs, size_t *count, int access_flags) | |
1649 | { | |
1650 | unsigned long seg; | |
1651 | size_t cnt = 0; | |
1652 | for (seg = 0; seg < *nr_segs; seg++) { | |
1653 | const struct iovec *iv = &iov[seg]; | |
1654 | ||
1655 | /* | |
1656 | * If any segment has a negative length, or the cumulative | |
1657 | * length ever wraps negative then return -EINVAL. | |
1658 | */ | |
1659 | cnt += iv->iov_len; | |
1660 | if (unlikely((ssize_t)(cnt|iv->iov_len) < 0)) | |
1661 | return -EINVAL; | |
1662 | if (access_ok(access_flags, iv->iov_base, iv->iov_len)) | |
1663 | continue; | |
1664 | if (seg == 0) | |
1665 | return -EFAULT; | |
1666 | *nr_segs = seg; | |
1667 | cnt -= iv->iov_len; /* This segment is no good */ | |
1668 | break; | |
1669 | } | |
1670 | *count = cnt; | |
1671 | return 0; | |
1672 | } | |
1673 | EXPORT_SYMBOL(generic_segment_checks); | |
1674 | ||
485bb99b | 1675 | /** |
b2abacf3 | 1676 | * generic_file_aio_read - generic filesystem read routine |
485bb99b RD |
1677 | * @iocb: kernel I/O control block |
1678 | * @iov: io vector request | |
1679 | * @nr_segs: number of segments in the iovec | |
b2abacf3 | 1680 | * @pos: current file position |
485bb99b | 1681 | * |
1da177e4 LT |
1682 | * This is the "read()" routine for all filesystems |
1683 | * that can use the page cache directly. | |
1684 | */ | |
1685 | ssize_t | |
543ade1f BP |
1686 | generic_file_aio_read(struct kiocb *iocb, const struct iovec *iov, |
1687 | unsigned long nr_segs, loff_t pos) | |
1da177e4 LT |
1688 | { |
1689 | struct file *filp = iocb->ki_filp; | |
1690 | ssize_t retval; | |
66f998f6 | 1691 | unsigned long seg = 0; |
1da177e4 | 1692 | size_t count; |
543ade1f | 1693 | loff_t *ppos = &iocb->ki_pos; |
1da177e4 LT |
1694 | |
1695 | count = 0; | |
0ceb3314 DM |
1696 | retval = generic_segment_checks(iov, &nr_segs, &count, VERIFY_WRITE); |
1697 | if (retval) | |
1698 | return retval; | |
1da177e4 LT |
1699 | |
1700 | /* coalesce the iovecs and go direct-to-BIO for O_DIRECT */ | |
1701 | if (filp->f_flags & O_DIRECT) { | |
543ade1f | 1702 | loff_t size; |
1da177e4 LT |
1703 | struct address_space *mapping; |
1704 | struct inode *inode; | |
1705 | ||
1706 | mapping = filp->f_mapping; | |
1707 | inode = mapping->host; | |
1da177e4 LT |
1708 | if (!count) |
1709 | goto out; /* skip atime */ | |
1710 | size = i_size_read(inode); | |
9fe55eea | 1711 | retval = filemap_write_and_wait_range(mapping, pos, |
48b47c56 | 1712 | pos + iov_length(iov, nr_segs) - 1); |
9fe55eea SW |
1713 | if (!retval) { |
1714 | retval = mapping->a_ops->direct_IO(READ, iocb, | |
1715 | iov, pos, nr_segs); | |
1716 | } | |
1717 | if (retval > 0) { | |
1718 | *ppos = pos + retval; | |
1719 | count -= retval; | |
1720 | } | |
66f998f6 | 1721 | |
9fe55eea SW |
1722 | /* |
1723 | * Btrfs can have a short DIO read if we encounter | |
1724 | * compressed extents, so if there was an error, or if | |
1725 | * we've already read everything we wanted to, or if | |
1726 | * there was a short read because we hit EOF, go ahead | |
1727 | * and return. Otherwise fallthrough to buffered io for | |
1728 | * the rest of the read. | |
1729 | */ | |
1730 | if (retval < 0 || !count || *ppos >= size) { | |
1731 | file_accessed(filp); | |
1732 | goto out; | |
0e0bcae3 | 1733 | } |
1da177e4 LT |
1734 | } |
1735 | ||
66f998f6 | 1736 | count = retval; |
11fa977e HD |
1737 | for (seg = 0; seg < nr_segs; seg++) { |
1738 | read_descriptor_t desc; | |
66f998f6 JB |
1739 | loff_t offset = 0; |
1740 | ||
1741 | /* | |
1742 | * If we did a short DIO read we need to skip the section of the | |
1743 | * iov that we've already read data into. | |
1744 | */ | |
1745 | if (count) { | |
1746 | if (count > iov[seg].iov_len) { | |
1747 | count -= iov[seg].iov_len; | |
1748 | continue; | |
1749 | } | |
1750 | offset = count; | |
1751 | count = 0; | |
1752 | } | |
1da177e4 | 1753 | |
11fa977e | 1754 | desc.written = 0; |
66f998f6 JB |
1755 | desc.arg.buf = iov[seg].iov_base + offset; |
1756 | desc.count = iov[seg].iov_len - offset; | |
11fa977e HD |
1757 | if (desc.count == 0) |
1758 | continue; | |
1759 | desc.error = 0; | |
b77d88d4 | 1760 | do_generic_file_read(filp, ppos, &desc); |
11fa977e HD |
1761 | retval += desc.written; |
1762 | if (desc.error) { | |
1763 | retval = retval ?: desc.error; | |
1764 | break; | |
1da177e4 | 1765 | } |
11fa977e HD |
1766 | if (desc.count > 0) |
1767 | break; | |
1da177e4 LT |
1768 | } |
1769 | out: | |
1770 | return retval; | |
1771 | } | |
1da177e4 LT |
1772 | EXPORT_SYMBOL(generic_file_aio_read); |
1773 | ||
1da177e4 | 1774 | #ifdef CONFIG_MMU |
485bb99b RD |
1775 | /** |
1776 | * page_cache_read - adds requested page to the page cache if not already there | |
1777 | * @file: file to read | |
1778 | * @offset: page index | |
1779 | * | |
1da177e4 LT |
1780 | * This adds the requested page to the page cache if it isn't already there, |
1781 | * and schedules an I/O to read in its contents from disk. | |
1782 | */ | |
920c7a5d | 1783 | static int page_cache_read(struct file *file, pgoff_t offset) |
1da177e4 LT |
1784 | { |
1785 | struct address_space *mapping = file->f_mapping; | |
1786 | struct page *page; | |
994fc28c | 1787 | int ret; |
1da177e4 | 1788 | |
994fc28c ZB |
1789 | do { |
1790 | page = page_cache_alloc_cold(mapping); | |
1791 | if (!page) | |
1792 | return -ENOMEM; | |
1793 | ||
1794 | ret = add_to_page_cache_lru(page, mapping, offset, GFP_KERNEL); | |
1795 | if (ret == 0) | |
1796 | ret = mapping->a_ops->readpage(file, page); | |
1797 | else if (ret == -EEXIST) | |
1798 | ret = 0; /* losing race to add is OK */ | |
1da177e4 | 1799 | |
1da177e4 | 1800 | page_cache_release(page); |
1da177e4 | 1801 | |
994fc28c ZB |
1802 | } while (ret == AOP_TRUNCATED_PAGE); |
1803 | ||
1804 | return ret; | |
1da177e4 LT |
1805 | } |
1806 | ||
1807 | #define MMAP_LOTSAMISS (100) | |
1808 | ||
ef00e08e LT |
1809 | /* |
1810 | * Synchronous readahead happens when we don't even find | |
1811 | * a page in the page cache at all. | |
1812 | */ | |
1813 | static void do_sync_mmap_readahead(struct vm_area_struct *vma, | |
1814 | struct file_ra_state *ra, | |
1815 | struct file *file, | |
1816 | pgoff_t offset) | |
1817 | { | |
1818 | unsigned long ra_pages; | |
1819 | struct address_space *mapping = file->f_mapping; | |
1820 | ||
1821 | /* If we don't want any read-ahead, don't bother */ | |
64363aad | 1822 | if (vma->vm_flags & VM_RAND_READ) |
ef00e08e | 1823 | return; |
275b12bf WF |
1824 | if (!ra->ra_pages) |
1825 | return; | |
ef00e08e | 1826 | |
64363aad | 1827 | if (vma->vm_flags & VM_SEQ_READ) { |
7ffc59b4 WF |
1828 | page_cache_sync_readahead(mapping, ra, file, offset, |
1829 | ra->ra_pages); | |
ef00e08e LT |
1830 | return; |
1831 | } | |
1832 | ||
207d04ba AK |
1833 | /* Avoid banging the cache line if not needed */ |
1834 | if (ra->mmap_miss < MMAP_LOTSAMISS * 10) | |
ef00e08e LT |
1835 | ra->mmap_miss++; |
1836 | ||
1837 | /* | |
1838 | * Do we miss much more than hit in this file? If so, | |
1839 | * stop bothering with read-ahead. It will only hurt. | |
1840 | */ | |
1841 | if (ra->mmap_miss > MMAP_LOTSAMISS) | |
1842 | return; | |
1843 | ||
d30a1100 WF |
1844 | /* |
1845 | * mmap read-around | |
1846 | */ | |
ef00e08e | 1847 | ra_pages = max_sane_readahead(ra->ra_pages); |
275b12bf WF |
1848 | ra->start = max_t(long, 0, offset - ra_pages / 2); |
1849 | ra->size = ra_pages; | |
2cbea1d3 | 1850 | ra->async_size = ra_pages / 4; |
275b12bf | 1851 | ra_submit(ra, mapping, file); |
ef00e08e LT |
1852 | } |
1853 | ||
1854 | /* | |
1855 | * Asynchronous readahead happens when we find the page and PG_readahead, | |
1856 | * so we want to possibly extend the readahead further.. | |
1857 | */ | |
1858 | static void do_async_mmap_readahead(struct vm_area_struct *vma, | |
1859 | struct file_ra_state *ra, | |
1860 | struct file *file, | |
1861 | struct page *page, | |
1862 | pgoff_t offset) | |
1863 | { | |
1864 | struct address_space *mapping = file->f_mapping; | |
1865 | ||
1866 | /* If we don't want any read-ahead, don't bother */ | |
64363aad | 1867 | if (vma->vm_flags & VM_RAND_READ) |
ef00e08e LT |
1868 | return; |
1869 | if (ra->mmap_miss > 0) | |
1870 | ra->mmap_miss--; | |
1871 | if (PageReadahead(page)) | |
2fad6f5d WF |
1872 | page_cache_async_readahead(mapping, ra, file, |
1873 | page, offset, ra->ra_pages); | |
ef00e08e LT |
1874 | } |
1875 | ||
485bb99b | 1876 | /** |
54cb8821 | 1877 | * filemap_fault - read in file data for page fault handling |
d0217ac0 NP |
1878 | * @vma: vma in which the fault was taken |
1879 | * @vmf: struct vm_fault containing details of the fault | |
485bb99b | 1880 | * |
54cb8821 | 1881 | * filemap_fault() is invoked via the vma operations vector for a |
1da177e4 LT |
1882 | * mapped memory region to read in file data during a page fault. |
1883 | * | |
1884 | * The goto's are kind of ugly, but this streamlines the normal case of having | |
1885 | * it in the page cache, and handles the special cases reasonably without | |
1886 | * having a lot of duplicated code. | |
1887 | */ | |
d0217ac0 | 1888 | int filemap_fault(struct vm_area_struct *vma, struct vm_fault *vmf) |
1da177e4 LT |
1889 | { |
1890 | int error; | |
54cb8821 | 1891 | struct file *file = vma->vm_file; |
1da177e4 LT |
1892 | struct address_space *mapping = file->f_mapping; |
1893 | struct file_ra_state *ra = &file->f_ra; | |
1894 | struct inode *inode = mapping->host; | |
ef00e08e | 1895 | pgoff_t offset = vmf->pgoff; |
1da177e4 | 1896 | struct page *page; |
2004dc8e | 1897 | pgoff_t size; |
83c54070 | 1898 | int ret = 0; |
1da177e4 | 1899 | |
1da177e4 | 1900 | size = (i_size_read(inode) + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT; |
ef00e08e | 1901 | if (offset >= size) |
5307cc1a | 1902 | return VM_FAULT_SIGBUS; |
1da177e4 | 1903 | |
1da177e4 | 1904 | /* |
49426420 | 1905 | * Do we have something in the page cache already? |
1da177e4 | 1906 | */ |
ef00e08e | 1907 | page = find_get_page(mapping, offset); |
45cac65b | 1908 | if (likely(page) && !(vmf->flags & FAULT_FLAG_TRIED)) { |
1da177e4 | 1909 | /* |
ef00e08e LT |
1910 | * We found the page, so try async readahead before |
1911 | * waiting for the lock. | |
1da177e4 | 1912 | */ |
ef00e08e | 1913 | do_async_mmap_readahead(vma, ra, file, page, offset); |
45cac65b | 1914 | } else if (!page) { |
ef00e08e LT |
1915 | /* No page in the page cache at all */ |
1916 | do_sync_mmap_readahead(vma, ra, file, offset); | |
1917 | count_vm_event(PGMAJFAULT); | |
456f998e | 1918 | mem_cgroup_count_vm_event(vma->vm_mm, PGMAJFAULT); |
ef00e08e LT |
1919 | ret = VM_FAULT_MAJOR; |
1920 | retry_find: | |
b522c94d | 1921 | page = find_get_page(mapping, offset); |
1da177e4 LT |
1922 | if (!page) |
1923 | goto no_cached_page; | |
1924 | } | |
1925 | ||
d88c0922 ML |
1926 | if (!lock_page_or_retry(page, vma->vm_mm, vmf->flags)) { |
1927 | page_cache_release(page); | |
d065bd81 | 1928 | return ret | VM_FAULT_RETRY; |
d88c0922 | 1929 | } |
b522c94d ML |
1930 | |
1931 | /* Did it get truncated? */ | |
1932 | if (unlikely(page->mapping != mapping)) { | |
1933 | unlock_page(page); | |
1934 | put_page(page); | |
1935 | goto retry_find; | |
1936 | } | |
309381fe | 1937 | VM_BUG_ON_PAGE(page->index != offset, page); |
b522c94d | 1938 | |
1da177e4 | 1939 | /* |
d00806b1 NP |
1940 | * We have a locked page in the page cache, now we need to check |
1941 | * that it's up-to-date. If not, it is going to be due to an error. | |
1da177e4 | 1942 | */ |
d00806b1 | 1943 | if (unlikely(!PageUptodate(page))) |
1da177e4 LT |
1944 | goto page_not_uptodate; |
1945 | ||
ef00e08e LT |
1946 | /* |
1947 | * Found the page and have a reference on it. | |
1948 | * We must recheck i_size under page lock. | |
1949 | */ | |
d00806b1 | 1950 | size = (i_size_read(inode) + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT; |
ef00e08e | 1951 | if (unlikely(offset >= size)) { |
d00806b1 | 1952 | unlock_page(page); |
745ad48e | 1953 | page_cache_release(page); |
5307cc1a | 1954 | return VM_FAULT_SIGBUS; |
d00806b1 NP |
1955 | } |
1956 | ||
d0217ac0 | 1957 | vmf->page = page; |
83c54070 | 1958 | return ret | VM_FAULT_LOCKED; |
1da177e4 | 1959 | |
1da177e4 LT |
1960 | no_cached_page: |
1961 | /* | |
1962 | * We're only likely to ever get here if MADV_RANDOM is in | |
1963 | * effect. | |
1964 | */ | |
ef00e08e | 1965 | error = page_cache_read(file, offset); |
1da177e4 LT |
1966 | |
1967 | /* | |
1968 | * The page we want has now been added to the page cache. | |
1969 | * In the unlikely event that someone removed it in the | |
1970 | * meantime, we'll just come back here and read it again. | |
1971 | */ | |
1972 | if (error >= 0) | |
1973 | goto retry_find; | |
1974 | ||
1975 | /* | |
1976 | * An error return from page_cache_read can result if the | |
1977 | * system is low on memory, or a problem occurs while trying | |
1978 | * to schedule I/O. | |
1979 | */ | |
1980 | if (error == -ENOMEM) | |
d0217ac0 NP |
1981 | return VM_FAULT_OOM; |
1982 | return VM_FAULT_SIGBUS; | |
1da177e4 LT |
1983 | |
1984 | page_not_uptodate: | |
1da177e4 LT |
1985 | /* |
1986 | * Umm, take care of errors if the page isn't up-to-date. | |
1987 | * Try to re-read it _once_. We do this synchronously, | |
1988 | * because there really aren't any performance issues here | |
1989 | * and we need to check for errors. | |
1990 | */ | |
1da177e4 | 1991 | ClearPageError(page); |
994fc28c | 1992 | error = mapping->a_ops->readpage(file, page); |
3ef0f720 MS |
1993 | if (!error) { |
1994 | wait_on_page_locked(page); | |
1995 | if (!PageUptodate(page)) | |
1996 | error = -EIO; | |
1997 | } | |
d00806b1 NP |
1998 | page_cache_release(page); |
1999 | ||
2000 | if (!error || error == AOP_TRUNCATED_PAGE) | |
994fc28c | 2001 | goto retry_find; |
1da177e4 | 2002 | |
d00806b1 | 2003 | /* Things didn't work out. Return zero to tell the mm layer so. */ |
76d42bd9 | 2004 | shrink_readahead_size_eio(file, ra); |
d0217ac0 | 2005 | return VM_FAULT_SIGBUS; |
54cb8821 NP |
2006 | } |
2007 | EXPORT_SYMBOL(filemap_fault); | |
2008 | ||
4fcf1c62 JK |
2009 | int filemap_page_mkwrite(struct vm_area_struct *vma, struct vm_fault *vmf) |
2010 | { | |
2011 | struct page *page = vmf->page; | |
496ad9aa | 2012 | struct inode *inode = file_inode(vma->vm_file); |
4fcf1c62 JK |
2013 | int ret = VM_FAULT_LOCKED; |
2014 | ||
14da9200 | 2015 | sb_start_pagefault(inode->i_sb); |
4fcf1c62 JK |
2016 | file_update_time(vma->vm_file); |
2017 | lock_page(page); | |
2018 | if (page->mapping != inode->i_mapping) { | |
2019 | unlock_page(page); | |
2020 | ret = VM_FAULT_NOPAGE; | |
2021 | goto out; | |
2022 | } | |
14da9200 JK |
2023 | /* |
2024 | * We mark the page dirty already here so that when freeze is in | |
2025 | * progress, we are guaranteed that writeback during freezing will | |
2026 | * see the dirty page and writeprotect it again. | |
2027 | */ | |
2028 | set_page_dirty(page); | |
1d1d1a76 | 2029 | wait_for_stable_page(page); |
4fcf1c62 | 2030 | out: |
14da9200 | 2031 | sb_end_pagefault(inode->i_sb); |
4fcf1c62 JK |
2032 | return ret; |
2033 | } | |
2034 | EXPORT_SYMBOL(filemap_page_mkwrite); | |
2035 | ||
f0f37e2f | 2036 | const struct vm_operations_struct generic_file_vm_ops = { |
54cb8821 | 2037 | .fault = filemap_fault, |
4fcf1c62 | 2038 | .page_mkwrite = filemap_page_mkwrite, |
0b173bc4 | 2039 | .remap_pages = generic_file_remap_pages, |
1da177e4 LT |
2040 | }; |
2041 | ||
2042 | /* This is used for a general mmap of a disk file */ | |
2043 | ||
2044 | int generic_file_mmap(struct file * file, struct vm_area_struct * vma) | |
2045 | { | |
2046 | struct address_space *mapping = file->f_mapping; | |
2047 | ||
2048 | if (!mapping->a_ops->readpage) | |
2049 | return -ENOEXEC; | |
2050 | file_accessed(file); | |
2051 | vma->vm_ops = &generic_file_vm_ops; | |
2052 | return 0; | |
2053 | } | |
1da177e4 LT |
2054 | |
2055 | /* | |
2056 | * This is for filesystems which do not implement ->writepage. | |
2057 | */ | |
2058 | int generic_file_readonly_mmap(struct file *file, struct vm_area_struct *vma) | |
2059 | { | |
2060 | if ((vma->vm_flags & VM_SHARED) && (vma->vm_flags & VM_MAYWRITE)) | |
2061 | return -EINVAL; | |
2062 | return generic_file_mmap(file, vma); | |
2063 | } | |
2064 | #else | |
2065 | int generic_file_mmap(struct file * file, struct vm_area_struct * vma) | |
2066 | { | |
2067 | return -ENOSYS; | |
2068 | } | |
2069 | int generic_file_readonly_mmap(struct file * file, struct vm_area_struct * vma) | |
2070 | { | |
2071 | return -ENOSYS; | |
2072 | } | |
2073 | #endif /* CONFIG_MMU */ | |
2074 | ||
2075 | EXPORT_SYMBOL(generic_file_mmap); | |
2076 | EXPORT_SYMBOL(generic_file_readonly_mmap); | |
2077 | ||
6fe6900e | 2078 | static struct page *__read_cache_page(struct address_space *mapping, |
57f6b96c | 2079 | pgoff_t index, |
5e5358e7 | 2080 | int (*filler)(void *, struct page *), |
0531b2aa LT |
2081 | void *data, |
2082 | gfp_t gfp) | |
1da177e4 | 2083 | { |
eb2be189 | 2084 | struct page *page; |
1da177e4 LT |
2085 | int err; |
2086 | repeat: | |
2087 | page = find_get_page(mapping, index); | |
2088 | if (!page) { | |
0531b2aa | 2089 | page = __page_cache_alloc(gfp | __GFP_COLD); |
eb2be189 NP |
2090 | if (!page) |
2091 | return ERR_PTR(-ENOMEM); | |
e6f67b8c | 2092 | err = add_to_page_cache_lru(page, mapping, index, gfp); |
eb2be189 NP |
2093 | if (unlikely(err)) { |
2094 | page_cache_release(page); | |
2095 | if (err == -EEXIST) | |
2096 | goto repeat; | |
1da177e4 | 2097 | /* Presumably ENOMEM for radix tree node */ |
1da177e4 LT |
2098 | return ERR_PTR(err); |
2099 | } | |
1da177e4 LT |
2100 | err = filler(data, page); |
2101 | if (err < 0) { | |
2102 | page_cache_release(page); | |
2103 | page = ERR_PTR(err); | |
2104 | } | |
2105 | } | |
1da177e4 LT |
2106 | return page; |
2107 | } | |
2108 | ||
0531b2aa | 2109 | static struct page *do_read_cache_page(struct address_space *mapping, |
57f6b96c | 2110 | pgoff_t index, |
5e5358e7 | 2111 | int (*filler)(void *, struct page *), |
0531b2aa LT |
2112 | void *data, |
2113 | gfp_t gfp) | |
2114 | ||
1da177e4 LT |
2115 | { |
2116 | struct page *page; | |
2117 | int err; | |
2118 | ||
2119 | retry: | |
0531b2aa | 2120 | page = __read_cache_page(mapping, index, filler, data, gfp); |
1da177e4 | 2121 | if (IS_ERR(page)) |
c855ff37 | 2122 | return page; |
1da177e4 LT |
2123 | if (PageUptodate(page)) |
2124 | goto out; | |
2125 | ||
2126 | lock_page(page); | |
2127 | if (!page->mapping) { | |
2128 | unlock_page(page); | |
2129 | page_cache_release(page); | |
2130 | goto retry; | |
2131 | } | |
2132 | if (PageUptodate(page)) { | |
2133 | unlock_page(page); | |
2134 | goto out; | |
2135 | } | |
2136 | err = filler(data, page); | |
2137 | if (err < 0) { | |
2138 | page_cache_release(page); | |
c855ff37 | 2139 | return ERR_PTR(err); |
1da177e4 | 2140 | } |
c855ff37 | 2141 | out: |
6fe6900e NP |
2142 | mark_page_accessed(page); |
2143 | return page; | |
2144 | } | |
0531b2aa LT |
2145 | |
2146 | /** | |
2147 | * read_cache_page_async - read into page cache, fill it if needed | |
2148 | * @mapping: the page's address_space | |
2149 | * @index: the page index | |
2150 | * @filler: function to perform the read | |
5e5358e7 | 2151 | * @data: first arg to filler(data, page) function, often left as NULL |
0531b2aa LT |
2152 | * |
2153 | * Same as read_cache_page, but don't wait for page to become unlocked | |
2154 | * after submitting it to the filler. | |
2155 | * | |
2156 | * Read into the page cache. If a page already exists, and PageUptodate() is | |
2157 | * not set, try to fill the page but don't wait for it to become unlocked. | |
2158 | * | |
2159 | * If the page does not get brought uptodate, return -EIO. | |
2160 | */ | |
2161 | struct page *read_cache_page_async(struct address_space *mapping, | |
2162 | pgoff_t index, | |
5e5358e7 | 2163 | int (*filler)(void *, struct page *), |
0531b2aa LT |
2164 | void *data) |
2165 | { | |
2166 | return do_read_cache_page(mapping, index, filler, data, mapping_gfp_mask(mapping)); | |
2167 | } | |
6fe6900e NP |
2168 | EXPORT_SYMBOL(read_cache_page_async); |
2169 | ||
0531b2aa LT |
2170 | static struct page *wait_on_page_read(struct page *page) |
2171 | { | |
2172 | if (!IS_ERR(page)) { | |
2173 | wait_on_page_locked(page); | |
2174 | if (!PageUptodate(page)) { | |
2175 | page_cache_release(page); | |
2176 | page = ERR_PTR(-EIO); | |
2177 | } | |
2178 | } | |
2179 | return page; | |
2180 | } | |
2181 | ||
2182 | /** | |
2183 | * read_cache_page_gfp - read into page cache, using specified page allocation flags. | |
2184 | * @mapping: the page's address_space | |
2185 | * @index: the page index | |
2186 | * @gfp: the page allocator flags to use if allocating | |
2187 | * | |
2188 | * This is the same as "read_mapping_page(mapping, index, NULL)", but with | |
e6f67b8c | 2189 | * any new page allocations done using the specified allocation flags. |
0531b2aa LT |
2190 | * |
2191 | * If the page does not get brought uptodate, return -EIO. | |
2192 | */ | |
2193 | struct page *read_cache_page_gfp(struct address_space *mapping, | |
2194 | pgoff_t index, | |
2195 | gfp_t gfp) | |
2196 | { | |
2197 | filler_t *filler = (filler_t *)mapping->a_ops->readpage; | |
2198 | ||
2199 | return wait_on_page_read(do_read_cache_page(mapping, index, filler, NULL, gfp)); | |
2200 | } | |
2201 | EXPORT_SYMBOL(read_cache_page_gfp); | |
2202 | ||
6fe6900e NP |
2203 | /** |
2204 | * read_cache_page - read into page cache, fill it if needed | |
2205 | * @mapping: the page's address_space | |
2206 | * @index: the page index | |
2207 | * @filler: function to perform the read | |
5e5358e7 | 2208 | * @data: first arg to filler(data, page) function, often left as NULL |
6fe6900e NP |
2209 | * |
2210 | * Read into the page cache. If a page already exists, and PageUptodate() is | |
2211 | * not set, try to fill the page then wait for it to become unlocked. | |
2212 | * | |
2213 | * If the page does not get brought uptodate, return -EIO. | |
2214 | */ | |
2215 | struct page *read_cache_page(struct address_space *mapping, | |
57f6b96c | 2216 | pgoff_t index, |
5e5358e7 | 2217 | int (*filler)(void *, struct page *), |
6fe6900e NP |
2218 | void *data) |
2219 | { | |
0531b2aa | 2220 | return wait_on_page_read(read_cache_page_async(mapping, index, filler, data)); |
1da177e4 | 2221 | } |
1da177e4 LT |
2222 | EXPORT_SYMBOL(read_cache_page); |
2223 | ||
2f718ffc | 2224 | static size_t __iovec_copy_from_user_inatomic(char *vaddr, |
1da177e4 LT |
2225 | const struct iovec *iov, size_t base, size_t bytes) |
2226 | { | |
f1800536 | 2227 | size_t copied = 0, left = 0; |
1da177e4 LT |
2228 | |
2229 | while (bytes) { | |
2230 | char __user *buf = iov->iov_base + base; | |
2231 | int copy = min(bytes, iov->iov_len - base); | |
2232 | ||
2233 | base = 0; | |
f1800536 | 2234 | left = __copy_from_user_inatomic(vaddr, buf, copy); |
1da177e4 LT |
2235 | copied += copy; |
2236 | bytes -= copy; | |
2237 | vaddr += copy; | |
2238 | iov++; | |
2239 | ||
01408c49 | 2240 | if (unlikely(left)) |
1da177e4 | 2241 | break; |
1da177e4 LT |
2242 | } |
2243 | return copied - left; | |
2244 | } | |
2245 | ||
2f718ffc NP |
2246 | /* |
2247 | * Copy as much as we can into the page and return the number of bytes which | |
af901ca1 | 2248 | * were successfully copied. If a fault is encountered then return the number of |
2f718ffc NP |
2249 | * bytes which were copied. |
2250 | */ | |
2251 | size_t iov_iter_copy_from_user_atomic(struct page *page, | |
2252 | struct iov_iter *i, unsigned long offset, size_t bytes) | |
2253 | { | |
2254 | char *kaddr; | |
2255 | size_t copied; | |
2256 | ||
2257 | BUG_ON(!in_atomic()); | |
9b04c5fe | 2258 | kaddr = kmap_atomic(page); |
2f718ffc NP |
2259 | if (likely(i->nr_segs == 1)) { |
2260 | int left; | |
2261 | char __user *buf = i->iov->iov_base + i->iov_offset; | |
f1800536 | 2262 | left = __copy_from_user_inatomic(kaddr + offset, buf, bytes); |
2f718ffc NP |
2263 | copied = bytes - left; |
2264 | } else { | |
2265 | copied = __iovec_copy_from_user_inatomic(kaddr + offset, | |
2266 | i->iov, i->iov_offset, bytes); | |
2267 | } | |
9b04c5fe | 2268 | kunmap_atomic(kaddr); |
2f718ffc NP |
2269 | |
2270 | return copied; | |
2271 | } | |
89e10787 | 2272 | EXPORT_SYMBOL(iov_iter_copy_from_user_atomic); |
2f718ffc NP |
2273 | |
2274 | /* | |
2275 | * This has the same sideeffects and return value as | |
2276 | * iov_iter_copy_from_user_atomic(). | |
2277 | * The difference is that it attempts to resolve faults. | |
2278 | * Page must not be locked. | |
2279 | */ | |
2280 | size_t iov_iter_copy_from_user(struct page *page, | |
2281 | struct iov_iter *i, unsigned long offset, size_t bytes) | |
2282 | { | |
2283 | char *kaddr; | |
2284 | size_t copied; | |
2285 | ||
2286 | kaddr = kmap(page); | |
2287 | if (likely(i->nr_segs == 1)) { | |
2288 | int left; | |
2289 | char __user *buf = i->iov->iov_base + i->iov_offset; | |
f1800536 | 2290 | left = __copy_from_user(kaddr + offset, buf, bytes); |
2f718ffc NP |
2291 | copied = bytes - left; |
2292 | } else { | |
2293 | copied = __iovec_copy_from_user_inatomic(kaddr + offset, | |
2294 | i->iov, i->iov_offset, bytes); | |
2295 | } | |
2296 | kunmap(page); | |
2297 | return copied; | |
2298 | } | |
89e10787 | 2299 | EXPORT_SYMBOL(iov_iter_copy_from_user); |
2f718ffc | 2300 | |
f7009264 | 2301 | void iov_iter_advance(struct iov_iter *i, size_t bytes) |
2f718ffc | 2302 | { |
f7009264 NP |
2303 | BUG_ON(i->count < bytes); |
2304 | ||
2f718ffc NP |
2305 | if (likely(i->nr_segs == 1)) { |
2306 | i->iov_offset += bytes; | |
f7009264 | 2307 | i->count -= bytes; |
2f718ffc NP |
2308 | } else { |
2309 | const struct iovec *iov = i->iov; | |
2310 | size_t base = i->iov_offset; | |
39be79c1 | 2311 | unsigned long nr_segs = i->nr_segs; |
2f718ffc | 2312 | |
124d3b70 NP |
2313 | /* |
2314 | * The !iov->iov_len check ensures we skip over unlikely | |
f7009264 | 2315 | * zero-length segments (without overruning the iovec). |
124d3b70 | 2316 | */ |
94ad374a | 2317 | while (bytes || unlikely(i->count && !iov->iov_len)) { |
f7009264 | 2318 | int copy; |
2f718ffc | 2319 | |
f7009264 NP |
2320 | copy = min(bytes, iov->iov_len - base); |
2321 | BUG_ON(!i->count || i->count < copy); | |
2322 | i->count -= copy; | |
2f718ffc NP |
2323 | bytes -= copy; |
2324 | base += copy; | |
2325 | if (iov->iov_len == base) { | |
2326 | iov++; | |
39be79c1 | 2327 | nr_segs--; |
2f718ffc NP |
2328 | base = 0; |
2329 | } | |
2330 | } | |
2331 | i->iov = iov; | |
2332 | i->iov_offset = base; | |
39be79c1 | 2333 | i->nr_segs = nr_segs; |
2f718ffc NP |
2334 | } |
2335 | } | |
89e10787 | 2336 | EXPORT_SYMBOL(iov_iter_advance); |
2f718ffc | 2337 | |
afddba49 NP |
2338 | /* |
2339 | * Fault in the first iovec of the given iov_iter, to a maximum length | |
2340 | * of bytes. Returns 0 on success, or non-zero if the memory could not be | |
2341 | * accessed (ie. because it is an invalid address). | |
2342 | * | |
2343 | * writev-intensive code may want this to prefault several iovecs -- that | |
2344 | * would be possible (callers must not rely on the fact that _only_ the | |
2345 | * first iovec will be faulted with the current implementation). | |
2346 | */ | |
2347 | int iov_iter_fault_in_readable(struct iov_iter *i, size_t bytes) | |
2f718ffc | 2348 | { |
2f718ffc | 2349 | char __user *buf = i->iov->iov_base + i->iov_offset; |
afddba49 NP |
2350 | bytes = min(bytes, i->iov->iov_len - i->iov_offset); |
2351 | return fault_in_pages_readable(buf, bytes); | |
2f718ffc | 2352 | } |
89e10787 | 2353 | EXPORT_SYMBOL(iov_iter_fault_in_readable); |
2f718ffc NP |
2354 | |
2355 | /* | |
2356 | * Return the count of just the current iov_iter segment. | |
2357 | */ | |
d28574e0 | 2358 | size_t iov_iter_single_seg_count(const struct iov_iter *i) |
2f718ffc NP |
2359 | { |
2360 | const struct iovec *iov = i->iov; | |
2361 | if (i->nr_segs == 1) | |
2362 | return i->count; | |
2363 | else | |
2364 | return min(i->count, iov->iov_len - i->iov_offset); | |
2365 | } | |
89e10787 | 2366 | EXPORT_SYMBOL(iov_iter_single_seg_count); |
2f718ffc | 2367 | |
1da177e4 LT |
2368 | /* |
2369 | * Performs necessary checks before doing a write | |
2370 | * | |
485bb99b | 2371 | * Can adjust writing position or amount of bytes to write. |
1da177e4 LT |
2372 | * Returns appropriate error code that caller should return or |
2373 | * zero in case that write should be allowed. | |
2374 | */ | |
2375 | inline int generic_write_checks(struct file *file, loff_t *pos, size_t *count, int isblk) | |
2376 | { | |
2377 | struct inode *inode = file->f_mapping->host; | |
59e99e5b | 2378 | unsigned long limit = rlimit(RLIMIT_FSIZE); |
1da177e4 LT |
2379 | |
2380 | if (unlikely(*pos < 0)) | |
2381 | return -EINVAL; | |
2382 | ||
1da177e4 LT |
2383 | if (!isblk) { |
2384 | /* FIXME: this is for backwards compatibility with 2.4 */ | |
2385 | if (file->f_flags & O_APPEND) | |
2386 | *pos = i_size_read(inode); | |
2387 | ||
2388 | if (limit != RLIM_INFINITY) { | |
2389 | if (*pos >= limit) { | |
2390 | send_sig(SIGXFSZ, current, 0); | |
2391 | return -EFBIG; | |
2392 | } | |
2393 | if (*count > limit - (typeof(limit))*pos) { | |
2394 | *count = limit - (typeof(limit))*pos; | |
2395 | } | |
2396 | } | |
2397 | } | |
2398 | ||
2399 | /* | |
2400 | * LFS rule | |
2401 | */ | |
2402 | if (unlikely(*pos + *count > MAX_NON_LFS && | |
2403 | !(file->f_flags & O_LARGEFILE))) { | |
2404 | if (*pos >= MAX_NON_LFS) { | |
1da177e4 LT |
2405 | return -EFBIG; |
2406 | } | |
2407 | if (*count > MAX_NON_LFS - (unsigned long)*pos) { | |
2408 | *count = MAX_NON_LFS - (unsigned long)*pos; | |
2409 | } | |
2410 | } | |
2411 | ||
2412 | /* | |
2413 | * Are we about to exceed the fs block limit ? | |
2414 | * | |
2415 | * If we have written data it becomes a short write. If we have | |
2416 | * exceeded without writing data we send a signal and return EFBIG. | |
2417 | * Linus frestrict idea will clean these up nicely.. | |
2418 | */ | |
2419 | if (likely(!isblk)) { | |
2420 | if (unlikely(*pos >= inode->i_sb->s_maxbytes)) { | |
2421 | if (*count || *pos > inode->i_sb->s_maxbytes) { | |
1da177e4 LT |
2422 | return -EFBIG; |
2423 | } | |
2424 | /* zero-length writes at ->s_maxbytes are OK */ | |
2425 | } | |
2426 | ||
2427 | if (unlikely(*pos + *count > inode->i_sb->s_maxbytes)) | |
2428 | *count = inode->i_sb->s_maxbytes - *pos; | |
2429 | } else { | |
9361401e | 2430 | #ifdef CONFIG_BLOCK |
1da177e4 LT |
2431 | loff_t isize; |
2432 | if (bdev_read_only(I_BDEV(inode))) | |
2433 | return -EPERM; | |
2434 | isize = i_size_read(inode); | |
2435 | if (*pos >= isize) { | |
2436 | if (*count || *pos > isize) | |
2437 | return -ENOSPC; | |
2438 | } | |
2439 | ||
2440 | if (*pos + *count > isize) | |
2441 | *count = isize - *pos; | |
9361401e DH |
2442 | #else |
2443 | return -EPERM; | |
2444 | #endif | |
1da177e4 LT |
2445 | } |
2446 | return 0; | |
2447 | } | |
2448 | EXPORT_SYMBOL(generic_write_checks); | |
2449 | ||
afddba49 NP |
2450 | int pagecache_write_begin(struct file *file, struct address_space *mapping, |
2451 | loff_t pos, unsigned len, unsigned flags, | |
2452 | struct page **pagep, void **fsdata) | |
2453 | { | |
2454 | const struct address_space_operations *aops = mapping->a_ops; | |
2455 | ||
4e02ed4b | 2456 | return aops->write_begin(file, mapping, pos, len, flags, |
afddba49 | 2457 | pagep, fsdata); |
afddba49 NP |
2458 | } |
2459 | EXPORT_SYMBOL(pagecache_write_begin); | |
2460 | ||
2461 | int pagecache_write_end(struct file *file, struct address_space *mapping, | |
2462 | loff_t pos, unsigned len, unsigned copied, | |
2463 | struct page *page, void *fsdata) | |
2464 | { | |
2465 | const struct address_space_operations *aops = mapping->a_ops; | |
afddba49 | 2466 | |
4e02ed4b NP |
2467 | mark_page_accessed(page); |
2468 | return aops->write_end(file, mapping, pos, len, copied, page, fsdata); | |
afddba49 NP |
2469 | } |
2470 | EXPORT_SYMBOL(pagecache_write_end); | |
2471 | ||
1da177e4 LT |
2472 | ssize_t |
2473 | generic_file_direct_write(struct kiocb *iocb, const struct iovec *iov, | |
2474 | unsigned long *nr_segs, loff_t pos, loff_t *ppos, | |
2475 | size_t count, size_t ocount) | |
2476 | { | |
2477 | struct file *file = iocb->ki_filp; | |
2478 | struct address_space *mapping = file->f_mapping; | |
2479 | struct inode *inode = mapping->host; | |
2480 | ssize_t written; | |
a969e903 CH |
2481 | size_t write_len; |
2482 | pgoff_t end; | |
1da177e4 LT |
2483 | |
2484 | if (count != ocount) | |
2485 | *nr_segs = iov_shorten((struct iovec *)iov, *nr_segs, count); | |
2486 | ||
a969e903 CH |
2487 | write_len = iov_length(iov, *nr_segs); |
2488 | end = (pos + write_len - 1) >> PAGE_CACHE_SHIFT; | |
a969e903 | 2489 | |
48b47c56 | 2490 | written = filemap_write_and_wait_range(mapping, pos, pos + write_len - 1); |
a969e903 CH |
2491 | if (written) |
2492 | goto out; | |
2493 | ||
2494 | /* | |
2495 | * After a write we want buffered reads to be sure to go to disk to get | |
2496 | * the new data. We invalidate clean cached page from the region we're | |
2497 | * about to write. We do this *before* the write so that we can return | |
6ccfa806 | 2498 | * without clobbering -EIOCBQUEUED from ->direct_IO(). |
a969e903 CH |
2499 | */ |
2500 | if (mapping->nrpages) { | |
2501 | written = invalidate_inode_pages2_range(mapping, | |
2502 | pos >> PAGE_CACHE_SHIFT, end); | |
6ccfa806 HH |
2503 | /* |
2504 | * If a page can not be invalidated, return 0 to fall back | |
2505 | * to buffered write. | |
2506 | */ | |
2507 | if (written) { | |
2508 | if (written == -EBUSY) | |
2509 | return 0; | |
a969e903 | 2510 | goto out; |
6ccfa806 | 2511 | } |
a969e903 CH |
2512 | } |
2513 | ||
2514 | written = mapping->a_ops->direct_IO(WRITE, iocb, iov, pos, *nr_segs); | |
2515 | ||
2516 | /* | |
2517 | * Finally, try again to invalidate clean pages which might have been | |
2518 | * cached by non-direct readahead, or faulted in by get_user_pages() | |
2519 | * if the source of the write was an mmap'ed region of the file | |
2520 | * we're writing. Either one is a pretty crazy thing to do, | |
2521 | * so we don't support it 100%. If this invalidation | |
2522 | * fails, tough, the write still worked... | |
2523 | */ | |
2524 | if (mapping->nrpages) { | |
2525 | invalidate_inode_pages2_range(mapping, | |
2526 | pos >> PAGE_CACHE_SHIFT, end); | |
2527 | } | |
2528 | ||
1da177e4 | 2529 | if (written > 0) { |
0116651c NK |
2530 | pos += written; |
2531 | if (pos > i_size_read(inode) && !S_ISBLK(inode->i_mode)) { | |
2532 | i_size_write(inode, pos); | |
1da177e4 LT |
2533 | mark_inode_dirty(inode); |
2534 | } | |
0116651c | 2535 | *ppos = pos; |
1da177e4 | 2536 | } |
a969e903 | 2537 | out: |
1da177e4 LT |
2538 | return written; |
2539 | } | |
2540 | EXPORT_SYMBOL(generic_file_direct_write); | |
2541 | ||
eb2be189 NP |
2542 | /* |
2543 | * Find or create a page at the given pagecache position. Return the locked | |
2544 | * page. This function is specifically for buffered writes. | |
2545 | */ | |
54566b2c NP |
2546 | struct page *grab_cache_page_write_begin(struct address_space *mapping, |
2547 | pgoff_t index, unsigned flags) | |
eb2be189 NP |
2548 | { |
2549 | int status; | |
0faa70cb | 2550 | gfp_t gfp_mask; |
eb2be189 | 2551 | struct page *page; |
54566b2c | 2552 | gfp_t gfp_notmask = 0; |
0faa70cb | 2553 | |
1010bb1b FW |
2554 | gfp_mask = mapping_gfp_mask(mapping); |
2555 | if (mapping_cap_account_dirty(mapping)) | |
2556 | gfp_mask |= __GFP_WRITE; | |
54566b2c NP |
2557 | if (flags & AOP_FLAG_NOFS) |
2558 | gfp_notmask = __GFP_FS; | |
eb2be189 NP |
2559 | repeat: |
2560 | page = find_lock_page(mapping, index); | |
c585a267 | 2561 | if (page) |
3d08bcc8 | 2562 | goto found; |
eb2be189 | 2563 | |
0faa70cb | 2564 | page = __page_cache_alloc(gfp_mask & ~gfp_notmask); |
eb2be189 NP |
2565 | if (!page) |
2566 | return NULL; | |
54566b2c NP |
2567 | status = add_to_page_cache_lru(page, mapping, index, |
2568 | GFP_KERNEL & ~gfp_notmask); | |
eb2be189 NP |
2569 | if (unlikely(status)) { |
2570 | page_cache_release(page); | |
2571 | if (status == -EEXIST) | |
2572 | goto repeat; | |
2573 | return NULL; | |
2574 | } | |
3d08bcc8 | 2575 | found: |
1d1d1a76 | 2576 | wait_for_stable_page(page); |
eb2be189 NP |
2577 | return page; |
2578 | } | |
54566b2c | 2579 | EXPORT_SYMBOL(grab_cache_page_write_begin); |
eb2be189 | 2580 | |
afddba49 NP |
2581 | static ssize_t generic_perform_write(struct file *file, |
2582 | struct iov_iter *i, loff_t pos) | |
2583 | { | |
2584 | struct address_space *mapping = file->f_mapping; | |
2585 | const struct address_space_operations *a_ops = mapping->a_ops; | |
2586 | long status = 0; | |
2587 | ssize_t written = 0; | |
674b892e NP |
2588 | unsigned int flags = 0; |
2589 | ||
2590 | /* | |
2591 | * Copies from kernel address space cannot fail (NFSD is a big user). | |
2592 | */ | |
2593 | if (segment_eq(get_fs(), KERNEL_DS)) | |
2594 | flags |= AOP_FLAG_UNINTERRUPTIBLE; | |
afddba49 NP |
2595 | |
2596 | do { | |
2597 | struct page *page; | |
afddba49 NP |
2598 | unsigned long offset; /* Offset into pagecache page */ |
2599 | unsigned long bytes; /* Bytes to write to page */ | |
2600 | size_t copied; /* Bytes copied from user */ | |
2601 | void *fsdata; | |
2602 | ||
2603 | offset = (pos & (PAGE_CACHE_SIZE - 1)); | |
afddba49 NP |
2604 | bytes = min_t(unsigned long, PAGE_CACHE_SIZE - offset, |
2605 | iov_iter_count(i)); | |
2606 | ||
2607 | again: | |
afddba49 NP |
2608 | /* |
2609 | * Bring in the user page that we will copy from _first_. | |
2610 | * Otherwise there's a nasty deadlock on copying from the | |
2611 | * same page as we're writing to, without it being marked | |
2612 | * up-to-date. | |
2613 | * | |
2614 | * Not only is this an optimisation, but it is also required | |
2615 | * to check that the address is actually valid, when atomic | |
2616 | * usercopies are used, below. | |
2617 | */ | |
2618 | if (unlikely(iov_iter_fault_in_readable(i, bytes))) { | |
2619 | status = -EFAULT; | |
2620 | break; | |
2621 | } | |
2622 | ||
674b892e | 2623 | status = a_ops->write_begin(file, mapping, pos, bytes, flags, |
afddba49 NP |
2624 | &page, &fsdata); |
2625 | if (unlikely(status)) | |
2626 | break; | |
2627 | ||
931e80e4 | 2628 | if (mapping_writably_mapped(mapping)) |
2629 | flush_dcache_page(page); | |
2630 | ||
afddba49 NP |
2631 | pagefault_disable(); |
2632 | copied = iov_iter_copy_from_user_atomic(page, i, offset, bytes); | |
2633 | pagefault_enable(); | |
2634 | flush_dcache_page(page); | |
2635 | ||
c8236db9 | 2636 | mark_page_accessed(page); |
afddba49 NP |
2637 | status = a_ops->write_end(file, mapping, pos, bytes, copied, |
2638 | page, fsdata); | |
2639 | if (unlikely(status < 0)) | |
2640 | break; | |
2641 | copied = status; | |
2642 | ||
2643 | cond_resched(); | |
2644 | ||
124d3b70 | 2645 | iov_iter_advance(i, copied); |
afddba49 NP |
2646 | if (unlikely(copied == 0)) { |
2647 | /* | |
2648 | * If we were unable to copy any data at all, we must | |
2649 | * fall back to a single segment length write. | |
2650 | * | |
2651 | * If we didn't fallback here, we could livelock | |
2652 | * because not all segments in the iov can be copied at | |
2653 | * once without a pagefault. | |
2654 | */ | |
2655 | bytes = min_t(unsigned long, PAGE_CACHE_SIZE - offset, | |
2656 | iov_iter_single_seg_count(i)); | |
2657 | goto again; | |
2658 | } | |
afddba49 NP |
2659 | pos += copied; |
2660 | written += copied; | |
2661 | ||
2662 | balance_dirty_pages_ratelimited(mapping); | |
a50527b1 JK |
2663 | if (fatal_signal_pending(current)) { |
2664 | status = -EINTR; | |
2665 | break; | |
2666 | } | |
afddba49 NP |
2667 | } while (iov_iter_count(i)); |
2668 | ||
2669 | return written ? written : status; | |
2670 | } | |
2671 | ||
2672 | ssize_t | |
2673 | generic_file_buffered_write(struct kiocb *iocb, const struct iovec *iov, | |
2674 | unsigned long nr_segs, loff_t pos, loff_t *ppos, | |
2675 | size_t count, ssize_t written) | |
2676 | { | |
2677 | struct file *file = iocb->ki_filp; | |
afddba49 NP |
2678 | ssize_t status; |
2679 | struct iov_iter i; | |
2680 | ||
2681 | iov_iter_init(&i, iov, nr_segs, count, written); | |
4e02ed4b | 2682 | status = generic_perform_write(file, &i, pos); |
1da177e4 | 2683 | |
1da177e4 | 2684 | if (likely(status >= 0)) { |
afddba49 NP |
2685 | written += status; |
2686 | *ppos = pos + status; | |
1da177e4 LT |
2687 | } |
2688 | ||
1da177e4 LT |
2689 | return written ? written : status; |
2690 | } | |
2691 | EXPORT_SYMBOL(generic_file_buffered_write); | |
2692 | ||
e4dd9de3 JK |
2693 | /** |
2694 | * __generic_file_aio_write - write data to a file | |
2695 | * @iocb: IO state structure (file, offset, etc.) | |
2696 | * @iov: vector with data to write | |
2697 | * @nr_segs: number of segments in the vector | |
2698 | * @ppos: position where to write | |
2699 | * | |
2700 | * This function does all the work needed for actually writing data to a | |
2701 | * file. It does all basic checks, removes SUID from the file, updates | |
2702 | * modification times and calls proper subroutines depending on whether we | |
2703 | * do direct IO or a standard buffered write. | |
2704 | * | |
2705 | * It expects i_mutex to be grabbed unless we work on a block device or similar | |
2706 | * object which does not need locking at all. | |
2707 | * | |
2708 | * This function does *not* take care of syncing data in case of O_SYNC write. | |
2709 | * A caller has to handle it. This is mainly due to the fact that we want to | |
2710 | * avoid syncing under i_mutex. | |
2711 | */ | |
2712 | ssize_t __generic_file_aio_write(struct kiocb *iocb, const struct iovec *iov, | |
2713 | unsigned long nr_segs, loff_t *ppos) | |
1da177e4 LT |
2714 | { |
2715 | struct file *file = iocb->ki_filp; | |
fb5527e6 | 2716 | struct address_space * mapping = file->f_mapping; |
1da177e4 LT |
2717 | size_t ocount; /* original count */ |
2718 | size_t count; /* after file limit checks */ | |
2719 | struct inode *inode = mapping->host; | |
1da177e4 LT |
2720 | loff_t pos; |
2721 | ssize_t written; | |
2722 | ssize_t err; | |
2723 | ||
2724 | ocount = 0; | |
0ceb3314 DM |
2725 | err = generic_segment_checks(iov, &nr_segs, &ocount, VERIFY_READ); |
2726 | if (err) | |
2727 | return err; | |
1da177e4 LT |
2728 | |
2729 | count = ocount; | |
2730 | pos = *ppos; | |
2731 | ||
1da177e4 LT |
2732 | /* We can write back this queue in page reclaim */ |
2733 | current->backing_dev_info = mapping->backing_dev_info; | |
2734 | written = 0; | |
2735 | ||
2736 | err = generic_write_checks(file, &pos, &count, S_ISBLK(inode->i_mode)); | |
2737 | if (err) | |
2738 | goto out; | |
2739 | ||
2740 | if (count == 0) | |
2741 | goto out; | |
2742 | ||
2f1936b8 | 2743 | err = file_remove_suid(file); |
1da177e4 LT |
2744 | if (err) |
2745 | goto out; | |
2746 | ||
c3b2da31 JB |
2747 | err = file_update_time(file); |
2748 | if (err) | |
2749 | goto out; | |
1da177e4 LT |
2750 | |
2751 | /* coalesce the iovecs and go direct-to-BIO for O_DIRECT */ | |
2752 | if (unlikely(file->f_flags & O_DIRECT)) { | |
fb5527e6 JM |
2753 | loff_t endbyte; |
2754 | ssize_t written_buffered; | |
2755 | ||
2756 | written = generic_file_direct_write(iocb, iov, &nr_segs, pos, | |
2757 | ppos, count, ocount); | |
1da177e4 LT |
2758 | if (written < 0 || written == count) |
2759 | goto out; | |
2760 | /* | |
2761 | * direct-io write to a hole: fall through to buffered I/O | |
2762 | * for completing the rest of the request. | |
2763 | */ | |
2764 | pos += written; | |
2765 | count -= written; | |
fb5527e6 JM |
2766 | written_buffered = generic_file_buffered_write(iocb, iov, |
2767 | nr_segs, pos, ppos, count, | |
2768 | written); | |
2769 | /* | |
2770 | * If generic_file_buffered_write() retuned a synchronous error | |
2771 | * then we want to return the number of bytes which were | |
2772 | * direct-written, or the error code if that was zero. Note | |
2773 | * that this differs from normal direct-io semantics, which | |
2774 | * will return -EFOO even if some bytes were written. | |
2775 | */ | |
2776 | if (written_buffered < 0) { | |
2777 | err = written_buffered; | |
2778 | goto out; | |
2779 | } | |
1da177e4 | 2780 | |
fb5527e6 JM |
2781 | /* |
2782 | * We need to ensure that the page cache pages are written to | |
2783 | * disk and invalidated to preserve the expected O_DIRECT | |
2784 | * semantics. | |
2785 | */ | |
2786 | endbyte = pos + written_buffered - written - 1; | |
c05c4edd | 2787 | err = filemap_write_and_wait_range(file->f_mapping, pos, endbyte); |
fb5527e6 JM |
2788 | if (err == 0) { |
2789 | written = written_buffered; | |
2790 | invalidate_mapping_pages(mapping, | |
2791 | pos >> PAGE_CACHE_SHIFT, | |
2792 | endbyte >> PAGE_CACHE_SHIFT); | |
2793 | } else { | |
2794 | /* | |
2795 | * We don't know how much we wrote, so just return | |
2796 | * the number of bytes which were direct-written | |
2797 | */ | |
2798 | } | |
2799 | } else { | |
2800 | written = generic_file_buffered_write(iocb, iov, nr_segs, | |
2801 | pos, ppos, count, written); | |
2802 | } | |
1da177e4 LT |
2803 | out: |
2804 | current->backing_dev_info = NULL; | |
2805 | return written ? written : err; | |
2806 | } | |
e4dd9de3 JK |
2807 | EXPORT_SYMBOL(__generic_file_aio_write); |
2808 | ||
e4dd9de3 JK |
2809 | /** |
2810 | * generic_file_aio_write - write data to a file | |
2811 | * @iocb: IO state structure | |
2812 | * @iov: vector with data to write | |
2813 | * @nr_segs: number of segments in the vector | |
2814 | * @pos: position in file where to write | |
2815 | * | |
2816 | * This is a wrapper around __generic_file_aio_write() to be used by most | |
2817 | * filesystems. It takes care of syncing the file in case of O_SYNC file | |
2818 | * and acquires i_mutex as needed. | |
2819 | */ | |
027445c3 BP |
2820 | ssize_t generic_file_aio_write(struct kiocb *iocb, const struct iovec *iov, |
2821 | unsigned long nr_segs, loff_t pos) | |
1da177e4 LT |
2822 | { |
2823 | struct file *file = iocb->ki_filp; | |
148f948b | 2824 | struct inode *inode = file->f_mapping->host; |
1da177e4 | 2825 | ssize_t ret; |
1da177e4 LT |
2826 | |
2827 | BUG_ON(iocb->ki_pos != pos); | |
2828 | ||
1b1dcc1b | 2829 | mutex_lock(&inode->i_mutex); |
e4dd9de3 | 2830 | ret = __generic_file_aio_write(iocb, iov, nr_segs, &iocb->ki_pos); |
1b1dcc1b | 2831 | mutex_unlock(&inode->i_mutex); |
1da177e4 | 2832 | |
02afc27f | 2833 | if (ret > 0) { |
1da177e4 LT |
2834 | ssize_t err; |
2835 | ||
d311d79d AV |
2836 | err = generic_write_sync(file, iocb->ki_pos - ret, ret); |
2837 | if (err < 0) | |
1da177e4 LT |
2838 | ret = err; |
2839 | } | |
2840 | return ret; | |
2841 | } | |
2842 | EXPORT_SYMBOL(generic_file_aio_write); | |
2843 | ||
cf9a2ae8 DH |
2844 | /** |
2845 | * try_to_release_page() - release old fs-specific metadata on a page | |
2846 | * | |
2847 | * @page: the page which the kernel is trying to free | |
2848 | * @gfp_mask: memory allocation flags (and I/O mode) | |
2849 | * | |
2850 | * The address_space is to try to release any data against the page | |
2851 | * (presumably at page->private). If the release was successful, return `1'. | |
2852 | * Otherwise return zero. | |
2853 | * | |
266cf658 DH |
2854 | * This may also be called if PG_fscache is set on a page, indicating that the |
2855 | * page is known to the local caching routines. | |
2856 | * | |
cf9a2ae8 | 2857 | * The @gfp_mask argument specifies whether I/O may be performed to release |
3f31fddf | 2858 | * this page (__GFP_IO), and whether the call may block (__GFP_WAIT & __GFP_FS). |
cf9a2ae8 | 2859 | * |
cf9a2ae8 DH |
2860 | */ |
2861 | int try_to_release_page(struct page *page, gfp_t gfp_mask) | |
2862 | { | |
2863 | struct address_space * const mapping = page->mapping; | |
2864 | ||
2865 | BUG_ON(!PageLocked(page)); | |
2866 | if (PageWriteback(page)) | |
2867 | return 0; | |
2868 | ||
2869 | if (mapping && mapping->a_ops->releasepage) | |
2870 | return mapping->a_ops->releasepage(page, gfp_mask); | |
2871 | return try_to_free_buffers(page); | |
2872 | } | |
2873 | ||
2874 | EXPORT_SYMBOL(try_to_release_page); |