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/module.h>
13 #include <linux/compiler.h>
15 #include <linux/uaccess.h>
16 #include <linux/aio.h>
17 #include <linux/capability.h>
18 #include <linux/kernel_stat.h>
19 #include <linux/gfp.h>
21 #include <linux/swap.h>
22 #include <linux/mman.h>
23 #include <linux/pagemap.h>
24 #include <linux/file.h>
25 #include <linux/uio.h>
26 #include <linux/hash.h>
27 #include <linux/writeback.h>
28 #include <linux/backing-dev.h>
29 #include <linux/pagevec.h>
30 #include <linux/blkdev.h>
31 #include <linux/security.h>
32 #include <linux/syscalls.h>
33 #include <linux/cpuset.h>
34 #include <linux/hardirq.h> /* for BUG_ON(!in_atomic()) only */
35 #include <linux/memcontrol.h>
36 #include <linux/mm_inline.h> /* for page_is_file_cache() */
40 * FIXME: remove all knowledge of the buffer layer from the core VM
42 #include <linux/buffer_head.h> /* for try_to_free_buffers */
47 * Shared mappings implemented 30.11.1994. It's not fully working yet,
50 * Shared mappings now work. 15.8.1995 Bruno.
52 * finished 'unifying' the page and buffer cache and SMP-threaded the
53 * page-cache, 21.05.1999, Ingo Molnar <mingo@redhat.com>
55 * SMP-threaded pagemap-LRU 1999, Andrea Arcangeli <andrea@suse.de>
61 * ->i_mmap_lock (truncate_pagecache)
62 * ->private_lock (__free_pte->__set_page_dirty_buffers)
63 * ->swap_lock (exclusive_swap_page, others)
64 * ->mapping->tree_lock
67 * ->i_mmap_lock (truncate->unmap_mapping_range)
71 * ->page_table_lock or pte_lock (various, mainly in memory.c)
72 * ->mapping->tree_lock (arch-dependent flush_dcache_mmap_lock)
75 * ->lock_page (access_process_vm)
77 * ->i_mutex (generic_file_buffered_write)
78 * ->mmap_sem (fault_in_pages_readable->do_page_fault)
81 * ->i_alloc_sem (various)
84 * ->sb_lock (fs/fs-writeback.c)
85 * ->mapping->tree_lock (__sync_single_inode)
88 * ->anon_vma.lock (vma_adjust)
91 * ->page_table_lock or pte_lock (anon_vma_prepare and various)
93 * ->page_table_lock or pte_lock
94 * ->swap_lock (try_to_unmap_one)
95 * ->private_lock (try_to_unmap_one)
96 * ->tree_lock (try_to_unmap_one)
97 * ->zone.lru_lock (follow_page->mark_page_accessed)
98 * ->zone.lru_lock (check_pte_range->isolate_lru_page)
99 * ->private_lock (page_remove_rmap->set_page_dirty)
100 * ->tree_lock (page_remove_rmap->set_page_dirty)
101 * ->inode_lock (page_remove_rmap->set_page_dirty)
102 * ->inode_lock (zap_pte_range->set_page_dirty)
103 * ->private_lock (zap_pte_range->__set_page_dirty_buffers)
105 * (code doesn't rely on that order, so you could switch it around)
106 * ->tasklist_lock (memory_failure, collect_procs_ao)
111 * Remove a page from the page cache and free it. Caller has to make
112 * sure the page is locked and that nobody else uses it - or that usage
113 * is safe. The caller must hold the mapping's tree_lock.
115 void __remove_from_page_cache(struct page
*page
)
117 struct address_space
*mapping
= page
->mapping
;
119 radix_tree_delete(&mapping
->page_tree
, page
->index
);
120 page
->mapping
= NULL
;
122 __dec_zone_page_state(page
, NR_FILE_PAGES
);
123 if (PageSwapBacked(page
))
124 __dec_zone_page_state(page
, NR_SHMEM
);
125 BUG_ON(page_mapped(page
));
128 * Some filesystems seem to re-dirty the page even after
129 * the VM has canceled the dirty bit (eg ext3 journaling).
131 * Fix it up by doing a final dirty accounting check after
132 * having removed the page entirely.
134 if (PageDirty(page
) && mapping_cap_account_dirty(mapping
)) {
135 dec_zone_page_state(page
, NR_FILE_DIRTY
);
136 dec_bdi_stat(mapping
->backing_dev_info
, BDI_RECLAIMABLE
);
140 void remove_from_page_cache(struct page
*page
)
142 struct address_space
*mapping
= page
->mapping
;
143 void (*freepage
)(struct page
*);
145 BUG_ON(!PageLocked(page
));
147 freepage
= mapping
->a_ops
->freepage
;
148 spin_lock_irq(&mapping
->tree_lock
);
149 __remove_from_page_cache(page
);
150 spin_unlock_irq(&mapping
->tree_lock
);
151 mem_cgroup_uncharge_cache_page(page
);
156 EXPORT_SYMBOL(remove_from_page_cache
);
158 static int sync_page(void *word
)
160 struct address_space
*mapping
;
163 page
= container_of((unsigned long *)word
, struct page
, flags
);
166 * page_mapping() is being called without PG_locked held.
167 * Some knowledge of the state and use of the page is used to
168 * reduce the requirements down to a memory barrier.
169 * The danger here is of a stale page_mapping() return value
170 * indicating a struct address_space different from the one it's
171 * associated with when it is associated with one.
172 * After smp_mb(), it's either the correct page_mapping() for
173 * the page, or an old page_mapping() and the page's own
174 * page_mapping() has gone NULL.
175 * The ->sync_page() address_space operation must tolerate
176 * page_mapping() going NULL. By an amazing coincidence,
177 * this comes about because none of the users of the page
178 * in the ->sync_page() methods make essential use of the
179 * page_mapping(), merely passing the page down to the backing
180 * device's unplug functions when it's non-NULL, which in turn
181 * ignore it for all cases but swap, where only page_private(page) is
182 * of interest. When page_mapping() does go NULL, the entire
183 * call stack gracefully ignores the page and returns.
187 mapping
= page_mapping(page
);
188 if (mapping
&& mapping
->a_ops
&& mapping
->a_ops
->sync_page
)
189 mapping
->a_ops
->sync_page(page
);
194 static int sync_page_killable(void *word
)
197 return fatal_signal_pending(current
) ? -EINTR
: 0;
201 * __filemap_fdatawrite_range - start writeback on mapping dirty pages in range
202 * @mapping: address space structure to write
203 * @start: offset in bytes where the range starts
204 * @end: offset in bytes where the range ends (inclusive)
205 * @sync_mode: enable synchronous operation
207 * Start writeback against all of a mapping's dirty pages that lie
208 * within the byte offsets <start, end> inclusive.
210 * If sync_mode is WB_SYNC_ALL then this is a "data integrity" operation, as
211 * opposed to a regular memory cleansing writeback. The difference between
212 * these two operations is that if a dirty page/buffer is encountered, it must
213 * be waited upon, and not just skipped over.
215 int __filemap_fdatawrite_range(struct address_space
*mapping
, loff_t start
,
216 loff_t end
, int sync_mode
)
219 struct writeback_control wbc
= {
220 .sync_mode
= sync_mode
,
221 .nr_to_write
= LONG_MAX
,
222 .range_start
= start
,
226 if (!mapping_cap_writeback_dirty(mapping
))
229 ret
= do_writepages(mapping
, &wbc
);
233 static inline int __filemap_fdatawrite(struct address_space
*mapping
,
236 return __filemap_fdatawrite_range(mapping
, 0, LLONG_MAX
, sync_mode
);
239 int filemap_fdatawrite(struct address_space
*mapping
)
241 return __filemap_fdatawrite(mapping
, WB_SYNC_ALL
);
243 EXPORT_SYMBOL(filemap_fdatawrite
);
245 int filemap_fdatawrite_range(struct address_space
*mapping
, loff_t start
,
248 return __filemap_fdatawrite_range(mapping
, start
, end
, WB_SYNC_ALL
);
250 EXPORT_SYMBOL(filemap_fdatawrite_range
);
253 * filemap_flush - mostly a non-blocking flush
254 * @mapping: target address_space
256 * This is a mostly non-blocking flush. Not suitable for data-integrity
257 * purposes - I/O may not be started against all dirty pages.
259 int filemap_flush(struct address_space
*mapping
)
261 return __filemap_fdatawrite(mapping
, WB_SYNC_NONE
);
263 EXPORT_SYMBOL(filemap_flush
);
266 * filemap_fdatawait_range - wait for writeback to complete
267 * @mapping: address space structure to wait for
268 * @start_byte: offset in bytes where the range starts
269 * @end_byte: offset in bytes where the range ends (inclusive)
271 * Walk the list of under-writeback pages of the given address space
272 * in the given range and wait for all of them.
274 int filemap_fdatawait_range(struct address_space
*mapping
, loff_t start_byte
,
277 pgoff_t index
= start_byte
>> PAGE_CACHE_SHIFT
;
278 pgoff_t end
= end_byte
>> PAGE_CACHE_SHIFT
;
283 if (end_byte
< start_byte
)
286 pagevec_init(&pvec
, 0);
287 while ((index
<= end
) &&
288 (nr_pages
= pagevec_lookup_tag(&pvec
, mapping
, &index
,
289 PAGECACHE_TAG_WRITEBACK
,
290 min(end
- index
, (pgoff_t
)PAGEVEC_SIZE
-1) + 1)) != 0) {
293 for (i
= 0; i
< nr_pages
; i
++) {
294 struct page
*page
= pvec
.pages
[i
];
296 /* until radix tree lookup accepts end_index */
297 if (page
->index
> end
)
300 wait_on_page_writeback(page
);
301 if (TestClearPageError(page
))
304 pagevec_release(&pvec
);
308 /* Check for outstanding write errors */
309 if (test_and_clear_bit(AS_ENOSPC
, &mapping
->flags
))
311 if (test_and_clear_bit(AS_EIO
, &mapping
->flags
))
316 EXPORT_SYMBOL(filemap_fdatawait_range
);
319 * filemap_fdatawait - wait for all under-writeback pages to complete
320 * @mapping: address space structure to wait for
322 * Walk the list of under-writeback pages of the given address space
323 * and wait for all of them.
325 int filemap_fdatawait(struct address_space
*mapping
)
327 loff_t i_size
= i_size_read(mapping
->host
);
332 return filemap_fdatawait_range(mapping
, 0, i_size
- 1);
334 EXPORT_SYMBOL(filemap_fdatawait
);
336 int filemap_write_and_wait(struct address_space
*mapping
)
340 if (mapping
->nrpages
) {
341 err
= filemap_fdatawrite(mapping
);
343 * Even if the above returned error, the pages may be
344 * written partially (e.g. -ENOSPC), so we wait for it.
345 * But the -EIO is special case, it may indicate the worst
346 * thing (e.g. bug) happened, so we avoid waiting for it.
349 int err2
= filemap_fdatawait(mapping
);
356 EXPORT_SYMBOL(filemap_write_and_wait
);
359 * filemap_write_and_wait_range - write out & wait on a file range
360 * @mapping: the address_space for the pages
361 * @lstart: offset in bytes where the range starts
362 * @lend: offset in bytes where the range ends (inclusive)
364 * Write out and wait upon file offsets lstart->lend, inclusive.
366 * Note that `lend' is inclusive (describes the last byte to be written) so
367 * that this function can be used to write to the very end-of-file (end = -1).
369 int filemap_write_and_wait_range(struct address_space
*mapping
,
370 loff_t lstart
, loff_t lend
)
374 if (mapping
->nrpages
) {
375 err
= __filemap_fdatawrite_range(mapping
, lstart
, lend
,
377 /* See comment of filemap_write_and_wait() */
379 int err2
= filemap_fdatawait_range(mapping
,
387 EXPORT_SYMBOL(filemap_write_and_wait_range
);
390 * replace_page_cache_page - replace a pagecache page with a new one
391 * @old: page to be replaced
392 * @new: page to replace with
393 * @gfp_mask: allocation mode
395 * This function replaces a page in the pagecache with a new one. On
396 * success it acquires the pagecache reference for the new page and
397 * drops it for the old page. Both the old and new pages must be
398 * locked. This function does not add the new page to the LRU, the
399 * caller must do that.
401 * The remove + add is atomic. The only way this function can fail is
402 * memory allocation failure.
404 int replace_page_cache_page(struct page
*old
, struct page
*new, gfp_t gfp_mask
)
407 struct mem_cgroup
*memcg
= NULL
;
409 VM_BUG_ON(!PageLocked(old
));
410 VM_BUG_ON(!PageLocked(new));
411 VM_BUG_ON(new->mapping
);
414 * This is not page migration, but prepare_migration and
415 * end_migration does enough work for charge replacement.
417 * In the longer term we probably want a specialized function
418 * for moving the charge from old to new in a more efficient
421 error
= mem_cgroup_prepare_migration(old
, new, &memcg
, gfp_mask
);
425 error
= radix_tree_preload(gfp_mask
& ~__GFP_HIGHMEM
);
427 struct address_space
*mapping
= old
->mapping
;
428 void (*freepage
)(struct page
*);
430 pgoff_t offset
= old
->index
;
431 freepage
= mapping
->a_ops
->freepage
;
434 new->mapping
= mapping
;
437 spin_lock_irq(&mapping
->tree_lock
);
438 __remove_from_page_cache(old
);
439 error
= radix_tree_insert(&mapping
->page_tree
, offset
, new);
442 __inc_zone_page_state(new, NR_FILE_PAGES
);
443 if (PageSwapBacked(new))
444 __inc_zone_page_state(new, NR_SHMEM
);
445 spin_unlock_irq(&mapping
->tree_lock
);
446 radix_tree_preload_end();
449 page_cache_release(old
);
450 mem_cgroup_end_migration(memcg
, old
, new, true);
452 mem_cgroup_end_migration(memcg
, old
, new, false);
457 EXPORT_SYMBOL_GPL(replace_page_cache_page
);
460 * add_to_page_cache_locked - add a locked page to the pagecache
462 * @mapping: the page's address_space
463 * @offset: page index
464 * @gfp_mask: page allocation mode
466 * This function is used to add a page to the pagecache. It must be locked.
467 * This function does not add the page to the LRU. The caller must do that.
469 int add_to_page_cache_locked(struct page
*page
, struct address_space
*mapping
,
470 pgoff_t offset
, gfp_t gfp_mask
)
474 VM_BUG_ON(!PageLocked(page
));
476 error
= mem_cgroup_cache_charge(page
, current
->mm
,
477 gfp_mask
& GFP_RECLAIM_MASK
);
481 error
= radix_tree_preload(gfp_mask
& ~__GFP_HIGHMEM
);
483 page_cache_get(page
);
484 page
->mapping
= mapping
;
485 page
->index
= offset
;
487 spin_lock_irq(&mapping
->tree_lock
);
488 error
= radix_tree_insert(&mapping
->page_tree
, offset
, page
);
489 if (likely(!error
)) {
491 __inc_zone_page_state(page
, NR_FILE_PAGES
);
492 if (PageSwapBacked(page
))
493 __inc_zone_page_state(page
, NR_SHMEM
);
494 spin_unlock_irq(&mapping
->tree_lock
);
496 page
->mapping
= NULL
;
497 spin_unlock_irq(&mapping
->tree_lock
);
498 mem_cgroup_uncharge_cache_page(page
);
499 page_cache_release(page
);
501 radix_tree_preload_end();
503 mem_cgroup_uncharge_cache_page(page
);
507 EXPORT_SYMBOL(add_to_page_cache_locked
);
509 int add_to_page_cache_lru(struct page
*page
, struct address_space
*mapping
,
510 pgoff_t offset
, gfp_t gfp_mask
)
515 * Splice_read and readahead add shmem/tmpfs pages into the page cache
516 * before shmem_readpage has a chance to mark them as SwapBacked: they
517 * need to go on the anon lru below, and mem_cgroup_cache_charge
518 * (called in add_to_page_cache) needs to know where they're going too.
520 if (mapping_cap_swap_backed(mapping
))
521 SetPageSwapBacked(page
);
523 ret
= add_to_page_cache(page
, mapping
, offset
, gfp_mask
);
525 if (page_is_file_cache(page
))
526 lru_cache_add_file(page
);
528 lru_cache_add_anon(page
);
532 EXPORT_SYMBOL_GPL(add_to_page_cache_lru
);
535 struct page
*__page_cache_alloc(gfp_t gfp
)
540 if (cpuset_do_page_mem_spread()) {
542 n
= cpuset_mem_spread_node();
543 page
= alloc_pages_exact_node(n
, gfp
, 0);
547 return alloc_pages(gfp
, 0);
549 EXPORT_SYMBOL(__page_cache_alloc
);
552 static int __sleep_on_page_lock(void *word
)
559 * In order to wait for pages to become available there must be
560 * waitqueues associated with pages. By using a hash table of
561 * waitqueues where the bucket discipline is to maintain all
562 * waiters on the same queue and wake all when any of the pages
563 * become available, and for the woken contexts to check to be
564 * sure the appropriate page became available, this saves space
565 * at a cost of "thundering herd" phenomena during rare hash
568 static wait_queue_head_t
*page_waitqueue(struct page
*page
)
570 const struct zone
*zone
= page_zone(page
);
572 return &zone
->wait_table
[hash_ptr(page
, zone
->wait_table_bits
)];
575 static inline void wake_up_page(struct page
*page
, int bit
)
577 __wake_up_bit(page_waitqueue(page
), &page
->flags
, bit
);
580 void wait_on_page_bit(struct page
*page
, int bit_nr
)
582 DEFINE_WAIT_BIT(wait
, &page
->flags
, bit_nr
);
584 if (test_bit(bit_nr
, &page
->flags
))
585 __wait_on_bit(page_waitqueue(page
), &wait
, sync_page
,
586 TASK_UNINTERRUPTIBLE
);
588 EXPORT_SYMBOL(wait_on_page_bit
);
591 * add_page_wait_queue - Add an arbitrary waiter to a page's wait queue
592 * @page: Page defining the wait queue of interest
593 * @waiter: Waiter to add to the queue
595 * Add an arbitrary @waiter to the wait queue for the nominated @page.
597 void add_page_wait_queue(struct page
*page
, wait_queue_t
*waiter
)
599 wait_queue_head_t
*q
= page_waitqueue(page
);
602 spin_lock_irqsave(&q
->lock
, flags
);
603 __add_wait_queue(q
, waiter
);
604 spin_unlock_irqrestore(&q
->lock
, flags
);
606 EXPORT_SYMBOL_GPL(add_page_wait_queue
);
609 * unlock_page - unlock a locked page
612 * Unlocks the page and wakes up sleepers in ___wait_on_page_locked().
613 * Also wakes sleepers in wait_on_page_writeback() because the wakeup
614 * mechananism between PageLocked pages and PageWriteback pages is shared.
615 * But that's OK - sleepers in wait_on_page_writeback() just go back to sleep.
617 * The mb is necessary to enforce ordering between the clear_bit and the read
618 * of the waitqueue (to avoid SMP races with a parallel wait_on_page_locked()).
620 void unlock_page(struct page
*page
)
622 VM_BUG_ON(!PageLocked(page
));
623 clear_bit_unlock(PG_locked
, &page
->flags
);
624 smp_mb__after_clear_bit();
625 wake_up_page(page
, PG_locked
);
627 EXPORT_SYMBOL(unlock_page
);
630 * end_page_writeback - end writeback against a page
633 void end_page_writeback(struct page
*page
)
635 if (TestClearPageReclaim(page
))
636 rotate_reclaimable_page(page
);
638 if (!test_clear_page_writeback(page
))
641 smp_mb__after_clear_bit();
642 wake_up_page(page
, PG_writeback
);
644 EXPORT_SYMBOL(end_page_writeback
);
647 * __lock_page - get a lock on the page, assuming we need to sleep to get it
648 * @page: the page to lock
650 * Ugly. Running sync_page() in state TASK_UNINTERRUPTIBLE is scary. If some
651 * random driver's requestfn sets TASK_RUNNING, we could busywait. However
652 * chances are that on the second loop, the block layer's plug list is empty,
653 * so sync_page() will then return in state TASK_UNINTERRUPTIBLE.
655 void __lock_page(struct page
*page
)
657 DEFINE_WAIT_BIT(wait
, &page
->flags
, PG_locked
);
659 __wait_on_bit_lock(page_waitqueue(page
), &wait
, sync_page
,
660 TASK_UNINTERRUPTIBLE
);
662 EXPORT_SYMBOL(__lock_page
);
664 int __lock_page_killable(struct page
*page
)
666 DEFINE_WAIT_BIT(wait
, &page
->flags
, PG_locked
);
668 return __wait_on_bit_lock(page_waitqueue(page
), &wait
,
669 sync_page_killable
, TASK_KILLABLE
);
671 EXPORT_SYMBOL_GPL(__lock_page_killable
);
674 * __lock_page_nosync - get a lock on the page, without calling sync_page()
675 * @page: the page to lock
677 * Variant of lock_page that does not require the caller to hold a reference
678 * on the page's mapping.
680 void __lock_page_nosync(struct page
*page
)
682 DEFINE_WAIT_BIT(wait
, &page
->flags
, PG_locked
);
683 __wait_on_bit_lock(page_waitqueue(page
), &wait
, __sleep_on_page_lock
,
684 TASK_UNINTERRUPTIBLE
);
687 int __lock_page_or_retry(struct page
*page
, struct mm_struct
*mm
,
690 if (!(flags
& FAULT_FLAG_ALLOW_RETRY
)) {
694 if (!(flags
& FAULT_FLAG_RETRY_NOWAIT
)) {
695 up_read(&mm
->mmap_sem
);
696 wait_on_page_locked(page
);
703 * find_get_page - find and get a page reference
704 * @mapping: the address_space to search
705 * @offset: the page index
707 * Is there a pagecache struct page at the given (mapping, offset) tuple?
708 * If yes, increment its refcount and return it; if no, return NULL.
710 struct page
*find_get_page(struct address_space
*mapping
, pgoff_t offset
)
718 pagep
= radix_tree_lookup_slot(&mapping
->page_tree
, offset
);
720 page
= radix_tree_deref_slot(pagep
);
723 if (radix_tree_deref_retry(page
))
726 if (!page_cache_get_speculative(page
))
730 * Has the page moved?
731 * This is part of the lockless pagecache protocol. See
732 * include/linux/pagemap.h for details.
734 if (unlikely(page
!= *pagep
)) {
735 page_cache_release(page
);
744 EXPORT_SYMBOL(find_get_page
);
747 * find_lock_page - locate, pin and lock a pagecache page
748 * @mapping: the address_space to search
749 * @offset: the page index
751 * Locates the desired pagecache page, locks it, increments its reference
752 * count and returns its address.
754 * Returns zero if the page was not present. find_lock_page() may sleep.
756 struct page
*find_lock_page(struct address_space
*mapping
, pgoff_t offset
)
761 page
= find_get_page(mapping
, offset
);
764 /* Has the page been truncated? */
765 if (unlikely(page
->mapping
!= mapping
)) {
767 page_cache_release(page
);
770 VM_BUG_ON(page
->index
!= offset
);
774 EXPORT_SYMBOL(find_lock_page
);
777 * find_or_create_page - locate or add a pagecache page
778 * @mapping: the page's address_space
779 * @index: the page's index into the mapping
780 * @gfp_mask: page allocation mode
782 * Locates a page in the pagecache. If the page is not present, a new page
783 * is allocated using @gfp_mask and is added to the pagecache and to the VM's
784 * LRU list. The returned page is locked and has its reference count
787 * find_or_create_page() may sleep, even if @gfp_flags specifies an atomic
790 * find_or_create_page() returns the desired page's address, or zero on
793 struct page
*find_or_create_page(struct address_space
*mapping
,
794 pgoff_t index
, gfp_t gfp_mask
)
799 page
= find_lock_page(mapping
, index
);
801 page
= __page_cache_alloc(gfp_mask
);
805 * We want a regular kernel memory (not highmem or DMA etc)
806 * allocation for the radix tree nodes, but we need to honour
807 * the context-specific requirements the caller has asked for.
808 * GFP_RECLAIM_MASK collects those requirements.
810 err
= add_to_page_cache_lru(page
, mapping
, index
,
811 (gfp_mask
& GFP_RECLAIM_MASK
));
813 page_cache_release(page
);
821 EXPORT_SYMBOL(find_or_create_page
);
824 * find_get_pages - gang pagecache lookup
825 * @mapping: The address_space to search
826 * @start: The starting page index
827 * @nr_pages: The maximum number of pages
828 * @pages: Where the resulting pages are placed
830 * find_get_pages() will search for and return a group of up to
831 * @nr_pages pages in the mapping. The pages are placed at @pages.
832 * find_get_pages() takes a reference against the returned pages.
834 * The search returns a group of mapping-contiguous pages with ascending
835 * indexes. There may be holes in the indices due to not-present pages.
837 * find_get_pages() returns the number of pages which were found.
839 unsigned find_get_pages(struct address_space
*mapping
, pgoff_t start
,
840 unsigned int nr_pages
, struct page
**pages
)
844 unsigned int nr_found
;
848 nr_found
= radix_tree_gang_lookup_slot(&mapping
->page_tree
,
849 (void ***)pages
, start
, nr_pages
);
851 for (i
= 0; i
< nr_found
; i
++) {
854 page
= radix_tree_deref_slot((void **)pages
[i
]);
857 if (radix_tree_deref_retry(page
)) {
859 start
= pages
[ret
-1]->index
;
863 if (!page_cache_get_speculative(page
))
866 /* Has the page moved? */
867 if (unlikely(page
!= *((void **)pages
[i
]))) {
868 page_cache_release(page
);
880 * find_get_pages_contig - gang contiguous pagecache lookup
881 * @mapping: The address_space to search
882 * @index: The starting page index
883 * @nr_pages: The maximum number of pages
884 * @pages: Where the resulting pages are placed
886 * find_get_pages_contig() works exactly like find_get_pages(), except
887 * that the returned number of pages are guaranteed to be contiguous.
889 * find_get_pages_contig() returns the number of pages which were found.
891 unsigned find_get_pages_contig(struct address_space
*mapping
, pgoff_t index
,
892 unsigned int nr_pages
, struct page
**pages
)
896 unsigned int nr_found
;
900 nr_found
= radix_tree_gang_lookup_slot(&mapping
->page_tree
,
901 (void ***)pages
, index
, nr_pages
);
903 for (i
= 0; i
< nr_found
; i
++) {
906 page
= radix_tree_deref_slot((void **)pages
[i
]);
909 if (radix_tree_deref_retry(page
))
912 if (!page_cache_get_speculative(page
))
915 /* Has the page moved? */
916 if (unlikely(page
!= *((void **)pages
[i
]))) {
917 page_cache_release(page
);
922 * must check mapping and index after taking the ref.
923 * otherwise we can get both false positives and false
924 * negatives, which is just confusing to the caller.
926 if (page
->mapping
== NULL
|| page
->index
!= index
) {
927 page_cache_release(page
);
938 EXPORT_SYMBOL(find_get_pages_contig
);
941 * find_get_pages_tag - find and return pages that match @tag
942 * @mapping: the address_space to search
943 * @index: the starting page index
944 * @tag: the tag index
945 * @nr_pages: the maximum number of pages
946 * @pages: where the resulting pages are placed
948 * Like find_get_pages, except we only return pages which are tagged with
949 * @tag. We update @index to index the next page for the traversal.
951 unsigned find_get_pages_tag(struct address_space
*mapping
, pgoff_t
*index
,
952 int tag
, unsigned int nr_pages
, struct page
**pages
)
956 unsigned int nr_found
;
960 nr_found
= radix_tree_gang_lookup_tag_slot(&mapping
->page_tree
,
961 (void ***)pages
, *index
, nr_pages
, tag
);
963 for (i
= 0; i
< nr_found
; i
++) {
966 page
= radix_tree_deref_slot((void **)pages
[i
]);
969 if (radix_tree_deref_retry(page
))
972 if (!page_cache_get_speculative(page
))
975 /* Has the page moved? */
976 if (unlikely(page
!= *((void **)pages
[i
]))) {
977 page_cache_release(page
);
987 *index
= pages
[ret
- 1]->index
+ 1;
991 EXPORT_SYMBOL(find_get_pages_tag
);
994 * grab_cache_page_nowait - returns locked page at given index in given cache
995 * @mapping: target address_space
996 * @index: the page index
998 * Same as grab_cache_page(), but do not wait if the page is unavailable.
999 * This is intended for speculative data generators, where the data can
1000 * be regenerated if the page couldn't be grabbed. This routine should
1001 * be safe to call while holding the lock for another page.
1003 * Clear __GFP_FS when allocating the page to avoid recursion into the fs
1004 * and deadlock against the caller's locked page.
1007 grab_cache_page_nowait(struct address_space
*mapping
, pgoff_t index
)
1009 struct page
*page
= find_get_page(mapping
, index
);
1012 if (trylock_page(page
))
1014 page_cache_release(page
);
1017 page
= __page_cache_alloc(mapping_gfp_mask(mapping
) & ~__GFP_FS
);
1018 if (page
&& add_to_page_cache_lru(page
, mapping
, index
, GFP_NOFS
)) {
1019 page_cache_release(page
);
1024 EXPORT_SYMBOL(grab_cache_page_nowait
);
1027 * CD/DVDs are error prone. When a medium error occurs, the driver may fail
1028 * a _large_ part of the i/o request. Imagine the worst scenario:
1030 * ---R__________________________________________B__________
1031 * ^ reading here ^ bad block(assume 4k)
1033 * read(R) => miss => readahead(R...B) => media error => frustrating retries
1034 * => failing the whole request => read(R) => read(R+1) =>
1035 * readahead(R+1...B+1) => bang => read(R+2) => read(R+3) =>
1036 * readahead(R+3...B+2) => bang => read(R+3) => read(R+4) =>
1037 * readahead(R+4...B+3) => bang => read(R+4) => read(R+5) => ......
1039 * It is going insane. Fix it by quickly scaling down the readahead size.
1041 static void shrink_readahead_size_eio(struct file
*filp
,
1042 struct file_ra_state
*ra
)
1048 * do_generic_file_read - generic file read routine
1049 * @filp: the file to read
1050 * @ppos: current file position
1051 * @desc: read_descriptor
1052 * @actor: read method
1054 * This is a generic file read routine, and uses the
1055 * mapping->a_ops->readpage() function for the actual low-level stuff.
1057 * This is really ugly. But the goto's actually try to clarify some
1058 * of the logic when it comes to error handling etc.
1060 static void do_generic_file_read(struct file
*filp
, loff_t
*ppos
,
1061 read_descriptor_t
*desc
, read_actor_t actor
)
1063 struct address_space
*mapping
= filp
->f_mapping
;
1064 struct inode
*inode
= mapping
->host
;
1065 struct file_ra_state
*ra
= &filp
->f_ra
;
1069 unsigned long offset
; /* offset into pagecache page */
1070 unsigned int prev_offset
;
1073 index
= *ppos
>> PAGE_CACHE_SHIFT
;
1074 prev_index
= ra
->prev_pos
>> PAGE_CACHE_SHIFT
;
1075 prev_offset
= ra
->prev_pos
& (PAGE_CACHE_SIZE
-1);
1076 last_index
= (*ppos
+ desc
->count
+ PAGE_CACHE_SIZE
-1) >> PAGE_CACHE_SHIFT
;
1077 offset
= *ppos
& ~PAGE_CACHE_MASK
;
1083 unsigned long nr
, ret
;
1087 page
= find_get_page(mapping
, index
);
1089 page_cache_sync_readahead(mapping
,
1091 index
, last_index
- index
);
1092 page
= find_get_page(mapping
, index
);
1093 if (unlikely(page
== NULL
))
1094 goto no_cached_page
;
1096 if (PageReadahead(page
)) {
1097 page_cache_async_readahead(mapping
,
1099 index
, last_index
- index
);
1101 if (!PageUptodate(page
)) {
1102 if (inode
->i_blkbits
== PAGE_CACHE_SHIFT
||
1103 !mapping
->a_ops
->is_partially_uptodate
)
1104 goto page_not_up_to_date
;
1105 if (!trylock_page(page
))
1106 goto page_not_up_to_date
;
1107 /* Did it get truncated before we got the lock? */
1109 goto page_not_up_to_date_locked
;
1110 if (!mapping
->a_ops
->is_partially_uptodate(page
,
1112 goto page_not_up_to_date_locked
;
1117 * i_size must be checked after we know the page is Uptodate.
1119 * Checking i_size after the check allows us to calculate
1120 * the correct value for "nr", which means the zero-filled
1121 * part of the page is not copied back to userspace (unless
1122 * another truncate extends the file - this is desired though).
1125 isize
= i_size_read(inode
);
1126 end_index
= (isize
- 1) >> PAGE_CACHE_SHIFT
;
1127 if (unlikely(!isize
|| index
> end_index
)) {
1128 page_cache_release(page
);
1132 /* nr is the maximum number of bytes to copy from this page */
1133 nr
= PAGE_CACHE_SIZE
;
1134 if (index
== end_index
) {
1135 nr
= ((isize
- 1) & ~PAGE_CACHE_MASK
) + 1;
1137 page_cache_release(page
);
1143 /* If users can be writing to this page using arbitrary
1144 * virtual addresses, take care about potential aliasing
1145 * before reading the page on the kernel side.
1147 if (mapping_writably_mapped(mapping
))
1148 flush_dcache_page(page
);
1151 * When a sequential read accesses a page several times,
1152 * only mark it as accessed the first time.
1154 if (prev_index
!= index
|| offset
!= prev_offset
)
1155 mark_page_accessed(page
);
1159 * Ok, we have the page, and it's up-to-date, so
1160 * now we can copy it to user space...
1162 * The actor routine returns how many bytes were actually used..
1163 * NOTE! This may not be the same as how much of a user buffer
1164 * we filled up (we may be padding etc), so we can only update
1165 * "pos" here (the actor routine has to update the user buffer
1166 * pointers and the remaining count).
1168 ret
= actor(desc
, page
, offset
, nr
);
1170 index
+= offset
>> PAGE_CACHE_SHIFT
;
1171 offset
&= ~PAGE_CACHE_MASK
;
1172 prev_offset
= offset
;
1174 page_cache_release(page
);
1175 if (ret
== nr
&& desc
->count
)
1179 page_not_up_to_date
:
1180 /* Get exclusive access to the page ... */
1181 error
= lock_page_killable(page
);
1182 if (unlikely(error
))
1183 goto readpage_error
;
1185 page_not_up_to_date_locked
:
1186 /* Did it get truncated before we got the lock? */
1187 if (!page
->mapping
) {
1189 page_cache_release(page
);
1193 /* Did somebody else fill it already? */
1194 if (PageUptodate(page
)) {
1201 * A previous I/O error may have been due to temporary
1202 * failures, eg. multipath errors.
1203 * PG_error will be set again if readpage fails.
1205 ClearPageError(page
);
1206 /* Start the actual read. The read will unlock the page. */
1207 error
= mapping
->a_ops
->readpage(filp
, page
);
1209 if (unlikely(error
)) {
1210 if (error
== AOP_TRUNCATED_PAGE
) {
1211 page_cache_release(page
);
1214 goto readpage_error
;
1217 if (!PageUptodate(page
)) {
1218 error
= lock_page_killable(page
);
1219 if (unlikely(error
))
1220 goto readpage_error
;
1221 if (!PageUptodate(page
)) {
1222 if (page
->mapping
== NULL
) {
1224 * invalidate_mapping_pages got it
1227 page_cache_release(page
);
1231 shrink_readahead_size_eio(filp
, ra
);
1233 goto readpage_error
;
1241 /* UHHUH! A synchronous read error occurred. Report it */
1242 desc
->error
= error
;
1243 page_cache_release(page
);
1248 * Ok, it wasn't cached, so we need to create a new
1251 page
= page_cache_alloc_cold(mapping
);
1253 desc
->error
= -ENOMEM
;
1256 error
= add_to_page_cache_lru(page
, mapping
,
1259 page_cache_release(page
);
1260 if (error
== -EEXIST
)
1262 desc
->error
= error
;
1269 ra
->prev_pos
= prev_index
;
1270 ra
->prev_pos
<<= PAGE_CACHE_SHIFT
;
1271 ra
->prev_pos
|= prev_offset
;
1273 *ppos
= ((loff_t
)index
<< PAGE_CACHE_SHIFT
) + offset
;
1274 file_accessed(filp
);
1277 int file_read_actor(read_descriptor_t
*desc
, struct page
*page
,
1278 unsigned long offset
, unsigned long size
)
1281 unsigned long left
, count
= desc
->count
;
1287 * Faults on the destination of a read are common, so do it before
1290 if (!fault_in_pages_writeable(desc
->arg
.buf
, size
)) {
1291 kaddr
= kmap_atomic(page
, KM_USER0
);
1292 left
= __copy_to_user_inatomic(desc
->arg
.buf
,
1293 kaddr
+ offset
, size
);
1294 kunmap_atomic(kaddr
, KM_USER0
);
1299 /* Do it the slow way */
1301 left
= __copy_to_user(desc
->arg
.buf
, kaddr
+ offset
, size
);
1306 desc
->error
= -EFAULT
;
1309 desc
->count
= count
- size
;
1310 desc
->written
+= size
;
1311 desc
->arg
.buf
+= size
;
1316 * Performs necessary checks before doing a write
1317 * @iov: io vector request
1318 * @nr_segs: number of segments in the iovec
1319 * @count: number of bytes to write
1320 * @access_flags: type of access: %VERIFY_READ or %VERIFY_WRITE
1322 * Adjust number of segments and amount of bytes to write (nr_segs should be
1323 * properly initialized first). Returns appropriate error code that caller
1324 * should return or zero in case that write should be allowed.
1326 int generic_segment_checks(const struct iovec
*iov
,
1327 unsigned long *nr_segs
, size_t *count
, int access_flags
)
1331 for (seg
= 0; seg
< *nr_segs
; seg
++) {
1332 const struct iovec
*iv
= &iov
[seg
];
1335 * If any segment has a negative length, or the cumulative
1336 * length ever wraps negative then return -EINVAL.
1339 if (unlikely((ssize_t
)(cnt
|iv
->iov_len
) < 0))
1341 if (access_ok(access_flags
, iv
->iov_base
, iv
->iov_len
))
1346 cnt
-= iv
->iov_len
; /* This segment is no good */
1352 EXPORT_SYMBOL(generic_segment_checks
);
1355 * generic_file_aio_read - generic filesystem read routine
1356 * @iocb: kernel I/O control block
1357 * @iov: io vector request
1358 * @nr_segs: number of segments in the iovec
1359 * @pos: current file position
1361 * This is the "read()" routine for all filesystems
1362 * that can use the page cache directly.
1365 generic_file_aio_read(struct kiocb
*iocb
, const struct iovec
*iov
,
1366 unsigned long nr_segs
, loff_t pos
)
1368 struct file
*filp
= iocb
->ki_filp
;
1370 unsigned long seg
= 0;
1372 loff_t
*ppos
= &iocb
->ki_pos
;
1375 retval
= generic_segment_checks(iov
, &nr_segs
, &count
, VERIFY_WRITE
);
1379 /* coalesce the iovecs and go direct-to-BIO for O_DIRECT */
1380 if (filp
->f_flags
& O_DIRECT
) {
1382 struct address_space
*mapping
;
1383 struct inode
*inode
;
1385 mapping
= filp
->f_mapping
;
1386 inode
= mapping
->host
;
1388 goto out
; /* skip atime */
1389 size
= i_size_read(inode
);
1391 retval
= filemap_write_and_wait_range(mapping
, pos
,
1392 pos
+ iov_length(iov
, nr_segs
) - 1);
1394 retval
= mapping
->a_ops
->direct_IO(READ
, iocb
,
1398 *ppos
= pos
+ retval
;
1403 * Btrfs can have a short DIO read if we encounter
1404 * compressed extents, so if there was an error, or if
1405 * we've already read everything we wanted to, or if
1406 * there was a short read because we hit EOF, go ahead
1407 * and return. Otherwise fallthrough to buffered io for
1408 * the rest of the read.
1410 if (retval
< 0 || !count
|| *ppos
>= size
) {
1411 file_accessed(filp
);
1418 for (seg
= 0; seg
< nr_segs
; seg
++) {
1419 read_descriptor_t desc
;
1423 * If we did a short DIO read we need to skip the section of the
1424 * iov that we've already read data into.
1427 if (count
> iov
[seg
].iov_len
) {
1428 count
-= iov
[seg
].iov_len
;
1436 desc
.arg
.buf
= iov
[seg
].iov_base
+ offset
;
1437 desc
.count
= iov
[seg
].iov_len
- offset
;
1438 if (desc
.count
== 0)
1441 do_generic_file_read(filp
, ppos
, &desc
, file_read_actor
);
1442 retval
+= desc
.written
;
1444 retval
= retval
?: desc
.error
;
1453 EXPORT_SYMBOL(generic_file_aio_read
);
1456 do_readahead(struct address_space
*mapping
, struct file
*filp
,
1457 pgoff_t index
, unsigned long nr
)
1459 if (!mapping
|| !mapping
->a_ops
|| !mapping
->a_ops
->readpage
)
1462 force_page_cache_readahead(mapping
, filp
, index
, nr
);
1466 SYSCALL_DEFINE(readahead
)(int fd
, loff_t offset
, size_t count
)
1474 if (file
->f_mode
& FMODE_READ
) {
1475 struct address_space
*mapping
= file
->f_mapping
;
1476 pgoff_t start
= offset
>> PAGE_CACHE_SHIFT
;
1477 pgoff_t end
= (offset
+ count
- 1) >> PAGE_CACHE_SHIFT
;
1478 unsigned long len
= end
- start
+ 1;
1479 ret
= do_readahead(mapping
, file
, start
, len
);
1485 #ifdef CONFIG_HAVE_SYSCALL_WRAPPERS
1486 asmlinkage
long SyS_readahead(long fd
, loff_t offset
, long count
)
1488 return SYSC_readahead((int) fd
, offset
, (size_t) count
);
1490 SYSCALL_ALIAS(sys_readahead
, SyS_readahead
);
1495 * page_cache_read - adds requested page to the page cache if not already there
1496 * @file: file to read
1497 * @offset: page index
1499 * This adds the requested page to the page cache if it isn't already there,
1500 * and schedules an I/O to read in its contents from disk.
1502 static int page_cache_read(struct file
*file
, pgoff_t offset
)
1504 struct address_space
*mapping
= file
->f_mapping
;
1509 page
= page_cache_alloc_cold(mapping
);
1513 ret
= add_to_page_cache_lru(page
, mapping
, offset
, GFP_KERNEL
);
1515 ret
= mapping
->a_ops
->readpage(file
, page
);
1516 else if (ret
== -EEXIST
)
1517 ret
= 0; /* losing race to add is OK */
1519 page_cache_release(page
);
1521 } while (ret
== AOP_TRUNCATED_PAGE
);
1526 #define MMAP_LOTSAMISS (100)
1529 * Synchronous readahead happens when we don't even find
1530 * a page in the page cache at all.
1532 static void do_sync_mmap_readahead(struct vm_area_struct
*vma
,
1533 struct file_ra_state
*ra
,
1537 unsigned long ra_pages
;
1538 struct address_space
*mapping
= file
->f_mapping
;
1540 /* If we don't want any read-ahead, don't bother */
1541 if (VM_RandomReadHint(vma
))
1544 if (VM_SequentialReadHint(vma
) ||
1545 offset
- 1 == (ra
->prev_pos
>> PAGE_CACHE_SHIFT
)) {
1546 page_cache_sync_readahead(mapping
, ra
, file
, offset
,
1551 if (ra
->mmap_miss
< INT_MAX
)
1555 * Do we miss much more than hit in this file? If so,
1556 * stop bothering with read-ahead. It will only hurt.
1558 if (ra
->mmap_miss
> MMAP_LOTSAMISS
)
1564 ra_pages
= max_sane_readahead(ra
->ra_pages
);
1566 ra
->start
= max_t(long, 0, offset
- ra_pages
/2);
1567 ra
->size
= ra_pages
;
1569 ra_submit(ra
, mapping
, file
);
1574 * Asynchronous readahead happens when we find the page and PG_readahead,
1575 * so we want to possibly extend the readahead further..
1577 static void do_async_mmap_readahead(struct vm_area_struct
*vma
,
1578 struct file_ra_state
*ra
,
1583 struct address_space
*mapping
= file
->f_mapping
;
1585 /* If we don't want any read-ahead, don't bother */
1586 if (VM_RandomReadHint(vma
))
1588 if (ra
->mmap_miss
> 0)
1590 if (PageReadahead(page
))
1591 page_cache_async_readahead(mapping
, ra
, file
,
1592 page
, offset
, ra
->ra_pages
);
1596 * filemap_fault - read in file data for page fault handling
1597 * @vma: vma in which the fault was taken
1598 * @vmf: struct vm_fault containing details of the fault
1600 * filemap_fault() is invoked via the vma operations vector for a
1601 * mapped memory region to read in file data during a page fault.
1603 * The goto's are kind of ugly, but this streamlines the normal case of having
1604 * it in the page cache, and handles the special cases reasonably without
1605 * having a lot of duplicated code.
1607 int filemap_fault(struct vm_area_struct
*vma
, struct vm_fault
*vmf
)
1610 struct file
*file
= vma
->vm_file
;
1611 struct address_space
*mapping
= file
->f_mapping
;
1612 struct file_ra_state
*ra
= &file
->f_ra
;
1613 struct inode
*inode
= mapping
->host
;
1614 pgoff_t offset
= vmf
->pgoff
;
1619 size
= (i_size_read(inode
) + PAGE_CACHE_SIZE
- 1) >> PAGE_CACHE_SHIFT
;
1621 return VM_FAULT_SIGBUS
;
1624 * Do we have something in the page cache already?
1626 page
= find_get_page(mapping
, offset
);
1629 * We found the page, so try async readahead before
1630 * waiting for the lock.
1632 do_async_mmap_readahead(vma
, ra
, file
, page
, offset
);
1634 /* No page in the page cache at all */
1635 do_sync_mmap_readahead(vma
, ra
, file
, offset
);
1636 count_vm_event(PGMAJFAULT
);
1637 ret
= VM_FAULT_MAJOR
;
1639 page
= find_get_page(mapping
, offset
);
1641 goto no_cached_page
;
1644 if (!lock_page_or_retry(page
, vma
->vm_mm
, vmf
->flags
)) {
1645 page_cache_release(page
);
1646 return ret
| VM_FAULT_RETRY
;
1649 /* Did it get truncated? */
1650 if (unlikely(page
->mapping
!= mapping
)) {
1655 VM_BUG_ON(page
->index
!= offset
);
1658 * We have a locked page in the page cache, now we need to check
1659 * that it's up-to-date. If not, it is going to be due to an error.
1661 if (unlikely(!PageUptodate(page
)))
1662 goto page_not_uptodate
;
1665 * Found the page and have a reference on it.
1666 * We must recheck i_size under page lock.
1668 size
= (i_size_read(inode
) + PAGE_CACHE_SIZE
- 1) >> PAGE_CACHE_SHIFT
;
1669 if (unlikely(offset
>= size
)) {
1671 page_cache_release(page
);
1672 return VM_FAULT_SIGBUS
;
1675 ra
->prev_pos
= (loff_t
)offset
<< PAGE_CACHE_SHIFT
;
1677 return ret
| VM_FAULT_LOCKED
;
1681 * We're only likely to ever get here if MADV_RANDOM is in
1684 error
= page_cache_read(file
, offset
);
1687 * The page we want has now been added to the page cache.
1688 * In the unlikely event that someone removed it in the
1689 * meantime, we'll just come back here and read it again.
1695 * An error return from page_cache_read can result if the
1696 * system is low on memory, or a problem occurs while trying
1699 if (error
== -ENOMEM
)
1700 return VM_FAULT_OOM
;
1701 return VM_FAULT_SIGBUS
;
1705 * Umm, take care of errors if the page isn't up-to-date.
1706 * Try to re-read it _once_. We do this synchronously,
1707 * because there really aren't any performance issues here
1708 * and we need to check for errors.
1710 ClearPageError(page
);
1711 error
= mapping
->a_ops
->readpage(file
, page
);
1713 wait_on_page_locked(page
);
1714 if (!PageUptodate(page
))
1717 page_cache_release(page
);
1719 if (!error
|| error
== AOP_TRUNCATED_PAGE
)
1722 /* Things didn't work out. Return zero to tell the mm layer so. */
1723 shrink_readahead_size_eio(file
, ra
);
1724 return VM_FAULT_SIGBUS
;
1726 EXPORT_SYMBOL(filemap_fault
);
1728 const struct vm_operations_struct generic_file_vm_ops
= {
1729 .fault
= filemap_fault
,
1732 /* This is used for a general mmap of a disk file */
1734 int generic_file_mmap(struct file
* file
, struct vm_area_struct
* vma
)
1736 struct address_space
*mapping
= file
->f_mapping
;
1738 if (!mapping
->a_ops
->readpage
)
1740 file_accessed(file
);
1741 vma
->vm_ops
= &generic_file_vm_ops
;
1742 vma
->vm_flags
|= VM_CAN_NONLINEAR
;
1747 * This is for filesystems which do not implement ->writepage.
1749 int generic_file_readonly_mmap(struct file
*file
, struct vm_area_struct
*vma
)
1751 if ((vma
->vm_flags
& VM_SHARED
) && (vma
->vm_flags
& VM_MAYWRITE
))
1753 return generic_file_mmap(file
, vma
);
1756 int generic_file_mmap(struct file
* file
, struct vm_area_struct
* vma
)
1760 int generic_file_readonly_mmap(struct file
* file
, struct vm_area_struct
* vma
)
1764 #endif /* CONFIG_MMU */
1766 EXPORT_SYMBOL(generic_file_mmap
);
1767 EXPORT_SYMBOL(generic_file_readonly_mmap
);
1769 static struct page
*__read_cache_page(struct address_space
*mapping
,
1771 int (*filler
)(void *,struct page
*),
1778 page
= find_get_page(mapping
, index
);
1780 page
= __page_cache_alloc(gfp
| __GFP_COLD
);
1782 return ERR_PTR(-ENOMEM
);
1783 err
= add_to_page_cache_lru(page
, mapping
, index
, GFP_KERNEL
);
1784 if (unlikely(err
)) {
1785 page_cache_release(page
);
1788 /* Presumably ENOMEM for radix tree node */
1789 return ERR_PTR(err
);
1791 err
= filler(data
, page
);
1793 page_cache_release(page
);
1794 page
= ERR_PTR(err
);
1800 static struct page
*do_read_cache_page(struct address_space
*mapping
,
1802 int (*filler
)(void *,struct page
*),
1811 page
= __read_cache_page(mapping
, index
, filler
, data
, gfp
);
1814 if (PageUptodate(page
))
1818 if (!page
->mapping
) {
1820 page_cache_release(page
);
1823 if (PageUptodate(page
)) {
1827 err
= filler(data
, page
);
1829 page_cache_release(page
);
1830 return ERR_PTR(err
);
1833 mark_page_accessed(page
);
1838 * read_cache_page_async - read into page cache, fill it if needed
1839 * @mapping: the page's address_space
1840 * @index: the page index
1841 * @filler: function to perform the read
1842 * @data: destination for read data
1844 * Same as read_cache_page, but don't wait for page to become unlocked
1845 * after submitting it to the filler.
1847 * Read into the page cache. If a page already exists, and PageUptodate() is
1848 * not set, try to fill the page but don't wait for it to become unlocked.
1850 * If the page does not get brought uptodate, return -EIO.
1852 struct page
*read_cache_page_async(struct address_space
*mapping
,
1854 int (*filler
)(void *,struct page
*),
1857 return do_read_cache_page(mapping
, index
, filler
, data
, mapping_gfp_mask(mapping
));
1859 EXPORT_SYMBOL(read_cache_page_async
);
1861 static struct page
*wait_on_page_read(struct page
*page
)
1863 if (!IS_ERR(page
)) {
1864 wait_on_page_locked(page
);
1865 if (!PageUptodate(page
)) {
1866 page_cache_release(page
);
1867 page
= ERR_PTR(-EIO
);
1874 * read_cache_page_gfp - read into page cache, using specified page allocation flags.
1875 * @mapping: the page's address_space
1876 * @index: the page index
1877 * @gfp: the page allocator flags to use if allocating
1879 * This is the same as "read_mapping_page(mapping, index, NULL)", but with
1880 * any new page allocations done using the specified allocation flags. Note
1881 * that the Radix tree operations will still use GFP_KERNEL, so you can't
1882 * expect to do this atomically or anything like that - but you can pass in
1883 * other page requirements.
1885 * If the page does not get brought uptodate, return -EIO.
1887 struct page
*read_cache_page_gfp(struct address_space
*mapping
,
1891 filler_t
*filler
= (filler_t
*)mapping
->a_ops
->readpage
;
1893 return wait_on_page_read(do_read_cache_page(mapping
, index
, filler
, NULL
, gfp
));
1895 EXPORT_SYMBOL(read_cache_page_gfp
);
1898 * read_cache_page - read into page cache, fill it if needed
1899 * @mapping: the page's address_space
1900 * @index: the page index
1901 * @filler: function to perform the read
1902 * @data: destination for read data
1904 * Read into the page cache. If a page already exists, and PageUptodate() is
1905 * not set, try to fill the page then wait for it to become unlocked.
1907 * If the page does not get brought uptodate, return -EIO.
1909 struct page
*read_cache_page(struct address_space
*mapping
,
1911 int (*filler
)(void *,struct page
*),
1914 return wait_on_page_read(read_cache_page_async(mapping
, index
, filler
, data
));
1916 EXPORT_SYMBOL(read_cache_page
);
1919 * The logic we want is
1921 * if suid or (sgid and xgrp)
1924 int should_remove_suid(struct dentry
*dentry
)
1926 mode_t mode
= dentry
->d_inode
->i_mode
;
1929 /* suid always must be killed */
1930 if (unlikely(mode
& S_ISUID
))
1931 kill
= ATTR_KILL_SUID
;
1934 * sgid without any exec bits is just a mandatory locking mark; leave
1935 * it alone. If some exec bits are set, it's a real sgid; kill it.
1937 if (unlikely((mode
& S_ISGID
) && (mode
& S_IXGRP
)))
1938 kill
|= ATTR_KILL_SGID
;
1940 if (unlikely(kill
&& !capable(CAP_FSETID
) && S_ISREG(mode
)))
1945 EXPORT_SYMBOL(should_remove_suid
);
1947 static int __remove_suid(struct dentry
*dentry
, int kill
)
1949 struct iattr newattrs
;
1951 newattrs
.ia_valid
= ATTR_FORCE
| kill
;
1952 return notify_change(dentry
, &newattrs
);
1955 int file_remove_suid(struct file
*file
)
1957 struct dentry
*dentry
= file
->f_path
.dentry
;
1958 int killsuid
= should_remove_suid(dentry
);
1959 int killpriv
= security_inode_need_killpriv(dentry
);
1965 error
= security_inode_killpriv(dentry
);
1966 if (!error
&& killsuid
)
1967 error
= __remove_suid(dentry
, killsuid
);
1971 EXPORT_SYMBOL(file_remove_suid
);
1973 static size_t __iovec_copy_from_user_inatomic(char *vaddr
,
1974 const struct iovec
*iov
, size_t base
, size_t bytes
)
1976 size_t copied
= 0, left
= 0;
1979 char __user
*buf
= iov
->iov_base
+ base
;
1980 int copy
= min(bytes
, iov
->iov_len
- base
);
1983 left
= __copy_from_user_inatomic(vaddr
, buf
, copy
);
1992 return copied
- left
;
1996 * Copy as much as we can into the page and return the number of bytes which
1997 * were successfully copied. If a fault is encountered then return the number of
1998 * bytes which were copied.
2000 size_t iov_iter_copy_from_user_atomic(struct page
*page
,
2001 struct iov_iter
*i
, unsigned long offset
, size_t bytes
)
2006 BUG_ON(!in_atomic());
2007 kaddr
= kmap_atomic(page
, KM_USER0
);
2008 if (likely(i
->nr_segs
== 1)) {
2010 char __user
*buf
= i
->iov
->iov_base
+ i
->iov_offset
;
2011 left
= __copy_from_user_inatomic(kaddr
+ offset
, buf
, bytes
);
2012 copied
= bytes
- left
;
2014 copied
= __iovec_copy_from_user_inatomic(kaddr
+ offset
,
2015 i
->iov
, i
->iov_offset
, bytes
);
2017 kunmap_atomic(kaddr
, KM_USER0
);
2021 EXPORT_SYMBOL(iov_iter_copy_from_user_atomic
);
2024 * This has the same sideeffects and return value as
2025 * iov_iter_copy_from_user_atomic().
2026 * The difference is that it attempts to resolve faults.
2027 * Page must not be locked.
2029 size_t iov_iter_copy_from_user(struct page
*page
,
2030 struct iov_iter
*i
, unsigned long offset
, size_t bytes
)
2036 if (likely(i
->nr_segs
== 1)) {
2038 char __user
*buf
= i
->iov
->iov_base
+ i
->iov_offset
;
2039 left
= __copy_from_user(kaddr
+ offset
, buf
, bytes
);
2040 copied
= bytes
- left
;
2042 copied
= __iovec_copy_from_user_inatomic(kaddr
+ offset
,
2043 i
->iov
, i
->iov_offset
, bytes
);
2048 EXPORT_SYMBOL(iov_iter_copy_from_user
);
2050 void iov_iter_advance(struct iov_iter
*i
, size_t bytes
)
2052 BUG_ON(i
->count
< bytes
);
2054 if (likely(i
->nr_segs
== 1)) {
2055 i
->iov_offset
+= bytes
;
2058 const struct iovec
*iov
= i
->iov
;
2059 size_t base
= i
->iov_offset
;
2062 * The !iov->iov_len check ensures we skip over unlikely
2063 * zero-length segments (without overruning the iovec).
2065 while (bytes
|| unlikely(i
->count
&& !iov
->iov_len
)) {
2068 copy
= min(bytes
, iov
->iov_len
- base
);
2069 BUG_ON(!i
->count
|| i
->count
< copy
);
2073 if (iov
->iov_len
== base
) {
2079 i
->iov_offset
= base
;
2082 EXPORT_SYMBOL(iov_iter_advance
);
2085 * Fault in the first iovec of the given iov_iter, to a maximum length
2086 * of bytes. Returns 0 on success, or non-zero if the memory could not be
2087 * accessed (ie. because it is an invalid address).
2089 * writev-intensive code may want this to prefault several iovecs -- that
2090 * would be possible (callers must not rely on the fact that _only_ the
2091 * first iovec will be faulted with the current implementation).
2093 int iov_iter_fault_in_readable(struct iov_iter
*i
, size_t bytes
)
2095 char __user
*buf
= i
->iov
->iov_base
+ i
->iov_offset
;
2096 bytes
= min(bytes
, i
->iov
->iov_len
- i
->iov_offset
);
2097 return fault_in_pages_readable(buf
, bytes
);
2099 EXPORT_SYMBOL(iov_iter_fault_in_readable
);
2102 * Return the count of just the current iov_iter segment.
2104 size_t iov_iter_single_seg_count(struct iov_iter
*i
)
2106 const struct iovec
*iov
= i
->iov
;
2107 if (i
->nr_segs
== 1)
2110 return min(i
->count
, iov
->iov_len
- i
->iov_offset
);
2112 EXPORT_SYMBOL(iov_iter_single_seg_count
);
2115 * Performs necessary checks before doing a write
2117 * Can adjust writing position or amount of bytes to write.
2118 * Returns appropriate error code that caller should return or
2119 * zero in case that write should be allowed.
2121 inline int generic_write_checks(struct file
*file
, loff_t
*pos
, size_t *count
, int isblk
)
2123 struct inode
*inode
= file
->f_mapping
->host
;
2124 unsigned long limit
= rlimit(RLIMIT_FSIZE
);
2126 if (unlikely(*pos
< 0))
2130 /* FIXME: this is for backwards compatibility with 2.4 */
2131 if (file
->f_flags
& O_APPEND
)
2132 *pos
= i_size_read(inode
);
2134 if (limit
!= RLIM_INFINITY
) {
2135 if (*pos
>= limit
) {
2136 send_sig(SIGXFSZ
, current
, 0);
2139 if (*count
> limit
- (typeof(limit
))*pos
) {
2140 *count
= limit
- (typeof(limit
))*pos
;
2148 if (unlikely(*pos
+ *count
> MAX_NON_LFS
&&
2149 !(file
->f_flags
& O_LARGEFILE
))) {
2150 if (*pos
>= MAX_NON_LFS
) {
2153 if (*count
> MAX_NON_LFS
- (unsigned long)*pos
) {
2154 *count
= MAX_NON_LFS
- (unsigned long)*pos
;
2159 * Are we about to exceed the fs block limit ?
2161 * If we have written data it becomes a short write. If we have
2162 * exceeded without writing data we send a signal and return EFBIG.
2163 * Linus frestrict idea will clean these up nicely..
2165 if (likely(!isblk
)) {
2166 if (unlikely(*pos
>= inode
->i_sb
->s_maxbytes
)) {
2167 if (*count
|| *pos
> inode
->i_sb
->s_maxbytes
) {
2170 /* zero-length writes at ->s_maxbytes are OK */
2173 if (unlikely(*pos
+ *count
> inode
->i_sb
->s_maxbytes
))
2174 *count
= inode
->i_sb
->s_maxbytes
- *pos
;
2178 if (bdev_read_only(I_BDEV(inode
)))
2180 isize
= i_size_read(inode
);
2181 if (*pos
>= isize
) {
2182 if (*count
|| *pos
> isize
)
2186 if (*pos
+ *count
> isize
)
2187 *count
= isize
- *pos
;
2194 EXPORT_SYMBOL(generic_write_checks
);
2196 int pagecache_write_begin(struct file
*file
, struct address_space
*mapping
,
2197 loff_t pos
, unsigned len
, unsigned flags
,
2198 struct page
**pagep
, void **fsdata
)
2200 const struct address_space_operations
*aops
= mapping
->a_ops
;
2202 return aops
->write_begin(file
, mapping
, pos
, len
, flags
,
2205 EXPORT_SYMBOL(pagecache_write_begin
);
2207 int pagecache_write_end(struct file
*file
, struct address_space
*mapping
,
2208 loff_t pos
, unsigned len
, unsigned copied
,
2209 struct page
*page
, void *fsdata
)
2211 const struct address_space_operations
*aops
= mapping
->a_ops
;
2213 mark_page_accessed(page
);
2214 return aops
->write_end(file
, mapping
, pos
, len
, copied
, page
, fsdata
);
2216 EXPORT_SYMBOL(pagecache_write_end
);
2219 generic_file_direct_write(struct kiocb
*iocb
, const struct iovec
*iov
,
2220 unsigned long *nr_segs
, loff_t pos
, loff_t
*ppos
,
2221 size_t count
, size_t ocount
)
2223 struct file
*file
= iocb
->ki_filp
;
2224 struct address_space
*mapping
= file
->f_mapping
;
2225 struct inode
*inode
= mapping
->host
;
2230 if (count
!= ocount
)
2231 *nr_segs
= iov_shorten((struct iovec
*)iov
, *nr_segs
, count
);
2233 write_len
= iov_length(iov
, *nr_segs
);
2234 end
= (pos
+ write_len
- 1) >> PAGE_CACHE_SHIFT
;
2236 written
= filemap_write_and_wait_range(mapping
, pos
, pos
+ write_len
- 1);
2241 * After a write we want buffered reads to be sure to go to disk to get
2242 * the new data. We invalidate clean cached page from the region we're
2243 * about to write. We do this *before* the write so that we can return
2244 * without clobbering -EIOCBQUEUED from ->direct_IO().
2246 if (mapping
->nrpages
) {
2247 written
= invalidate_inode_pages2_range(mapping
,
2248 pos
>> PAGE_CACHE_SHIFT
, end
);
2250 * If a page can not be invalidated, return 0 to fall back
2251 * to buffered write.
2254 if (written
== -EBUSY
)
2260 written
= mapping
->a_ops
->direct_IO(WRITE
, iocb
, iov
, pos
, *nr_segs
);
2263 * Finally, try again to invalidate clean pages which might have been
2264 * cached by non-direct readahead, or faulted in by get_user_pages()
2265 * if the source of the write was an mmap'ed region of the file
2266 * we're writing. Either one is a pretty crazy thing to do,
2267 * so we don't support it 100%. If this invalidation
2268 * fails, tough, the write still worked...
2270 if (mapping
->nrpages
) {
2271 invalidate_inode_pages2_range(mapping
,
2272 pos
>> PAGE_CACHE_SHIFT
, end
);
2277 if (pos
> i_size_read(inode
) && !S_ISBLK(inode
->i_mode
)) {
2278 i_size_write(inode
, pos
);
2279 mark_inode_dirty(inode
);
2286 EXPORT_SYMBOL(generic_file_direct_write
);
2289 * Find or create a page at the given pagecache position. Return the locked
2290 * page. This function is specifically for buffered writes.
2292 struct page
*grab_cache_page_write_begin(struct address_space
*mapping
,
2293 pgoff_t index
, unsigned flags
)
2297 gfp_t gfp_notmask
= 0;
2298 if (flags
& AOP_FLAG_NOFS
)
2299 gfp_notmask
= __GFP_FS
;
2301 page
= find_lock_page(mapping
, index
);
2305 page
= __page_cache_alloc(mapping_gfp_mask(mapping
) & ~gfp_notmask
);
2308 status
= add_to_page_cache_lru(page
, mapping
, index
,
2309 GFP_KERNEL
& ~gfp_notmask
);
2310 if (unlikely(status
)) {
2311 page_cache_release(page
);
2312 if (status
== -EEXIST
)
2318 EXPORT_SYMBOL(grab_cache_page_write_begin
);
2320 static ssize_t
generic_perform_write(struct file
*file
,
2321 struct iov_iter
*i
, loff_t pos
)
2323 struct address_space
*mapping
= file
->f_mapping
;
2324 const struct address_space_operations
*a_ops
= mapping
->a_ops
;
2326 ssize_t written
= 0;
2327 unsigned int flags
= 0;
2330 * Copies from kernel address space cannot fail (NFSD is a big user).
2332 if (segment_eq(get_fs(), KERNEL_DS
))
2333 flags
|= AOP_FLAG_UNINTERRUPTIBLE
;
2337 unsigned long offset
; /* Offset into pagecache page */
2338 unsigned long bytes
; /* Bytes to write to page */
2339 size_t copied
; /* Bytes copied from user */
2342 offset
= (pos
& (PAGE_CACHE_SIZE
- 1));
2343 bytes
= min_t(unsigned long, PAGE_CACHE_SIZE
- offset
,
2349 * Bring in the user page that we will copy from _first_.
2350 * Otherwise there's a nasty deadlock on copying from the
2351 * same page as we're writing to, without it being marked
2354 * Not only is this an optimisation, but it is also required
2355 * to check that the address is actually valid, when atomic
2356 * usercopies are used, below.
2358 if (unlikely(iov_iter_fault_in_readable(i
, bytes
))) {
2363 status
= a_ops
->write_begin(file
, mapping
, pos
, bytes
, flags
,
2365 if (unlikely(status
))
2368 if (mapping_writably_mapped(mapping
))
2369 flush_dcache_page(page
);
2371 pagefault_disable();
2372 copied
= iov_iter_copy_from_user_atomic(page
, i
, offset
, bytes
);
2374 flush_dcache_page(page
);
2376 mark_page_accessed(page
);
2377 status
= a_ops
->write_end(file
, mapping
, pos
, bytes
, copied
,
2379 if (unlikely(status
< 0))
2385 iov_iter_advance(i
, copied
);
2386 if (unlikely(copied
== 0)) {
2388 * If we were unable to copy any data at all, we must
2389 * fall back to a single segment length write.
2391 * If we didn't fallback here, we could livelock
2392 * because not all segments in the iov can be copied at
2393 * once without a pagefault.
2395 bytes
= min_t(unsigned long, PAGE_CACHE_SIZE
- offset
,
2396 iov_iter_single_seg_count(i
));
2402 balance_dirty_pages_ratelimited(mapping
);
2404 } while (iov_iter_count(i
));
2406 return written
? written
: status
;
2410 generic_file_buffered_write(struct kiocb
*iocb
, const struct iovec
*iov
,
2411 unsigned long nr_segs
, loff_t pos
, loff_t
*ppos
,
2412 size_t count
, ssize_t written
)
2414 struct file
*file
= iocb
->ki_filp
;
2418 iov_iter_init(&i
, iov
, nr_segs
, count
, written
);
2419 status
= generic_perform_write(file
, &i
, pos
);
2421 if (likely(status
>= 0)) {
2423 *ppos
= pos
+ status
;
2426 return written
? written
: status
;
2428 EXPORT_SYMBOL(generic_file_buffered_write
);
2431 * __generic_file_aio_write - write data to a file
2432 * @iocb: IO state structure (file, offset, etc.)
2433 * @iov: vector with data to write
2434 * @nr_segs: number of segments in the vector
2435 * @ppos: position where to write
2437 * This function does all the work needed for actually writing data to a
2438 * file. It does all basic checks, removes SUID from the file, updates
2439 * modification times and calls proper subroutines depending on whether we
2440 * do direct IO or a standard buffered write.
2442 * It expects i_mutex to be grabbed unless we work on a block device or similar
2443 * object which does not need locking at all.
2445 * This function does *not* take care of syncing data in case of O_SYNC write.
2446 * A caller has to handle it. This is mainly due to the fact that we want to
2447 * avoid syncing under i_mutex.
2449 ssize_t
__generic_file_aio_write(struct kiocb
*iocb
, const struct iovec
*iov
,
2450 unsigned long nr_segs
, loff_t
*ppos
)
2452 struct file
*file
= iocb
->ki_filp
;
2453 struct address_space
* mapping
= file
->f_mapping
;
2454 size_t ocount
; /* original count */
2455 size_t count
; /* after file limit checks */
2456 struct inode
*inode
= mapping
->host
;
2462 err
= generic_segment_checks(iov
, &nr_segs
, &ocount
, VERIFY_READ
);
2469 vfs_check_frozen(inode
->i_sb
, SB_FREEZE_WRITE
);
2471 /* We can write back this queue in page reclaim */
2472 current
->backing_dev_info
= mapping
->backing_dev_info
;
2475 err
= generic_write_checks(file
, &pos
, &count
, S_ISBLK(inode
->i_mode
));
2482 err
= file_remove_suid(file
);
2486 file_update_time(file
);
2488 /* coalesce the iovecs and go direct-to-BIO for O_DIRECT */
2489 if (unlikely(file
->f_flags
& O_DIRECT
)) {
2491 ssize_t written_buffered
;
2493 written
= generic_file_direct_write(iocb
, iov
, &nr_segs
, pos
,
2494 ppos
, count
, ocount
);
2495 if (written
< 0 || written
== count
)
2498 * direct-io write to a hole: fall through to buffered I/O
2499 * for completing the rest of the request.
2503 written_buffered
= generic_file_buffered_write(iocb
, iov
,
2504 nr_segs
, pos
, ppos
, count
,
2507 * If generic_file_buffered_write() retuned a synchronous error
2508 * then we want to return the number of bytes which were
2509 * direct-written, or the error code if that was zero. Note
2510 * that this differs from normal direct-io semantics, which
2511 * will return -EFOO even if some bytes were written.
2513 if (written_buffered
< 0) {
2514 err
= written_buffered
;
2519 * We need to ensure that the page cache pages are written to
2520 * disk and invalidated to preserve the expected O_DIRECT
2523 endbyte
= pos
+ written_buffered
- written
- 1;
2524 err
= filemap_write_and_wait_range(file
->f_mapping
, pos
, endbyte
);
2526 written
= written_buffered
;
2527 invalidate_mapping_pages(mapping
,
2528 pos
>> PAGE_CACHE_SHIFT
,
2529 endbyte
>> PAGE_CACHE_SHIFT
);
2532 * We don't know how much we wrote, so just return
2533 * the number of bytes which were direct-written
2537 written
= generic_file_buffered_write(iocb
, iov
, nr_segs
,
2538 pos
, ppos
, count
, written
);
2541 current
->backing_dev_info
= NULL
;
2542 return written
? written
: err
;
2544 EXPORT_SYMBOL(__generic_file_aio_write
);
2547 * generic_file_aio_write - write data to a file
2548 * @iocb: IO state structure
2549 * @iov: vector with data to write
2550 * @nr_segs: number of segments in the vector
2551 * @pos: position in file where to write
2553 * This is a wrapper around __generic_file_aio_write() to be used by most
2554 * filesystems. It takes care of syncing the file in case of O_SYNC file
2555 * and acquires i_mutex as needed.
2557 ssize_t
generic_file_aio_write(struct kiocb
*iocb
, const struct iovec
*iov
,
2558 unsigned long nr_segs
, loff_t pos
)
2560 struct file
*file
= iocb
->ki_filp
;
2561 struct inode
*inode
= file
->f_mapping
->host
;
2564 BUG_ON(iocb
->ki_pos
!= pos
);
2566 mutex_lock(&inode
->i_mutex
);
2567 ret
= __generic_file_aio_write(iocb
, iov
, nr_segs
, &iocb
->ki_pos
);
2568 mutex_unlock(&inode
->i_mutex
);
2570 if (ret
> 0 || ret
== -EIOCBQUEUED
) {
2573 err
= generic_write_sync(file
, pos
, ret
);
2574 if (err
< 0 && ret
> 0)
2579 EXPORT_SYMBOL(generic_file_aio_write
);
2582 * try_to_release_page() - release old fs-specific metadata on a page
2584 * @page: the page which the kernel is trying to free
2585 * @gfp_mask: memory allocation flags (and I/O mode)
2587 * The address_space is to try to release any data against the page
2588 * (presumably at page->private). If the release was successful, return `1'.
2589 * Otherwise return zero.
2591 * This may also be called if PG_fscache is set on a page, indicating that the
2592 * page is known to the local caching routines.
2594 * The @gfp_mask argument specifies whether I/O may be performed to release
2595 * this page (__GFP_IO), and whether the call may block (__GFP_WAIT & __GFP_FS).
2598 int try_to_release_page(struct page
*page
, gfp_t gfp_mask
)
2600 struct address_space
* const mapping
= page
->mapping
;
2602 BUG_ON(!PageLocked(page
));
2603 if (PageWriteback(page
))
2606 if (mapping
&& mapping
->a_ops
->releasepage
)
2607 return mapping
->a_ops
->releasepage(page
, gfp_mask
);
2608 return try_to_free_buffers(page
);
2611 EXPORT_SYMBOL(try_to_release_page
);