4 * Copyright (C) 1994-1999 Linus Torvalds
8 * This file handles the generic file mmap semantics used by
9 * most "normal" filesystems (but you don't /have/ to use this:
10 * the NFS filesystem used to do this differently, for example)
12 #include <linux/export.h>
13 #include <linux/compiler.h>
14 #include <linux/dax.h>
16 #include <linux/sched/signal.h>
17 #include <linux/uaccess.h>
18 #include <linux/capability.h>
19 #include <linux/kernel_stat.h>
20 #include <linux/gfp.h>
22 #include <linux/swap.h>
23 #include <linux/mman.h>
24 #include <linux/pagemap.h>
25 #include <linux/file.h>
26 #include <linux/uio.h>
27 #include <linux/hash.h>
28 #include <linux/writeback.h>
29 #include <linux/backing-dev.h>
30 #include <linux/pagevec.h>
31 #include <linux/blkdev.h>
32 #include <linux/security.h>
33 #include <linux/cpuset.h>
34 #include <linux/hugetlb.h>
35 #include <linux/memcontrol.h>
36 #include <linux/cleancache.h>
37 #include <linux/shmem_fs.h>
38 #include <linux/rmap.h>
41 #define CREATE_TRACE_POINTS
42 #include <trace/events/filemap.h>
45 * FIXME: remove all knowledge of the buffer layer from the core VM
47 #include <linux/buffer_head.h> /* for try_to_free_buffers */
52 * Shared mappings implemented 30.11.1994. It's not fully working yet,
55 * Shared mappings now work. 15.8.1995 Bruno.
57 * finished 'unifying' the page and buffer cache and SMP-threaded the
58 * page-cache, 21.05.1999, Ingo Molnar <mingo@redhat.com>
60 * SMP-threaded pagemap-LRU 1999, Andrea Arcangeli <andrea@suse.de>
66 * ->i_mmap_rwsem (truncate_pagecache)
67 * ->private_lock (__free_pte->__set_page_dirty_buffers)
68 * ->swap_lock (exclusive_swap_page, others)
72 * ->i_mmap_rwsem (truncate->unmap_mapping_range)
76 * ->page_table_lock or pte_lock (various, mainly in memory.c)
77 * ->i_pages lock (arch-dependent flush_dcache_mmap_lock)
80 * ->lock_page (access_process_vm)
82 * ->i_mutex (generic_perform_write)
83 * ->mmap_sem (fault_in_pages_readable->do_page_fault)
86 * sb_lock (fs/fs-writeback.c)
87 * ->i_pages lock (__sync_single_inode)
90 * ->anon_vma.lock (vma_adjust)
93 * ->page_table_lock or pte_lock (anon_vma_prepare and various)
95 * ->page_table_lock or pte_lock
96 * ->swap_lock (try_to_unmap_one)
97 * ->private_lock (try_to_unmap_one)
98 * ->i_pages lock (try_to_unmap_one)
99 * ->zone_lru_lock(zone) (follow_page->mark_page_accessed)
100 * ->zone_lru_lock(zone) (check_pte_range->isolate_lru_page)
101 * ->private_lock (page_remove_rmap->set_page_dirty)
102 * ->i_pages lock (page_remove_rmap->set_page_dirty)
103 * bdi.wb->list_lock (page_remove_rmap->set_page_dirty)
104 * ->inode->i_lock (page_remove_rmap->set_page_dirty)
105 * ->memcg->move_lock (page_remove_rmap->lock_page_memcg)
106 * bdi.wb->list_lock (zap_pte_range->set_page_dirty)
107 * ->inode->i_lock (zap_pte_range->set_page_dirty)
108 * ->private_lock (zap_pte_range->__set_page_dirty_buffers)
111 * ->tasklist_lock (memory_failure, collect_procs_ao)
114 static void page_cache_delete(struct address_space *mapping,
115 struct page *page, void *shadow)
117 XA_STATE(xas, &mapping->i_pages, page->index);
120 mapping_set_update(&xas, mapping);
122 /* hugetlb pages are represented by a single entry in the xarray */
123 if (!PageHuge(page)) {
124 xas_set_order(&xas, page->index, compound_order(page));
125 nr = 1U << compound_order(page);
128 VM_BUG_ON_PAGE(!PageLocked(page), page);
129 VM_BUG_ON_PAGE(PageTail(page), page);
130 VM_BUG_ON_PAGE(nr != 1 && shadow, page);
132 xas_store(&xas, shadow);
133 xas_init_marks(&xas);
135 page->mapping = NULL;
136 /* Leave page->index set: truncation lookup relies upon it */
139 mapping->nrexceptional += nr;
141 * Make sure the nrexceptional update is committed before
142 * the nrpages update so that final truncate racing
143 * with reclaim does not see both counters 0 at the
144 * same time and miss a shadow entry.
148 mapping->nrpages -= nr;
151 static void unaccount_page_cache_page(struct address_space *mapping,
157 * if we're uptodate, flush out into the cleancache, otherwise
158 * invalidate any existing cleancache entries. We can't leave
159 * stale data around in the cleancache once our page is gone
161 if (PageUptodate(page) && PageMappedToDisk(page))
162 cleancache_put_page(page);
164 cleancache_invalidate_page(mapping, page);
166 VM_BUG_ON_PAGE(PageTail(page), page);
167 VM_BUG_ON_PAGE(page_mapped(page), page);
168 if (!IS_ENABLED(CONFIG_DEBUG_VM) && unlikely(page_mapped(page))) {
171 pr_alert("BUG: Bad page cache in process %s pfn:%05lx\n",
172 current->comm, page_to_pfn(page));
173 dump_page(page, "still mapped when deleted");
175 add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
177 mapcount = page_mapcount(page);
178 if (mapping_exiting(mapping) &&
179 page_count(page) >= mapcount + 2) {
181 * All vmas have already been torn down, so it's
182 * a good bet that actually the page is unmapped,
183 * and we'd prefer not to leak it: if we're wrong,
184 * some other bad page check should catch it later.
186 page_mapcount_reset(page);
187 page_ref_sub(page, mapcount);
191 /* hugetlb pages do not participate in page cache accounting. */
195 nr = hpage_nr_pages(page);
197 __mod_node_page_state(page_pgdat(page), NR_FILE_PAGES, -nr);
198 if (PageSwapBacked(page)) {
199 __mod_node_page_state(page_pgdat(page), NR_SHMEM, -nr);
200 if (PageTransHuge(page))
201 __dec_node_page_state(page, NR_SHMEM_THPS);
203 VM_BUG_ON_PAGE(PageTransHuge(page), page);
207 * At this point page must be either written or cleaned by
208 * truncate. Dirty page here signals a bug and loss of
211 * This fixes dirty accounting after removing the page entirely
212 * but leaves PageDirty set: it has no effect for truncated
213 * page and anyway will be cleared before returning page into
216 if (WARN_ON_ONCE(PageDirty(page)))
217 account_page_cleaned(page, mapping, inode_to_wb(mapping->host));
221 * Delete a page from the page cache and free it. Caller has to make
222 * sure the page is locked and that nobody else uses it - or that usage
223 * is safe. The caller must hold the i_pages lock.
225 void __delete_from_page_cache(struct page *page, void *shadow)
227 struct address_space *mapping = page->mapping;
229 trace_mm_filemap_delete_from_page_cache(page);
231 unaccount_page_cache_page(mapping, page);
232 page_cache_delete(mapping, page, shadow);
235 static void page_cache_free_page(struct address_space *mapping,
238 void (*freepage)(struct page *);
240 freepage = mapping->a_ops->freepage;
244 if (PageTransHuge(page) && !PageHuge(page)) {
245 page_ref_sub(page, HPAGE_PMD_NR);
246 VM_BUG_ON_PAGE(page_count(page) <= 0, page);
253 * delete_from_page_cache - delete page from page cache
254 * @page: the page which the kernel is trying to remove from page cache
256 * This must be called only on pages that have been verified to be in the page
257 * cache and locked. It will never put the page into the free list, the caller
258 * has a reference on the page.
260 void delete_from_page_cache(struct page *page)
262 struct address_space *mapping = page_mapping(page);
265 BUG_ON(!PageLocked(page));
266 xa_lock_irqsave(&mapping->i_pages, flags);
267 __delete_from_page_cache(page, NULL);
268 xa_unlock_irqrestore(&mapping->i_pages, flags);
270 page_cache_free_page(mapping, page);
272 EXPORT_SYMBOL(delete_from_page_cache);
275 * page_cache_tree_delete_batch - delete several pages from page cache
276 * @mapping: the mapping to which pages belong
277 * @pvec: pagevec with pages to delete
279 * The function walks over mapping->i_pages and removes pages passed in @pvec
280 * from the mapping. The function expects @pvec to be sorted by page index.
281 * It tolerates holes in @pvec (mapping entries at those indices are not
282 * modified). The function expects only THP head pages to be present in the
283 * @pvec and takes care to delete all corresponding tail pages from the
286 * The function expects the i_pages lock to be held.
289 page_cache_tree_delete_batch(struct address_space *mapping,
290 struct pagevec *pvec)
292 struct radix_tree_iter iter;
295 int i = 0, tail_pages = 0;
299 start = pvec->pages[0]->index;
300 radix_tree_for_each_slot(slot, &mapping->i_pages, &iter, start) {
301 if (i >= pagevec_count(pvec) && !tail_pages)
303 page = radix_tree_deref_slot_protected(slot,
304 &mapping->i_pages.xa_lock);
305 if (xa_is_value(page))
309 * Some page got inserted in our range? Skip it. We
310 * have our pages locked so they are protected from
313 if (page != pvec->pages[i])
315 WARN_ON_ONCE(!PageLocked(page));
316 if (PageTransHuge(page) && !PageHuge(page))
317 tail_pages = HPAGE_PMD_NR - 1;
318 page->mapping = NULL;
320 * Leave page->index set: truncation lookup relies
327 radix_tree_clear_tags(&mapping->i_pages, iter.node, slot);
328 __radix_tree_replace(&mapping->i_pages, iter.node, slot, NULL,
329 workingset_lookup_update(mapping));
332 mapping->nrpages -= total_pages;
335 void delete_from_page_cache_batch(struct address_space *mapping,
336 struct pagevec *pvec)
341 if (!pagevec_count(pvec))
344 xa_lock_irqsave(&mapping->i_pages, flags);
345 for (i = 0; i < pagevec_count(pvec); i++) {
346 trace_mm_filemap_delete_from_page_cache(pvec->pages[i]);
348 unaccount_page_cache_page(mapping, pvec->pages[i]);
350 page_cache_tree_delete_batch(mapping, pvec);
351 xa_unlock_irqrestore(&mapping->i_pages, flags);
353 for (i = 0; i < pagevec_count(pvec); i++)
354 page_cache_free_page(mapping, pvec->pages[i]);
357 int filemap_check_errors(struct address_space *mapping)
360 /* Check for outstanding write errors */
361 if (test_bit(AS_ENOSPC, &mapping->flags) &&
362 test_and_clear_bit(AS_ENOSPC, &mapping->flags))
364 if (test_bit(AS_EIO, &mapping->flags) &&
365 test_and_clear_bit(AS_EIO, &mapping->flags))
369 EXPORT_SYMBOL(filemap_check_errors);
371 static int filemap_check_and_keep_errors(struct address_space *mapping)
373 /* Check for outstanding write errors */
374 if (test_bit(AS_EIO, &mapping->flags))
376 if (test_bit(AS_ENOSPC, &mapping->flags))
382 * __filemap_fdatawrite_range - start writeback on mapping dirty pages in range
383 * @mapping: address space structure to write
384 * @start: offset in bytes where the range starts
385 * @end: offset in bytes where the range ends (inclusive)
386 * @sync_mode: enable synchronous operation
388 * Start writeback against all of a mapping's dirty pages that lie
389 * within the byte offsets <start, end> inclusive.
391 * If sync_mode is WB_SYNC_ALL then this is a "data integrity" operation, as
392 * opposed to a regular memory cleansing writeback. The difference between
393 * these two operations is that if a dirty page/buffer is encountered, it must
394 * be waited upon, and not just skipped over.
396 int __filemap_fdatawrite_range(struct address_space *mapping, loff_t start,
397 loff_t end, int sync_mode)
400 struct writeback_control wbc = {
401 .sync_mode = sync_mode,
402 .nr_to_write = LONG_MAX,
403 .range_start = start,
407 if (!mapping_cap_writeback_dirty(mapping))
410 wbc_attach_fdatawrite_inode(&wbc, mapping->host);
411 ret = do_writepages(mapping, &wbc);
412 wbc_detach_inode(&wbc);
416 static inline int __filemap_fdatawrite(struct address_space *mapping,
419 return __filemap_fdatawrite_range(mapping, 0, LLONG_MAX, sync_mode);
422 int filemap_fdatawrite(struct address_space *mapping)
424 return __filemap_fdatawrite(mapping, WB_SYNC_ALL);
426 EXPORT_SYMBOL(filemap_fdatawrite);
428 int filemap_fdatawrite_range(struct address_space *mapping, loff_t start,
431 return __filemap_fdatawrite_range(mapping, start, end, WB_SYNC_ALL);
433 EXPORT_SYMBOL(filemap_fdatawrite_range);
436 * filemap_flush - mostly a non-blocking flush
437 * @mapping: target address_space
439 * This is a mostly non-blocking flush. Not suitable for data-integrity
440 * purposes - I/O may not be started against all dirty pages.
442 int filemap_flush(struct address_space *mapping)
444 return __filemap_fdatawrite(mapping, WB_SYNC_NONE);
446 EXPORT_SYMBOL(filemap_flush);
449 * filemap_range_has_page - check if a page exists in range.
450 * @mapping: address space within which to check
451 * @start_byte: offset in bytes where the range starts
452 * @end_byte: offset in bytes where the range ends (inclusive)
454 * Find at least one page in the range supplied, usually used to check if
455 * direct writing in this range will trigger a writeback.
457 bool filemap_range_has_page(struct address_space *mapping,
458 loff_t start_byte, loff_t end_byte)
460 pgoff_t index = start_byte >> PAGE_SHIFT;
461 pgoff_t end = end_byte >> PAGE_SHIFT;
464 if (end_byte < start_byte)
467 if (mapping->nrpages == 0)
470 if (!find_get_pages_range(mapping, &index, end, 1, &page))
475 EXPORT_SYMBOL(filemap_range_has_page);
477 static void __filemap_fdatawait_range(struct address_space *mapping,
478 loff_t start_byte, loff_t end_byte)
480 pgoff_t index = start_byte >> PAGE_SHIFT;
481 pgoff_t end = end_byte >> PAGE_SHIFT;
485 if (end_byte < start_byte)
489 while (index <= end) {
492 nr_pages = pagevec_lookup_range_tag(&pvec, mapping, &index,
493 end, PAGECACHE_TAG_WRITEBACK);
497 for (i = 0; i < nr_pages; i++) {
498 struct page *page = pvec.pages[i];
500 wait_on_page_writeback(page);
501 ClearPageError(page);
503 pagevec_release(&pvec);
509 * filemap_fdatawait_range - wait for writeback to complete
510 * @mapping: address space structure to wait for
511 * @start_byte: offset in bytes where the range starts
512 * @end_byte: offset in bytes where the range ends (inclusive)
514 * Walk the list of under-writeback pages of the given address space
515 * in the given range and wait for all of them. Check error status of
516 * the address space and return it.
518 * Since the error status of the address space is cleared by this function,
519 * callers are responsible for checking the return value and handling and/or
520 * reporting the error.
522 int filemap_fdatawait_range(struct address_space *mapping, loff_t start_byte,
525 __filemap_fdatawait_range(mapping, start_byte, end_byte);
526 return filemap_check_errors(mapping);
528 EXPORT_SYMBOL(filemap_fdatawait_range);
531 * file_fdatawait_range - wait for writeback to complete
532 * @file: file pointing to address space structure to wait for
533 * @start_byte: offset in bytes where the range starts
534 * @end_byte: offset in bytes where the range ends (inclusive)
536 * Walk the list of under-writeback pages of the address space that file
537 * refers to, in the given range and wait for all of them. Check error
538 * status of the address space vs. the file->f_wb_err cursor and return it.
540 * Since the error status of the file is advanced by this function,
541 * callers are responsible for checking the return value and handling and/or
542 * reporting the error.
544 int file_fdatawait_range(struct file *file, loff_t start_byte, loff_t end_byte)
546 struct address_space *mapping = file->f_mapping;
548 __filemap_fdatawait_range(mapping, start_byte, end_byte);
549 return file_check_and_advance_wb_err(file);
551 EXPORT_SYMBOL(file_fdatawait_range);
554 * filemap_fdatawait_keep_errors - wait for writeback without clearing errors
555 * @mapping: address space structure to wait for
557 * Walk the list of under-writeback pages of the given address space
558 * and wait for all of them. Unlike filemap_fdatawait(), this function
559 * does not clear error status of the address space.
561 * Use this function if callers don't handle errors themselves. Expected
562 * call sites are system-wide / filesystem-wide data flushers: e.g. sync(2),
565 int filemap_fdatawait_keep_errors(struct address_space *mapping)
567 __filemap_fdatawait_range(mapping, 0, LLONG_MAX);
568 return filemap_check_and_keep_errors(mapping);
570 EXPORT_SYMBOL(filemap_fdatawait_keep_errors);
572 static bool mapping_needs_writeback(struct address_space *mapping)
574 return (!dax_mapping(mapping) && mapping->nrpages) ||
575 (dax_mapping(mapping) && mapping->nrexceptional);
578 int filemap_write_and_wait(struct address_space *mapping)
582 if (mapping_needs_writeback(mapping)) {
583 err = filemap_fdatawrite(mapping);
585 * Even if the above returned error, the pages may be
586 * written partially (e.g. -ENOSPC), so we wait for it.
587 * But the -EIO is special case, it may indicate the worst
588 * thing (e.g. bug) happened, so we avoid waiting for it.
591 int err2 = filemap_fdatawait(mapping);
595 /* Clear any previously stored errors */
596 filemap_check_errors(mapping);
599 err = filemap_check_errors(mapping);
603 EXPORT_SYMBOL(filemap_write_and_wait);
606 * filemap_write_and_wait_range - write out & wait on a file range
607 * @mapping: the address_space for the pages
608 * @lstart: offset in bytes where the range starts
609 * @lend: offset in bytes where the range ends (inclusive)
611 * Write out and wait upon file offsets lstart->lend, inclusive.
613 * Note that @lend is inclusive (describes the last byte to be written) so
614 * that this function can be used to write to the very end-of-file (end = -1).
616 int filemap_write_and_wait_range(struct address_space *mapping,
617 loff_t lstart, loff_t lend)
621 if (mapping_needs_writeback(mapping)) {
622 err = __filemap_fdatawrite_range(mapping, lstart, lend,
624 /* See comment of filemap_write_and_wait() */
626 int err2 = filemap_fdatawait_range(mapping,
631 /* Clear any previously stored errors */
632 filemap_check_errors(mapping);
635 err = filemap_check_errors(mapping);
639 EXPORT_SYMBOL(filemap_write_and_wait_range);
641 void __filemap_set_wb_err(struct address_space *mapping, int err)
643 errseq_t eseq = errseq_set(&mapping->wb_err, err);
645 trace_filemap_set_wb_err(mapping, eseq);
647 EXPORT_SYMBOL(__filemap_set_wb_err);
650 * file_check_and_advance_wb_err - report wb error (if any) that was previously
651 * and advance wb_err to current one
652 * @file: struct file on which the error is being reported
654 * When userland calls fsync (or something like nfsd does the equivalent), we
655 * want to report any writeback errors that occurred since the last fsync (or
656 * since the file was opened if there haven't been any).
658 * Grab the wb_err from the mapping. If it matches what we have in the file,
659 * then just quickly return 0. The file is all caught up.
661 * If it doesn't match, then take the mapping value, set the "seen" flag in
662 * it and try to swap it into place. If it works, or another task beat us
663 * to it with the new value, then update the f_wb_err and return the error
664 * portion. The error at this point must be reported via proper channels
665 * (a'la fsync, or NFS COMMIT operation, etc.).
667 * While we handle mapping->wb_err with atomic operations, the f_wb_err
668 * value is protected by the f_lock since we must ensure that it reflects
669 * the latest value swapped in for this file descriptor.
671 int file_check_and_advance_wb_err(struct file *file)
674 errseq_t old = READ_ONCE(file->f_wb_err);
675 struct address_space *mapping = file->f_mapping;
677 /* Locklessly handle the common case where nothing has changed */
678 if (errseq_check(&mapping->wb_err, old)) {
679 /* Something changed, must use slow path */
680 spin_lock(&file->f_lock);
681 old = file->f_wb_err;
682 err = errseq_check_and_advance(&mapping->wb_err,
684 trace_file_check_and_advance_wb_err(file, old);
685 spin_unlock(&file->f_lock);
689 * We're mostly using this function as a drop in replacement for
690 * filemap_check_errors. Clear AS_EIO/AS_ENOSPC to emulate the effect
691 * that the legacy code would have had on these flags.
693 clear_bit(AS_EIO, &mapping->flags);
694 clear_bit(AS_ENOSPC, &mapping->flags);
697 EXPORT_SYMBOL(file_check_and_advance_wb_err);
700 * file_write_and_wait_range - write out & wait on a file range
701 * @file: file pointing to address_space with pages
702 * @lstart: offset in bytes where the range starts
703 * @lend: offset in bytes where the range ends (inclusive)
705 * Write out and wait upon file offsets lstart->lend, inclusive.
707 * Note that @lend is inclusive (describes the last byte to be written) so
708 * that this function can be used to write to the very end-of-file (end = -1).
710 * After writing out and waiting on the data, we check and advance the
711 * f_wb_err cursor to the latest value, and return any errors detected there.
713 int file_write_and_wait_range(struct file *file, loff_t lstart, loff_t lend)
716 struct address_space *mapping = file->f_mapping;
718 if (mapping_needs_writeback(mapping)) {
719 err = __filemap_fdatawrite_range(mapping, lstart, lend,
721 /* See comment of filemap_write_and_wait() */
723 __filemap_fdatawait_range(mapping, lstart, lend);
725 err2 = file_check_and_advance_wb_err(file);
730 EXPORT_SYMBOL(file_write_and_wait_range);
733 * replace_page_cache_page - replace a pagecache page with a new one
734 * @old: page to be replaced
735 * @new: page to replace with
736 * @gfp_mask: allocation mode
738 * This function replaces a page in the pagecache with a new one. On
739 * success it acquires the pagecache reference for the new page and
740 * drops it for the old page. Both the old and new pages must be
741 * locked. This function does not add the new page to the LRU, the
742 * caller must do that.
744 * The remove + add is atomic. This function cannot fail.
746 int replace_page_cache_page(struct page *old, struct page *new, gfp_t gfp_mask)
748 struct address_space *mapping = old->mapping;
749 void (*freepage)(struct page *) = mapping->a_ops->freepage;
750 pgoff_t offset = old->index;
751 XA_STATE(xas, &mapping->i_pages, offset);
754 VM_BUG_ON_PAGE(!PageLocked(old), old);
755 VM_BUG_ON_PAGE(!PageLocked(new), new);
756 VM_BUG_ON_PAGE(new->mapping, new);
759 new->mapping = mapping;
762 xas_lock_irqsave(&xas, flags);
763 xas_store(&xas, new);
766 /* hugetlb pages do not participate in page cache accounting. */
768 __dec_node_page_state(new, NR_FILE_PAGES);
770 __inc_node_page_state(new, NR_FILE_PAGES);
771 if (PageSwapBacked(old))
772 __dec_node_page_state(new, NR_SHMEM);
773 if (PageSwapBacked(new))
774 __inc_node_page_state(new, NR_SHMEM);
775 xas_unlock_irqrestore(&xas, flags);
776 mem_cgroup_migrate(old, new);
783 EXPORT_SYMBOL_GPL(replace_page_cache_page);
785 static int __add_to_page_cache_locked(struct page *page,
786 struct address_space *mapping,
787 pgoff_t offset, gfp_t gfp_mask,
790 XA_STATE(xas, &mapping->i_pages, offset);
791 int huge = PageHuge(page);
792 struct mem_cgroup *memcg;
796 VM_BUG_ON_PAGE(!PageLocked(page), page);
797 VM_BUG_ON_PAGE(PageSwapBacked(page), page);
798 mapping_set_update(&xas, mapping);
801 error = mem_cgroup_try_charge(page, current->mm,
802 gfp_mask, &memcg, false);
808 page->mapping = mapping;
809 page->index = offset;
813 old = xas_load(&xas);
814 if (old && !xa_is_value(old))
815 xas_set_err(&xas, -EEXIST);
816 xas_store(&xas, page);
820 if (xa_is_value(old)) {
821 mapping->nrexceptional--;
827 /* hugetlb pages do not participate in page cache accounting */
829 __inc_node_page_state(page, NR_FILE_PAGES);
831 xas_unlock_irq(&xas);
832 } while (xas_nomem(&xas, gfp_mask & GFP_RECLAIM_MASK));
838 mem_cgroup_commit_charge(page, memcg, false, false);
839 trace_mm_filemap_add_to_page_cache(page);
842 page->mapping = NULL;
843 /* Leave page->index set: truncation relies upon it */
845 mem_cgroup_cancel_charge(page, memcg, false);
847 return xas_error(&xas);
851 * add_to_page_cache_locked - add a locked page to the pagecache
853 * @mapping: the page's address_space
854 * @offset: page index
855 * @gfp_mask: page allocation mode
857 * This function is used to add a page to the pagecache. It must be locked.
858 * This function does not add the page to the LRU. The caller must do that.
860 int add_to_page_cache_locked(struct page *page, struct address_space *mapping,
861 pgoff_t offset, gfp_t gfp_mask)
863 return __add_to_page_cache_locked(page, mapping, offset,
866 EXPORT_SYMBOL(add_to_page_cache_locked);
868 int add_to_page_cache_lru(struct page *page, struct address_space *mapping,
869 pgoff_t offset, gfp_t gfp_mask)
874 __SetPageLocked(page);
875 ret = __add_to_page_cache_locked(page, mapping, offset,
878 __ClearPageLocked(page);
881 * The page might have been evicted from cache only
882 * recently, in which case it should be activated like
883 * any other repeatedly accessed page.
884 * The exception is pages getting rewritten; evicting other
885 * data from the working set, only to cache data that will
886 * get overwritten with something else, is a waste of memory.
888 if (!(gfp_mask & __GFP_WRITE) &&
889 shadow && workingset_refault(shadow)) {
891 workingset_activation(page);
893 ClearPageActive(page);
898 EXPORT_SYMBOL_GPL(add_to_page_cache_lru);
901 struct page *__page_cache_alloc(gfp_t gfp)
906 if (cpuset_do_page_mem_spread()) {
907 unsigned int cpuset_mems_cookie;
909 cpuset_mems_cookie = read_mems_allowed_begin();
910 n = cpuset_mem_spread_node();
911 page = __alloc_pages_node(n, gfp, 0);
912 } while (!page && read_mems_allowed_retry(cpuset_mems_cookie));
916 return alloc_pages(gfp, 0);
918 EXPORT_SYMBOL(__page_cache_alloc);
922 * In order to wait for pages to become available there must be
923 * waitqueues associated with pages. By using a hash table of
924 * waitqueues where the bucket discipline is to maintain all
925 * waiters on the same queue and wake all when any of the pages
926 * become available, and for the woken contexts to check to be
927 * sure the appropriate page became available, this saves space
928 * at a cost of "thundering herd" phenomena during rare hash
931 #define PAGE_WAIT_TABLE_BITS 8
932 #define PAGE_WAIT_TABLE_SIZE (1 << PAGE_WAIT_TABLE_BITS)
933 static wait_queue_head_t page_wait_table[PAGE_WAIT_TABLE_SIZE] __cacheline_aligned;
935 static wait_queue_head_t *page_waitqueue(struct page *page)
937 return &page_wait_table[hash_ptr(page, PAGE_WAIT_TABLE_BITS)];
940 void __init pagecache_init(void)
944 for (i = 0; i < PAGE_WAIT_TABLE_SIZE; i++)
945 init_waitqueue_head(&page_wait_table[i]);
947 page_writeback_init();
950 /* This has the same layout as wait_bit_key - see fs/cachefiles/rdwr.c */
951 struct wait_page_key {
957 struct wait_page_queue {
960 wait_queue_entry_t wait;
963 static int wake_page_function(wait_queue_entry_t *wait, unsigned mode, int sync, void *arg)
965 struct wait_page_key *key = arg;
966 struct wait_page_queue *wait_page
967 = container_of(wait, struct wait_page_queue, wait);
969 if (wait_page->page != key->page)
973 if (wait_page->bit_nr != key->bit_nr)
976 /* Stop walking if it's locked */
977 if (test_bit(key->bit_nr, &key->page->flags))
980 return autoremove_wake_function(wait, mode, sync, key);
983 static void wake_up_page_bit(struct page *page, int bit_nr)
985 wait_queue_head_t *q = page_waitqueue(page);
986 struct wait_page_key key;
988 wait_queue_entry_t bookmark;
995 bookmark.private = NULL;
996 bookmark.func = NULL;
997 INIT_LIST_HEAD(&bookmark.entry);
999 spin_lock_irqsave(&q->lock, flags);
1000 __wake_up_locked_key_bookmark(q, TASK_NORMAL, &key, &bookmark);
1002 while (bookmark.flags & WQ_FLAG_BOOKMARK) {
1004 * Take a breather from holding the lock,
1005 * allow pages that finish wake up asynchronously
1006 * to acquire the lock and remove themselves
1009 spin_unlock_irqrestore(&q->lock, flags);
1011 spin_lock_irqsave(&q->lock, flags);
1012 __wake_up_locked_key_bookmark(q, TASK_NORMAL, &key, &bookmark);
1016 * It is possible for other pages to have collided on the waitqueue
1017 * hash, so in that case check for a page match. That prevents a long-
1020 * It is still possible to miss a case here, when we woke page waiters
1021 * and removed them from the waitqueue, but there are still other
1024 if (!waitqueue_active(q) || !key.page_match) {
1025 ClearPageWaiters(page);
1027 * It's possible to miss clearing Waiters here, when we woke
1028 * our page waiters, but the hashed waitqueue has waiters for
1029 * other pages on it.
1031 * That's okay, it's a rare case. The next waker will clear it.
1034 spin_unlock_irqrestore(&q->lock, flags);
1037 static void wake_up_page(struct page *page, int bit)
1039 if (!PageWaiters(page))
1041 wake_up_page_bit(page, bit);
1044 static inline int wait_on_page_bit_common(wait_queue_head_t *q,
1045 struct page *page, int bit_nr, int state, bool lock)
1047 struct wait_page_queue wait_page;
1048 wait_queue_entry_t *wait = &wait_page.wait;
1052 wait->flags = lock ? WQ_FLAG_EXCLUSIVE : 0;
1053 wait->func = wake_page_function;
1054 wait_page.page = page;
1055 wait_page.bit_nr = bit_nr;
1058 spin_lock_irq(&q->lock);
1060 if (likely(list_empty(&wait->entry))) {
1061 __add_wait_queue_entry_tail(q, wait);
1062 SetPageWaiters(page);
1065 set_current_state(state);
1067 spin_unlock_irq(&q->lock);
1069 if (likely(test_bit(bit_nr, &page->flags))) {
1074 if (!test_and_set_bit_lock(bit_nr, &page->flags))
1077 if (!test_bit(bit_nr, &page->flags))
1081 if (unlikely(signal_pending_state(state, current))) {
1087 finish_wait(q, wait);
1090 * A signal could leave PageWaiters set. Clearing it here if
1091 * !waitqueue_active would be possible (by open-coding finish_wait),
1092 * but still fail to catch it in the case of wait hash collision. We
1093 * already can fail to clear wait hash collision cases, so don't
1094 * bother with signals either.
1100 void wait_on_page_bit(struct page *page, int bit_nr)
1102 wait_queue_head_t *q = page_waitqueue(page);
1103 wait_on_page_bit_common(q, page, bit_nr, TASK_UNINTERRUPTIBLE, false);
1105 EXPORT_SYMBOL(wait_on_page_bit);
1107 int wait_on_page_bit_killable(struct page *page, int bit_nr)
1109 wait_queue_head_t *q = page_waitqueue(page);
1110 return wait_on_page_bit_common(q, page, bit_nr, TASK_KILLABLE, false);
1112 EXPORT_SYMBOL(wait_on_page_bit_killable);
1115 * add_page_wait_queue - Add an arbitrary waiter to a page's wait queue
1116 * @page: Page defining the wait queue of interest
1117 * @waiter: Waiter to add to the queue
1119 * Add an arbitrary @waiter to the wait queue for the nominated @page.
1121 void add_page_wait_queue(struct page *page, wait_queue_entry_t *waiter)
1123 wait_queue_head_t *q = page_waitqueue(page);
1124 unsigned long flags;
1126 spin_lock_irqsave(&q->lock, flags);
1127 __add_wait_queue_entry_tail(q, waiter);
1128 SetPageWaiters(page);
1129 spin_unlock_irqrestore(&q->lock, flags);
1131 EXPORT_SYMBOL_GPL(add_page_wait_queue);
1133 #ifndef clear_bit_unlock_is_negative_byte
1136 * PG_waiters is the high bit in the same byte as PG_lock.
1138 * On x86 (and on many other architectures), we can clear PG_lock and
1139 * test the sign bit at the same time. But if the architecture does
1140 * not support that special operation, we just do this all by hand
1143 * The read of PG_waiters has to be after (or concurrently with) PG_locked
1144 * being cleared, but a memory barrier should be unneccssary since it is
1145 * in the same byte as PG_locked.
1147 static inline bool clear_bit_unlock_is_negative_byte(long nr, volatile void *mem)
1149 clear_bit_unlock(nr, mem);
1150 /* smp_mb__after_atomic(); */
1151 return test_bit(PG_waiters, mem);
1157 * unlock_page - unlock a locked page
1160 * Unlocks the page and wakes up sleepers in ___wait_on_page_locked().
1161 * Also wakes sleepers in wait_on_page_writeback() because the wakeup
1162 * mechanism between PageLocked pages and PageWriteback pages is shared.
1163 * But that's OK - sleepers in wait_on_page_writeback() just go back to sleep.
1165 * Note that this depends on PG_waiters being the sign bit in the byte
1166 * that contains PG_locked - thus the BUILD_BUG_ON(). That allows us to
1167 * clear the PG_locked bit and test PG_waiters at the same time fairly
1168 * portably (architectures that do LL/SC can test any bit, while x86 can
1169 * test the sign bit).
1171 void unlock_page(struct page *page)
1173 BUILD_BUG_ON(PG_waiters != 7);
1174 page = compound_head(page);
1175 VM_BUG_ON_PAGE(!PageLocked(page), page);
1176 if (clear_bit_unlock_is_negative_byte(PG_locked, &page->flags))
1177 wake_up_page_bit(page, PG_locked);
1179 EXPORT_SYMBOL(unlock_page);
1182 * end_page_writeback - end writeback against a page
1185 void end_page_writeback(struct page *page)
1188 * TestClearPageReclaim could be used here but it is an atomic
1189 * operation and overkill in this particular case. Failing to
1190 * shuffle a page marked for immediate reclaim is too mild to
1191 * justify taking an atomic operation penalty at the end of
1192 * ever page writeback.
1194 if (PageReclaim(page)) {
1195 ClearPageReclaim(page);
1196 rotate_reclaimable_page(page);
1199 if (!test_clear_page_writeback(page))
1202 smp_mb__after_atomic();
1203 wake_up_page(page, PG_writeback);
1205 EXPORT_SYMBOL(end_page_writeback);
1208 * After completing I/O on a page, call this routine to update the page
1209 * flags appropriately
1211 void page_endio(struct page *page, bool is_write, int err)
1215 SetPageUptodate(page);
1217 ClearPageUptodate(page);
1223 struct address_space *mapping;
1226 mapping = page_mapping(page);
1228 mapping_set_error(mapping, err);
1230 end_page_writeback(page);
1233 EXPORT_SYMBOL_GPL(page_endio);
1236 * __lock_page - get a lock on the page, assuming we need to sleep to get it
1237 * @__page: the page to lock
1239 void __lock_page(struct page *__page)
1241 struct page *page = compound_head(__page);
1242 wait_queue_head_t *q = page_waitqueue(page);
1243 wait_on_page_bit_common(q, page, PG_locked, TASK_UNINTERRUPTIBLE, true);
1245 EXPORT_SYMBOL(__lock_page);
1247 int __lock_page_killable(struct page *__page)
1249 struct page *page = compound_head(__page);
1250 wait_queue_head_t *q = page_waitqueue(page);
1251 return wait_on_page_bit_common(q, page, PG_locked, TASK_KILLABLE, true);
1253 EXPORT_SYMBOL_GPL(__lock_page_killable);
1257 * 1 - page is locked; mmap_sem is still held.
1258 * 0 - page is not locked.
1259 * mmap_sem has been released (up_read()), unless flags had both
1260 * FAULT_FLAG_ALLOW_RETRY and FAULT_FLAG_RETRY_NOWAIT set, in
1261 * which case mmap_sem is still held.
1263 * If neither ALLOW_RETRY nor KILLABLE are set, will always return 1
1264 * with the page locked and the mmap_sem unperturbed.
1266 int __lock_page_or_retry(struct page *page, struct mm_struct *mm,
1269 if (flags & FAULT_FLAG_ALLOW_RETRY) {
1271 * CAUTION! In this case, mmap_sem is not released
1272 * even though return 0.
1274 if (flags & FAULT_FLAG_RETRY_NOWAIT)
1277 up_read(&mm->mmap_sem);
1278 if (flags & FAULT_FLAG_KILLABLE)
1279 wait_on_page_locked_killable(page);
1281 wait_on_page_locked(page);
1284 if (flags & FAULT_FLAG_KILLABLE) {
1287 ret = __lock_page_killable(page);
1289 up_read(&mm->mmap_sem);
1299 * page_cache_next_miss() - Find the next gap in the page cache.
1300 * @mapping: Mapping.
1302 * @max_scan: Maximum range to search.
1304 * Search the range [index, min(index + max_scan - 1, ULONG_MAX)] for the
1305 * gap with the lowest index.
1307 * This function may be called under the rcu_read_lock. However, this will
1308 * not atomically search a snapshot of the cache at a single point in time.
1309 * For example, if a gap is created at index 5, then subsequently a gap is
1310 * created at index 10, page_cache_next_miss covering both indices may
1311 * return 10 if called under the rcu_read_lock.
1313 * Return: The index of the gap if found, otherwise an index outside the
1314 * range specified (in which case 'return - index >= max_scan' will be true).
1315 * In the rare case of index wrap-around, 0 will be returned.
1317 pgoff_t page_cache_next_miss(struct address_space *mapping,
1318 pgoff_t index, unsigned long max_scan)
1320 XA_STATE(xas, &mapping->i_pages, index);
1322 while (max_scan--) {
1323 void *entry = xas_next(&xas);
1324 if (!entry || xa_is_value(entry))
1326 if (xas.xa_index == 0)
1330 return xas.xa_index;
1332 EXPORT_SYMBOL(page_cache_next_miss);
1335 * page_cache_prev_miss() - Find the next gap in the page cache.
1336 * @mapping: Mapping.
1338 * @max_scan: Maximum range to search.
1340 * Search the range [max(index - max_scan + 1, 0), index] for the
1341 * gap with the highest index.
1343 * This function may be called under the rcu_read_lock. However, this will
1344 * not atomically search a snapshot of the cache at a single point in time.
1345 * For example, if a gap is created at index 10, then subsequently a gap is
1346 * created at index 5, page_cache_prev_miss() covering both indices may
1347 * return 5 if called under the rcu_read_lock.
1349 * Return: The index of the gap if found, otherwise an index outside the
1350 * range specified (in which case 'index - return >= max_scan' will be true).
1351 * In the rare case of wrap-around, ULONG_MAX will be returned.
1353 pgoff_t page_cache_prev_miss(struct address_space *mapping,
1354 pgoff_t index, unsigned long max_scan)
1356 XA_STATE(xas, &mapping->i_pages, index);
1358 while (max_scan--) {
1359 void *entry = xas_prev(&xas);
1360 if (!entry || xa_is_value(entry))
1362 if (xas.xa_index == ULONG_MAX)
1366 return xas.xa_index;
1368 EXPORT_SYMBOL(page_cache_prev_miss);
1371 * find_get_entry - find and get a page cache entry
1372 * @mapping: the address_space to search
1373 * @offset: the page cache index
1375 * Looks up the page cache slot at @mapping & @offset. If there is a
1376 * page cache page, it is returned with an increased refcount.
1378 * If the slot holds a shadow entry of a previously evicted page, or a
1379 * swap entry from shmem/tmpfs, it is returned.
1381 * Otherwise, %NULL is returned.
1383 struct page *find_get_entry(struct address_space *mapping, pgoff_t offset)
1386 struct page *head, *page;
1391 pagep = radix_tree_lookup_slot(&mapping->i_pages, offset);
1393 page = radix_tree_deref_slot(pagep);
1394 if (unlikely(!page))
1396 if (radix_tree_exception(page)) {
1397 if (radix_tree_deref_retry(page))
1400 * A shadow entry of a recently evicted page,
1401 * or a swap entry from shmem/tmpfs. Return
1402 * it without attempting to raise page count.
1407 head = compound_head(page);
1408 if (!page_cache_get_speculative(head))
1411 /* The page was split under us? */
1412 if (compound_head(page) != head) {
1418 * Has the page moved?
1419 * This is part of the lockless pagecache protocol. See
1420 * include/linux/pagemap.h for details.
1422 if (unlikely(page != *pagep)) {
1432 EXPORT_SYMBOL(find_get_entry);
1435 * find_lock_entry - locate, pin and lock a page cache entry
1436 * @mapping: the address_space to search
1437 * @offset: the page cache index
1439 * Looks up the page cache slot at @mapping & @offset. If there is a
1440 * page cache page, it is returned locked and with an increased
1443 * If the slot holds a shadow entry of a previously evicted page, or a
1444 * swap entry from shmem/tmpfs, it is returned.
1446 * Otherwise, %NULL is returned.
1448 * find_lock_entry() may sleep.
1450 struct page *find_lock_entry(struct address_space *mapping, pgoff_t offset)
1455 page = find_get_entry(mapping, offset);
1456 if (page && !radix_tree_exception(page)) {
1458 /* Has the page been truncated? */
1459 if (unlikely(page_mapping(page) != mapping)) {
1464 VM_BUG_ON_PAGE(page_to_pgoff(page) != offset, page);
1468 EXPORT_SYMBOL(find_lock_entry);
1471 * pagecache_get_page - find and get a page reference
1472 * @mapping: the address_space to search
1473 * @offset: the page index
1474 * @fgp_flags: PCG flags
1475 * @gfp_mask: gfp mask to use for the page cache data page allocation
1477 * Looks up the page cache slot at @mapping & @offset.
1479 * PCG flags modify how the page is returned.
1481 * @fgp_flags can be:
1483 * - FGP_ACCESSED: the page will be marked accessed
1484 * - FGP_LOCK: Page is return locked
1485 * - FGP_CREAT: If page is not present then a new page is allocated using
1486 * @gfp_mask and added to the page cache and the VM's LRU
1487 * list. The page is returned locked and with an increased
1488 * refcount. Otherwise, NULL is returned.
1490 * If FGP_LOCK or FGP_CREAT are specified then the function may sleep even
1491 * if the GFP flags specified for FGP_CREAT are atomic.
1493 * If there is a page cache page, it is returned with an increased refcount.
1495 struct page *pagecache_get_page(struct address_space *mapping, pgoff_t offset,
1496 int fgp_flags, gfp_t gfp_mask)
1501 page = find_get_entry(mapping, offset);
1502 if (xa_is_value(page))
1507 if (fgp_flags & FGP_LOCK) {
1508 if (fgp_flags & FGP_NOWAIT) {
1509 if (!trylock_page(page)) {
1517 /* Has the page been truncated? */
1518 if (unlikely(page->mapping != mapping)) {
1523 VM_BUG_ON_PAGE(page->index != offset, page);
1526 if (page && (fgp_flags & FGP_ACCESSED))
1527 mark_page_accessed(page);
1530 if (!page && (fgp_flags & FGP_CREAT)) {
1532 if ((fgp_flags & FGP_WRITE) && mapping_cap_account_dirty(mapping))
1533 gfp_mask |= __GFP_WRITE;
1534 if (fgp_flags & FGP_NOFS)
1535 gfp_mask &= ~__GFP_FS;
1537 page = __page_cache_alloc(gfp_mask);
1541 if (WARN_ON_ONCE(!(fgp_flags & FGP_LOCK)))
1542 fgp_flags |= FGP_LOCK;
1544 /* Init accessed so avoid atomic mark_page_accessed later */
1545 if (fgp_flags & FGP_ACCESSED)
1546 __SetPageReferenced(page);
1548 err = add_to_page_cache_lru(page, mapping, offset, gfp_mask);
1549 if (unlikely(err)) {
1559 EXPORT_SYMBOL(pagecache_get_page);
1562 * find_get_entries - gang pagecache lookup
1563 * @mapping: The address_space to search
1564 * @start: The starting page cache index
1565 * @nr_entries: The maximum number of entries
1566 * @entries: Where the resulting entries are placed
1567 * @indices: The cache indices corresponding to the entries in @entries
1569 * find_get_entries() will search for and return a group of up to
1570 * @nr_entries entries in the mapping. The entries are placed at
1571 * @entries. find_get_entries() takes a reference against any actual
1574 * The search returns a group of mapping-contiguous page cache entries
1575 * with ascending indexes. There may be holes in the indices due to
1576 * not-present pages.
1578 * Any shadow entries of evicted pages, or swap entries from
1579 * shmem/tmpfs, are included in the returned array.
1581 * find_get_entries() returns the number of pages and shadow entries
1584 unsigned find_get_entries(struct address_space *mapping,
1585 pgoff_t start, unsigned int nr_entries,
1586 struct page **entries, pgoff_t *indices)
1589 unsigned int ret = 0;
1590 struct radix_tree_iter iter;
1596 radix_tree_for_each_slot(slot, &mapping->i_pages, &iter, start) {
1597 struct page *head, *page;
1599 page = radix_tree_deref_slot(slot);
1600 if (unlikely(!page))
1602 if (radix_tree_exception(page)) {
1603 if (radix_tree_deref_retry(page)) {
1604 slot = radix_tree_iter_retry(&iter);
1608 * A shadow entry of a recently evicted page, a swap
1609 * entry from shmem/tmpfs or a DAX entry. Return it
1610 * without attempting to raise page count.
1615 head = compound_head(page);
1616 if (!page_cache_get_speculative(head))
1619 /* The page was split under us? */
1620 if (compound_head(page) != head) {
1625 /* Has the page moved? */
1626 if (unlikely(page != *slot)) {
1631 indices[ret] = iter.index;
1632 entries[ret] = page;
1633 if (++ret == nr_entries)
1641 * find_get_pages_range - gang pagecache lookup
1642 * @mapping: The address_space to search
1643 * @start: The starting page index
1644 * @end: The final page index (inclusive)
1645 * @nr_pages: The maximum number of pages
1646 * @pages: Where the resulting pages are placed
1648 * find_get_pages_range() will search for and return a group of up to @nr_pages
1649 * pages in the mapping starting at index @start and up to index @end
1650 * (inclusive). The pages are placed at @pages. find_get_pages_range() takes
1651 * a reference against the returned pages.
1653 * The search returns a group of mapping-contiguous pages with ascending
1654 * indexes. There may be holes in the indices due to not-present pages.
1655 * We also update @start to index the next page for the traversal.
1657 * find_get_pages_range() returns the number of pages which were found. If this
1658 * number is smaller than @nr_pages, the end of specified range has been
1661 unsigned find_get_pages_range(struct address_space *mapping, pgoff_t *start,
1662 pgoff_t end, unsigned int nr_pages,
1663 struct page **pages)
1665 struct radix_tree_iter iter;
1669 if (unlikely(!nr_pages))
1673 radix_tree_for_each_slot(slot, &mapping->i_pages, &iter, *start) {
1674 struct page *head, *page;
1676 if (iter.index > end)
1679 page = radix_tree_deref_slot(slot);
1680 if (unlikely(!page))
1683 if (radix_tree_exception(page)) {
1684 if (radix_tree_deref_retry(page)) {
1685 slot = radix_tree_iter_retry(&iter);
1689 * A shadow entry of a recently evicted page,
1690 * or a swap entry from shmem/tmpfs. Skip
1696 head = compound_head(page);
1697 if (!page_cache_get_speculative(head))
1700 /* The page was split under us? */
1701 if (compound_head(page) != head) {
1706 /* Has the page moved? */
1707 if (unlikely(page != *slot)) {
1713 if (++ret == nr_pages) {
1714 *start = pages[ret - 1]->index + 1;
1720 * We come here when there is no page beyond @end. We take care to not
1721 * overflow the index @start as it confuses some of the callers. This
1722 * breaks the iteration when there is page at index -1 but that is
1723 * already broken anyway.
1725 if (end == (pgoff_t)-1)
1726 *start = (pgoff_t)-1;
1736 * find_get_pages_contig - gang contiguous pagecache lookup
1737 * @mapping: The address_space to search
1738 * @index: The starting page index
1739 * @nr_pages: The maximum number of pages
1740 * @pages: Where the resulting pages are placed
1742 * find_get_pages_contig() works exactly like find_get_pages(), except
1743 * that the returned number of pages are guaranteed to be contiguous.
1745 * find_get_pages_contig() returns the number of pages which were found.
1747 unsigned find_get_pages_contig(struct address_space *mapping, pgoff_t index,
1748 unsigned int nr_pages, struct page **pages)
1750 struct radix_tree_iter iter;
1752 unsigned int ret = 0;
1754 if (unlikely(!nr_pages))
1758 radix_tree_for_each_contig(slot, &mapping->i_pages, &iter, index) {
1759 struct page *head, *page;
1761 page = radix_tree_deref_slot(slot);
1762 /* The hole, there no reason to continue */
1763 if (unlikely(!page))
1766 if (radix_tree_exception(page)) {
1767 if (radix_tree_deref_retry(page)) {
1768 slot = radix_tree_iter_retry(&iter);
1772 * A shadow entry of a recently evicted page,
1773 * or a swap entry from shmem/tmpfs. Stop
1774 * looking for contiguous pages.
1779 head = compound_head(page);
1780 if (!page_cache_get_speculative(head))
1783 /* The page was split under us? */
1784 if (compound_head(page) != head) {
1789 /* Has the page moved? */
1790 if (unlikely(page != *slot)) {
1796 * must check mapping and index after taking the ref.
1797 * otherwise we can get both false positives and false
1798 * negatives, which is just confusing to the caller.
1800 if (page->mapping == NULL || page_to_pgoff(page) != iter.index) {
1806 if (++ret == nr_pages)
1812 EXPORT_SYMBOL(find_get_pages_contig);
1815 * find_get_pages_range_tag - find and return pages in given range matching @tag
1816 * @mapping: the address_space to search
1817 * @index: the starting page index
1818 * @end: The final page index (inclusive)
1819 * @tag: the tag index
1820 * @nr_pages: the maximum number of pages
1821 * @pages: where the resulting pages are placed
1823 * Like find_get_pages, except we only return pages which are tagged with
1824 * @tag. We update @index to index the next page for the traversal.
1826 unsigned find_get_pages_range_tag(struct address_space *mapping, pgoff_t *index,
1827 pgoff_t end, int tag, unsigned int nr_pages,
1828 struct page **pages)
1830 struct radix_tree_iter iter;
1834 if (unlikely(!nr_pages))
1838 radix_tree_for_each_tagged(slot, &mapping->i_pages, &iter, *index, tag) {
1839 struct page *head, *page;
1841 if (iter.index > end)
1844 page = radix_tree_deref_slot(slot);
1845 if (unlikely(!page))
1848 if (radix_tree_exception(page)) {
1849 if (radix_tree_deref_retry(page)) {
1850 slot = radix_tree_iter_retry(&iter);
1854 * A shadow entry of a recently evicted page.
1856 * Those entries should never be tagged, but
1857 * this tree walk is lockless and the tags are
1858 * looked up in bulk, one radix tree node at a
1859 * time, so there is a sizable window for page
1860 * reclaim to evict a page we saw tagged.
1867 head = compound_head(page);
1868 if (!page_cache_get_speculative(head))
1871 /* The page was split under us? */
1872 if (compound_head(page) != head) {
1877 /* Has the page moved? */
1878 if (unlikely(page != *slot)) {
1884 if (++ret == nr_pages) {
1885 *index = pages[ret - 1]->index + 1;
1891 * We come here when we got at @end. We take care to not overflow the
1892 * index @index as it confuses some of the callers. This breaks the
1893 * iteration when there is page at index -1 but that is already broken
1896 if (end == (pgoff_t)-1)
1897 *index = (pgoff_t)-1;
1905 EXPORT_SYMBOL(find_get_pages_range_tag);
1908 * find_get_entries_tag - find and return entries that match @tag
1909 * @mapping: the address_space to search
1910 * @start: the starting page cache index
1911 * @tag: the tag index
1912 * @nr_entries: the maximum number of entries
1913 * @entries: where the resulting entries are placed
1914 * @indices: the cache indices corresponding to the entries in @entries
1916 * Like find_get_entries, except we only return entries which are tagged with
1919 unsigned find_get_entries_tag(struct address_space *mapping, pgoff_t start,
1920 int tag, unsigned int nr_entries,
1921 struct page **entries, pgoff_t *indices)
1924 unsigned int ret = 0;
1925 struct radix_tree_iter iter;
1931 radix_tree_for_each_tagged(slot, &mapping->i_pages, &iter, start, tag) {
1932 struct page *head, *page;
1934 page = radix_tree_deref_slot(slot);
1935 if (unlikely(!page))
1937 if (radix_tree_exception(page)) {
1938 if (radix_tree_deref_retry(page)) {
1939 slot = radix_tree_iter_retry(&iter);
1944 * A shadow entry of a recently evicted page, a swap
1945 * entry from shmem/tmpfs or a DAX entry. Return it
1946 * without attempting to raise page count.
1951 head = compound_head(page);
1952 if (!page_cache_get_speculative(head))
1955 /* The page was split under us? */
1956 if (compound_head(page) != head) {
1961 /* Has the page moved? */
1962 if (unlikely(page != *slot)) {
1967 indices[ret] = iter.index;
1968 entries[ret] = page;
1969 if (++ret == nr_entries)
1975 EXPORT_SYMBOL(find_get_entries_tag);
1978 * CD/DVDs are error prone. When a medium error occurs, the driver may fail
1979 * a _large_ part of the i/o request. Imagine the worst scenario:
1981 * ---R__________________________________________B__________
1982 * ^ reading here ^ bad block(assume 4k)
1984 * read(R) => miss => readahead(R...B) => media error => frustrating retries
1985 * => failing the whole request => read(R) => read(R+1) =>
1986 * readahead(R+1...B+1) => bang => read(R+2) => read(R+3) =>
1987 * readahead(R+3...B+2) => bang => read(R+3) => read(R+4) =>
1988 * readahead(R+4...B+3) => bang => read(R+4) => read(R+5) => ......
1990 * It is going insane. Fix it by quickly scaling down the readahead size.
1992 static void shrink_readahead_size_eio(struct file *filp,
1993 struct file_ra_state *ra)
1999 * generic_file_buffered_read - generic file read routine
2000 * @iocb: the iocb to read
2001 * @iter: data destination
2002 * @written: already copied
2004 * This is a generic file read routine, and uses the
2005 * mapping->a_ops->readpage() function for the actual low-level stuff.
2007 * This is really ugly. But the goto's actually try to clarify some
2008 * of the logic when it comes to error handling etc.
2010 static ssize_t generic_file_buffered_read(struct kiocb *iocb,
2011 struct iov_iter *iter, ssize_t written)
2013 struct file *filp = iocb->ki_filp;
2014 struct address_space *mapping = filp->f_mapping;
2015 struct inode *inode = mapping->host;
2016 struct file_ra_state *ra = &filp->f_ra;
2017 loff_t *ppos = &iocb->ki_pos;
2021 unsigned long offset; /* offset into pagecache page */
2022 unsigned int prev_offset;
2025 if (unlikely(*ppos >= inode->i_sb->s_maxbytes))
2027 iov_iter_truncate(iter, inode->i_sb->s_maxbytes);
2029 index = *ppos >> PAGE_SHIFT;
2030 prev_index = ra->prev_pos >> PAGE_SHIFT;
2031 prev_offset = ra->prev_pos & (PAGE_SIZE-1);
2032 last_index = (*ppos + iter->count + PAGE_SIZE-1) >> PAGE_SHIFT;
2033 offset = *ppos & ~PAGE_MASK;
2039 unsigned long nr, ret;
2043 if (fatal_signal_pending(current)) {
2048 page = find_get_page(mapping, index);
2050 if (iocb->ki_flags & IOCB_NOWAIT)
2052 page_cache_sync_readahead(mapping,
2054 index, last_index - index);
2055 page = find_get_page(mapping, index);
2056 if (unlikely(page == NULL))
2057 goto no_cached_page;
2059 if (PageReadahead(page)) {
2060 page_cache_async_readahead(mapping,
2062 index, last_index - index);
2064 if (!PageUptodate(page)) {
2065 if (iocb->ki_flags & IOCB_NOWAIT) {
2071 * See comment in do_read_cache_page on why
2072 * wait_on_page_locked is used to avoid unnecessarily
2073 * serialisations and why it's safe.
2075 error = wait_on_page_locked_killable(page);
2076 if (unlikely(error))
2077 goto readpage_error;
2078 if (PageUptodate(page))
2081 if (inode->i_blkbits == PAGE_SHIFT ||
2082 !mapping->a_ops->is_partially_uptodate)
2083 goto page_not_up_to_date;
2084 /* pipes can't handle partially uptodate pages */
2085 if (unlikely(iter->type & ITER_PIPE))
2086 goto page_not_up_to_date;
2087 if (!trylock_page(page))
2088 goto page_not_up_to_date;
2089 /* Did it get truncated before we got the lock? */
2091 goto page_not_up_to_date_locked;
2092 if (!mapping->a_ops->is_partially_uptodate(page,
2093 offset, iter->count))
2094 goto page_not_up_to_date_locked;
2099 * i_size must be checked after we know the page is Uptodate.
2101 * Checking i_size after the check allows us to calculate
2102 * the correct value for "nr", which means the zero-filled
2103 * part of the page is not copied back to userspace (unless
2104 * another truncate extends the file - this is desired though).
2107 isize = i_size_read(inode);
2108 end_index = (isize - 1) >> PAGE_SHIFT;
2109 if (unlikely(!isize || index > end_index)) {
2114 /* nr is the maximum number of bytes to copy from this page */
2116 if (index == end_index) {
2117 nr = ((isize - 1) & ~PAGE_MASK) + 1;
2125 /* If users can be writing to this page using arbitrary
2126 * virtual addresses, take care about potential aliasing
2127 * before reading the page on the kernel side.
2129 if (mapping_writably_mapped(mapping))
2130 flush_dcache_page(page);
2133 * When a sequential read accesses a page several times,
2134 * only mark it as accessed the first time.
2136 if (prev_index != index || offset != prev_offset)
2137 mark_page_accessed(page);
2141 * Ok, we have the page, and it's up-to-date, so
2142 * now we can copy it to user space...
2145 ret = copy_page_to_iter(page, offset, nr, iter);
2147 index += offset >> PAGE_SHIFT;
2148 offset &= ~PAGE_MASK;
2149 prev_offset = offset;
2153 if (!iov_iter_count(iter))
2161 page_not_up_to_date:
2162 /* Get exclusive access to the page ... */
2163 error = lock_page_killable(page);
2164 if (unlikely(error))
2165 goto readpage_error;
2167 page_not_up_to_date_locked:
2168 /* Did it get truncated before we got the lock? */
2169 if (!page->mapping) {
2175 /* Did somebody else fill it already? */
2176 if (PageUptodate(page)) {
2183 * A previous I/O error may have been due to temporary
2184 * failures, eg. multipath errors.
2185 * PG_error will be set again if readpage fails.
2187 ClearPageError(page);
2188 /* Start the actual read. The read will unlock the page. */
2189 error = mapping->a_ops->readpage(filp, page);
2191 if (unlikely(error)) {
2192 if (error == AOP_TRUNCATED_PAGE) {
2197 goto readpage_error;
2200 if (!PageUptodate(page)) {
2201 error = lock_page_killable(page);
2202 if (unlikely(error))
2203 goto readpage_error;
2204 if (!PageUptodate(page)) {
2205 if (page->mapping == NULL) {
2207 * invalidate_mapping_pages got it
2214 shrink_readahead_size_eio(filp, ra);
2216 goto readpage_error;
2224 /* UHHUH! A synchronous read error occurred. Report it */
2230 * Ok, it wasn't cached, so we need to create a new
2233 page = page_cache_alloc(mapping);
2238 error = add_to_page_cache_lru(page, mapping, index,
2239 mapping_gfp_constraint(mapping, GFP_KERNEL));
2242 if (error == -EEXIST) {
2254 ra->prev_pos = prev_index;
2255 ra->prev_pos <<= PAGE_SHIFT;
2256 ra->prev_pos |= prev_offset;
2258 *ppos = ((loff_t)index << PAGE_SHIFT) + offset;
2259 file_accessed(filp);
2260 return written ? written : error;
2264 * generic_file_read_iter - generic filesystem read routine
2265 * @iocb: kernel I/O control block
2266 * @iter: destination for the data read
2268 * This is the "read_iter()" routine for all filesystems
2269 * that can use the page cache directly.
2272 generic_file_read_iter(struct kiocb *iocb, struct iov_iter *iter)
2274 size_t count = iov_iter_count(iter);
2278 goto out; /* skip atime */
2280 if (iocb->ki_flags & IOCB_DIRECT) {
2281 struct file *file = iocb->ki_filp;
2282 struct address_space *mapping = file->f_mapping;
2283 struct inode *inode = mapping->host;
2286 size = i_size_read(inode);
2287 if (iocb->ki_flags & IOCB_NOWAIT) {
2288 if (filemap_range_has_page(mapping, iocb->ki_pos,
2289 iocb->ki_pos + count - 1))
2292 retval = filemap_write_and_wait_range(mapping,
2294 iocb->ki_pos + count - 1);
2299 file_accessed(file);
2301 retval = mapping->a_ops->direct_IO(iocb, iter);
2303 iocb->ki_pos += retval;
2306 iov_iter_revert(iter, count - iov_iter_count(iter));
2309 * Btrfs can have a short DIO read if we encounter
2310 * compressed extents, so if there was an error, or if
2311 * we've already read everything we wanted to, or if
2312 * there was a short read because we hit EOF, go ahead
2313 * and return. Otherwise fallthrough to buffered io for
2314 * the rest of the read. Buffered reads will not work for
2315 * DAX files, so don't bother trying.
2317 if (retval < 0 || !count || iocb->ki_pos >= size ||
2322 retval = generic_file_buffered_read(iocb, iter, retval);
2326 EXPORT_SYMBOL(generic_file_read_iter);
2330 * page_cache_read - adds requested page to the page cache if not already there
2331 * @file: file to read
2332 * @offset: page index
2333 * @gfp_mask: memory allocation flags
2335 * This adds the requested page to the page cache if it isn't already there,
2336 * and schedules an I/O to read in its contents from disk.
2338 static int page_cache_read(struct file *file, pgoff_t offset, gfp_t gfp_mask)
2340 struct address_space *mapping = file->f_mapping;
2345 page = __page_cache_alloc(gfp_mask);
2349 ret = add_to_page_cache_lru(page, mapping, offset, gfp_mask);
2351 ret = mapping->a_ops->readpage(file, page);
2352 else if (ret == -EEXIST)
2353 ret = 0; /* losing race to add is OK */
2357 } while (ret == AOP_TRUNCATED_PAGE);
2362 #define MMAP_LOTSAMISS (100)
2365 * Synchronous readahead happens when we don't even find
2366 * a page in the page cache at all.
2368 static void do_sync_mmap_readahead(struct vm_area_struct *vma,
2369 struct file_ra_state *ra,
2373 struct address_space *mapping = file->f_mapping;
2375 /* If we don't want any read-ahead, don't bother */
2376 if (vma->vm_flags & VM_RAND_READ)
2381 if (vma->vm_flags & VM_SEQ_READ) {
2382 page_cache_sync_readahead(mapping, ra, file, offset,
2387 /* Avoid banging the cache line if not needed */
2388 if (ra->mmap_miss < MMAP_LOTSAMISS * 10)
2392 * Do we miss much more than hit in this file? If so,
2393 * stop bothering with read-ahead. It will only hurt.
2395 if (ra->mmap_miss > MMAP_LOTSAMISS)
2401 ra->start = max_t(long, 0, offset - ra->ra_pages / 2);
2402 ra->size = ra->ra_pages;
2403 ra->async_size = ra->ra_pages / 4;
2404 ra_submit(ra, mapping, file);
2408 * Asynchronous readahead happens when we find the page and PG_readahead,
2409 * so we want to possibly extend the readahead further..
2411 static void do_async_mmap_readahead(struct vm_area_struct *vma,
2412 struct file_ra_state *ra,
2417 struct address_space *mapping = file->f_mapping;
2419 /* If we don't want any read-ahead, don't bother */
2420 if (vma->vm_flags & VM_RAND_READ)
2422 if (ra->mmap_miss > 0)
2424 if (PageReadahead(page))
2425 page_cache_async_readahead(mapping, ra, file,
2426 page, offset, ra->ra_pages);
2430 * filemap_fault - read in file data for page fault handling
2431 * @vmf: struct vm_fault containing details of the fault
2433 * filemap_fault() is invoked via the vma operations vector for a
2434 * mapped memory region to read in file data during a page fault.
2436 * The goto's are kind of ugly, but this streamlines the normal case of having
2437 * it in the page cache, and handles the special cases reasonably without
2438 * having a lot of duplicated code.
2440 * vma->vm_mm->mmap_sem must be held on entry.
2442 * If our return value has VM_FAULT_RETRY set, it's because
2443 * lock_page_or_retry() returned 0.
2444 * The mmap_sem has usually been released in this case.
2445 * See __lock_page_or_retry() for the exception.
2447 * If our return value does not have VM_FAULT_RETRY set, the mmap_sem
2448 * has not been released.
2450 * We never return with VM_FAULT_RETRY and a bit from VM_FAULT_ERROR set.
2452 vm_fault_t filemap_fault(struct vm_fault *vmf)
2455 struct file *file = vmf->vma->vm_file;
2456 struct address_space *mapping = file->f_mapping;
2457 struct file_ra_state *ra = &file->f_ra;
2458 struct inode *inode = mapping->host;
2459 pgoff_t offset = vmf->pgoff;
2464 max_off = DIV_ROUND_UP(i_size_read(inode), PAGE_SIZE);
2465 if (unlikely(offset >= max_off))
2466 return VM_FAULT_SIGBUS;
2469 * Do we have something in the page cache already?
2471 page = find_get_page(mapping, offset);
2472 if (likely(page) && !(vmf->flags & FAULT_FLAG_TRIED)) {
2474 * We found the page, so try async readahead before
2475 * waiting for the lock.
2477 do_async_mmap_readahead(vmf->vma, ra, file, page, offset);
2479 /* No page in the page cache at all */
2480 do_sync_mmap_readahead(vmf->vma, ra, file, offset);
2481 count_vm_event(PGMAJFAULT);
2482 count_memcg_event_mm(vmf->vma->vm_mm, PGMAJFAULT);
2483 ret = VM_FAULT_MAJOR;
2485 page = find_get_page(mapping, offset);
2487 goto no_cached_page;
2490 if (!lock_page_or_retry(page, vmf->vma->vm_mm, vmf->flags)) {
2492 return ret | VM_FAULT_RETRY;
2495 /* Did it get truncated? */
2496 if (unlikely(page->mapping != mapping)) {
2501 VM_BUG_ON_PAGE(page->index != offset, page);
2504 * We have a locked page in the page cache, now we need to check
2505 * that it's up-to-date. If not, it is going to be due to an error.
2507 if (unlikely(!PageUptodate(page)))
2508 goto page_not_uptodate;
2511 * Found the page and have a reference on it.
2512 * We must recheck i_size under page lock.
2514 max_off = DIV_ROUND_UP(i_size_read(inode), PAGE_SIZE);
2515 if (unlikely(offset >= max_off)) {
2518 return VM_FAULT_SIGBUS;
2522 return ret | VM_FAULT_LOCKED;
2526 * We're only likely to ever get here if MADV_RANDOM is in
2529 error = page_cache_read(file, offset, vmf->gfp_mask);
2532 * The page we want has now been added to the page cache.
2533 * In the unlikely event that someone removed it in the
2534 * meantime, we'll just come back here and read it again.
2540 * An error return from page_cache_read can result if the
2541 * system is low on memory, or a problem occurs while trying
2544 if (error == -ENOMEM)
2545 return VM_FAULT_OOM;
2546 return VM_FAULT_SIGBUS;
2550 * Umm, take care of errors if the page isn't up-to-date.
2551 * Try to re-read it _once_. We do this synchronously,
2552 * because there really aren't any performance issues here
2553 * and we need to check for errors.
2555 ClearPageError(page);
2556 error = mapping->a_ops->readpage(file, page);
2558 wait_on_page_locked(page);
2559 if (!PageUptodate(page))
2564 if (!error || error == AOP_TRUNCATED_PAGE)
2567 /* Things didn't work out. Return zero to tell the mm layer so. */
2568 shrink_readahead_size_eio(file, ra);
2569 return VM_FAULT_SIGBUS;
2571 EXPORT_SYMBOL(filemap_fault);
2573 void filemap_map_pages(struct vm_fault *vmf,
2574 pgoff_t start_pgoff, pgoff_t end_pgoff)
2576 struct radix_tree_iter iter;
2578 struct file *file = vmf->vma->vm_file;
2579 struct address_space *mapping = file->f_mapping;
2580 pgoff_t last_pgoff = start_pgoff;
2581 unsigned long max_idx;
2582 struct page *head, *page;
2585 radix_tree_for_each_slot(slot, &mapping->i_pages, &iter, start_pgoff) {
2586 if (iter.index > end_pgoff)
2589 page = radix_tree_deref_slot(slot);
2590 if (unlikely(!page))
2592 if (radix_tree_exception(page)) {
2593 if (radix_tree_deref_retry(page)) {
2594 slot = radix_tree_iter_retry(&iter);
2600 head = compound_head(page);
2601 if (!page_cache_get_speculative(head))
2604 /* The page was split under us? */
2605 if (compound_head(page) != head) {
2610 /* Has the page moved? */
2611 if (unlikely(page != *slot)) {
2616 if (!PageUptodate(page) ||
2617 PageReadahead(page) ||
2620 if (!trylock_page(page))
2623 if (page->mapping != mapping || !PageUptodate(page))
2626 max_idx = DIV_ROUND_UP(i_size_read(mapping->host), PAGE_SIZE);
2627 if (page->index >= max_idx)
2630 if (file->f_ra.mmap_miss > 0)
2631 file->f_ra.mmap_miss--;
2633 vmf->address += (iter.index - last_pgoff) << PAGE_SHIFT;
2635 vmf->pte += iter.index - last_pgoff;
2636 last_pgoff = iter.index;
2637 if (alloc_set_pte(vmf, NULL, page))
2646 /* Huge page is mapped? No need to proceed. */
2647 if (pmd_trans_huge(*vmf->pmd))
2649 if (iter.index == end_pgoff)
2654 EXPORT_SYMBOL(filemap_map_pages);
2656 vm_fault_t filemap_page_mkwrite(struct vm_fault *vmf)
2658 struct page *page = vmf->page;
2659 struct inode *inode = file_inode(vmf->vma->vm_file);
2660 vm_fault_t ret = VM_FAULT_LOCKED;
2662 sb_start_pagefault(inode->i_sb);
2663 file_update_time(vmf->vma->vm_file);
2665 if (page->mapping != inode->i_mapping) {
2667 ret = VM_FAULT_NOPAGE;
2671 * We mark the page dirty already here so that when freeze is in
2672 * progress, we are guaranteed that writeback during freezing will
2673 * see the dirty page and writeprotect it again.
2675 set_page_dirty(page);
2676 wait_for_stable_page(page);
2678 sb_end_pagefault(inode->i_sb);
2682 const struct vm_operations_struct generic_file_vm_ops = {
2683 .fault = filemap_fault,
2684 .map_pages = filemap_map_pages,
2685 .page_mkwrite = filemap_page_mkwrite,
2688 /* This is used for a general mmap of a disk file */
2690 int generic_file_mmap(struct file * file, struct vm_area_struct * vma)
2692 struct address_space *mapping = file->f_mapping;
2694 if (!mapping->a_ops->readpage)
2696 file_accessed(file);
2697 vma->vm_ops = &generic_file_vm_ops;
2702 * This is for filesystems which do not implement ->writepage.
2704 int generic_file_readonly_mmap(struct file *file, struct vm_area_struct *vma)
2706 if ((vma->vm_flags & VM_SHARED) && (vma->vm_flags & VM_MAYWRITE))
2708 return generic_file_mmap(file, vma);
2711 int filemap_page_mkwrite(struct vm_fault *vmf)
2715 int generic_file_mmap(struct file * file, struct vm_area_struct * vma)
2719 int generic_file_readonly_mmap(struct file * file, struct vm_area_struct * vma)
2723 #endif /* CONFIG_MMU */
2725 EXPORT_SYMBOL(filemap_page_mkwrite);
2726 EXPORT_SYMBOL(generic_file_mmap);
2727 EXPORT_SYMBOL(generic_file_readonly_mmap);
2729 static struct page *wait_on_page_read(struct page *page)
2731 if (!IS_ERR(page)) {
2732 wait_on_page_locked(page);
2733 if (!PageUptodate(page)) {
2735 page = ERR_PTR(-EIO);
2741 static struct page *do_read_cache_page(struct address_space *mapping,
2743 int (*filler)(void *, struct page *),
2750 page = find_get_page(mapping, index);
2752 page = __page_cache_alloc(gfp);
2754 return ERR_PTR(-ENOMEM);
2755 err = add_to_page_cache_lru(page, mapping, index, gfp);
2756 if (unlikely(err)) {
2760 /* Presumably ENOMEM for radix tree node */
2761 return ERR_PTR(err);
2765 err = filler(data, page);
2768 return ERR_PTR(err);
2771 page = wait_on_page_read(page);
2776 if (PageUptodate(page))
2780 * Page is not up to date and may be locked due one of the following
2781 * case a: Page is being filled and the page lock is held
2782 * case b: Read/write error clearing the page uptodate status
2783 * case c: Truncation in progress (page locked)
2784 * case d: Reclaim in progress
2786 * Case a, the page will be up to date when the page is unlocked.
2787 * There is no need to serialise on the page lock here as the page
2788 * is pinned so the lock gives no additional protection. Even if the
2789 * the page is truncated, the data is still valid if PageUptodate as
2790 * it's a race vs truncate race.
2791 * Case b, the page will not be up to date
2792 * Case c, the page may be truncated but in itself, the data may still
2793 * be valid after IO completes as it's a read vs truncate race. The
2794 * operation must restart if the page is not uptodate on unlock but
2795 * otherwise serialising on page lock to stabilise the mapping gives
2796 * no additional guarantees to the caller as the page lock is
2797 * released before return.
2798 * Case d, similar to truncation. If reclaim holds the page lock, it
2799 * will be a race with remove_mapping that determines if the mapping
2800 * is valid on unlock but otherwise the data is valid and there is
2801 * no need to serialise with page lock.
2803 * As the page lock gives no additional guarantee, we optimistically
2804 * wait on the page to be unlocked and check if it's up to date and
2805 * use the page if it is. Otherwise, the page lock is required to
2806 * distinguish between the different cases. The motivation is that we
2807 * avoid spurious serialisations and wakeups when multiple processes
2808 * wait on the same page for IO to complete.
2810 wait_on_page_locked(page);
2811 if (PageUptodate(page))
2814 /* Distinguish between all the cases under the safety of the lock */
2817 /* Case c or d, restart the operation */
2818 if (!page->mapping) {
2824 /* Someone else locked and filled the page in a very small window */
2825 if (PageUptodate(page)) {
2832 mark_page_accessed(page);
2837 * read_cache_page - read into page cache, fill it if needed
2838 * @mapping: the page's address_space
2839 * @index: the page index
2840 * @filler: function to perform the read
2841 * @data: first arg to filler(data, page) function, often left as NULL
2843 * Read into the page cache. If a page already exists, and PageUptodate() is
2844 * not set, try to fill the page and wait for it to become unlocked.
2846 * If the page does not get brought uptodate, return -EIO.
2848 struct page *read_cache_page(struct address_space *mapping,
2850 int (*filler)(void *, struct page *),
2853 return do_read_cache_page(mapping, index, filler, data, mapping_gfp_mask(mapping));
2855 EXPORT_SYMBOL(read_cache_page);
2858 * read_cache_page_gfp - read into page cache, using specified page allocation flags.
2859 * @mapping: the page's address_space
2860 * @index: the page index
2861 * @gfp: the page allocator flags to use if allocating
2863 * This is the same as "read_mapping_page(mapping, index, NULL)", but with
2864 * any new page allocations done using the specified allocation flags.
2866 * If the page does not get brought uptodate, return -EIO.
2868 struct page *read_cache_page_gfp(struct address_space *mapping,
2872 filler_t *filler = (filler_t *)mapping->a_ops->readpage;
2874 return do_read_cache_page(mapping, index, filler, NULL, gfp);
2876 EXPORT_SYMBOL(read_cache_page_gfp);
2879 * Performs necessary checks before doing a write
2881 * Can adjust writing position or amount of bytes to write.
2882 * Returns appropriate error code that caller should return or
2883 * zero in case that write should be allowed.
2885 inline ssize_t generic_write_checks(struct kiocb *iocb, struct iov_iter *from)
2887 struct file *file = iocb->ki_filp;
2888 struct inode *inode = file->f_mapping->host;
2889 unsigned long limit = rlimit(RLIMIT_FSIZE);
2892 if (!iov_iter_count(from))
2895 /* FIXME: this is for backwards compatibility with 2.4 */
2896 if (iocb->ki_flags & IOCB_APPEND)
2897 iocb->ki_pos = i_size_read(inode);
2901 if ((iocb->ki_flags & IOCB_NOWAIT) && !(iocb->ki_flags & IOCB_DIRECT))
2904 if (limit != RLIM_INFINITY) {
2905 if (iocb->ki_pos >= limit) {
2906 send_sig(SIGXFSZ, current, 0);
2909 iov_iter_truncate(from, limit - (unsigned long)pos);
2915 if (unlikely(pos + iov_iter_count(from) > MAX_NON_LFS &&
2916 !(file->f_flags & O_LARGEFILE))) {
2917 if (pos >= MAX_NON_LFS)
2919 iov_iter_truncate(from, MAX_NON_LFS - (unsigned long)pos);
2923 * Are we about to exceed the fs block limit ?
2925 * If we have written data it becomes a short write. If we have
2926 * exceeded without writing data we send a signal and return EFBIG.
2927 * Linus frestrict idea will clean these up nicely..
2929 if (unlikely(pos >= inode->i_sb->s_maxbytes))
2932 iov_iter_truncate(from, inode->i_sb->s_maxbytes - pos);
2933 return iov_iter_count(from);
2935 EXPORT_SYMBOL(generic_write_checks);
2937 int pagecache_write_begin(struct file *file, struct address_space *mapping,
2938 loff_t pos, unsigned len, unsigned flags,
2939 struct page **pagep, void **fsdata)
2941 const struct address_space_operations *aops = mapping->a_ops;
2943 return aops->write_begin(file, mapping, pos, len, flags,
2946 EXPORT_SYMBOL(pagecache_write_begin);
2948 int pagecache_write_end(struct file *file, struct address_space *mapping,
2949 loff_t pos, unsigned len, unsigned copied,
2950 struct page *page, void *fsdata)
2952 const struct address_space_operations *aops = mapping->a_ops;
2954 return aops->write_end(file, mapping, pos, len, copied, page, fsdata);
2956 EXPORT_SYMBOL(pagecache_write_end);
2959 generic_file_direct_write(struct kiocb *iocb, struct iov_iter *from)
2961 struct file *file = iocb->ki_filp;
2962 struct address_space *mapping = file->f_mapping;
2963 struct inode *inode = mapping->host;
2964 loff_t pos = iocb->ki_pos;
2969 write_len = iov_iter_count(from);
2970 end = (pos + write_len - 1) >> PAGE_SHIFT;
2972 if (iocb->ki_flags & IOCB_NOWAIT) {
2973 /* If there are pages to writeback, return */
2974 if (filemap_range_has_page(inode->i_mapping, pos,
2975 pos + iov_iter_count(from)))
2978 written = filemap_write_and_wait_range(mapping, pos,
2979 pos + write_len - 1);
2985 * After a write we want buffered reads to be sure to go to disk to get
2986 * the new data. We invalidate clean cached page from the region we're
2987 * about to write. We do this *before* the write so that we can return
2988 * without clobbering -EIOCBQUEUED from ->direct_IO().
2990 written = invalidate_inode_pages2_range(mapping,
2991 pos >> PAGE_SHIFT, end);
2993 * If a page can not be invalidated, return 0 to fall back
2994 * to buffered write.
2997 if (written == -EBUSY)
3002 written = mapping->a_ops->direct_IO(iocb, from);
3005 * Finally, try again to invalidate clean pages which might have been
3006 * cached by non-direct readahead, or faulted in by get_user_pages()
3007 * if the source of the write was an mmap'ed region of the file
3008 * we're writing. Either one is a pretty crazy thing to do,
3009 * so we don't support it 100%. If this invalidation
3010 * fails, tough, the write still worked...
3012 * Most of the time we do not need this since dio_complete() will do
3013 * the invalidation for us. However there are some file systems that
3014 * do not end up with dio_complete() being called, so let's not break
3015 * them by removing it completely
3017 if (mapping->nrpages)
3018 invalidate_inode_pages2_range(mapping,
3019 pos >> PAGE_SHIFT, end);
3023 write_len -= written;
3024 if (pos > i_size_read(inode) && !S_ISBLK(inode->i_mode)) {
3025 i_size_write(inode, pos);
3026 mark_inode_dirty(inode);
3030 iov_iter_revert(from, write_len - iov_iter_count(from));
3034 EXPORT_SYMBOL(generic_file_direct_write);
3037 * Find or create a page at the given pagecache position. Return the locked
3038 * page. This function is specifically for buffered writes.
3040 struct page *grab_cache_page_write_begin(struct address_space *mapping,
3041 pgoff_t index, unsigned flags)
3044 int fgp_flags = FGP_LOCK|FGP_WRITE|FGP_CREAT;
3046 if (flags & AOP_FLAG_NOFS)
3047 fgp_flags |= FGP_NOFS;
3049 page = pagecache_get_page(mapping, index, fgp_flags,
3050 mapping_gfp_mask(mapping));
3052 wait_for_stable_page(page);
3056 EXPORT_SYMBOL(grab_cache_page_write_begin);
3058 ssize_t generic_perform_write(struct file *file,
3059 struct iov_iter *i, loff_t pos)
3061 struct address_space *mapping = file->f_mapping;
3062 const struct address_space_operations *a_ops = mapping->a_ops;
3064 ssize_t written = 0;
3065 unsigned int flags = 0;
3069 unsigned long offset; /* Offset into pagecache page */
3070 unsigned long bytes; /* Bytes to write to page */
3071 size_t copied; /* Bytes copied from user */
3074 offset = (pos & (PAGE_SIZE - 1));
3075 bytes = min_t(unsigned long, PAGE_SIZE - offset,
3080 * Bring in the user page that we will copy from _first_.
3081 * Otherwise there's a nasty deadlock on copying from the
3082 * same page as we're writing to, without it being marked
3085 * Not only is this an optimisation, but it is also required
3086 * to check that the address is actually valid, when atomic
3087 * usercopies are used, below.
3089 if (unlikely(iov_iter_fault_in_readable(i, bytes))) {
3094 if (fatal_signal_pending(current)) {
3099 status = a_ops->write_begin(file, mapping, pos, bytes, flags,
3101 if (unlikely(status < 0))
3104 if (mapping_writably_mapped(mapping))
3105 flush_dcache_page(page);
3107 copied = iov_iter_copy_from_user_atomic(page, i, offset, bytes);
3108 flush_dcache_page(page);
3110 status = a_ops->write_end(file, mapping, pos, bytes, copied,
3112 if (unlikely(status < 0))
3118 iov_iter_advance(i, copied);
3119 if (unlikely(copied == 0)) {
3121 * If we were unable to copy any data at all, we must
3122 * fall back to a single segment length write.
3124 * If we didn't fallback here, we could livelock
3125 * because not all segments in the iov can be copied at
3126 * once without a pagefault.
3128 bytes = min_t(unsigned long, PAGE_SIZE - offset,
3129 iov_iter_single_seg_count(i));
3135 balance_dirty_pages_ratelimited(mapping);
3136 } while (iov_iter_count(i));
3138 return written ? written : status;
3140 EXPORT_SYMBOL(generic_perform_write);
3143 * __generic_file_write_iter - write data to a file
3144 * @iocb: IO state structure (file, offset, etc.)
3145 * @from: iov_iter with data to write
3147 * This function does all the work needed for actually writing data to a
3148 * file. It does all basic checks, removes SUID from the file, updates
3149 * modification times and calls proper subroutines depending on whether we
3150 * do direct IO or a standard buffered write.
3152 * It expects i_mutex to be grabbed unless we work on a block device or similar
3153 * object which does not need locking at all.
3155 * This function does *not* take care of syncing data in case of O_SYNC write.
3156 * A caller has to handle it. This is mainly due to the fact that we want to
3157 * avoid syncing under i_mutex.
3159 ssize_t __generic_file_write_iter(struct kiocb *iocb, struct iov_iter *from)
3161 struct file *file = iocb->ki_filp;
3162 struct address_space * mapping = file->f_mapping;
3163 struct inode *inode = mapping->host;
3164 ssize_t written = 0;
3168 /* We can write back this queue in page reclaim */
3169 current->backing_dev_info = inode_to_bdi(inode);
3170 err = file_remove_privs(file);
3174 err = file_update_time(file);
3178 if (iocb->ki_flags & IOCB_DIRECT) {
3179 loff_t pos, endbyte;
3181 written = generic_file_direct_write(iocb, from);
3183 * If the write stopped short of completing, fall back to
3184 * buffered writes. Some filesystems do this for writes to
3185 * holes, for example. For DAX files, a buffered write will
3186 * not succeed (even if it did, DAX does not handle dirty
3187 * page-cache pages correctly).
3189 if (written < 0 || !iov_iter_count(from) || IS_DAX(inode))
3192 status = generic_perform_write(file, from, pos = iocb->ki_pos);
3194 * If generic_perform_write() returned a synchronous error
3195 * then we want to return the number of bytes which were
3196 * direct-written, or the error code if that was zero. Note
3197 * that this differs from normal direct-io semantics, which
3198 * will return -EFOO even if some bytes were written.
3200 if (unlikely(status < 0)) {
3205 * We need to ensure that the page cache pages are written to
3206 * disk and invalidated to preserve the expected O_DIRECT
3209 endbyte = pos + status - 1;
3210 err = filemap_write_and_wait_range(mapping, pos, endbyte);
3212 iocb->ki_pos = endbyte + 1;
3214 invalidate_mapping_pages(mapping,
3216 endbyte >> PAGE_SHIFT);
3219 * We don't know how much we wrote, so just return
3220 * the number of bytes which were direct-written
3224 written = generic_perform_write(file, from, iocb->ki_pos);
3225 if (likely(written > 0))
3226 iocb->ki_pos += written;
3229 current->backing_dev_info = NULL;
3230 return written ? written : err;
3232 EXPORT_SYMBOL(__generic_file_write_iter);
3235 * generic_file_write_iter - write data to a file
3236 * @iocb: IO state structure
3237 * @from: iov_iter with data to write
3239 * This is a wrapper around __generic_file_write_iter() to be used by most
3240 * filesystems. It takes care of syncing the file in case of O_SYNC file
3241 * and acquires i_mutex as needed.
3243 ssize_t generic_file_write_iter(struct kiocb *iocb, struct iov_iter *from)
3245 struct file *file = iocb->ki_filp;
3246 struct inode *inode = file->f_mapping->host;
3250 ret = generic_write_checks(iocb, from);
3252 ret = __generic_file_write_iter(iocb, from);
3253 inode_unlock(inode);
3256 ret = generic_write_sync(iocb, ret);
3259 EXPORT_SYMBOL(generic_file_write_iter);
3262 * try_to_release_page() - release old fs-specific metadata on a page
3264 * @page: the page which the kernel is trying to free
3265 * @gfp_mask: memory allocation flags (and I/O mode)
3267 * The address_space is to try to release any data against the page
3268 * (presumably at page->private). If the release was successful, return '1'.
3269 * Otherwise return zero.
3271 * This may also be called if PG_fscache is set on a page, indicating that the
3272 * page is known to the local caching routines.
3274 * The @gfp_mask argument specifies whether I/O may be performed to release
3275 * this page (__GFP_IO), and whether the call may block (__GFP_RECLAIM & __GFP_FS).
3278 int try_to_release_page(struct page *page, gfp_t gfp_mask)
3280 struct address_space * const mapping = page->mapping;
3282 BUG_ON(!PageLocked(page));
3283 if (PageWriteback(page))
3286 if (mapping && mapping->a_ops->releasepage)
3287 return mapping->a_ops->releasepage(page, gfp_mask);
3288 return try_to_free_buffers(page);
3291 EXPORT_SYMBOL(try_to_release_page);