2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* linux/mm/nommu.c
|
|
|
|
*
|
|
|
|
* Replacement code for mm functions to support CPU's that don't
|
|
|
|
* have any form of memory management unit (thus no virtual memory).
|
|
|
|
*
|
|
|
|
* See Documentation/nommu-mmap.txt
|
|
|
|
*
|
|
|
|
* Copyright (c) 2004-2005 David Howells <dhowells@redhat.com>
|
|
|
|
* Copyright (c) 2000-2003 David McCullough <davidm@snapgear.com>
|
|
|
|
* Copyright (c) 2000-2001 D Jeff Dionne <jeff@uClinux.org>
|
|
|
|
* Copyright (c) 2002 Greg Ungerer <gerg@snapgear.com>
|
2008-02-04 23:29:59 -07:00
|
|
|
* Copyright (c) 2007 Paul Mundt <lethal@linux-sh.org>
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
|
|
|
|
2007-10-29 07:15:39 -06:00
|
|
|
#include <linux/module.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/mman.h>
|
|
|
|
#include <linux/swap.h>
|
|
|
|
#include <linux/file.h>
|
|
|
|
#include <linux/highmem.h>
|
|
|
|
#include <linux/pagemap.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/vmalloc.h>
|
|
|
|
#include <linux/ptrace.h>
|
|
|
|
#include <linux/blkdev.h>
|
|
|
|
#include <linux/backing-dev.h>
|
|
|
|
#include <linux/mount.h>
|
|
|
|
#include <linux/personality.h>
|
|
|
|
#include <linux/security.h>
|
|
|
|
#include <linux/syscalls.h>
|
|
|
|
|
|
|
|
#include <asm/uaccess.h>
|
|
|
|
#include <asm/tlb.h>
|
|
|
|
#include <asm/tlbflush.h>
|
|
|
|
|
|
|
|
void *high_memory;
|
|
|
|
struct page *mem_map;
|
|
|
|
unsigned long max_mapnr;
|
|
|
|
unsigned long num_physpages;
|
|
|
|
unsigned long askedalloc, realalloc;
|
2008-05-23 14:04:31 -06:00
|
|
|
atomic_long_t vm_committed_space = ATOMIC_LONG_INIT(0);
|
2005-04-16 16:20:36 -06:00
|
|
|
int sysctl_overcommit_memory = OVERCOMMIT_GUESS; /* heuristic overcommit */
|
|
|
|
int sysctl_overcommit_ratio = 50; /* default is 50% */
|
|
|
|
int sysctl_max_map_count = DEFAULT_MAX_MAP_COUNT;
|
|
|
|
int heap_stack_gap = 0;
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(mem_map);
|
2007-04-12 00:28:47 -06:00
|
|
|
EXPORT_SYMBOL(num_physpages);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/* list of shareable VMAs */
|
|
|
|
struct rb_root nommu_vma_tree = RB_ROOT;
|
|
|
|
DECLARE_RWSEM(nommu_vma_sem);
|
|
|
|
|
|
|
|
struct vm_operations_struct generic_file_vm_ops = {
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Handle all mappings that got truncated by a "truncate()"
|
|
|
|
* system call.
|
|
|
|
*
|
|
|
|
* NOTE! We have to be ready to update the memory sharing
|
|
|
|
* between the file and the memory map for a potential last
|
|
|
|
* incomplete page. Ugly, but necessary.
|
|
|
|
*/
|
|
|
|
int vmtruncate(struct inode *inode, loff_t offset)
|
|
|
|
{
|
|
|
|
struct address_space *mapping = inode->i_mapping;
|
|
|
|
unsigned long limit;
|
|
|
|
|
|
|
|
if (inode->i_size < offset)
|
|
|
|
goto do_expand;
|
|
|
|
i_size_write(inode, offset);
|
|
|
|
|
|
|
|
truncate_inode_pages(mapping, offset);
|
|
|
|
goto out_truncate;
|
|
|
|
|
|
|
|
do_expand:
|
|
|
|
limit = current->signal->rlim[RLIMIT_FSIZE].rlim_cur;
|
|
|
|
if (limit != RLIM_INFINITY && offset > limit)
|
|
|
|
goto out_sig;
|
|
|
|
if (offset > inode->i_sb->s_maxbytes)
|
|
|
|
goto out;
|
|
|
|
i_size_write(inode, offset);
|
|
|
|
|
|
|
|
out_truncate:
|
|
|
|
if (inode->i_op && inode->i_op->truncate)
|
|
|
|
inode->i_op->truncate(inode);
|
|
|
|
return 0;
|
|
|
|
out_sig:
|
|
|
|
send_sig(SIGXFSZ, current, 0);
|
|
|
|
out:
|
|
|
|
return -EFBIG;
|
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(vmtruncate);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return the total memory allocated for this pointer, not
|
|
|
|
* just what the caller asked for.
|
|
|
|
*
|
|
|
|
* Doesn't have to be accurate, i.e. may have races.
|
|
|
|
*/
|
|
|
|
unsigned int kobjsize(const void *objp)
|
|
|
|
{
|
|
|
|
struct page *page;
|
|
|
|
|
2008-04-28 03:13:38 -06:00
|
|
|
/*
|
|
|
|
* If the object we have should not have ksize performed on it,
|
|
|
|
* return size of 0
|
|
|
|
*/
|
2008-06-12 01:29:55 -06:00
|
|
|
if (!objp || !virt_addr_valid(objp))
|
2008-06-05 23:46:08 -06:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
page = virt_to_head_page(objp);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the allocator sets PageSlab, we know the pointer came from
|
|
|
|
* kmalloc().
|
|
|
|
*/
|
2005-04-16 16:20:36 -06:00
|
|
|
if (PageSlab(page))
|
|
|
|
return ksize(objp);
|
|
|
|
|
2008-06-05 23:46:08 -06:00
|
|
|
/*
|
|
|
|
* The ksize() function is only guaranteed to work for pointers
|
2008-06-12 01:29:55 -06:00
|
|
|
* returned by kmalloc(). So handle arbitrary pointers here.
|
2008-06-05 23:46:08 -06:00
|
|
|
*/
|
2008-06-12 01:29:55 -06:00
|
|
|
return PAGE_SIZE << compound_order(page);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2006-09-27 02:50:18 -06:00
|
|
|
* get a list of pages in an address range belonging to the specified process
|
|
|
|
* and indicate the VMA that covers each page
|
|
|
|
* - this is potentially dodgy as we may end incrementing the page count of a
|
|
|
|
* slab page or a secondary page from a compound page
|
|
|
|
* - don't permit access to VMAs that don't support it, such as I/O mappings
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
|
|
|
int get_user_pages(struct task_struct *tsk, struct mm_struct *mm,
|
|
|
|
unsigned long start, int len, int write, int force,
|
|
|
|
struct page **pages, struct vm_area_struct **vmas)
|
|
|
|
{
|
2006-09-27 02:50:17 -06:00
|
|
|
struct vm_area_struct *vma;
|
2006-09-27 02:50:18 -06:00
|
|
|
unsigned long vm_flags;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* calculate required read or write permissions.
|
|
|
|
* - if 'force' is set, we only require the "MAY" flags.
|
|
|
|
*/
|
|
|
|
vm_flags = write ? (VM_WRITE | VM_MAYWRITE) : (VM_READ | VM_MAYREAD);
|
|
|
|
vm_flags &= force ? (VM_MAYREAD | VM_MAYWRITE) : (VM_READ | VM_WRITE);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
for (i = 0; i < len; i++) {
|
2006-09-27 02:50:17 -06:00
|
|
|
vma = find_vma(mm, start);
|
2006-09-27 02:50:18 -06:00
|
|
|
if (!vma)
|
|
|
|
goto finish_or_fault;
|
|
|
|
|
|
|
|
/* protect what we can, including chardevs */
|
|
|
|
if (vma->vm_flags & (VM_IO | VM_PFNMAP) ||
|
|
|
|
!(vm_flags & vma->vm_flags))
|
|
|
|
goto finish_or_fault;
|
2006-09-27 02:50:17 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
if (pages) {
|
|
|
|
pages[i] = virt_to_page(start);
|
|
|
|
if (pages[i])
|
|
|
|
page_cache_get(pages[i]);
|
|
|
|
}
|
|
|
|
if (vmas)
|
2006-09-27 02:50:17 -06:00
|
|
|
vmas[i] = vma;
|
2005-04-16 16:20:36 -06:00
|
|
|
start += PAGE_SIZE;
|
|
|
|
}
|
2006-09-27 02:50:18 -06:00
|
|
|
|
|
|
|
return i;
|
|
|
|
|
|
|
|
finish_or_fault:
|
|
|
|
return i ? : -EFAULT;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2005-09-11 19:18:10 -06:00
|
|
|
EXPORT_SYMBOL(get_user_pages);
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
DEFINE_RWLOCK(vmlist_lock);
|
|
|
|
struct vm_struct *vmlist;
|
|
|
|
|
2008-02-04 23:28:32 -07:00
|
|
|
void vfree(const void *addr)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
kfree(addr);
|
|
|
|
}
|
2007-07-21 05:37:25 -06:00
|
|
|
EXPORT_SYMBOL(vfree);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2005-10-07 00:46:04 -06:00
|
|
|
void *__vmalloc(unsigned long size, gfp_t gfp_mask, pgprot_t prot)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
/*
|
2007-10-19 15:11:38 -06:00
|
|
|
* You can't specify __GFP_HIGHMEM with kmalloc() since kmalloc()
|
|
|
|
* returns only a logical address.
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
2006-03-22 01:08:34 -07:00
|
|
|
return kmalloc(size, (gfp_mask | __GFP_COMP) & ~__GFP_HIGHMEM);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2007-07-21 05:37:25 -06:00
|
|
|
EXPORT_SYMBOL(__vmalloc);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2008-02-04 23:29:59 -07:00
|
|
|
void *vmalloc_user(unsigned long size)
|
|
|
|
{
|
|
|
|
void *ret;
|
|
|
|
|
|
|
|
ret = __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO,
|
|
|
|
PAGE_KERNEL);
|
|
|
|
if (ret) {
|
|
|
|
struct vm_area_struct *vma;
|
|
|
|
|
|
|
|
down_write(¤t->mm->mmap_sem);
|
|
|
|
vma = find_vma(current->mm, (unsigned long)ret);
|
|
|
|
if (vma)
|
|
|
|
vma->vm_flags |= VM_USERMAP;
|
|
|
|
up_write(¤t->mm->mmap_sem);
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(vmalloc_user);
|
|
|
|
|
2008-02-04 23:28:32 -07:00
|
|
|
struct page *vmalloc_to_page(const void *addr)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
return virt_to_page(addr);
|
|
|
|
}
|
2007-07-21 05:37:25 -06:00
|
|
|
EXPORT_SYMBOL(vmalloc_to_page);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2008-02-04 23:28:32 -07:00
|
|
|
unsigned long vmalloc_to_pfn(const void *addr)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
return page_to_pfn(virt_to_page(addr));
|
|
|
|
}
|
2007-07-21 05:37:25 -06:00
|
|
|
EXPORT_SYMBOL(vmalloc_to_pfn);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
long vread(char *buf, char *addr, unsigned long count)
|
|
|
|
{
|
|
|
|
memcpy(buf, addr, count);
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
|
|
|
long vwrite(char *buf, char *addr, unsigned long count)
|
|
|
|
{
|
|
|
|
/* Don't allow overflow */
|
|
|
|
if ((unsigned long) addr + count < count)
|
|
|
|
count = -(unsigned long) addr;
|
|
|
|
|
|
|
|
memcpy(addr, buf, count);
|
|
|
|
return(count);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* vmalloc - allocate virtually continguos memory
|
|
|
|
*
|
|
|
|
* @size: allocation size
|
|
|
|
*
|
|
|
|
* Allocate enough pages to cover @size from the page level
|
|
|
|
* allocator and map them into continguos kernel virtual space.
|
|
|
|
*
|
2006-10-03 15:21:02 -06:00
|
|
|
* For tight control over page level allocator and protection flags
|
2005-04-16 16:20:36 -06:00
|
|
|
* use __vmalloc() instead.
|
|
|
|
*/
|
|
|
|
void *vmalloc(unsigned long size)
|
|
|
|
{
|
|
|
|
return __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL);
|
|
|
|
}
|
2006-02-28 17:59:18 -07:00
|
|
|
EXPORT_SYMBOL(vmalloc);
|
|
|
|
|
|
|
|
void *vmalloc_node(unsigned long size, int node)
|
|
|
|
{
|
|
|
|
return vmalloc(size);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(vmalloc_node);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-07-21 05:37:25 -06:00
|
|
|
/**
|
|
|
|
* vmalloc_32 - allocate virtually contiguous memory (32bit addressable)
|
2005-04-16 16:20:36 -06:00
|
|
|
* @size: allocation size
|
|
|
|
*
|
|
|
|
* Allocate enough 32bit PA addressable pages to cover @size from the
|
|
|
|
* page level allocator and map them into continguos kernel virtual space.
|
|
|
|
*/
|
|
|
|
void *vmalloc_32(unsigned long size)
|
|
|
|
{
|
|
|
|
return __vmalloc(size, GFP_KERNEL, PAGE_KERNEL);
|
|
|
|
}
|
2007-07-21 05:37:25 -06:00
|
|
|
EXPORT_SYMBOL(vmalloc_32);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* vmalloc_32_user - allocate zeroed virtually contiguous 32bit memory
|
|
|
|
* @size: allocation size
|
|
|
|
*
|
|
|
|
* The resulting memory area is 32bit addressable and zeroed so it can be
|
|
|
|
* mapped to userspace without leaking data.
|
2008-02-04 23:29:59 -07:00
|
|
|
*
|
|
|
|
* VM_USERMAP is set on the corresponding VMA so that subsequent calls to
|
|
|
|
* remap_vmalloc_range() are permissible.
|
2007-07-21 05:37:25 -06:00
|
|
|
*/
|
|
|
|
void *vmalloc_32_user(unsigned long size)
|
|
|
|
{
|
2008-02-04 23:29:59 -07:00
|
|
|
/*
|
|
|
|
* We'll have to sort out the ZONE_DMA bits for 64-bit,
|
|
|
|
* but for now this can simply use vmalloc_user() directly.
|
|
|
|
*/
|
|
|
|
return vmalloc_user(size);
|
2007-07-21 05:37:25 -06:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(vmalloc_32_user);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
void *vmap(struct page **pages, unsigned int count, unsigned long flags, pgprot_t prot)
|
|
|
|
{
|
|
|
|
BUG();
|
|
|
|
return NULL;
|
|
|
|
}
|
2007-07-21 05:37:25 -06:00
|
|
|
EXPORT_SYMBOL(vmap);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2008-02-04 23:28:32 -07:00
|
|
|
void vunmap(const void *addr)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
BUG();
|
|
|
|
}
|
2007-07-21 05:37:25 -06:00
|
|
|
EXPORT_SYMBOL(vunmap);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-05-08 01:27:03 -06:00
|
|
|
/*
|
|
|
|
* Implement a stub for vmalloc_sync_all() if the architecture chose not to
|
|
|
|
* have one.
|
|
|
|
*/
|
|
|
|
void __attribute__((weak)) vmalloc_sync_all(void)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2007-07-21 05:37:25 -06:00
|
|
|
int vm_insert_page(struct vm_area_struct *vma, unsigned long addr,
|
|
|
|
struct page *page)
|
|
|
|
{
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(vm_insert_page);
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* sys_brk() for the most part doesn't need the global kernel
|
|
|
|
* lock, except when an application is doing something nasty
|
|
|
|
* like trying to un-brk an area that has already been mapped
|
|
|
|
* to a regular file. in this case, the unmapping will need
|
|
|
|
* to invoke file system routines that need the global lock.
|
|
|
|
*/
|
|
|
|
asmlinkage unsigned long sys_brk(unsigned long brk)
|
|
|
|
{
|
|
|
|
struct mm_struct *mm = current->mm;
|
|
|
|
|
|
|
|
if (brk < mm->start_brk || brk > mm->context.end_brk)
|
|
|
|
return mm->brk;
|
|
|
|
|
|
|
|
if (mm->brk == brk)
|
|
|
|
return mm->brk;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Always allow shrinking brk
|
|
|
|
*/
|
|
|
|
if (brk <= mm->brk) {
|
|
|
|
mm->brk = brk;
|
|
|
|
return brk;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Ok, looks good - let it rip.
|
|
|
|
*/
|
|
|
|
return mm->brk = brk;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
static void show_process_blocks(void)
|
|
|
|
{
|
|
|
|
struct vm_list_struct *vml;
|
|
|
|
|
|
|
|
printk("Process blocks %d:", current->pid);
|
|
|
|
|
|
|
|
for (vml = ¤t->mm->context.vmlist; vml; vml = vml->next) {
|
|
|
|
printk(" %p: %p", vml, vml->vma);
|
|
|
|
if (vml->vma)
|
|
|
|
printk(" (%d @%lx #%d)",
|
|
|
|
kobjsize((void *) vml->vma->vm_start),
|
|
|
|
vml->vma->vm_start,
|
|
|
|
atomic_read(&vml->vma->vm_usage));
|
|
|
|
printk(vml->next ? " ->" : ".\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* DEBUG */
|
|
|
|
|
2006-09-27 02:50:20 -06:00
|
|
|
/*
|
|
|
|
* add a VMA into a process's mm_struct in the appropriate place in the list
|
|
|
|
* - should be called with mm->mmap_sem held writelocked
|
|
|
|
*/
|
|
|
|
static void add_vma_to_mm(struct mm_struct *mm, struct vm_list_struct *vml)
|
|
|
|
{
|
|
|
|
struct vm_list_struct **ppv;
|
|
|
|
|
|
|
|
for (ppv = ¤t->mm->context.vmlist; *ppv; ppv = &(*ppv)->next)
|
|
|
|
if ((*ppv)->vma->vm_start > vml->vma->vm_start)
|
|
|
|
break;
|
|
|
|
|
|
|
|
vml->next = *ppv;
|
|
|
|
*ppv = vml;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* look up the first VMA in which addr resides, NULL if none
|
|
|
|
* - should be called with mm->mmap_sem at least held readlocked
|
|
|
|
*/
|
|
|
|
struct vm_area_struct *find_vma(struct mm_struct *mm, unsigned long addr)
|
|
|
|
{
|
|
|
|
struct vm_list_struct *loop, *vml;
|
|
|
|
|
|
|
|
/* search the vm_start ordered list */
|
|
|
|
vml = NULL;
|
|
|
|
for (loop = mm->context.vmlist; loop; loop = loop->next) {
|
|
|
|
if (loop->vma->vm_start > addr)
|
|
|
|
break;
|
|
|
|
vml = loop;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (vml && vml->vma->vm_end > addr)
|
|
|
|
return vml->vma;
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(find_vma);
|
|
|
|
|
[PATCH] NOMMU: Make futexes work under NOMMU conditions
Make futexes work under NOMMU conditions.
This can be tested by running this in one shell:
#define SYSERROR(X, Y) \
do { if ((long)(X) == -1L) { perror(Y); exit(1); }} while(0)
int main()
{
int shmid, tmp, *f, n;
shmid = shmget(23, 4, IPC_CREAT|0666);
SYSERROR(shmid, "shmget");
f = shmat(shmid, NULL, 0);
SYSERROR(f, "shmat");
n = *f;
printf("WAIT: %p{%x}\n", f, n);
tmp = futex(f, FUTEX_WAIT, n, NULL, NULL, 0);
SYSERROR(tmp, "futex");
printf("WAITED: %d\n", tmp);
tmp = shmdt(f);
SYSERROR(tmp, "shmdt");
exit(0);
}
And then this in the other shell:
#define SYSERROR(X, Y) \
do { if ((long)(X) == -1L) { perror(Y); exit(1); }} while(0)
int main()
{
int shmid, tmp, *f;
shmid = shmget(23, 4, IPC_CREAT|0666);
SYSERROR(shmid, "shmget");
f = shmat(shmid, NULL, 0);
SYSERROR(f, "shmat");
(*f)++;
printf("WAKE: %p{%x}\n", f, *f);
tmp = futex(f, FUTEX_WAKE, 1, NULL, NULL, 0);
SYSERROR(tmp, "futex");
printf("WOKE: %d\n", tmp);
tmp = shmdt(f);
SYSERROR(tmp, "shmdt");
exit(0);
}
The first program will set up a SYSV IPC SHM segment and wait on a futex in it
for the number at the start to change. The program will increment that number
and wake the first program up. This leads to output of the form:
SHELL 1 SHELL 2
======================= =======================
# /dowait
WAIT: 0xc32ac000{0}
# /dowake
WAKE: 0xc32ac000{1}
WAITED: 0 WOKE: 1
Signed-off-by: David Howells <dhowells@redhat.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-09-27 02:50:22 -06:00
|
|
|
/*
|
|
|
|
* find a VMA
|
|
|
|
* - we don't extend stack VMAs under NOMMU conditions
|
|
|
|
*/
|
|
|
|
struct vm_area_struct *find_extend_vma(struct mm_struct *mm, unsigned long addr)
|
|
|
|
{
|
|
|
|
return find_vma(mm, addr);
|
|
|
|
}
|
|
|
|
|
2007-07-16 00:38:28 -06:00
|
|
|
int expand_stack(struct vm_area_struct *vma, unsigned long address)
|
|
|
|
{
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
2006-09-27 02:50:21 -06:00
|
|
|
/*
|
|
|
|
* look up the first VMA exactly that exactly matches addr
|
|
|
|
* - should be called with mm->mmap_sem at least held readlocked
|
|
|
|
*/
|
|
|
|
static inline struct vm_area_struct *find_vma_exact(struct mm_struct *mm,
|
|
|
|
unsigned long addr)
|
|
|
|
{
|
|
|
|
struct vm_list_struct *vml;
|
|
|
|
|
|
|
|
/* search the vm_start ordered list */
|
|
|
|
for (vml = mm->context.vmlist; vml; vml = vml->next) {
|
|
|
|
if (vml->vma->vm_start == addr)
|
|
|
|
return vml->vma;
|
|
|
|
if (vml->vma->vm_start > addr)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2006-09-27 02:50:20 -06:00
|
|
|
/*
|
|
|
|
* find a VMA in the global tree
|
|
|
|
*/
|
2005-04-16 16:20:36 -06:00
|
|
|
static inline struct vm_area_struct *find_nommu_vma(unsigned long start)
|
|
|
|
{
|
|
|
|
struct vm_area_struct *vma;
|
|
|
|
struct rb_node *n = nommu_vma_tree.rb_node;
|
|
|
|
|
|
|
|
while (n) {
|
|
|
|
vma = rb_entry(n, struct vm_area_struct, vm_rb);
|
|
|
|
|
|
|
|
if (start < vma->vm_start)
|
|
|
|
n = n->rb_left;
|
|
|
|
else if (start > vma->vm_start)
|
|
|
|
n = n->rb_right;
|
|
|
|
else
|
|
|
|
return vma;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2006-09-27 02:50:20 -06:00
|
|
|
/*
|
|
|
|
* add a VMA in the global tree
|
|
|
|
*/
|
2005-04-16 16:20:36 -06:00
|
|
|
static void add_nommu_vma(struct vm_area_struct *vma)
|
|
|
|
{
|
|
|
|
struct vm_area_struct *pvma;
|
|
|
|
struct address_space *mapping;
|
|
|
|
struct rb_node **p = &nommu_vma_tree.rb_node;
|
|
|
|
struct rb_node *parent = NULL;
|
|
|
|
|
|
|
|
/* add the VMA to the mapping */
|
|
|
|
if (vma->vm_file) {
|
|
|
|
mapping = vma->vm_file->f_mapping;
|
|
|
|
|
|
|
|
flush_dcache_mmap_lock(mapping);
|
|
|
|
vma_prio_tree_insert(vma, &mapping->i_mmap);
|
|
|
|
flush_dcache_mmap_unlock(mapping);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* add the VMA to the master list */
|
|
|
|
while (*p) {
|
|
|
|
parent = *p;
|
|
|
|
pvma = rb_entry(parent, struct vm_area_struct, vm_rb);
|
|
|
|
|
|
|
|
if (vma->vm_start < pvma->vm_start) {
|
|
|
|
p = &(*p)->rb_left;
|
|
|
|
}
|
|
|
|
else if (vma->vm_start > pvma->vm_start) {
|
|
|
|
p = &(*p)->rb_right;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* mappings are at the same address - this can only
|
|
|
|
* happen for shared-mem chardevs and shared file
|
|
|
|
* mappings backed by ramfs/tmpfs */
|
|
|
|
BUG_ON(!(pvma->vm_flags & VM_SHARED));
|
|
|
|
|
|
|
|
if (vma < pvma)
|
|
|
|
p = &(*p)->rb_left;
|
|
|
|
else if (vma > pvma)
|
|
|
|
p = &(*p)->rb_right;
|
|
|
|
else
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
rb_link_node(&vma->vm_rb, parent, p);
|
|
|
|
rb_insert_color(&vma->vm_rb, &nommu_vma_tree);
|
|
|
|
}
|
|
|
|
|
2006-09-27 02:50:20 -06:00
|
|
|
/*
|
|
|
|
* delete a VMA from the global list
|
|
|
|
*/
|
2005-04-16 16:20:36 -06:00
|
|
|
static void delete_nommu_vma(struct vm_area_struct *vma)
|
|
|
|
{
|
|
|
|
struct address_space *mapping;
|
|
|
|
|
|
|
|
/* remove the VMA from the mapping */
|
|
|
|
if (vma->vm_file) {
|
|
|
|
mapping = vma->vm_file->f_mapping;
|
|
|
|
|
|
|
|
flush_dcache_mmap_lock(mapping);
|
|
|
|
vma_prio_tree_remove(vma, &mapping->i_mmap);
|
|
|
|
flush_dcache_mmap_unlock(mapping);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* remove from the master list */
|
|
|
|
rb_erase(&vma->vm_rb, &nommu_vma_tree);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* determine whether a mapping should be permitted and, if so, what sort of
|
|
|
|
* mapping we're capable of supporting
|
|
|
|
*/
|
|
|
|
static int validate_mmap_request(struct file *file,
|
|
|
|
unsigned long addr,
|
|
|
|
unsigned long len,
|
|
|
|
unsigned long prot,
|
|
|
|
unsigned long flags,
|
|
|
|
unsigned long pgoff,
|
|
|
|
unsigned long *_capabilities)
|
|
|
|
{
|
|
|
|
unsigned long capabilities;
|
|
|
|
unsigned long reqprot = prot;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
/* do the simple checks first */
|
|
|
|
if (flags & MAP_FIXED || addr) {
|
|
|
|
printk(KERN_DEBUG
|
|
|
|
"%d: Can't do fixed-address/overlay mmap of RAM\n",
|
|
|
|
current->pid);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((flags & MAP_TYPE) != MAP_PRIVATE &&
|
|
|
|
(flags & MAP_TYPE) != MAP_SHARED)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2006-12-05 19:02:59 -07:00
|
|
|
if (!len)
|
2005-04-16 16:20:36 -06:00
|
|
|
return -EINVAL;
|
|
|
|
|
2006-12-05 19:02:59 -07:00
|
|
|
/* Careful about overflows.. */
|
|
|
|
len = PAGE_ALIGN(len);
|
|
|
|
if (!len || len > TASK_SIZE)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/* offset overflow? */
|
|
|
|
if ((pgoff + (len >> PAGE_SHIFT)) < pgoff)
|
2006-12-05 19:02:59 -07:00
|
|
|
return -EOVERFLOW;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
if (file) {
|
|
|
|
/* validate file mapping requests */
|
|
|
|
struct address_space *mapping;
|
|
|
|
|
|
|
|
/* files must support mmap */
|
|
|
|
if (!file->f_op || !file->f_op->mmap)
|
|
|
|
return -ENODEV;
|
|
|
|
|
|
|
|
/* work out if what we've got could possibly be shared
|
|
|
|
* - we support chardevs that provide their own "memory"
|
|
|
|
* - we support files/blockdevs that are memory backed
|
|
|
|
*/
|
|
|
|
mapping = file->f_mapping;
|
|
|
|
if (!mapping)
|
2006-12-08 03:37:21 -07:00
|
|
|
mapping = file->f_path.dentry->d_inode->i_mapping;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
capabilities = 0;
|
|
|
|
if (mapping && mapping->backing_dev_info)
|
|
|
|
capabilities = mapping->backing_dev_info->capabilities;
|
|
|
|
|
|
|
|
if (!capabilities) {
|
|
|
|
/* no explicit capabilities set, so assume some
|
|
|
|
* defaults */
|
2006-12-08 03:37:21 -07:00
|
|
|
switch (file->f_path.dentry->d_inode->i_mode & S_IFMT) {
|
2005-04-16 16:20:36 -06:00
|
|
|
case S_IFREG:
|
|
|
|
case S_IFBLK:
|
|
|
|
capabilities = BDI_CAP_MAP_COPY;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case S_IFCHR:
|
|
|
|
capabilities =
|
|
|
|
BDI_CAP_MAP_DIRECT |
|
|
|
|
BDI_CAP_READ_MAP |
|
|
|
|
BDI_CAP_WRITE_MAP;
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* eliminate any capabilities that we can't support on this
|
|
|
|
* device */
|
|
|
|
if (!file->f_op->get_unmapped_area)
|
|
|
|
capabilities &= ~BDI_CAP_MAP_DIRECT;
|
|
|
|
if (!file->f_op->read)
|
|
|
|
capabilities &= ~BDI_CAP_MAP_COPY;
|
|
|
|
|
|
|
|
if (flags & MAP_SHARED) {
|
|
|
|
/* do checks for writing, appending and locking */
|
|
|
|
if ((prot & PROT_WRITE) &&
|
|
|
|
!(file->f_mode & FMODE_WRITE))
|
|
|
|
return -EACCES;
|
|
|
|
|
2006-12-08 03:37:21 -07:00
|
|
|
if (IS_APPEND(file->f_path.dentry->d_inode) &&
|
2005-04-16 16:20:36 -06:00
|
|
|
(file->f_mode & FMODE_WRITE))
|
|
|
|
return -EACCES;
|
|
|
|
|
2006-12-08 03:37:21 -07:00
|
|
|
if (locks_verify_locked(file->f_path.dentry->d_inode))
|
2005-04-16 16:20:36 -06:00
|
|
|
return -EAGAIN;
|
|
|
|
|
|
|
|
if (!(capabilities & BDI_CAP_MAP_DIRECT))
|
|
|
|
return -ENODEV;
|
|
|
|
|
|
|
|
if (((prot & PROT_READ) && !(capabilities & BDI_CAP_READ_MAP)) ||
|
|
|
|
((prot & PROT_WRITE) && !(capabilities & BDI_CAP_WRITE_MAP)) ||
|
|
|
|
((prot & PROT_EXEC) && !(capabilities & BDI_CAP_EXEC_MAP))
|
|
|
|
) {
|
|
|
|
printk("MAP_SHARED not completely supported on !MMU\n");
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* we mustn't privatise shared mappings */
|
|
|
|
capabilities &= ~BDI_CAP_MAP_COPY;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* we're going to read the file into private memory we
|
|
|
|
* allocate */
|
|
|
|
if (!(capabilities & BDI_CAP_MAP_COPY))
|
|
|
|
return -ENODEV;
|
|
|
|
|
|
|
|
/* we don't permit a private writable mapping to be
|
|
|
|
* shared with the backing device */
|
|
|
|
if (prot & PROT_WRITE)
|
|
|
|
capabilities &= ~BDI_CAP_MAP_DIRECT;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* handle executable mappings and implied executable
|
|
|
|
* mappings */
|
2006-12-08 03:37:21 -07:00
|
|
|
if (file->f_path.mnt->mnt_flags & MNT_NOEXEC) {
|
2005-04-16 16:20:36 -06:00
|
|
|
if (prot & PROT_EXEC)
|
|
|
|
return -EPERM;
|
|
|
|
}
|
|
|
|
else if ((prot & PROT_READ) && !(prot & PROT_EXEC)) {
|
|
|
|
/* handle implication of PROT_EXEC by PROT_READ */
|
|
|
|
if (current->personality & READ_IMPLIES_EXEC) {
|
|
|
|
if (capabilities & BDI_CAP_EXEC_MAP)
|
|
|
|
prot |= PROT_EXEC;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if ((prot & PROT_READ) &&
|
|
|
|
(prot & PROT_EXEC) &&
|
|
|
|
!(capabilities & BDI_CAP_EXEC_MAP)
|
|
|
|
) {
|
|
|
|
/* backing file is not executable, try to copy */
|
|
|
|
capabilities &= ~BDI_CAP_MAP_DIRECT;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* anonymous mappings are always memory backed and can be
|
|
|
|
* privately mapped
|
|
|
|
*/
|
|
|
|
capabilities = BDI_CAP_MAP_COPY;
|
|
|
|
|
|
|
|
/* handle PROT_EXEC implication by PROT_READ */
|
|
|
|
if ((prot & PROT_READ) &&
|
|
|
|
(current->personality & READ_IMPLIES_EXEC))
|
|
|
|
prot |= PROT_EXEC;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* allow the security API to have its say */
|
2007-06-28 13:55:21 -06:00
|
|
|
ret = security_file_mmap(file, reqprot, prot, flags, addr, 0);
|
2005-04-16 16:20:36 -06:00
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
/* looks okay */
|
|
|
|
*_capabilities = capabilities;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* we've determined that we can make the mapping, now translate what we
|
|
|
|
* now know into VMA flags
|
|
|
|
*/
|
|
|
|
static unsigned long determine_vm_flags(struct file *file,
|
|
|
|
unsigned long prot,
|
|
|
|
unsigned long flags,
|
|
|
|
unsigned long capabilities)
|
|
|
|
{
|
|
|
|
unsigned long vm_flags;
|
|
|
|
|
|
|
|
vm_flags = calc_vm_prot_bits(prot) | calc_vm_flag_bits(flags);
|
|
|
|
vm_flags |= VM_MAYREAD | VM_MAYWRITE | VM_MAYEXEC;
|
|
|
|
/* vm_flags |= mm->def_flags; */
|
|
|
|
|
|
|
|
if (!(capabilities & BDI_CAP_MAP_DIRECT)) {
|
|
|
|
/* attempt to share read-only copies of mapped file chunks */
|
|
|
|
if (file && !(prot & PROT_WRITE))
|
|
|
|
vm_flags |= VM_MAYSHARE;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* overlay a shareable mapping on the backing device or inode
|
|
|
|
* if possible - used for chardevs, ramfs/tmpfs/shmfs and
|
|
|
|
* romfs/cramfs */
|
|
|
|
if (flags & MAP_SHARED)
|
|
|
|
vm_flags |= VM_MAYSHARE | VM_SHARED;
|
|
|
|
else if ((((vm_flags & capabilities) ^ vm_flags) & BDI_CAP_VMFLAGS) == 0)
|
|
|
|
vm_flags |= VM_MAYSHARE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* refuse to let anyone share private mappings with this process if
|
|
|
|
* it's being traced - otherwise breakpoints set in it may interfere
|
|
|
|
* with another untraced process
|
|
|
|
*/
|
|
|
|
if ((flags & MAP_PRIVATE) && (current->ptrace & PT_PTRACED))
|
|
|
|
vm_flags &= ~VM_MAYSHARE;
|
|
|
|
|
|
|
|
return vm_flags;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* set up a shared mapping on a file
|
|
|
|
*/
|
|
|
|
static int do_mmap_shared_file(struct vm_area_struct *vma, unsigned long len)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = vma->vm_file->f_op->mmap(vma->vm_file, vma);
|
|
|
|
if (ret != -ENOSYS)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
/* getting an ENOSYS error indicates that direct mmap isn't
|
|
|
|
* possible (as opposed to tried but failed) so we'll fall
|
|
|
|
* through to making a private copy of the data and mapping
|
|
|
|
* that if we can */
|
|
|
|
return -ENODEV;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* set up a private mapping or an anonymous shared mapping
|
|
|
|
*/
|
|
|
|
static int do_mmap_private(struct vm_area_struct *vma, unsigned long len)
|
|
|
|
{
|
|
|
|
void *base;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
/* invoke the file's mapping function so that it can keep track of
|
|
|
|
* shared mappings on devices or memory
|
|
|
|
* - VM_MAYSHARE will be set if it may attempt to share
|
|
|
|
*/
|
|
|
|
if (vma->vm_file) {
|
|
|
|
ret = vma->vm_file->f_op->mmap(vma->vm_file, vma);
|
|
|
|
if (ret != -ENOSYS) {
|
|
|
|
/* shouldn't return success if we're not sharing */
|
|
|
|
BUG_ON(ret == 0 && !(vma->vm_flags & VM_MAYSHARE));
|
|
|
|
return ret; /* success or a real error */
|
|
|
|
}
|
|
|
|
|
|
|
|
/* getting an ENOSYS error indicates that direct mmap isn't
|
|
|
|
* possible (as opposed to tried but failed) so we'll try to
|
|
|
|
* make a private copy of the data and map that instead */
|
|
|
|
}
|
|
|
|
|
|
|
|
/* allocate some memory to hold the mapping
|
|
|
|
* - note that this may not return a page-aligned address if the object
|
|
|
|
* we're allocating is smaller than a page
|
|
|
|
*/
|
2006-03-22 01:08:34 -07:00
|
|
|
base = kmalloc(len, GFP_KERNEL|__GFP_COMP);
|
2005-04-16 16:20:36 -06:00
|
|
|
if (!base)
|
|
|
|
goto enomem;
|
|
|
|
|
|
|
|
vma->vm_start = (unsigned long) base;
|
|
|
|
vma->vm_end = vma->vm_start + len;
|
|
|
|
vma->vm_flags |= VM_MAPPED_COPY;
|
|
|
|
|
|
|
|
#ifdef WARN_ON_SLACK
|
|
|
|
if (len + WARN_ON_SLACK <= kobjsize(result))
|
|
|
|
printk("Allocation of %lu bytes from process %d has %lu bytes of slack\n",
|
|
|
|
len, current->pid, kobjsize(result) - len);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (vma->vm_file) {
|
|
|
|
/* read the contents of a file into the copy */
|
|
|
|
mm_segment_t old_fs;
|
|
|
|
loff_t fpos;
|
|
|
|
|
|
|
|
fpos = vma->vm_pgoff;
|
|
|
|
fpos <<= PAGE_SHIFT;
|
|
|
|
|
|
|
|
old_fs = get_fs();
|
|
|
|
set_fs(KERNEL_DS);
|
|
|
|
ret = vma->vm_file->f_op->read(vma->vm_file, base, len, &fpos);
|
|
|
|
set_fs(old_fs);
|
|
|
|
|
|
|
|
if (ret < 0)
|
|
|
|
goto error_free;
|
|
|
|
|
|
|
|
/* clear the last little bit */
|
|
|
|
if (ret < len)
|
|
|
|
memset(base + ret, 0, len - ret);
|
|
|
|
|
|
|
|
} else {
|
|
|
|
/* if it's an anonymous mapping, then just clear it */
|
|
|
|
memset(base, 0, len);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
error_free:
|
|
|
|
kfree(base);
|
|
|
|
vma->vm_start = 0;
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
enomem:
|
|
|
|
printk("Allocation of length %lu from process %d failed\n",
|
|
|
|
len, current->pid);
|
|
|
|
show_free_areas();
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* handle mapping creation for uClinux
|
|
|
|
*/
|
|
|
|
unsigned long do_mmap_pgoff(struct file *file,
|
|
|
|
unsigned long addr,
|
|
|
|
unsigned long len,
|
|
|
|
unsigned long prot,
|
|
|
|
unsigned long flags,
|
|
|
|
unsigned long pgoff)
|
|
|
|
{
|
|
|
|
struct vm_list_struct *vml = NULL;
|
|
|
|
struct vm_area_struct *vma = NULL;
|
|
|
|
struct rb_node *rb;
|
|
|
|
unsigned long capabilities, vm_flags;
|
|
|
|
void *result;
|
|
|
|
int ret;
|
|
|
|
|
2007-11-26 16:47:40 -07:00
|
|
|
if (!(flags & MAP_FIXED))
|
|
|
|
addr = round_hint_to_min(addr);
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/* decide whether we should attempt the mapping, and if so what sort of
|
|
|
|
* mapping */
|
|
|
|
ret = validate_mmap_request(file, addr, len, prot, flags, pgoff,
|
|
|
|
&capabilities);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
/* we've determined that we can make the mapping, now translate what we
|
|
|
|
* now know into VMA flags */
|
|
|
|
vm_flags = determine_vm_flags(file, prot, flags, capabilities);
|
|
|
|
|
|
|
|
/* we're going to need to record the mapping if it works */
|
2006-12-06 21:38:51 -07:00
|
|
|
vml = kzalloc(sizeof(struct vm_list_struct), GFP_KERNEL);
|
2005-04-16 16:20:36 -06:00
|
|
|
if (!vml)
|
|
|
|
goto error_getting_vml;
|
|
|
|
|
|
|
|
down_write(&nommu_vma_sem);
|
|
|
|
|
|
|
|
/* if we want to share, we need to check for VMAs created by other
|
|
|
|
* mmap() calls that overlap with our proposed mapping
|
|
|
|
* - we can only share with an exact match on most regular files
|
|
|
|
* - shared mappings on character devices and memory backed files are
|
|
|
|
* permitted to overlap inexactly as far as we are concerned for in
|
|
|
|
* these cases, sharing is handled in the driver or filesystem rather
|
|
|
|
* than here
|
|
|
|
*/
|
|
|
|
if (vm_flags & VM_MAYSHARE) {
|
|
|
|
unsigned long pglen = (len + PAGE_SIZE - 1) >> PAGE_SHIFT;
|
|
|
|
unsigned long vmpglen;
|
|
|
|
|
2007-03-22 02:11:24 -06:00
|
|
|
/* suppress VMA sharing for shared regions */
|
|
|
|
if (vm_flags & VM_SHARED &&
|
|
|
|
capabilities & BDI_CAP_MAP_DIRECT)
|
|
|
|
goto dont_share_VMAs;
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
for (rb = rb_first(&nommu_vma_tree); rb; rb = rb_next(rb)) {
|
|
|
|
vma = rb_entry(rb, struct vm_area_struct, vm_rb);
|
|
|
|
|
|
|
|
if (!(vma->vm_flags & VM_MAYSHARE))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* search for overlapping mappings on the same file */
|
2006-12-08 03:37:21 -07:00
|
|
|
if (vma->vm_file->f_path.dentry->d_inode != file->f_path.dentry->d_inode)
|
2005-04-16 16:20:36 -06:00
|
|
|
continue;
|
|
|
|
|
|
|
|
if (vma->vm_pgoff >= pgoff + pglen)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
vmpglen = vma->vm_end - vma->vm_start + PAGE_SIZE - 1;
|
|
|
|
vmpglen >>= PAGE_SHIFT;
|
|
|
|
if (pgoff >= vma->vm_pgoff + vmpglen)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* handle inexactly overlapping matches between mappings */
|
|
|
|
if (vma->vm_pgoff != pgoff || vmpglen != pglen) {
|
|
|
|
if (!(capabilities & BDI_CAP_MAP_DIRECT))
|
|
|
|
goto sharing_violation;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* we've found a VMA we can share */
|
|
|
|
atomic_inc(&vma->vm_usage);
|
|
|
|
|
|
|
|
vml->vma = vma;
|
|
|
|
result = (void *) vma->vm_start;
|
|
|
|
goto shared;
|
|
|
|
}
|
|
|
|
|
2007-03-22 02:11:24 -06:00
|
|
|
dont_share_VMAs:
|
2005-04-16 16:20:36 -06:00
|
|
|
vma = NULL;
|
|
|
|
|
|
|
|
/* obtain the address at which to make a shared mapping
|
|
|
|
* - this is the hook for quasi-memory character devices to
|
|
|
|
* tell us the location of a shared mapping
|
|
|
|
*/
|
|
|
|
if (file && file->f_op->get_unmapped_area) {
|
|
|
|
addr = file->f_op->get_unmapped_area(file, addr, len,
|
|
|
|
pgoff, flags);
|
|
|
|
if (IS_ERR((void *) addr)) {
|
|
|
|
ret = addr;
|
|
|
|
if (ret != (unsigned long) -ENOSYS)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
/* the driver refused to tell us where to site
|
|
|
|
* the mapping so we'll have to attempt to copy
|
|
|
|
* it */
|
|
|
|
ret = (unsigned long) -ENODEV;
|
|
|
|
if (!(capabilities & BDI_CAP_MAP_COPY))
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
capabilities &= ~BDI_CAP_MAP_DIRECT;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* we're going to need a VMA struct as well */
|
2006-12-06 21:38:51 -07:00
|
|
|
vma = kzalloc(sizeof(struct vm_area_struct), GFP_KERNEL);
|
2005-04-16 16:20:36 -06:00
|
|
|
if (!vma)
|
|
|
|
goto error_getting_vma;
|
|
|
|
|
|
|
|
INIT_LIST_HEAD(&vma->anon_vma_node);
|
|
|
|
atomic_set(&vma->vm_usage, 1);
|
2008-04-29 02:01:36 -06:00
|
|
|
if (file) {
|
2005-04-16 16:20:36 -06:00
|
|
|
get_file(file);
|
2008-04-29 02:01:36 -06:00
|
|
|
if (vm_flags & VM_EXECUTABLE) {
|
|
|
|
added_exe_file_vma(current->mm);
|
|
|
|
vma->vm_mm = current->mm;
|
|
|
|
}
|
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
vma->vm_file = file;
|
|
|
|
vma->vm_flags = vm_flags;
|
|
|
|
vma->vm_start = addr;
|
|
|
|
vma->vm_end = addr + len;
|
|
|
|
vma->vm_pgoff = pgoff;
|
|
|
|
|
|
|
|
vml->vma = vma;
|
|
|
|
|
|
|
|
/* set up the mapping */
|
|
|
|
if (file && vma->vm_flags & VM_SHARED)
|
|
|
|
ret = do_mmap_shared_file(vma, len);
|
|
|
|
else
|
|
|
|
ret = do_mmap_private(vma, len);
|
|
|
|
if (ret < 0)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
/* okay... we have a mapping; now we have to register it */
|
|
|
|
result = (void *) vma->vm_start;
|
|
|
|
|
|
|
|
if (vma->vm_flags & VM_MAPPED_COPY) {
|
|
|
|
realalloc += kobjsize(result);
|
|
|
|
askedalloc += len;
|
|
|
|
}
|
|
|
|
|
|
|
|
realalloc += kobjsize(vma);
|
|
|
|
askedalloc += sizeof(*vma);
|
|
|
|
|
|
|
|
current->mm->total_vm += len >> PAGE_SHIFT;
|
|
|
|
|
|
|
|
add_nommu_vma(vma);
|
|
|
|
|
|
|
|
shared:
|
|
|
|
realalloc += kobjsize(vml);
|
|
|
|
askedalloc += sizeof(*vml);
|
|
|
|
|
2006-09-27 02:50:20 -06:00
|
|
|
add_vma_to_mm(current->mm, vml);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
up_write(&nommu_vma_sem);
|
|
|
|
|
|
|
|
if (prot & PROT_EXEC)
|
|
|
|
flush_icache_range((unsigned long) result,
|
|
|
|
(unsigned long) result + len);
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
printk("do_mmap:\n");
|
|
|
|
show_process_blocks();
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return (unsigned long) result;
|
|
|
|
|
|
|
|
error:
|
|
|
|
up_write(&nommu_vma_sem);
|
|
|
|
kfree(vml);
|
|
|
|
if (vma) {
|
2008-04-29 02:01:36 -06:00
|
|
|
if (vma->vm_file) {
|
2006-10-01 00:27:01 -06:00
|
|
|
fput(vma->vm_file);
|
2008-04-29 02:01:36 -06:00
|
|
|
if (vma->vm_flags & VM_EXECUTABLE)
|
|
|
|
removed_exe_file_vma(vma->vm_mm);
|
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
kfree(vma);
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
sharing_violation:
|
|
|
|
up_write(&nommu_vma_sem);
|
|
|
|
printk("Attempt to share mismatched mappings\n");
|
|
|
|
kfree(vml);
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
error_getting_vma:
|
|
|
|
up_write(&nommu_vma_sem);
|
|
|
|
kfree(vml);
|
2005-09-11 19:18:10 -06:00
|
|
|
printk("Allocation of vma for %lu byte allocation from process %d failed\n",
|
2005-04-16 16:20:36 -06:00
|
|
|
len, current->pid);
|
|
|
|
show_free_areas();
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
error_getting_vml:
|
|
|
|
printk("Allocation of vml for %lu byte allocation from process %d failed\n",
|
|
|
|
len, current->pid);
|
|
|
|
show_free_areas();
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
2007-07-21 05:37:25 -06:00
|
|
|
EXPORT_SYMBOL(do_mmap_pgoff);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* handle mapping disposal for uClinux
|
|
|
|
*/
|
2008-04-29 02:01:36 -06:00
|
|
|
static void put_vma(struct mm_struct *mm, struct vm_area_struct *vma)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
if (vma) {
|
|
|
|
down_write(&nommu_vma_sem);
|
|
|
|
|
|
|
|
if (atomic_dec_and_test(&vma->vm_usage)) {
|
|
|
|
delete_nommu_vma(vma);
|
|
|
|
|
|
|
|
if (vma->vm_ops && vma->vm_ops->close)
|
|
|
|
vma->vm_ops->close(vma);
|
|
|
|
|
|
|
|
/* IO memory and memory shared directly out of the pagecache from
|
|
|
|
* ramfs/tmpfs mustn't be released here */
|
|
|
|
if (vma->vm_flags & VM_MAPPED_COPY) {
|
|
|
|
realalloc -= kobjsize((void *) vma->vm_start);
|
|
|
|
askedalloc -= vma->vm_end - vma->vm_start;
|
|
|
|
kfree((void *) vma->vm_start);
|
|
|
|
}
|
|
|
|
|
|
|
|
realalloc -= kobjsize(vma);
|
|
|
|
askedalloc -= sizeof(*vma);
|
|
|
|
|
2008-04-29 02:01:36 -06:00
|
|
|
if (vma->vm_file) {
|
2005-04-16 16:20:36 -06:00
|
|
|
fput(vma->vm_file);
|
2008-04-29 02:01:36 -06:00
|
|
|
if (vma->vm_flags & VM_EXECUTABLE)
|
|
|
|
removed_exe_file_vma(mm);
|
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
kfree(vma);
|
|
|
|
}
|
|
|
|
|
|
|
|
up_write(&nommu_vma_sem);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-09-27 02:50:20 -06:00
|
|
|
/*
|
|
|
|
* release a mapping
|
|
|
|
* - under NOMMU conditions the parameters must match exactly to the mapping to
|
|
|
|
* be removed
|
|
|
|
*/
|
2005-04-16 16:20:36 -06:00
|
|
|
int do_munmap(struct mm_struct *mm, unsigned long addr, size_t len)
|
|
|
|
{
|
|
|
|
struct vm_list_struct *vml, **parent;
|
|
|
|
unsigned long end = addr + len;
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
printk("do_munmap:\n");
|
|
|
|
#endif
|
|
|
|
|
2006-09-27 02:50:20 -06:00
|
|
|
for (parent = &mm->context.vmlist; *parent; parent = &(*parent)->next) {
|
|
|
|
if ((*parent)->vma->vm_start > addr)
|
|
|
|
break;
|
2005-04-16 16:20:36 -06:00
|
|
|
if ((*parent)->vma->vm_start == addr &&
|
2005-09-11 19:18:10 -06:00
|
|
|
((len == 0) || ((*parent)->vma->vm_end == end)))
|
2005-04-16 16:20:36 -06:00
|
|
|
goto found;
|
2006-09-27 02:50:20 -06:00
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
printk("munmap of non-mmaped memory by process %d (%s): %p\n",
|
|
|
|
current->pid, current->comm, (void *) addr);
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
found:
|
|
|
|
vml = *parent;
|
|
|
|
|
2008-04-29 02:01:36 -06:00
|
|
|
put_vma(mm, vml->vma);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
*parent = vml->next;
|
|
|
|
realalloc -= kobjsize(vml);
|
|
|
|
askedalloc -= sizeof(*vml);
|
|
|
|
kfree(vml);
|
[PATCH] mm: update_hiwaters just in time
update_mem_hiwater has attracted various criticisms, in particular from those
concerned with mm scalability. Originally it was called whenever rss or
total_vm got raised. Then many of those callsites were replaced by a timer
tick call from account_system_time. Now Frank van Maarseveen reports that to
be found inadequate. How about this? Works for Frank.
Replace update_mem_hiwater, a poor combination of two unrelated ops, by macros
update_hiwater_rss and update_hiwater_vm. Don't attempt to keep
mm->hiwater_rss up to date at timer tick, nor every time we raise rss (usually
by 1): those are hot paths. Do the opposite, update only when about to lower
rss (usually by many), or just before final accounting in do_exit. Handle
mm->hiwater_vm in the same way, though it's much less of an issue. Demand
that whoever collects these hiwater statistics do the work of taking the
maximum with rss or total_vm.
And there has been no collector of these hiwater statistics in the tree. The
new convention needs an example, so match Frank's usage by adding a VmPeak
line above VmSize to /proc/<pid>/status, and also a VmHWM line above VmRSS
(High-Water-Mark or High-Water-Memory).
There was a particular anomaly during mremap move, that hiwater_vm might be
captured too high. A fleeting such anomaly remains, but it's quickly
corrected now, whereas before it would stick.
What locking? None: if the app is racy then these statistics will be racy,
it's not worth any overhead to make them exact. But whenever it suits,
hiwater_vm is updated under exclusive mmap_sem, and hiwater_rss under
page_table_lock (for now) or with preemption disabled (later on): without
going to any trouble, minimize the time between reading current values and
updating, to minimize those occasions when a racing thread bumps a count up
and back down in between.
Signed-off-by: Hugh Dickins <hugh@veritas.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-10-29 19:16:18 -06:00
|
|
|
|
|
|
|
update_hiwater_vm(mm);
|
2005-04-16 16:20:36 -06:00
|
|
|
mm->total_vm -= len >> PAGE_SHIFT;
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
show_process_blocks();
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2007-07-21 05:37:25 -06:00
|
|
|
EXPORT_SYMBOL(do_munmap);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-09-27 02:50:20 -06:00
|
|
|
asmlinkage long sys_munmap(unsigned long addr, size_t len)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
struct mm_struct *mm = current->mm;
|
|
|
|
|
|
|
|
down_write(&mm->mmap_sem);
|
|
|
|
ret = do_munmap(mm, addr, len);
|
|
|
|
up_write(&mm->mmap_sem);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Release all mappings
|
|
|
|
*/
|
2005-04-16 16:20:36 -06:00
|
|
|
void exit_mmap(struct mm_struct * mm)
|
|
|
|
{
|
|
|
|
struct vm_list_struct *tmp;
|
|
|
|
|
|
|
|
if (mm) {
|
|
|
|
#ifdef DEBUG
|
|
|
|
printk("Exit_mmap:\n");
|
|
|
|
#endif
|
|
|
|
|
|
|
|
mm->total_vm = 0;
|
|
|
|
|
|
|
|
while ((tmp = mm->context.vmlist)) {
|
|
|
|
mm->context.vmlist = tmp->next;
|
2008-04-29 02:01:36 -06:00
|
|
|
put_vma(mm, tmp->vma);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
realalloc -= kobjsize(tmp);
|
|
|
|
askedalloc -= sizeof(*tmp);
|
|
|
|
kfree(tmp);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
show_process_blocks();
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned long do_brk(unsigned long addr, unsigned long len)
|
|
|
|
{
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2006-09-27 02:50:21 -06:00
|
|
|
* expand (or shrink) an existing mapping, potentially moving it at the same
|
|
|
|
* time (controlled by the MREMAP_MAYMOVE flag and available VM space)
|
2005-04-16 16:20:36 -06:00
|
|
|
*
|
2006-09-27 02:50:21 -06:00
|
|
|
* under NOMMU conditions, we only permit changing a mapping's size, and only
|
|
|
|
* as long as it stays within the hole allocated by the kmalloc() call in
|
|
|
|
* do_mmap_pgoff() and the block is not shareable
|
2005-04-16 16:20:36 -06:00
|
|
|
*
|
2006-09-27 02:50:21 -06:00
|
|
|
* MREMAP_FIXED is not supported under NOMMU conditions
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
|
|
|
unsigned long do_mremap(unsigned long addr,
|
|
|
|
unsigned long old_len, unsigned long new_len,
|
|
|
|
unsigned long flags, unsigned long new_addr)
|
|
|
|
{
|
2006-09-27 02:50:21 -06:00
|
|
|
struct vm_area_struct *vma;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/* insanity checks first */
|
|
|
|
if (new_len == 0)
|
|
|
|
return (unsigned long) -EINVAL;
|
|
|
|
|
|
|
|
if (flags & MREMAP_FIXED && new_addr != addr)
|
|
|
|
return (unsigned long) -EINVAL;
|
|
|
|
|
2006-09-27 02:50:21 -06:00
|
|
|
vma = find_vma_exact(current->mm, addr);
|
|
|
|
if (!vma)
|
|
|
|
return (unsigned long) -EINVAL;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-09-27 02:50:21 -06:00
|
|
|
if (vma->vm_end != vma->vm_start + old_len)
|
2005-04-16 16:20:36 -06:00
|
|
|
return (unsigned long) -EFAULT;
|
|
|
|
|
2006-09-27 02:50:21 -06:00
|
|
|
if (vma->vm_flags & VM_MAYSHARE)
|
2005-04-16 16:20:36 -06:00
|
|
|
return (unsigned long) -EPERM;
|
|
|
|
|
|
|
|
if (new_len > kobjsize((void *) addr))
|
|
|
|
return (unsigned long) -ENOMEM;
|
|
|
|
|
|
|
|
/* all checks complete - do it */
|
2006-09-27 02:50:21 -06:00
|
|
|
vma->vm_end = vma->vm_start + new_len;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
askedalloc -= old_len;
|
|
|
|
askedalloc += new_len;
|
|
|
|
|
2006-09-27 02:50:21 -06:00
|
|
|
return vma->vm_start;
|
|
|
|
}
|
2007-07-21 05:37:25 -06:00
|
|
|
EXPORT_SYMBOL(do_mremap);
|
2006-09-27 02:50:21 -06:00
|
|
|
|
|
|
|
asmlinkage unsigned long sys_mremap(unsigned long addr,
|
|
|
|
unsigned long old_len, unsigned long new_len,
|
|
|
|
unsigned long flags, unsigned long new_addr)
|
|
|
|
{
|
|
|
|
unsigned long ret;
|
|
|
|
|
|
|
|
down_write(¤t->mm->mmap_sem);
|
|
|
|
ret = do_mremap(addr, old_len, new_len, flags, new_addr);
|
|
|
|
up_write(¤t->mm->mmap_sem);
|
|
|
|
return ret;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2005-11-28 15:34:23 -07:00
|
|
|
struct page *follow_page(struct vm_area_struct *vma, unsigned long address,
|
2005-10-29 19:16:33 -06:00
|
|
|
unsigned int foll_flags)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
int remap_pfn_range(struct vm_area_struct *vma, unsigned long from,
|
|
|
|
unsigned long to, unsigned long size, pgprot_t prot)
|
|
|
|
{
|
2005-09-11 19:18:10 -06:00
|
|
|
vma->vm_start = vma->vm_pgoff << PAGE_SHIFT;
|
|
|
|
return 0;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2006-07-14 01:24:09 -06:00
|
|
|
EXPORT_SYMBOL(remap_pfn_range);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2008-02-04 23:29:59 -07:00
|
|
|
int remap_vmalloc_range(struct vm_area_struct *vma, void *addr,
|
|
|
|
unsigned long pgoff)
|
|
|
|
{
|
|
|
|
unsigned int size = vma->vm_end - vma->vm_start;
|
|
|
|
|
|
|
|
if (!(vma->vm_flags & VM_USERMAP))
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
vma->vm_start = (unsigned long)(addr + (pgoff << PAGE_SHIFT));
|
|
|
|
vma->vm_end = vma->vm_start + size;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(remap_vmalloc_range);
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
void swap_unplug_io_fn(struct backing_dev_info *bdi, struct page *page)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned long arch_get_unmapped_area(struct file *file, unsigned long addr,
|
|
|
|
unsigned long len, unsigned long pgoff, unsigned long flags)
|
|
|
|
{
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
2005-06-21 18:14:49 -06:00
|
|
|
void arch_unmap_area(struct mm_struct *mm, unsigned long addr)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
void unmap_mapping_range(struct address_space *mapping,
|
|
|
|
loff_t const holebegin, loff_t const holelen,
|
|
|
|
int even_cows)
|
|
|
|
{
|
|
|
|
}
|
2006-07-14 01:24:09 -06:00
|
|
|
EXPORT_SYMBOL(unmap_mapping_range);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-03-22 02:11:23 -06:00
|
|
|
/*
|
|
|
|
* ask for an unmapped area at which to create a mapping on a file
|
|
|
|
*/
|
|
|
|
unsigned long get_unmapped_area(struct file *file, unsigned long addr,
|
|
|
|
unsigned long len, unsigned long pgoff,
|
|
|
|
unsigned long flags)
|
|
|
|
{
|
|
|
|
unsigned long (*get_area)(struct file *, unsigned long, unsigned long,
|
|
|
|
unsigned long, unsigned long);
|
|
|
|
|
|
|
|
get_area = current->mm->get_unmapped_area;
|
|
|
|
if (file && file->f_op && file->f_op->get_unmapped_area)
|
|
|
|
get_area = file->f_op->get_unmapped_area;
|
|
|
|
|
|
|
|
if (!get_area)
|
|
|
|
return -ENOSYS;
|
|
|
|
|
|
|
|
return get_area(file, addr, len, pgoff, flags);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(get_unmapped_area);
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* Check that a process has enough memory to allocate a new virtual
|
|
|
|
* mapping. 0 means there is enough memory for the allocation to
|
|
|
|
* succeed and -ENOMEM implies there is not.
|
|
|
|
*
|
|
|
|
* We currently support three overcommit policies, which are set via the
|
|
|
|
* vm.overcommit_memory sysctl. See Documentation/vm/overcommit-accounting
|
|
|
|
*
|
|
|
|
* Strict overcommit modes added 2002 Feb 26 by Alan Cox.
|
|
|
|
* Additional code 2002 Jul 20 by Robert Love.
|
|
|
|
*
|
|
|
|
* cap_sys_admin is 1 if the process has admin privileges, 0 otherwise.
|
|
|
|
*
|
|
|
|
* Note this is a helper function intended to be used by LSMs which
|
|
|
|
* wish to use this logic.
|
|
|
|
*/
|
2007-08-22 15:01:28 -06:00
|
|
|
int __vm_enough_memory(struct mm_struct *mm, long pages, int cap_sys_admin)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
unsigned long free, allowed;
|
|
|
|
|
|
|
|
vm_acct_memory(pages);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Sometimes we want to use more memory than we have
|
|
|
|
*/
|
|
|
|
if (sysctl_overcommit_memory == OVERCOMMIT_ALWAYS)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (sysctl_overcommit_memory == OVERCOMMIT_GUESS) {
|
|
|
|
unsigned long n;
|
|
|
|
|
2006-06-30 02:55:35 -06:00
|
|
|
free = global_page_state(NR_FILE_PAGES);
|
2005-04-16 16:20:36 -06:00
|
|
|
free += nr_swap_pages;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Any slabs which are created with the
|
|
|
|
* SLAB_RECLAIM_ACCOUNT flag claim to have contents
|
|
|
|
* which are reclaimable, under pressure. The dentry
|
|
|
|
* cache and most inode caches should fall into this
|
|
|
|
*/
|
2006-09-26 00:31:51 -06:00
|
|
|
free += global_page_state(NR_SLAB_RECLAIMABLE);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Leave the last 3% for root
|
|
|
|
*/
|
|
|
|
if (!cap_sys_admin)
|
|
|
|
free -= free / 32;
|
|
|
|
|
|
|
|
if (free > pages)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* nr_free_pages() is very expensive on large systems,
|
|
|
|
* only call if we're about to fail.
|
|
|
|
*/
|
|
|
|
n = nr_free_pages();
|
2006-04-10 23:53:01 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Leave reserved pages. The pages are not for anonymous pages.
|
|
|
|
*/
|
|
|
|
if (n <= totalreserve_pages)
|
|
|
|
goto error;
|
|
|
|
else
|
|
|
|
n -= totalreserve_pages;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Leave the last 3% for root
|
|
|
|
*/
|
2005-04-16 16:20:36 -06:00
|
|
|
if (!cap_sys_admin)
|
|
|
|
n -= n / 32;
|
|
|
|
free += n;
|
|
|
|
|
|
|
|
if (free > pages)
|
|
|
|
return 0;
|
2006-04-10 23:53:01 -06:00
|
|
|
|
|
|
|
goto error;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
allowed = totalram_pages * sysctl_overcommit_ratio / 100;
|
|
|
|
/*
|
|
|
|
* Leave the last 3% for root
|
|
|
|
*/
|
|
|
|
if (!cap_sys_admin)
|
|
|
|
allowed -= allowed / 32;
|
|
|
|
allowed += total_swap_pages;
|
|
|
|
|
|
|
|
/* Don't let a single process grow too big:
|
|
|
|
leave 3% of the size of this process for other processes */
|
|
|
|
allowed -= current->mm->total_vm / 32;
|
|
|
|
|
2005-08-04 20:52:03 -06:00
|
|
|
/*
|
|
|
|
* cast `allowed' as a signed long because vm_committed_space
|
|
|
|
* sometimes has a negative value
|
|
|
|
*/
|
2008-05-23 14:04:31 -06:00
|
|
|
if (atomic_long_read(&vm_committed_space) < (long)allowed)
|
2005-04-16 16:20:36 -06:00
|
|
|
return 0;
|
2006-04-10 23:53:01 -06:00
|
|
|
error:
|
2005-04-16 16:20:36 -06:00
|
|
|
vm_unacct_memory(pages);
|
|
|
|
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
int in_gate_area_no_task(unsigned long addr)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
2006-01-06 01:11:42 -07:00
|
|
|
|
2007-07-19 02:47:03 -06:00
|
|
|
int filemap_fault(struct vm_area_struct *vma, struct vm_fault *vmf)
|
2006-01-06 01:11:42 -07:00
|
|
|
{
|
|
|
|
BUG();
|
2007-07-19 02:47:03 -06:00
|
|
|
return 0;
|
2006-01-06 01:11:42 -07:00
|
|
|
}
|
2007-07-21 05:37:25 -06:00
|
|
|
EXPORT_SYMBOL(filemap_fault);
|
2006-09-27 02:50:15 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Access another process' address space.
|
|
|
|
* - source/target buffer must be kernel space
|
|
|
|
*/
|
|
|
|
int access_process_vm(struct task_struct *tsk, unsigned long addr, void *buf, int len, int write)
|
|
|
|
{
|
|
|
|
struct vm_area_struct *vma;
|
|
|
|
struct mm_struct *mm;
|
|
|
|
|
|
|
|
if (addr + len < addr)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
mm = get_task_mm(tsk);
|
|
|
|
if (!mm)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
down_read(&mm->mmap_sem);
|
|
|
|
|
|
|
|
/* the access must start within one of the target process's mappings */
|
2006-09-27 02:50:16 -06:00
|
|
|
vma = find_vma(mm, addr);
|
|
|
|
if (vma) {
|
2006-09-27 02:50:15 -06:00
|
|
|
/* don't overrun this mapping */
|
|
|
|
if (addr + len >= vma->vm_end)
|
|
|
|
len = vma->vm_end - addr;
|
|
|
|
|
|
|
|
/* only read or write mappings where it is permitted */
|
2006-09-27 02:50:19 -06:00
|
|
|
if (write && vma->vm_flags & VM_MAYWRITE)
|
2006-09-27 02:50:15 -06:00
|
|
|
len -= copy_to_user((void *) addr, buf, len);
|
2006-09-27 02:50:19 -06:00
|
|
|
else if (!write && vma->vm_flags & VM_MAYREAD)
|
2006-09-27 02:50:15 -06:00
|
|
|
len -= copy_from_user(buf, (void *) addr, len);
|
|
|
|
else
|
|
|
|
len = 0;
|
|
|
|
} else {
|
|
|
|
len = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
up_read(&mm->mmap_sem);
|
|
|
|
mmput(mm);
|
|
|
|
return len;
|
|
|
|
}
|