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