2005-04-17 06:20:36 +08:00
|
|
|
#ifndef _LINUX_PAGEMAP_H
|
|
|
|
#define _LINUX_PAGEMAP_H
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright 1995 Linus Torvalds
|
|
|
|
*/
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/fs.h>
|
|
|
|
#include <linux/list.h>
|
|
|
|
#include <linux/highmem.h>
|
|
|
|
#include <linux/compiler.h>
|
|
|
|
#include <asm/uaccess.h>
|
|
|
|
#include <linux/gfp.h>
|
2007-05-08 15:23:25 +08:00
|
|
|
#include <linux/bitops.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Bits in mapping->flags. The lower __GFP_BITS_SHIFT bits are the page
|
|
|
|
* allocation mode flags.
|
|
|
|
*/
|
|
|
|
#define AS_EIO (__GFP_BITS_SHIFT + 0) /* IO error on async write */
|
|
|
|
#define AS_ENOSPC (__GFP_BITS_SHIFT + 1) /* ENOSPC on async write */
|
|
|
|
|
2007-05-08 15:23:25 +08:00
|
|
|
static inline void mapping_set_error(struct address_space *mapping, int error)
|
|
|
|
{
|
|
|
|
if (error) {
|
|
|
|
if (error == -ENOSPC)
|
|
|
|
set_bit(AS_ENOSPC, &mapping->flags);
|
|
|
|
else
|
|
|
|
set_bit(AS_EIO, &mapping->flags);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-10-07 14:46:04 +08:00
|
|
|
static inline gfp_t mapping_gfp_mask(struct address_space * mapping)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2005-10-21 15:22:44 +08:00
|
|
|
return (__force gfp_t)mapping->flags & __GFP_BITS_MASK;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is non-atomic. Only to be used before the mapping is activated.
|
|
|
|
* Probably needs a barrier...
|
|
|
|
*/
|
2005-10-21 15:22:44 +08:00
|
|
|
static inline void mapping_set_gfp_mask(struct address_space *m, gfp_t mask)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2005-10-21 15:22:44 +08:00
|
|
|
m->flags = (m->flags & ~(__force unsigned long)__GFP_BITS_MASK) |
|
|
|
|
(__force unsigned long)mask;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The page cache can done in larger chunks than
|
|
|
|
* one page, because it allows for more efficient
|
|
|
|
* throughput (it can then be mapped into user
|
|
|
|
* space in smaller chunks for same flexibility).
|
|
|
|
*
|
|
|
|
* Or rather, it _will_ be done in larger chunks.
|
|
|
|
*/
|
|
|
|
#define PAGE_CACHE_SHIFT PAGE_SHIFT
|
|
|
|
#define PAGE_CACHE_SIZE PAGE_SIZE
|
|
|
|
#define PAGE_CACHE_MASK PAGE_MASK
|
|
|
|
#define PAGE_CACHE_ALIGN(addr) (((addr)+PAGE_CACHE_SIZE-1)&PAGE_CACHE_MASK)
|
|
|
|
|
|
|
|
#define page_cache_get(page) get_page(page)
|
|
|
|
#define page_cache_release(page) put_page(page)
|
|
|
|
void release_pages(struct page **pages, int nr, int cold);
|
|
|
|
|
2006-03-24 19:16:04 +08:00
|
|
|
#ifdef CONFIG_NUMA
|
2006-10-29 01:38:23 +08:00
|
|
|
extern struct page *__page_cache_alloc(gfp_t gfp);
|
2006-03-24 19:16:04 +08:00
|
|
|
#else
|
2006-10-29 01:38:23 +08:00
|
|
|
static inline struct page *__page_cache_alloc(gfp_t gfp)
|
|
|
|
{
|
|
|
|
return alloc_pages(gfp, 0);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
static inline struct page *page_cache_alloc(struct address_space *x)
|
|
|
|
{
|
2006-10-29 01:38:23 +08:00
|
|
|
return __page_cache_alloc(mapping_gfp_mask(x));
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline struct page *page_cache_alloc_cold(struct address_space *x)
|
|
|
|
{
|
2006-10-29 01:38:23 +08:00
|
|
|
return __page_cache_alloc(mapping_gfp_mask(x)|__GFP_COLD);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
typedef int filler_t(void *, struct page *);
|
|
|
|
|
|
|
|
extern struct page * find_get_page(struct address_space *mapping,
|
2007-10-16 16:24:37 +08:00
|
|
|
pgoff_t index);
|
2005-04-17 06:20:36 +08:00
|
|
|
extern struct page * find_lock_page(struct address_space *mapping,
|
2007-10-16 16:24:37 +08:00
|
|
|
pgoff_t index);
|
2005-04-17 06:20:36 +08:00
|
|
|
extern struct page * find_or_create_page(struct address_space *mapping,
|
2007-10-16 16:24:37 +08:00
|
|
|
pgoff_t index, gfp_t gfp_mask);
|
2005-04-17 06:20:36 +08:00
|
|
|
unsigned find_get_pages(struct address_space *mapping, pgoff_t start,
|
|
|
|
unsigned int nr_pages, struct page **pages);
|
2006-04-27 14:46:01 +08:00
|
|
|
unsigned find_get_pages_contig(struct address_space *mapping, pgoff_t start,
|
|
|
|
unsigned int nr_pages, struct page **pages);
|
2005-04-17 06:20:36 +08:00
|
|
|
unsigned find_get_pages_tag(struct address_space *mapping, pgoff_t *index,
|
|
|
|
int tag, unsigned int nr_pages, struct page **pages);
|
|
|
|
|
2007-10-16 16:25:01 +08:00
|
|
|
struct page *__grab_cache_page(struct address_space *mapping, pgoff_t index);
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
* Returns locked page at given index in given cache, creating it if needed.
|
|
|
|
*/
|
2007-10-16 16:24:37 +08:00
|
|
|
static inline struct page *grab_cache_page(struct address_space *mapping,
|
|
|
|
pgoff_t index)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
return find_or_create_page(mapping, index, mapping_gfp_mask(mapping));
|
|
|
|
}
|
|
|
|
|
|
|
|
extern struct page * grab_cache_page_nowait(struct address_space *mapping,
|
2007-10-16 16:24:37 +08:00
|
|
|
pgoff_t index);
|
2007-05-07 05:49:04 +08:00
|
|
|
extern struct page * read_cache_page_async(struct address_space *mapping,
|
2007-10-16 16:24:37 +08:00
|
|
|
pgoff_t index, filler_t *filler,
|
2007-05-07 05:49:04 +08:00
|
|
|
void *data);
|
2005-04-17 06:20:36 +08:00
|
|
|
extern struct page * read_cache_page(struct address_space *mapping,
|
2007-10-16 16:24:37 +08:00
|
|
|
pgoff_t index, filler_t *filler,
|
2005-04-17 06:20:36 +08:00
|
|
|
void *data);
|
|
|
|
extern int read_cache_pages(struct address_space *mapping,
|
|
|
|
struct list_head *pages, filler_t *filler, void *data);
|
|
|
|
|
2007-05-07 05:49:04 +08:00
|
|
|
static inline struct page *read_mapping_page_async(
|
|
|
|
struct address_space *mapping,
|
2007-10-16 16:24:37 +08:00
|
|
|
pgoff_t index, void *data)
|
2007-05-07 05:49:04 +08:00
|
|
|
{
|
|
|
|
filler_t *filler = (filler_t *)mapping->a_ops->readpage;
|
|
|
|
return read_cache_page_async(mapping, index, filler, data);
|
|
|
|
}
|
|
|
|
|
2006-06-23 17:05:08 +08:00
|
|
|
static inline struct page *read_mapping_page(struct address_space *mapping,
|
2007-10-16 16:24:37 +08:00
|
|
|
pgoff_t index, void *data)
|
2006-06-23 17:05:08 +08:00
|
|
|
{
|
|
|
|
filler_t *filler = (filler_t *)mapping->a_ops->readpage;
|
|
|
|
return read_cache_page(mapping, index, filler, data);
|
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
int add_to_page_cache(struct page *page, struct address_space *mapping,
|
2007-10-16 16:24:37 +08:00
|
|
|
pgoff_t index, gfp_t gfp_mask);
|
2005-04-17 06:20:36 +08:00
|
|
|
int add_to_page_cache_lru(struct page *page, struct address_space *mapping,
|
2007-10-16 16:24:37 +08:00
|
|
|
pgoff_t index, gfp_t gfp_mask);
|
2005-04-17 06:20:36 +08:00
|
|
|
extern void remove_from_page_cache(struct page *page);
|
|
|
|
extern void __remove_from_page_cache(struct page *page);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return byte-offset into filesystem object for page.
|
|
|
|
*/
|
|
|
|
static inline loff_t page_offset(struct page *page)
|
|
|
|
{
|
|
|
|
return ((loff_t)page->index) << PAGE_CACHE_SHIFT;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline pgoff_t linear_page_index(struct vm_area_struct *vma,
|
|
|
|
unsigned long address)
|
|
|
|
{
|
|
|
|
pgoff_t pgoff = (address - vma->vm_start) >> PAGE_SHIFT;
|
|
|
|
pgoff += vma->vm_pgoff;
|
|
|
|
return pgoff >> (PAGE_CACHE_SHIFT - PAGE_SHIFT);
|
|
|
|
}
|
|
|
|
|
|
|
|
extern void FASTCALL(__lock_page(struct page *page));
|
2006-09-26 14:31:24 +08:00
|
|
|
extern void FASTCALL(__lock_page_nosync(struct page *page));
|
2005-04-17 06:20:36 +08:00
|
|
|
extern void FASTCALL(unlock_page(struct page *page));
|
|
|
|
|
2006-09-26 14:31:24 +08:00
|
|
|
/*
|
|
|
|
* lock_page may only be called if we have the page's inode pinned.
|
|
|
|
*/
|
2005-04-17 06:20:36 +08:00
|
|
|
static inline void lock_page(struct page *page)
|
|
|
|
{
|
|
|
|
might_sleep();
|
|
|
|
if (TestSetPageLocked(page))
|
|
|
|
__lock_page(page);
|
|
|
|
}
|
2006-09-26 14:31:24 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* lock_page_nosync should only be used if we can't pin the page's inode.
|
|
|
|
* Doesn't play quite so well with block device plugging.
|
|
|
|
*/
|
|
|
|
static inline void lock_page_nosync(struct page *page)
|
|
|
|
{
|
|
|
|
might_sleep();
|
|
|
|
if (TestSetPageLocked(page))
|
|
|
|
__lock_page_nosync(page);
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* This is exported only for wait_on_page_locked/wait_on_page_writeback.
|
|
|
|
* Never use this directly!
|
|
|
|
*/
|
|
|
|
extern void FASTCALL(wait_on_page_bit(struct page *page, int bit_nr));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Wait for a page to be unlocked.
|
|
|
|
*
|
|
|
|
* This must be called with the caller "holding" the page,
|
|
|
|
* ie with increased "page->count" so that the page won't
|
|
|
|
* go away during the wait..
|
|
|
|
*/
|
|
|
|
static inline void wait_on_page_locked(struct page *page)
|
|
|
|
{
|
|
|
|
if (PageLocked(page))
|
|
|
|
wait_on_page_bit(page, PG_locked);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Wait for a page to complete writeback
|
|
|
|
*/
|
|
|
|
static inline void wait_on_page_writeback(struct page *page)
|
|
|
|
{
|
|
|
|
if (PageWriteback(page))
|
|
|
|
wait_on_page_bit(page, PG_writeback);
|
|
|
|
}
|
|
|
|
|
|
|
|
extern void end_page_writeback(struct page *page);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Fault a userspace page into pagetables. Return non-zero on a fault.
|
|
|
|
*
|
|
|
|
* This assumes that two userspace pages are always sufficient. That's
|
|
|
|
* not true if PAGE_CACHE_SIZE > PAGE_SIZE.
|
|
|
|
*/
|
|
|
|
static inline int fault_in_pages_writeable(char __user *uaddr, int size)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
mm: fix pagecache write deadlocks
Modify the core write() code so that it won't take a pagefault while holding a
lock on the pagecache page. There are a number of different deadlocks possible
if we try to do such a thing:
1. generic_buffered_write
2. lock_page
3. prepare_write
4. unlock_page+vmtruncate
5. copy_from_user
6. mmap_sem(r)
7. handle_mm_fault
8. lock_page (filemap_nopage)
9. commit_write
10. unlock_page
a. sys_munmap / sys_mlock / others
b. mmap_sem(w)
c. make_pages_present
d. get_user_pages
e. handle_mm_fault
f. lock_page (filemap_nopage)
2,8 - recursive deadlock if page is same
2,8;2,8 - ABBA deadlock is page is different
2,6;b,f - ABBA deadlock if page is same
The solution is as follows:
1. If we find the destination page is uptodate, continue as normal, but use
atomic usercopies which do not take pagefaults and do not zero the uncopied
tail of the destination. The destination is already uptodate, so we can
commit_write the full length even if there was a partial copy: it does not
matter that the tail was not modified, because if it is dirtied and written
back to disk it will not cause any problems (uptodate *means* that the
destination page is as new or newer than the copy on disk).
1a. The above requires that fault_in_pages_readable correctly returns access
information, because atomic usercopies cannot distinguish between
non-present pages in a readable mapping, from lack of a readable mapping.
2. If we find the destination page is non uptodate, unlock it (this could be
made slightly more optimal), then allocate a temporary page to copy the
source data into. Relock the destination page and continue with the copy.
However, instead of a usercopy (which might take a fault), copy the data
from the pinned temporary page via the kernel address space.
(also, rename maxlen to seglen, because it was confusing)
This increases the CPU/memory copy cost by almost 50% on the affected
workloads. That will be solved by introducing a new set of pagecache write
aops in a subsequent patch.
Signed-off-by: Nick Piggin <npiggin@suse.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-10-16 16:24:59 +08:00
|
|
|
if (unlikely(size == 0))
|
|
|
|
return 0;
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
* Writing zeroes into userspace here is OK, because we know that if
|
|
|
|
* the zero gets there, we'll be overwriting it.
|
|
|
|
*/
|
|
|
|
ret = __put_user(0, uaddr);
|
|
|
|
if (ret == 0) {
|
|
|
|
char __user *end = uaddr + size - 1;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the page was already mapped, this will get a cache miss
|
|
|
|
* for sure, so try to avoid doing it.
|
|
|
|
*/
|
|
|
|
if (((unsigned long)uaddr & PAGE_MASK) !=
|
|
|
|
((unsigned long)end & PAGE_MASK))
|
|
|
|
ret = __put_user(0, end);
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
mm: fix pagecache write deadlocks
Modify the core write() code so that it won't take a pagefault while holding a
lock on the pagecache page. There are a number of different deadlocks possible
if we try to do such a thing:
1. generic_buffered_write
2. lock_page
3. prepare_write
4. unlock_page+vmtruncate
5. copy_from_user
6. mmap_sem(r)
7. handle_mm_fault
8. lock_page (filemap_nopage)
9. commit_write
10. unlock_page
a. sys_munmap / sys_mlock / others
b. mmap_sem(w)
c. make_pages_present
d. get_user_pages
e. handle_mm_fault
f. lock_page (filemap_nopage)
2,8 - recursive deadlock if page is same
2,8;2,8 - ABBA deadlock is page is different
2,6;b,f - ABBA deadlock if page is same
The solution is as follows:
1. If we find the destination page is uptodate, continue as normal, but use
atomic usercopies which do not take pagefaults and do not zero the uncopied
tail of the destination. The destination is already uptodate, so we can
commit_write the full length even if there was a partial copy: it does not
matter that the tail was not modified, because if it is dirtied and written
back to disk it will not cause any problems (uptodate *means* that the
destination page is as new or newer than the copy on disk).
1a. The above requires that fault_in_pages_readable correctly returns access
information, because atomic usercopies cannot distinguish between
non-present pages in a readable mapping, from lack of a readable mapping.
2. If we find the destination page is non uptodate, unlock it (this could be
made slightly more optimal), then allocate a temporary page to copy the
source data into. Relock the destination page and continue with the copy.
However, instead of a usercopy (which might take a fault), copy the data
from the pinned temporary page via the kernel address space.
(also, rename maxlen to seglen, because it was confusing)
This increases the CPU/memory copy cost by almost 50% on the affected
workloads. That will be solved by introducing a new set of pagecache write
aops in a subsequent patch.
Signed-off-by: Nick Piggin <npiggin@suse.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-10-16 16:24:59 +08:00
|
|
|
static inline int fault_in_pages_readable(const char __user *uaddr, int size)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
volatile char c;
|
|
|
|
int ret;
|
|
|
|
|
mm: fix pagecache write deadlocks
Modify the core write() code so that it won't take a pagefault while holding a
lock on the pagecache page. There are a number of different deadlocks possible
if we try to do such a thing:
1. generic_buffered_write
2. lock_page
3. prepare_write
4. unlock_page+vmtruncate
5. copy_from_user
6. mmap_sem(r)
7. handle_mm_fault
8. lock_page (filemap_nopage)
9. commit_write
10. unlock_page
a. sys_munmap / sys_mlock / others
b. mmap_sem(w)
c. make_pages_present
d. get_user_pages
e. handle_mm_fault
f. lock_page (filemap_nopage)
2,8 - recursive deadlock if page is same
2,8;2,8 - ABBA deadlock is page is different
2,6;b,f - ABBA deadlock if page is same
The solution is as follows:
1. If we find the destination page is uptodate, continue as normal, but use
atomic usercopies which do not take pagefaults and do not zero the uncopied
tail of the destination. The destination is already uptodate, so we can
commit_write the full length even if there was a partial copy: it does not
matter that the tail was not modified, because if it is dirtied and written
back to disk it will not cause any problems (uptodate *means* that the
destination page is as new or newer than the copy on disk).
1a. The above requires that fault_in_pages_readable correctly returns access
information, because atomic usercopies cannot distinguish between
non-present pages in a readable mapping, from lack of a readable mapping.
2. If we find the destination page is non uptodate, unlock it (this could be
made slightly more optimal), then allocate a temporary page to copy the
source data into. Relock the destination page and continue with the copy.
However, instead of a usercopy (which might take a fault), copy the data
from the pinned temporary page via the kernel address space.
(also, rename maxlen to seglen, because it was confusing)
This increases the CPU/memory copy cost by almost 50% on the affected
workloads. That will be solved by introducing a new set of pagecache write
aops in a subsequent patch.
Signed-off-by: Nick Piggin <npiggin@suse.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-10-16 16:24:59 +08:00
|
|
|
if (unlikely(size == 0))
|
|
|
|
return 0;
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
ret = __get_user(c, uaddr);
|
|
|
|
if (ret == 0) {
|
|
|
|
const char __user *end = uaddr + size - 1;
|
|
|
|
|
|
|
|
if (((unsigned long)uaddr & PAGE_MASK) !=
|
|
|
|
((unsigned long)end & PAGE_MASK))
|
mm: fix pagecache write deadlocks
Modify the core write() code so that it won't take a pagefault while holding a
lock on the pagecache page. There are a number of different deadlocks possible
if we try to do such a thing:
1. generic_buffered_write
2. lock_page
3. prepare_write
4. unlock_page+vmtruncate
5. copy_from_user
6. mmap_sem(r)
7. handle_mm_fault
8. lock_page (filemap_nopage)
9. commit_write
10. unlock_page
a. sys_munmap / sys_mlock / others
b. mmap_sem(w)
c. make_pages_present
d. get_user_pages
e. handle_mm_fault
f. lock_page (filemap_nopage)
2,8 - recursive deadlock if page is same
2,8;2,8 - ABBA deadlock is page is different
2,6;b,f - ABBA deadlock if page is same
The solution is as follows:
1. If we find the destination page is uptodate, continue as normal, but use
atomic usercopies which do not take pagefaults and do not zero the uncopied
tail of the destination. The destination is already uptodate, so we can
commit_write the full length even if there was a partial copy: it does not
matter that the tail was not modified, because if it is dirtied and written
back to disk it will not cause any problems (uptodate *means* that the
destination page is as new or newer than the copy on disk).
1a. The above requires that fault_in_pages_readable correctly returns access
information, because atomic usercopies cannot distinguish between
non-present pages in a readable mapping, from lack of a readable mapping.
2. If we find the destination page is non uptodate, unlock it (this could be
made slightly more optimal), then allocate a temporary page to copy the
source data into. Relock the destination page and continue with the copy.
However, instead of a usercopy (which might take a fault), copy the data
from the pinned temporary page via the kernel address space.
(also, rename maxlen to seglen, because it was confusing)
This increases the CPU/memory copy cost by almost 50% on the affected
workloads. That will be solved by introducing a new set of pagecache write
aops in a subsequent patch.
Signed-off-by: Nick Piggin <npiggin@suse.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-10-16 16:24:59 +08:00
|
|
|
ret = __get_user(c, end);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
mm: fix pagecache write deadlocks
Modify the core write() code so that it won't take a pagefault while holding a
lock on the pagecache page. There are a number of different deadlocks possible
if we try to do such a thing:
1. generic_buffered_write
2. lock_page
3. prepare_write
4. unlock_page+vmtruncate
5. copy_from_user
6. mmap_sem(r)
7. handle_mm_fault
8. lock_page (filemap_nopage)
9. commit_write
10. unlock_page
a. sys_munmap / sys_mlock / others
b. mmap_sem(w)
c. make_pages_present
d. get_user_pages
e. handle_mm_fault
f. lock_page (filemap_nopage)
2,8 - recursive deadlock if page is same
2,8;2,8 - ABBA deadlock is page is different
2,6;b,f - ABBA deadlock if page is same
The solution is as follows:
1. If we find the destination page is uptodate, continue as normal, but use
atomic usercopies which do not take pagefaults and do not zero the uncopied
tail of the destination. The destination is already uptodate, so we can
commit_write the full length even if there was a partial copy: it does not
matter that the tail was not modified, because if it is dirtied and written
back to disk it will not cause any problems (uptodate *means* that the
destination page is as new or newer than the copy on disk).
1a. The above requires that fault_in_pages_readable correctly returns access
information, because atomic usercopies cannot distinguish between
non-present pages in a readable mapping, from lack of a readable mapping.
2. If we find the destination page is non uptodate, unlock it (this could be
made slightly more optimal), then allocate a temporary page to copy the
source data into. Relock the destination page and continue with the copy.
However, instead of a usercopy (which might take a fault), copy the data
from the pinned temporary page via the kernel address space.
(also, rename maxlen to seglen, because it was confusing)
This increases the CPU/memory copy cost by almost 50% on the affected
workloads. That will be solved by introducing a new set of pagecache write
aops in a subsequent patch.
Signed-off-by: Nick Piggin <npiggin@suse.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-10-16 16:24:59 +08:00
|
|
|
return ret;
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* _LINUX_PAGEMAP_H */
|