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/slab.h>
14 #include <linux/compiler.h>
16 #include <linux/uaccess.h>
17 #include <linux/aio.h>
18 #include <linux/capability.h>
19 #include <linux/kernel_stat.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/pagevec.h>
29 #include <linux/blkdev.h>
30 #include <linux/security.h>
31 #include <linux/syscalls.h>
32 #include <linux/cpuset.h>
37 * FIXME: remove all knowledge of the buffer layer from the core VM
39 #include <linux/buffer_head.h> /* for generic_osync_inode */
44 generic_file_direct_IO(int rw
, struct kiocb
*iocb
, const struct iovec
*iov
,
45 loff_t offset
, unsigned long nr_segs
);
48 * Shared mappings implemented 30.11.1994. It's not fully working yet,
51 * Shared mappings now work. 15.8.1995 Bruno.
53 * finished 'unifying' the page and buffer cache and SMP-threaded the
54 * page-cache, 21.05.1999, Ingo Molnar <mingo@redhat.com>
56 * SMP-threaded pagemap-LRU 1999, Andrea Arcangeli <andrea@suse.de>
62 * ->i_mmap_lock (vmtruncate)
63 * ->private_lock (__free_pte->__set_page_dirty_buffers)
64 * ->swap_lock (exclusive_swap_page, others)
65 * ->mapping->tree_lock
68 * ->i_mmap_lock (truncate->unmap_mapping_range)
72 * ->page_table_lock or pte_lock (various, mainly in memory.c)
73 * ->mapping->tree_lock (arch-dependent flush_dcache_mmap_lock)
76 * ->lock_page (access_process_vm)
78 * ->i_mutex (generic_file_buffered_write)
79 * ->mmap_sem (fault_in_pages_readable->do_page_fault)
82 * ->i_alloc_sem (various)
85 * ->sb_lock (fs/fs-writeback.c)
86 * ->mapping->tree_lock (__sync_single_inode)
89 * ->anon_vma.lock (vma_adjust)
92 * ->page_table_lock or pte_lock (anon_vma_prepare and various)
94 * ->page_table_lock or pte_lock
95 * ->swap_lock (try_to_unmap_one)
96 * ->private_lock (try_to_unmap_one)
97 * ->tree_lock (try_to_unmap_one)
98 * ->zone.lru_lock (follow_page->mark_page_accessed)
99 * ->zone.lru_lock (check_pte_range->isolate_lru_page)
100 * ->private_lock (page_remove_rmap->set_page_dirty)
101 * ->tree_lock (page_remove_rmap->set_page_dirty)
102 * ->inode_lock (page_remove_rmap->set_page_dirty)
103 * ->inode_lock (zap_pte_range->set_page_dirty)
104 * ->private_lock (zap_pte_range->__set_page_dirty_buffers)
107 * ->dcache_lock (proc_pid_lookup)
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 a write_lock on 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 BUG_ON(page_mapped(page
));
126 void remove_from_page_cache(struct page
*page
)
128 struct address_space
*mapping
= page
->mapping
;
130 BUG_ON(!PageLocked(page
));
132 write_lock_irq(&mapping
->tree_lock
);
133 __remove_from_page_cache(page
);
134 write_unlock_irq(&mapping
->tree_lock
);
137 static int sync_page(void *word
)
139 struct address_space
*mapping
;
142 page
= container_of((unsigned long *)word
, struct page
, flags
);
145 * page_mapping() is being called without PG_locked held.
146 * Some knowledge of the state and use of the page is used to
147 * reduce the requirements down to a memory barrier.
148 * The danger here is of a stale page_mapping() return value
149 * indicating a struct address_space different from the one it's
150 * associated with when it is associated with one.
151 * After smp_mb(), it's either the correct page_mapping() for
152 * the page, or an old page_mapping() and the page's own
153 * page_mapping() has gone NULL.
154 * The ->sync_page() address_space operation must tolerate
155 * page_mapping() going NULL. By an amazing coincidence,
156 * this comes about because none of the users of the page
157 * in the ->sync_page() methods make essential use of the
158 * page_mapping(), merely passing the page down to the backing
159 * device's unplug functions when it's non-NULL, which in turn
160 * ignore it for all cases but swap, where only page_private(page) is
161 * of interest. When page_mapping() does go NULL, the entire
162 * call stack gracefully ignores the page and returns.
166 mapping
= page_mapping(page
);
167 if (mapping
&& mapping
->a_ops
&& mapping
->a_ops
->sync_page
)
168 mapping
->a_ops
->sync_page(page
);
174 * __filemap_fdatawrite_range - start writeback on mapping dirty pages in range
175 * @mapping: address space structure to write
176 * @start: offset in bytes where the range starts
177 * @end: offset in bytes where the range ends (inclusive)
178 * @sync_mode: enable synchronous operation
180 * Start writeback against all of a mapping's dirty pages that lie
181 * within the byte offsets <start, end> inclusive.
183 * If sync_mode is WB_SYNC_ALL then this is a "data integrity" operation, as
184 * opposed to a regular memory cleansing writeback. The difference between
185 * these two operations is that if a dirty page/buffer is encountered, it must
186 * be waited upon, and not just skipped over.
188 int __filemap_fdatawrite_range(struct address_space
*mapping
, loff_t start
,
189 loff_t end
, int sync_mode
)
192 struct writeback_control wbc
= {
193 .sync_mode
= sync_mode
,
194 .nr_to_write
= mapping
->nrpages
* 2,
195 .range_start
= start
,
199 if (!mapping_cap_writeback_dirty(mapping
))
202 ret
= do_writepages(mapping
, &wbc
);
206 static inline int __filemap_fdatawrite(struct address_space
*mapping
,
209 return __filemap_fdatawrite_range(mapping
, 0, LLONG_MAX
, sync_mode
);
212 int filemap_fdatawrite(struct address_space
*mapping
)
214 return __filemap_fdatawrite(mapping
, WB_SYNC_ALL
);
216 EXPORT_SYMBOL(filemap_fdatawrite
);
218 static int filemap_fdatawrite_range(struct address_space
*mapping
, loff_t start
,
221 return __filemap_fdatawrite_range(mapping
, start
, end
, WB_SYNC_ALL
);
225 * filemap_flush - mostly a non-blocking flush
226 * @mapping: target address_space
228 * This is a mostly non-blocking flush. Not suitable for data-integrity
229 * purposes - I/O may not be started against all dirty pages.
231 int filemap_flush(struct address_space
*mapping
)
233 return __filemap_fdatawrite(mapping
, WB_SYNC_NONE
);
235 EXPORT_SYMBOL(filemap_flush
);
238 * wait_on_page_writeback_range - wait for writeback to complete
239 * @mapping: target address_space
240 * @start: beginning page index
241 * @end: ending page index
243 * Wait for writeback to complete against pages indexed by start->end
246 int wait_on_page_writeback_range(struct address_space
*mapping
,
247 pgoff_t start
, pgoff_t end
)
257 pagevec_init(&pvec
, 0);
259 while ((index
<= end
) &&
260 (nr_pages
= pagevec_lookup_tag(&pvec
, mapping
, &index
,
261 PAGECACHE_TAG_WRITEBACK
,
262 min(end
- index
, (pgoff_t
)PAGEVEC_SIZE
-1) + 1)) != 0) {
265 for (i
= 0; i
< nr_pages
; i
++) {
266 struct page
*page
= pvec
.pages
[i
];
268 /* until radix tree lookup accepts end_index */
269 if (page
->index
> end
)
272 wait_on_page_writeback(page
);
276 pagevec_release(&pvec
);
280 /* Check for outstanding write errors */
281 if (test_and_clear_bit(AS_ENOSPC
, &mapping
->flags
))
283 if (test_and_clear_bit(AS_EIO
, &mapping
->flags
))
290 * sync_page_range - write and wait on all pages in the passed range
291 * @inode: target inode
292 * @mapping: target address_space
293 * @pos: beginning offset in pages to write
294 * @count: number of bytes to write
296 * Write and wait upon all the pages in the passed range. This is a "data
297 * integrity" operation. It waits upon in-flight writeout before starting and
298 * waiting upon new writeout. If there was an IO error, return it.
300 * We need to re-take i_mutex during the generic_osync_inode list walk because
301 * it is otherwise livelockable.
303 int sync_page_range(struct inode
*inode
, struct address_space
*mapping
,
304 loff_t pos
, loff_t count
)
306 pgoff_t start
= pos
>> PAGE_CACHE_SHIFT
;
307 pgoff_t end
= (pos
+ count
- 1) >> PAGE_CACHE_SHIFT
;
310 if (!mapping_cap_writeback_dirty(mapping
) || !count
)
312 ret
= filemap_fdatawrite_range(mapping
, pos
, pos
+ count
- 1);
314 mutex_lock(&inode
->i_mutex
);
315 ret
= generic_osync_inode(inode
, mapping
, OSYNC_METADATA
);
316 mutex_unlock(&inode
->i_mutex
);
319 ret
= wait_on_page_writeback_range(mapping
, start
, end
);
322 EXPORT_SYMBOL(sync_page_range
);
325 * sync_page_range_nolock
326 * @inode: target inode
327 * @mapping: target address_space
328 * @pos: beginning offset in pages to write
329 * @count: number of bytes to write
331 * Note: Holding i_mutex across sync_page_range_nolock() is not a good idea
332 * as it forces O_SYNC writers to different parts of the same file
333 * to be serialised right until io completion.
335 int sync_page_range_nolock(struct inode
*inode
, struct address_space
*mapping
,
336 loff_t pos
, loff_t count
)
338 pgoff_t start
= pos
>> PAGE_CACHE_SHIFT
;
339 pgoff_t end
= (pos
+ count
- 1) >> PAGE_CACHE_SHIFT
;
342 if (!mapping_cap_writeback_dirty(mapping
) || !count
)
344 ret
= filemap_fdatawrite_range(mapping
, pos
, pos
+ count
- 1);
346 ret
= generic_osync_inode(inode
, mapping
, OSYNC_METADATA
);
348 ret
= wait_on_page_writeback_range(mapping
, start
, end
);
351 EXPORT_SYMBOL(sync_page_range_nolock
);
354 * filemap_fdatawait - wait for all under-writeback pages to complete
355 * @mapping: address space structure to wait for
357 * Walk the list of under-writeback pages of the given address space
358 * and wait for all of them.
360 int filemap_fdatawait(struct address_space
*mapping
)
362 loff_t i_size
= i_size_read(mapping
->host
);
367 return wait_on_page_writeback_range(mapping
, 0,
368 (i_size
- 1) >> PAGE_CACHE_SHIFT
);
370 EXPORT_SYMBOL(filemap_fdatawait
);
372 int filemap_write_and_wait(struct address_space
*mapping
)
376 if (mapping
->nrpages
) {
377 err
= filemap_fdatawrite(mapping
);
379 * Even if the above returned error, the pages may be
380 * written partially (e.g. -ENOSPC), so we wait for it.
381 * But the -EIO is special case, it may indicate the worst
382 * thing (e.g. bug) happened, so we avoid waiting for it.
385 int err2
= filemap_fdatawait(mapping
);
392 EXPORT_SYMBOL(filemap_write_and_wait
);
395 * filemap_write_and_wait_range - write out & wait on a file range
396 * @mapping: the address_space for the pages
397 * @lstart: offset in bytes where the range starts
398 * @lend: offset in bytes where the range ends (inclusive)
400 * Write out and wait upon file offsets lstart->lend, inclusive.
402 * Note that `lend' is inclusive (describes the last byte to be written) so
403 * that this function can be used to write to the very end-of-file (end = -1).
405 int filemap_write_and_wait_range(struct address_space
*mapping
,
406 loff_t lstart
, loff_t lend
)
410 if (mapping
->nrpages
) {
411 err
= __filemap_fdatawrite_range(mapping
, lstart
, lend
,
413 /* See comment of filemap_write_and_wait() */
415 int err2
= wait_on_page_writeback_range(mapping
,
416 lstart
>> PAGE_CACHE_SHIFT
,
417 lend
>> PAGE_CACHE_SHIFT
);
426 * add_to_page_cache - add newly allocated pagecache pages
428 * @mapping: the page's address_space
429 * @offset: page index
430 * @gfp_mask: page allocation mode
432 * This function is used to add newly allocated pagecache pages;
433 * the page is new, so we can just run SetPageLocked() against it.
434 * The other page state flags were set by rmqueue().
436 * This function does not add the page to the LRU. The caller must do that.
438 int add_to_page_cache(struct page
*page
, struct address_space
*mapping
,
439 pgoff_t offset
, gfp_t gfp_mask
)
441 int error
= radix_tree_preload(gfp_mask
& ~__GFP_HIGHMEM
);
444 write_lock_irq(&mapping
->tree_lock
);
445 error
= radix_tree_insert(&mapping
->page_tree
, offset
, page
);
447 page_cache_get(page
);
449 page
->mapping
= mapping
;
450 page
->index
= offset
;
452 __inc_zone_page_state(page
, NR_FILE_PAGES
);
454 write_unlock_irq(&mapping
->tree_lock
);
455 radix_tree_preload_end();
459 EXPORT_SYMBOL(add_to_page_cache
);
461 int add_to_page_cache_lru(struct page
*page
, struct address_space
*mapping
,
462 pgoff_t offset
, gfp_t gfp_mask
)
464 int ret
= add_to_page_cache(page
, mapping
, offset
, gfp_mask
);
471 struct page
*__page_cache_alloc(gfp_t gfp
)
473 if (cpuset_do_page_mem_spread()) {
474 int n
= cpuset_mem_spread_node();
475 return alloc_pages_node(n
, gfp
, 0);
477 return alloc_pages(gfp
, 0);
479 EXPORT_SYMBOL(__page_cache_alloc
);
482 static int __sleep_on_page_lock(void *word
)
489 * In order to wait for pages to become available there must be
490 * waitqueues associated with pages. By using a hash table of
491 * waitqueues where the bucket discipline is to maintain all
492 * waiters on the same queue and wake all when any of the pages
493 * become available, and for the woken contexts to check to be
494 * sure the appropriate page became available, this saves space
495 * at a cost of "thundering herd" phenomena during rare hash
498 static wait_queue_head_t
*page_waitqueue(struct page
*page
)
500 const struct zone
*zone
= page_zone(page
);
502 return &zone
->wait_table
[hash_ptr(page
, zone
->wait_table_bits
)];
505 static inline void wake_up_page(struct page
*page
, int bit
)
507 __wake_up_bit(page_waitqueue(page
), &page
->flags
, bit
);
510 void fastcall
wait_on_page_bit(struct page
*page
, int bit_nr
)
512 DEFINE_WAIT_BIT(wait
, &page
->flags
, bit_nr
);
514 if (test_bit(bit_nr
, &page
->flags
))
515 __wait_on_bit(page_waitqueue(page
), &wait
, sync_page
,
516 TASK_UNINTERRUPTIBLE
);
518 EXPORT_SYMBOL(wait_on_page_bit
);
521 * unlock_page - unlock a locked page
524 * Unlocks the page and wakes up sleepers in ___wait_on_page_locked().
525 * Also wakes sleepers in wait_on_page_writeback() because the wakeup
526 * mechananism between PageLocked pages and PageWriteback pages is shared.
527 * But that's OK - sleepers in wait_on_page_writeback() just go back to sleep.
529 * The first mb is necessary to safely close the critical section opened by the
530 * TestSetPageLocked(), the second mb is necessary to enforce ordering between
531 * the clear_bit and the read of the waitqueue (to avoid SMP races with a
532 * parallel wait_on_page_locked()).
534 void fastcall
unlock_page(struct page
*page
)
536 smp_mb__before_clear_bit();
537 if (!TestClearPageLocked(page
))
539 smp_mb__after_clear_bit();
540 wake_up_page(page
, PG_locked
);
542 EXPORT_SYMBOL(unlock_page
);
545 * end_page_writeback - end writeback against a page
548 void end_page_writeback(struct page
*page
)
550 if (!TestClearPageReclaim(page
) || rotate_reclaimable_page(page
)) {
551 if (!test_clear_page_writeback(page
))
554 smp_mb__after_clear_bit();
555 wake_up_page(page
, PG_writeback
);
557 EXPORT_SYMBOL(end_page_writeback
);
560 * __lock_page - get a lock on the page, assuming we need to sleep to get it
561 * @page: the page to lock
563 * Ugly. Running sync_page() in state TASK_UNINTERRUPTIBLE is scary. If some
564 * random driver's requestfn sets TASK_RUNNING, we could busywait. However
565 * chances are that on the second loop, the block layer's plug list is empty,
566 * so sync_page() will then return in state TASK_UNINTERRUPTIBLE.
568 void fastcall
__lock_page(struct page
*page
)
570 DEFINE_WAIT_BIT(wait
, &page
->flags
, PG_locked
);
572 __wait_on_bit_lock(page_waitqueue(page
), &wait
, sync_page
,
573 TASK_UNINTERRUPTIBLE
);
575 EXPORT_SYMBOL(__lock_page
);
578 * Variant of lock_page that does not require the caller to hold a reference
579 * on the page's mapping.
581 void fastcall
__lock_page_nosync(struct page
*page
)
583 DEFINE_WAIT_BIT(wait
, &page
->flags
, PG_locked
);
584 __wait_on_bit_lock(page_waitqueue(page
), &wait
, __sleep_on_page_lock
,
585 TASK_UNINTERRUPTIBLE
);
589 * find_get_page - find and get a page reference
590 * @mapping: the address_space to search
591 * @offset: the page index
593 * Is there a pagecache struct page at the given (mapping, offset) tuple?
594 * If yes, increment its refcount and return it; if no, return NULL.
596 struct page
* find_get_page(struct address_space
*mapping
, unsigned long offset
)
600 read_lock_irq(&mapping
->tree_lock
);
601 page
= radix_tree_lookup(&mapping
->page_tree
, offset
);
603 page_cache_get(page
);
604 read_unlock_irq(&mapping
->tree_lock
);
607 EXPORT_SYMBOL(find_get_page
);
610 * find_lock_page - locate, pin and lock a pagecache page
611 * @mapping: the address_space to search
612 * @offset: the page index
614 * Locates the desired pagecache page, locks it, increments its reference
615 * count and returns its address.
617 * Returns zero if the page was not present. find_lock_page() may sleep.
619 struct page
*find_lock_page(struct address_space
*mapping
,
620 unsigned long offset
)
624 read_lock_irq(&mapping
->tree_lock
);
626 page
= radix_tree_lookup(&mapping
->page_tree
, offset
);
628 page_cache_get(page
);
629 if (TestSetPageLocked(page
)) {
630 read_unlock_irq(&mapping
->tree_lock
);
632 read_lock_irq(&mapping
->tree_lock
);
634 /* Has the page been truncated while we slept? */
635 if (unlikely(page
->mapping
!= mapping
||
636 page
->index
!= offset
)) {
638 page_cache_release(page
);
643 read_unlock_irq(&mapping
->tree_lock
);
646 EXPORT_SYMBOL(find_lock_page
);
649 * find_or_create_page - locate or add a pagecache page
650 * @mapping: the page's address_space
651 * @index: the page's index into the mapping
652 * @gfp_mask: page allocation mode
654 * Locates a page in the pagecache. If the page is not present, a new page
655 * is allocated using @gfp_mask and is added to the pagecache and to the VM's
656 * LRU list. The returned page is locked and has its reference count
659 * find_or_create_page() may sleep, even if @gfp_flags specifies an atomic
662 * find_or_create_page() returns the desired page's address, or zero on
665 struct page
*find_or_create_page(struct address_space
*mapping
,
666 unsigned long index
, gfp_t gfp_mask
)
668 struct page
*page
, *cached_page
= NULL
;
671 page
= find_lock_page(mapping
, index
);
675 __page_cache_alloc(gfp_mask
);
679 err
= add_to_page_cache_lru(cached_page
, mapping
,
684 } else if (err
== -EEXIST
)
688 page_cache_release(cached_page
);
691 EXPORT_SYMBOL(find_or_create_page
);
694 * find_get_pages - gang pagecache lookup
695 * @mapping: The address_space to search
696 * @start: The starting page index
697 * @nr_pages: The maximum number of pages
698 * @pages: Where the resulting pages are placed
700 * find_get_pages() will search for and return a group of up to
701 * @nr_pages pages in the mapping. The pages are placed at @pages.
702 * find_get_pages() takes a reference against the returned pages.
704 * The search returns a group of mapping-contiguous pages with ascending
705 * indexes. There may be holes in the indices due to not-present pages.
707 * find_get_pages() returns the number of pages which were found.
709 unsigned find_get_pages(struct address_space
*mapping
, pgoff_t start
,
710 unsigned int nr_pages
, struct page
**pages
)
715 read_lock_irq(&mapping
->tree_lock
);
716 ret
= radix_tree_gang_lookup(&mapping
->page_tree
,
717 (void **)pages
, start
, nr_pages
);
718 for (i
= 0; i
< ret
; i
++)
719 page_cache_get(pages
[i
]);
720 read_unlock_irq(&mapping
->tree_lock
);
725 * find_get_pages_contig - gang contiguous pagecache lookup
726 * @mapping: The address_space to search
727 * @index: The starting page index
728 * @nr_pages: The maximum number of pages
729 * @pages: Where the resulting pages are placed
731 * find_get_pages_contig() works exactly like find_get_pages(), except
732 * that the returned number of pages are guaranteed to be contiguous.
734 * find_get_pages_contig() returns the number of pages which were found.
736 unsigned find_get_pages_contig(struct address_space
*mapping
, pgoff_t index
,
737 unsigned int nr_pages
, struct page
**pages
)
742 read_lock_irq(&mapping
->tree_lock
);
743 ret
= radix_tree_gang_lookup(&mapping
->page_tree
,
744 (void **)pages
, index
, nr_pages
);
745 for (i
= 0; i
< ret
; i
++) {
746 if (pages
[i
]->mapping
== NULL
|| pages
[i
]->index
!= index
)
749 page_cache_get(pages
[i
]);
752 read_unlock_irq(&mapping
->tree_lock
);
755 EXPORT_SYMBOL(find_get_pages_contig
);
758 * find_get_pages_tag - find and return pages that match @tag
759 * @mapping: the address_space to search
760 * @index: the starting page index
761 * @tag: the tag index
762 * @nr_pages: the maximum number of pages
763 * @pages: where the resulting pages are placed
765 * Like find_get_pages, except we only return pages which are tagged with
766 * @tag. We update @index to index the next page for the traversal.
768 unsigned find_get_pages_tag(struct address_space
*mapping
, pgoff_t
*index
,
769 int tag
, unsigned int nr_pages
, struct page
**pages
)
774 read_lock_irq(&mapping
->tree_lock
);
775 ret
= radix_tree_gang_lookup_tag(&mapping
->page_tree
,
776 (void **)pages
, *index
, nr_pages
, tag
);
777 for (i
= 0; i
< ret
; i
++)
778 page_cache_get(pages
[i
]);
780 *index
= pages
[ret
- 1]->index
+ 1;
781 read_unlock_irq(&mapping
->tree_lock
);
784 EXPORT_SYMBOL(find_get_pages_tag
);
787 * grab_cache_page_nowait - returns locked page at given index in given cache
788 * @mapping: target address_space
789 * @index: the page index
791 * Same as grab_cache_page(), but do not wait if the page is unavailable.
792 * This is intended for speculative data generators, where the data can
793 * be regenerated if the page couldn't be grabbed. This routine should
794 * be safe to call while holding the lock for another page.
796 * Clear __GFP_FS when allocating the page to avoid recursion into the fs
797 * and deadlock against the caller's locked page.
800 grab_cache_page_nowait(struct address_space
*mapping
, unsigned long index
)
802 struct page
*page
= find_get_page(mapping
, index
);
805 if (!TestSetPageLocked(page
))
807 page_cache_release(page
);
810 page
= __page_cache_alloc(mapping_gfp_mask(mapping
) & ~__GFP_FS
);
811 if (page
&& add_to_page_cache_lru(page
, mapping
, index
, GFP_KERNEL
)) {
812 page_cache_release(page
);
817 EXPORT_SYMBOL(grab_cache_page_nowait
);
820 * CD/DVDs are error prone. When a medium error occurs, the driver may fail
821 * a _large_ part of the i/o request. Imagine the worst scenario:
823 * ---R__________________________________________B__________
824 * ^ reading here ^ bad block(assume 4k)
826 * read(R) => miss => readahead(R...B) => media error => frustrating retries
827 * => failing the whole request => read(R) => read(R+1) =>
828 * readahead(R+1...B+1) => bang => read(R+2) => read(R+3) =>
829 * readahead(R+3...B+2) => bang => read(R+3) => read(R+4) =>
830 * readahead(R+4...B+3) => bang => read(R+4) => read(R+5) => ......
832 * It is going insane. Fix it by quickly scaling down the readahead size.
834 static void shrink_readahead_size_eio(struct file
*filp
,
835 struct file_ra_state
*ra
)
844 * do_generic_mapping_read - generic file read routine
845 * @mapping: address_space to be read
846 * @_ra: file's readahead state
847 * @filp: the file to read
848 * @ppos: current file position
849 * @desc: read_descriptor
850 * @actor: read method
852 * This is a generic file read routine, and uses the
853 * mapping->a_ops->readpage() function for the actual low-level stuff.
855 * This is really ugly. But the goto's actually try to clarify some
856 * of the logic when it comes to error handling etc.
858 * Note the struct file* is only passed for the use of readpage.
861 void do_generic_mapping_read(struct address_space
*mapping
,
862 struct file_ra_state
*_ra
,
865 read_descriptor_t
*desc
,
868 struct inode
*inode
= mapping
->host
;
870 unsigned long offset
;
871 unsigned long last_index
;
872 unsigned long next_index
;
873 unsigned long prev_index
;
874 unsigned int prev_offset
;
875 struct page
*cached_page
;
877 struct file_ra_state ra
= *_ra
;
880 index
= *ppos
>> PAGE_CACHE_SHIFT
;
882 prev_index
= ra
.prev_index
;
883 prev_offset
= ra
.prev_offset
;
884 last_index
= (*ppos
+ desc
->count
+ PAGE_CACHE_SIZE
-1) >> PAGE_CACHE_SHIFT
;
885 offset
= *ppos
& ~PAGE_CACHE_MASK
;
889 unsigned long end_index
;
891 unsigned long nr
, ret
;
894 if (index
== next_index
)
895 next_index
= page_cache_readahead(mapping
, &ra
, filp
,
896 index
, last_index
- index
);
899 page
= find_get_page(mapping
, index
);
900 if (unlikely(page
== NULL
)) {
901 handle_ra_miss(mapping
, &ra
, index
);
904 if (!PageUptodate(page
))
905 goto page_not_up_to_date
;
908 * i_size must be checked after we know the page is Uptodate.
910 * Checking i_size after the check allows us to calculate
911 * the correct value for "nr", which means the zero-filled
912 * part of the page is not copied back to userspace (unless
913 * another truncate extends the file - this is desired though).
916 isize
= i_size_read(inode
);
917 end_index
= (isize
- 1) >> PAGE_CACHE_SHIFT
;
918 if (unlikely(!isize
|| index
> end_index
)) {
919 page_cache_release(page
);
923 /* nr is the maximum number of bytes to copy from this page */
924 nr
= PAGE_CACHE_SIZE
;
925 if (index
== end_index
) {
926 nr
= ((isize
- 1) & ~PAGE_CACHE_MASK
) + 1;
928 page_cache_release(page
);
934 /* If users can be writing to this page using arbitrary
935 * virtual addresses, take care about potential aliasing
936 * before reading the page on the kernel side.
938 if (mapping_writably_mapped(mapping
))
939 flush_dcache_page(page
);
942 * When a sequential read accesses a page several times,
943 * only mark it as accessed the first time.
945 if (prev_index
!= index
|| offset
!= prev_offset
)
946 mark_page_accessed(page
);
950 * Ok, we have the page, and it's up-to-date, so
951 * now we can copy it to user space...
953 * The actor routine returns how many bytes were actually used..
954 * NOTE! This may not be the same as how much of a user buffer
955 * we filled up (we may be padding etc), so we can only update
956 * "pos" here (the actor routine has to update the user buffer
957 * pointers and the remaining count).
959 ret
= actor(desc
, page
, offset
, nr
);
961 index
+= offset
>> PAGE_CACHE_SHIFT
;
962 offset
&= ~PAGE_CACHE_MASK
;
963 prev_offset
= offset
;
964 ra
.prev_offset
= offset
;
966 page_cache_release(page
);
967 if (ret
== nr
&& desc
->count
)
972 /* Get exclusive access to the page ... */
975 /* Did it get truncated before we got the lock? */
976 if (!page
->mapping
) {
978 page_cache_release(page
);
982 /* Did somebody else fill it already? */
983 if (PageUptodate(page
)) {
989 /* Start the actual read. The read will unlock the page. */
990 error
= mapping
->a_ops
->readpage(filp
, page
);
992 if (unlikely(error
)) {
993 if (error
== AOP_TRUNCATED_PAGE
) {
994 page_cache_release(page
);
1000 if (!PageUptodate(page
)) {
1002 if (!PageUptodate(page
)) {
1003 if (page
->mapping
== NULL
) {
1005 * invalidate_inode_pages got it
1008 page_cache_release(page
);
1013 shrink_readahead_size_eio(filp
, &ra
);
1014 goto readpage_error
;
1022 /* UHHUH! A synchronous read error occurred. Report it */
1023 desc
->error
= error
;
1024 page_cache_release(page
);
1029 * Ok, it wasn't cached, so we need to create a new
1033 cached_page
= page_cache_alloc_cold(mapping
);
1035 desc
->error
= -ENOMEM
;
1039 error
= add_to_page_cache_lru(cached_page
, mapping
,
1042 if (error
== -EEXIST
)
1044 desc
->error
= error
;
1055 *ppos
= ((loff_t
) index
<< PAGE_CACHE_SHIFT
) + offset
;
1057 page_cache_release(cached_page
);
1059 file_accessed(filp
);
1061 EXPORT_SYMBOL(do_generic_mapping_read
);
1063 int file_read_actor(read_descriptor_t
*desc
, struct page
*page
,
1064 unsigned long offset
, unsigned long size
)
1067 unsigned long left
, count
= desc
->count
;
1073 * Faults on the destination of a read are common, so do it before
1076 if (!fault_in_pages_writeable(desc
->arg
.buf
, size
)) {
1077 kaddr
= kmap_atomic(page
, KM_USER0
);
1078 left
= __copy_to_user_inatomic(desc
->arg
.buf
,
1079 kaddr
+ offset
, size
);
1080 kunmap_atomic(kaddr
, KM_USER0
);
1085 /* Do it the slow way */
1087 left
= __copy_to_user(desc
->arg
.buf
, kaddr
+ offset
, size
);
1092 desc
->error
= -EFAULT
;
1095 desc
->count
= count
- size
;
1096 desc
->written
+= size
;
1097 desc
->arg
.buf
+= size
;
1102 * Performs necessary checks before doing a write
1103 * @iov: io vector request
1104 * @nr_segs: number of segments in the iovec
1105 * @count: number of bytes to write
1106 * @access_flags: type of access: %VERIFY_READ or %VERIFY_WRITE
1108 * Adjust number of segments and amount of bytes to write (nr_segs should be
1109 * properly initialized first). Returns appropriate error code that caller
1110 * should return or zero in case that write should be allowed.
1112 int generic_segment_checks(const struct iovec
*iov
,
1113 unsigned long *nr_segs
, size_t *count
, int access_flags
)
1117 for (seg
= 0; seg
< *nr_segs
; seg
++) {
1118 const struct iovec
*iv
= &iov
[seg
];
1121 * If any segment has a negative length, or the cumulative
1122 * length ever wraps negative then return -EINVAL.
1125 if (unlikely((ssize_t
)(cnt
|iv
->iov_len
) < 0))
1127 if (access_ok(access_flags
, iv
->iov_base
, iv
->iov_len
))
1132 cnt
-= iv
->iov_len
; /* This segment is no good */
1138 EXPORT_SYMBOL(generic_segment_checks
);
1141 * generic_file_aio_read - generic filesystem read routine
1142 * @iocb: kernel I/O control block
1143 * @iov: io vector request
1144 * @nr_segs: number of segments in the iovec
1145 * @pos: current file position
1147 * This is the "read()" routine for all filesystems
1148 * that can use the page cache directly.
1151 generic_file_aio_read(struct kiocb
*iocb
, const struct iovec
*iov
,
1152 unsigned long nr_segs
, loff_t pos
)
1154 struct file
*filp
= iocb
->ki_filp
;
1158 loff_t
*ppos
= &iocb
->ki_pos
;
1161 retval
= generic_segment_checks(iov
, &nr_segs
, &count
, VERIFY_WRITE
);
1165 /* coalesce the iovecs and go direct-to-BIO for O_DIRECT */
1166 if (filp
->f_flags
& O_DIRECT
) {
1168 struct address_space
*mapping
;
1169 struct inode
*inode
;
1171 mapping
= filp
->f_mapping
;
1172 inode
= mapping
->host
;
1175 goto out
; /* skip atime */
1176 size
= i_size_read(inode
);
1178 retval
= generic_file_direct_IO(READ
, iocb
,
1181 *ppos
= pos
+ retval
;
1183 if (likely(retval
!= 0)) {
1184 file_accessed(filp
);
1191 for (seg
= 0; seg
< nr_segs
; seg
++) {
1192 read_descriptor_t desc
;
1195 desc
.arg
.buf
= iov
[seg
].iov_base
;
1196 desc
.count
= iov
[seg
].iov_len
;
1197 if (desc
.count
== 0)
1200 do_generic_file_read(filp
,ppos
,&desc
,file_read_actor
);
1201 retval
+= desc
.written
;
1203 retval
= retval
?: desc
.error
;
1213 EXPORT_SYMBOL(generic_file_aio_read
);
1215 int file_send_actor(read_descriptor_t
* desc
, struct page
*page
, unsigned long offset
, unsigned long size
)
1218 unsigned long count
= desc
->count
;
1219 struct file
*file
= desc
->arg
.data
;
1224 written
= file
->f_op
->sendpage(file
, page
, offset
,
1225 size
, &file
->f_pos
, size
<count
);
1227 desc
->error
= written
;
1230 desc
->count
= count
- written
;
1231 desc
->written
+= written
;
1236 do_readahead(struct address_space
*mapping
, struct file
*filp
,
1237 unsigned long index
, unsigned long nr
)
1239 if (!mapping
|| !mapping
->a_ops
|| !mapping
->a_ops
->readpage
)
1242 force_page_cache_readahead(mapping
, filp
, index
,
1243 max_sane_readahead(nr
));
1247 asmlinkage ssize_t
sys_readahead(int fd
, loff_t offset
, size_t count
)
1255 if (file
->f_mode
& FMODE_READ
) {
1256 struct address_space
*mapping
= file
->f_mapping
;
1257 unsigned long start
= offset
>> PAGE_CACHE_SHIFT
;
1258 unsigned long end
= (offset
+ count
- 1) >> PAGE_CACHE_SHIFT
;
1259 unsigned long len
= end
- start
+ 1;
1260 ret
= do_readahead(mapping
, file
, start
, len
);
1268 static int FASTCALL(page_cache_read(struct file
* file
, unsigned long offset
));
1270 * page_cache_read - adds requested page to the page cache if not already there
1271 * @file: file to read
1272 * @offset: page index
1274 * This adds the requested page to the page cache if it isn't already there,
1275 * and schedules an I/O to read in its contents from disk.
1277 static int fastcall
page_cache_read(struct file
* file
, unsigned long offset
)
1279 struct address_space
*mapping
= file
->f_mapping
;
1284 page
= page_cache_alloc_cold(mapping
);
1288 ret
= add_to_page_cache_lru(page
, mapping
, offset
, GFP_KERNEL
);
1290 ret
= mapping
->a_ops
->readpage(file
, page
);
1291 else if (ret
== -EEXIST
)
1292 ret
= 0; /* losing race to add is OK */
1294 page_cache_release(page
);
1296 } while (ret
== AOP_TRUNCATED_PAGE
);
1301 #define MMAP_LOTSAMISS (100)
1304 * filemap_nopage - read in file data for page fault handling
1305 * @area: the applicable vm_area
1306 * @address: target address to read in
1307 * @type: returned with VM_FAULT_{MINOR,MAJOR} if not %NULL
1309 * filemap_nopage() is invoked via the vma operations vector for a
1310 * mapped memory region to read in file data during a page fault.
1312 * The goto's are kind of ugly, but this streamlines the normal case of having
1313 * it in the page cache, and handles the special cases reasonably without
1314 * having a lot of duplicated code.
1316 struct page
*filemap_nopage(struct vm_area_struct
*area
,
1317 unsigned long address
, int *type
)
1320 struct file
*file
= area
->vm_file
;
1321 struct address_space
*mapping
= file
->f_mapping
;
1322 struct file_ra_state
*ra
= &file
->f_ra
;
1323 struct inode
*inode
= mapping
->host
;
1325 unsigned long size
, pgoff
;
1326 int did_readaround
= 0, majmin
= VM_FAULT_MINOR
;
1328 pgoff
= ((address
-area
->vm_start
) >> PAGE_CACHE_SHIFT
) + area
->vm_pgoff
;
1331 size
= (i_size_read(inode
) + PAGE_CACHE_SIZE
- 1) >> PAGE_CACHE_SHIFT
;
1333 goto outside_data_content
;
1335 /* If we don't want any read-ahead, don't bother */
1336 if (VM_RandomReadHint(area
))
1337 goto no_cached_page
;
1340 * The readahead code wants to be told about each and every page
1341 * so it can build and shrink its windows appropriately
1343 * For sequential accesses, we use the generic readahead logic.
1345 if (VM_SequentialReadHint(area
))
1346 page_cache_readahead(mapping
, ra
, file
, pgoff
, 1);
1349 * Do we have something in the page cache already?
1352 page
= find_get_page(mapping
, pgoff
);
1354 unsigned long ra_pages
;
1356 if (VM_SequentialReadHint(area
)) {
1357 handle_ra_miss(mapping
, ra
, pgoff
);
1358 goto no_cached_page
;
1363 * Do we miss much more than hit in this file? If so,
1364 * stop bothering with read-ahead. It will only hurt.
1366 if (ra
->mmap_miss
> ra
->mmap_hit
+ MMAP_LOTSAMISS
)
1367 goto no_cached_page
;
1370 * To keep the pgmajfault counter straight, we need to
1371 * check did_readaround, as this is an inner loop.
1373 if (!did_readaround
) {
1374 majmin
= VM_FAULT_MAJOR
;
1375 count_vm_event(PGMAJFAULT
);
1378 ra_pages
= max_sane_readahead(file
->f_ra
.ra_pages
);
1382 if (pgoff
> ra_pages
/ 2)
1383 start
= pgoff
- ra_pages
/ 2;
1384 do_page_cache_readahead(mapping
, file
, start
, ra_pages
);
1386 page
= find_get_page(mapping
, pgoff
);
1388 goto no_cached_page
;
1391 if (!did_readaround
)
1395 * Ok, found a page in the page cache, now we need to check
1396 * that it's up-to-date.
1398 if (!PageUptodate(page
))
1399 goto page_not_uptodate
;
1403 * Found the page and have a reference on it.
1405 mark_page_accessed(page
);
1410 outside_data_content
:
1412 * An external ptracer can access pages that normally aren't
1415 if (area
->vm_mm
== current
->mm
)
1416 return NOPAGE_SIGBUS
;
1417 /* Fall through to the non-read-ahead case */
1420 * We're only likely to ever get here if MADV_RANDOM is in
1423 error
= page_cache_read(file
, pgoff
);
1426 * The page we want has now been added to the page cache.
1427 * In the unlikely event that someone removed it in the
1428 * meantime, we'll just come back here and read it again.
1434 * An error return from page_cache_read can result if the
1435 * system is low on memory, or a problem occurs while trying
1438 if (error
== -ENOMEM
)
1440 return NOPAGE_SIGBUS
;
1443 if (!did_readaround
) {
1444 majmin
= VM_FAULT_MAJOR
;
1445 count_vm_event(PGMAJFAULT
);
1449 * Umm, take care of errors if the page isn't up-to-date.
1450 * Try to re-read it _once_. We do this synchronously,
1451 * because there really aren't any performance issues here
1452 * and we need to check for errors.
1456 /* Somebody truncated the page on us? */
1457 if (!page
->mapping
) {
1459 page_cache_release(page
);
1463 /* Somebody else successfully read it in? */
1464 if (PageUptodate(page
)) {
1468 ClearPageError(page
);
1469 error
= mapping
->a_ops
->readpage(file
, page
);
1471 wait_on_page_locked(page
);
1472 if (PageUptodate(page
))
1474 } else if (error
== AOP_TRUNCATED_PAGE
) {
1475 page_cache_release(page
);
1480 * Things didn't work out. Return zero to tell the
1481 * mm layer so, possibly freeing the page cache page first.
1483 shrink_readahead_size_eio(file
, ra
);
1484 page_cache_release(page
);
1485 return NOPAGE_SIGBUS
;
1487 EXPORT_SYMBOL(filemap_nopage
);
1489 static struct page
* filemap_getpage(struct file
*file
, unsigned long pgoff
,
1492 struct address_space
*mapping
= file
->f_mapping
;
1497 * Do we have something in the page cache already?
1500 page
= find_get_page(mapping
, pgoff
);
1504 goto no_cached_page
;
1508 * Ok, found a page in the page cache, now we need to check
1509 * that it's up-to-date.
1511 if (!PageUptodate(page
)) {
1513 page_cache_release(page
);
1516 goto page_not_uptodate
;
1521 * Found the page and have a reference on it.
1523 mark_page_accessed(page
);
1527 error
= page_cache_read(file
, pgoff
);
1530 * The page we want has now been added to the page cache.
1531 * In the unlikely event that someone removed it in the
1532 * meantime, we'll just come back here and read it again.
1538 * An error return from page_cache_read can result if the
1539 * system is low on memory, or a problem occurs while trying
1547 /* Did it get truncated while we waited for it? */
1548 if (!page
->mapping
) {
1553 /* Did somebody else get it up-to-date? */
1554 if (PageUptodate(page
)) {
1559 error
= mapping
->a_ops
->readpage(file
, page
);
1561 wait_on_page_locked(page
);
1562 if (PageUptodate(page
))
1564 } else if (error
== AOP_TRUNCATED_PAGE
) {
1565 page_cache_release(page
);
1570 * Umm, take care of errors if the page isn't up-to-date.
1571 * Try to re-read it _once_. We do this synchronously,
1572 * because there really aren't any performance issues here
1573 * and we need to check for errors.
1577 /* Somebody truncated the page on us? */
1578 if (!page
->mapping
) {
1582 /* Somebody else successfully read it in? */
1583 if (PageUptodate(page
)) {
1588 ClearPageError(page
);
1589 error
= mapping
->a_ops
->readpage(file
, page
);
1591 wait_on_page_locked(page
);
1592 if (PageUptodate(page
))
1594 } else if (error
== AOP_TRUNCATED_PAGE
) {
1595 page_cache_release(page
);
1600 * Things didn't work out. Return zero to tell the
1601 * mm layer so, possibly freeing the page cache page first.
1604 page_cache_release(page
);
1609 int filemap_populate(struct vm_area_struct
*vma
, unsigned long addr
,
1610 unsigned long len
, pgprot_t prot
, unsigned long pgoff
,
1613 struct file
*file
= vma
->vm_file
;
1614 struct address_space
*mapping
= file
->f_mapping
;
1615 struct inode
*inode
= mapping
->host
;
1617 struct mm_struct
*mm
= vma
->vm_mm
;
1622 force_page_cache_readahead(mapping
, vma
->vm_file
,
1623 pgoff
, len
>> PAGE_CACHE_SHIFT
);
1626 size
= (i_size_read(inode
) + PAGE_CACHE_SIZE
- 1) >> PAGE_CACHE_SHIFT
;
1627 if (pgoff
+ (len
>> PAGE_CACHE_SHIFT
) > size
)
1630 page
= filemap_getpage(file
, pgoff
, nonblock
);
1632 /* XXX: This is wrong, a filesystem I/O error may have happened. Fix that as
1633 * done in shmem_populate calling shmem_getpage */
1634 if (!page
&& !nonblock
)
1638 err
= install_page(mm
, vma
, addr
, page
, prot
);
1640 page_cache_release(page
);
1643 } else if (vma
->vm_flags
& VM_NONLINEAR
) {
1644 /* No page was found just because we can't read it in now (being
1645 * here implies nonblock != 0), but the page may exist, so set
1646 * the PTE to fault it in later. */
1647 err
= install_file_pte(mm
, vma
, addr
, pgoff
, prot
);
1660 EXPORT_SYMBOL(filemap_populate
);
1662 struct vm_operations_struct generic_file_vm_ops
= {
1663 .nopage
= filemap_nopage
,
1664 .populate
= filemap_populate
,
1667 /* This is used for a general mmap of a disk file */
1669 int generic_file_mmap(struct file
* file
, struct vm_area_struct
* vma
)
1671 struct address_space
*mapping
= file
->f_mapping
;
1673 if (!mapping
->a_ops
->readpage
)
1675 file_accessed(file
);
1676 vma
->vm_ops
= &generic_file_vm_ops
;
1681 * This is for filesystems which do not implement ->writepage.
1683 int generic_file_readonly_mmap(struct file
*file
, struct vm_area_struct
*vma
)
1685 if ((vma
->vm_flags
& VM_SHARED
) && (vma
->vm_flags
& VM_MAYWRITE
))
1687 return generic_file_mmap(file
, vma
);
1690 int generic_file_mmap(struct file
* file
, struct vm_area_struct
* vma
)
1694 int generic_file_readonly_mmap(struct file
* file
, struct vm_area_struct
* vma
)
1698 #endif /* CONFIG_MMU */
1700 EXPORT_SYMBOL(generic_file_mmap
);
1701 EXPORT_SYMBOL(generic_file_readonly_mmap
);
1703 static struct page
*__read_cache_page(struct address_space
*mapping
,
1704 unsigned long index
,
1705 int (*filler
)(void *,struct page
*),
1708 struct page
*page
, *cached_page
= NULL
;
1711 page
= find_get_page(mapping
, index
);
1714 cached_page
= page_cache_alloc_cold(mapping
);
1716 return ERR_PTR(-ENOMEM
);
1718 err
= add_to_page_cache_lru(cached_page
, mapping
,
1723 /* Presumably ENOMEM for radix tree node */
1724 page_cache_release(cached_page
);
1725 return ERR_PTR(err
);
1729 err
= filler(data
, page
);
1731 page_cache_release(page
);
1732 page
= ERR_PTR(err
);
1736 page_cache_release(cached_page
);
1741 * Same as read_cache_page, but don't wait for page to become unlocked
1742 * after submitting it to the filler.
1744 struct page
*read_cache_page_async(struct address_space
*mapping
,
1745 unsigned long index
,
1746 int (*filler
)(void *,struct page
*),
1753 page
= __read_cache_page(mapping
, index
, filler
, data
);
1756 if (PageUptodate(page
))
1760 if (!page
->mapping
) {
1762 page_cache_release(page
);
1765 if (PageUptodate(page
)) {
1769 err
= filler(data
, page
);
1771 page_cache_release(page
);
1772 return ERR_PTR(err
);
1775 mark_page_accessed(page
);
1778 EXPORT_SYMBOL(read_cache_page_async
);
1781 * read_cache_page - read into page cache, fill it if needed
1782 * @mapping: the page's address_space
1783 * @index: the page index
1784 * @filler: function to perform the read
1785 * @data: destination for read data
1787 * Read into the page cache. If a page already exists, and PageUptodate() is
1788 * not set, try to fill the page then wait for it to become unlocked.
1790 * If the page does not get brought uptodate, return -EIO.
1792 struct page
*read_cache_page(struct address_space
*mapping
,
1793 unsigned long index
,
1794 int (*filler
)(void *,struct page
*),
1799 page
= read_cache_page_async(mapping
, index
, filler
, data
);
1802 wait_on_page_locked(page
);
1803 if (!PageUptodate(page
)) {
1804 page_cache_release(page
);
1805 page
= ERR_PTR(-EIO
);
1810 EXPORT_SYMBOL(read_cache_page
);
1813 * If the page was newly created, increment its refcount and add it to the
1814 * caller's lru-buffering pagevec. This function is specifically for
1815 * generic_file_write().
1817 static inline struct page
*
1818 __grab_cache_page(struct address_space
*mapping
, unsigned long index
,
1819 struct page
**cached_page
, struct pagevec
*lru_pvec
)
1824 page
= find_lock_page(mapping
, index
);
1826 if (!*cached_page
) {
1827 *cached_page
= page_cache_alloc(mapping
);
1831 err
= add_to_page_cache(*cached_page
, mapping
,
1836 page
= *cached_page
;
1837 page_cache_get(page
);
1838 if (!pagevec_add(lru_pvec
, page
))
1839 __pagevec_lru_add(lru_pvec
);
1840 *cached_page
= NULL
;
1847 * The logic we want is
1849 * if suid or (sgid and xgrp)
1852 int should_remove_suid(struct dentry
*dentry
)
1854 mode_t mode
= dentry
->d_inode
->i_mode
;
1857 /* suid always must be killed */
1858 if (unlikely(mode
& S_ISUID
))
1859 kill
= ATTR_KILL_SUID
;
1862 * sgid without any exec bits is just a mandatory locking mark; leave
1863 * it alone. If some exec bits are set, it's a real sgid; kill it.
1865 if (unlikely((mode
& S_ISGID
) && (mode
& S_IXGRP
)))
1866 kill
|= ATTR_KILL_SGID
;
1868 if (unlikely(kill
&& !capable(CAP_FSETID
)))
1873 EXPORT_SYMBOL(should_remove_suid
);
1875 int __remove_suid(struct dentry
*dentry
, int kill
)
1877 struct iattr newattrs
;
1879 newattrs
.ia_valid
= ATTR_FORCE
| kill
;
1880 return notify_change(dentry
, &newattrs
);
1883 int remove_suid(struct dentry
*dentry
)
1885 int kill
= should_remove_suid(dentry
);
1888 return __remove_suid(dentry
, kill
);
1892 EXPORT_SYMBOL(remove_suid
);
1895 __filemap_copy_from_user_iovec_inatomic(char *vaddr
,
1896 const struct iovec
*iov
, size_t base
, size_t bytes
)
1898 size_t copied
= 0, left
= 0;
1901 char __user
*buf
= iov
->iov_base
+ base
;
1902 int copy
= min(bytes
, iov
->iov_len
- base
);
1905 left
= __copy_from_user_inatomic_nocache(vaddr
, buf
, copy
);
1914 return copied
- left
;
1918 * Performs necessary checks before doing a write
1920 * Can adjust writing position or amount of bytes to write.
1921 * Returns appropriate error code that caller should return or
1922 * zero in case that write should be allowed.
1924 inline int generic_write_checks(struct file
*file
, loff_t
*pos
, size_t *count
, int isblk
)
1926 struct inode
*inode
= file
->f_mapping
->host
;
1927 unsigned long limit
= current
->signal
->rlim
[RLIMIT_FSIZE
].rlim_cur
;
1929 if (unlikely(*pos
< 0))
1933 /* FIXME: this is for backwards compatibility with 2.4 */
1934 if (file
->f_flags
& O_APPEND
)
1935 *pos
= i_size_read(inode
);
1937 if (limit
!= RLIM_INFINITY
) {
1938 if (*pos
>= limit
) {
1939 send_sig(SIGXFSZ
, current
, 0);
1942 if (*count
> limit
- (typeof(limit
))*pos
) {
1943 *count
= limit
- (typeof(limit
))*pos
;
1951 if (unlikely(*pos
+ *count
> MAX_NON_LFS
&&
1952 !(file
->f_flags
& O_LARGEFILE
))) {
1953 if (*pos
>= MAX_NON_LFS
) {
1956 if (*count
> MAX_NON_LFS
- (unsigned long)*pos
) {
1957 *count
= MAX_NON_LFS
- (unsigned long)*pos
;
1962 * Are we about to exceed the fs block limit ?
1964 * If we have written data it becomes a short write. If we have
1965 * exceeded without writing data we send a signal and return EFBIG.
1966 * Linus frestrict idea will clean these up nicely..
1968 if (likely(!isblk
)) {
1969 if (unlikely(*pos
>= inode
->i_sb
->s_maxbytes
)) {
1970 if (*count
|| *pos
> inode
->i_sb
->s_maxbytes
) {
1973 /* zero-length writes at ->s_maxbytes are OK */
1976 if (unlikely(*pos
+ *count
> inode
->i_sb
->s_maxbytes
))
1977 *count
= inode
->i_sb
->s_maxbytes
- *pos
;
1981 if (bdev_read_only(I_BDEV(inode
)))
1983 isize
= i_size_read(inode
);
1984 if (*pos
>= isize
) {
1985 if (*count
|| *pos
> isize
)
1989 if (*pos
+ *count
> isize
)
1990 *count
= isize
- *pos
;
1997 EXPORT_SYMBOL(generic_write_checks
);
2000 generic_file_direct_write(struct kiocb
*iocb
, const struct iovec
*iov
,
2001 unsigned long *nr_segs
, loff_t pos
, loff_t
*ppos
,
2002 size_t count
, size_t ocount
)
2004 struct file
*file
= iocb
->ki_filp
;
2005 struct address_space
*mapping
= file
->f_mapping
;
2006 struct inode
*inode
= mapping
->host
;
2009 if (count
!= ocount
)
2010 *nr_segs
= iov_shorten((struct iovec
*)iov
, *nr_segs
, count
);
2012 written
= generic_file_direct_IO(WRITE
, iocb
, iov
, pos
, *nr_segs
);
2014 loff_t end
= pos
+ written
;
2015 if (end
> i_size_read(inode
) && !S_ISBLK(inode
->i_mode
)) {
2016 i_size_write(inode
, end
);
2017 mark_inode_dirty(inode
);
2023 * Sync the fs metadata but not the minor inode changes and
2024 * of course not the data as we did direct DMA for the IO.
2025 * i_mutex is held, which protects generic_osync_inode() from
2026 * livelocking. AIO O_DIRECT ops attempt to sync metadata here.
2028 if ((written
>= 0 || written
== -EIOCBQUEUED
) &&
2029 ((file
->f_flags
& O_SYNC
) || IS_SYNC(inode
))) {
2030 int err
= generic_osync_inode(inode
, mapping
, OSYNC_METADATA
);
2036 EXPORT_SYMBOL(generic_file_direct_write
);
2039 generic_file_buffered_write(struct kiocb
*iocb
, const struct iovec
*iov
,
2040 unsigned long nr_segs
, loff_t pos
, loff_t
*ppos
,
2041 size_t count
, ssize_t written
)
2043 struct file
*file
= iocb
->ki_filp
;
2044 struct address_space
* mapping
= file
->f_mapping
;
2045 const struct address_space_operations
*a_ops
= mapping
->a_ops
;
2046 struct inode
*inode
= mapping
->host
;
2049 struct page
*cached_page
= NULL
;
2051 struct pagevec lru_pvec
;
2052 const struct iovec
*cur_iov
= iov
; /* current iovec */
2053 size_t iov_base
= 0; /* offset in the current iovec */
2056 pagevec_init(&lru_pvec
, 0);
2059 * handle partial DIO write. Adjust cur_iov if needed.
2061 if (likely(nr_segs
== 1))
2062 buf
= iov
->iov_base
+ written
;
2064 filemap_set_next_iovec(&cur_iov
, &iov_base
, written
);
2065 buf
= cur_iov
->iov_base
+ iov_base
;
2069 unsigned long index
;
2070 unsigned long offset
;
2073 offset
= (pos
& (PAGE_CACHE_SIZE
-1)); /* Within page */
2074 index
= pos
>> PAGE_CACHE_SHIFT
;
2075 bytes
= PAGE_CACHE_SIZE
- offset
;
2077 /* Limit the size of the copy to the caller's write size */
2078 bytes
= min(bytes
, count
);
2080 /* We only need to worry about prefaulting when writes are from
2081 * user-space. NFSd uses vfs_writev with several non-aligned
2082 * segments in the vector, and limiting to one segment a time is
2083 * a noticeable performance for re-write
2085 if (!segment_eq(get_fs(), KERNEL_DS
)) {
2087 * Limit the size of the copy to that of the current
2088 * segment, because fault_in_pages_readable() doesn't
2089 * know how to walk segments.
2091 bytes
= min(bytes
, cur_iov
->iov_len
- iov_base
);
2094 * Bring in the user page that we will copy from
2095 * _first_. Otherwise there's a nasty deadlock on
2096 * copying from the same page as we're writing to,
2097 * without it being marked up-to-date.
2099 fault_in_pages_readable(buf
, bytes
);
2101 page
= __grab_cache_page(mapping
,index
,&cached_page
,&lru_pvec
);
2107 if (unlikely(bytes
== 0)) {
2110 goto zero_length_segment
;
2113 status
= a_ops
->prepare_write(file
, page
, offset
, offset
+bytes
);
2114 if (unlikely(status
)) {
2115 loff_t isize
= i_size_read(inode
);
2117 if (status
!= AOP_TRUNCATED_PAGE
)
2119 page_cache_release(page
);
2120 if (status
== AOP_TRUNCATED_PAGE
)
2123 * prepare_write() may have instantiated a few blocks
2124 * outside i_size. Trim these off again.
2126 if (pos
+ bytes
> isize
)
2127 vmtruncate(inode
, isize
);
2130 if (likely(nr_segs
== 1))
2131 copied
= filemap_copy_from_user(page
, offset
,
2134 copied
= filemap_copy_from_user_iovec(page
, offset
,
2135 cur_iov
, iov_base
, bytes
);
2136 flush_dcache_page(page
);
2137 status
= a_ops
->commit_write(file
, page
, offset
, offset
+bytes
);
2138 if (status
== AOP_TRUNCATED_PAGE
) {
2139 page_cache_release(page
);
2142 zero_length_segment
:
2143 if (likely(copied
>= 0)) {
2152 if (unlikely(nr_segs
> 1)) {
2153 filemap_set_next_iovec(&cur_iov
,
2156 buf
= cur_iov
->iov_base
+
2163 if (unlikely(copied
!= bytes
))
2167 mark_page_accessed(page
);
2168 page_cache_release(page
);
2171 balance_dirty_pages_ratelimited(mapping
);
2177 page_cache_release(cached_page
);
2180 * For now, when the user asks for O_SYNC, we'll actually give O_DSYNC
2182 if (likely(status
>= 0)) {
2183 if (unlikely((file
->f_flags
& O_SYNC
) || IS_SYNC(inode
))) {
2184 if (!a_ops
->writepage
|| !is_sync_kiocb(iocb
))
2185 status
= generic_osync_inode(inode
, mapping
,
2186 OSYNC_METADATA
|OSYNC_DATA
);
2191 * If we get here for O_DIRECT writes then we must have fallen through
2192 * to buffered writes (block instantiation inside i_size). So we sync
2193 * the file data here, to try to honour O_DIRECT expectations.
2195 if (unlikely(file
->f_flags
& O_DIRECT
) && written
)
2196 status
= filemap_write_and_wait(mapping
);
2198 pagevec_lru_add(&lru_pvec
);
2199 return written
? written
: status
;
2201 EXPORT_SYMBOL(generic_file_buffered_write
);
2204 __generic_file_aio_write_nolock(struct kiocb
*iocb
, const struct iovec
*iov
,
2205 unsigned long nr_segs
, loff_t
*ppos
)
2207 struct file
*file
= iocb
->ki_filp
;
2208 struct address_space
* mapping
= file
->f_mapping
;
2209 size_t ocount
; /* original count */
2210 size_t count
; /* after file limit checks */
2211 struct inode
*inode
= mapping
->host
;
2217 err
= generic_segment_checks(iov
, &nr_segs
, &ocount
, VERIFY_READ
);
2224 vfs_check_frozen(inode
->i_sb
, SB_FREEZE_WRITE
);
2226 /* We can write back this queue in page reclaim */
2227 current
->backing_dev_info
= mapping
->backing_dev_info
;
2230 err
= generic_write_checks(file
, &pos
, &count
, S_ISBLK(inode
->i_mode
));
2237 err
= remove_suid(file
->f_path
.dentry
);
2241 file_update_time(file
);
2243 /* coalesce the iovecs and go direct-to-BIO for O_DIRECT */
2244 if (unlikely(file
->f_flags
& O_DIRECT
)) {
2246 ssize_t written_buffered
;
2248 written
= generic_file_direct_write(iocb
, iov
, &nr_segs
, pos
,
2249 ppos
, count
, ocount
);
2250 if (written
< 0 || written
== count
)
2253 * direct-io write to a hole: fall through to buffered I/O
2254 * for completing the rest of the request.
2258 written_buffered
= generic_file_buffered_write(iocb
, iov
,
2259 nr_segs
, pos
, ppos
, count
,
2262 * If generic_file_buffered_write() retuned a synchronous error
2263 * then we want to return the number of bytes which were
2264 * direct-written, or the error code if that was zero. Note
2265 * that this differs from normal direct-io semantics, which
2266 * will return -EFOO even if some bytes were written.
2268 if (written_buffered
< 0) {
2269 err
= written_buffered
;
2274 * We need to ensure that the page cache pages are written to
2275 * disk and invalidated to preserve the expected O_DIRECT
2278 endbyte
= pos
+ written_buffered
- written
- 1;
2279 err
= do_sync_mapping_range(file
->f_mapping
, pos
, endbyte
,
2280 SYNC_FILE_RANGE_WAIT_BEFORE
|
2281 SYNC_FILE_RANGE_WRITE
|
2282 SYNC_FILE_RANGE_WAIT_AFTER
);
2284 written
= written_buffered
;
2285 invalidate_mapping_pages(mapping
,
2286 pos
>> PAGE_CACHE_SHIFT
,
2287 endbyte
>> PAGE_CACHE_SHIFT
);
2290 * We don't know how much we wrote, so just return
2291 * the number of bytes which were direct-written
2295 written
= generic_file_buffered_write(iocb
, iov
, nr_segs
,
2296 pos
, ppos
, count
, written
);
2299 current
->backing_dev_info
= NULL
;
2300 return written
? written
: err
;
2303 ssize_t
generic_file_aio_write_nolock(struct kiocb
*iocb
,
2304 const struct iovec
*iov
, unsigned long nr_segs
, loff_t pos
)
2306 struct file
*file
= iocb
->ki_filp
;
2307 struct address_space
*mapping
= file
->f_mapping
;
2308 struct inode
*inode
= mapping
->host
;
2311 BUG_ON(iocb
->ki_pos
!= pos
);
2313 ret
= __generic_file_aio_write_nolock(iocb
, iov
, nr_segs
,
2316 if (ret
> 0 && ((file
->f_flags
& O_SYNC
) || IS_SYNC(inode
))) {
2319 err
= sync_page_range_nolock(inode
, mapping
, pos
, ret
);
2325 EXPORT_SYMBOL(generic_file_aio_write_nolock
);
2327 ssize_t
generic_file_aio_write(struct kiocb
*iocb
, const struct iovec
*iov
,
2328 unsigned long nr_segs
, loff_t pos
)
2330 struct file
*file
= iocb
->ki_filp
;
2331 struct address_space
*mapping
= file
->f_mapping
;
2332 struct inode
*inode
= mapping
->host
;
2335 BUG_ON(iocb
->ki_pos
!= pos
);
2337 mutex_lock(&inode
->i_mutex
);
2338 ret
= __generic_file_aio_write_nolock(iocb
, iov
, nr_segs
,
2340 mutex_unlock(&inode
->i_mutex
);
2342 if (ret
> 0 && ((file
->f_flags
& O_SYNC
) || IS_SYNC(inode
))) {
2345 err
= sync_page_range(inode
, mapping
, pos
, ret
);
2351 EXPORT_SYMBOL(generic_file_aio_write
);
2354 * Called under i_mutex for writes to S_ISREG files. Returns -EIO if something
2355 * went wrong during pagecache shootdown.
2358 generic_file_direct_IO(int rw
, struct kiocb
*iocb
, const struct iovec
*iov
,
2359 loff_t offset
, unsigned long nr_segs
)
2361 struct file
*file
= iocb
->ki_filp
;
2362 struct address_space
*mapping
= file
->f_mapping
;
2365 pgoff_t end
= 0; /* silence gcc */
2368 * If it's a write, unmap all mmappings of the file up-front. This
2369 * will cause any pte dirty bits to be propagated into the pageframes
2370 * for the subsequent filemap_write_and_wait().
2373 write_len
= iov_length(iov
, nr_segs
);
2374 end
= (offset
+ write_len
- 1) >> PAGE_CACHE_SHIFT
;
2375 if (mapping_mapped(mapping
))
2376 unmap_mapping_range(mapping
, offset
, write_len
, 0);
2379 retval
= filemap_write_and_wait(mapping
);
2384 * After a write we want buffered reads to be sure to go to disk to get
2385 * the new data. We invalidate clean cached page from the region we're
2386 * about to write. We do this *before* the write so that we can return
2387 * -EIO without clobbering -EIOCBQUEUED from ->direct_IO().
2389 if (rw
== WRITE
&& mapping
->nrpages
) {
2390 retval
= invalidate_inode_pages2_range(mapping
,
2391 offset
>> PAGE_CACHE_SHIFT
, end
);
2396 retval
= mapping
->a_ops
->direct_IO(rw
, iocb
, iov
, offset
, nr_segs
);
2401 * Finally, try again to invalidate clean pages which might have been
2402 * faulted in by get_user_pages() if the source of the write was an
2403 * mmap()ed region of the file we're writing. That's a pretty crazy
2404 * thing to do, so we don't support it 100%. If this invalidation
2405 * fails and we have -EIOCBQUEUED we ignore the failure.
2407 if (rw
== WRITE
&& mapping
->nrpages
) {
2408 int err
= invalidate_inode_pages2_range(mapping
,
2409 offset
>> PAGE_CACHE_SHIFT
, end
);
2410 if (err
&& retval
>= 0)
2418 * try_to_release_page() - release old fs-specific metadata on a page
2420 * @page: the page which the kernel is trying to free
2421 * @gfp_mask: memory allocation flags (and I/O mode)
2423 * The address_space is to try to release any data against the page
2424 * (presumably at page->private). If the release was successful, return `1'.
2425 * Otherwise return zero.
2427 * The @gfp_mask argument specifies whether I/O may be performed to release
2428 * this page (__GFP_IO), and whether the call may block (__GFP_WAIT).
2430 * NOTE: @gfp_mask may go away, and this function may become non-blocking.
2432 int try_to_release_page(struct page
*page
, gfp_t gfp_mask
)
2434 struct address_space
* const mapping
= page
->mapping
;
2436 BUG_ON(!PageLocked(page
));
2437 if (PageWriteback(page
))
2440 if (mapping
&& mapping
->a_ops
->releasepage
)
2441 return mapping
->a_ops
->releasepage(page
, gfp_mask
);
2442 return try_to_free_buffers(page
);
2445 EXPORT_SYMBOL(try_to_release_page
);