2 * linux/arch/x86_64/kernel/sys_x86_64.c
5 #include <linux/errno.h>
6 #include <linux/sched.h>
7 #include <linux/syscalls.h>
10 #include <linux/smp_lock.h>
11 #include <linux/sem.h>
12 #include <linux/msg.h>
13 #include <linux/shm.h>
14 #include <linux/stat.h>
15 #include <linux/mman.h>
16 #include <linux/file.h>
17 #include <linux/utsname.h>
18 #include <linux/personality.h>
19 #include <linux/vs_cvirt.h>
21 #include <asm/uaccess.h>
25 * sys_pipe() is the normal C calling standard for creating
26 * a pipe. It's not the way Unix traditionally does this, though.
28 asmlinkage long sys_pipe(int __user *fildes)
35 if (copy_to_user(fildes, fd, 2*sizeof(int)))
41 asmlinkage long sys_mmap(unsigned long addr, unsigned long len, unsigned long prot, unsigned long flags,
42 unsigned long fd, unsigned long off)
53 flags &= ~(MAP_EXECUTABLE | MAP_DENYWRITE);
54 if (!(flags & MAP_ANONYMOUS)) {
59 down_write(¤t->mm->mmap_sem);
60 error = do_mmap_pgoff(file, addr, len, prot, flags, off >> PAGE_SHIFT);
61 up_write(¤t->mm->mmap_sem);
69 static void find_start_end(unsigned long flags, unsigned long *begin,
72 if (!test_thread_flag(TIF_IA32) && (flags & MAP_32BIT)) {
73 /* This is usually used needed to map code in small
74 model, so it needs to be in the first 31bit. Limit
75 it to that. This means we need to move the
76 unmapped base down for this case. This can give
77 conflicts with the heap, but we assume that glibc
78 malloc knows how to fall back to mmap. Give it 1GB
79 of playground for now. -AK */
83 *begin = TASK_UNMAPPED_BASE;
89 arch_get_unmapped_area(struct file *filp, unsigned long addr,
90 unsigned long len, unsigned long pgoff, unsigned long flags)
92 struct mm_struct *mm = current->mm;
93 struct vm_area_struct *vma;
94 unsigned long start_addr;
95 unsigned long begin, end;
97 find_start_end(flags, &begin, &end);
103 addr = PAGE_ALIGN(addr);
104 vma = find_vma(mm, addr);
105 if (end - len >= addr &&
106 (!vma || addr + len <= vma->vm_start))
109 if (((flags & MAP_32BIT) || test_thread_flag(TIF_IA32))
110 && len <= mm->cached_hole_size) {
111 mm->cached_hole_size = 0;
112 mm->free_area_cache = begin;
114 addr = mm->free_area_cache;
120 for (vma = find_vma(mm, addr); ; vma = vma->vm_next) {
121 /* At this point: (!vma || addr < vma->vm_end). */
122 if (end - len < addr) {
124 * Start a new search - just in case we missed
127 if (start_addr != begin) {
128 start_addr = addr = begin;
129 mm->cached_hole_size = 0;
134 if (!vma || addr + len <= vma->vm_start) {
136 * Remember the place where we stopped the search:
138 mm->free_area_cache = addr + len;
141 if (addr + mm->cached_hole_size < vma->vm_start)
142 mm->cached_hole_size = vma->vm_start - addr;
148 asmlinkage long sys_uname(struct new_utsname __user * name)
152 err = copy_to_user(name, vx_new_utsname(), sizeof (*name));
154 if (personality(current->personality) == PER_LINUX32)
155 err |= copy_to_user(&name->machine, "i686", 5);
156 return err ? -EFAULT : 0;