]>
Commit | Line | Data |
---|---|---|
457c8996 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
1da177e4 LT |
2 | /* |
3 | * linux/mm/filemap.c | |
4 | * | |
5 | * Copyright (C) 1994-1999 Linus Torvalds | |
6 | */ | |
7 | ||
8 | /* | |
9 | * This file handles the generic file mmap semantics used by | |
10 | * most "normal" filesystems (but you don't /have/ to use this: | |
11 | * the NFS filesystem used to do this differently, for example) | |
12 | */ | |
b95f1b31 | 13 | #include <linux/export.h> |
1da177e4 | 14 | #include <linux/compiler.h> |
f9fe48be | 15 | #include <linux/dax.h> |
1da177e4 | 16 | #include <linux/fs.h> |
3f07c014 | 17 | #include <linux/sched/signal.h> |
c22ce143 | 18 | #include <linux/uaccess.h> |
c59ede7b | 19 | #include <linux/capability.h> |
1da177e4 | 20 | #include <linux/kernel_stat.h> |
5a0e3ad6 | 21 | #include <linux/gfp.h> |
1da177e4 LT |
22 | #include <linux/mm.h> |
23 | #include <linux/swap.h> | |
24 | #include <linux/mman.h> | |
25 | #include <linux/pagemap.h> | |
26 | #include <linux/file.h> | |
27 | #include <linux/uio.h> | |
cfcbfb13 | 28 | #include <linux/error-injection.h> |
1da177e4 LT |
29 | #include <linux/hash.h> |
30 | #include <linux/writeback.h> | |
53253383 | 31 | #include <linux/backing-dev.h> |
1da177e4 | 32 | #include <linux/pagevec.h> |
1da177e4 | 33 | #include <linux/security.h> |
44110fe3 | 34 | #include <linux/cpuset.h> |
00501b53 | 35 | #include <linux/hugetlb.h> |
8a9f3ccd | 36 | #include <linux/memcontrol.h> |
c515e1fd | 37 | #include <linux/cleancache.h> |
c7df8ad2 | 38 | #include <linux/shmem_fs.h> |
f1820361 | 39 | #include <linux/rmap.h> |
b1d29ba8 | 40 | #include <linux/delayacct.h> |
eb414681 | 41 | #include <linux/psi.h> |
d0e6a582 | 42 | #include <linux/ramfs.h> |
b9306a79 | 43 | #include <linux/page_idle.h> |
f9ce0be7 | 44 | #include <asm/pgalloc.h> |
de591a82 | 45 | #include <asm/tlbflush.h> |
0f8053a5 NP |
46 | #include "internal.h" |
47 | ||
fe0bfaaf RJ |
48 | #define CREATE_TRACE_POINTS |
49 | #include <trace/events/filemap.h> | |
50 | ||
1da177e4 | 51 | /* |
1da177e4 LT |
52 | * FIXME: remove all knowledge of the buffer layer from the core VM |
53 | */ | |
148f948b | 54 | #include <linux/buffer_head.h> /* for try_to_free_buffers */ |
1da177e4 | 55 | |
1da177e4 LT |
56 | #include <asm/mman.h> |
57 | ||
58 | /* | |
59 | * Shared mappings implemented 30.11.1994. It's not fully working yet, | |
60 | * though. | |
61 | * | |
62 | * Shared mappings now work. 15.8.1995 Bruno. | |
63 | * | |
64 | * finished 'unifying' the page and buffer cache and SMP-threaded the | |
65 | * page-cache, 21.05.1999, Ingo Molnar <mingo@redhat.com> | |
66 | * | |
67 | * SMP-threaded pagemap-LRU 1999, Andrea Arcangeli <andrea@suse.de> | |
68 | */ | |
69 | ||
70 | /* | |
71 | * Lock ordering: | |
72 | * | |
c8c06efa | 73 | * ->i_mmap_rwsem (truncate_pagecache) |
1da177e4 | 74 | * ->private_lock (__free_pte->__set_page_dirty_buffers) |
5d337b91 | 75 | * ->swap_lock (exclusive_swap_page, others) |
b93b0163 | 76 | * ->i_pages lock |
1da177e4 | 77 | * |
9608703e | 78 | * ->i_rwsem |
730633f0 JK |
79 | * ->invalidate_lock (acquired by fs in truncate path) |
80 | * ->i_mmap_rwsem (truncate->unmap_mapping_range) | |
1da177e4 | 81 | * |
c1e8d7c6 | 82 | * ->mmap_lock |
c8c06efa | 83 | * ->i_mmap_rwsem |
b8072f09 | 84 | * ->page_table_lock or pte_lock (various, mainly in memory.c) |
b93b0163 | 85 | * ->i_pages lock (arch-dependent flush_dcache_mmap_lock) |
1da177e4 | 86 | * |
c1e8d7c6 | 87 | * ->mmap_lock |
730633f0 JK |
88 | * ->invalidate_lock (filemap_fault) |
89 | * ->lock_page (filemap_fault, access_process_vm) | |
1da177e4 | 90 | * |
9608703e | 91 | * ->i_rwsem (generic_perform_write) |
bb523b40 | 92 | * ->mmap_lock (fault_in_readable->do_page_fault) |
1da177e4 | 93 | * |
f758eeab | 94 | * bdi->wb.list_lock |
a66979ab | 95 | * sb_lock (fs/fs-writeback.c) |
b93b0163 | 96 | * ->i_pages lock (__sync_single_inode) |
1da177e4 | 97 | * |
c8c06efa | 98 | * ->i_mmap_rwsem |
1da177e4 LT |
99 | * ->anon_vma.lock (vma_adjust) |
100 | * | |
101 | * ->anon_vma.lock | |
b8072f09 | 102 | * ->page_table_lock or pte_lock (anon_vma_prepare and various) |
1da177e4 | 103 | * |
b8072f09 | 104 | * ->page_table_lock or pte_lock |
5d337b91 | 105 | * ->swap_lock (try_to_unmap_one) |
1da177e4 | 106 | * ->private_lock (try_to_unmap_one) |
b93b0163 | 107 | * ->i_pages lock (try_to_unmap_one) |
15b44736 HD |
108 | * ->lruvec->lru_lock (follow_page->mark_page_accessed) |
109 | * ->lruvec->lru_lock (check_pte_range->isolate_lru_page) | |
1da177e4 | 110 | * ->private_lock (page_remove_rmap->set_page_dirty) |
b93b0163 | 111 | * ->i_pages lock (page_remove_rmap->set_page_dirty) |
f758eeab | 112 | * bdi.wb->list_lock (page_remove_rmap->set_page_dirty) |
250df6ed | 113 | * ->inode->i_lock (page_remove_rmap->set_page_dirty) |
81f8c3a4 | 114 | * ->memcg->move_lock (page_remove_rmap->lock_page_memcg) |
f758eeab | 115 | * bdi.wb->list_lock (zap_pte_range->set_page_dirty) |
250df6ed | 116 | * ->inode->i_lock (zap_pte_range->set_page_dirty) |
1da177e4 LT |
117 | * ->private_lock (zap_pte_range->__set_page_dirty_buffers) |
118 | * | |
c8c06efa | 119 | * ->i_mmap_rwsem |
9a3c531d | 120 | * ->tasklist_lock (memory_failure, collect_procs_ao) |
1da177e4 LT |
121 | */ |
122 | ||
5c024e6a | 123 | static void page_cache_delete(struct address_space *mapping, |
91b0abe3 JW |
124 | struct page *page, void *shadow) |
125 | { | |
5c024e6a MW |
126 | XA_STATE(xas, &mapping->i_pages, page->index); |
127 | unsigned int nr = 1; | |
c70b647d | 128 | |
5c024e6a | 129 | mapping_set_update(&xas, mapping); |
c70b647d | 130 | |
5c024e6a MW |
131 | /* hugetlb pages are represented by a single entry in the xarray */ |
132 | if (!PageHuge(page)) { | |
133 | xas_set_order(&xas, page->index, compound_order(page)); | |
d8c6546b | 134 | nr = compound_nr(page); |
5c024e6a | 135 | } |
91b0abe3 | 136 | |
83929372 KS |
137 | VM_BUG_ON_PAGE(!PageLocked(page), page); |
138 | VM_BUG_ON_PAGE(PageTail(page), page); | |
139 | VM_BUG_ON_PAGE(nr != 1 && shadow, page); | |
449dd698 | 140 | |
5c024e6a MW |
141 | xas_store(&xas, shadow); |
142 | xas_init_marks(&xas); | |
d3798ae8 | 143 | |
2300638b JK |
144 | page->mapping = NULL; |
145 | /* Leave page->index set: truncation lookup relies upon it */ | |
d3798ae8 | 146 | mapping->nrpages -= nr; |
91b0abe3 JW |
147 | } |
148 | ||
5ecc4d85 JK |
149 | static void unaccount_page_cache_page(struct address_space *mapping, |
150 | struct page *page) | |
1da177e4 | 151 | { |
5ecc4d85 | 152 | int nr; |
1da177e4 | 153 | |
c515e1fd DM |
154 | /* |
155 | * if we're uptodate, flush out into the cleancache, otherwise | |
156 | * invalidate any existing cleancache entries. We can't leave | |
157 | * stale data around in the cleancache once our page is gone | |
158 | */ | |
159 | if (PageUptodate(page) && PageMappedToDisk(page)) | |
160 | cleancache_put_page(page); | |
161 | else | |
3167760f | 162 | cleancache_invalidate_page(mapping, page); |
c515e1fd | 163 | |
83929372 | 164 | VM_BUG_ON_PAGE(PageTail(page), page); |
06b241f3 HD |
165 | VM_BUG_ON_PAGE(page_mapped(page), page); |
166 | if (!IS_ENABLED(CONFIG_DEBUG_VM) && unlikely(page_mapped(page))) { | |
167 | int mapcount; | |
168 | ||
169 | pr_alert("BUG: Bad page cache in process %s pfn:%05lx\n", | |
170 | current->comm, page_to_pfn(page)); | |
171 | dump_page(page, "still mapped when deleted"); | |
172 | dump_stack(); | |
173 | add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE); | |
174 | ||
175 | mapcount = page_mapcount(page); | |
176 | if (mapping_exiting(mapping) && | |
177 | page_count(page) >= mapcount + 2) { | |
178 | /* | |
179 | * All vmas have already been torn down, so it's | |
180 | * a good bet that actually the page is unmapped, | |
181 | * and we'd prefer not to leak it: if we're wrong, | |
182 | * some other bad page check should catch it later. | |
183 | */ | |
184 | page_mapcount_reset(page); | |
6d061f9f | 185 | page_ref_sub(page, mapcount); |
06b241f3 HD |
186 | } |
187 | } | |
188 | ||
4165b9b4 | 189 | /* hugetlb pages do not participate in page cache accounting. */ |
5ecc4d85 JK |
190 | if (PageHuge(page)) |
191 | return; | |
09612fa6 | 192 | |
6c357848 | 193 | nr = thp_nr_pages(page); |
5ecc4d85 | 194 | |
0d1c2072 | 195 | __mod_lruvec_page_state(page, NR_FILE_PAGES, -nr); |
5ecc4d85 | 196 | if (PageSwapBacked(page)) { |
0d1c2072 | 197 | __mod_lruvec_page_state(page, NR_SHMEM, -nr); |
5ecc4d85 | 198 | if (PageTransHuge(page)) |
57b2847d | 199 | __mod_lruvec_page_state(page, NR_SHMEM_THPS, -nr); |
99cb0dbd | 200 | } else if (PageTransHuge(page)) { |
bf9ecead | 201 | __mod_lruvec_page_state(page, NR_FILE_THPS, -nr); |
09d91cda | 202 | filemap_nr_thps_dec(mapping); |
800d8c63 | 203 | } |
5ecc4d85 JK |
204 | |
205 | /* | |
206 | * At this point page must be either written or cleaned by | |
207 | * truncate. Dirty page here signals a bug and loss of | |
208 | * unwritten data. | |
209 | * | |
210 | * This fixes dirty accounting after removing the page entirely | |
211 | * but leaves PageDirty set: it has no effect for truncated | |
212 | * page and anyway will be cleared before returning page into | |
213 | * buddy allocator. | |
214 | */ | |
215 | if (WARN_ON_ONCE(PageDirty(page))) | |
216 | account_page_cleaned(page, mapping, inode_to_wb(mapping->host)); | |
217 | } | |
218 | ||
219 | /* | |
220 | * Delete a page from the page cache and free it. Caller has to make | |
221 | * sure the page is locked and that nobody else uses it - or that usage | |
b93b0163 | 222 | * is safe. The caller must hold the i_pages lock. |
5ecc4d85 JK |
223 | */ |
224 | void __delete_from_page_cache(struct page *page, void *shadow) | |
225 | { | |
226 | struct address_space *mapping = page->mapping; | |
227 | ||
228 | trace_mm_filemap_delete_from_page_cache(page); | |
229 | ||
230 | unaccount_page_cache_page(mapping, page); | |
5c024e6a | 231 | page_cache_delete(mapping, page, shadow); |
1da177e4 LT |
232 | } |
233 | ||
59c66c5f JK |
234 | static void page_cache_free_page(struct address_space *mapping, |
235 | struct page *page) | |
236 | { | |
237 | void (*freepage)(struct page *); | |
238 | ||
239 | freepage = mapping->a_ops->freepage; | |
240 | if (freepage) | |
241 | freepage(page); | |
242 | ||
243 | if (PageTransHuge(page) && !PageHuge(page)) { | |
887b22c6 | 244 | page_ref_sub(page, thp_nr_pages(page)); |
59c66c5f JK |
245 | VM_BUG_ON_PAGE(page_count(page) <= 0, page); |
246 | } else { | |
247 | put_page(page); | |
248 | } | |
249 | } | |
250 | ||
702cfbf9 MK |
251 | /** |
252 | * delete_from_page_cache - delete page from page cache | |
253 | * @page: the page which the kernel is trying to remove from page cache | |
254 | * | |
255 | * This must be called only on pages that have been verified to be in the page | |
256 | * cache and locked. It will never put the page into the free list, the caller | |
257 | * has a reference on the page. | |
258 | */ | |
259 | void delete_from_page_cache(struct page *page) | |
1da177e4 | 260 | { |
83929372 | 261 | struct address_space *mapping = page_mapping(page); |
1da177e4 | 262 | |
cd7619d6 | 263 | BUG_ON(!PageLocked(page)); |
51b8c1fe | 264 | spin_lock(&mapping->host->i_lock); |
30472509 | 265 | xa_lock_irq(&mapping->i_pages); |
62cccb8c | 266 | __delete_from_page_cache(page, NULL); |
30472509 | 267 | xa_unlock_irq(&mapping->i_pages); |
51b8c1fe JW |
268 | if (mapping_shrinkable(mapping)) |
269 | inode_add_lru(mapping->host); | |
270 | spin_unlock(&mapping->host->i_lock); | |
6072d13c | 271 | |
59c66c5f | 272 | page_cache_free_page(mapping, page); |
97cecb5a MK |
273 | } |
274 | EXPORT_SYMBOL(delete_from_page_cache); | |
275 | ||
aa65c29c | 276 | /* |
ef8e5717 | 277 | * page_cache_delete_batch - delete several pages from page cache |
aa65c29c JK |
278 | * @mapping: the mapping to which pages belong |
279 | * @pvec: pagevec with pages to delete | |
280 | * | |
b93b0163 | 281 | * The function walks over mapping->i_pages and removes pages passed in @pvec |
4101196b MWO |
282 | * from the mapping. The function expects @pvec to be sorted by page index |
283 | * and is optimised for it to be dense. | |
b93b0163 | 284 | * It tolerates holes in @pvec (mapping entries at those indices are not |
aa65c29c | 285 | * modified). The function expects only THP head pages to be present in the |
4101196b | 286 | * @pvec. |
aa65c29c | 287 | * |
b93b0163 | 288 | * The function expects the i_pages lock to be held. |
aa65c29c | 289 | */ |
ef8e5717 | 290 | static void page_cache_delete_batch(struct address_space *mapping, |
aa65c29c JK |
291 | struct pagevec *pvec) |
292 | { | |
ef8e5717 | 293 | XA_STATE(xas, &mapping->i_pages, pvec->pages[0]->index); |
aa65c29c | 294 | int total_pages = 0; |
4101196b | 295 | int i = 0; |
aa65c29c | 296 | struct page *page; |
aa65c29c | 297 | |
ef8e5717 MW |
298 | mapping_set_update(&xas, mapping); |
299 | xas_for_each(&xas, page, ULONG_MAX) { | |
4101196b | 300 | if (i >= pagevec_count(pvec)) |
aa65c29c | 301 | break; |
4101196b MWO |
302 | |
303 | /* A swap/dax/shadow entry got inserted? Skip it. */ | |
3159f943 | 304 | if (xa_is_value(page)) |
aa65c29c | 305 | continue; |
4101196b MWO |
306 | /* |
307 | * A page got inserted in our range? Skip it. We have our | |
308 | * pages locked so they are protected from being removed. | |
309 | * If we see a page whose index is higher than ours, it | |
310 | * means our page has been removed, which shouldn't be | |
311 | * possible because we're holding the PageLock. | |
312 | */ | |
313 | if (page != pvec->pages[i]) { | |
314 | VM_BUG_ON_PAGE(page->index > pvec->pages[i]->index, | |
315 | page); | |
316 | continue; | |
317 | } | |
318 | ||
319 | WARN_ON_ONCE(!PageLocked(page)); | |
320 | ||
321 | if (page->index == xas.xa_index) | |
aa65c29c | 322 | page->mapping = NULL; |
4101196b MWO |
323 | /* Leave page->index set: truncation lookup relies on it */ |
324 | ||
325 | /* | |
326 | * Move to the next page in the vector if this is a regular | |
327 | * page or the index is of the last sub-page of this compound | |
328 | * page. | |
329 | */ | |
330 | if (page->index + compound_nr(page) - 1 == xas.xa_index) | |
aa65c29c | 331 | i++; |
ef8e5717 | 332 | xas_store(&xas, NULL); |
aa65c29c JK |
333 | total_pages++; |
334 | } | |
335 | mapping->nrpages -= total_pages; | |
336 | } | |
337 | ||
338 | void delete_from_page_cache_batch(struct address_space *mapping, | |
339 | struct pagevec *pvec) | |
340 | { | |
341 | int i; | |
aa65c29c JK |
342 | |
343 | if (!pagevec_count(pvec)) | |
344 | return; | |
345 | ||
51b8c1fe | 346 | spin_lock(&mapping->host->i_lock); |
30472509 | 347 | xa_lock_irq(&mapping->i_pages); |
aa65c29c JK |
348 | for (i = 0; i < pagevec_count(pvec); i++) { |
349 | trace_mm_filemap_delete_from_page_cache(pvec->pages[i]); | |
350 | ||
351 | unaccount_page_cache_page(mapping, pvec->pages[i]); | |
352 | } | |
ef8e5717 | 353 | page_cache_delete_batch(mapping, pvec); |
30472509 | 354 | xa_unlock_irq(&mapping->i_pages); |
51b8c1fe JW |
355 | if (mapping_shrinkable(mapping)) |
356 | inode_add_lru(mapping->host); | |
357 | spin_unlock(&mapping->host->i_lock); | |
aa65c29c JK |
358 | |
359 | for (i = 0; i < pagevec_count(pvec); i++) | |
360 | page_cache_free_page(mapping, pvec->pages[i]); | |
361 | } | |
362 | ||
d72d9e2a | 363 | int filemap_check_errors(struct address_space *mapping) |
865ffef3 DM |
364 | { |
365 | int ret = 0; | |
366 | /* Check for outstanding write errors */ | |
7fcbbaf1 JA |
367 | if (test_bit(AS_ENOSPC, &mapping->flags) && |
368 | test_and_clear_bit(AS_ENOSPC, &mapping->flags)) | |
865ffef3 | 369 | ret = -ENOSPC; |
7fcbbaf1 JA |
370 | if (test_bit(AS_EIO, &mapping->flags) && |
371 | test_and_clear_bit(AS_EIO, &mapping->flags)) | |
865ffef3 DM |
372 | ret = -EIO; |
373 | return ret; | |
374 | } | |
d72d9e2a | 375 | EXPORT_SYMBOL(filemap_check_errors); |
865ffef3 | 376 | |
76341cab JL |
377 | static int filemap_check_and_keep_errors(struct address_space *mapping) |
378 | { | |
379 | /* Check for outstanding write errors */ | |
380 | if (test_bit(AS_EIO, &mapping->flags)) | |
381 | return -EIO; | |
382 | if (test_bit(AS_ENOSPC, &mapping->flags)) | |
383 | return -ENOSPC; | |
384 | return 0; | |
385 | } | |
386 | ||
5a798493 JB |
387 | /** |
388 | * filemap_fdatawrite_wbc - start writeback on mapping dirty pages in range | |
389 | * @mapping: address space structure to write | |
390 | * @wbc: the writeback_control controlling the writeout | |
391 | * | |
392 | * Call writepages on the mapping using the provided wbc to control the | |
393 | * writeout. | |
394 | * | |
395 | * Return: %0 on success, negative error code otherwise. | |
396 | */ | |
397 | int filemap_fdatawrite_wbc(struct address_space *mapping, | |
398 | struct writeback_control *wbc) | |
399 | { | |
400 | int ret; | |
401 | ||
402 | if (!mapping_can_writeback(mapping) || | |
403 | !mapping_tagged(mapping, PAGECACHE_TAG_DIRTY)) | |
404 | return 0; | |
405 | ||
406 | wbc_attach_fdatawrite_inode(wbc, mapping->host); | |
407 | ret = do_writepages(mapping, wbc); | |
408 | wbc_detach_inode(wbc); | |
409 | return ret; | |
410 | } | |
411 | EXPORT_SYMBOL(filemap_fdatawrite_wbc); | |
412 | ||
1da177e4 | 413 | /** |
485bb99b | 414 | * __filemap_fdatawrite_range - start writeback on mapping dirty pages in range |
67be2dd1 MW |
415 | * @mapping: address space structure to write |
416 | * @start: offset in bytes where the range starts | |
469eb4d0 | 417 | * @end: offset in bytes where the range ends (inclusive) |
67be2dd1 | 418 | * @sync_mode: enable synchronous operation |
1da177e4 | 419 | * |
485bb99b RD |
420 | * Start writeback against all of a mapping's dirty pages that lie |
421 | * within the byte offsets <start, end> inclusive. | |
422 | * | |
1da177e4 | 423 | * If sync_mode is WB_SYNC_ALL then this is a "data integrity" operation, as |
485bb99b | 424 | * opposed to a regular memory cleansing writeback. The difference between |
1da177e4 LT |
425 | * these two operations is that if a dirty page/buffer is encountered, it must |
426 | * be waited upon, and not just skipped over. | |
a862f68a MR |
427 | * |
428 | * Return: %0 on success, negative error code otherwise. | |
1da177e4 | 429 | */ |
ebcf28e1 AM |
430 | int __filemap_fdatawrite_range(struct address_space *mapping, loff_t start, |
431 | loff_t end, int sync_mode) | |
1da177e4 | 432 | { |
1da177e4 LT |
433 | struct writeback_control wbc = { |
434 | .sync_mode = sync_mode, | |
05fe478d | 435 | .nr_to_write = LONG_MAX, |
111ebb6e OH |
436 | .range_start = start, |
437 | .range_end = end, | |
1da177e4 LT |
438 | }; |
439 | ||
5a798493 | 440 | return filemap_fdatawrite_wbc(mapping, &wbc); |
1da177e4 LT |
441 | } |
442 | ||
443 | static inline int __filemap_fdatawrite(struct address_space *mapping, | |
444 | int sync_mode) | |
445 | { | |
111ebb6e | 446 | return __filemap_fdatawrite_range(mapping, 0, LLONG_MAX, sync_mode); |
1da177e4 LT |
447 | } |
448 | ||
449 | int filemap_fdatawrite(struct address_space *mapping) | |
450 | { | |
451 | return __filemap_fdatawrite(mapping, WB_SYNC_ALL); | |
452 | } | |
453 | EXPORT_SYMBOL(filemap_fdatawrite); | |
454 | ||
f4c0a0fd | 455 | int filemap_fdatawrite_range(struct address_space *mapping, loff_t start, |
ebcf28e1 | 456 | loff_t end) |
1da177e4 LT |
457 | { |
458 | return __filemap_fdatawrite_range(mapping, start, end, WB_SYNC_ALL); | |
459 | } | |
f4c0a0fd | 460 | EXPORT_SYMBOL(filemap_fdatawrite_range); |
1da177e4 | 461 | |
485bb99b RD |
462 | /** |
463 | * filemap_flush - mostly a non-blocking flush | |
464 | * @mapping: target address_space | |
465 | * | |
1da177e4 LT |
466 | * This is a mostly non-blocking flush. Not suitable for data-integrity |
467 | * purposes - I/O may not be started against all dirty pages. | |
a862f68a MR |
468 | * |
469 | * Return: %0 on success, negative error code otherwise. | |
1da177e4 LT |
470 | */ |
471 | int filemap_flush(struct address_space *mapping) | |
472 | { | |
473 | return __filemap_fdatawrite(mapping, WB_SYNC_NONE); | |
474 | } | |
475 | EXPORT_SYMBOL(filemap_flush); | |
476 | ||
7fc9e472 GR |
477 | /** |
478 | * filemap_range_has_page - check if a page exists in range. | |
479 | * @mapping: address space within which to check | |
480 | * @start_byte: offset in bytes where the range starts | |
481 | * @end_byte: offset in bytes where the range ends (inclusive) | |
482 | * | |
483 | * Find at least one page in the range supplied, usually used to check if | |
484 | * direct writing in this range will trigger a writeback. | |
a862f68a MR |
485 | * |
486 | * Return: %true if at least one page exists in the specified range, | |
487 | * %false otherwise. | |
7fc9e472 GR |
488 | */ |
489 | bool filemap_range_has_page(struct address_space *mapping, | |
490 | loff_t start_byte, loff_t end_byte) | |
491 | { | |
f7b68046 | 492 | struct page *page; |
8fa8e538 MW |
493 | XA_STATE(xas, &mapping->i_pages, start_byte >> PAGE_SHIFT); |
494 | pgoff_t max = end_byte >> PAGE_SHIFT; | |
7fc9e472 GR |
495 | |
496 | if (end_byte < start_byte) | |
497 | return false; | |
498 | ||
8fa8e538 MW |
499 | rcu_read_lock(); |
500 | for (;;) { | |
501 | page = xas_find(&xas, max); | |
502 | if (xas_retry(&xas, page)) | |
503 | continue; | |
504 | /* Shadow entries don't count */ | |
505 | if (xa_is_value(page)) | |
506 | continue; | |
507 | /* | |
508 | * We don't need to try to pin this page; we're about to | |
509 | * release the RCU lock anyway. It is enough to know that | |
510 | * there was a page here recently. | |
511 | */ | |
512 | break; | |
513 | } | |
514 | rcu_read_unlock(); | |
7fc9e472 | 515 | |
8fa8e538 | 516 | return page != NULL; |
7fc9e472 GR |
517 | } |
518 | EXPORT_SYMBOL(filemap_range_has_page); | |
519 | ||
5e8fcc1a | 520 | static void __filemap_fdatawait_range(struct address_space *mapping, |
aa750fd7 | 521 | loff_t start_byte, loff_t end_byte) |
1da177e4 | 522 | { |
09cbfeaf KS |
523 | pgoff_t index = start_byte >> PAGE_SHIFT; |
524 | pgoff_t end = end_byte >> PAGE_SHIFT; | |
1da177e4 LT |
525 | struct pagevec pvec; |
526 | int nr_pages; | |
1da177e4 | 527 | |
94004ed7 | 528 | if (end_byte < start_byte) |
5e8fcc1a | 529 | return; |
1da177e4 | 530 | |
86679820 | 531 | pagevec_init(&pvec); |
312e9d2f | 532 | while (index <= end) { |
1da177e4 LT |
533 | unsigned i; |
534 | ||
312e9d2f | 535 | nr_pages = pagevec_lookup_range_tag(&pvec, mapping, &index, |
67fd707f | 536 | end, PAGECACHE_TAG_WRITEBACK); |
312e9d2f JK |
537 | if (!nr_pages) |
538 | break; | |
539 | ||
1da177e4 LT |
540 | for (i = 0; i < nr_pages; i++) { |
541 | struct page *page = pvec.pages[i]; | |
542 | ||
1da177e4 | 543 | wait_on_page_writeback(page); |
5e8fcc1a | 544 | ClearPageError(page); |
1da177e4 LT |
545 | } |
546 | pagevec_release(&pvec); | |
547 | cond_resched(); | |
548 | } | |
aa750fd7 JN |
549 | } |
550 | ||
551 | /** | |
552 | * filemap_fdatawait_range - wait for writeback to complete | |
553 | * @mapping: address space structure to wait for | |
554 | * @start_byte: offset in bytes where the range starts | |
555 | * @end_byte: offset in bytes where the range ends (inclusive) | |
556 | * | |
557 | * Walk the list of under-writeback pages of the given address space | |
558 | * in the given range and wait for all of them. Check error status of | |
559 | * the address space and return it. | |
560 | * | |
561 | * Since the error status of the address space is cleared by this function, | |
562 | * callers are responsible for checking the return value and handling and/or | |
563 | * reporting the error. | |
a862f68a MR |
564 | * |
565 | * Return: error status of the address space. | |
aa750fd7 JN |
566 | */ |
567 | int filemap_fdatawait_range(struct address_space *mapping, loff_t start_byte, | |
568 | loff_t end_byte) | |
569 | { | |
5e8fcc1a JL |
570 | __filemap_fdatawait_range(mapping, start_byte, end_byte); |
571 | return filemap_check_errors(mapping); | |
1da177e4 | 572 | } |
d3bccb6f JK |
573 | EXPORT_SYMBOL(filemap_fdatawait_range); |
574 | ||
aa0bfcd9 RZ |
575 | /** |
576 | * filemap_fdatawait_range_keep_errors - wait for writeback to complete | |
577 | * @mapping: address space structure to wait for | |
578 | * @start_byte: offset in bytes where the range starts | |
579 | * @end_byte: offset in bytes where the range ends (inclusive) | |
580 | * | |
581 | * Walk the list of under-writeback pages of the given address space in the | |
582 | * given range and wait for all of them. Unlike filemap_fdatawait_range(), | |
583 | * this function does not clear error status of the address space. | |
584 | * | |
585 | * Use this function if callers don't handle errors themselves. Expected | |
586 | * call sites are system-wide / filesystem-wide data flushers: e.g. sync(2), | |
587 | * fsfreeze(8) | |
588 | */ | |
589 | int filemap_fdatawait_range_keep_errors(struct address_space *mapping, | |
590 | loff_t start_byte, loff_t end_byte) | |
591 | { | |
592 | __filemap_fdatawait_range(mapping, start_byte, end_byte); | |
593 | return filemap_check_and_keep_errors(mapping); | |
594 | } | |
595 | EXPORT_SYMBOL(filemap_fdatawait_range_keep_errors); | |
596 | ||
a823e458 JL |
597 | /** |
598 | * file_fdatawait_range - wait for writeback to complete | |
599 | * @file: file pointing to address space structure to wait for | |
600 | * @start_byte: offset in bytes where the range starts | |
601 | * @end_byte: offset in bytes where the range ends (inclusive) | |
602 | * | |
603 | * Walk the list of under-writeback pages of the address space that file | |
604 | * refers to, in the given range and wait for all of them. Check error | |
605 | * status of the address space vs. the file->f_wb_err cursor and return it. | |
606 | * | |
607 | * Since the error status of the file is advanced by this function, | |
608 | * callers are responsible for checking the return value and handling and/or | |
609 | * reporting the error. | |
a862f68a MR |
610 | * |
611 | * Return: error status of the address space vs. the file->f_wb_err cursor. | |
a823e458 JL |
612 | */ |
613 | int file_fdatawait_range(struct file *file, loff_t start_byte, loff_t end_byte) | |
614 | { | |
615 | struct address_space *mapping = file->f_mapping; | |
616 | ||
617 | __filemap_fdatawait_range(mapping, start_byte, end_byte); | |
618 | return file_check_and_advance_wb_err(file); | |
619 | } | |
620 | EXPORT_SYMBOL(file_fdatawait_range); | |
d3bccb6f | 621 | |
aa750fd7 JN |
622 | /** |
623 | * filemap_fdatawait_keep_errors - wait for writeback without clearing errors | |
624 | * @mapping: address space structure to wait for | |
625 | * | |
626 | * Walk the list of under-writeback pages of the given address space | |
627 | * and wait for all of them. Unlike filemap_fdatawait(), this function | |
628 | * does not clear error status of the address space. | |
629 | * | |
630 | * Use this function if callers don't handle errors themselves. Expected | |
631 | * call sites are system-wide / filesystem-wide data flushers: e.g. sync(2), | |
632 | * fsfreeze(8) | |
a862f68a MR |
633 | * |
634 | * Return: error status of the address space. | |
aa750fd7 | 635 | */ |
76341cab | 636 | int filemap_fdatawait_keep_errors(struct address_space *mapping) |
aa750fd7 | 637 | { |
ffb959bb | 638 | __filemap_fdatawait_range(mapping, 0, LLONG_MAX); |
76341cab | 639 | return filemap_check_and_keep_errors(mapping); |
aa750fd7 | 640 | } |
76341cab | 641 | EXPORT_SYMBOL(filemap_fdatawait_keep_errors); |
aa750fd7 | 642 | |
875d91b1 | 643 | /* Returns true if writeback might be needed or already in progress. */ |
9326c9b2 | 644 | static bool mapping_needs_writeback(struct address_space *mapping) |
1da177e4 | 645 | { |
875d91b1 | 646 | return mapping->nrpages; |
1da177e4 | 647 | } |
1da177e4 | 648 | |
f8ee8909 JA |
649 | static bool filemap_range_has_writeback(struct address_space *mapping, |
650 | loff_t start_byte, loff_t end_byte) | |
651 | { | |
652 | XA_STATE(xas, &mapping->i_pages, start_byte >> PAGE_SHIFT); | |
653 | pgoff_t max = end_byte >> PAGE_SHIFT; | |
654 | struct page *page; | |
655 | ||
656 | if (end_byte < start_byte) | |
657 | return false; | |
658 | ||
659 | rcu_read_lock(); | |
660 | xas_for_each(&xas, page, max) { | |
661 | if (xas_retry(&xas, page)) | |
662 | continue; | |
663 | if (xa_is_value(page)) | |
664 | continue; | |
665 | if (PageDirty(page) || PageLocked(page) || PageWriteback(page)) | |
666 | break; | |
667 | } | |
668 | rcu_read_unlock(); | |
669 | return page != NULL; | |
670 | ||
671 | } | |
672 | ||
63135aa3 JA |
673 | /** |
674 | * filemap_range_needs_writeback - check if range potentially needs writeback | |
675 | * @mapping: address space within which to check | |
676 | * @start_byte: offset in bytes where the range starts | |
677 | * @end_byte: offset in bytes where the range ends (inclusive) | |
678 | * | |
679 | * Find at least one page in the range supplied, usually used to check if | |
680 | * direct writing in this range will trigger a writeback. Used by O_DIRECT | |
681 | * read/write with IOCB_NOWAIT, to see if the caller needs to do | |
682 | * filemap_write_and_wait_range() before proceeding. | |
683 | * | |
684 | * Return: %true if the caller should do filemap_write_and_wait_range() before | |
685 | * doing O_DIRECT to a page in this range, %false otherwise. | |
686 | */ | |
687 | bool filemap_range_needs_writeback(struct address_space *mapping, | |
688 | loff_t start_byte, loff_t end_byte) | |
689 | { | |
63135aa3 JA |
690 | if (!mapping_needs_writeback(mapping)) |
691 | return false; | |
692 | if (!mapping_tagged(mapping, PAGECACHE_TAG_DIRTY) && | |
693 | !mapping_tagged(mapping, PAGECACHE_TAG_WRITEBACK)) | |
694 | return false; | |
f8ee8909 | 695 | return filemap_range_has_writeback(mapping, start_byte, end_byte); |
63135aa3 JA |
696 | } |
697 | EXPORT_SYMBOL_GPL(filemap_range_needs_writeback); | |
698 | ||
485bb99b RD |
699 | /** |
700 | * filemap_write_and_wait_range - write out & wait on a file range | |
701 | * @mapping: the address_space for the pages | |
702 | * @lstart: offset in bytes where the range starts | |
703 | * @lend: offset in bytes where the range ends (inclusive) | |
704 | * | |
469eb4d0 AM |
705 | * Write out and wait upon file offsets lstart->lend, inclusive. |
706 | * | |
0e056eb5 | 707 | * Note that @lend is inclusive (describes the last byte to be written) so |
469eb4d0 | 708 | * that this function can be used to write to the very end-of-file (end = -1). |
a862f68a MR |
709 | * |
710 | * Return: error status of the address space. | |
469eb4d0 | 711 | */ |
1da177e4 LT |
712 | int filemap_write_and_wait_range(struct address_space *mapping, |
713 | loff_t lstart, loff_t lend) | |
714 | { | |
28fd1298 | 715 | int err = 0; |
1da177e4 | 716 | |
9326c9b2 | 717 | if (mapping_needs_writeback(mapping)) { |
28fd1298 OH |
718 | err = __filemap_fdatawrite_range(mapping, lstart, lend, |
719 | WB_SYNC_ALL); | |
ddf8f376 IW |
720 | /* |
721 | * Even if the above returned error, the pages may be | |
722 | * written partially (e.g. -ENOSPC), so we wait for it. | |
723 | * But the -EIO is special case, it may indicate the worst | |
724 | * thing (e.g. bug) happened, so we avoid waiting for it. | |
725 | */ | |
28fd1298 | 726 | if (err != -EIO) { |
94004ed7 CH |
727 | int err2 = filemap_fdatawait_range(mapping, |
728 | lstart, lend); | |
28fd1298 OH |
729 | if (!err) |
730 | err = err2; | |
cbeaf951 JL |
731 | } else { |
732 | /* Clear any previously stored errors */ | |
733 | filemap_check_errors(mapping); | |
28fd1298 | 734 | } |
865ffef3 DM |
735 | } else { |
736 | err = filemap_check_errors(mapping); | |
1da177e4 | 737 | } |
28fd1298 | 738 | return err; |
1da177e4 | 739 | } |
f6995585 | 740 | EXPORT_SYMBOL(filemap_write_and_wait_range); |
1da177e4 | 741 | |
5660e13d JL |
742 | void __filemap_set_wb_err(struct address_space *mapping, int err) |
743 | { | |
3acdfd28 | 744 | errseq_t eseq = errseq_set(&mapping->wb_err, err); |
5660e13d JL |
745 | |
746 | trace_filemap_set_wb_err(mapping, eseq); | |
747 | } | |
748 | EXPORT_SYMBOL(__filemap_set_wb_err); | |
749 | ||
750 | /** | |
751 | * file_check_and_advance_wb_err - report wb error (if any) that was previously | |
752 | * and advance wb_err to current one | |
753 | * @file: struct file on which the error is being reported | |
754 | * | |
755 | * When userland calls fsync (or something like nfsd does the equivalent), we | |
756 | * want to report any writeback errors that occurred since the last fsync (or | |
757 | * since the file was opened if there haven't been any). | |
758 | * | |
759 | * Grab the wb_err from the mapping. If it matches what we have in the file, | |
760 | * then just quickly return 0. The file is all caught up. | |
761 | * | |
762 | * If it doesn't match, then take the mapping value, set the "seen" flag in | |
763 | * it and try to swap it into place. If it works, or another task beat us | |
764 | * to it with the new value, then update the f_wb_err and return the error | |
765 | * portion. The error at this point must be reported via proper channels | |
766 | * (a'la fsync, or NFS COMMIT operation, etc.). | |
767 | * | |
768 | * While we handle mapping->wb_err with atomic operations, the f_wb_err | |
769 | * value is protected by the f_lock since we must ensure that it reflects | |
770 | * the latest value swapped in for this file descriptor. | |
a862f68a MR |
771 | * |
772 | * Return: %0 on success, negative error code otherwise. | |
5660e13d JL |
773 | */ |
774 | int file_check_and_advance_wb_err(struct file *file) | |
775 | { | |
776 | int err = 0; | |
777 | errseq_t old = READ_ONCE(file->f_wb_err); | |
778 | struct address_space *mapping = file->f_mapping; | |
779 | ||
780 | /* Locklessly handle the common case where nothing has changed */ | |
781 | if (errseq_check(&mapping->wb_err, old)) { | |
782 | /* Something changed, must use slow path */ | |
783 | spin_lock(&file->f_lock); | |
784 | old = file->f_wb_err; | |
785 | err = errseq_check_and_advance(&mapping->wb_err, | |
786 | &file->f_wb_err); | |
787 | trace_file_check_and_advance_wb_err(file, old); | |
788 | spin_unlock(&file->f_lock); | |
789 | } | |
f4e222c5 JL |
790 | |
791 | /* | |
792 | * We're mostly using this function as a drop in replacement for | |
793 | * filemap_check_errors. Clear AS_EIO/AS_ENOSPC to emulate the effect | |
794 | * that the legacy code would have had on these flags. | |
795 | */ | |
796 | clear_bit(AS_EIO, &mapping->flags); | |
797 | clear_bit(AS_ENOSPC, &mapping->flags); | |
5660e13d JL |
798 | return err; |
799 | } | |
800 | EXPORT_SYMBOL(file_check_and_advance_wb_err); | |
801 | ||
802 | /** | |
803 | * file_write_and_wait_range - write out & wait on a file range | |
804 | * @file: file pointing to address_space with pages | |
805 | * @lstart: offset in bytes where the range starts | |
806 | * @lend: offset in bytes where the range ends (inclusive) | |
807 | * | |
808 | * Write out and wait upon file offsets lstart->lend, inclusive. | |
809 | * | |
810 | * Note that @lend is inclusive (describes the last byte to be written) so | |
811 | * that this function can be used to write to the very end-of-file (end = -1). | |
812 | * | |
813 | * After writing out and waiting on the data, we check and advance the | |
814 | * f_wb_err cursor to the latest value, and return any errors detected there. | |
a862f68a MR |
815 | * |
816 | * Return: %0 on success, negative error code otherwise. | |
5660e13d JL |
817 | */ |
818 | int file_write_and_wait_range(struct file *file, loff_t lstart, loff_t lend) | |
819 | { | |
820 | int err = 0, err2; | |
821 | struct address_space *mapping = file->f_mapping; | |
822 | ||
9326c9b2 | 823 | if (mapping_needs_writeback(mapping)) { |
5660e13d JL |
824 | err = __filemap_fdatawrite_range(mapping, lstart, lend, |
825 | WB_SYNC_ALL); | |
826 | /* See comment of filemap_write_and_wait() */ | |
827 | if (err != -EIO) | |
828 | __filemap_fdatawait_range(mapping, lstart, lend); | |
829 | } | |
830 | err2 = file_check_and_advance_wb_err(file); | |
831 | if (!err) | |
832 | err = err2; | |
833 | return err; | |
834 | } | |
835 | EXPORT_SYMBOL(file_write_and_wait_range); | |
836 | ||
ef6a3c63 MS |
837 | /** |
838 | * replace_page_cache_page - replace a pagecache page with a new one | |
839 | * @old: page to be replaced | |
840 | * @new: page to replace with | |
ef6a3c63 MS |
841 | * |
842 | * This function replaces a page in the pagecache with a new one. On | |
843 | * success it acquires the pagecache reference for the new page and | |
844 | * drops it for the old page. Both the old and new pages must be | |
845 | * locked. This function does not add the new page to the LRU, the | |
846 | * caller must do that. | |
847 | * | |
74d60958 | 848 | * The remove + add is atomic. This function cannot fail. |
ef6a3c63 | 849 | */ |
1f7ef657 | 850 | void replace_page_cache_page(struct page *old, struct page *new) |
ef6a3c63 | 851 | { |
d21bba2b MWO |
852 | struct folio *fold = page_folio(old); |
853 | struct folio *fnew = page_folio(new); | |
74d60958 MW |
854 | struct address_space *mapping = old->mapping; |
855 | void (*freepage)(struct page *) = mapping->a_ops->freepage; | |
856 | pgoff_t offset = old->index; | |
857 | XA_STATE(xas, &mapping->i_pages, offset); | |
ef6a3c63 | 858 | |
309381fe SL |
859 | VM_BUG_ON_PAGE(!PageLocked(old), old); |
860 | VM_BUG_ON_PAGE(!PageLocked(new), new); | |
861 | VM_BUG_ON_PAGE(new->mapping, new); | |
ef6a3c63 | 862 | |
74d60958 MW |
863 | get_page(new); |
864 | new->mapping = mapping; | |
865 | new->index = offset; | |
ef6a3c63 | 866 | |
d21bba2b | 867 | mem_cgroup_migrate(fold, fnew); |
0d1c2072 | 868 | |
30472509 | 869 | xas_lock_irq(&xas); |
74d60958 | 870 | xas_store(&xas, new); |
4165b9b4 | 871 | |
74d60958 MW |
872 | old->mapping = NULL; |
873 | /* hugetlb pages do not participate in page cache accounting. */ | |
874 | if (!PageHuge(old)) | |
0d1c2072 | 875 | __dec_lruvec_page_state(old, NR_FILE_PAGES); |
74d60958 | 876 | if (!PageHuge(new)) |
0d1c2072 | 877 | __inc_lruvec_page_state(new, NR_FILE_PAGES); |
74d60958 | 878 | if (PageSwapBacked(old)) |
0d1c2072 | 879 | __dec_lruvec_page_state(old, NR_SHMEM); |
74d60958 | 880 | if (PageSwapBacked(new)) |
0d1c2072 | 881 | __inc_lruvec_page_state(new, NR_SHMEM); |
30472509 | 882 | xas_unlock_irq(&xas); |
74d60958 MW |
883 | if (freepage) |
884 | freepage(old); | |
885 | put_page(old); | |
ef6a3c63 MS |
886 | } |
887 | EXPORT_SYMBOL_GPL(replace_page_cache_page); | |
888 | ||
9dd3d069 MWO |
889 | noinline int __filemap_add_folio(struct address_space *mapping, |
890 | struct folio *folio, pgoff_t index, gfp_t gfp, void **shadowp) | |
1da177e4 | 891 | { |
9dd3d069 MWO |
892 | XA_STATE(xas, &mapping->i_pages, index); |
893 | int huge = folio_test_hugetlb(folio); | |
e286781d | 894 | int error; |
da74240e | 895 | bool charged = false; |
e286781d | 896 | |
9dd3d069 MWO |
897 | VM_BUG_ON_FOLIO(!folio_test_locked(folio), folio); |
898 | VM_BUG_ON_FOLIO(folio_test_swapbacked(folio), folio); | |
74d60958 | 899 | mapping_set_update(&xas, mapping); |
e286781d | 900 | |
9dd3d069 MWO |
901 | folio_get(folio); |
902 | folio->mapping = mapping; | |
903 | folio->index = index; | |
66a0c8ee | 904 | |
3fea5a49 | 905 | if (!huge) { |
9dd3d069 MWO |
906 | error = mem_cgroup_charge(folio, NULL, gfp); |
907 | VM_BUG_ON_FOLIO(index & (folio_nr_pages(folio) - 1), folio); | |
3fea5a49 JW |
908 | if (error) |
909 | goto error; | |
da74240e | 910 | charged = true; |
3fea5a49 JW |
911 | } |
912 | ||
198b62f8 MWO |
913 | gfp &= GFP_RECLAIM_MASK; |
914 | ||
74d60958 | 915 | do { |
198b62f8 MWO |
916 | unsigned int order = xa_get_order(xas.xa, xas.xa_index); |
917 | void *entry, *old = NULL; | |
918 | ||
9dd3d069 | 919 | if (order > folio_order(folio)) |
198b62f8 MWO |
920 | xas_split_alloc(&xas, xa_load(xas.xa, xas.xa_index), |
921 | order, gfp); | |
74d60958 | 922 | xas_lock_irq(&xas); |
198b62f8 MWO |
923 | xas_for_each_conflict(&xas, entry) { |
924 | old = entry; | |
925 | if (!xa_is_value(entry)) { | |
926 | xas_set_err(&xas, -EEXIST); | |
927 | goto unlock; | |
928 | } | |
929 | } | |
930 | ||
931 | if (old) { | |
932 | if (shadowp) | |
933 | *shadowp = old; | |
934 | /* entry may have been split before we acquired lock */ | |
935 | order = xa_get_order(xas.xa, xas.xa_index); | |
9dd3d069 | 936 | if (order > folio_order(folio)) { |
198b62f8 MWO |
937 | xas_split(&xas, old, order); |
938 | xas_reset(&xas); | |
939 | } | |
940 | } | |
941 | ||
9dd3d069 | 942 | xas_store(&xas, folio); |
74d60958 MW |
943 | if (xas_error(&xas)) |
944 | goto unlock; | |
945 | ||
74d60958 MW |
946 | mapping->nrpages++; |
947 | ||
948 | /* hugetlb pages do not participate in page cache accounting */ | |
949 | if (!huge) | |
9dd3d069 | 950 | __lruvec_stat_add_folio(folio, NR_FILE_PAGES); |
74d60958 MW |
951 | unlock: |
952 | xas_unlock_irq(&xas); | |
198b62f8 | 953 | } while (xas_nomem(&xas, gfp)); |
74d60958 | 954 | |
3fea5a49 JW |
955 | if (xas_error(&xas)) { |
956 | error = xas_error(&xas); | |
da74240e | 957 | if (charged) |
9dd3d069 | 958 | mem_cgroup_uncharge(folio); |
74d60958 | 959 | goto error; |
3fea5a49 | 960 | } |
4165b9b4 | 961 | |
9dd3d069 | 962 | trace_mm_filemap_add_to_page_cache(&folio->page); |
66a0c8ee | 963 | return 0; |
74d60958 | 964 | error: |
9dd3d069 | 965 | folio->mapping = NULL; |
66a0c8ee | 966 | /* Leave page->index set: truncation relies upon it */ |
9dd3d069 | 967 | folio_put(folio); |
3fea5a49 | 968 | return error; |
1da177e4 | 969 | } |
9dd3d069 | 970 | ALLOW_ERROR_INJECTION(__filemap_add_folio, ERRNO); |
a528910e JW |
971 | |
972 | /** | |
973 | * add_to_page_cache_locked - add a locked page to the pagecache | |
974 | * @page: page to add | |
975 | * @mapping: the page's address_space | |
976 | * @offset: page index | |
977 | * @gfp_mask: page allocation mode | |
978 | * | |
979 | * This function is used to add a page to the pagecache. It must be locked. | |
980 | * This function does not add the page to the LRU. The caller must do that. | |
a862f68a MR |
981 | * |
982 | * Return: %0 on success, negative error code otherwise. | |
a528910e JW |
983 | */ |
984 | int add_to_page_cache_locked(struct page *page, struct address_space *mapping, | |
985 | pgoff_t offset, gfp_t gfp_mask) | |
986 | { | |
9dd3d069 | 987 | return __filemap_add_folio(mapping, page_folio(page), offset, |
a528910e JW |
988 | gfp_mask, NULL); |
989 | } | |
e286781d | 990 | EXPORT_SYMBOL(add_to_page_cache_locked); |
1da177e4 | 991 | |
9dd3d069 MWO |
992 | int filemap_add_folio(struct address_space *mapping, struct folio *folio, |
993 | pgoff_t index, gfp_t gfp) | |
1da177e4 | 994 | { |
a528910e | 995 | void *shadow = NULL; |
4f98a2fe RR |
996 | int ret; |
997 | ||
9dd3d069 MWO |
998 | __folio_set_locked(folio); |
999 | ret = __filemap_add_folio(mapping, folio, index, gfp, &shadow); | |
a528910e | 1000 | if (unlikely(ret)) |
9dd3d069 | 1001 | __folio_clear_locked(folio); |
a528910e JW |
1002 | else { |
1003 | /* | |
9dd3d069 | 1004 | * The folio might have been evicted from cache only |
a528910e | 1005 | * recently, in which case it should be activated like |
9dd3d069 MWO |
1006 | * any other repeatedly accessed folio. |
1007 | * The exception is folios getting rewritten; evicting other | |
f0281a00 RR |
1008 | * data from the working set, only to cache data that will |
1009 | * get overwritten with something else, is a waste of memory. | |
a528910e | 1010 | */ |
9dd3d069 MWO |
1011 | WARN_ON_ONCE(folio_test_active(folio)); |
1012 | if (!(gfp & __GFP_WRITE) && shadow) | |
1013 | workingset_refault(folio, shadow); | |
1014 | folio_add_lru(folio); | |
a528910e | 1015 | } |
1da177e4 LT |
1016 | return ret; |
1017 | } | |
9dd3d069 | 1018 | EXPORT_SYMBOL_GPL(filemap_add_folio); |
1da177e4 | 1019 | |
44110fe3 | 1020 | #ifdef CONFIG_NUMA |
bb3c579e | 1021 | struct folio *filemap_alloc_folio(gfp_t gfp, unsigned int order) |
44110fe3 | 1022 | { |
c0ff7453 | 1023 | int n; |
bb3c579e | 1024 | struct folio *folio; |
c0ff7453 | 1025 | |
44110fe3 | 1026 | if (cpuset_do_page_mem_spread()) { |
cc9a6c87 MG |
1027 | unsigned int cpuset_mems_cookie; |
1028 | do { | |
d26914d1 | 1029 | cpuset_mems_cookie = read_mems_allowed_begin(); |
cc9a6c87 | 1030 | n = cpuset_mem_spread_node(); |
bb3c579e MWO |
1031 | folio = __folio_alloc_node(gfp, order, n); |
1032 | } while (!folio && read_mems_allowed_retry(cpuset_mems_cookie)); | |
cc9a6c87 | 1033 | |
bb3c579e | 1034 | return folio; |
44110fe3 | 1035 | } |
bb3c579e | 1036 | return folio_alloc(gfp, order); |
44110fe3 | 1037 | } |
bb3c579e | 1038 | EXPORT_SYMBOL(filemap_alloc_folio); |
44110fe3 PJ |
1039 | #endif |
1040 | ||
7506ae6a JK |
1041 | /* |
1042 | * filemap_invalidate_lock_two - lock invalidate_lock for two mappings | |
1043 | * | |
1044 | * Lock exclusively invalidate_lock of any passed mapping that is not NULL. | |
1045 | * | |
1046 | * @mapping1: the first mapping to lock | |
1047 | * @mapping2: the second mapping to lock | |
1048 | */ | |
1049 | void filemap_invalidate_lock_two(struct address_space *mapping1, | |
1050 | struct address_space *mapping2) | |
1051 | { | |
1052 | if (mapping1 > mapping2) | |
1053 | swap(mapping1, mapping2); | |
1054 | if (mapping1) | |
1055 | down_write(&mapping1->invalidate_lock); | |
1056 | if (mapping2 && mapping1 != mapping2) | |
1057 | down_write_nested(&mapping2->invalidate_lock, 1); | |
1058 | } | |
1059 | EXPORT_SYMBOL(filemap_invalidate_lock_two); | |
1060 | ||
1061 | /* | |
1062 | * filemap_invalidate_unlock_two - unlock invalidate_lock for two mappings | |
1063 | * | |
1064 | * Unlock exclusive invalidate_lock of any passed mapping that is not NULL. | |
1065 | * | |
1066 | * @mapping1: the first mapping to unlock | |
1067 | * @mapping2: the second mapping to unlock | |
1068 | */ | |
1069 | void filemap_invalidate_unlock_two(struct address_space *mapping1, | |
1070 | struct address_space *mapping2) | |
1071 | { | |
1072 | if (mapping1) | |
1073 | up_write(&mapping1->invalidate_lock); | |
1074 | if (mapping2 && mapping1 != mapping2) | |
1075 | up_write(&mapping2->invalidate_lock); | |
1076 | } | |
1077 | EXPORT_SYMBOL(filemap_invalidate_unlock_two); | |
1078 | ||
1da177e4 LT |
1079 | /* |
1080 | * In order to wait for pages to become available there must be | |
1081 | * waitqueues associated with pages. By using a hash table of | |
1082 | * waitqueues where the bucket discipline is to maintain all | |
1083 | * waiters on the same queue and wake all when any of the pages | |
1084 | * become available, and for the woken contexts to check to be | |
1085 | * sure the appropriate page became available, this saves space | |
1086 | * at a cost of "thundering herd" phenomena during rare hash | |
1087 | * collisions. | |
1088 | */ | |
62906027 NP |
1089 | #define PAGE_WAIT_TABLE_BITS 8 |
1090 | #define PAGE_WAIT_TABLE_SIZE (1 << PAGE_WAIT_TABLE_BITS) | |
df4d4f12 | 1091 | static wait_queue_head_t folio_wait_table[PAGE_WAIT_TABLE_SIZE] __cacheline_aligned; |
62906027 | 1092 | |
df4d4f12 | 1093 | static wait_queue_head_t *folio_waitqueue(struct folio *folio) |
1da177e4 | 1094 | { |
df4d4f12 | 1095 | return &folio_wait_table[hash_ptr(folio, PAGE_WAIT_TABLE_BITS)]; |
1da177e4 | 1096 | } |
1da177e4 | 1097 | |
62906027 | 1098 | void __init pagecache_init(void) |
1da177e4 | 1099 | { |
62906027 | 1100 | int i; |
1da177e4 | 1101 | |
62906027 | 1102 | for (i = 0; i < PAGE_WAIT_TABLE_SIZE; i++) |
df4d4f12 | 1103 | init_waitqueue_head(&folio_wait_table[i]); |
62906027 NP |
1104 | |
1105 | page_writeback_init(); | |
1da177e4 | 1106 | } |
1da177e4 | 1107 | |
5ef64cc8 LT |
1108 | /* |
1109 | * The page wait code treats the "wait->flags" somewhat unusually, because | |
5868ec26 | 1110 | * we have multiple different kinds of waits, not just the usual "exclusive" |
5ef64cc8 LT |
1111 | * one. |
1112 | * | |
1113 | * We have: | |
1114 | * | |
1115 | * (a) no special bits set: | |
1116 | * | |
1117 | * We're just waiting for the bit to be released, and when a waker | |
1118 | * calls the wakeup function, we set WQ_FLAG_WOKEN and wake it up, | |
1119 | * and remove it from the wait queue. | |
1120 | * | |
1121 | * Simple and straightforward. | |
1122 | * | |
1123 | * (b) WQ_FLAG_EXCLUSIVE: | |
1124 | * | |
1125 | * The waiter is waiting to get the lock, and only one waiter should | |
1126 | * be woken up to avoid any thundering herd behavior. We'll set the | |
1127 | * WQ_FLAG_WOKEN bit, wake it up, and remove it from the wait queue. | |
1128 | * | |
1129 | * This is the traditional exclusive wait. | |
1130 | * | |
5868ec26 | 1131 | * (c) WQ_FLAG_EXCLUSIVE | WQ_FLAG_CUSTOM: |
5ef64cc8 LT |
1132 | * |
1133 | * The waiter is waiting to get the bit, and additionally wants the | |
1134 | * lock to be transferred to it for fair lock behavior. If the lock | |
1135 | * cannot be taken, we stop walking the wait queue without waking | |
1136 | * the waiter. | |
1137 | * | |
1138 | * This is the "fair lock handoff" case, and in addition to setting | |
1139 | * WQ_FLAG_WOKEN, we set WQ_FLAG_DONE to let the waiter easily see | |
1140 | * that it now has the lock. | |
1141 | */ | |
ac6424b9 | 1142 | static int wake_page_function(wait_queue_entry_t *wait, unsigned mode, int sync, void *arg) |
f62e00cc | 1143 | { |
5ef64cc8 | 1144 | unsigned int flags; |
62906027 NP |
1145 | struct wait_page_key *key = arg; |
1146 | struct wait_page_queue *wait_page | |
1147 | = container_of(wait, struct wait_page_queue, wait); | |
1148 | ||
cdc8fcb4 | 1149 | if (!wake_page_match(wait_page, key)) |
62906027 | 1150 | return 0; |
3510ca20 | 1151 | |
9a1ea439 | 1152 | /* |
5ef64cc8 LT |
1153 | * If it's a lock handoff wait, we get the bit for it, and |
1154 | * stop walking (and do not wake it up) if we can't. | |
9a1ea439 | 1155 | */ |
5ef64cc8 LT |
1156 | flags = wait->flags; |
1157 | if (flags & WQ_FLAG_EXCLUSIVE) { | |
df4d4f12 | 1158 | if (test_bit(key->bit_nr, &key->folio->flags)) |
2a9127fc | 1159 | return -1; |
5ef64cc8 | 1160 | if (flags & WQ_FLAG_CUSTOM) { |
df4d4f12 | 1161 | if (test_and_set_bit(key->bit_nr, &key->folio->flags)) |
5ef64cc8 LT |
1162 | return -1; |
1163 | flags |= WQ_FLAG_DONE; | |
1164 | } | |
2a9127fc | 1165 | } |
f62e00cc | 1166 | |
5ef64cc8 LT |
1167 | /* |
1168 | * We are holding the wait-queue lock, but the waiter that | |
1169 | * is waiting for this will be checking the flags without | |
1170 | * any locking. | |
1171 | * | |
1172 | * So update the flags atomically, and wake up the waiter | |
1173 | * afterwards to avoid any races. This store-release pairs | |
101c0bf6 | 1174 | * with the load-acquire in folio_wait_bit_common(). |
5ef64cc8 LT |
1175 | */ |
1176 | smp_store_release(&wait->flags, flags | WQ_FLAG_WOKEN); | |
2a9127fc LT |
1177 | wake_up_state(wait->private, mode); |
1178 | ||
1179 | /* | |
1180 | * Ok, we have successfully done what we're waiting for, | |
1181 | * and we can unconditionally remove the wait entry. | |
1182 | * | |
5ef64cc8 LT |
1183 | * Note that this pairs with the "finish_wait()" in the |
1184 | * waiter, and has to be the absolute last thing we do. | |
1185 | * After this list_del_init(&wait->entry) the wait entry | |
2a9127fc LT |
1186 | * might be de-allocated and the process might even have |
1187 | * exited. | |
2a9127fc | 1188 | */ |
c6fe44d9 | 1189 | list_del_init_careful(&wait->entry); |
5ef64cc8 | 1190 | return (flags & WQ_FLAG_EXCLUSIVE) != 0; |
f62e00cc KM |
1191 | } |
1192 | ||
6974d7c9 | 1193 | static void folio_wake_bit(struct folio *folio, int bit_nr) |
cbbce822 | 1194 | { |
df4d4f12 | 1195 | wait_queue_head_t *q = folio_waitqueue(folio); |
62906027 NP |
1196 | struct wait_page_key key; |
1197 | unsigned long flags; | |
11a19c7b | 1198 | wait_queue_entry_t bookmark; |
cbbce822 | 1199 | |
df4d4f12 | 1200 | key.folio = folio; |
62906027 NP |
1201 | key.bit_nr = bit_nr; |
1202 | key.page_match = 0; | |
1203 | ||
11a19c7b TC |
1204 | bookmark.flags = 0; |
1205 | bookmark.private = NULL; | |
1206 | bookmark.func = NULL; | |
1207 | INIT_LIST_HEAD(&bookmark.entry); | |
1208 | ||
62906027 | 1209 | spin_lock_irqsave(&q->lock, flags); |
11a19c7b TC |
1210 | __wake_up_locked_key_bookmark(q, TASK_NORMAL, &key, &bookmark); |
1211 | ||
1212 | while (bookmark.flags & WQ_FLAG_BOOKMARK) { | |
1213 | /* | |
1214 | * Take a breather from holding the lock, | |
1215 | * allow pages that finish wake up asynchronously | |
1216 | * to acquire the lock and remove themselves | |
1217 | * from wait queue | |
1218 | */ | |
1219 | spin_unlock_irqrestore(&q->lock, flags); | |
1220 | cpu_relax(); | |
1221 | spin_lock_irqsave(&q->lock, flags); | |
1222 | __wake_up_locked_key_bookmark(q, TASK_NORMAL, &key, &bookmark); | |
1223 | } | |
1224 | ||
62906027 NP |
1225 | /* |
1226 | * It is possible for other pages to have collided on the waitqueue | |
1227 | * hash, so in that case check for a page match. That prevents a long- | |
1228 | * term waiter | |
1229 | * | |
1230 | * It is still possible to miss a case here, when we woke page waiters | |
1231 | * and removed them from the waitqueue, but there are still other | |
1232 | * page waiters. | |
1233 | */ | |
1234 | if (!waitqueue_active(q) || !key.page_match) { | |
6974d7c9 | 1235 | folio_clear_waiters(folio); |
62906027 NP |
1236 | /* |
1237 | * It's possible to miss clearing Waiters here, when we woke | |
1238 | * our page waiters, but the hashed waitqueue has waiters for | |
1239 | * other pages on it. | |
1240 | * | |
1241 | * That's okay, it's a rare case. The next waker will clear it. | |
1242 | */ | |
1243 | } | |
1244 | spin_unlock_irqrestore(&q->lock, flags); | |
1245 | } | |
74d81bfa | 1246 | |
4268b480 | 1247 | static void folio_wake(struct folio *folio, int bit) |
74d81bfa | 1248 | { |
4268b480 | 1249 | if (!folio_test_waiters(folio)) |
74d81bfa | 1250 | return; |
6974d7c9 | 1251 | folio_wake_bit(folio, bit); |
74d81bfa | 1252 | } |
62906027 | 1253 | |
9a1ea439 | 1254 | /* |
101c0bf6 | 1255 | * A choice of three behaviors for folio_wait_bit_common(): |
9a1ea439 HD |
1256 | */ |
1257 | enum behavior { | |
1258 | EXCLUSIVE, /* Hold ref to page and take the bit when woken, like | |
7c23c782 | 1259 | * __folio_lock() waiting on then setting PG_locked. |
9a1ea439 HD |
1260 | */ |
1261 | SHARED, /* Hold ref to page and check the bit when woken, like | |
1262 | * wait_on_page_writeback() waiting on PG_writeback. | |
1263 | */ | |
1264 | DROP, /* Drop ref to page before wait, no check when woken, | |
1265 | * like put_and_wait_on_page_locked() on PG_locked. | |
1266 | */ | |
1267 | }; | |
1268 | ||
2a9127fc | 1269 | /* |
101c0bf6 | 1270 | * Attempt to check (or get) the folio flag, and mark us done |
5ef64cc8 | 1271 | * if successful. |
2a9127fc | 1272 | */ |
101c0bf6 | 1273 | static inline bool folio_trylock_flag(struct folio *folio, int bit_nr, |
2a9127fc LT |
1274 | struct wait_queue_entry *wait) |
1275 | { | |
1276 | if (wait->flags & WQ_FLAG_EXCLUSIVE) { | |
101c0bf6 | 1277 | if (test_and_set_bit(bit_nr, &folio->flags)) |
2a9127fc | 1278 | return false; |
101c0bf6 | 1279 | } else if (test_bit(bit_nr, &folio->flags)) |
2a9127fc LT |
1280 | return false; |
1281 | ||
5ef64cc8 | 1282 | wait->flags |= WQ_FLAG_WOKEN | WQ_FLAG_DONE; |
2a9127fc LT |
1283 | return true; |
1284 | } | |
1285 | ||
5ef64cc8 LT |
1286 | /* How many times do we accept lock stealing from under a waiter? */ |
1287 | int sysctl_page_lock_unfairness = 5; | |
1288 | ||
101c0bf6 MWO |
1289 | static inline int folio_wait_bit_common(struct folio *folio, int bit_nr, |
1290 | int state, enum behavior behavior) | |
62906027 | 1291 | { |
df4d4f12 | 1292 | wait_queue_head_t *q = folio_waitqueue(folio); |
5ef64cc8 | 1293 | int unfairness = sysctl_page_lock_unfairness; |
62906027 | 1294 | struct wait_page_queue wait_page; |
ac6424b9 | 1295 | wait_queue_entry_t *wait = &wait_page.wait; |
b1d29ba8 | 1296 | bool thrashing = false; |
9a1ea439 | 1297 | bool delayacct = false; |
eb414681 | 1298 | unsigned long pflags; |
62906027 | 1299 | |
eb414681 | 1300 | if (bit_nr == PG_locked && |
101c0bf6 MWO |
1301 | !folio_test_uptodate(folio) && folio_test_workingset(folio)) { |
1302 | if (!folio_test_swapbacked(folio)) { | |
eb414681 | 1303 | delayacct_thrashing_start(); |
9a1ea439 HD |
1304 | delayacct = true; |
1305 | } | |
eb414681 | 1306 | psi_memstall_enter(&pflags); |
b1d29ba8 JW |
1307 | thrashing = true; |
1308 | } | |
1309 | ||
62906027 NP |
1310 | init_wait(wait); |
1311 | wait->func = wake_page_function; | |
df4d4f12 | 1312 | wait_page.folio = folio; |
62906027 NP |
1313 | wait_page.bit_nr = bit_nr; |
1314 | ||
5ef64cc8 LT |
1315 | repeat: |
1316 | wait->flags = 0; | |
1317 | if (behavior == EXCLUSIVE) { | |
1318 | wait->flags = WQ_FLAG_EXCLUSIVE; | |
1319 | if (--unfairness < 0) | |
1320 | wait->flags |= WQ_FLAG_CUSTOM; | |
1321 | } | |
1322 | ||
2a9127fc LT |
1323 | /* |
1324 | * Do one last check whether we can get the | |
1325 | * page bit synchronously. | |
1326 | * | |
101c0bf6 | 1327 | * Do the folio_set_waiters() marking before that |
2a9127fc LT |
1328 | * to let any waker we _just_ missed know they |
1329 | * need to wake us up (otherwise they'll never | |
1330 | * even go to the slow case that looks at the | |
1331 | * page queue), and add ourselves to the wait | |
1332 | * queue if we need to sleep. | |
1333 | * | |
1334 | * This part needs to be done under the queue | |
1335 | * lock to avoid races. | |
1336 | */ | |
1337 | spin_lock_irq(&q->lock); | |
101c0bf6 MWO |
1338 | folio_set_waiters(folio); |
1339 | if (!folio_trylock_flag(folio, bit_nr, wait)) | |
2a9127fc LT |
1340 | __add_wait_queue_entry_tail(q, wait); |
1341 | spin_unlock_irq(&q->lock); | |
62906027 | 1342 | |
2a9127fc LT |
1343 | /* |
1344 | * From now on, all the logic will be based on | |
5ef64cc8 LT |
1345 | * the WQ_FLAG_WOKEN and WQ_FLAG_DONE flag, to |
1346 | * see whether the page bit testing has already | |
1347 | * been done by the wake function. | |
2a9127fc | 1348 | * |
101c0bf6 | 1349 | * We can drop our reference to the folio. |
2a9127fc LT |
1350 | */ |
1351 | if (behavior == DROP) | |
101c0bf6 | 1352 | folio_put(folio); |
62906027 | 1353 | |
5ef64cc8 LT |
1354 | /* |
1355 | * Note that until the "finish_wait()", or until | |
1356 | * we see the WQ_FLAG_WOKEN flag, we need to | |
1357 | * be very careful with the 'wait->flags', because | |
1358 | * we may race with a waker that sets them. | |
1359 | */ | |
2a9127fc | 1360 | for (;;) { |
5ef64cc8 LT |
1361 | unsigned int flags; |
1362 | ||
62906027 NP |
1363 | set_current_state(state); |
1364 | ||
5ef64cc8 LT |
1365 | /* Loop until we've been woken or interrupted */ |
1366 | flags = smp_load_acquire(&wait->flags); | |
1367 | if (!(flags & WQ_FLAG_WOKEN)) { | |
1368 | if (signal_pending_state(state, current)) | |
1369 | break; | |
1370 | ||
1371 | io_schedule(); | |
1372 | continue; | |
1373 | } | |
1374 | ||
1375 | /* If we were non-exclusive, we're done */ | |
1376 | if (behavior != EXCLUSIVE) | |
a8b169af | 1377 | break; |
9a1ea439 | 1378 | |
5ef64cc8 LT |
1379 | /* If the waker got the lock for us, we're done */ |
1380 | if (flags & WQ_FLAG_DONE) | |
9a1ea439 | 1381 | break; |
2a9127fc | 1382 | |
5ef64cc8 LT |
1383 | /* |
1384 | * Otherwise, if we're getting the lock, we need to | |
1385 | * try to get it ourselves. | |
1386 | * | |
1387 | * And if that fails, we'll have to retry this all. | |
1388 | */ | |
101c0bf6 | 1389 | if (unlikely(test_and_set_bit(bit_nr, folio_flags(folio, 0)))) |
5ef64cc8 LT |
1390 | goto repeat; |
1391 | ||
1392 | wait->flags |= WQ_FLAG_DONE; | |
1393 | break; | |
62906027 NP |
1394 | } |
1395 | ||
5ef64cc8 LT |
1396 | /* |
1397 | * If a signal happened, this 'finish_wait()' may remove the last | |
101c0bf6 | 1398 | * waiter from the wait-queues, but the folio waiters bit will remain |
5ef64cc8 LT |
1399 | * set. That's ok. The next wakeup will take care of it, and trying |
1400 | * to do it here would be difficult and prone to races. | |
1401 | */ | |
62906027 NP |
1402 | finish_wait(q, wait); |
1403 | ||
eb414681 | 1404 | if (thrashing) { |
9a1ea439 | 1405 | if (delayacct) |
eb414681 JW |
1406 | delayacct_thrashing_end(); |
1407 | psi_memstall_leave(&pflags); | |
1408 | } | |
b1d29ba8 | 1409 | |
62906027 | 1410 | /* |
5ef64cc8 LT |
1411 | * NOTE! The wait->flags weren't stable until we've done the |
1412 | * 'finish_wait()', and we could have exited the loop above due | |
1413 | * to a signal, and had a wakeup event happen after the signal | |
1414 | * test but before the 'finish_wait()'. | |
1415 | * | |
1416 | * So only after the finish_wait() can we reliably determine | |
1417 | * if we got woken up or not, so we can now figure out the final | |
1418 | * return value based on that state without races. | |
1419 | * | |
1420 | * Also note that WQ_FLAG_WOKEN is sufficient for a non-exclusive | |
1421 | * waiter, but an exclusive one requires WQ_FLAG_DONE. | |
62906027 | 1422 | */ |
5ef64cc8 LT |
1423 | if (behavior == EXCLUSIVE) |
1424 | return wait->flags & WQ_FLAG_DONE ? 0 : -EINTR; | |
62906027 | 1425 | |
2a9127fc | 1426 | return wait->flags & WQ_FLAG_WOKEN ? 0 : -EINTR; |
62906027 NP |
1427 | } |
1428 | ||
101c0bf6 | 1429 | void folio_wait_bit(struct folio *folio, int bit_nr) |
62906027 | 1430 | { |
101c0bf6 | 1431 | folio_wait_bit_common(folio, bit_nr, TASK_UNINTERRUPTIBLE, SHARED); |
62906027 | 1432 | } |
101c0bf6 | 1433 | EXPORT_SYMBOL(folio_wait_bit); |
62906027 | 1434 | |
101c0bf6 | 1435 | int folio_wait_bit_killable(struct folio *folio, int bit_nr) |
62906027 | 1436 | { |
101c0bf6 | 1437 | return folio_wait_bit_common(folio, bit_nr, TASK_KILLABLE, SHARED); |
cbbce822 | 1438 | } |
101c0bf6 | 1439 | EXPORT_SYMBOL(folio_wait_bit_killable); |
cbbce822 | 1440 | |
9a1ea439 HD |
1441 | /** |
1442 | * put_and_wait_on_page_locked - Drop a reference and wait for it to be unlocked | |
1443 | * @page: The page to wait for. | |
48054625 | 1444 | * @state: The sleep state (TASK_KILLABLE, TASK_UNINTERRUPTIBLE, etc). |
9a1ea439 HD |
1445 | * |
1446 | * The caller should hold a reference on @page. They expect the page to | |
1447 | * become unlocked relatively soon, but do not wish to hold up migration | |
1448 | * (for example) by holding the reference while waiting for the page to | |
1449 | * come unlocked. After this function returns, the caller should not | |
1450 | * dereference @page. | |
48054625 MWO |
1451 | * |
1452 | * Return: 0 if the page was unlocked or -EINTR if interrupted by a signal. | |
9a1ea439 | 1453 | */ |
48054625 | 1454 | int put_and_wait_on_page_locked(struct page *page, int state) |
9a1ea439 | 1455 | { |
101c0bf6 MWO |
1456 | return folio_wait_bit_common(page_folio(page), PG_locked, state, |
1457 | DROP); | |
9a1ea439 HD |
1458 | } |
1459 | ||
385e1ca5 | 1460 | /** |
df4d4f12 MWO |
1461 | * folio_add_wait_queue - Add an arbitrary waiter to a folio's wait queue |
1462 | * @folio: Folio defining the wait queue of interest | |
697f619f | 1463 | * @waiter: Waiter to add to the queue |
385e1ca5 | 1464 | * |
df4d4f12 | 1465 | * Add an arbitrary @waiter to the wait queue for the nominated @folio. |
385e1ca5 | 1466 | */ |
df4d4f12 | 1467 | void folio_add_wait_queue(struct folio *folio, wait_queue_entry_t *waiter) |
385e1ca5 | 1468 | { |
df4d4f12 | 1469 | wait_queue_head_t *q = folio_waitqueue(folio); |
385e1ca5 DH |
1470 | unsigned long flags; |
1471 | ||
1472 | spin_lock_irqsave(&q->lock, flags); | |
9c3a815f | 1473 | __add_wait_queue_entry_tail(q, waiter); |
df4d4f12 | 1474 | folio_set_waiters(folio); |
385e1ca5 DH |
1475 | spin_unlock_irqrestore(&q->lock, flags); |
1476 | } | |
df4d4f12 | 1477 | EXPORT_SYMBOL_GPL(folio_add_wait_queue); |
385e1ca5 | 1478 | |
b91e1302 LT |
1479 | #ifndef clear_bit_unlock_is_negative_byte |
1480 | ||
1481 | /* | |
1482 | * PG_waiters is the high bit in the same byte as PG_lock. | |
1483 | * | |
1484 | * On x86 (and on many other architectures), we can clear PG_lock and | |
1485 | * test the sign bit at the same time. But if the architecture does | |
1486 | * not support that special operation, we just do this all by hand | |
1487 | * instead. | |
1488 | * | |
1489 | * The read of PG_waiters has to be after (or concurrently with) PG_locked | |
ffceeb62 | 1490 | * being cleared, but a memory barrier should be unnecessary since it is |
b91e1302 LT |
1491 | * in the same byte as PG_locked. |
1492 | */ | |
1493 | static inline bool clear_bit_unlock_is_negative_byte(long nr, volatile void *mem) | |
1494 | { | |
1495 | clear_bit_unlock(nr, mem); | |
1496 | /* smp_mb__after_atomic(); */ | |
98473f9f | 1497 | return test_bit(PG_waiters, mem); |
b91e1302 LT |
1498 | } |
1499 | ||
1500 | #endif | |
1501 | ||
1da177e4 | 1502 | /** |
4e136428 MWO |
1503 | * folio_unlock - Unlock a locked folio. |
1504 | * @folio: The folio. | |
1505 | * | |
1506 | * Unlocks the folio and wakes up any thread sleeping on the page lock. | |
1507 | * | |
1508 | * Context: May be called from interrupt or process context. May not be | |
1509 | * called from NMI context. | |
1da177e4 | 1510 | */ |
4e136428 | 1511 | void folio_unlock(struct folio *folio) |
1da177e4 | 1512 | { |
4e136428 | 1513 | /* Bit 7 allows x86 to check the byte's sign bit */ |
b91e1302 | 1514 | BUILD_BUG_ON(PG_waiters != 7); |
4e136428 MWO |
1515 | BUILD_BUG_ON(PG_locked > 7); |
1516 | VM_BUG_ON_FOLIO(!folio_test_locked(folio), folio); | |
1517 | if (clear_bit_unlock_is_negative_byte(PG_locked, folio_flags(folio, 0))) | |
6974d7c9 | 1518 | folio_wake_bit(folio, PG_locked); |
1da177e4 | 1519 | } |
4e136428 | 1520 | EXPORT_SYMBOL(folio_unlock); |
1da177e4 | 1521 | |
73e10ded | 1522 | /** |
b47393f8 MWO |
1523 | * folio_end_private_2 - Clear PG_private_2 and wake any waiters. |
1524 | * @folio: The folio. | |
73e10ded | 1525 | * |
b47393f8 MWO |
1526 | * Clear the PG_private_2 bit on a folio and wake up any sleepers waiting for |
1527 | * it. The folio reference held for PG_private_2 being set is released. | |
73e10ded | 1528 | * |
b47393f8 MWO |
1529 | * This is, for example, used when a netfs folio is being written to a local |
1530 | * disk cache, thereby allowing writes to the cache for the same folio to be | |
73e10ded DH |
1531 | * serialised. |
1532 | */ | |
b47393f8 | 1533 | void folio_end_private_2(struct folio *folio) |
73e10ded | 1534 | { |
6974d7c9 MWO |
1535 | VM_BUG_ON_FOLIO(!folio_test_private_2(folio), folio); |
1536 | clear_bit_unlock(PG_private_2, folio_flags(folio, 0)); | |
1537 | folio_wake_bit(folio, PG_private_2); | |
1538 | folio_put(folio); | |
73e10ded | 1539 | } |
b47393f8 | 1540 | EXPORT_SYMBOL(folio_end_private_2); |
73e10ded DH |
1541 | |
1542 | /** | |
b47393f8 MWO |
1543 | * folio_wait_private_2 - Wait for PG_private_2 to be cleared on a folio. |
1544 | * @folio: The folio to wait on. | |
73e10ded | 1545 | * |
b47393f8 | 1546 | * Wait for PG_private_2 (aka PG_fscache) to be cleared on a folio. |
73e10ded | 1547 | */ |
b47393f8 | 1548 | void folio_wait_private_2(struct folio *folio) |
73e10ded | 1549 | { |
101c0bf6 MWO |
1550 | while (folio_test_private_2(folio)) |
1551 | folio_wait_bit(folio, PG_private_2); | |
73e10ded | 1552 | } |
b47393f8 | 1553 | EXPORT_SYMBOL(folio_wait_private_2); |
73e10ded DH |
1554 | |
1555 | /** | |
b47393f8 MWO |
1556 | * folio_wait_private_2_killable - Wait for PG_private_2 to be cleared on a folio. |
1557 | * @folio: The folio to wait on. | |
73e10ded | 1558 | * |
b47393f8 | 1559 | * Wait for PG_private_2 (aka PG_fscache) to be cleared on a folio or until a |
73e10ded DH |
1560 | * fatal signal is received by the calling task. |
1561 | * | |
1562 | * Return: | |
1563 | * - 0 if successful. | |
1564 | * - -EINTR if a fatal signal was encountered. | |
1565 | */ | |
b47393f8 | 1566 | int folio_wait_private_2_killable(struct folio *folio) |
73e10ded DH |
1567 | { |
1568 | int ret = 0; | |
1569 | ||
101c0bf6 MWO |
1570 | while (folio_test_private_2(folio)) { |
1571 | ret = folio_wait_bit_killable(folio, PG_private_2); | |
73e10ded DH |
1572 | if (ret < 0) |
1573 | break; | |
1574 | } | |
1575 | ||
1576 | return ret; | |
1577 | } | |
b47393f8 | 1578 | EXPORT_SYMBOL(folio_wait_private_2_killable); |
73e10ded | 1579 | |
485bb99b | 1580 | /** |
4268b480 MWO |
1581 | * folio_end_writeback - End writeback against a folio. |
1582 | * @folio: The folio. | |
1da177e4 | 1583 | */ |
4268b480 | 1584 | void folio_end_writeback(struct folio *folio) |
1da177e4 | 1585 | { |
888cf2db | 1586 | /* |
4268b480 MWO |
1587 | * folio_test_clear_reclaim() could be used here but it is an |
1588 | * atomic operation and overkill in this particular case. Failing | |
1589 | * to shuffle a folio marked for immediate reclaim is too mild | |
1590 | * a gain to justify taking an atomic operation penalty at the | |
1591 | * end of every folio writeback. | |
888cf2db | 1592 | */ |
4268b480 MWO |
1593 | if (folio_test_reclaim(folio)) { |
1594 | folio_clear_reclaim(folio); | |
575ced1c | 1595 | folio_rotate_reclaimable(folio); |
888cf2db | 1596 | } |
ac6aadb2 | 1597 | |
073861ed | 1598 | /* |
4268b480 | 1599 | * Writeback does not hold a folio reference of its own, relying |
073861ed | 1600 | * on truncation to wait for the clearing of PG_writeback. |
4268b480 MWO |
1601 | * But here we must make sure that the folio is not freed and |
1602 | * reused before the folio_wake(). | |
073861ed | 1603 | */ |
4268b480 | 1604 | folio_get(folio); |
269ccca3 | 1605 | if (!__folio_end_writeback(folio)) |
ac6aadb2 MS |
1606 | BUG(); |
1607 | ||
4e857c58 | 1608 | smp_mb__after_atomic(); |
4268b480 | 1609 | folio_wake(folio, PG_writeback); |
512b7931 | 1610 | acct_reclaim_writeback(folio); |
4268b480 | 1611 | folio_put(folio); |
1da177e4 | 1612 | } |
4268b480 | 1613 | EXPORT_SYMBOL(folio_end_writeback); |
1da177e4 | 1614 | |
57d99845 MW |
1615 | /* |
1616 | * After completing I/O on a page, call this routine to update the page | |
1617 | * flags appropriately | |
1618 | */ | |
c11f0c0b | 1619 | void page_endio(struct page *page, bool is_write, int err) |
57d99845 | 1620 | { |
c11f0c0b | 1621 | if (!is_write) { |
57d99845 MW |
1622 | if (!err) { |
1623 | SetPageUptodate(page); | |
1624 | } else { | |
1625 | ClearPageUptodate(page); | |
1626 | SetPageError(page); | |
1627 | } | |
1628 | unlock_page(page); | |
abf54548 | 1629 | } else { |
57d99845 | 1630 | if (err) { |
dd8416c4 MK |
1631 | struct address_space *mapping; |
1632 | ||
57d99845 | 1633 | SetPageError(page); |
dd8416c4 MK |
1634 | mapping = page_mapping(page); |
1635 | if (mapping) | |
1636 | mapping_set_error(mapping, err); | |
57d99845 MW |
1637 | } |
1638 | end_page_writeback(page); | |
1639 | } | |
1640 | } | |
1641 | EXPORT_SYMBOL_GPL(page_endio); | |
1642 | ||
485bb99b | 1643 | /** |
7c23c782 MWO |
1644 | * __folio_lock - Get a lock on the folio, assuming we need to sleep to get it. |
1645 | * @folio: The folio to lock | |
1da177e4 | 1646 | */ |
7c23c782 | 1647 | void __folio_lock(struct folio *folio) |
1da177e4 | 1648 | { |
101c0bf6 | 1649 | folio_wait_bit_common(folio, PG_locked, TASK_UNINTERRUPTIBLE, |
9a1ea439 | 1650 | EXCLUSIVE); |
1da177e4 | 1651 | } |
7c23c782 | 1652 | EXPORT_SYMBOL(__folio_lock); |
1da177e4 | 1653 | |
af7f29d9 | 1654 | int __folio_lock_killable(struct folio *folio) |
2687a356 | 1655 | { |
101c0bf6 | 1656 | return folio_wait_bit_common(folio, PG_locked, TASK_KILLABLE, |
9a1ea439 | 1657 | EXCLUSIVE); |
2687a356 | 1658 | } |
af7f29d9 | 1659 | EXPORT_SYMBOL_GPL(__folio_lock_killable); |
2687a356 | 1660 | |
ffdc8dab | 1661 | static int __folio_lock_async(struct folio *folio, struct wait_page_queue *wait) |
dd3e6d50 | 1662 | { |
df4d4f12 | 1663 | struct wait_queue_head *q = folio_waitqueue(folio); |
f32b5dd7 MWO |
1664 | int ret = 0; |
1665 | ||
df4d4f12 | 1666 | wait->folio = folio; |
f32b5dd7 MWO |
1667 | wait->bit_nr = PG_locked; |
1668 | ||
1669 | spin_lock_irq(&q->lock); | |
1670 | __add_wait_queue_entry_tail(q, &wait->wait); | |
ffdc8dab MWO |
1671 | folio_set_waiters(folio); |
1672 | ret = !folio_trylock(folio); | |
f32b5dd7 MWO |
1673 | /* |
1674 | * If we were successful now, we know we're still on the | |
1675 | * waitqueue as we're still under the lock. This means it's | |
1676 | * safe to remove and return success, we know the callback | |
1677 | * isn't going to trigger. | |
1678 | */ | |
1679 | if (!ret) | |
1680 | __remove_wait_queue(q, &wait->wait); | |
1681 | else | |
1682 | ret = -EIOCBQUEUED; | |
1683 | spin_unlock_irq(&q->lock); | |
1684 | return ret; | |
dd3e6d50 JA |
1685 | } |
1686 | ||
9a95f3cf PC |
1687 | /* |
1688 | * Return values: | |
9138e47e MWO |
1689 | * true - folio is locked; mmap_lock is still held. |
1690 | * false - folio is not locked. | |
3e4e28c5 | 1691 | * mmap_lock has been released (mmap_read_unlock(), unless flags had both |
9a95f3cf | 1692 | * FAULT_FLAG_ALLOW_RETRY and FAULT_FLAG_RETRY_NOWAIT set, in |
c1e8d7c6 | 1693 | * which case mmap_lock is still held. |
9a95f3cf | 1694 | * |
9138e47e MWO |
1695 | * If neither ALLOW_RETRY nor KILLABLE are set, will always return true |
1696 | * with the folio locked and the mmap_lock unperturbed. | |
9a95f3cf | 1697 | */ |
9138e47e | 1698 | bool __folio_lock_or_retry(struct folio *folio, struct mm_struct *mm, |
d065bd81 ML |
1699 | unsigned int flags) |
1700 | { | |
4064b982 | 1701 | if (fault_flag_allow_retry_first(flags)) { |
37b23e05 | 1702 | /* |
c1e8d7c6 | 1703 | * CAUTION! In this case, mmap_lock is not released |
37b23e05 KM |
1704 | * even though return 0. |
1705 | */ | |
1706 | if (flags & FAULT_FLAG_RETRY_NOWAIT) | |
9138e47e | 1707 | return false; |
37b23e05 | 1708 | |
d8ed45c5 | 1709 | mmap_read_unlock(mm); |
37b23e05 | 1710 | if (flags & FAULT_FLAG_KILLABLE) |
6baa8d60 | 1711 | folio_wait_locked_killable(folio); |
37b23e05 | 1712 | else |
6baa8d60 | 1713 | folio_wait_locked(folio); |
9138e47e | 1714 | return false; |
800bca7c HL |
1715 | } |
1716 | if (flags & FAULT_FLAG_KILLABLE) { | |
9138e47e | 1717 | bool ret; |
37b23e05 | 1718 | |
af7f29d9 | 1719 | ret = __folio_lock_killable(folio); |
800bca7c HL |
1720 | if (ret) { |
1721 | mmap_read_unlock(mm); | |
9138e47e | 1722 | return false; |
800bca7c HL |
1723 | } |
1724 | } else { | |
af7f29d9 | 1725 | __folio_lock(folio); |
d065bd81 | 1726 | } |
800bca7c | 1727 | |
9138e47e | 1728 | return true; |
d065bd81 ML |
1729 | } |
1730 | ||
e7b563bb | 1731 | /** |
0d3f9296 MW |
1732 | * page_cache_next_miss() - Find the next gap in the page cache. |
1733 | * @mapping: Mapping. | |
1734 | * @index: Index. | |
1735 | * @max_scan: Maximum range to search. | |
e7b563bb | 1736 | * |
0d3f9296 MW |
1737 | * Search the range [index, min(index + max_scan - 1, ULONG_MAX)] for the |
1738 | * gap with the lowest index. | |
e7b563bb | 1739 | * |
0d3f9296 MW |
1740 | * This function may be called under the rcu_read_lock. However, this will |
1741 | * not atomically search a snapshot of the cache at a single point in time. | |
1742 | * For example, if a gap is created at index 5, then subsequently a gap is | |
1743 | * created at index 10, page_cache_next_miss covering both indices may | |
1744 | * return 10 if called under the rcu_read_lock. | |
e7b563bb | 1745 | * |
0d3f9296 MW |
1746 | * Return: The index of the gap if found, otherwise an index outside the |
1747 | * range specified (in which case 'return - index >= max_scan' will be true). | |
1748 | * In the rare case of index wrap-around, 0 will be returned. | |
e7b563bb | 1749 | */ |
0d3f9296 | 1750 | pgoff_t page_cache_next_miss(struct address_space *mapping, |
e7b563bb JW |
1751 | pgoff_t index, unsigned long max_scan) |
1752 | { | |
0d3f9296 | 1753 | XA_STATE(xas, &mapping->i_pages, index); |
e7b563bb | 1754 | |
0d3f9296 MW |
1755 | while (max_scan--) { |
1756 | void *entry = xas_next(&xas); | |
1757 | if (!entry || xa_is_value(entry)) | |
e7b563bb | 1758 | break; |
0d3f9296 | 1759 | if (xas.xa_index == 0) |
e7b563bb JW |
1760 | break; |
1761 | } | |
1762 | ||
0d3f9296 | 1763 | return xas.xa_index; |
e7b563bb | 1764 | } |
0d3f9296 | 1765 | EXPORT_SYMBOL(page_cache_next_miss); |
e7b563bb JW |
1766 | |
1767 | /** | |
2346a560 | 1768 | * page_cache_prev_miss() - Find the previous gap in the page cache. |
0d3f9296 MW |
1769 | * @mapping: Mapping. |
1770 | * @index: Index. | |
1771 | * @max_scan: Maximum range to search. | |
e7b563bb | 1772 | * |
0d3f9296 MW |
1773 | * Search the range [max(index - max_scan + 1, 0), index] for the |
1774 | * gap with the highest index. | |
e7b563bb | 1775 | * |
0d3f9296 MW |
1776 | * This function may be called under the rcu_read_lock. However, this will |
1777 | * not atomically search a snapshot of the cache at a single point in time. | |
1778 | * For example, if a gap is created at index 10, then subsequently a gap is | |
1779 | * created at index 5, page_cache_prev_miss() covering both indices may | |
1780 | * return 5 if called under the rcu_read_lock. | |
e7b563bb | 1781 | * |
0d3f9296 MW |
1782 | * Return: The index of the gap if found, otherwise an index outside the |
1783 | * range specified (in which case 'index - return >= max_scan' will be true). | |
1784 | * In the rare case of wrap-around, ULONG_MAX will be returned. | |
e7b563bb | 1785 | */ |
0d3f9296 | 1786 | pgoff_t page_cache_prev_miss(struct address_space *mapping, |
e7b563bb JW |
1787 | pgoff_t index, unsigned long max_scan) |
1788 | { | |
0d3f9296 | 1789 | XA_STATE(xas, &mapping->i_pages, index); |
e7b563bb | 1790 | |
0d3f9296 MW |
1791 | while (max_scan--) { |
1792 | void *entry = xas_prev(&xas); | |
1793 | if (!entry || xa_is_value(entry)) | |
e7b563bb | 1794 | break; |
0d3f9296 | 1795 | if (xas.xa_index == ULONG_MAX) |
e7b563bb JW |
1796 | break; |
1797 | } | |
1798 | ||
0d3f9296 | 1799 | return xas.xa_index; |
e7b563bb | 1800 | } |
0d3f9296 | 1801 | EXPORT_SYMBOL(page_cache_prev_miss); |
e7b563bb | 1802 | |
020853b6 MWO |
1803 | /* |
1804 | * Lockless page cache protocol: | |
1805 | * On the lookup side: | |
1806 | * 1. Load the folio from i_pages | |
1807 | * 2. Increment the refcount if it's not zero | |
1808 | * 3. If the folio is not found by xas_reload(), put the refcount and retry | |
1809 | * | |
1810 | * On the removal side: | |
1811 | * A. Freeze the page (by zeroing the refcount if nobody else has a reference) | |
1812 | * B. Remove the page from i_pages | |
1813 | * C. Return the page to the page allocator | |
1814 | * | |
1815 | * This means that any page may have its reference count temporarily | |
1816 | * increased by a speculative page cache (or fast GUP) lookup as it can | |
1817 | * be allocated by another user before the RCU grace period expires. | |
1818 | * Because the refcount temporarily acquired here may end up being the | |
1819 | * last refcount on the page, any page allocation must be freeable by | |
1820 | * folio_put(). | |
1821 | */ | |
1822 | ||
44835d20 | 1823 | /* |
bc5a3011 | 1824 | * mapping_get_entry - Get a page cache entry. |
485bb99b | 1825 | * @mapping: the address_space to search |
a6de4b48 | 1826 | * @index: The page cache index. |
0cd6144a | 1827 | * |
bca65eea MWO |
1828 | * Looks up the page cache entry at @mapping & @index. If it is a folio, |
1829 | * it is returned with an increased refcount. If it is a shadow entry | |
1830 | * of a previously evicted folio, or a swap entry from shmem/tmpfs, | |
1831 | * it is returned without further action. | |
485bb99b | 1832 | * |
bca65eea | 1833 | * Return: The folio, swap or shadow entry, %NULL if nothing is found. |
1da177e4 | 1834 | */ |
bca65eea | 1835 | static void *mapping_get_entry(struct address_space *mapping, pgoff_t index) |
1da177e4 | 1836 | { |
a6de4b48 | 1837 | XA_STATE(xas, &mapping->i_pages, index); |
bca65eea | 1838 | struct folio *folio; |
1da177e4 | 1839 | |
a60637c8 NP |
1840 | rcu_read_lock(); |
1841 | repeat: | |
4c7472c0 | 1842 | xas_reset(&xas); |
bca65eea MWO |
1843 | folio = xas_load(&xas); |
1844 | if (xas_retry(&xas, folio)) | |
4c7472c0 MW |
1845 | goto repeat; |
1846 | /* | |
1847 | * A shadow entry of a recently evicted page, or a swap entry from | |
1848 | * shmem/tmpfs. Return it without attempting to raise page count. | |
1849 | */ | |
bca65eea | 1850 | if (!folio || xa_is_value(folio)) |
4c7472c0 | 1851 | goto out; |
83929372 | 1852 | |
bca65eea | 1853 | if (!folio_try_get_rcu(folio)) |
4c7472c0 | 1854 | goto repeat; |
83929372 | 1855 | |
bca65eea MWO |
1856 | if (unlikely(folio != xas_reload(&xas))) { |
1857 | folio_put(folio); | |
4c7472c0 | 1858 | goto repeat; |
a60637c8 | 1859 | } |
27d20fdd | 1860 | out: |
a60637c8 NP |
1861 | rcu_read_unlock(); |
1862 | ||
bca65eea | 1863 | return folio; |
1da177e4 | 1864 | } |
1da177e4 | 1865 | |
0cd6144a | 1866 | /** |
3f0c6a07 | 1867 | * __filemap_get_folio - Find and get a reference to a folio. |
2294b32e MWO |
1868 | * @mapping: The address_space to search. |
1869 | * @index: The page index. | |
3f0c6a07 MWO |
1870 | * @fgp_flags: %FGP flags modify how the folio is returned. |
1871 | * @gfp: Memory allocation flags to use if %FGP_CREAT is specified. | |
1da177e4 | 1872 | * |
2294b32e | 1873 | * Looks up the page cache entry at @mapping & @index. |
0cd6144a | 1874 | * |
2294b32e | 1875 | * @fgp_flags can be zero or more of these flags: |
0e056eb5 | 1876 | * |
3f0c6a07 MWO |
1877 | * * %FGP_ACCESSED - The folio will be marked accessed. |
1878 | * * %FGP_LOCK - The folio is returned locked. | |
44835d20 | 1879 | * * %FGP_ENTRY - If there is a shadow / swap / DAX entry, return it |
3f0c6a07 | 1880 | * instead of allocating a new folio to replace it. |
2294b32e | 1881 | * * %FGP_CREAT - If no page is present then a new page is allocated using |
3f0c6a07 | 1882 | * @gfp and added to the page cache and the VM's LRU list. |
2294b32e MWO |
1883 | * The page is returned locked and with an increased refcount. |
1884 | * * %FGP_FOR_MMAP - The caller wants to do its own locking dance if the | |
1885 | * page is already in cache. If the page was allocated, unlock it before | |
1886 | * returning so the caller can do the same dance. | |
3f0c6a07 MWO |
1887 | * * %FGP_WRITE - The page will be written to by the caller. |
1888 | * * %FGP_NOFS - __GFP_FS will get cleared in gfp. | |
1889 | * * %FGP_NOWAIT - Don't get blocked by page lock. | |
b27652d9 | 1890 | * * %FGP_STABLE - Wait for the folio to be stable (finished writeback) |
1da177e4 | 1891 | * |
2294b32e MWO |
1892 | * If %FGP_LOCK or %FGP_CREAT are specified then the function may sleep even |
1893 | * if the %GFP flags specified for %FGP_CREAT are atomic. | |
1da177e4 | 1894 | * |
2457aec6 | 1895 | * If there is a page cache page, it is returned with an increased refcount. |
a862f68a | 1896 | * |
3f0c6a07 | 1897 | * Return: The found folio or %NULL otherwise. |
1da177e4 | 1898 | */ |
3f0c6a07 MWO |
1899 | struct folio *__filemap_get_folio(struct address_space *mapping, pgoff_t index, |
1900 | int fgp_flags, gfp_t gfp) | |
1da177e4 | 1901 | { |
3f0c6a07 | 1902 | struct folio *folio; |
2457aec6 | 1903 | |
1da177e4 | 1904 | repeat: |
3f0c6a07 MWO |
1905 | folio = mapping_get_entry(mapping, index); |
1906 | if (xa_is_value(folio)) { | |
44835d20 | 1907 | if (fgp_flags & FGP_ENTRY) |
3f0c6a07 MWO |
1908 | return folio; |
1909 | folio = NULL; | |
44835d20 | 1910 | } |
3f0c6a07 | 1911 | if (!folio) |
2457aec6 MG |
1912 | goto no_page; |
1913 | ||
1914 | if (fgp_flags & FGP_LOCK) { | |
1915 | if (fgp_flags & FGP_NOWAIT) { | |
3f0c6a07 MWO |
1916 | if (!folio_trylock(folio)) { |
1917 | folio_put(folio); | |
2457aec6 MG |
1918 | return NULL; |
1919 | } | |
1920 | } else { | |
3f0c6a07 | 1921 | folio_lock(folio); |
2457aec6 MG |
1922 | } |
1923 | ||
1924 | /* Has the page been truncated? */ | |
3f0c6a07 MWO |
1925 | if (unlikely(folio->mapping != mapping)) { |
1926 | folio_unlock(folio); | |
1927 | folio_put(folio); | |
2457aec6 MG |
1928 | goto repeat; |
1929 | } | |
3f0c6a07 | 1930 | VM_BUG_ON_FOLIO(!folio_contains(folio, index), folio); |
2457aec6 MG |
1931 | } |
1932 | ||
c16eb000 | 1933 | if (fgp_flags & FGP_ACCESSED) |
3f0c6a07 | 1934 | folio_mark_accessed(folio); |
b9306a79 YS |
1935 | else if (fgp_flags & FGP_WRITE) { |
1936 | /* Clear idle flag for buffer write */ | |
3f0c6a07 MWO |
1937 | if (folio_test_idle(folio)) |
1938 | folio_clear_idle(folio); | |
b9306a79 | 1939 | } |
2457aec6 | 1940 | |
b27652d9 MWO |
1941 | if (fgp_flags & FGP_STABLE) |
1942 | folio_wait_stable(folio); | |
2457aec6 | 1943 | no_page: |
3f0c6a07 | 1944 | if (!folio && (fgp_flags & FGP_CREAT)) { |
2457aec6 | 1945 | int err; |
f56753ac | 1946 | if ((fgp_flags & FGP_WRITE) && mapping_can_writeback(mapping)) |
3f0c6a07 | 1947 | gfp |= __GFP_WRITE; |
45f87de5 | 1948 | if (fgp_flags & FGP_NOFS) |
3f0c6a07 | 1949 | gfp &= ~__GFP_FS; |
2457aec6 | 1950 | |
3f0c6a07 MWO |
1951 | folio = filemap_alloc_folio(gfp, 0); |
1952 | if (!folio) | |
eb2be189 | 1953 | return NULL; |
2457aec6 | 1954 | |
a75d4c33 | 1955 | if (WARN_ON_ONCE(!(fgp_flags & (FGP_LOCK | FGP_FOR_MMAP)))) |
2457aec6 MG |
1956 | fgp_flags |= FGP_LOCK; |
1957 | ||
eb39d618 | 1958 | /* Init accessed so avoid atomic mark_page_accessed later */ |
2457aec6 | 1959 | if (fgp_flags & FGP_ACCESSED) |
3f0c6a07 | 1960 | __folio_set_referenced(folio); |
2457aec6 | 1961 | |
3f0c6a07 | 1962 | err = filemap_add_folio(mapping, folio, index, gfp); |
eb2be189 | 1963 | if (unlikely(err)) { |
3f0c6a07 MWO |
1964 | folio_put(folio); |
1965 | folio = NULL; | |
eb2be189 NP |
1966 | if (err == -EEXIST) |
1967 | goto repeat; | |
1da177e4 | 1968 | } |
a75d4c33 JB |
1969 | |
1970 | /* | |
3f0c6a07 MWO |
1971 | * filemap_add_folio locks the page, and for mmap |
1972 | * we expect an unlocked page. | |
a75d4c33 | 1973 | */ |
3f0c6a07 MWO |
1974 | if (folio && (fgp_flags & FGP_FOR_MMAP)) |
1975 | folio_unlock(folio); | |
1da177e4 | 1976 | } |
2457aec6 | 1977 | |
3f0c6a07 | 1978 | return folio; |
1da177e4 | 1979 | } |
3f0c6a07 | 1980 | EXPORT_SYMBOL(__filemap_get_folio); |
1da177e4 | 1981 | |
c7bad633 MWO |
1982 | static inline struct page *find_get_entry(struct xa_state *xas, pgoff_t max, |
1983 | xa_mark_t mark) | |
1984 | { | |
1985 | struct page *page; | |
1986 | ||
1987 | retry: | |
1988 | if (mark == XA_PRESENT) | |
1989 | page = xas_find(xas, max); | |
1990 | else | |
1991 | page = xas_find_marked(xas, max, mark); | |
1992 | ||
1993 | if (xas_retry(xas, page)) | |
1994 | goto retry; | |
1995 | /* | |
1996 | * A shadow entry of a recently evicted page, a swap | |
1997 | * entry from shmem/tmpfs or a DAX entry. Return it | |
1998 | * without attempting to raise page count. | |
1999 | */ | |
2000 | if (!page || xa_is_value(page)) | |
2001 | return page; | |
2002 | ||
2003 | if (!page_cache_get_speculative(page)) | |
2004 | goto reset; | |
2005 | ||
2006 | /* Has the page moved or been split? */ | |
2007 | if (unlikely(page != xas_reload(xas))) { | |
2008 | put_page(page); | |
2009 | goto reset; | |
2010 | } | |
2011 | ||
2012 | return page; | |
2013 | reset: | |
2014 | xas_reset(xas); | |
2015 | goto retry; | |
2016 | } | |
2017 | ||
0cd6144a JW |
2018 | /** |
2019 | * find_get_entries - gang pagecache lookup | |
2020 | * @mapping: The address_space to search | |
2021 | * @start: The starting page cache index | |
ca122fe4 | 2022 | * @end: The final page index (inclusive). |
cf2039af | 2023 | * @pvec: Where the resulting entries are placed. |
0cd6144a JW |
2024 | * @indices: The cache indices corresponding to the entries in @entries |
2025 | * | |
cf2039af MWO |
2026 | * find_get_entries() will search for and return a batch of entries in |
2027 | * the mapping. The entries are placed in @pvec. find_get_entries() | |
2028 | * takes a reference on any actual pages it returns. | |
0cd6144a JW |
2029 | * |
2030 | * The search returns a group of mapping-contiguous page cache entries | |
2031 | * with ascending indexes. There may be holes in the indices due to | |
2032 | * not-present pages. | |
2033 | * | |
139b6a6f JW |
2034 | * Any shadow entries of evicted pages, or swap entries from |
2035 | * shmem/tmpfs, are included in the returned array. | |
0cd6144a | 2036 | * |
71725ed1 HD |
2037 | * If it finds a Transparent Huge Page, head or tail, find_get_entries() |
2038 | * stops at that page: the caller is likely to have a better way to handle | |
2039 | * the compound page as a whole, and then skip its extent, than repeatedly | |
2040 | * calling find_get_entries() to return all its tails. | |
2041 | * | |
a862f68a | 2042 | * Return: the number of pages and shadow entries which were found. |
0cd6144a | 2043 | */ |
ca122fe4 | 2044 | unsigned find_get_entries(struct address_space *mapping, pgoff_t start, |
cf2039af | 2045 | pgoff_t end, struct pagevec *pvec, pgoff_t *indices) |
0cd6144a | 2046 | { |
f280bf09 MW |
2047 | XA_STATE(xas, &mapping->i_pages, start); |
2048 | struct page *page; | |
0cd6144a | 2049 | unsigned int ret = 0; |
cf2039af | 2050 | unsigned nr_entries = PAGEVEC_SIZE; |
0cd6144a JW |
2051 | |
2052 | rcu_read_lock(); | |
ca122fe4 | 2053 | while ((page = find_get_entry(&xas, end, XA_PRESENT))) { |
71725ed1 HD |
2054 | /* |
2055 | * Terminate early on finding a THP, to allow the caller to | |
2056 | * handle it all at once; but continue if this is hugetlbfs. | |
2057 | */ | |
c7bad633 MWO |
2058 | if (!xa_is_value(page) && PageTransHuge(page) && |
2059 | !PageHuge(page)) { | |
71725ed1 HD |
2060 | page = find_subpage(page, xas.xa_index); |
2061 | nr_entries = ret + 1; | |
2062 | } | |
c7bad633 | 2063 | |
f280bf09 | 2064 | indices[ret] = xas.xa_index; |
cf2039af | 2065 | pvec->pages[ret] = page; |
0cd6144a JW |
2066 | if (++ret == nr_entries) |
2067 | break; | |
2068 | } | |
2069 | rcu_read_unlock(); | |
cf2039af MWO |
2070 | |
2071 | pvec->nr = ret; | |
0cd6144a JW |
2072 | return ret; |
2073 | } | |
2074 | ||
5c211ba2 MWO |
2075 | /** |
2076 | * find_lock_entries - Find a batch of pagecache entries. | |
2077 | * @mapping: The address_space to search. | |
2078 | * @start: The starting page cache index. | |
2079 | * @end: The final page index (inclusive). | |
2080 | * @pvec: Where the resulting entries are placed. | |
2081 | * @indices: The cache indices of the entries in @pvec. | |
2082 | * | |
2083 | * find_lock_entries() will return a batch of entries from @mapping. | |
2084 | * Swap, shadow and DAX entries are included. Pages are returned | |
2085 | * locked and with an incremented refcount. Pages which are locked by | |
2086 | * somebody else or under writeback are skipped. Only the head page of | |
2087 | * a THP is returned. Pages which are partially outside the range are | |
2088 | * not returned. | |
2089 | * | |
2090 | * The entries have ascending indexes. The indices may not be consecutive | |
2091 | * due to not-present entries, THP pages, pages which could not be locked | |
2092 | * or pages under writeback. | |
2093 | * | |
2094 | * Return: The number of entries which were found. | |
2095 | */ | |
2096 | unsigned find_lock_entries(struct address_space *mapping, pgoff_t start, | |
2097 | pgoff_t end, struct pagevec *pvec, pgoff_t *indices) | |
2098 | { | |
2099 | XA_STATE(xas, &mapping->i_pages, start); | |
2100 | struct page *page; | |
2101 | ||
2102 | rcu_read_lock(); | |
2103 | while ((page = find_get_entry(&xas, end, XA_PRESENT))) { | |
2104 | if (!xa_is_value(page)) { | |
2105 | if (page->index < start) | |
2106 | goto put; | |
5c211ba2 MWO |
2107 | if (page->index + thp_nr_pages(page) - 1 > end) |
2108 | goto put; | |
2109 | if (!trylock_page(page)) | |
2110 | goto put; | |
2111 | if (page->mapping != mapping || PageWriteback(page)) | |
2112 | goto unlock; | |
2113 | VM_BUG_ON_PAGE(!thp_contains(page, xas.xa_index), | |
2114 | page); | |
2115 | } | |
2116 | indices[pvec->nr] = xas.xa_index; | |
2117 | if (!pagevec_add(pvec, page)) | |
2118 | break; | |
2119 | goto next; | |
2120 | unlock: | |
2121 | unlock_page(page); | |
2122 | put: | |
2123 | put_page(page); | |
2124 | next: | |
2d11e738 HD |
2125 | if (!xa_is_value(page) && PageTransHuge(page)) { |
2126 | unsigned int nr_pages = thp_nr_pages(page); | |
2127 | ||
2128 | /* Final THP may cross MAX_LFS_FILESIZE on 32-bit */ | |
2129 | xas_set(&xas, page->index + nr_pages); | |
2130 | if (xas.xa_index < nr_pages) | |
2131 | break; | |
2132 | } | |
5c211ba2 MWO |
2133 | } |
2134 | rcu_read_unlock(); | |
2135 | ||
2136 | return pagevec_count(pvec); | |
2137 | } | |
2138 | ||
1da177e4 | 2139 | /** |
b947cee4 | 2140 | * find_get_pages_range - gang pagecache lookup |
1da177e4 LT |
2141 | * @mapping: The address_space to search |
2142 | * @start: The starting page index | |
b947cee4 | 2143 | * @end: The final page index (inclusive) |
1da177e4 LT |
2144 | * @nr_pages: The maximum number of pages |
2145 | * @pages: Where the resulting pages are placed | |
2146 | * | |
b947cee4 JK |
2147 | * find_get_pages_range() will search for and return a group of up to @nr_pages |
2148 | * pages in the mapping starting at index @start and up to index @end | |
2149 | * (inclusive). The pages are placed at @pages. find_get_pages_range() takes | |
2150 | * a reference against the returned pages. | |
1da177e4 LT |
2151 | * |
2152 | * The search returns a group of mapping-contiguous pages with ascending | |
2153 | * indexes. There may be holes in the indices due to not-present pages. | |
d72dc8a2 | 2154 | * We also update @start to index the next page for the traversal. |
1da177e4 | 2155 | * |
a862f68a MR |
2156 | * Return: the number of pages which were found. If this number is |
2157 | * smaller than @nr_pages, the end of specified range has been | |
b947cee4 | 2158 | * reached. |
1da177e4 | 2159 | */ |
b947cee4 JK |
2160 | unsigned find_get_pages_range(struct address_space *mapping, pgoff_t *start, |
2161 | pgoff_t end, unsigned int nr_pages, | |
2162 | struct page **pages) | |
1da177e4 | 2163 | { |
fd1b3cee MW |
2164 | XA_STATE(xas, &mapping->i_pages, *start); |
2165 | struct page *page; | |
0fc9d104 KK |
2166 | unsigned ret = 0; |
2167 | ||
2168 | if (unlikely(!nr_pages)) | |
2169 | return 0; | |
a60637c8 NP |
2170 | |
2171 | rcu_read_lock(); | |
c7bad633 | 2172 | while ((page = find_get_entry(&xas, end, XA_PRESENT))) { |
fd1b3cee MW |
2173 | /* Skip over shadow, swap and DAX entries */ |
2174 | if (xa_is_value(page)) | |
8079b1c8 | 2175 | continue; |
a60637c8 | 2176 | |
4101196b | 2177 | pages[ret] = find_subpage(page, xas.xa_index); |
b947cee4 | 2178 | if (++ret == nr_pages) { |
5d3ee42f | 2179 | *start = xas.xa_index + 1; |
b947cee4 JK |
2180 | goto out; |
2181 | } | |
a60637c8 | 2182 | } |
5b280c0c | 2183 | |
b947cee4 JK |
2184 | /* |
2185 | * We come here when there is no page beyond @end. We take care to not | |
2186 | * overflow the index @start as it confuses some of the callers. This | |
fd1b3cee | 2187 | * breaks the iteration when there is a page at index -1 but that is |
b947cee4 JK |
2188 | * already broken anyway. |
2189 | */ | |
2190 | if (end == (pgoff_t)-1) | |
2191 | *start = (pgoff_t)-1; | |
2192 | else | |
2193 | *start = end + 1; | |
2194 | out: | |
a60637c8 | 2195 | rcu_read_unlock(); |
d72dc8a2 | 2196 | |
1da177e4 LT |
2197 | return ret; |
2198 | } | |
2199 | ||
ebf43500 JA |
2200 | /** |
2201 | * find_get_pages_contig - gang contiguous pagecache lookup | |
2202 | * @mapping: The address_space to search | |
2203 | * @index: The starting page index | |
2204 | * @nr_pages: The maximum number of pages | |
2205 | * @pages: Where the resulting pages are placed | |
2206 | * | |
2207 | * find_get_pages_contig() works exactly like find_get_pages(), except | |
2208 | * that the returned number of pages are guaranteed to be contiguous. | |
2209 | * | |
a862f68a | 2210 | * Return: the number of pages which were found. |
ebf43500 JA |
2211 | */ |
2212 | unsigned find_get_pages_contig(struct address_space *mapping, pgoff_t index, | |
2213 | unsigned int nr_pages, struct page **pages) | |
2214 | { | |
3ece58a2 MW |
2215 | XA_STATE(xas, &mapping->i_pages, index); |
2216 | struct page *page; | |
0fc9d104 KK |
2217 | unsigned int ret = 0; |
2218 | ||
2219 | if (unlikely(!nr_pages)) | |
2220 | return 0; | |
a60637c8 NP |
2221 | |
2222 | rcu_read_lock(); | |
3ece58a2 | 2223 | for (page = xas_load(&xas); page; page = xas_next(&xas)) { |
3ece58a2 MW |
2224 | if (xas_retry(&xas, page)) |
2225 | continue; | |
2226 | /* | |
2227 | * If the entry has been swapped out, we can stop looking. | |
2228 | * No current caller is looking for DAX entries. | |
2229 | */ | |
2230 | if (xa_is_value(page)) | |
8079b1c8 | 2231 | break; |
ebf43500 | 2232 | |
4101196b | 2233 | if (!page_cache_get_speculative(page)) |
3ece58a2 | 2234 | goto retry; |
83929372 | 2235 | |
4101196b | 2236 | /* Has the page moved or been split? */ |
3ece58a2 MW |
2237 | if (unlikely(page != xas_reload(&xas))) |
2238 | goto put_page; | |
a60637c8 | 2239 | |
4101196b | 2240 | pages[ret] = find_subpage(page, xas.xa_index); |
0fc9d104 KK |
2241 | if (++ret == nr_pages) |
2242 | break; | |
3ece58a2 MW |
2243 | continue; |
2244 | put_page: | |
4101196b | 2245 | put_page(page); |
3ece58a2 MW |
2246 | retry: |
2247 | xas_reset(&xas); | |
ebf43500 | 2248 | } |
a60637c8 NP |
2249 | rcu_read_unlock(); |
2250 | return ret; | |
ebf43500 | 2251 | } |
ef71c15c | 2252 | EXPORT_SYMBOL(find_get_pages_contig); |
ebf43500 | 2253 | |
485bb99b | 2254 | /** |
c49f50d1 | 2255 | * find_get_pages_range_tag - Find and return head pages matching @tag. |
485bb99b RD |
2256 | * @mapping: the address_space to search |
2257 | * @index: the starting page index | |
72b045ae | 2258 | * @end: The final page index (inclusive) |
485bb99b RD |
2259 | * @tag: the tag index |
2260 | * @nr_pages: the maximum number of pages | |
2261 | * @pages: where the resulting pages are placed | |
2262 | * | |
c49f50d1 MWO |
2263 | * Like find_get_pages(), except we only return head pages which are tagged |
2264 | * with @tag. @index is updated to the index immediately after the last | |
2265 | * page we return, ready for the next iteration. | |
a862f68a MR |
2266 | * |
2267 | * Return: the number of pages which were found. | |
1da177e4 | 2268 | */ |
72b045ae | 2269 | unsigned find_get_pages_range_tag(struct address_space *mapping, pgoff_t *index, |
a6906972 | 2270 | pgoff_t end, xa_mark_t tag, unsigned int nr_pages, |
72b045ae | 2271 | struct page **pages) |
1da177e4 | 2272 | { |
a6906972 MW |
2273 | XA_STATE(xas, &mapping->i_pages, *index); |
2274 | struct page *page; | |
0fc9d104 KK |
2275 | unsigned ret = 0; |
2276 | ||
2277 | if (unlikely(!nr_pages)) | |
2278 | return 0; | |
a60637c8 NP |
2279 | |
2280 | rcu_read_lock(); | |
c7bad633 | 2281 | while ((page = find_get_entry(&xas, end, tag))) { |
a6906972 MW |
2282 | /* |
2283 | * Shadow entries should never be tagged, but this iteration | |
2284 | * is lockless so there is a window for page reclaim to evict | |
2285 | * a page we saw tagged. Skip over it. | |
2286 | */ | |
2287 | if (xa_is_value(page)) | |
139b6a6f | 2288 | continue; |
a60637c8 | 2289 | |
c49f50d1 | 2290 | pages[ret] = page; |
72b045ae | 2291 | if (++ret == nr_pages) { |
c49f50d1 | 2292 | *index = page->index + thp_nr_pages(page); |
72b045ae JK |
2293 | goto out; |
2294 | } | |
a60637c8 | 2295 | } |
5b280c0c | 2296 | |
72b045ae | 2297 | /* |
a6906972 | 2298 | * We come here when we got to @end. We take care to not overflow the |
72b045ae | 2299 | * index @index as it confuses some of the callers. This breaks the |
a6906972 MW |
2300 | * iteration when there is a page at index -1 but that is already |
2301 | * broken anyway. | |
72b045ae JK |
2302 | */ |
2303 | if (end == (pgoff_t)-1) | |
2304 | *index = (pgoff_t)-1; | |
2305 | else | |
2306 | *index = end + 1; | |
2307 | out: | |
a60637c8 | 2308 | rcu_read_unlock(); |
1da177e4 | 2309 | |
1da177e4 LT |
2310 | return ret; |
2311 | } | |
72b045ae | 2312 | EXPORT_SYMBOL(find_get_pages_range_tag); |
1da177e4 | 2313 | |
76d42bd9 WF |
2314 | /* |
2315 | * CD/DVDs are error prone. When a medium error occurs, the driver may fail | |
2316 | * a _large_ part of the i/o request. Imagine the worst scenario: | |
2317 | * | |
2318 | * ---R__________________________________________B__________ | |
2319 | * ^ reading here ^ bad block(assume 4k) | |
2320 | * | |
2321 | * read(R) => miss => readahead(R...B) => media error => frustrating retries | |
2322 | * => failing the whole request => read(R) => read(R+1) => | |
2323 | * readahead(R+1...B+1) => bang => read(R+2) => read(R+3) => | |
2324 | * readahead(R+3...B+2) => bang => read(R+3) => read(R+4) => | |
2325 | * readahead(R+4...B+3) => bang => read(R+4) => read(R+5) => ...... | |
2326 | * | |
2327 | * It is going insane. Fix it by quickly scaling down the readahead size. | |
2328 | */ | |
0f8e2db4 | 2329 | static void shrink_readahead_size_eio(struct file_ra_state *ra) |
76d42bd9 | 2330 | { |
76d42bd9 | 2331 | ra->ra_pages /= 4; |
76d42bd9 WF |
2332 | } |
2333 | ||
cbd59c48 MWO |
2334 | /* |
2335 | * filemap_get_read_batch - Get a batch of pages for read | |
2336 | * | |
2337 | * Get a batch of pages which represent a contiguous range of bytes | |
2338 | * in the file. No tail pages will be returned. If @index is in the | |
2339 | * middle of a THP, the entire THP will be returned. The last page in | |
2340 | * the batch may have Readahead set or be not Uptodate so that the | |
2341 | * caller can take the appropriate action. | |
2342 | */ | |
2343 | static void filemap_get_read_batch(struct address_space *mapping, | |
2344 | pgoff_t index, pgoff_t max, struct pagevec *pvec) | |
2345 | { | |
2346 | XA_STATE(xas, &mapping->i_pages, index); | |
2347 | struct page *head; | |
2348 | ||
2349 | rcu_read_lock(); | |
2350 | for (head = xas_load(&xas); head; head = xas_next(&xas)) { | |
2351 | if (xas_retry(&xas, head)) | |
2352 | continue; | |
2353 | if (xas.xa_index > max || xa_is_value(head)) | |
2354 | break; | |
2355 | if (!page_cache_get_speculative(head)) | |
2356 | goto retry; | |
2357 | ||
2358 | /* Has the page moved or been split? */ | |
2359 | if (unlikely(head != xas_reload(&xas))) | |
2360 | goto put_page; | |
2361 | ||
2362 | if (!pagevec_add(pvec, head)) | |
2363 | break; | |
2364 | if (!PageUptodate(head)) | |
2365 | break; | |
2366 | if (PageReadahead(head)) | |
2367 | break; | |
2368 | xas.xa_index = head->index + thp_nr_pages(head) - 1; | |
2369 | xas.xa_offset = (xas.xa_index >> xas.xa_shift) & XA_CHUNK_MASK; | |
2370 | continue; | |
2371 | put_page: | |
2372 | put_page(head); | |
2373 | retry: | |
2374 | xas_reset(&xas); | |
2375 | } | |
2376 | rcu_read_unlock(); | |
2377 | } | |
2378 | ||
68430303 MWO |
2379 | static int filemap_read_page(struct file *file, struct address_space *mapping, |
2380 | struct page *page) | |
723ef24b | 2381 | { |
723ef24b KO |
2382 | int error; |
2383 | ||
723ef24b | 2384 | /* |
68430303 MWO |
2385 | * A previous I/O error may have been due to temporary failures, |
2386 | * eg. multipath errors. PG_error will be set again if readpage | |
2387 | * fails. | |
723ef24b KO |
2388 | */ |
2389 | ClearPageError(page); | |
2390 | /* Start the actual read. The read will unlock the page. */ | |
68430303 MWO |
2391 | error = mapping->a_ops->readpage(file, page); |
2392 | if (error) | |
2393 | return error; | |
723ef24b | 2394 | |
aa1ec2f6 | 2395 | error = wait_on_page_locked_killable(page); |
68430303 MWO |
2396 | if (error) |
2397 | return error; | |
aa1ec2f6 MWO |
2398 | if (PageUptodate(page)) |
2399 | return 0; | |
aa1ec2f6 MWO |
2400 | shrink_readahead_size_eio(&file->f_ra); |
2401 | return -EIO; | |
723ef24b KO |
2402 | } |
2403 | ||
fce70da3 MWO |
2404 | static bool filemap_range_uptodate(struct address_space *mapping, |
2405 | loff_t pos, struct iov_iter *iter, struct page *page) | |
2406 | { | |
2407 | int count; | |
2408 | ||
2409 | if (PageUptodate(page)) | |
2410 | return true; | |
2411 | /* pipes can't handle partially uptodate pages */ | |
2412 | if (iov_iter_is_pipe(iter)) | |
2413 | return false; | |
2414 | if (!mapping->a_ops->is_partially_uptodate) | |
2415 | return false; | |
2416 | if (mapping->host->i_blkbits >= (PAGE_SHIFT + thp_order(page))) | |
2417 | return false; | |
2418 | ||
2419 | count = iter->count; | |
2420 | if (page_offset(page) > pos) { | |
2421 | count -= page_offset(page) - pos; | |
2422 | pos = 0; | |
2423 | } else { | |
2424 | pos -= page_offset(page); | |
2425 | } | |
2426 | ||
2427 | return mapping->a_ops->is_partially_uptodate(page, pos, count); | |
2428 | } | |
2429 | ||
4612aeef MWO |
2430 | static int filemap_update_page(struct kiocb *iocb, |
2431 | struct address_space *mapping, struct iov_iter *iter, | |
fce70da3 | 2432 | struct page *page) |
723ef24b | 2433 | { |
ffdc8dab | 2434 | struct folio *folio = page_folio(page); |
723ef24b KO |
2435 | int error; |
2436 | ||
730633f0 JK |
2437 | if (iocb->ki_flags & IOCB_NOWAIT) { |
2438 | if (!filemap_invalidate_trylock_shared(mapping)) | |
2439 | return -EAGAIN; | |
2440 | } else { | |
2441 | filemap_invalidate_lock_shared(mapping); | |
2442 | } | |
2443 | ||
ffdc8dab | 2444 | if (!folio_trylock(folio)) { |
730633f0 | 2445 | error = -EAGAIN; |
87d1d7b6 | 2446 | if (iocb->ki_flags & (IOCB_NOWAIT | IOCB_NOIO)) |
730633f0 | 2447 | goto unlock_mapping; |
87d1d7b6 | 2448 | if (!(iocb->ki_flags & IOCB_WAITQ)) { |
730633f0 | 2449 | filemap_invalidate_unlock_shared(mapping); |
ffdc8dab | 2450 | put_and_wait_on_page_locked(&folio->page, TASK_KILLABLE); |
4612aeef | 2451 | return AOP_TRUNCATED_PAGE; |
bd8a1f36 | 2452 | } |
ffdc8dab | 2453 | error = __folio_lock_async(folio, iocb->ki_waitq); |
87d1d7b6 | 2454 | if (error) |
730633f0 | 2455 | goto unlock_mapping; |
723ef24b | 2456 | } |
723ef24b | 2457 | |
730633f0 | 2458 | error = AOP_TRUNCATED_PAGE; |
ffdc8dab | 2459 | if (!folio->mapping) |
730633f0 | 2460 | goto unlock; |
723ef24b | 2461 | |
fce70da3 | 2462 | error = 0; |
ffdc8dab | 2463 | if (filemap_range_uptodate(mapping, iocb->ki_pos, iter, &folio->page)) |
fce70da3 MWO |
2464 | goto unlock; |
2465 | ||
2466 | error = -EAGAIN; | |
2467 | if (iocb->ki_flags & (IOCB_NOIO | IOCB_NOWAIT | IOCB_WAITQ)) | |
2468 | goto unlock; | |
2469 | ||
ffdc8dab | 2470 | error = filemap_read_page(iocb->ki_filp, mapping, &folio->page); |
730633f0 | 2471 | goto unlock_mapping; |
fce70da3 | 2472 | unlock: |
ffdc8dab | 2473 | folio_unlock(folio); |
730633f0 JK |
2474 | unlock_mapping: |
2475 | filemap_invalidate_unlock_shared(mapping); | |
2476 | if (error == AOP_TRUNCATED_PAGE) | |
ffdc8dab | 2477 | folio_put(folio); |
fce70da3 | 2478 | return error; |
723ef24b KO |
2479 | } |
2480 | ||
f253e185 MWO |
2481 | static int filemap_create_page(struct file *file, |
2482 | struct address_space *mapping, pgoff_t index, | |
2483 | struct pagevec *pvec) | |
723ef24b | 2484 | { |
723ef24b KO |
2485 | struct page *page; |
2486 | int error; | |
2487 | ||
723ef24b KO |
2488 | page = page_cache_alloc(mapping); |
2489 | if (!page) | |
f253e185 | 2490 | return -ENOMEM; |
723ef24b | 2491 | |
730633f0 JK |
2492 | /* |
2493 | * Protect against truncate / hole punch. Grabbing invalidate_lock here | |
2494 | * assures we cannot instantiate and bring uptodate new pagecache pages | |
2495 | * after evicting page cache during truncate and before actually | |
2496 | * freeing blocks. Note that we could release invalidate_lock after | |
2497 | * inserting the page into page cache as the locked page would then be | |
2498 | * enough to synchronize with hole punching. But there are code paths | |
2499 | * such as filemap_update_page() filling in partially uptodate pages or | |
2500 | * ->readpages() that need to hold invalidate_lock while mapping blocks | |
2501 | * for IO so let's hold the lock here as well to keep locking rules | |
2502 | * simple. | |
2503 | */ | |
2504 | filemap_invalidate_lock_shared(mapping); | |
723ef24b | 2505 | error = add_to_page_cache_lru(page, mapping, index, |
f253e185 MWO |
2506 | mapping_gfp_constraint(mapping, GFP_KERNEL)); |
2507 | if (error == -EEXIST) | |
2508 | error = AOP_TRUNCATED_PAGE; | |
2509 | if (error) | |
2510 | goto error; | |
2511 | ||
2512 | error = filemap_read_page(file, mapping, page); | |
2513 | if (error) | |
2514 | goto error; | |
2515 | ||
730633f0 | 2516 | filemap_invalidate_unlock_shared(mapping); |
f253e185 MWO |
2517 | pagevec_add(pvec, page); |
2518 | return 0; | |
2519 | error: | |
730633f0 | 2520 | filemap_invalidate_unlock_shared(mapping); |
68430303 | 2521 | put_page(page); |
f253e185 | 2522 | return error; |
723ef24b KO |
2523 | } |
2524 | ||
5963fe03 MWO |
2525 | static int filemap_readahead(struct kiocb *iocb, struct file *file, |
2526 | struct address_space *mapping, struct page *page, | |
2527 | pgoff_t last_index) | |
2528 | { | |
2529 | if (iocb->ki_flags & IOCB_NOIO) | |
2530 | return -EAGAIN; | |
2531 | page_cache_async_readahead(mapping, &file->f_ra, file, page, | |
2532 | page->index, last_index - page->index); | |
2533 | return 0; | |
2534 | } | |
2535 | ||
3a6bae48 | 2536 | static int filemap_get_pages(struct kiocb *iocb, struct iov_iter *iter, |
ff993ba1 | 2537 | struct pagevec *pvec) |
06c04442 KO |
2538 | { |
2539 | struct file *filp = iocb->ki_filp; | |
2540 | struct address_space *mapping = filp->f_mapping; | |
2541 | struct file_ra_state *ra = &filp->f_ra; | |
2542 | pgoff_t index = iocb->ki_pos >> PAGE_SHIFT; | |
cbd59c48 | 2543 | pgoff_t last_index; |
2642fca6 | 2544 | struct page *page; |
cbd59c48 | 2545 | int err = 0; |
06c04442 | 2546 | |
cbd59c48 | 2547 | last_index = DIV_ROUND_UP(iocb->ki_pos + iter->count, PAGE_SIZE); |
2642fca6 | 2548 | retry: |
06c04442 KO |
2549 | if (fatal_signal_pending(current)) |
2550 | return -EINTR; | |
2551 | ||
cbd59c48 | 2552 | filemap_get_read_batch(mapping, index, last_index, pvec); |
2642fca6 MWO |
2553 | if (!pagevec_count(pvec)) { |
2554 | if (iocb->ki_flags & IOCB_NOIO) | |
2555 | return -EAGAIN; | |
2556 | page_cache_sync_readahead(mapping, ra, filp, index, | |
2557 | last_index - index); | |
2558 | filemap_get_read_batch(mapping, index, last_index, pvec); | |
2559 | } | |
f253e185 MWO |
2560 | if (!pagevec_count(pvec)) { |
2561 | if (iocb->ki_flags & (IOCB_NOWAIT | IOCB_WAITQ)) | |
2562 | return -EAGAIN; | |
2563 | err = filemap_create_page(filp, mapping, | |
2564 | iocb->ki_pos >> PAGE_SHIFT, pvec); | |
2565 | if (err == AOP_TRUNCATED_PAGE) | |
2642fca6 | 2566 | goto retry; |
f253e185 MWO |
2567 | return err; |
2568 | } | |
06c04442 | 2569 | |
2642fca6 MWO |
2570 | page = pvec->pages[pagevec_count(pvec) - 1]; |
2571 | if (PageReadahead(page)) { | |
2572 | err = filemap_readahead(iocb, filp, mapping, page, last_index); | |
2573 | if (err) | |
2574 | goto err; | |
2575 | } | |
2576 | if (!PageUptodate(page)) { | |
2577 | if ((iocb->ki_flags & IOCB_WAITQ) && pagevec_count(pvec) > 1) | |
2578 | iocb->ki_flags |= IOCB_NOWAIT; | |
2579 | err = filemap_update_page(iocb, mapping, iter, page); | |
2580 | if (err) | |
2581 | goto err; | |
06c04442 KO |
2582 | } |
2583 | ||
2642fca6 | 2584 | return 0; |
cbd59c48 | 2585 | err: |
2642fca6 MWO |
2586 | if (err < 0) |
2587 | put_page(page); | |
2588 | if (likely(--pvec->nr)) | |
ff993ba1 | 2589 | return 0; |
4612aeef | 2590 | if (err == AOP_TRUNCATED_PAGE) |
2642fca6 MWO |
2591 | goto retry; |
2592 | return err; | |
06c04442 KO |
2593 | } |
2594 | ||
485bb99b | 2595 | /** |
87fa0f3e CH |
2596 | * filemap_read - Read data from the page cache. |
2597 | * @iocb: The iocb to read. | |
2598 | * @iter: Destination for the data. | |
2599 | * @already_read: Number of bytes already read by the caller. | |
485bb99b | 2600 | * |
87fa0f3e CH |
2601 | * Copies data from the page cache. If the data is not currently present, |
2602 | * uses the readahead and readpage address_space operations to fetch it. | |
1da177e4 | 2603 | * |
87fa0f3e CH |
2604 | * Return: Total number of bytes copied, including those already read by |
2605 | * the caller. If an error happens before any bytes are copied, returns | |
2606 | * a negative error number. | |
1da177e4 | 2607 | */ |
87fa0f3e CH |
2608 | ssize_t filemap_read(struct kiocb *iocb, struct iov_iter *iter, |
2609 | ssize_t already_read) | |
1da177e4 | 2610 | { |
47c27bc4 | 2611 | struct file *filp = iocb->ki_filp; |
06c04442 | 2612 | struct file_ra_state *ra = &filp->f_ra; |
36e78914 | 2613 | struct address_space *mapping = filp->f_mapping; |
1da177e4 | 2614 | struct inode *inode = mapping->host; |
ff993ba1 MWO |
2615 | struct pagevec pvec; |
2616 | int i, error = 0; | |
06c04442 KO |
2617 | bool writably_mapped; |
2618 | loff_t isize, end_offset; | |
1da177e4 | 2619 | |
723ef24b | 2620 | if (unlikely(iocb->ki_pos >= inode->i_sb->s_maxbytes)) |
d05c5f7b | 2621 | return 0; |
3644e2d2 KO |
2622 | if (unlikely(!iov_iter_count(iter))) |
2623 | return 0; | |
2624 | ||
c2a9737f | 2625 | iov_iter_truncate(iter, inode->i_sb->s_maxbytes); |
cbd59c48 | 2626 | pagevec_init(&pvec); |
c2a9737f | 2627 | |
06c04442 | 2628 | do { |
1da177e4 | 2629 | cond_resched(); |
5abf186a | 2630 | |
723ef24b | 2631 | /* |
06c04442 KO |
2632 | * If we've already successfully copied some data, then we |
2633 | * can no longer safely return -EIOCBQUEUED. Hence mark | |
2634 | * an async read NOWAIT at that point. | |
723ef24b | 2635 | */ |
87fa0f3e | 2636 | if ((iocb->ki_flags & IOCB_WAITQ) && already_read) |
723ef24b KO |
2637 | iocb->ki_flags |= IOCB_NOWAIT; |
2638 | ||
8c8387ee DH |
2639 | if (unlikely(iocb->ki_pos >= i_size_read(inode))) |
2640 | break; | |
2641 | ||
ff993ba1 MWO |
2642 | error = filemap_get_pages(iocb, iter, &pvec); |
2643 | if (error < 0) | |
06c04442 | 2644 | break; |
1da177e4 | 2645 | |
06c04442 KO |
2646 | /* |
2647 | * i_size must be checked after we know the pages are Uptodate. | |
2648 | * | |
2649 | * Checking i_size after the check allows us to calculate | |
2650 | * the correct value for "nr", which means the zero-filled | |
2651 | * part of the page is not copied back to userspace (unless | |
2652 | * another truncate extends the file - this is desired though). | |
2653 | */ | |
2654 | isize = i_size_read(inode); | |
2655 | if (unlikely(iocb->ki_pos >= isize)) | |
2656 | goto put_pages; | |
06c04442 KO |
2657 | end_offset = min_t(loff_t, isize, iocb->ki_pos + iter->count); |
2658 | ||
06c04442 KO |
2659 | /* |
2660 | * Once we start copying data, we don't want to be touching any | |
2661 | * cachelines that might be contended: | |
2662 | */ | |
2663 | writably_mapped = mapping_writably_mapped(mapping); | |
2664 | ||
2665 | /* | |
2666 | * When a sequential read accesses a page several times, only | |
2667 | * mark it as accessed the first time. | |
2668 | */ | |
2669 | if (iocb->ki_pos >> PAGE_SHIFT != | |
2670 | ra->prev_pos >> PAGE_SHIFT) | |
ff993ba1 | 2671 | mark_page_accessed(pvec.pages[0]); |
06c04442 | 2672 | |
ff993ba1 | 2673 | for (i = 0; i < pagevec_count(&pvec); i++) { |
cbd59c48 MWO |
2674 | struct page *page = pvec.pages[i]; |
2675 | size_t page_size = thp_size(page); | |
2676 | size_t offset = iocb->ki_pos & (page_size - 1); | |
2677 | size_t bytes = min_t(loff_t, end_offset - iocb->ki_pos, | |
2678 | page_size - offset); | |
2679 | size_t copied; | |
06c04442 | 2680 | |
cbd59c48 MWO |
2681 | if (end_offset < page_offset(page)) |
2682 | break; | |
2683 | if (i > 0) | |
2684 | mark_page_accessed(page); | |
06c04442 KO |
2685 | /* |
2686 | * If users can be writing to this page using arbitrary | |
2687 | * virtual addresses, take care about potential aliasing | |
2688 | * before reading the page on the kernel side. | |
2689 | */ | |
cbd59c48 MWO |
2690 | if (writably_mapped) { |
2691 | int j; | |
2692 | ||
2693 | for (j = 0; j < thp_nr_pages(page); j++) | |
2694 | flush_dcache_page(page + j); | |
2695 | } | |
06c04442 | 2696 | |
cbd59c48 | 2697 | copied = copy_page_to_iter(page, offset, bytes, iter); |
06c04442 | 2698 | |
87fa0f3e | 2699 | already_read += copied; |
06c04442 KO |
2700 | iocb->ki_pos += copied; |
2701 | ra->prev_pos = iocb->ki_pos; | |
2702 | ||
2703 | if (copied < bytes) { | |
2704 | error = -EFAULT; | |
2705 | break; | |
2706 | } | |
1da177e4 | 2707 | } |
06c04442 | 2708 | put_pages: |
ff993ba1 MWO |
2709 | for (i = 0; i < pagevec_count(&pvec); i++) |
2710 | put_page(pvec.pages[i]); | |
cbd59c48 | 2711 | pagevec_reinit(&pvec); |
06c04442 | 2712 | } while (iov_iter_count(iter) && iocb->ki_pos < isize && !error); |
1da177e4 | 2713 | |
0c6aa263 | 2714 | file_accessed(filp); |
06c04442 | 2715 | |
87fa0f3e | 2716 | return already_read ? already_read : error; |
1da177e4 | 2717 | } |
87fa0f3e | 2718 | EXPORT_SYMBOL_GPL(filemap_read); |
1da177e4 | 2719 | |
485bb99b | 2720 | /** |
6abd2322 | 2721 | * generic_file_read_iter - generic filesystem read routine |
485bb99b | 2722 | * @iocb: kernel I/O control block |
6abd2322 | 2723 | * @iter: destination for the data read |
485bb99b | 2724 | * |
6abd2322 | 2725 | * This is the "read_iter()" routine for all filesystems |
1da177e4 | 2726 | * that can use the page cache directly. |
41da51bc AG |
2727 | * |
2728 | * The IOCB_NOWAIT flag in iocb->ki_flags indicates that -EAGAIN shall | |
2729 | * be returned when no data can be read without waiting for I/O requests | |
2730 | * to complete; it doesn't prevent readahead. | |
2731 | * | |
2732 | * The IOCB_NOIO flag in iocb->ki_flags indicates that no new I/O | |
2733 | * requests shall be made for the read or for readahead. When no data | |
2734 | * can be read, -EAGAIN shall be returned. When readahead would be | |
2735 | * triggered, a partial, possibly empty read shall be returned. | |
2736 | * | |
a862f68a MR |
2737 | * Return: |
2738 | * * number of bytes copied, even for partial reads | |
41da51bc | 2739 | * * negative error code (or 0 if IOCB_NOIO) if nothing was read |
1da177e4 LT |
2740 | */ |
2741 | ssize_t | |
ed978a81 | 2742 | generic_file_read_iter(struct kiocb *iocb, struct iov_iter *iter) |
1da177e4 | 2743 | { |
e7080a43 | 2744 | size_t count = iov_iter_count(iter); |
47c27bc4 | 2745 | ssize_t retval = 0; |
e7080a43 NS |
2746 | |
2747 | if (!count) | |
826ea860 | 2748 | return 0; /* skip atime */ |
1da177e4 | 2749 | |
2ba48ce5 | 2750 | if (iocb->ki_flags & IOCB_DIRECT) { |
47c27bc4 | 2751 | struct file *file = iocb->ki_filp; |
ed978a81 AV |
2752 | struct address_space *mapping = file->f_mapping; |
2753 | struct inode *inode = mapping->host; | |
1da177e4 | 2754 | |
6be96d3a | 2755 | if (iocb->ki_flags & IOCB_NOWAIT) { |
7a60d6d7 JA |
2756 | if (filemap_range_needs_writeback(mapping, iocb->ki_pos, |
2757 | iocb->ki_pos + count - 1)) | |
6be96d3a GR |
2758 | return -EAGAIN; |
2759 | } else { | |
2760 | retval = filemap_write_and_wait_range(mapping, | |
2761 | iocb->ki_pos, | |
2762 | iocb->ki_pos + count - 1); | |
2763 | if (retval < 0) | |
826ea860 | 2764 | return retval; |
6be96d3a | 2765 | } |
d8d3d94b | 2766 | |
0d5b0cf2 CH |
2767 | file_accessed(file); |
2768 | ||
5ecda137 | 2769 | retval = mapping->a_ops->direct_IO(iocb, iter); |
c3a69024 | 2770 | if (retval >= 0) { |
c64fb5c7 | 2771 | iocb->ki_pos += retval; |
5ecda137 | 2772 | count -= retval; |
9fe55eea | 2773 | } |
ab2125df PB |
2774 | if (retval != -EIOCBQUEUED) |
2775 | iov_iter_revert(iter, count - iov_iter_count(iter)); | |
66f998f6 | 2776 | |
9fe55eea SW |
2777 | /* |
2778 | * Btrfs can have a short DIO read if we encounter | |
2779 | * compressed extents, so if there was an error, or if | |
2780 | * we've already read everything we wanted to, or if | |
2781 | * there was a short read because we hit EOF, go ahead | |
2782 | * and return. Otherwise fallthrough to buffered io for | |
fbbbad4b MW |
2783 | * the rest of the read. Buffered reads will not work for |
2784 | * DAX files, so don't bother trying. | |
9fe55eea | 2785 | */ |
61d0017e JA |
2786 | if (retval < 0 || !count || IS_DAX(inode)) |
2787 | return retval; | |
2788 | if (iocb->ki_pos >= i_size_read(inode)) | |
826ea860 | 2789 | return retval; |
1da177e4 LT |
2790 | } |
2791 | ||
826ea860 | 2792 | return filemap_read(iocb, iter, retval); |
1da177e4 | 2793 | } |
ed978a81 | 2794 | EXPORT_SYMBOL(generic_file_read_iter); |
1da177e4 | 2795 | |
54fa39ac MWO |
2796 | static inline loff_t page_seek_hole_data(struct xa_state *xas, |
2797 | struct address_space *mapping, struct page *page, | |
2798 | loff_t start, loff_t end, bool seek_data) | |
41139aa4 | 2799 | { |
54fa39ac MWO |
2800 | const struct address_space_operations *ops = mapping->a_ops; |
2801 | size_t offset, bsz = i_blocksize(mapping->host); | |
2802 | ||
41139aa4 | 2803 | if (xa_is_value(page) || PageUptodate(page)) |
54fa39ac MWO |
2804 | return seek_data ? start : end; |
2805 | if (!ops->is_partially_uptodate) | |
2806 | return seek_data ? end : start; | |
2807 | ||
2808 | xas_pause(xas); | |
2809 | rcu_read_unlock(); | |
2810 | lock_page(page); | |
2811 | if (unlikely(page->mapping != mapping)) | |
2812 | goto unlock; | |
2813 | ||
2814 | offset = offset_in_thp(page, start) & ~(bsz - 1); | |
2815 | ||
2816 | do { | |
2817 | if (ops->is_partially_uptodate(page, offset, bsz) == seek_data) | |
2818 | break; | |
2819 | start = (start + bsz) & ~(bsz - 1); | |
2820 | offset += bsz; | |
2821 | } while (offset < thp_size(page)); | |
2822 | unlock: | |
2823 | unlock_page(page); | |
2824 | rcu_read_lock(); | |
2825 | return start; | |
41139aa4 MWO |
2826 | } |
2827 | ||
2828 | static inline | |
2829 | unsigned int seek_page_size(struct xa_state *xas, struct page *page) | |
2830 | { | |
2831 | if (xa_is_value(page)) | |
2832 | return PAGE_SIZE << xa_get_order(xas->xa, xas->xa_index); | |
2833 | return thp_size(page); | |
2834 | } | |
2835 | ||
2836 | /** | |
2837 | * mapping_seek_hole_data - Seek for SEEK_DATA / SEEK_HOLE in the page cache. | |
2838 | * @mapping: Address space to search. | |
2839 | * @start: First byte to consider. | |
2840 | * @end: Limit of search (exclusive). | |
2841 | * @whence: Either SEEK_HOLE or SEEK_DATA. | |
2842 | * | |
2843 | * If the page cache knows which blocks contain holes and which blocks | |
2844 | * contain data, your filesystem can use this function to implement | |
2845 | * SEEK_HOLE and SEEK_DATA. This is useful for filesystems which are | |
2846 | * entirely memory-based such as tmpfs, and filesystems which support | |
2847 | * unwritten extents. | |
2848 | * | |
f0953a1b | 2849 | * Return: The requested offset on success, or -ENXIO if @whence specifies |
41139aa4 MWO |
2850 | * SEEK_DATA and there is no data after @start. There is an implicit hole |
2851 | * after @end - 1, so SEEK_HOLE returns @end if all the bytes between @start | |
2852 | * and @end contain data. | |
2853 | */ | |
2854 | loff_t mapping_seek_hole_data(struct address_space *mapping, loff_t start, | |
2855 | loff_t end, int whence) | |
2856 | { | |
2857 | XA_STATE(xas, &mapping->i_pages, start >> PAGE_SHIFT); | |
ed98b015 | 2858 | pgoff_t max = (end - 1) >> PAGE_SHIFT; |
41139aa4 MWO |
2859 | bool seek_data = (whence == SEEK_DATA); |
2860 | struct page *page; | |
2861 | ||
2862 | if (end <= start) | |
2863 | return -ENXIO; | |
2864 | ||
2865 | rcu_read_lock(); | |
2866 | while ((page = find_get_entry(&xas, max, XA_PRESENT))) { | |
ed98b015 HD |
2867 | loff_t pos = (u64)xas.xa_index << PAGE_SHIFT; |
2868 | unsigned int seek_size; | |
41139aa4 MWO |
2869 | |
2870 | if (start < pos) { | |
2871 | if (!seek_data) | |
2872 | goto unlock; | |
2873 | start = pos; | |
2874 | } | |
2875 | ||
ed98b015 HD |
2876 | seek_size = seek_page_size(&xas, page); |
2877 | pos = round_up(pos + 1, seek_size); | |
54fa39ac MWO |
2878 | start = page_seek_hole_data(&xas, mapping, page, start, pos, |
2879 | seek_data); | |
2880 | if (start < pos) | |
41139aa4 | 2881 | goto unlock; |
ed98b015 HD |
2882 | if (start >= end) |
2883 | break; | |
2884 | if (seek_size > PAGE_SIZE) | |
2885 | xas_set(&xas, pos >> PAGE_SHIFT); | |
41139aa4 MWO |
2886 | if (!xa_is_value(page)) |
2887 | put_page(page); | |
2888 | } | |
41139aa4 | 2889 | if (seek_data) |
ed98b015 | 2890 | start = -ENXIO; |
41139aa4 MWO |
2891 | unlock: |
2892 | rcu_read_unlock(); | |
ed98b015 | 2893 | if (page && !xa_is_value(page)) |
41139aa4 | 2894 | put_page(page); |
41139aa4 MWO |
2895 | if (start > end) |
2896 | return end; | |
2897 | return start; | |
2898 | } | |
2899 | ||
1da177e4 | 2900 | #ifdef CONFIG_MMU |
1da177e4 | 2901 | #define MMAP_LOTSAMISS (100) |
6b4c9f44 | 2902 | /* |
c1e8d7c6 | 2903 | * lock_page_maybe_drop_mmap - lock the page, possibly dropping the mmap_lock |
6b4c9f44 JB |
2904 | * @vmf - the vm_fault for this fault. |
2905 | * @page - the page to lock. | |
2906 | * @fpin - the pointer to the file we may pin (or is already pinned). | |
2907 | * | |
c1e8d7c6 | 2908 | * This works similar to lock_page_or_retry in that it can drop the mmap_lock. |
6b4c9f44 | 2909 | * It differs in that it actually returns the page locked if it returns 1 and 0 |
c1e8d7c6 | 2910 | * if it couldn't lock the page. If we did have to drop the mmap_lock then fpin |
6b4c9f44 JB |
2911 | * will point to the pinned file and needs to be fput()'ed at a later point. |
2912 | */ | |
2913 | static int lock_page_maybe_drop_mmap(struct vm_fault *vmf, struct page *page, | |
2914 | struct file **fpin) | |
2915 | { | |
7c23c782 MWO |
2916 | struct folio *folio = page_folio(page); |
2917 | ||
2918 | if (folio_trylock(folio)) | |
6b4c9f44 JB |
2919 | return 1; |
2920 | ||
8b0f9fa2 LT |
2921 | /* |
2922 | * NOTE! This will make us return with VM_FAULT_RETRY, but with | |
c1e8d7c6 | 2923 | * the mmap_lock still held. That's how FAULT_FLAG_RETRY_NOWAIT |
8b0f9fa2 LT |
2924 | * is supposed to work. We have way too many special cases.. |
2925 | */ | |
6b4c9f44 JB |
2926 | if (vmf->flags & FAULT_FLAG_RETRY_NOWAIT) |
2927 | return 0; | |
2928 | ||
2929 | *fpin = maybe_unlock_mmap_for_io(vmf, *fpin); | |
2930 | if (vmf->flags & FAULT_FLAG_KILLABLE) { | |
af7f29d9 | 2931 | if (__folio_lock_killable(folio)) { |
6b4c9f44 | 2932 | /* |
c1e8d7c6 | 2933 | * We didn't have the right flags to drop the mmap_lock, |
6b4c9f44 JB |
2934 | * but all fault_handlers only check for fatal signals |
2935 | * if we return VM_FAULT_RETRY, so we need to drop the | |
c1e8d7c6 | 2936 | * mmap_lock here and return 0 if we don't have a fpin. |
6b4c9f44 JB |
2937 | */ |
2938 | if (*fpin == NULL) | |
d8ed45c5 | 2939 | mmap_read_unlock(vmf->vma->vm_mm); |
6b4c9f44 JB |
2940 | return 0; |
2941 | } | |
2942 | } else | |
7c23c782 MWO |
2943 | __folio_lock(folio); |
2944 | ||
6b4c9f44 JB |
2945 | return 1; |
2946 | } | |
2947 | ||
ef00e08e | 2948 | /* |
6b4c9f44 JB |
2949 | * Synchronous readahead happens when we don't even find a page in the page |
2950 | * cache at all. We don't want to perform IO under the mmap sem, so if we have | |
2951 | * to drop the mmap sem we return the file that was pinned in order for us to do | |
2952 | * that. If we didn't pin a file then we return NULL. The file that is | |
2953 | * returned needs to be fput()'ed when we're done with it. | |
ef00e08e | 2954 | */ |
6b4c9f44 | 2955 | static struct file *do_sync_mmap_readahead(struct vm_fault *vmf) |
ef00e08e | 2956 | { |
2a1180f1 JB |
2957 | struct file *file = vmf->vma->vm_file; |
2958 | struct file_ra_state *ra = &file->f_ra; | |
ef00e08e | 2959 | struct address_space *mapping = file->f_mapping; |
fcd9ae4f | 2960 | DEFINE_READAHEAD(ractl, file, ra, mapping, vmf->pgoff); |
6b4c9f44 | 2961 | struct file *fpin = NULL; |
e630bfac | 2962 | unsigned int mmap_miss; |
ef00e08e LT |
2963 | |
2964 | /* If we don't want any read-ahead, don't bother */ | |
2a1180f1 | 2965 | if (vmf->vma->vm_flags & VM_RAND_READ) |
6b4c9f44 | 2966 | return fpin; |
275b12bf | 2967 | if (!ra->ra_pages) |
6b4c9f44 | 2968 | return fpin; |
ef00e08e | 2969 | |
2a1180f1 | 2970 | if (vmf->vma->vm_flags & VM_SEQ_READ) { |
6b4c9f44 | 2971 | fpin = maybe_unlock_mmap_for_io(vmf, fpin); |
fcd9ae4f | 2972 | page_cache_sync_ra(&ractl, ra->ra_pages); |
6b4c9f44 | 2973 | return fpin; |
ef00e08e LT |
2974 | } |
2975 | ||
207d04ba | 2976 | /* Avoid banging the cache line if not needed */ |
e630bfac KS |
2977 | mmap_miss = READ_ONCE(ra->mmap_miss); |
2978 | if (mmap_miss < MMAP_LOTSAMISS * 10) | |
2979 | WRITE_ONCE(ra->mmap_miss, ++mmap_miss); | |
ef00e08e LT |
2980 | |
2981 | /* | |
2982 | * Do we miss much more than hit in this file? If so, | |
2983 | * stop bothering with read-ahead. It will only hurt. | |
2984 | */ | |
e630bfac | 2985 | if (mmap_miss > MMAP_LOTSAMISS) |
6b4c9f44 | 2986 | return fpin; |
ef00e08e | 2987 | |
d30a1100 WF |
2988 | /* |
2989 | * mmap read-around | |
2990 | */ | |
6b4c9f44 | 2991 | fpin = maybe_unlock_mmap_for_io(vmf, fpin); |
db660d46 | 2992 | ra->start = max_t(long, 0, vmf->pgoff - ra->ra_pages / 2); |
600e19af RG |
2993 | ra->size = ra->ra_pages; |
2994 | ra->async_size = ra->ra_pages / 4; | |
db660d46 DH |
2995 | ractl._index = ra->start; |
2996 | do_page_cache_ra(&ractl, ra->size, ra->async_size); | |
6b4c9f44 | 2997 | return fpin; |
ef00e08e LT |
2998 | } |
2999 | ||
3000 | /* | |
3001 | * Asynchronous readahead happens when we find the page and PG_readahead, | |
6b4c9f44 | 3002 | * so we want to possibly extend the readahead further. We return the file that |
c1e8d7c6 | 3003 | * was pinned if we have to drop the mmap_lock in order to do IO. |
ef00e08e | 3004 | */ |
6b4c9f44 JB |
3005 | static struct file *do_async_mmap_readahead(struct vm_fault *vmf, |
3006 | struct page *page) | |
ef00e08e | 3007 | { |
2a1180f1 JB |
3008 | struct file *file = vmf->vma->vm_file; |
3009 | struct file_ra_state *ra = &file->f_ra; | |
ef00e08e | 3010 | struct address_space *mapping = file->f_mapping; |
6b4c9f44 | 3011 | struct file *fpin = NULL; |
e630bfac | 3012 | unsigned int mmap_miss; |
2a1180f1 | 3013 | pgoff_t offset = vmf->pgoff; |
ef00e08e LT |
3014 | |
3015 | /* If we don't want any read-ahead, don't bother */ | |
5c72feee | 3016 | if (vmf->vma->vm_flags & VM_RAND_READ || !ra->ra_pages) |
6b4c9f44 | 3017 | return fpin; |
e630bfac KS |
3018 | mmap_miss = READ_ONCE(ra->mmap_miss); |
3019 | if (mmap_miss) | |
3020 | WRITE_ONCE(ra->mmap_miss, --mmap_miss); | |
6b4c9f44 JB |
3021 | if (PageReadahead(page)) { |
3022 | fpin = maybe_unlock_mmap_for_io(vmf, fpin); | |
2fad6f5d WF |
3023 | page_cache_async_readahead(mapping, ra, file, |
3024 | page, offset, ra->ra_pages); | |
6b4c9f44 JB |
3025 | } |
3026 | return fpin; | |
ef00e08e LT |
3027 | } |
3028 | ||
485bb99b | 3029 | /** |
54cb8821 | 3030 | * filemap_fault - read in file data for page fault handling |
d0217ac0 | 3031 | * @vmf: struct vm_fault containing details of the fault |
485bb99b | 3032 | * |
54cb8821 | 3033 | * filemap_fault() is invoked via the vma operations vector for a |
1da177e4 LT |
3034 | * mapped memory region to read in file data during a page fault. |
3035 | * | |
3036 | * The goto's are kind of ugly, but this streamlines the normal case of having | |
3037 | * it in the page cache, and handles the special cases reasonably without | |
3038 | * having a lot of duplicated code. | |
9a95f3cf | 3039 | * |
c1e8d7c6 | 3040 | * vma->vm_mm->mmap_lock must be held on entry. |
9a95f3cf | 3041 | * |
c1e8d7c6 | 3042 | * If our return value has VM_FAULT_RETRY set, it's because the mmap_lock |
a4985833 | 3043 | * may be dropped before doing I/O or by lock_page_maybe_drop_mmap(). |
9a95f3cf | 3044 | * |
c1e8d7c6 | 3045 | * If our return value does not have VM_FAULT_RETRY set, the mmap_lock |
9a95f3cf PC |
3046 | * has not been released. |
3047 | * | |
3048 | * We never return with VM_FAULT_RETRY and a bit from VM_FAULT_ERROR set. | |
a862f68a MR |
3049 | * |
3050 | * Return: bitwise-OR of %VM_FAULT_ codes. | |
1da177e4 | 3051 | */ |
2bcd6454 | 3052 | vm_fault_t filemap_fault(struct vm_fault *vmf) |
1da177e4 LT |
3053 | { |
3054 | int error; | |
11bac800 | 3055 | struct file *file = vmf->vma->vm_file; |
6b4c9f44 | 3056 | struct file *fpin = NULL; |
1da177e4 | 3057 | struct address_space *mapping = file->f_mapping; |
1da177e4 | 3058 | struct inode *inode = mapping->host; |
ef00e08e | 3059 | pgoff_t offset = vmf->pgoff; |
9ab2594f | 3060 | pgoff_t max_off; |
1da177e4 | 3061 | struct page *page; |
2bcd6454 | 3062 | vm_fault_t ret = 0; |
730633f0 | 3063 | bool mapping_locked = false; |
1da177e4 | 3064 | |
9ab2594f MW |
3065 | max_off = DIV_ROUND_UP(i_size_read(inode), PAGE_SIZE); |
3066 | if (unlikely(offset >= max_off)) | |
5307cc1a | 3067 | return VM_FAULT_SIGBUS; |
1da177e4 | 3068 | |
1da177e4 | 3069 | /* |
49426420 | 3070 | * Do we have something in the page cache already? |
1da177e4 | 3071 | */ |
ef00e08e | 3072 | page = find_get_page(mapping, offset); |
730633f0 | 3073 | if (likely(page)) { |
1da177e4 | 3074 | /* |
730633f0 JK |
3075 | * We found the page, so try async readahead before waiting for |
3076 | * the lock. | |
1da177e4 | 3077 | */ |
730633f0 JK |
3078 | if (!(vmf->flags & FAULT_FLAG_TRIED)) |
3079 | fpin = do_async_mmap_readahead(vmf, page); | |
3080 | if (unlikely(!PageUptodate(page))) { | |
3081 | filemap_invalidate_lock_shared(mapping); | |
3082 | mapping_locked = true; | |
3083 | } | |
3084 | } else { | |
ef00e08e | 3085 | /* No page in the page cache at all */ |
ef00e08e | 3086 | count_vm_event(PGMAJFAULT); |
2262185c | 3087 | count_memcg_event_mm(vmf->vma->vm_mm, PGMAJFAULT); |
ef00e08e | 3088 | ret = VM_FAULT_MAJOR; |
6b4c9f44 | 3089 | fpin = do_sync_mmap_readahead(vmf); |
ef00e08e | 3090 | retry_find: |
730633f0 JK |
3091 | /* |
3092 | * See comment in filemap_create_page() why we need | |
3093 | * invalidate_lock | |
3094 | */ | |
3095 | if (!mapping_locked) { | |
3096 | filemap_invalidate_lock_shared(mapping); | |
3097 | mapping_locked = true; | |
3098 | } | |
a75d4c33 JB |
3099 | page = pagecache_get_page(mapping, offset, |
3100 | FGP_CREAT|FGP_FOR_MMAP, | |
3101 | vmf->gfp_mask); | |
6b4c9f44 JB |
3102 | if (!page) { |
3103 | if (fpin) | |
3104 | goto out_retry; | |
730633f0 | 3105 | filemap_invalidate_unlock_shared(mapping); |
e520e932 | 3106 | return VM_FAULT_OOM; |
6b4c9f44 | 3107 | } |
1da177e4 LT |
3108 | } |
3109 | ||
6b4c9f44 JB |
3110 | if (!lock_page_maybe_drop_mmap(vmf, page, &fpin)) |
3111 | goto out_retry; | |
b522c94d ML |
3112 | |
3113 | /* Did it get truncated? */ | |
585e5a7b | 3114 | if (unlikely(compound_head(page)->mapping != mapping)) { |
b522c94d ML |
3115 | unlock_page(page); |
3116 | put_page(page); | |
3117 | goto retry_find; | |
3118 | } | |
520e5ba4 | 3119 | VM_BUG_ON_PAGE(page_to_pgoff(page) != offset, page); |
b522c94d | 3120 | |
1da177e4 | 3121 | /* |
d00806b1 NP |
3122 | * We have a locked page in the page cache, now we need to check |
3123 | * that it's up-to-date. If not, it is going to be due to an error. | |
1da177e4 | 3124 | */ |
730633f0 JK |
3125 | if (unlikely(!PageUptodate(page))) { |
3126 | /* | |
3127 | * The page was in cache and uptodate and now it is not. | |
3128 | * Strange but possible since we didn't hold the page lock all | |
3129 | * the time. Let's drop everything get the invalidate lock and | |
3130 | * try again. | |
3131 | */ | |
3132 | if (!mapping_locked) { | |
3133 | unlock_page(page); | |
3134 | put_page(page); | |
3135 | goto retry_find; | |
3136 | } | |
1da177e4 | 3137 | goto page_not_uptodate; |
730633f0 | 3138 | } |
1da177e4 | 3139 | |
6b4c9f44 | 3140 | /* |
c1e8d7c6 | 3141 | * We've made it this far and we had to drop our mmap_lock, now is the |
6b4c9f44 JB |
3142 | * time to return to the upper layer and have it re-find the vma and |
3143 | * redo the fault. | |
3144 | */ | |
3145 | if (fpin) { | |
3146 | unlock_page(page); | |
3147 | goto out_retry; | |
3148 | } | |
730633f0 JK |
3149 | if (mapping_locked) |
3150 | filemap_invalidate_unlock_shared(mapping); | |
6b4c9f44 | 3151 | |
ef00e08e LT |
3152 | /* |
3153 | * Found the page and have a reference on it. | |
3154 | * We must recheck i_size under page lock. | |
3155 | */ | |
9ab2594f MW |
3156 | max_off = DIV_ROUND_UP(i_size_read(inode), PAGE_SIZE); |
3157 | if (unlikely(offset >= max_off)) { | |
d00806b1 | 3158 | unlock_page(page); |
09cbfeaf | 3159 | put_page(page); |
5307cc1a | 3160 | return VM_FAULT_SIGBUS; |
d00806b1 NP |
3161 | } |
3162 | ||
d0217ac0 | 3163 | vmf->page = page; |
83c54070 | 3164 | return ret | VM_FAULT_LOCKED; |
1da177e4 | 3165 | |
1da177e4 | 3166 | page_not_uptodate: |
1da177e4 LT |
3167 | /* |
3168 | * Umm, take care of errors if the page isn't up-to-date. | |
3169 | * Try to re-read it _once_. We do this synchronously, | |
3170 | * because there really aren't any performance issues here | |
3171 | * and we need to check for errors. | |
3172 | */ | |
6b4c9f44 | 3173 | fpin = maybe_unlock_mmap_for_io(vmf, fpin); |
d31fa86a | 3174 | error = filemap_read_page(file, mapping, page); |
6b4c9f44 JB |
3175 | if (fpin) |
3176 | goto out_retry; | |
09cbfeaf | 3177 | put_page(page); |
d00806b1 NP |
3178 | |
3179 | if (!error || error == AOP_TRUNCATED_PAGE) | |
994fc28c | 3180 | goto retry_find; |
730633f0 | 3181 | filemap_invalidate_unlock_shared(mapping); |
1da177e4 | 3182 | |
d0217ac0 | 3183 | return VM_FAULT_SIGBUS; |
6b4c9f44 JB |
3184 | |
3185 | out_retry: | |
3186 | /* | |
c1e8d7c6 | 3187 | * We dropped the mmap_lock, we need to return to the fault handler to |
6b4c9f44 JB |
3188 | * re-find the vma and come back and find our hopefully still populated |
3189 | * page. | |
3190 | */ | |
3191 | if (page) | |
3192 | put_page(page); | |
730633f0 JK |
3193 | if (mapping_locked) |
3194 | filemap_invalidate_unlock_shared(mapping); | |
6b4c9f44 JB |
3195 | if (fpin) |
3196 | fput(fpin); | |
3197 | return ret | VM_FAULT_RETRY; | |
54cb8821 NP |
3198 | } |
3199 | EXPORT_SYMBOL(filemap_fault); | |
3200 | ||
f9ce0be7 | 3201 | static bool filemap_map_pmd(struct vm_fault *vmf, struct page *page) |
f1820361 | 3202 | { |
f9ce0be7 KS |
3203 | struct mm_struct *mm = vmf->vma->vm_mm; |
3204 | ||
3205 | /* Huge page is mapped? No need to proceed. */ | |
3206 | if (pmd_trans_huge(*vmf->pmd)) { | |
3207 | unlock_page(page); | |
3208 | put_page(page); | |
3209 | return true; | |
3210 | } | |
3211 | ||
3212 | if (pmd_none(*vmf->pmd) && PageTransHuge(page)) { | |
e0f43fa5 YS |
3213 | vm_fault_t ret = do_set_pmd(vmf, page); |
3214 | if (!ret) { | |
3215 | /* The page is mapped successfully, reference consumed. */ | |
3216 | unlock_page(page); | |
3217 | return true; | |
f9ce0be7 | 3218 | } |
f9ce0be7 KS |
3219 | } |
3220 | ||
03c4f204 QZ |
3221 | if (pmd_none(*vmf->pmd)) |
3222 | pmd_install(mm, vmf->pmd, &vmf->prealloc_pte); | |
f9ce0be7 KS |
3223 | |
3224 | /* See comment in handle_pte_fault() */ | |
3225 | if (pmd_devmap_trans_unstable(vmf->pmd)) { | |
3226 | unlock_page(page); | |
3227 | put_page(page); | |
3228 | return true; | |
3229 | } | |
3230 | ||
3231 | return false; | |
3232 | } | |
3233 | ||
3234 | static struct page *next_uptodate_page(struct page *page, | |
3235 | struct address_space *mapping, | |
3236 | struct xa_state *xas, pgoff_t end_pgoff) | |
3237 | { | |
3238 | unsigned long max_idx; | |
3239 | ||
3240 | do { | |
3241 | if (!page) | |
3242 | return NULL; | |
3243 | if (xas_retry(xas, page)) | |
3244 | continue; | |
3245 | if (xa_is_value(page)) | |
3246 | continue; | |
3247 | if (PageLocked(page)) | |
3248 | continue; | |
3249 | if (!page_cache_get_speculative(page)) | |
3250 | continue; | |
3251 | /* Has the page moved or been split? */ | |
3252 | if (unlikely(page != xas_reload(xas))) | |
3253 | goto skip; | |
3254 | if (!PageUptodate(page) || PageReadahead(page)) | |
3255 | goto skip; | |
3256 | if (PageHWPoison(page)) | |
3257 | goto skip; | |
3258 | if (!trylock_page(page)) | |
3259 | goto skip; | |
3260 | if (page->mapping != mapping) | |
3261 | goto unlock; | |
3262 | if (!PageUptodate(page)) | |
3263 | goto unlock; | |
3264 | max_idx = DIV_ROUND_UP(i_size_read(mapping->host), PAGE_SIZE); | |
3265 | if (xas->xa_index >= max_idx) | |
3266 | goto unlock; | |
3267 | return page; | |
3268 | unlock: | |
3269 | unlock_page(page); | |
3270 | skip: | |
3271 | put_page(page); | |
3272 | } while ((page = xas_next_entry(xas, end_pgoff)) != NULL); | |
3273 | ||
3274 | return NULL; | |
3275 | } | |
3276 | ||
3277 | static inline struct page *first_map_page(struct address_space *mapping, | |
3278 | struct xa_state *xas, | |
3279 | pgoff_t end_pgoff) | |
3280 | { | |
3281 | return next_uptodate_page(xas_find(xas, end_pgoff), | |
3282 | mapping, xas, end_pgoff); | |
3283 | } | |
3284 | ||
3285 | static inline struct page *next_map_page(struct address_space *mapping, | |
3286 | struct xa_state *xas, | |
3287 | pgoff_t end_pgoff) | |
3288 | { | |
3289 | return next_uptodate_page(xas_next_entry(xas, end_pgoff), | |
3290 | mapping, xas, end_pgoff); | |
3291 | } | |
3292 | ||
3293 | vm_fault_t filemap_map_pages(struct vm_fault *vmf, | |
3294 | pgoff_t start_pgoff, pgoff_t end_pgoff) | |
3295 | { | |
3296 | struct vm_area_struct *vma = vmf->vma; | |
3297 | struct file *file = vma->vm_file; | |
f1820361 | 3298 | struct address_space *mapping = file->f_mapping; |
bae473a4 | 3299 | pgoff_t last_pgoff = start_pgoff; |
9d3af4b4 | 3300 | unsigned long addr; |
070e807c | 3301 | XA_STATE(xas, &mapping->i_pages, start_pgoff); |
27a83a60 | 3302 | struct page *head, *page; |
e630bfac | 3303 | unsigned int mmap_miss = READ_ONCE(file->f_ra.mmap_miss); |
f9ce0be7 | 3304 | vm_fault_t ret = 0; |
f1820361 KS |
3305 | |
3306 | rcu_read_lock(); | |
f9ce0be7 KS |
3307 | head = first_map_page(mapping, &xas, end_pgoff); |
3308 | if (!head) | |
3309 | goto out; | |
f1820361 | 3310 | |
f9ce0be7 KS |
3311 | if (filemap_map_pmd(vmf, head)) { |
3312 | ret = VM_FAULT_NOPAGE; | |
3313 | goto out; | |
3314 | } | |
f1820361 | 3315 | |
9d3af4b4 WD |
3316 | addr = vma->vm_start + ((start_pgoff - vma->vm_pgoff) << PAGE_SHIFT); |
3317 | vmf->pte = pte_offset_map_lock(vma->vm_mm, vmf->pmd, addr, &vmf->ptl); | |
f9ce0be7 | 3318 | do { |
27a83a60 | 3319 | page = find_subpage(head, xas.xa_index); |
f9ce0be7 | 3320 | if (PageHWPoison(page)) |
f1820361 KS |
3321 | goto unlock; |
3322 | ||
e630bfac KS |
3323 | if (mmap_miss > 0) |
3324 | mmap_miss--; | |
7267ec00 | 3325 | |
9d3af4b4 | 3326 | addr += (xas.xa_index - last_pgoff) << PAGE_SHIFT; |
f9ce0be7 | 3327 | vmf->pte += xas.xa_index - last_pgoff; |
070e807c | 3328 | last_pgoff = xas.xa_index; |
f9ce0be7 KS |
3329 | |
3330 | if (!pte_none(*vmf->pte)) | |
7267ec00 | 3331 | goto unlock; |
f9ce0be7 | 3332 | |
46bdb427 | 3333 | /* We're about to handle the fault */ |
9d3af4b4 | 3334 | if (vmf->address == addr) |
46bdb427 | 3335 | ret = VM_FAULT_NOPAGE; |
46bdb427 | 3336 | |
9d3af4b4 | 3337 | do_set_pte(vmf, page, addr); |
f9ce0be7 | 3338 | /* no need to invalidate: a not-present page won't be cached */ |
9d3af4b4 | 3339 | update_mmu_cache(vma, addr, vmf->pte); |
27a83a60 | 3340 | unlock_page(head); |
f9ce0be7 | 3341 | continue; |
f1820361 | 3342 | unlock: |
27a83a60 | 3343 | unlock_page(head); |
27a83a60 | 3344 | put_page(head); |
f9ce0be7 KS |
3345 | } while ((head = next_map_page(mapping, &xas, end_pgoff)) != NULL); |
3346 | pte_unmap_unlock(vmf->pte, vmf->ptl); | |
3347 | out: | |
f1820361 | 3348 | rcu_read_unlock(); |
e630bfac | 3349 | WRITE_ONCE(file->f_ra.mmap_miss, mmap_miss); |
f9ce0be7 | 3350 | return ret; |
f1820361 KS |
3351 | } |
3352 | EXPORT_SYMBOL(filemap_map_pages); | |
3353 | ||
2bcd6454 | 3354 | vm_fault_t filemap_page_mkwrite(struct vm_fault *vmf) |
4fcf1c62 | 3355 | { |
5df1a672 | 3356 | struct address_space *mapping = vmf->vma->vm_file->f_mapping; |
4fcf1c62 | 3357 | struct page *page = vmf->page; |
2bcd6454 | 3358 | vm_fault_t ret = VM_FAULT_LOCKED; |
4fcf1c62 | 3359 | |
5df1a672 | 3360 | sb_start_pagefault(mapping->host->i_sb); |
11bac800 | 3361 | file_update_time(vmf->vma->vm_file); |
4fcf1c62 | 3362 | lock_page(page); |
5df1a672 | 3363 | if (page->mapping != mapping) { |
4fcf1c62 JK |
3364 | unlock_page(page); |
3365 | ret = VM_FAULT_NOPAGE; | |
3366 | goto out; | |
3367 | } | |
14da9200 JK |
3368 | /* |
3369 | * We mark the page dirty already here so that when freeze is in | |
3370 | * progress, we are guaranteed that writeback during freezing will | |
3371 | * see the dirty page and writeprotect it again. | |
3372 | */ | |
3373 | set_page_dirty(page); | |
1d1d1a76 | 3374 | wait_for_stable_page(page); |
4fcf1c62 | 3375 | out: |
5df1a672 | 3376 | sb_end_pagefault(mapping->host->i_sb); |
4fcf1c62 JK |
3377 | return ret; |
3378 | } | |
4fcf1c62 | 3379 | |
f0f37e2f | 3380 | const struct vm_operations_struct generic_file_vm_ops = { |
54cb8821 | 3381 | .fault = filemap_fault, |
f1820361 | 3382 | .map_pages = filemap_map_pages, |
4fcf1c62 | 3383 | .page_mkwrite = filemap_page_mkwrite, |
1da177e4 LT |
3384 | }; |
3385 | ||
3386 | /* This is used for a general mmap of a disk file */ | |
3387 | ||
68d68ff6 | 3388 | int generic_file_mmap(struct file *file, struct vm_area_struct *vma) |
1da177e4 LT |
3389 | { |
3390 | struct address_space *mapping = file->f_mapping; | |
3391 | ||
3392 | if (!mapping->a_ops->readpage) | |
3393 | return -ENOEXEC; | |
3394 | file_accessed(file); | |
3395 | vma->vm_ops = &generic_file_vm_ops; | |
3396 | return 0; | |
3397 | } | |
1da177e4 LT |
3398 | |
3399 | /* | |
3400 | * This is for filesystems which do not implement ->writepage. | |
3401 | */ | |
3402 | int generic_file_readonly_mmap(struct file *file, struct vm_area_struct *vma) | |
3403 | { | |
3404 | if ((vma->vm_flags & VM_SHARED) && (vma->vm_flags & VM_MAYWRITE)) | |
3405 | return -EINVAL; | |
3406 | return generic_file_mmap(file, vma); | |
3407 | } | |
3408 | #else | |
4b96a37d | 3409 | vm_fault_t filemap_page_mkwrite(struct vm_fault *vmf) |
45397228 | 3410 | { |
4b96a37d | 3411 | return VM_FAULT_SIGBUS; |
45397228 | 3412 | } |
68d68ff6 | 3413 | int generic_file_mmap(struct file *file, struct vm_area_struct *vma) |
1da177e4 LT |
3414 | { |
3415 | return -ENOSYS; | |
3416 | } | |
68d68ff6 | 3417 | int generic_file_readonly_mmap(struct file *file, struct vm_area_struct *vma) |
1da177e4 LT |
3418 | { |
3419 | return -ENOSYS; | |
3420 | } | |
3421 | #endif /* CONFIG_MMU */ | |
3422 | ||
45397228 | 3423 | EXPORT_SYMBOL(filemap_page_mkwrite); |
1da177e4 LT |
3424 | EXPORT_SYMBOL(generic_file_mmap); |
3425 | EXPORT_SYMBOL(generic_file_readonly_mmap); | |
3426 | ||
67f9fd91 SL |
3427 | static struct page *wait_on_page_read(struct page *page) |
3428 | { | |
3429 | if (!IS_ERR(page)) { | |
3430 | wait_on_page_locked(page); | |
3431 | if (!PageUptodate(page)) { | |
09cbfeaf | 3432 | put_page(page); |
67f9fd91 SL |
3433 | page = ERR_PTR(-EIO); |
3434 | } | |
3435 | } | |
3436 | return page; | |
3437 | } | |
3438 | ||
32b63529 | 3439 | static struct page *do_read_cache_page(struct address_space *mapping, |
57f6b96c | 3440 | pgoff_t index, |
5e5358e7 | 3441 | int (*filler)(void *, struct page *), |
0531b2aa LT |
3442 | void *data, |
3443 | gfp_t gfp) | |
1da177e4 | 3444 | { |
eb2be189 | 3445 | struct page *page; |
1da177e4 LT |
3446 | int err; |
3447 | repeat: | |
3448 | page = find_get_page(mapping, index); | |
3449 | if (!page) { | |
453f85d4 | 3450 | page = __page_cache_alloc(gfp); |
eb2be189 NP |
3451 | if (!page) |
3452 | return ERR_PTR(-ENOMEM); | |
e6f67b8c | 3453 | err = add_to_page_cache_lru(page, mapping, index, gfp); |
eb2be189 | 3454 | if (unlikely(err)) { |
09cbfeaf | 3455 | put_page(page); |
eb2be189 NP |
3456 | if (err == -EEXIST) |
3457 | goto repeat; | |
22ecdb4f | 3458 | /* Presumably ENOMEM for xarray node */ |
1da177e4 LT |
3459 | return ERR_PTR(err); |
3460 | } | |
32b63529 MG |
3461 | |
3462 | filler: | |
6c45b454 CH |
3463 | if (filler) |
3464 | err = filler(data, page); | |
3465 | else | |
3466 | err = mapping->a_ops->readpage(data, page); | |
3467 | ||
1da177e4 | 3468 | if (err < 0) { |
09cbfeaf | 3469 | put_page(page); |
32b63529 | 3470 | return ERR_PTR(err); |
1da177e4 | 3471 | } |
1da177e4 | 3472 | |
32b63529 MG |
3473 | page = wait_on_page_read(page); |
3474 | if (IS_ERR(page)) | |
3475 | return page; | |
3476 | goto out; | |
3477 | } | |
1da177e4 LT |
3478 | if (PageUptodate(page)) |
3479 | goto out; | |
3480 | ||
ebded027 | 3481 | /* |
0e9aa675 | 3482 | * Page is not up to date and may be locked due to one of the following |
ebded027 MG |
3483 | * case a: Page is being filled and the page lock is held |
3484 | * case b: Read/write error clearing the page uptodate status | |
3485 | * case c: Truncation in progress (page locked) | |
3486 | * case d: Reclaim in progress | |
3487 | * | |
3488 | * Case a, the page will be up to date when the page is unlocked. | |
3489 | * There is no need to serialise on the page lock here as the page | |
3490 | * is pinned so the lock gives no additional protection. Even if the | |
ce89fddf | 3491 | * page is truncated, the data is still valid if PageUptodate as |
ebded027 MG |
3492 | * it's a race vs truncate race. |
3493 | * Case b, the page will not be up to date | |
3494 | * Case c, the page may be truncated but in itself, the data may still | |
3495 | * be valid after IO completes as it's a read vs truncate race. The | |
3496 | * operation must restart if the page is not uptodate on unlock but | |
3497 | * otherwise serialising on page lock to stabilise the mapping gives | |
3498 | * no additional guarantees to the caller as the page lock is | |
3499 | * released before return. | |
3500 | * Case d, similar to truncation. If reclaim holds the page lock, it | |
3501 | * will be a race with remove_mapping that determines if the mapping | |
3502 | * is valid on unlock but otherwise the data is valid and there is | |
3503 | * no need to serialise with page lock. | |
3504 | * | |
3505 | * As the page lock gives no additional guarantee, we optimistically | |
3506 | * wait on the page to be unlocked and check if it's up to date and | |
3507 | * use the page if it is. Otherwise, the page lock is required to | |
3508 | * distinguish between the different cases. The motivation is that we | |
3509 | * avoid spurious serialisations and wakeups when multiple processes | |
3510 | * wait on the same page for IO to complete. | |
3511 | */ | |
3512 | wait_on_page_locked(page); | |
3513 | if (PageUptodate(page)) | |
3514 | goto out; | |
3515 | ||
3516 | /* Distinguish between all the cases under the safety of the lock */ | |
1da177e4 | 3517 | lock_page(page); |
ebded027 MG |
3518 | |
3519 | /* Case c or d, restart the operation */ | |
1da177e4 LT |
3520 | if (!page->mapping) { |
3521 | unlock_page(page); | |
09cbfeaf | 3522 | put_page(page); |
32b63529 | 3523 | goto repeat; |
1da177e4 | 3524 | } |
ebded027 MG |
3525 | |
3526 | /* Someone else locked and filled the page in a very small window */ | |
1da177e4 LT |
3527 | if (PageUptodate(page)) { |
3528 | unlock_page(page); | |
3529 | goto out; | |
3530 | } | |
faffdfa0 XT |
3531 | |
3532 | /* | |
3533 | * A previous I/O error may have been due to temporary | |
3534 | * failures. | |
3535 | * Clear page error before actual read, PG_error will be | |
3536 | * set again if read page fails. | |
3537 | */ | |
3538 | ClearPageError(page); | |
32b63529 MG |
3539 | goto filler; |
3540 | ||
c855ff37 | 3541 | out: |
6fe6900e NP |
3542 | mark_page_accessed(page); |
3543 | return page; | |
3544 | } | |
0531b2aa LT |
3545 | |
3546 | /** | |
67f9fd91 | 3547 | * read_cache_page - read into page cache, fill it if needed |
0531b2aa LT |
3548 | * @mapping: the page's address_space |
3549 | * @index: the page index | |
3550 | * @filler: function to perform the read | |
5e5358e7 | 3551 | * @data: first arg to filler(data, page) function, often left as NULL |
0531b2aa | 3552 | * |
0531b2aa | 3553 | * Read into the page cache. If a page already exists, and PageUptodate() is |
67f9fd91 | 3554 | * not set, try to fill the page and wait for it to become unlocked. |
0531b2aa LT |
3555 | * |
3556 | * If the page does not get brought uptodate, return -EIO. | |
a862f68a | 3557 | * |
730633f0 JK |
3558 | * The function expects mapping->invalidate_lock to be already held. |
3559 | * | |
a862f68a | 3560 | * Return: up to date page on success, ERR_PTR() on failure. |
0531b2aa | 3561 | */ |
67f9fd91 | 3562 | struct page *read_cache_page(struct address_space *mapping, |
0531b2aa | 3563 | pgoff_t index, |
5e5358e7 | 3564 | int (*filler)(void *, struct page *), |
0531b2aa LT |
3565 | void *data) |
3566 | { | |
d322a8e5 CH |
3567 | return do_read_cache_page(mapping, index, filler, data, |
3568 | mapping_gfp_mask(mapping)); | |
0531b2aa | 3569 | } |
67f9fd91 | 3570 | EXPORT_SYMBOL(read_cache_page); |
0531b2aa LT |
3571 | |
3572 | /** | |
3573 | * read_cache_page_gfp - read into page cache, using specified page allocation flags. | |
3574 | * @mapping: the page's address_space | |
3575 | * @index: the page index | |
3576 | * @gfp: the page allocator flags to use if allocating | |
3577 | * | |
3578 | * This is the same as "read_mapping_page(mapping, index, NULL)", but with | |
e6f67b8c | 3579 | * any new page allocations done using the specified allocation flags. |
0531b2aa LT |
3580 | * |
3581 | * If the page does not get brought uptodate, return -EIO. | |
a862f68a | 3582 | * |
730633f0 JK |
3583 | * The function expects mapping->invalidate_lock to be already held. |
3584 | * | |
a862f68a | 3585 | * Return: up to date page on success, ERR_PTR() on failure. |
0531b2aa LT |
3586 | */ |
3587 | struct page *read_cache_page_gfp(struct address_space *mapping, | |
3588 | pgoff_t index, | |
3589 | gfp_t gfp) | |
3590 | { | |
6c45b454 | 3591 | return do_read_cache_page(mapping, index, NULL, NULL, gfp); |
0531b2aa LT |
3592 | } |
3593 | EXPORT_SYMBOL(read_cache_page_gfp); | |
3594 | ||
afddba49 NP |
3595 | int pagecache_write_begin(struct file *file, struct address_space *mapping, |
3596 | loff_t pos, unsigned len, unsigned flags, | |
3597 | struct page **pagep, void **fsdata) | |
3598 | { | |
3599 | const struct address_space_operations *aops = mapping->a_ops; | |
3600 | ||
4e02ed4b | 3601 | return aops->write_begin(file, mapping, pos, len, flags, |
afddba49 | 3602 | pagep, fsdata); |
afddba49 NP |
3603 | } |
3604 | EXPORT_SYMBOL(pagecache_write_begin); | |
3605 | ||
3606 | int pagecache_write_end(struct file *file, struct address_space *mapping, | |
3607 | loff_t pos, unsigned len, unsigned copied, | |
3608 | struct page *page, void *fsdata) | |
3609 | { | |
3610 | const struct address_space_operations *aops = mapping->a_ops; | |
afddba49 | 3611 | |
4e02ed4b | 3612 | return aops->write_end(file, mapping, pos, len, copied, page, fsdata); |
afddba49 NP |
3613 | } |
3614 | EXPORT_SYMBOL(pagecache_write_end); | |
3615 | ||
a92853b6 KK |
3616 | /* |
3617 | * Warn about a page cache invalidation failure during a direct I/O write. | |
3618 | */ | |
3619 | void dio_warn_stale_pagecache(struct file *filp) | |
3620 | { | |
3621 | static DEFINE_RATELIMIT_STATE(_rs, 86400 * HZ, DEFAULT_RATELIMIT_BURST); | |
3622 | char pathname[128]; | |
a92853b6 KK |
3623 | char *path; |
3624 | ||
5df1a672 | 3625 | errseq_set(&filp->f_mapping->wb_err, -EIO); |
a92853b6 KK |
3626 | if (__ratelimit(&_rs)) { |
3627 | path = file_path(filp, pathname, sizeof(pathname)); | |
3628 | if (IS_ERR(path)) | |
3629 | path = "(unknown)"; | |
3630 | pr_crit("Page cache invalidation failure on direct I/O. Possible data corruption due to collision with buffered I/O!\n"); | |
3631 | pr_crit("File: %s PID: %d Comm: %.20s\n", path, current->pid, | |
3632 | current->comm); | |
3633 | } | |
3634 | } | |
3635 | ||
1da177e4 | 3636 | ssize_t |
1af5bb49 | 3637 | generic_file_direct_write(struct kiocb *iocb, struct iov_iter *from) |
1da177e4 LT |
3638 | { |
3639 | struct file *file = iocb->ki_filp; | |
3640 | struct address_space *mapping = file->f_mapping; | |
3641 | struct inode *inode = mapping->host; | |
1af5bb49 | 3642 | loff_t pos = iocb->ki_pos; |
1da177e4 | 3643 | ssize_t written; |
a969e903 CH |
3644 | size_t write_len; |
3645 | pgoff_t end; | |
1da177e4 | 3646 | |
0c949334 | 3647 | write_len = iov_iter_count(from); |
09cbfeaf | 3648 | end = (pos + write_len - 1) >> PAGE_SHIFT; |
a969e903 | 3649 | |
6be96d3a GR |
3650 | if (iocb->ki_flags & IOCB_NOWAIT) { |
3651 | /* If there are pages to writeback, return */ | |
5df1a672 | 3652 | if (filemap_range_has_page(file->f_mapping, pos, |
35f12f0f | 3653 | pos + write_len - 1)) |
6be96d3a GR |
3654 | return -EAGAIN; |
3655 | } else { | |
3656 | written = filemap_write_and_wait_range(mapping, pos, | |
3657 | pos + write_len - 1); | |
3658 | if (written) | |
3659 | goto out; | |
3660 | } | |
a969e903 CH |
3661 | |
3662 | /* | |
3663 | * After a write we want buffered reads to be sure to go to disk to get | |
3664 | * the new data. We invalidate clean cached page from the region we're | |
3665 | * about to write. We do this *before* the write so that we can return | |
6ccfa806 | 3666 | * without clobbering -EIOCBQUEUED from ->direct_IO(). |
a969e903 | 3667 | */ |
55635ba7 | 3668 | written = invalidate_inode_pages2_range(mapping, |
09cbfeaf | 3669 | pos >> PAGE_SHIFT, end); |
55635ba7 AR |
3670 | /* |
3671 | * If a page can not be invalidated, return 0 to fall back | |
3672 | * to buffered write. | |
3673 | */ | |
3674 | if (written) { | |
3675 | if (written == -EBUSY) | |
3676 | return 0; | |
3677 | goto out; | |
a969e903 CH |
3678 | } |
3679 | ||
639a93a5 | 3680 | written = mapping->a_ops->direct_IO(iocb, from); |
a969e903 CH |
3681 | |
3682 | /* | |
3683 | * Finally, try again to invalidate clean pages which might have been | |
3684 | * cached by non-direct readahead, or faulted in by get_user_pages() | |
3685 | * if the source of the write was an mmap'ed region of the file | |
3686 | * we're writing. Either one is a pretty crazy thing to do, | |
3687 | * so we don't support it 100%. If this invalidation | |
3688 | * fails, tough, the write still worked... | |
332391a9 LC |
3689 | * |
3690 | * Most of the time we do not need this since dio_complete() will do | |
3691 | * the invalidation for us. However there are some file systems that | |
3692 | * do not end up with dio_complete() being called, so let's not break | |
80c1fe90 KK |
3693 | * them by removing it completely. |
3694 | * | |
9266a140 KK |
3695 | * Noticeable example is a blkdev_direct_IO(). |
3696 | * | |
80c1fe90 | 3697 | * Skip invalidation for async writes or if mapping has no pages. |
a969e903 | 3698 | */ |
9266a140 KK |
3699 | if (written > 0 && mapping->nrpages && |
3700 | invalidate_inode_pages2_range(mapping, pos >> PAGE_SHIFT, end)) | |
3701 | dio_warn_stale_pagecache(file); | |
a969e903 | 3702 | |
1da177e4 | 3703 | if (written > 0) { |
0116651c | 3704 | pos += written; |
639a93a5 | 3705 | write_len -= written; |
0116651c NK |
3706 | if (pos > i_size_read(inode) && !S_ISBLK(inode->i_mode)) { |
3707 | i_size_write(inode, pos); | |
1da177e4 LT |
3708 | mark_inode_dirty(inode); |
3709 | } | |
5cb6c6c7 | 3710 | iocb->ki_pos = pos; |
1da177e4 | 3711 | } |
ab2125df PB |
3712 | if (written != -EIOCBQUEUED) |
3713 | iov_iter_revert(from, write_len - iov_iter_count(from)); | |
a969e903 | 3714 | out: |
1da177e4 LT |
3715 | return written; |
3716 | } | |
3717 | EXPORT_SYMBOL(generic_file_direct_write); | |
3718 | ||
3b93f911 | 3719 | ssize_t generic_perform_write(struct file *file, |
afddba49 NP |
3720 | struct iov_iter *i, loff_t pos) |
3721 | { | |
3722 | struct address_space *mapping = file->f_mapping; | |
3723 | const struct address_space_operations *a_ops = mapping->a_ops; | |
3724 | long status = 0; | |
3725 | ssize_t written = 0; | |
674b892e NP |
3726 | unsigned int flags = 0; |
3727 | ||
afddba49 NP |
3728 | do { |
3729 | struct page *page; | |
afddba49 NP |
3730 | unsigned long offset; /* Offset into pagecache page */ |
3731 | unsigned long bytes; /* Bytes to write to page */ | |
3732 | size_t copied; /* Bytes copied from user */ | |
3733 | void *fsdata; | |
3734 | ||
09cbfeaf KS |
3735 | offset = (pos & (PAGE_SIZE - 1)); |
3736 | bytes = min_t(unsigned long, PAGE_SIZE - offset, | |
afddba49 NP |
3737 | iov_iter_count(i)); |
3738 | ||
3739 | again: | |
00a3d660 LT |
3740 | /* |
3741 | * Bring in the user page that we will copy from _first_. | |
3742 | * Otherwise there's a nasty deadlock on copying from the | |
3743 | * same page as we're writing to, without it being marked | |
3744 | * up-to-date. | |
00a3d660 | 3745 | */ |
a6294593 | 3746 | if (unlikely(fault_in_iov_iter_readable(i, bytes))) { |
00a3d660 LT |
3747 | status = -EFAULT; |
3748 | break; | |
3749 | } | |
3750 | ||
296291cd JK |
3751 | if (fatal_signal_pending(current)) { |
3752 | status = -EINTR; | |
3753 | break; | |
3754 | } | |
3755 | ||
674b892e | 3756 | status = a_ops->write_begin(file, mapping, pos, bytes, flags, |
afddba49 | 3757 | &page, &fsdata); |
2457aec6 | 3758 | if (unlikely(status < 0)) |
afddba49 NP |
3759 | break; |
3760 | ||
931e80e4 | 3761 | if (mapping_writably_mapped(mapping)) |
3762 | flush_dcache_page(page); | |
00a3d660 | 3763 | |
f0b65f39 | 3764 | copied = copy_page_from_iter_atomic(page, offset, bytes, i); |
afddba49 NP |
3765 | flush_dcache_page(page); |
3766 | ||
3767 | status = a_ops->write_end(file, mapping, pos, bytes, copied, | |
3768 | page, fsdata); | |
f0b65f39 AV |
3769 | if (unlikely(status != copied)) { |
3770 | iov_iter_revert(i, copied - max(status, 0L)); | |
3771 | if (unlikely(status < 0)) | |
3772 | break; | |
3773 | } | |
afddba49 NP |
3774 | cond_resched(); |
3775 | ||
bc1bb416 | 3776 | if (unlikely(status == 0)) { |
afddba49 | 3777 | /* |
bc1bb416 AV |
3778 | * A short copy made ->write_end() reject the |
3779 | * thing entirely. Might be memory poisoning | |
3780 | * halfway through, might be a race with munmap, | |
3781 | * might be severe memory pressure. | |
afddba49 | 3782 | */ |
bc1bb416 AV |
3783 | if (copied) |
3784 | bytes = copied; | |
afddba49 NP |
3785 | goto again; |
3786 | } | |
f0b65f39 AV |
3787 | pos += status; |
3788 | written += status; | |
afddba49 NP |
3789 | |
3790 | balance_dirty_pages_ratelimited(mapping); | |
afddba49 NP |
3791 | } while (iov_iter_count(i)); |
3792 | ||
3793 | return written ? written : status; | |
3794 | } | |
3b93f911 | 3795 | EXPORT_SYMBOL(generic_perform_write); |
1da177e4 | 3796 | |
e4dd9de3 | 3797 | /** |
8174202b | 3798 | * __generic_file_write_iter - write data to a file |
e4dd9de3 | 3799 | * @iocb: IO state structure (file, offset, etc.) |
8174202b | 3800 | * @from: iov_iter with data to write |
e4dd9de3 JK |
3801 | * |
3802 | * This function does all the work needed for actually writing data to a | |
3803 | * file. It does all basic checks, removes SUID from the file, updates | |
3804 | * modification times and calls proper subroutines depending on whether we | |
3805 | * do direct IO or a standard buffered write. | |
3806 | * | |
9608703e | 3807 | * It expects i_rwsem to be grabbed unless we work on a block device or similar |
e4dd9de3 JK |
3808 | * object which does not need locking at all. |
3809 | * | |
3810 | * This function does *not* take care of syncing data in case of O_SYNC write. | |
3811 | * A caller has to handle it. This is mainly due to the fact that we want to | |
9608703e | 3812 | * avoid syncing under i_rwsem. |
a862f68a MR |
3813 | * |
3814 | * Return: | |
3815 | * * number of bytes written, even for truncated writes | |
3816 | * * negative error code if no data has been written at all | |
e4dd9de3 | 3817 | */ |
8174202b | 3818 | ssize_t __generic_file_write_iter(struct kiocb *iocb, struct iov_iter *from) |
1da177e4 LT |
3819 | { |
3820 | struct file *file = iocb->ki_filp; | |
68d68ff6 | 3821 | struct address_space *mapping = file->f_mapping; |
1da177e4 | 3822 | struct inode *inode = mapping->host; |
3b93f911 | 3823 | ssize_t written = 0; |
1da177e4 | 3824 | ssize_t err; |
3b93f911 | 3825 | ssize_t status; |
1da177e4 | 3826 | |
1da177e4 | 3827 | /* We can write back this queue in page reclaim */ |
de1414a6 | 3828 | current->backing_dev_info = inode_to_bdi(inode); |
5fa8e0a1 | 3829 | err = file_remove_privs(file); |
1da177e4 LT |
3830 | if (err) |
3831 | goto out; | |
3832 | ||
c3b2da31 JB |
3833 | err = file_update_time(file); |
3834 | if (err) | |
3835 | goto out; | |
1da177e4 | 3836 | |
2ba48ce5 | 3837 | if (iocb->ki_flags & IOCB_DIRECT) { |
0b8def9d | 3838 | loff_t pos, endbyte; |
fb5527e6 | 3839 | |
1af5bb49 | 3840 | written = generic_file_direct_write(iocb, from); |
1da177e4 | 3841 | /* |
fbbbad4b MW |
3842 | * If the write stopped short of completing, fall back to |
3843 | * buffered writes. Some filesystems do this for writes to | |
3844 | * holes, for example. For DAX files, a buffered write will | |
3845 | * not succeed (even if it did, DAX does not handle dirty | |
3846 | * page-cache pages correctly). | |
1da177e4 | 3847 | */ |
0b8def9d | 3848 | if (written < 0 || !iov_iter_count(from) || IS_DAX(inode)) |
fbbbad4b MW |
3849 | goto out; |
3850 | ||
0b8def9d | 3851 | status = generic_perform_write(file, from, pos = iocb->ki_pos); |
fb5527e6 | 3852 | /* |
3b93f911 | 3853 | * If generic_perform_write() returned a synchronous error |
fb5527e6 JM |
3854 | * then we want to return the number of bytes which were |
3855 | * direct-written, or the error code if that was zero. Note | |
3856 | * that this differs from normal direct-io semantics, which | |
3857 | * will return -EFOO even if some bytes were written. | |
3858 | */ | |
60bb4529 | 3859 | if (unlikely(status < 0)) { |
3b93f911 | 3860 | err = status; |
fb5527e6 JM |
3861 | goto out; |
3862 | } | |
fb5527e6 JM |
3863 | /* |
3864 | * We need to ensure that the page cache pages are written to | |
3865 | * disk and invalidated to preserve the expected O_DIRECT | |
3866 | * semantics. | |
3867 | */ | |
3b93f911 | 3868 | endbyte = pos + status - 1; |
0b8def9d | 3869 | err = filemap_write_and_wait_range(mapping, pos, endbyte); |
fb5527e6 | 3870 | if (err == 0) { |
0b8def9d | 3871 | iocb->ki_pos = endbyte + 1; |
3b93f911 | 3872 | written += status; |
fb5527e6 | 3873 | invalidate_mapping_pages(mapping, |
09cbfeaf KS |
3874 | pos >> PAGE_SHIFT, |
3875 | endbyte >> PAGE_SHIFT); | |
fb5527e6 JM |
3876 | } else { |
3877 | /* | |
3878 | * We don't know how much we wrote, so just return | |
3879 | * the number of bytes which were direct-written | |
3880 | */ | |
3881 | } | |
3882 | } else { | |
0b8def9d AV |
3883 | written = generic_perform_write(file, from, iocb->ki_pos); |
3884 | if (likely(written > 0)) | |
3885 | iocb->ki_pos += written; | |
fb5527e6 | 3886 | } |
1da177e4 LT |
3887 | out: |
3888 | current->backing_dev_info = NULL; | |
3889 | return written ? written : err; | |
3890 | } | |
8174202b | 3891 | EXPORT_SYMBOL(__generic_file_write_iter); |
e4dd9de3 | 3892 | |
e4dd9de3 | 3893 | /** |
8174202b | 3894 | * generic_file_write_iter - write data to a file |
e4dd9de3 | 3895 | * @iocb: IO state structure |
8174202b | 3896 | * @from: iov_iter with data to write |
e4dd9de3 | 3897 | * |
8174202b | 3898 | * This is a wrapper around __generic_file_write_iter() to be used by most |
e4dd9de3 | 3899 | * filesystems. It takes care of syncing the file in case of O_SYNC file |
9608703e | 3900 | * and acquires i_rwsem as needed. |
a862f68a MR |
3901 | * Return: |
3902 | * * negative error code if no data has been written at all of | |
3903 | * vfs_fsync_range() failed for a synchronous write | |
3904 | * * number of bytes written, even for truncated writes | |
e4dd9de3 | 3905 | */ |
8174202b | 3906 | ssize_t generic_file_write_iter(struct kiocb *iocb, struct iov_iter *from) |
1da177e4 LT |
3907 | { |
3908 | struct file *file = iocb->ki_filp; | |
148f948b | 3909 | struct inode *inode = file->f_mapping->host; |
1da177e4 | 3910 | ssize_t ret; |
1da177e4 | 3911 | |
5955102c | 3912 | inode_lock(inode); |
3309dd04 AV |
3913 | ret = generic_write_checks(iocb, from); |
3914 | if (ret > 0) | |
5f380c7f | 3915 | ret = __generic_file_write_iter(iocb, from); |
5955102c | 3916 | inode_unlock(inode); |
1da177e4 | 3917 | |
e2592217 CH |
3918 | if (ret > 0) |
3919 | ret = generic_write_sync(iocb, ret); | |
1da177e4 LT |
3920 | return ret; |
3921 | } | |
8174202b | 3922 | EXPORT_SYMBOL(generic_file_write_iter); |
1da177e4 | 3923 | |
cf9a2ae8 DH |
3924 | /** |
3925 | * try_to_release_page() - release old fs-specific metadata on a page | |
3926 | * | |
3927 | * @page: the page which the kernel is trying to free | |
3928 | * @gfp_mask: memory allocation flags (and I/O mode) | |
3929 | * | |
3930 | * The address_space is to try to release any data against the page | |
a862f68a | 3931 | * (presumably at page->private). |
cf9a2ae8 | 3932 | * |
266cf658 DH |
3933 | * This may also be called if PG_fscache is set on a page, indicating that the |
3934 | * page is known to the local caching routines. | |
3935 | * | |
cf9a2ae8 | 3936 | * The @gfp_mask argument specifies whether I/O may be performed to release |
71baba4b | 3937 | * this page (__GFP_IO), and whether the call may block (__GFP_RECLAIM & __GFP_FS). |
cf9a2ae8 | 3938 | * |
a862f68a | 3939 | * Return: %1 if the release was successful, otherwise return zero. |
cf9a2ae8 DH |
3940 | */ |
3941 | int try_to_release_page(struct page *page, gfp_t gfp_mask) | |
3942 | { | |
3943 | struct address_space * const mapping = page->mapping; | |
3944 | ||
3945 | BUG_ON(!PageLocked(page)); | |
3946 | if (PageWriteback(page)) | |
3947 | return 0; | |
3948 | ||
3949 | if (mapping && mapping->a_ops->releasepage) | |
3950 | return mapping->a_ops->releasepage(page, gfp_mask); | |
3951 | return try_to_free_buffers(page); | |
3952 | } | |
3953 | ||
3954 | EXPORT_SYMBOL(try_to_release_page); |