truncate.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763
  1. /*
  2. * mm/truncate.c - code for taking down pages from address_spaces
  3. *
  4. * Copyright (C) 2002, Linus Torvalds
  5. *
  6. * 10Sep2002 Andrew Morton
  7. * Initial version.
  8. */
  9. #include <linux/kernel.h>
  10. #include <linux/backing-dev.h>
  11. #include <linux/gfp.h>
  12. #include <linux/mm.h>
  13. #include <linux/swap.h>
  14. #include <linux/export.h>
  15. #include <linux/pagemap.h>
  16. #include <linux/highmem.h>
  17. #include <linux/pagevec.h>
  18. #include <linux/task_io_accounting_ops.h>
  19. #include <linux/buffer_head.h> /* grr. try_to_release_page,
  20. do_invalidatepage */
  21. #include <linux/cleancache.h>
  22. #include "internal.h"
  23. static void clear_exceptional_entry(struct address_space *mapping,
  24. pgoff_t index, void *entry)
  25. {
  26. struct radix_tree_node *node;
  27. void **slot;
  28. /* Handled by shmem itself */
  29. if (shmem_mapping(mapping))
  30. return;
  31. spin_lock_irq(&mapping->tree_lock);
  32. /*
  33. * Regular page slots are stabilized by the page lock even
  34. * without the tree itself locked. These unlocked entries
  35. * need verification under the tree lock.
  36. */
  37. if (!__radix_tree_lookup(&mapping->page_tree, index, &node, &slot))
  38. goto unlock;
  39. if (*slot != entry)
  40. goto unlock;
  41. radix_tree_replace_slot(slot, NULL);
  42. mapping->nrshadows--;
  43. if (!node)
  44. goto unlock;
  45. workingset_node_shadows_dec(node);
  46. /*
  47. * Don't track node without shadow entries.
  48. *
  49. * Avoid acquiring the list_lru lock if already untracked.
  50. * The list_empty() test is safe as node->private_list is
  51. * protected by mapping->tree_lock.
  52. */
  53. if (!workingset_node_shadows(node) &&
  54. !list_empty(&node->private_list))
  55. list_lru_del(&workingset_shadow_nodes, &node->private_list);
  56. __radix_tree_delete_node(&mapping->page_tree, node);
  57. unlock:
  58. spin_unlock_irq(&mapping->tree_lock);
  59. }
  60. /**
  61. * do_invalidatepage - invalidate part or all of a page
  62. * @page: the page which is affected
  63. * @offset: start of the range to invalidate
  64. * @length: length of the range to invalidate
  65. *
  66. * do_invalidatepage() is called when all or part of the page has become
  67. * invalidated by a truncate operation.
  68. *
  69. * do_invalidatepage() does not have to release all buffers, but it must
  70. * ensure that no dirty buffer is left outside @offset and that no I/O
  71. * is underway against any of the blocks which are outside the truncation
  72. * point. Because the caller is about to free (and possibly reuse) those
  73. * blocks on-disk.
  74. */
  75. void do_invalidatepage(struct page *page, unsigned int offset,
  76. unsigned int length)
  77. {
  78. void (*invalidatepage)(struct page *, unsigned int, unsigned int);
  79. invalidatepage = page->mapping->a_ops->invalidatepage;
  80. #ifdef CONFIG_BLOCK
  81. if (!invalidatepage)
  82. invalidatepage = block_invalidatepage;
  83. #endif
  84. if (invalidatepage)
  85. (*invalidatepage)(page, offset, length);
  86. }
  87. /*
  88. * This cancels just the dirty bit on the kernel page itself, it
  89. * does NOT actually remove dirty bits on any mmap's that may be
  90. * around. It also leaves the page tagged dirty, so any sync
  91. * activity will still find it on the dirty lists, and in particular,
  92. * clear_page_dirty_for_io() will still look at the dirty bits in
  93. * the VM.
  94. *
  95. * Doing this should *normally* only ever be done when a page
  96. * is truncated, and is not actually mapped anywhere at all. However,
  97. * fs/buffer.c does this when it notices that somebody has cleaned
  98. * out all the buffers on a page without actually doing it through
  99. * the VM. Can you say "ext3 is horribly ugly"? Tought you could.
  100. */
  101. void cancel_dirty_page(struct page *page, unsigned int account_size)
  102. {
  103. if (TestClearPageDirty(page)) {
  104. struct address_space *mapping = page->mapping;
  105. if (mapping && mapping_cap_account_dirty(mapping)) {
  106. dec_zone_page_state(page, NR_FILE_DIRTY);
  107. dec_bdi_stat(mapping->backing_dev_info,
  108. BDI_RECLAIMABLE);
  109. if (account_size)
  110. task_io_account_cancelled_write(account_size);
  111. }
  112. }
  113. }
  114. EXPORT_SYMBOL(cancel_dirty_page);
  115. /*
  116. * If truncate cannot remove the fs-private metadata from the page, the page
  117. * becomes orphaned. It will be left on the LRU and may even be mapped into
  118. * user pagetables if we're racing with filemap_fault().
  119. *
  120. * We need to bale out if page->mapping is no longer equal to the original
  121. * mapping. This happens a) when the VM reclaimed the page while we waited on
  122. * its lock, b) when a concurrent invalidate_mapping_pages got there first and
  123. * c) when tmpfs swizzles a page between a tmpfs inode and swapper_space.
  124. */
  125. static int
  126. truncate_complete_page(struct address_space *mapping, struct page *page)
  127. {
  128. if (page->mapping != mapping)
  129. return -EIO;
  130. if (page_has_private(page))
  131. do_invalidatepage(page, 0, PAGE_CACHE_SIZE);
  132. cancel_dirty_page(page, PAGE_CACHE_SIZE);
  133. ClearPageMappedToDisk(page);
  134. delete_from_page_cache(page);
  135. return 0;
  136. }
  137. /*
  138. * This is for invalidate_mapping_pages(). That function can be called at
  139. * any time, and is not supposed to throw away dirty pages. But pages can
  140. * be marked dirty at any time too, so use remove_mapping which safely
  141. * discards clean, unused pages.
  142. *
  143. * Returns non-zero if the page was successfully invalidated.
  144. */
  145. static int
  146. invalidate_complete_page(struct address_space *mapping, struct page *page)
  147. {
  148. int ret;
  149. if (page->mapping != mapping)
  150. return 0;
  151. if (page_has_private(page) && !try_to_release_page(page, 0))
  152. return 0;
  153. ret = remove_mapping(mapping, page);
  154. return ret;
  155. }
  156. int truncate_inode_page(struct address_space *mapping, struct page *page)
  157. {
  158. if (page_mapped(page)) {
  159. unmap_mapping_range(mapping,
  160. (loff_t)page->index << PAGE_CACHE_SHIFT,
  161. PAGE_CACHE_SIZE, 0);
  162. }
  163. return truncate_complete_page(mapping, page);
  164. }
  165. /*
  166. * Used to get rid of pages on hardware memory corruption.
  167. */
  168. int generic_error_remove_page(struct address_space *mapping, struct page *page)
  169. {
  170. if (!mapping)
  171. return -EINVAL;
  172. /*
  173. * Only punch for normal data pages for now.
  174. * Handling other types like directories would need more auditing.
  175. */
  176. if (!S_ISREG(mapping->host->i_mode))
  177. return -EIO;
  178. return truncate_inode_page(mapping, page);
  179. }
  180. EXPORT_SYMBOL(generic_error_remove_page);
  181. /*
  182. * Safely invalidate one page from its pagecache mapping.
  183. * It only drops clean, unused pages. The page must be locked.
  184. *
  185. * Returns 1 if the page is successfully invalidated, otherwise 0.
  186. */
  187. int invalidate_inode_page(struct page *page)
  188. {
  189. struct address_space *mapping = page_mapping(page);
  190. if (!mapping)
  191. return 0;
  192. if (PageDirty(page) || PageWriteback(page))
  193. return 0;
  194. if (page_mapped(page))
  195. return 0;
  196. return invalidate_complete_page(mapping, page);
  197. }
  198. /**
  199. * truncate_inode_pages_range - truncate range of pages specified by start & end byte offsets
  200. * @mapping: mapping to truncate
  201. * @lstart: offset from which to truncate
  202. * @lend: offset to which to truncate (inclusive)
  203. *
  204. * Truncate the page cache, removing the pages that are between
  205. * specified offsets (and zeroing out partial pages
  206. * if lstart or lend + 1 is not page aligned).
  207. *
  208. * Truncate takes two passes - the first pass is nonblocking. It will not
  209. * block on page locks and it will not block on writeback. The second pass
  210. * will wait. This is to prevent as much IO as possible in the affected region.
  211. * The first pass will remove most pages, so the search cost of the second pass
  212. * is low.
  213. *
  214. * We pass down the cache-hot hint to the page freeing code. Even if the
  215. * mapping is large, it is probably the case that the final pages are the most
  216. * recently touched, and freeing happens in ascending file offset order.
  217. *
  218. * Note that since ->invalidatepage() accepts range to invalidate
  219. * truncate_inode_pages_range is able to handle cases where lend + 1 is not
  220. * page aligned properly.
  221. */
  222. void truncate_inode_pages_range(struct address_space *mapping,
  223. loff_t lstart, loff_t lend)
  224. {
  225. pgoff_t start; /* inclusive */
  226. pgoff_t end; /* exclusive */
  227. unsigned int partial_start; /* inclusive */
  228. unsigned int partial_end; /* exclusive */
  229. struct pagevec pvec;
  230. pgoff_t indices[PAGEVEC_SIZE];
  231. pgoff_t index;
  232. int i;
  233. cleancache_invalidate_inode(mapping);
  234. if (mapping->nrpages == 0 && mapping->nrshadows == 0)
  235. return;
  236. /* Offsets within partial pages */
  237. partial_start = lstart & (PAGE_CACHE_SIZE - 1);
  238. partial_end = (lend + 1) & (PAGE_CACHE_SIZE - 1);
  239. /*
  240. * 'start' and 'end' always covers the range of pages to be fully
  241. * truncated. Partial pages are covered with 'partial_start' at the
  242. * start of the range and 'partial_end' at the end of the range.
  243. * Note that 'end' is exclusive while 'lend' is inclusive.
  244. */
  245. start = (lstart + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
  246. if (lend == -1)
  247. /*
  248. * lend == -1 indicates end-of-file so we have to set 'end'
  249. * to the highest possible pgoff_t and since the type is
  250. * unsigned we're using -1.
  251. */
  252. end = -1;
  253. else
  254. end = (lend + 1) >> PAGE_CACHE_SHIFT;
  255. pagevec_init(&pvec, 0);
  256. index = start;
  257. while (index < end && pagevec_lookup_entries(&pvec, mapping, index,
  258. min(end - index, (pgoff_t)PAGEVEC_SIZE),
  259. indices)) {
  260. for (i = 0; i < pagevec_count(&pvec); i++) {
  261. struct page *page = pvec.pages[i];
  262. /* We rely upon deletion not changing page->index */
  263. index = indices[i];
  264. if (index >= end)
  265. break;
  266. if (radix_tree_exceptional_entry(page)) {
  267. clear_exceptional_entry(mapping, index, page);
  268. continue;
  269. }
  270. if (!trylock_page(page))
  271. continue;
  272. WARN_ON(page->index != index);
  273. if (PageWriteback(page)) {
  274. unlock_page(page);
  275. continue;
  276. }
  277. truncate_inode_page(mapping, page);
  278. unlock_page(page);
  279. }
  280. pagevec_remove_exceptionals(&pvec);
  281. pagevec_release(&pvec);
  282. cond_resched();
  283. index++;
  284. }
  285. if (partial_start) {
  286. struct page *page = find_lock_page(mapping, start - 1);
  287. if (page) {
  288. unsigned int top = PAGE_CACHE_SIZE;
  289. if (start > end) {
  290. /* Truncation within a single page */
  291. top = partial_end;
  292. partial_end = 0;
  293. }
  294. wait_on_page_writeback(page);
  295. zero_user_segment(page, partial_start, top);
  296. cleancache_invalidate_page(mapping, page);
  297. if (page_has_private(page))
  298. do_invalidatepage(page, partial_start,
  299. top - partial_start);
  300. unlock_page(page);
  301. page_cache_release(page);
  302. }
  303. }
  304. if (partial_end) {
  305. struct page *page = find_lock_page(mapping, end);
  306. if (page) {
  307. wait_on_page_writeback(page);
  308. zero_user_segment(page, 0, partial_end);
  309. cleancache_invalidate_page(mapping, page);
  310. if (page_has_private(page))
  311. do_invalidatepage(page, 0,
  312. partial_end);
  313. unlock_page(page);
  314. page_cache_release(page);
  315. }
  316. }
  317. /*
  318. * If the truncation happened within a single page no pages
  319. * will be released, just zeroed, so we can bail out now.
  320. */
  321. if (start >= end)
  322. return;
  323. index = start;
  324. for ( ; ; ) {
  325. cond_resched();
  326. if (!pagevec_lookup_entries(&pvec, mapping, index,
  327. min(end - index, (pgoff_t)PAGEVEC_SIZE), indices)) {
  328. /* If all gone from start onwards, we're done */
  329. if (index == start)
  330. break;
  331. /* Otherwise restart to make sure all gone */
  332. index = start;
  333. continue;
  334. }
  335. if (index == start && indices[0] >= end) {
  336. /* All gone out of hole to be punched, we're done */
  337. pagevec_remove_exceptionals(&pvec);
  338. pagevec_release(&pvec);
  339. break;
  340. }
  341. for (i = 0; i < pagevec_count(&pvec); i++) {
  342. struct page *page = pvec.pages[i];
  343. /* We rely upon deletion not changing page->index */
  344. index = indices[i];
  345. if (index >= end) {
  346. /* Restart punch to make sure all gone */
  347. index = start - 1;
  348. break;
  349. }
  350. if (radix_tree_exceptional_entry(page)) {
  351. clear_exceptional_entry(mapping, index, page);
  352. continue;
  353. }
  354. lock_page(page);
  355. WARN_ON(page->index != index);
  356. wait_on_page_writeback(page);
  357. truncate_inode_page(mapping, page);
  358. unlock_page(page);
  359. }
  360. pagevec_remove_exceptionals(&pvec);
  361. pagevec_release(&pvec);
  362. index++;
  363. }
  364. cleancache_invalidate_inode(mapping);
  365. }
  366. EXPORT_SYMBOL(truncate_inode_pages_range);
  367. /**
  368. * truncate_inode_pages - truncate *all* the pages from an offset
  369. * @mapping: mapping to truncate
  370. * @lstart: offset from which to truncate
  371. *
  372. * Called under (and serialised by) inode->i_mutex.
  373. *
  374. * Note: When this function returns, there can be a page in the process of
  375. * deletion (inside __delete_from_page_cache()) in the specified range. Thus
  376. * mapping->nrpages can be non-zero when this function returns even after
  377. * truncation of the whole mapping.
  378. */
  379. void truncate_inode_pages(struct address_space *mapping, loff_t lstart)
  380. {
  381. truncate_inode_pages_range(mapping, lstart, (loff_t)-1);
  382. }
  383. EXPORT_SYMBOL(truncate_inode_pages);
  384. /**
  385. * truncate_inode_pages_final - truncate *all* pages before inode dies
  386. * @mapping: mapping to truncate
  387. *
  388. * Called under (and serialized by) inode->i_mutex.
  389. *
  390. * Filesystems have to use this in the .evict_inode path to inform the
  391. * VM that this is the final truncate and the inode is going away.
  392. */
  393. void truncate_inode_pages_final(struct address_space *mapping)
  394. {
  395. unsigned long nrshadows;
  396. unsigned long nrpages;
  397. /*
  398. * Page reclaim can not participate in regular inode lifetime
  399. * management (can't call iput()) and thus can race with the
  400. * inode teardown. Tell it when the address space is exiting,
  401. * so that it does not install eviction information after the
  402. * final truncate has begun.
  403. */
  404. mapping_set_exiting(mapping);
  405. /*
  406. * When reclaim installs eviction entries, it increases
  407. * nrshadows first, then decreases nrpages. Make sure we see
  408. * this in the right order or we might miss an entry.
  409. */
  410. nrpages = mapping->nrpages;
  411. smp_rmb();
  412. nrshadows = mapping->nrshadows;
  413. if (nrpages || nrshadows) {
  414. /*
  415. * As truncation uses a lockless tree lookup, cycle
  416. * the tree lock to make sure any ongoing tree
  417. * modification that does not see AS_EXITING is
  418. * completed before starting the final truncate.
  419. */
  420. spin_lock_irq(&mapping->tree_lock);
  421. spin_unlock_irq(&mapping->tree_lock);
  422. truncate_inode_pages(mapping, 0);
  423. }
  424. }
  425. EXPORT_SYMBOL(truncate_inode_pages_final);
  426. /**
  427. * invalidate_mapping_pages - Invalidate all the unlocked pages of one inode
  428. * @mapping: the address_space which holds the pages to invalidate
  429. * @start: the offset 'from' which to invalidate
  430. * @end: the offset 'to' which to invalidate (inclusive)
  431. *
  432. * This function only removes the unlocked pages, if you want to
  433. * remove all the pages of one inode, you must call truncate_inode_pages.
  434. *
  435. * invalidate_mapping_pages() will not block on IO activity. It will not
  436. * invalidate pages which are dirty, locked, under writeback or mapped into
  437. * pagetables.
  438. */
  439. unsigned long invalidate_mapping_pages(struct address_space *mapping,
  440. pgoff_t start, pgoff_t end)
  441. {
  442. pgoff_t indices[PAGEVEC_SIZE];
  443. struct pagevec pvec;
  444. pgoff_t index = start;
  445. unsigned long ret;
  446. unsigned long count = 0;
  447. int i;
  448. pagevec_init(&pvec, 0);
  449. while (index <= end && pagevec_lookup_entries(&pvec, mapping, index,
  450. min(end - index, (pgoff_t)PAGEVEC_SIZE - 1) + 1,
  451. indices)) {
  452. for (i = 0; i < pagevec_count(&pvec); i++) {
  453. struct page *page = pvec.pages[i];
  454. /* We rely upon deletion not changing page->index */
  455. index = indices[i];
  456. if (index > end)
  457. break;
  458. if (radix_tree_exceptional_entry(page)) {
  459. clear_exceptional_entry(mapping, index, page);
  460. continue;
  461. }
  462. if (!trylock_page(page))
  463. continue;
  464. WARN_ON(page->index != index);
  465. ret = invalidate_inode_page(page);
  466. unlock_page(page);
  467. /*
  468. * Invalidation is a hint that the page is no longer
  469. * of interest and try to speed up its reclaim.
  470. */
  471. if (!ret)
  472. deactivate_page(page);
  473. count += ret;
  474. }
  475. pagevec_remove_exceptionals(&pvec);
  476. pagevec_release(&pvec);
  477. cond_resched();
  478. index++;
  479. }
  480. return count;
  481. }
  482. EXPORT_SYMBOL(invalidate_mapping_pages);
  483. /*
  484. * This is like invalidate_complete_page(), except it ignores the page's
  485. * refcount. We do this because invalidate_inode_pages2() needs stronger
  486. * invalidation guarantees, and cannot afford to leave pages behind because
  487. * shrink_page_list() has a temp ref on them, or because they're transiently
  488. * sitting in the lru_cache_add() pagevecs.
  489. */
  490. static int
  491. invalidate_complete_page2(struct address_space *mapping, struct page *page)
  492. {
  493. if (page->mapping != mapping)
  494. return 0;
  495. if (page_has_private(page) && !try_to_release_page(page, GFP_KERNEL))
  496. return 0;
  497. spin_lock_irq(&mapping->tree_lock);
  498. if (PageDirty(page))
  499. goto failed;
  500. BUG_ON(page_has_private(page));
  501. __delete_from_page_cache(page, NULL);
  502. spin_unlock_irq(&mapping->tree_lock);
  503. if (mapping->a_ops->freepage)
  504. mapping->a_ops->freepage(page);
  505. page_cache_release(page); /* pagecache ref */
  506. return 1;
  507. failed:
  508. spin_unlock_irq(&mapping->tree_lock);
  509. return 0;
  510. }
  511. static int do_launder_page(struct address_space *mapping, struct page *page)
  512. {
  513. if (!PageDirty(page))
  514. return 0;
  515. if (page->mapping != mapping || mapping->a_ops->launder_page == NULL)
  516. return 0;
  517. return mapping->a_ops->launder_page(page);
  518. }
  519. /**
  520. * invalidate_inode_pages2_range - remove range of pages from an address_space
  521. * @mapping: the address_space
  522. * @start: the page offset 'from' which to invalidate
  523. * @end: the page offset 'to' which to invalidate (inclusive)
  524. *
  525. * Any pages which are found to be mapped into pagetables are unmapped prior to
  526. * invalidation.
  527. *
  528. * Returns -EBUSY if any pages could not be invalidated.
  529. */
  530. int invalidate_inode_pages2_range(struct address_space *mapping,
  531. pgoff_t start, pgoff_t end)
  532. {
  533. pgoff_t indices[PAGEVEC_SIZE];
  534. struct pagevec pvec;
  535. pgoff_t index;
  536. int i;
  537. int ret = 0;
  538. int ret2 = 0;
  539. int did_range_unmap = 0;
  540. cleancache_invalidate_inode(mapping);
  541. pagevec_init(&pvec, 0);
  542. index = start;
  543. while (index <= end && pagevec_lookup_entries(&pvec, mapping, index,
  544. min(end - index, (pgoff_t)PAGEVEC_SIZE - 1) + 1,
  545. indices)) {
  546. for (i = 0; i < pagevec_count(&pvec); i++) {
  547. struct page *page = pvec.pages[i];
  548. /* We rely upon deletion not changing page->index */
  549. index = indices[i];
  550. if (index > end)
  551. break;
  552. if (radix_tree_exceptional_entry(page)) {
  553. clear_exceptional_entry(mapping, index, page);
  554. continue;
  555. }
  556. lock_page(page);
  557. WARN_ON(page->index != index);
  558. if (page->mapping != mapping) {
  559. unlock_page(page);
  560. continue;
  561. }
  562. wait_on_page_writeback(page);
  563. if (page_mapped(page)) {
  564. if (!did_range_unmap) {
  565. /*
  566. * Zap the rest of the file in one hit.
  567. */
  568. unmap_mapping_range(mapping,
  569. (loff_t)index << PAGE_CACHE_SHIFT,
  570. (loff_t)(1 + end - index)
  571. << PAGE_CACHE_SHIFT,
  572. 0);
  573. did_range_unmap = 1;
  574. } else {
  575. /*
  576. * Just zap this page
  577. */
  578. unmap_mapping_range(mapping,
  579. (loff_t)index << PAGE_CACHE_SHIFT,
  580. PAGE_CACHE_SIZE, 0);
  581. }
  582. }
  583. BUG_ON(page_mapped(page));
  584. ret2 = do_launder_page(mapping, page);
  585. if (ret2 == 0) {
  586. if (!invalidate_complete_page2(mapping, page))
  587. ret2 = -EBUSY;
  588. }
  589. if (ret2 < 0)
  590. ret = ret2;
  591. unlock_page(page);
  592. }
  593. pagevec_remove_exceptionals(&pvec);
  594. pagevec_release(&pvec);
  595. cond_resched();
  596. index++;
  597. }
  598. cleancache_invalidate_inode(mapping);
  599. return ret;
  600. }
  601. EXPORT_SYMBOL_GPL(invalidate_inode_pages2_range);
  602. /**
  603. * invalidate_inode_pages2 - remove all pages from an address_space
  604. * @mapping: the address_space
  605. *
  606. * Any pages which are found to be mapped into pagetables are unmapped prior to
  607. * invalidation.
  608. *
  609. * Returns -EBUSY if any pages could not be invalidated.
  610. */
  611. int invalidate_inode_pages2(struct address_space *mapping)
  612. {
  613. return invalidate_inode_pages2_range(mapping, 0, -1);
  614. }
  615. EXPORT_SYMBOL_GPL(invalidate_inode_pages2);
  616. /**
  617. * truncate_pagecache - unmap and remove pagecache that has been truncated
  618. * @inode: inode
  619. * @newsize: new file size
  620. *
  621. * inode's new i_size must already be written before truncate_pagecache
  622. * is called.
  623. *
  624. * This function should typically be called before the filesystem
  625. * releases resources associated with the freed range (eg. deallocates
  626. * blocks). This way, pagecache will always stay logically coherent
  627. * with on-disk format, and the filesystem would not have to deal with
  628. * situations such as writepage being called for a page that has already
  629. * had its underlying blocks deallocated.
  630. */
  631. void truncate_pagecache(struct inode *inode, loff_t newsize)
  632. {
  633. struct address_space *mapping = inode->i_mapping;
  634. loff_t holebegin = round_up(newsize, PAGE_SIZE);
  635. /*
  636. * unmap_mapping_range is called twice, first simply for
  637. * efficiency so that truncate_inode_pages does fewer
  638. * single-page unmaps. However after this first call, and
  639. * before truncate_inode_pages finishes, it is possible for
  640. * private pages to be COWed, which remain after
  641. * truncate_inode_pages finishes, hence the second
  642. * unmap_mapping_range call must be made for correctness.
  643. */
  644. unmap_mapping_range(mapping, holebegin, 0, 1);
  645. truncate_inode_pages(mapping, newsize);
  646. unmap_mapping_range(mapping, holebegin, 0, 1);
  647. }
  648. EXPORT_SYMBOL(truncate_pagecache);
  649. /**
  650. * truncate_setsize - update inode and pagecache for a new file size
  651. * @inode: inode
  652. * @newsize: new file size
  653. *
  654. * truncate_setsize updates i_size and performs pagecache truncation (if
  655. * necessary) to @newsize. It will be typically be called from the filesystem's
  656. * setattr function when ATTR_SIZE is passed in.
  657. *
  658. * Must be called with inode_mutex held and before all filesystem specific
  659. * block truncation has been performed.
  660. */
  661. void truncate_setsize(struct inode *inode, loff_t newsize)
  662. {
  663. i_size_write(inode, newsize);
  664. truncate_pagecache(inode, newsize);
  665. }
  666. EXPORT_SYMBOL(truncate_setsize);
  667. /**
  668. * truncate_pagecache_range - unmap and remove pagecache that is hole-punched
  669. * @inode: inode
  670. * @lstart: offset of beginning of hole
  671. * @lend: offset of last byte of hole
  672. *
  673. * This function should typically be called before the filesystem
  674. * releases resources associated with the freed range (eg. deallocates
  675. * blocks). This way, pagecache will always stay logically coherent
  676. * with on-disk format, and the filesystem would not have to deal with
  677. * situations such as writepage being called for a page that has already
  678. * had its underlying blocks deallocated.
  679. */
  680. void truncate_pagecache_range(struct inode *inode, loff_t lstart, loff_t lend)
  681. {
  682. struct address_space *mapping = inode->i_mapping;
  683. loff_t unmap_start = round_up(lstart, PAGE_SIZE);
  684. loff_t unmap_end = round_down(1 + lend, PAGE_SIZE) - 1;
  685. /*
  686. * This rounding is currently just for example: unmap_mapping_range
  687. * expands its hole outwards, whereas we want it to contract the hole
  688. * inwards. However, existing callers of truncate_pagecache_range are
  689. * doing their own page rounding first. Note that unmap_mapping_range
  690. * allows holelen 0 for all, and we allow lend -1 for end of file.
  691. */
  692. /*
  693. * Unlike in truncate_pagecache, unmap_mapping_range is called only
  694. * once (before truncating pagecache), and without "even_cows" flag:
  695. * hole-punching should not remove private COWed pages from the hole.
  696. */
  697. if ((u64)unmap_end > (u64)unmap_start)
  698. unmap_mapping_range(mapping, unmap_start,
  699. 1 + unmap_end - unmap_start, 0);
  700. truncate_inode_pages_range(mapping, lstart, lend);
  701. }
  702. EXPORT_SYMBOL(truncate_pagecache_range);