Commit | Line | Data |
---|---|---|
457c8996 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
1da177e4 LT |
2 | /* |
3 | * mm/truncate.c - code for taking down pages from address_spaces | |
4 | * | |
5 | * Copyright (C) 2002, Linus Torvalds | |
6 | * | |
e1f8e874 | 7 | * 10Sep2002 Andrew Morton |
1da177e4 LT |
8 | * Initial version. |
9 | */ | |
10 | ||
11 | #include <linux/kernel.h> | |
4af3c9cc | 12 | #include <linux/backing-dev.h> |
f9fe48be | 13 | #include <linux/dax.h> |
5a0e3ad6 | 14 | #include <linux/gfp.h> |
1da177e4 | 15 | #include <linux/mm.h> |
0fd0e6b0 | 16 | #include <linux/swap.h> |
b95f1b31 | 17 | #include <linux/export.h> |
1da177e4 | 18 | #include <linux/pagemap.h> |
01f2705d | 19 | #include <linux/highmem.h> |
1da177e4 | 20 | #include <linux/pagevec.h> |
e08748ce | 21 | #include <linux/task_io_accounting_ops.h> |
3a4f8a0b | 22 | #include <linux/shmem_fs.h> |
90a80202 | 23 | #include <linux/rmap.h> |
ba470de4 | 24 | #include "internal.h" |
1da177e4 | 25 | |
f2187599 MG |
26 | /* |
27 | * Regular page slots are stabilized by the page lock even without the tree | |
28 | * itself locked. These unlocked entries need verification under the tree | |
29 | * lock. | |
30 | */ | |
31 | static inline void __clear_shadow_entry(struct address_space *mapping, | |
32 | pgoff_t index, void *entry) | |
0cd6144a | 33 | { |
69b6c131 | 34 | XA_STATE(xas, &mapping->i_pages, index); |
449dd698 | 35 | |
69b6c131 MW |
36 | xas_set_update(&xas, workingset_update_node); |
37 | if (xas_load(&xas) != entry) | |
f2187599 | 38 | return; |
69b6c131 | 39 | xas_store(&xas, NULL); |
f2187599 MG |
40 | } |
41 | ||
42 | static void clear_shadow_entry(struct address_space *mapping, pgoff_t index, | |
43 | void *entry) | |
44 | { | |
51b8c1fe | 45 | spin_lock(&mapping->host->i_lock); |
b93b0163 | 46 | xa_lock_irq(&mapping->i_pages); |
f2187599 | 47 | __clear_shadow_entry(mapping, index, entry); |
b93b0163 | 48 | xa_unlock_irq(&mapping->i_pages); |
51b8c1fe JW |
49 | if (mapping_shrinkable(mapping)) |
50 | inode_add_lru(mapping->host); | |
51 | spin_unlock(&mapping->host->i_lock); | |
0cd6144a | 52 | } |
1da177e4 | 53 | |
c6dcf52c | 54 | /* |
f2187599 | 55 | * Unconditionally remove exceptional entries. Usually called from truncate |
51dcbdac | 56 | * path. Note that the folio_batch may be altered by this function by removing |
1613fac9 | 57 | * exceptional entries similar to what folio_batch_remove_exceptionals() does. |
c6dcf52c | 58 | */ |
51dcbdac MWO |
59 | static void truncate_folio_batch_exceptionals(struct address_space *mapping, |
60 | struct folio_batch *fbatch, pgoff_t *indices) | |
c6dcf52c | 61 | { |
f2187599 | 62 | int i, j; |
31d270fd | 63 | bool dax; |
f2187599 | 64 | |
c6dcf52c JK |
65 | /* Handled by shmem itself */ |
66 | if (shmem_mapping(mapping)) | |
67 | return; | |
68 | ||
51dcbdac MWO |
69 | for (j = 0; j < folio_batch_count(fbatch); j++) |
70 | if (xa_is_value(fbatch->folios[j])) | |
f2187599 MG |
71 | break; |
72 | ||
51dcbdac | 73 | if (j == folio_batch_count(fbatch)) |
c6dcf52c | 74 | return; |
f2187599 MG |
75 | |
76 | dax = dax_mapping(mapping); | |
51b8c1fe JW |
77 | if (!dax) { |
78 | spin_lock(&mapping->host->i_lock); | |
b93b0163 | 79 | xa_lock_irq(&mapping->i_pages); |
51b8c1fe | 80 | } |
f2187599 | 81 | |
51dcbdac MWO |
82 | for (i = j; i < folio_batch_count(fbatch); i++) { |
83 | struct folio *folio = fbatch->folios[i]; | |
f2187599 MG |
84 | pgoff_t index = indices[i]; |
85 | ||
51dcbdac MWO |
86 | if (!xa_is_value(folio)) { |
87 | fbatch->folios[j++] = folio; | |
f2187599 MG |
88 | continue; |
89 | } | |
90 | ||
f2187599 MG |
91 | if (unlikely(dax)) { |
92 | dax_delete_mapping_entry(mapping, index); | |
93 | continue; | |
94 | } | |
95 | ||
51dcbdac | 96 | __clear_shadow_entry(mapping, index, folio); |
c6dcf52c | 97 | } |
f2187599 | 98 | |
51b8c1fe | 99 | if (!dax) { |
b93b0163 | 100 | xa_unlock_irq(&mapping->i_pages); |
51b8c1fe JW |
101 | if (mapping_shrinkable(mapping)) |
102 | inode_add_lru(mapping->host); | |
103 | spin_unlock(&mapping->host->i_lock); | |
104 | } | |
51dcbdac | 105 | fbatch->nr = j; |
0e499ed3 MWO |
106 | } |
107 | ||
c6dcf52c JK |
108 | /* |
109 | * Invalidate exceptional entry if easily possible. This handles exceptional | |
4636e70b | 110 | * entries for invalidate_inode_pages(). |
c6dcf52c JK |
111 | */ |
112 | static int invalidate_exceptional_entry(struct address_space *mapping, | |
113 | pgoff_t index, void *entry) | |
114 | { | |
4636e70b RZ |
115 | /* Handled by shmem itself, or for DAX we do nothing. */ |
116 | if (shmem_mapping(mapping) || dax_mapping(mapping)) | |
c6dcf52c | 117 | return 1; |
c6dcf52c JK |
118 | clear_shadow_entry(mapping, index, entry); |
119 | return 1; | |
120 | } | |
121 | ||
122 | /* | |
123 | * Invalidate exceptional entry if clean. This handles exceptional entries for | |
124 | * invalidate_inode_pages2() so for DAX it evicts only clean entries. | |
125 | */ | |
126 | static int invalidate_exceptional_entry2(struct address_space *mapping, | |
127 | pgoff_t index, void *entry) | |
128 | { | |
129 | /* Handled by shmem itself */ | |
130 | if (shmem_mapping(mapping)) | |
131 | return 1; | |
132 | if (dax_mapping(mapping)) | |
133 | return dax_invalidate_mapping_entry_sync(mapping, index); | |
134 | clear_shadow_entry(mapping, index, entry); | |
135 | return 1; | |
136 | } | |
137 | ||
cf9a2ae8 | 138 | /** |
5ad6b2bd MWO |
139 | * folio_invalidate - Invalidate part or all of a folio. |
140 | * @folio: The folio which is affected. | |
d47992f8 LC |
141 | * @offset: start of the range to invalidate |
142 | * @length: length of the range to invalidate | |
cf9a2ae8 | 143 | * |
5ad6b2bd | 144 | * folio_invalidate() is called when all or part of the folio has become |
cf9a2ae8 DH |
145 | * invalidated by a truncate operation. |
146 | * | |
5ad6b2bd | 147 | * folio_invalidate() does not have to release all buffers, but it must |
cf9a2ae8 DH |
148 | * ensure that no dirty buffer is left outside @offset and that no I/O |
149 | * is underway against any of the blocks which are outside the truncation | |
150 | * point. Because the caller is about to free (and possibly reuse) those | |
151 | * blocks on-disk. | |
152 | */ | |
5ad6b2bd | 153 | void folio_invalidate(struct folio *folio, size_t offset, size_t length) |
cf9a2ae8 | 154 | { |
128d1f82 | 155 | const struct address_space_operations *aops = folio->mapping->a_ops; |
d47992f8 | 156 | |
f50015a5 | 157 | if (aops->invalidate_folio) |
128d1f82 | 158 | aops->invalidate_folio(folio, offset, length); |
cf9a2ae8 | 159 | } |
5ad6b2bd | 160 | EXPORT_SYMBOL_GPL(folio_invalidate); |
cf9a2ae8 | 161 | |
1da177e4 LT |
162 | /* |
163 | * If truncate cannot remove the fs-private metadata from the page, the page | |
62e1c553 | 164 | * becomes orphaned. It will be left on the LRU and may even be mapped into |
54cb8821 | 165 | * user pagetables if we're racing with filemap_fault(). |
1da177e4 | 166 | * |
fc3a5ac5 | 167 | * We need to bail out if page->mapping is no longer equal to the original |
1da177e4 | 168 | * mapping. This happens a) when the VM reclaimed the page while we waited on |
fc0ecff6 | 169 | * its lock, b) when a concurrent invalidate_mapping_pages got there first and |
1da177e4 LT |
170 | * c) when tmpfs swizzles a page between a tmpfs inode and swapper_space. |
171 | */ | |
efe99bba | 172 | static void truncate_cleanup_folio(struct folio *folio) |
1da177e4 | 173 | { |
efe99bba | 174 | if (folio_mapped(folio)) |
3506659e | 175 | unmap_mapping_folio(folio); |
1da177e4 | 176 | |
efe99bba | 177 | if (folio_has_private(folio)) |
5ad6b2bd | 178 | folio_invalidate(folio, 0, folio_size(folio)); |
1da177e4 | 179 | |
b9ea2515 KK |
180 | /* |
181 | * Some filesystems seem to re-dirty the page even after | |
182 | * the VM has canceled the dirty bit (eg ext3 journaling). | |
183 | * Hence dirty accounting check is placed after invalidation. | |
184 | */ | |
efe99bba MWO |
185 | folio_cancel_dirty(folio); |
186 | folio_clear_mappedtodisk(folio); | |
1da177e4 LT |
187 | } |
188 | ||
1e84a3d9 | 189 | int truncate_inode_folio(struct address_space *mapping, struct folio *folio) |
750b4987 | 190 | { |
1e84a3d9 | 191 | if (folio->mapping != mapping) |
9f4e41f4 JK |
192 | return -EIO; |
193 | ||
efe99bba MWO |
194 | truncate_cleanup_folio(folio); |
195 | filemap_remove_folio(folio); | |
9f4e41f4 | 196 | return 0; |
750b4987 NP |
197 | } |
198 | ||
b9a8a419 MWO |
199 | /* |
200 | * Handle partial folios. The folio may be entirely within the | |
201 | * range if a split has raced with us. If not, we zero the part of the | |
202 | * folio that's within the [start, end] range, and then split the folio if | |
203 | * it's large. split_page_range() will discard pages which now lie beyond | |
204 | * i_size, and we rely on the caller to discard pages which lie within a | |
205 | * newly created hole. | |
206 | * | |
207 | * Returns false if splitting failed so the caller can avoid | |
208 | * discarding the entire folio which is stubbornly unsplit. | |
209 | */ | |
210 | bool truncate_inode_partial_folio(struct folio *folio, loff_t start, loff_t end) | |
211 | { | |
212 | loff_t pos = folio_pos(folio); | |
213 | unsigned int offset, length; | |
214 | ||
215 | if (pos < start) | |
216 | offset = start - pos; | |
217 | else | |
218 | offset = 0; | |
219 | length = folio_size(folio); | |
220 | if (pos + length <= (u64)end) | |
221 | length = length - offset; | |
222 | else | |
223 | length = end + 1 - pos - offset; | |
224 | ||
225 | folio_wait_writeback(folio); | |
226 | if (length == folio_size(folio)) { | |
227 | truncate_inode_folio(folio->mapping, folio); | |
228 | return true; | |
229 | } | |
230 | ||
231 | /* | |
232 | * We may be zeroing pages we're about to discard, but it avoids | |
233 | * doing a complex calculation here, and then doing the zeroing | |
234 | * anyway if the page split fails. | |
235 | */ | |
236 | folio_zero_range(folio, offset, length); | |
237 | ||
b9a8a419 | 238 | if (folio_has_private(folio)) |
5ad6b2bd | 239 | folio_invalidate(folio, offset, length); |
b9a8a419 MWO |
240 | if (!folio_test_large(folio)) |
241 | return true; | |
d788f5b3 | 242 | if (split_folio(folio) == 0) |
b9a8a419 MWO |
243 | return true; |
244 | if (folio_test_dirty(folio)) | |
245 | return false; | |
246 | truncate_inode_folio(folio->mapping, folio); | |
247 | return true; | |
248 | } | |
249 | ||
25718736 AK |
250 | /* |
251 | * Used to get rid of pages on hardware memory corruption. | |
252 | */ | |
253 | int generic_error_remove_page(struct address_space *mapping, struct page *page) | |
254 | { | |
1e84a3d9 MWO |
255 | VM_BUG_ON_PAGE(PageTail(page), page); |
256 | ||
25718736 AK |
257 | if (!mapping) |
258 | return -EINVAL; | |
259 | /* | |
260 | * Only punch for normal data pages for now. | |
261 | * Handling other types like directories would need more auditing. | |
262 | */ | |
263 | if (!S_ISREG(mapping->host->i_mode)) | |
264 | return -EIO; | |
1e84a3d9 | 265 | return truncate_inode_folio(mapping, page_folio(page)); |
25718736 AK |
266 | } |
267 | EXPORT_SYMBOL(generic_error_remove_page); | |
268 | ||
d6c75dc2 MWO |
269 | static long mapping_evict_folio(struct address_space *mapping, |
270 | struct folio *folio) | |
83f78668 | 271 | { |
44184813 | 272 | if (folio_test_dirty(folio) || folio_test_writeback(folio)) |
83f78668 | 273 | return 0; |
e41c81d0 MWO |
274 | /* The refcount will be elevated if any page in the folio is mapped */ |
275 | if (folio_ref_count(folio) > | |
276 | folio_nr_pages(folio) + folio_has_private(folio) + 1) | |
83f78668 | 277 | return 0; |
0201ebf2 | 278 | if (!filemap_release_folio(folio, 0)) |
1b8ddbee MWO |
279 | return 0; |
280 | ||
5100da38 | 281 | return remove_mapping(mapping, folio); |
83f78668 WF |
282 | } |
283 | ||
d6c75dc2 MWO |
284 | /** |
285 | * invalidate_inode_page() - Remove an unused page from the pagecache. | |
286 | * @page: The page to remove. | |
287 | * | |
288 | * Safely invalidate one page from its pagecache mapping. | |
289 | * It only drops clean, unused pages. | |
290 | * | |
291 | * Context: Page must be locked. | |
292 | * Return: The number of pages successfully removed. | |
293 | */ | |
294 | long invalidate_inode_page(struct page *page) | |
295 | { | |
296 | struct folio *folio = page_folio(page); | |
297 | struct address_space *mapping = folio_mapping(folio); | |
298 | ||
299 | /* The page may have been truncated before it was locked */ | |
300 | if (!mapping) | |
301 | return 0; | |
302 | return mapping_evict_folio(mapping, folio); | |
303 | } | |
304 | ||
1da177e4 | 305 | /** |
73c1e204 | 306 | * truncate_inode_pages_range - truncate range of pages specified by start & end byte offsets |
1da177e4 LT |
307 | * @mapping: mapping to truncate |
308 | * @lstart: offset from which to truncate | |
5a720394 | 309 | * @lend: offset to which to truncate (inclusive) |
1da177e4 | 310 | * |
d7339071 | 311 | * Truncate the page cache, removing the pages that are between |
5a720394 LC |
312 | * specified offsets (and zeroing out partial pages |
313 | * if lstart or lend + 1 is not page aligned). | |
1da177e4 LT |
314 | * |
315 | * Truncate takes two passes - the first pass is nonblocking. It will not | |
316 | * block on page locks and it will not block on writeback. The second pass | |
317 | * will wait. This is to prevent as much IO as possible in the affected region. | |
318 | * The first pass will remove most pages, so the search cost of the second pass | |
319 | * is low. | |
320 | * | |
1da177e4 LT |
321 | * We pass down the cache-hot hint to the page freeing code. Even if the |
322 | * mapping is large, it is probably the case that the final pages are the most | |
323 | * recently touched, and freeing happens in ascending file offset order. | |
5a720394 | 324 | * |
f50015a5 | 325 | * Note that since ->invalidate_folio() accepts range to invalidate |
5a720394 LC |
326 | * truncate_inode_pages_range is able to handle cases where lend + 1 is not |
327 | * page aligned properly. | |
1da177e4 | 328 | */ |
d7339071 HR |
329 | void truncate_inode_pages_range(struct address_space *mapping, |
330 | loff_t lstart, loff_t lend) | |
1da177e4 | 331 | { |
5a720394 LC |
332 | pgoff_t start; /* inclusive */ |
333 | pgoff_t end; /* exclusive */ | |
0e499ed3 | 334 | struct folio_batch fbatch; |
0cd6144a | 335 | pgoff_t indices[PAGEVEC_SIZE]; |
5a720394 LC |
336 | pgoff_t index; |
337 | int i; | |
b9a8a419 MWO |
338 | struct folio *folio; |
339 | bool same_folio; | |
1da177e4 | 340 | |
7716506a | 341 | if (mapping_empty(mapping)) |
0a4ee518 | 342 | return; |
1da177e4 | 343 | |
5a720394 LC |
344 | /* |
345 | * 'start' and 'end' always covers the range of pages to be fully | |
346 | * truncated. Partial pages are covered with 'partial_start' at the | |
347 | * start of the range and 'partial_end' at the end of the range. | |
348 | * Note that 'end' is exclusive while 'lend' is inclusive. | |
349 | */ | |
09cbfeaf | 350 | start = (lstart + PAGE_SIZE - 1) >> PAGE_SHIFT; |
5a720394 LC |
351 | if (lend == -1) |
352 | /* | |
353 | * lend == -1 indicates end-of-file so we have to set 'end' | |
354 | * to the highest possible pgoff_t and since the type is | |
355 | * unsigned we're using -1. | |
356 | */ | |
357 | end = -1; | |
358 | else | |
09cbfeaf | 359 | end = (lend + 1) >> PAGE_SHIFT; |
d7339071 | 360 | |
51dcbdac | 361 | folio_batch_init(&fbatch); |
b85e0eff | 362 | index = start; |
3392ca12 | 363 | while (index < end && find_lock_entries(mapping, &index, end - 1, |
51dcbdac | 364 | &fbatch, indices)) { |
51dcbdac MWO |
365 | truncate_folio_batch_exceptionals(mapping, &fbatch, indices); |
366 | for (i = 0; i < folio_batch_count(&fbatch); i++) | |
367 | truncate_cleanup_folio(fbatch.folios[i]); | |
368 | delete_from_page_cache_batch(mapping, &fbatch); | |
369 | for (i = 0; i < folio_batch_count(&fbatch); i++) | |
370 | folio_unlock(fbatch.folios[i]); | |
371 | folio_batch_release(&fbatch); | |
1da177e4 LT |
372 | cond_resched(); |
373 | } | |
5c211ba2 | 374 | |
b9a8a419 MWO |
375 | same_folio = (lstart >> PAGE_SHIFT) == (lend >> PAGE_SHIFT); |
376 | folio = __filemap_get_folio(mapping, lstart >> PAGE_SHIFT, FGP_LOCK, 0); | |
66dabbb6 | 377 | if (!IS_ERR(folio)) { |
b9a8a419 MWO |
378 | same_folio = lend < folio_pos(folio) + folio_size(folio); |
379 | if (!truncate_inode_partial_folio(folio, lstart, lend)) { | |
87b11f86 | 380 | start = folio_next_index(folio); |
b9a8a419 MWO |
381 | if (same_folio) |
382 | end = folio->index; | |
1da177e4 | 383 | } |
b9a8a419 MWO |
384 | folio_unlock(folio); |
385 | folio_put(folio); | |
386 | folio = NULL; | |
1da177e4 | 387 | } |
b9a8a419 | 388 | |
66dabbb6 | 389 | if (!same_folio) { |
b9a8a419 MWO |
390 | folio = __filemap_get_folio(mapping, lend >> PAGE_SHIFT, |
391 | FGP_LOCK, 0); | |
66dabbb6 CH |
392 | if (!IS_ERR(folio)) { |
393 | if (!truncate_inode_partial_folio(folio, lstart, lend)) | |
394 | end = folio->index; | |
395 | folio_unlock(folio); | |
396 | folio_put(folio); | |
397 | } | |
5a720394 | 398 | } |
1da177e4 | 399 | |
b85e0eff | 400 | index = start; |
b9a8a419 | 401 | while (index < end) { |
1da177e4 | 402 | cond_resched(); |
9fb6beea | 403 | if (!find_get_entries(mapping, &index, end - 1, &fbatch, |
38cefeb3 | 404 | indices)) { |
792ceaef | 405 | /* If all gone from start onwards, we're done */ |
b85e0eff | 406 | if (index == start) |
1da177e4 | 407 | break; |
792ceaef | 408 | /* Otherwise restart to make sure all gone */ |
b85e0eff | 409 | index = start; |
1da177e4 LT |
410 | continue; |
411 | } | |
f2187599 | 412 | |
0e499ed3 MWO |
413 | for (i = 0; i < folio_batch_count(&fbatch); i++) { |
414 | struct folio *folio = fbatch.folios[i]; | |
1da177e4 | 415 | |
b85e0eff | 416 | /* We rely upon deletion not changing page->index */ |
b85e0eff | 417 | |
0e499ed3 | 418 | if (xa_is_value(folio)) |
0cd6144a | 419 | continue; |
0cd6144a | 420 | |
1e84a3d9 | 421 | folio_lock(folio); |
9fb6beea | 422 | VM_BUG_ON_FOLIO(!folio_contains(folio, indices[i]), folio); |
1e84a3d9 MWO |
423 | folio_wait_writeback(folio); |
424 | truncate_inode_folio(mapping, folio); | |
425 | folio_unlock(folio); | |
1da177e4 | 426 | } |
0e499ed3 MWO |
427 | truncate_folio_batch_exceptionals(mapping, &fbatch, indices); |
428 | folio_batch_release(&fbatch); | |
1da177e4 LT |
429 | } |
430 | } | |
d7339071 | 431 | EXPORT_SYMBOL(truncate_inode_pages_range); |
1da177e4 | 432 | |
d7339071 HR |
433 | /** |
434 | * truncate_inode_pages - truncate *all* the pages from an offset | |
435 | * @mapping: mapping to truncate | |
436 | * @lstart: offset from which to truncate | |
437 | * | |
730633f0 JK |
438 | * Called under (and serialised by) inode->i_rwsem and |
439 | * mapping->invalidate_lock. | |
08142579 JK |
440 | * |
441 | * Note: When this function returns, there can be a page in the process of | |
6ffcd825 | 442 | * deletion (inside __filemap_remove_folio()) in the specified range. Thus |
08142579 JK |
443 | * mapping->nrpages can be non-zero when this function returns even after |
444 | * truncation of the whole mapping. | |
d7339071 HR |
445 | */ |
446 | void truncate_inode_pages(struct address_space *mapping, loff_t lstart) | |
447 | { | |
448 | truncate_inode_pages_range(mapping, lstart, (loff_t)-1); | |
449 | } | |
1da177e4 LT |
450 | EXPORT_SYMBOL(truncate_inode_pages); |
451 | ||
91b0abe3 JW |
452 | /** |
453 | * truncate_inode_pages_final - truncate *all* pages before inode dies | |
454 | * @mapping: mapping to truncate | |
455 | * | |
9608703e | 456 | * Called under (and serialized by) inode->i_rwsem. |
91b0abe3 JW |
457 | * |
458 | * Filesystems have to use this in the .evict_inode path to inform the | |
459 | * VM that this is the final truncate and the inode is going away. | |
460 | */ | |
461 | void truncate_inode_pages_final(struct address_space *mapping) | |
462 | { | |
91b0abe3 JW |
463 | /* |
464 | * Page reclaim can not participate in regular inode lifetime | |
465 | * management (can't call iput()) and thus can race with the | |
466 | * inode teardown. Tell it when the address space is exiting, | |
467 | * so that it does not install eviction information after the | |
468 | * final truncate has begun. | |
469 | */ | |
470 | mapping_set_exiting(mapping); | |
471 | ||
7716506a | 472 | if (!mapping_empty(mapping)) { |
91b0abe3 JW |
473 | /* |
474 | * As truncation uses a lockless tree lookup, cycle | |
475 | * the tree lock to make sure any ongoing tree | |
476 | * modification that does not see AS_EXITING is | |
477 | * completed before starting the final truncate. | |
478 | */ | |
b93b0163 MW |
479 | xa_lock_irq(&mapping->i_pages); |
480 | xa_unlock_irq(&mapping->i_pages); | |
91b0abe3 | 481 | } |
6ff38bd4 | 482 | |
6ff38bd4 | 483 | truncate_inode_pages(mapping, 0); |
91b0abe3 JW |
484 | } |
485 | EXPORT_SYMBOL(truncate_inode_pages_final); | |
486 | ||
c56109dd | 487 | /** |
1a0fc811 MWO |
488 | * mapping_try_invalidate - Invalidate all the evictable folios of one inode |
489 | * @mapping: the address_space which holds the folios to invalidate | |
c56109dd MWO |
490 | * @start: the offset 'from' which to invalidate |
491 | * @end: the offset 'to' which to invalidate (inclusive) | |
1a0fc811 | 492 | * @nr_failed: How many folio invalidations failed |
c56109dd | 493 | * |
1a0fc811 MWO |
494 | * This function is similar to invalidate_mapping_pages(), except that it |
495 | * returns the number of folios which could not be evicted in @nr_failed. | |
c56109dd | 496 | */ |
1a0fc811 MWO |
497 | unsigned long mapping_try_invalidate(struct address_space *mapping, |
498 | pgoff_t start, pgoff_t end, unsigned long *nr_failed) | |
1da177e4 | 499 | { |
0cd6144a | 500 | pgoff_t indices[PAGEVEC_SIZE]; |
51dcbdac | 501 | struct folio_batch fbatch; |
b85e0eff | 502 | pgoff_t index = start; |
31560180 MK |
503 | unsigned long ret; |
504 | unsigned long count = 0; | |
1da177e4 LT |
505 | int i; |
506 | ||
51dcbdac | 507 | folio_batch_init(&fbatch); |
3392ca12 | 508 | while (find_lock_entries(mapping, &index, end, &fbatch, indices)) { |
51dcbdac | 509 | for (i = 0; i < folio_batch_count(&fbatch); i++) { |
b4545f46 | 510 | struct folio *folio = fbatch.folios[i]; |
e0f23603 | 511 | |
b4545f46 | 512 | /* We rely upon deletion not changing folio->index */ |
e0f23603 | 513 | |
b4545f46 | 514 | if (xa_is_value(folio)) { |
7ae12c80 | 515 | count += invalidate_exceptional_entry(mapping, |
3392ca12 | 516 | indices[i], folio); |
0cd6144a JW |
517 | continue; |
518 | } | |
fc127da0 | 519 | |
b4545f46 MWO |
520 | ret = mapping_evict_folio(mapping, folio); |
521 | folio_unlock(folio); | |
31560180 | 522 | /* |
b4545f46 | 523 | * Invalidation is a hint that the folio is no longer |
31560180 MK |
524 | * of interest and try to speed up its reclaim. |
525 | */ | |
eb1d7a65 | 526 | if (!ret) { |
261b6840 | 527 | deactivate_file_folio(folio); |
1a0fc811 MWO |
528 | /* Likely in the lru cache of a remote CPU */ |
529 | if (nr_failed) | |
530 | (*nr_failed)++; | |
eb1d7a65 | 531 | } |
31560180 | 532 | count += ret; |
1da177e4 | 533 | } |
51dcbdac MWO |
534 | folio_batch_remove_exceptionals(&fbatch); |
535 | folio_batch_release(&fbatch); | |
28697355 | 536 | cond_resched(); |
1da177e4 | 537 | } |
31560180 | 538 | return count; |
1da177e4 | 539 | } |
eb1d7a65 YS |
540 | |
541 | /** | |
7ae12c80 JW |
542 | * invalidate_mapping_pages - Invalidate all clean, unlocked cache of one inode |
543 | * @mapping: the address_space which holds the cache to invalidate | |
eb1d7a65 YS |
544 | * @start: the offset 'from' which to invalidate |
545 | * @end: the offset 'to' which to invalidate (inclusive) | |
546 | * | |
7ae12c80 JW |
547 | * This function removes pages that are clean, unmapped and unlocked, |
548 | * as well as shadow entries. It will not block on IO activity. | |
eb1d7a65 | 549 | * |
7ae12c80 JW |
550 | * If you want to remove all the pages of one inode, regardless of |
551 | * their use and writeback state, use truncate_inode_pages(). | |
eb1d7a65 | 552 | * |
1a0fc811 | 553 | * Return: The number of indices that had their contents invalidated |
eb1d7a65 YS |
554 | */ |
555 | unsigned long invalidate_mapping_pages(struct address_space *mapping, | |
556 | pgoff_t start, pgoff_t end) | |
557 | { | |
1a0fc811 | 558 | return mapping_try_invalidate(mapping, start, end, NULL); |
eb1d7a65 | 559 | } |
54bc4855 | 560 | EXPORT_SYMBOL(invalidate_mapping_pages); |
1da177e4 | 561 | |
bd4c8ce4 | 562 | /* |
1b8ddbee | 563 | * This is like invalidate_inode_page(), except it ignores the page's |
bd4c8ce4 AM |
564 | * refcount. We do this because invalidate_inode_pages2() needs stronger |
565 | * invalidation guarantees, and cannot afford to leave pages behind because | |
2706a1b8 | 566 | * shrink_page_list() has a temp ref on them, or because they're transiently |
1fec6890 | 567 | * sitting in the folio_add_lru() caches. |
bd4c8ce4 | 568 | */ |
78f42660 MWO |
569 | static int invalidate_complete_folio2(struct address_space *mapping, |
570 | struct folio *folio) | |
bd4c8ce4 | 571 | { |
78f42660 | 572 | if (folio->mapping != mapping) |
bd4c8ce4 AM |
573 | return 0; |
574 | ||
0201ebf2 | 575 | if (!filemap_release_folio(folio, GFP_KERNEL)) |
bd4c8ce4 AM |
576 | return 0; |
577 | ||
51b8c1fe | 578 | spin_lock(&mapping->host->i_lock); |
30472509 | 579 | xa_lock_irq(&mapping->i_pages); |
78f42660 | 580 | if (folio_test_dirty(folio)) |
bd4c8ce4 AM |
581 | goto failed; |
582 | ||
78f42660 MWO |
583 | BUG_ON(folio_has_private(folio)); |
584 | __filemap_remove_folio(folio, NULL); | |
30472509 | 585 | xa_unlock_irq(&mapping->i_pages); |
51b8c1fe JW |
586 | if (mapping_shrinkable(mapping)) |
587 | inode_add_lru(mapping->host); | |
588 | spin_unlock(&mapping->host->i_lock); | |
6072d13c | 589 | |
78f42660 | 590 | filemap_free_folio(mapping, folio); |
bd4c8ce4 AM |
591 | return 1; |
592 | failed: | |
30472509 | 593 | xa_unlock_irq(&mapping->i_pages); |
51b8c1fe | 594 | spin_unlock(&mapping->host->i_lock); |
bd4c8ce4 AM |
595 | return 0; |
596 | } | |
597 | ||
affa80e8 | 598 | static int folio_launder(struct address_space *mapping, struct folio *folio) |
e3db7691 | 599 | { |
f6357c3a | 600 | if (!folio_test_dirty(folio)) |
e3db7691 | 601 | return 0; |
affa80e8 | 602 | if (folio->mapping != mapping || mapping->a_ops->launder_folio == NULL) |
e3db7691 | 603 | return 0; |
affa80e8 | 604 | return mapping->a_ops->launder_folio(folio); |
e3db7691 TM |
605 | } |
606 | ||
1da177e4 LT |
607 | /** |
608 | * invalidate_inode_pages2_range - remove range of pages from an address_space | |
67be2dd1 | 609 | * @mapping: the address_space |
1da177e4 LT |
610 | * @start: the page offset 'from' which to invalidate |
611 | * @end: the page offset 'to' which to invalidate (inclusive) | |
612 | * | |
613 | * Any pages which are found to be mapped into pagetables are unmapped prior to | |
614 | * invalidation. | |
615 | * | |
a862f68a | 616 | * Return: -EBUSY if any pages could not be invalidated. |
1da177e4 LT |
617 | */ |
618 | int invalidate_inode_pages2_range(struct address_space *mapping, | |
619 | pgoff_t start, pgoff_t end) | |
620 | { | |
0cd6144a | 621 | pgoff_t indices[PAGEVEC_SIZE]; |
0e499ed3 | 622 | struct folio_batch fbatch; |
b85e0eff | 623 | pgoff_t index; |
1da177e4 LT |
624 | int i; |
625 | int ret = 0; | |
0dd1334f | 626 | int ret2 = 0; |
1da177e4 | 627 | int did_range_unmap = 0; |
1da177e4 | 628 | |
7716506a | 629 | if (mapping_empty(mapping)) |
0a4ee518 | 630 | return 0; |
32691f0f | 631 | |
0e499ed3 | 632 | folio_batch_init(&fbatch); |
b85e0eff | 633 | index = start; |
9fb6beea | 634 | while (find_get_entries(mapping, &index, end, &fbatch, indices)) { |
0e499ed3 MWO |
635 | for (i = 0; i < folio_batch_count(&fbatch); i++) { |
636 | struct folio *folio = fbatch.folios[i]; | |
b85e0eff | 637 | |
fae9bc4a | 638 | /* We rely upon deletion not changing folio->index */ |
1da177e4 | 639 | |
0e499ed3 | 640 | if (xa_is_value(folio)) { |
c6dcf52c | 641 | if (!invalidate_exceptional_entry2(mapping, |
9fb6beea | 642 | indices[i], folio)) |
c6dcf52c | 643 | ret = -EBUSY; |
0cd6144a JW |
644 | continue; |
645 | } | |
646 | ||
fae9bc4a | 647 | if (!did_range_unmap && folio_mapped(folio)) { |
22061a1f | 648 | /* |
fae9bc4a | 649 | * If folio is mapped, before taking its lock, |
22061a1f HD |
650 | * zap the rest of the file in one hit. |
651 | */ | |
9fb6beea VMO |
652 | unmap_mapping_pages(mapping, indices[i], |
653 | (1 + end - indices[i]), false); | |
22061a1f HD |
654 | did_range_unmap = 1; |
655 | } | |
656 | ||
fae9bc4a | 657 | folio_lock(folio); |
aa5b9178 | 658 | if (unlikely(folio->mapping != mapping)) { |
fae9bc4a | 659 | folio_unlock(folio); |
1da177e4 LT |
660 | continue; |
661 | } | |
aa5b9178 | 662 | VM_BUG_ON_FOLIO(!folio_contains(folio, indices[i]), folio); |
fae9bc4a | 663 | folio_wait_writeback(folio); |
22061a1f | 664 | |
fae9bc4a MWO |
665 | if (folio_mapped(folio)) |
666 | unmap_mapping_folio(folio); | |
667 | BUG_ON(folio_mapped(folio)); | |
22061a1f | 668 | |
affa80e8 | 669 | ret2 = folio_launder(mapping, folio); |
0dd1334f | 670 | if (ret2 == 0) { |
78f42660 | 671 | if (!invalidate_complete_folio2(mapping, folio)) |
6ccfa806 | 672 | ret2 = -EBUSY; |
0dd1334f HH |
673 | } |
674 | if (ret2 < 0) | |
675 | ret = ret2; | |
fae9bc4a | 676 | folio_unlock(folio); |
1da177e4 | 677 | } |
0e499ed3 MWO |
678 | folio_batch_remove_exceptionals(&fbatch); |
679 | folio_batch_release(&fbatch); | |
1da177e4 LT |
680 | cond_resched(); |
681 | } | |
cd656375 | 682 | /* |
69b6c131 | 683 | * For DAX we invalidate page tables after invalidating page cache. We |
cd656375 JK |
684 | * could invalidate page tables while invalidating each entry however |
685 | * that would be expensive. And doing range unmapping before doesn't | |
69b6c131 | 686 | * work as we have no cheap way to find whether page cache entry didn't |
cd656375 JK |
687 | * get remapped later. |
688 | */ | |
689 | if (dax_mapping(mapping)) { | |
977fbdcd | 690 | unmap_mapping_pages(mapping, start, end - start + 1, false); |
cd656375 | 691 | } |
1da177e4 LT |
692 | return ret; |
693 | } | |
694 | EXPORT_SYMBOL_GPL(invalidate_inode_pages2_range); | |
695 | ||
696 | /** | |
697 | * invalidate_inode_pages2 - remove all pages from an address_space | |
67be2dd1 | 698 | * @mapping: the address_space |
1da177e4 LT |
699 | * |
700 | * Any pages which are found to be mapped into pagetables are unmapped prior to | |
701 | * invalidation. | |
702 | * | |
a862f68a | 703 | * Return: -EBUSY if any pages could not be invalidated. |
1da177e4 LT |
704 | */ |
705 | int invalidate_inode_pages2(struct address_space *mapping) | |
706 | { | |
707 | return invalidate_inode_pages2_range(mapping, 0, -1); | |
708 | } | |
709 | EXPORT_SYMBOL_GPL(invalidate_inode_pages2); | |
25d9e2d1 | 710 | |
711 | /** | |
712 | * truncate_pagecache - unmap and remove pagecache that has been truncated | |
713 | * @inode: inode | |
8a549bea | 714 | * @newsize: new file size |
25d9e2d1 | 715 | * |
716 | * inode's new i_size must already be written before truncate_pagecache | |
717 | * is called. | |
718 | * | |
719 | * This function should typically be called before the filesystem | |
720 | * releases resources associated with the freed range (eg. deallocates | |
721 | * blocks). This way, pagecache will always stay logically coherent | |
722 | * with on-disk format, and the filesystem would not have to deal with | |
723 | * situations such as writepage being called for a page that has already | |
724 | * had its underlying blocks deallocated. | |
725 | */ | |
7caef267 | 726 | void truncate_pagecache(struct inode *inode, loff_t newsize) |
25d9e2d1 | 727 | { |
cedabed4 | 728 | struct address_space *mapping = inode->i_mapping; |
8a549bea | 729 | loff_t holebegin = round_up(newsize, PAGE_SIZE); |
cedabed4 OH |
730 | |
731 | /* | |
732 | * unmap_mapping_range is called twice, first simply for | |
733 | * efficiency so that truncate_inode_pages does fewer | |
734 | * single-page unmaps. However after this first call, and | |
735 | * before truncate_inode_pages finishes, it is possible for | |
736 | * private pages to be COWed, which remain after | |
737 | * truncate_inode_pages finishes, hence the second | |
738 | * unmap_mapping_range call must be made for correctness. | |
739 | */ | |
8a549bea HD |
740 | unmap_mapping_range(mapping, holebegin, 0, 1); |
741 | truncate_inode_pages(mapping, newsize); | |
742 | unmap_mapping_range(mapping, holebegin, 0, 1); | |
25d9e2d1 | 743 | } |
744 | EXPORT_SYMBOL(truncate_pagecache); | |
745 | ||
2c27c65e CH |
746 | /** |
747 | * truncate_setsize - update inode and pagecache for a new file size | |
748 | * @inode: inode | |
749 | * @newsize: new file size | |
750 | * | |
382e27da JK |
751 | * truncate_setsize updates i_size and performs pagecache truncation (if |
752 | * necessary) to @newsize. It will be typically be called from the filesystem's | |
753 | * setattr function when ATTR_SIZE is passed in. | |
2c27c65e | 754 | * |
77783d06 | 755 | * Must be called with a lock serializing truncates and writes (generally |
9608703e | 756 | * i_rwsem but e.g. xfs uses a different lock) and before all filesystem |
77783d06 | 757 | * specific block truncation has been performed. |
2c27c65e CH |
758 | */ |
759 | void truncate_setsize(struct inode *inode, loff_t newsize) | |
760 | { | |
90a80202 JK |
761 | loff_t oldsize = inode->i_size; |
762 | ||
2c27c65e | 763 | i_size_write(inode, newsize); |
90a80202 JK |
764 | if (newsize > oldsize) |
765 | pagecache_isize_extended(inode, oldsize, newsize); | |
7caef267 | 766 | truncate_pagecache(inode, newsize); |
2c27c65e CH |
767 | } |
768 | EXPORT_SYMBOL(truncate_setsize); | |
769 | ||
90a80202 JK |
770 | /** |
771 | * pagecache_isize_extended - update pagecache after extension of i_size | |
772 | * @inode: inode for which i_size was extended | |
773 | * @from: original inode size | |
774 | * @to: new inode size | |
775 | * | |
776 | * Handle extension of inode size either caused by extending truncate or by | |
777 | * write starting after current i_size. We mark the page straddling current | |
778 | * i_size RO so that page_mkwrite() is called on the nearest write access to | |
779 | * the page. This way filesystem can be sure that page_mkwrite() is called on | |
780 | * the page before user writes to the page via mmap after the i_size has been | |
781 | * changed. | |
782 | * | |
783 | * The function must be called after i_size is updated so that page fault | |
784 | * coming after we unlock the page will already see the new i_size. | |
9608703e | 785 | * The function must be called while we still hold i_rwsem - this not only |
90a80202 JK |
786 | * makes sure i_size is stable but also that userspace cannot observe new |
787 | * i_size value before we are prepared to store mmap writes at new inode size. | |
788 | */ | |
789 | void pagecache_isize_extended(struct inode *inode, loff_t from, loff_t to) | |
790 | { | |
93407472 | 791 | int bsize = i_blocksize(inode); |
90a80202 JK |
792 | loff_t rounded_from; |
793 | struct page *page; | |
794 | pgoff_t index; | |
795 | ||
90a80202 JK |
796 | WARN_ON(to > inode->i_size); |
797 | ||
09cbfeaf | 798 | if (from >= to || bsize == PAGE_SIZE) |
90a80202 JK |
799 | return; |
800 | /* Page straddling @from will not have any hole block created? */ | |
801 | rounded_from = round_up(from, bsize); | |
09cbfeaf | 802 | if (to <= rounded_from || !(rounded_from & (PAGE_SIZE - 1))) |
90a80202 JK |
803 | return; |
804 | ||
09cbfeaf | 805 | index = from >> PAGE_SHIFT; |
90a80202 JK |
806 | page = find_lock_page(inode->i_mapping, index); |
807 | /* Page not cached? Nothing to do */ | |
808 | if (!page) | |
809 | return; | |
810 | /* | |
811 | * See clear_page_dirty_for_io() for details why set_page_dirty() | |
812 | * is needed. | |
813 | */ | |
814 | if (page_mkclean(page)) | |
815 | set_page_dirty(page); | |
816 | unlock_page(page); | |
09cbfeaf | 817 | put_page(page); |
90a80202 JK |
818 | } |
819 | EXPORT_SYMBOL(pagecache_isize_extended); | |
820 | ||
623e3db9 HD |
821 | /** |
822 | * truncate_pagecache_range - unmap and remove pagecache that is hole-punched | |
823 | * @inode: inode | |
824 | * @lstart: offset of beginning of hole | |
825 | * @lend: offset of last byte of hole | |
826 | * | |
827 | * This function should typically be called before the filesystem | |
828 | * releases resources associated with the freed range (eg. deallocates | |
829 | * blocks). This way, pagecache will always stay logically coherent | |
830 | * with on-disk format, and the filesystem would not have to deal with | |
831 | * situations such as writepage being called for a page that has already | |
832 | * had its underlying blocks deallocated. | |
833 | */ | |
834 | void truncate_pagecache_range(struct inode *inode, loff_t lstart, loff_t lend) | |
835 | { | |
836 | struct address_space *mapping = inode->i_mapping; | |
837 | loff_t unmap_start = round_up(lstart, PAGE_SIZE); | |
838 | loff_t unmap_end = round_down(1 + lend, PAGE_SIZE) - 1; | |
839 | /* | |
840 | * This rounding is currently just for example: unmap_mapping_range | |
841 | * expands its hole outwards, whereas we want it to contract the hole | |
842 | * inwards. However, existing callers of truncate_pagecache_range are | |
5a720394 LC |
843 | * doing their own page rounding first. Note that unmap_mapping_range |
844 | * allows holelen 0 for all, and we allow lend -1 for end of file. | |
623e3db9 HD |
845 | */ |
846 | ||
847 | /* | |
848 | * Unlike in truncate_pagecache, unmap_mapping_range is called only | |
849 | * once (before truncating pagecache), and without "even_cows" flag: | |
850 | * hole-punching should not remove private COWed pages from the hole. | |
851 | */ | |
852 | if ((u64)unmap_end > (u64)unmap_start) | |
853 | unmap_mapping_range(mapping, unmap_start, | |
854 | 1 + unmap_end - unmap_start, 0); | |
855 | truncate_inode_pages_range(mapping, lstart, lend); | |
856 | } | |
857 | EXPORT_SYMBOL(truncate_pagecache_range); |