Loading...
1/*
2 * linux/mm/nommu.c
3 *
4 * Replacement code for mm functions to support CPU's that don't
5 * have any form of memory management unit (thus no virtual memory).
6 *
7 * See Documentation/nommu-mmap.txt
8 *
9 * Copyright (c) 2004-2008 David Howells <dhowells@redhat.com>
10 * Copyright (c) 2000-2003 David McCullough <davidm@snapgear.com>
11 * Copyright (c) 2000-2001 D Jeff Dionne <jeff@uClinux.org>
12 * Copyright (c) 2002 Greg Ungerer <gerg@snapgear.com>
13 * Copyright (c) 2007-2010 Paul Mundt <lethal@linux-sh.org>
14 */
15
16#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
17
18#include <linux/export.h>
19#include <linux/mm.h>
20#include <linux/sched/mm.h>
21#include <linux/vmacache.h>
22#include <linux/mman.h>
23#include <linux/swap.h>
24#include <linux/file.h>
25#include <linux/highmem.h>
26#include <linux/pagemap.h>
27#include <linux/slab.h>
28#include <linux/vmalloc.h>
29#include <linux/blkdev.h>
30#include <linux/backing-dev.h>
31#include <linux/compiler.h>
32#include <linux/mount.h>
33#include <linux/personality.h>
34#include <linux/security.h>
35#include <linux/syscalls.h>
36#include <linux/audit.h>
37#include <linux/printk.h>
38
39#include <linux/uaccess.h>
40#include <asm/tlb.h>
41#include <asm/tlbflush.h>
42#include <asm/mmu_context.h>
43#include "internal.h"
44
45void *high_memory;
46EXPORT_SYMBOL(high_memory);
47struct page *mem_map;
48unsigned long max_mapnr;
49EXPORT_SYMBOL(max_mapnr);
50unsigned long highest_memmap_pfn;
51int sysctl_nr_trim_pages = CONFIG_NOMMU_INITIAL_TRIM_EXCESS;
52int heap_stack_gap = 0;
53
54atomic_long_t mmap_pages_allocated;
55
56EXPORT_SYMBOL(mem_map);
57
58/* list of mapped, potentially shareable regions */
59static struct kmem_cache *vm_region_jar;
60struct rb_root nommu_region_tree = RB_ROOT;
61DECLARE_RWSEM(nommu_region_sem);
62
63const struct vm_operations_struct generic_file_vm_ops = {
64};
65
66/*
67 * Return the total memory allocated for this pointer, not
68 * just what the caller asked for.
69 *
70 * Doesn't have to be accurate, i.e. may have races.
71 */
72unsigned int kobjsize(const void *objp)
73{
74 struct page *page;
75
76 /*
77 * If the object we have should not have ksize performed on it,
78 * return size of 0
79 */
80 if (!objp || !virt_addr_valid(objp))
81 return 0;
82
83 page = virt_to_head_page(objp);
84
85 /*
86 * If the allocator sets PageSlab, we know the pointer came from
87 * kmalloc().
88 */
89 if (PageSlab(page))
90 return ksize(objp);
91
92 /*
93 * If it's not a compound page, see if we have a matching VMA
94 * region. This test is intentionally done in reverse order,
95 * so if there's no VMA, we still fall through and hand back
96 * PAGE_SIZE for 0-order pages.
97 */
98 if (!PageCompound(page)) {
99 struct vm_area_struct *vma;
100
101 vma = find_vma(current->mm, (unsigned long)objp);
102 if (vma)
103 return vma->vm_end - vma->vm_start;
104 }
105
106 /*
107 * The ksize() function is only guaranteed to work for pointers
108 * returned by kmalloc(). So handle arbitrary pointers here.
109 */
110 return PAGE_SIZE << compound_order(page);
111}
112
113static long __get_user_pages(struct task_struct *tsk, struct mm_struct *mm,
114 unsigned long start, unsigned long nr_pages,
115 unsigned int foll_flags, struct page **pages,
116 struct vm_area_struct **vmas, int *nonblocking)
117{
118 struct vm_area_struct *vma;
119 unsigned long vm_flags;
120 int i;
121
122 /* calculate required read or write permissions.
123 * If FOLL_FORCE is set, we only require the "MAY" flags.
124 */
125 vm_flags = (foll_flags & FOLL_WRITE) ?
126 (VM_WRITE | VM_MAYWRITE) : (VM_READ | VM_MAYREAD);
127 vm_flags &= (foll_flags & FOLL_FORCE) ?
128 (VM_MAYREAD | VM_MAYWRITE) : (VM_READ | VM_WRITE);
129
130 for (i = 0; i < nr_pages; i++) {
131 vma = find_vma(mm, start);
132 if (!vma)
133 goto finish_or_fault;
134
135 /* protect what we can, including chardevs */
136 if ((vma->vm_flags & (VM_IO | VM_PFNMAP)) ||
137 !(vm_flags & vma->vm_flags))
138 goto finish_or_fault;
139
140 if (pages) {
141 pages[i] = virt_to_page(start);
142 if (pages[i])
143 get_page(pages[i]);
144 }
145 if (vmas)
146 vmas[i] = vma;
147 start = (start + PAGE_SIZE) & PAGE_MASK;
148 }
149
150 return i;
151
152finish_or_fault:
153 return i ? : -EFAULT;
154}
155
156/*
157 * get a list of pages in an address range belonging to the specified process
158 * and indicate the VMA that covers each page
159 * - this is potentially dodgy as we may end incrementing the page count of a
160 * slab page or a secondary page from a compound page
161 * - don't permit access to VMAs that don't support it, such as I/O mappings
162 */
163long get_user_pages(unsigned long start, unsigned long nr_pages,
164 unsigned int gup_flags, struct page **pages,
165 struct vm_area_struct **vmas)
166{
167 return __get_user_pages(current, current->mm, start, nr_pages,
168 gup_flags, pages, vmas, NULL);
169}
170EXPORT_SYMBOL(get_user_pages);
171
172long get_user_pages_locked(unsigned long start, unsigned long nr_pages,
173 unsigned int gup_flags, struct page **pages,
174 int *locked)
175{
176 return get_user_pages(start, nr_pages, gup_flags, pages, NULL);
177}
178EXPORT_SYMBOL(get_user_pages_locked);
179
180static long __get_user_pages_unlocked(struct task_struct *tsk,
181 struct mm_struct *mm, unsigned long start,
182 unsigned long nr_pages, struct page **pages,
183 unsigned int gup_flags)
184{
185 long ret;
186 down_read(&mm->mmap_sem);
187 ret = __get_user_pages(tsk, mm, start, nr_pages, gup_flags, pages,
188 NULL, NULL);
189 up_read(&mm->mmap_sem);
190 return ret;
191}
192
193long get_user_pages_unlocked(unsigned long start, unsigned long nr_pages,
194 struct page **pages, unsigned int gup_flags)
195{
196 return __get_user_pages_unlocked(current, current->mm, start, nr_pages,
197 pages, gup_flags);
198}
199EXPORT_SYMBOL(get_user_pages_unlocked);
200
201/**
202 * follow_pfn - look up PFN at a user virtual address
203 * @vma: memory mapping
204 * @address: user virtual address
205 * @pfn: location to store found PFN
206 *
207 * Only IO mappings and raw PFN mappings are allowed.
208 *
209 * Returns zero and the pfn at @pfn on success, -ve otherwise.
210 */
211int follow_pfn(struct vm_area_struct *vma, unsigned long address,
212 unsigned long *pfn)
213{
214 if (!(vma->vm_flags & (VM_IO | VM_PFNMAP)))
215 return -EINVAL;
216
217 *pfn = address >> PAGE_SHIFT;
218 return 0;
219}
220EXPORT_SYMBOL(follow_pfn);
221
222LIST_HEAD(vmap_area_list);
223
224void vfree(const void *addr)
225{
226 kfree(addr);
227}
228EXPORT_SYMBOL(vfree);
229
230void *__vmalloc(unsigned long size, gfp_t gfp_mask, pgprot_t prot)
231{
232 /*
233 * You can't specify __GFP_HIGHMEM with kmalloc() since kmalloc()
234 * returns only a logical address.
235 */
236 return kmalloc(size, (gfp_mask | __GFP_COMP) & ~__GFP_HIGHMEM);
237}
238EXPORT_SYMBOL(__vmalloc);
239
240void *__vmalloc_node_flags(unsigned long size, int node, gfp_t flags)
241{
242 return __vmalloc(size, flags, PAGE_KERNEL);
243}
244
245void *vmalloc_user(unsigned long size)
246{
247 void *ret;
248
249 ret = __vmalloc(size, GFP_KERNEL | __GFP_ZERO, PAGE_KERNEL);
250 if (ret) {
251 struct vm_area_struct *vma;
252
253 down_write(¤t->mm->mmap_sem);
254 vma = find_vma(current->mm, (unsigned long)ret);
255 if (vma)
256 vma->vm_flags |= VM_USERMAP;
257 up_write(¤t->mm->mmap_sem);
258 }
259
260 return ret;
261}
262EXPORT_SYMBOL(vmalloc_user);
263
264struct page *vmalloc_to_page(const void *addr)
265{
266 return virt_to_page(addr);
267}
268EXPORT_SYMBOL(vmalloc_to_page);
269
270unsigned long vmalloc_to_pfn(const void *addr)
271{
272 return page_to_pfn(virt_to_page(addr));
273}
274EXPORT_SYMBOL(vmalloc_to_pfn);
275
276long vread(char *buf, char *addr, unsigned long count)
277{
278 /* Don't allow overflow */
279 if ((unsigned long) buf + count < count)
280 count = -(unsigned long) buf;
281
282 memcpy(buf, addr, count);
283 return count;
284}
285
286long vwrite(char *buf, char *addr, unsigned long count)
287{
288 /* Don't allow overflow */
289 if ((unsigned long) addr + count < count)
290 count = -(unsigned long) addr;
291
292 memcpy(addr, buf, count);
293 return count;
294}
295
296/*
297 * vmalloc - allocate virtually contiguous memory
298 *
299 * @size: allocation size
300 *
301 * Allocate enough pages to cover @size from the page level
302 * allocator and map them into contiguous kernel virtual space.
303 *
304 * For tight control over page level allocator and protection flags
305 * use __vmalloc() instead.
306 */
307void *vmalloc(unsigned long size)
308{
309 return __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL);
310}
311EXPORT_SYMBOL(vmalloc);
312
313/*
314 * vzalloc - allocate virtually contiguous memory with zero fill
315 *
316 * @size: allocation size
317 *
318 * Allocate enough pages to cover @size from the page level
319 * allocator and map them into contiguous kernel virtual space.
320 * The memory allocated is set to zero.
321 *
322 * For tight control over page level allocator and protection flags
323 * use __vmalloc() instead.
324 */
325void *vzalloc(unsigned long size)
326{
327 return __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO,
328 PAGE_KERNEL);
329}
330EXPORT_SYMBOL(vzalloc);
331
332/**
333 * vmalloc_node - allocate memory on a specific node
334 * @size: allocation size
335 * @node: numa node
336 *
337 * Allocate enough pages to cover @size from the page level
338 * allocator and map them into contiguous kernel virtual space.
339 *
340 * For tight control over page level allocator and protection flags
341 * use __vmalloc() instead.
342 */
343void *vmalloc_node(unsigned long size, int node)
344{
345 return vmalloc(size);
346}
347EXPORT_SYMBOL(vmalloc_node);
348
349/**
350 * vzalloc_node - allocate memory on a specific node with zero fill
351 * @size: allocation size
352 * @node: numa node
353 *
354 * Allocate enough pages to cover @size from the page level
355 * allocator and map them into contiguous kernel virtual space.
356 * The memory allocated is set to zero.
357 *
358 * For tight control over page level allocator and protection flags
359 * use __vmalloc() instead.
360 */
361void *vzalloc_node(unsigned long size, int node)
362{
363 return vzalloc(size);
364}
365EXPORT_SYMBOL(vzalloc_node);
366
367#ifndef PAGE_KERNEL_EXEC
368# define PAGE_KERNEL_EXEC PAGE_KERNEL
369#endif
370
371/**
372 * vmalloc_exec - allocate virtually contiguous, executable memory
373 * @size: allocation size
374 *
375 * Kernel-internal function to allocate enough pages to cover @size
376 * the page level allocator and map them into contiguous and
377 * executable kernel virtual space.
378 *
379 * For tight control over page level allocator and protection flags
380 * use __vmalloc() instead.
381 */
382
383void *vmalloc_exec(unsigned long size)
384{
385 return __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL_EXEC);
386}
387
388/**
389 * vmalloc_32 - allocate virtually contiguous memory (32bit addressable)
390 * @size: allocation size
391 *
392 * Allocate enough 32bit PA addressable pages to cover @size from the
393 * page level allocator and map them into contiguous kernel virtual space.
394 */
395void *vmalloc_32(unsigned long size)
396{
397 return __vmalloc(size, GFP_KERNEL, PAGE_KERNEL);
398}
399EXPORT_SYMBOL(vmalloc_32);
400
401/**
402 * vmalloc_32_user - allocate zeroed virtually contiguous 32bit memory
403 * @size: allocation size
404 *
405 * The resulting memory area is 32bit addressable and zeroed so it can be
406 * mapped to userspace without leaking data.
407 *
408 * VM_USERMAP is set on the corresponding VMA so that subsequent calls to
409 * remap_vmalloc_range() are permissible.
410 */
411void *vmalloc_32_user(unsigned long size)
412{
413 /*
414 * We'll have to sort out the ZONE_DMA bits for 64-bit,
415 * but for now this can simply use vmalloc_user() directly.
416 */
417 return vmalloc_user(size);
418}
419EXPORT_SYMBOL(vmalloc_32_user);
420
421void *vmap(struct page **pages, unsigned int count, unsigned long flags, pgprot_t prot)
422{
423 BUG();
424 return NULL;
425}
426EXPORT_SYMBOL(vmap);
427
428void vunmap(const void *addr)
429{
430 BUG();
431}
432EXPORT_SYMBOL(vunmap);
433
434void *vm_map_ram(struct page **pages, unsigned int count, int node, pgprot_t prot)
435{
436 BUG();
437 return NULL;
438}
439EXPORT_SYMBOL(vm_map_ram);
440
441void vm_unmap_ram(const void *mem, unsigned int count)
442{
443 BUG();
444}
445EXPORT_SYMBOL(vm_unmap_ram);
446
447void vm_unmap_aliases(void)
448{
449}
450EXPORT_SYMBOL_GPL(vm_unmap_aliases);
451
452/*
453 * Implement a stub for vmalloc_sync_all() if the architecture chose not to
454 * have one.
455 */
456void __weak vmalloc_sync_all(void)
457{
458}
459
460struct vm_struct *alloc_vm_area(size_t size, pte_t **ptes)
461{
462 BUG();
463 return NULL;
464}
465EXPORT_SYMBOL_GPL(alloc_vm_area);
466
467void free_vm_area(struct vm_struct *area)
468{
469 BUG();
470}
471EXPORT_SYMBOL_GPL(free_vm_area);
472
473int vm_insert_page(struct vm_area_struct *vma, unsigned long addr,
474 struct page *page)
475{
476 return -EINVAL;
477}
478EXPORT_SYMBOL(vm_insert_page);
479
480/*
481 * sys_brk() for the most part doesn't need the global kernel
482 * lock, except when an application is doing something nasty
483 * like trying to un-brk an area that has already been mapped
484 * to a regular file. in this case, the unmapping will need
485 * to invoke file system routines that need the global lock.
486 */
487SYSCALL_DEFINE1(brk, unsigned long, brk)
488{
489 struct mm_struct *mm = current->mm;
490
491 if (brk < mm->start_brk || brk > mm->context.end_brk)
492 return mm->brk;
493
494 if (mm->brk == brk)
495 return mm->brk;
496
497 /*
498 * Always allow shrinking brk
499 */
500 if (brk <= mm->brk) {
501 mm->brk = brk;
502 return brk;
503 }
504
505 /*
506 * Ok, looks good - let it rip.
507 */
508 flush_icache_range(mm->brk, brk);
509 return mm->brk = brk;
510}
511
512/*
513 * initialise the percpu counter for VM and region record slabs
514 */
515void __init mmap_init(void)
516{
517 int ret;
518
519 ret = percpu_counter_init(&vm_committed_as, 0, GFP_KERNEL);
520 VM_BUG_ON(ret);
521 vm_region_jar = KMEM_CACHE(vm_region, SLAB_PANIC|SLAB_ACCOUNT);
522}
523
524/*
525 * validate the region tree
526 * - the caller must hold the region lock
527 */
528#ifdef CONFIG_DEBUG_NOMMU_REGIONS
529static noinline void validate_nommu_regions(void)
530{
531 struct vm_region *region, *last;
532 struct rb_node *p, *lastp;
533
534 lastp = rb_first(&nommu_region_tree);
535 if (!lastp)
536 return;
537
538 last = rb_entry(lastp, struct vm_region, vm_rb);
539 BUG_ON(last->vm_end <= last->vm_start);
540 BUG_ON(last->vm_top < last->vm_end);
541
542 while ((p = rb_next(lastp))) {
543 region = rb_entry(p, struct vm_region, vm_rb);
544 last = rb_entry(lastp, struct vm_region, vm_rb);
545
546 BUG_ON(region->vm_end <= region->vm_start);
547 BUG_ON(region->vm_top < region->vm_end);
548 BUG_ON(region->vm_start < last->vm_top);
549
550 lastp = p;
551 }
552}
553#else
554static void validate_nommu_regions(void)
555{
556}
557#endif
558
559/*
560 * add a region into the global tree
561 */
562static void add_nommu_region(struct vm_region *region)
563{
564 struct vm_region *pregion;
565 struct rb_node **p, *parent;
566
567 validate_nommu_regions();
568
569 parent = NULL;
570 p = &nommu_region_tree.rb_node;
571 while (*p) {
572 parent = *p;
573 pregion = rb_entry(parent, struct vm_region, vm_rb);
574 if (region->vm_start < pregion->vm_start)
575 p = &(*p)->rb_left;
576 else if (region->vm_start > pregion->vm_start)
577 p = &(*p)->rb_right;
578 else if (pregion == region)
579 return;
580 else
581 BUG();
582 }
583
584 rb_link_node(®ion->vm_rb, parent, p);
585 rb_insert_color(®ion->vm_rb, &nommu_region_tree);
586
587 validate_nommu_regions();
588}
589
590/*
591 * delete a region from the global tree
592 */
593static void delete_nommu_region(struct vm_region *region)
594{
595 BUG_ON(!nommu_region_tree.rb_node);
596
597 validate_nommu_regions();
598 rb_erase(®ion->vm_rb, &nommu_region_tree);
599 validate_nommu_regions();
600}
601
602/*
603 * free a contiguous series of pages
604 */
605static void free_page_series(unsigned long from, unsigned long to)
606{
607 for (; from < to; from += PAGE_SIZE) {
608 struct page *page = virt_to_page(from);
609
610 atomic_long_dec(&mmap_pages_allocated);
611 put_page(page);
612 }
613}
614
615/*
616 * release a reference to a region
617 * - the caller must hold the region semaphore for writing, which this releases
618 * - the region may not have been added to the tree yet, in which case vm_top
619 * will equal vm_start
620 */
621static void __put_nommu_region(struct vm_region *region)
622 __releases(nommu_region_sem)
623{
624 BUG_ON(!nommu_region_tree.rb_node);
625
626 if (--region->vm_usage == 0) {
627 if (region->vm_top > region->vm_start)
628 delete_nommu_region(region);
629 up_write(&nommu_region_sem);
630
631 if (region->vm_file)
632 fput(region->vm_file);
633
634 /* IO memory and memory shared directly out of the pagecache
635 * from ramfs/tmpfs mustn't be released here */
636 if (region->vm_flags & VM_MAPPED_COPY)
637 free_page_series(region->vm_start, region->vm_top);
638 kmem_cache_free(vm_region_jar, region);
639 } else {
640 up_write(&nommu_region_sem);
641 }
642}
643
644/*
645 * release a reference to a region
646 */
647static void put_nommu_region(struct vm_region *region)
648{
649 down_write(&nommu_region_sem);
650 __put_nommu_region(region);
651}
652
653/*
654 * add a VMA into a process's mm_struct in the appropriate place in the list
655 * and tree and add to the address space's page tree also if not an anonymous
656 * page
657 * - should be called with mm->mmap_sem held writelocked
658 */
659static void add_vma_to_mm(struct mm_struct *mm, struct vm_area_struct *vma)
660{
661 struct vm_area_struct *pvma, *prev;
662 struct address_space *mapping;
663 struct rb_node **p, *parent, *rb_prev;
664
665 BUG_ON(!vma->vm_region);
666
667 mm->map_count++;
668 vma->vm_mm = mm;
669
670 /* add the VMA to the mapping */
671 if (vma->vm_file) {
672 mapping = vma->vm_file->f_mapping;
673
674 i_mmap_lock_write(mapping);
675 flush_dcache_mmap_lock(mapping);
676 vma_interval_tree_insert(vma, &mapping->i_mmap);
677 flush_dcache_mmap_unlock(mapping);
678 i_mmap_unlock_write(mapping);
679 }
680
681 /* add the VMA to the tree */
682 parent = rb_prev = NULL;
683 p = &mm->mm_rb.rb_node;
684 while (*p) {
685 parent = *p;
686 pvma = rb_entry(parent, struct vm_area_struct, vm_rb);
687
688 /* sort by: start addr, end addr, VMA struct addr in that order
689 * (the latter is necessary as we may get identical VMAs) */
690 if (vma->vm_start < pvma->vm_start)
691 p = &(*p)->rb_left;
692 else if (vma->vm_start > pvma->vm_start) {
693 rb_prev = parent;
694 p = &(*p)->rb_right;
695 } else if (vma->vm_end < pvma->vm_end)
696 p = &(*p)->rb_left;
697 else if (vma->vm_end > pvma->vm_end) {
698 rb_prev = parent;
699 p = &(*p)->rb_right;
700 } else if (vma < pvma)
701 p = &(*p)->rb_left;
702 else if (vma > pvma) {
703 rb_prev = parent;
704 p = &(*p)->rb_right;
705 } else
706 BUG();
707 }
708
709 rb_link_node(&vma->vm_rb, parent, p);
710 rb_insert_color(&vma->vm_rb, &mm->mm_rb);
711
712 /* add VMA to the VMA list also */
713 prev = NULL;
714 if (rb_prev)
715 prev = rb_entry(rb_prev, struct vm_area_struct, vm_rb);
716
717 __vma_link_list(mm, vma, prev, parent);
718}
719
720/*
721 * delete a VMA from its owning mm_struct and address space
722 */
723static void delete_vma_from_mm(struct vm_area_struct *vma)
724{
725 int i;
726 struct address_space *mapping;
727 struct mm_struct *mm = vma->vm_mm;
728 struct task_struct *curr = current;
729
730 mm->map_count--;
731 for (i = 0; i < VMACACHE_SIZE; i++) {
732 /* if the vma is cached, invalidate the entire cache */
733 if (curr->vmacache.vmas[i] == vma) {
734 vmacache_invalidate(mm);
735 break;
736 }
737 }
738
739 /* remove the VMA from the mapping */
740 if (vma->vm_file) {
741 mapping = vma->vm_file->f_mapping;
742
743 i_mmap_lock_write(mapping);
744 flush_dcache_mmap_lock(mapping);
745 vma_interval_tree_remove(vma, &mapping->i_mmap);
746 flush_dcache_mmap_unlock(mapping);
747 i_mmap_unlock_write(mapping);
748 }
749
750 /* remove from the MM's tree and list */
751 rb_erase(&vma->vm_rb, &mm->mm_rb);
752
753 if (vma->vm_prev)
754 vma->vm_prev->vm_next = vma->vm_next;
755 else
756 mm->mmap = vma->vm_next;
757
758 if (vma->vm_next)
759 vma->vm_next->vm_prev = vma->vm_prev;
760}
761
762/*
763 * destroy a VMA record
764 */
765static void delete_vma(struct mm_struct *mm, struct vm_area_struct *vma)
766{
767 if (vma->vm_ops && vma->vm_ops->close)
768 vma->vm_ops->close(vma);
769 if (vma->vm_file)
770 fput(vma->vm_file);
771 put_nommu_region(vma->vm_region);
772 kmem_cache_free(vm_area_cachep, vma);
773}
774
775/*
776 * look up the first VMA in which addr resides, NULL if none
777 * - should be called with mm->mmap_sem at least held readlocked
778 */
779struct vm_area_struct *find_vma(struct mm_struct *mm, unsigned long addr)
780{
781 struct vm_area_struct *vma;
782
783 /* check the cache first */
784 vma = vmacache_find(mm, addr);
785 if (likely(vma))
786 return vma;
787
788 /* trawl the list (there may be multiple mappings in which addr
789 * resides) */
790 for (vma = mm->mmap; vma; vma = vma->vm_next) {
791 if (vma->vm_start > addr)
792 return NULL;
793 if (vma->vm_end > addr) {
794 vmacache_update(addr, vma);
795 return vma;
796 }
797 }
798
799 return NULL;
800}
801EXPORT_SYMBOL(find_vma);
802
803/*
804 * find a VMA
805 * - we don't extend stack VMAs under NOMMU conditions
806 */
807struct vm_area_struct *find_extend_vma(struct mm_struct *mm, unsigned long addr)
808{
809 return find_vma(mm, addr);
810}
811
812/*
813 * expand a stack to a given address
814 * - not supported under NOMMU conditions
815 */
816int expand_stack(struct vm_area_struct *vma, unsigned long address)
817{
818 return -ENOMEM;
819}
820
821/*
822 * look up the first VMA exactly that exactly matches addr
823 * - should be called with mm->mmap_sem at least held readlocked
824 */
825static struct vm_area_struct *find_vma_exact(struct mm_struct *mm,
826 unsigned long addr,
827 unsigned long len)
828{
829 struct vm_area_struct *vma;
830 unsigned long end = addr + len;
831
832 /* check the cache first */
833 vma = vmacache_find_exact(mm, addr, end);
834 if (vma)
835 return vma;
836
837 /* trawl the list (there may be multiple mappings in which addr
838 * resides) */
839 for (vma = mm->mmap; vma; vma = vma->vm_next) {
840 if (vma->vm_start < addr)
841 continue;
842 if (vma->vm_start > addr)
843 return NULL;
844 if (vma->vm_end == end) {
845 vmacache_update(addr, vma);
846 return vma;
847 }
848 }
849
850 return NULL;
851}
852
853/*
854 * determine whether a mapping should be permitted and, if so, what sort of
855 * mapping we're capable of supporting
856 */
857static int validate_mmap_request(struct file *file,
858 unsigned long addr,
859 unsigned long len,
860 unsigned long prot,
861 unsigned long flags,
862 unsigned long pgoff,
863 unsigned long *_capabilities)
864{
865 unsigned long capabilities, rlen;
866 int ret;
867
868 /* do the simple checks first */
869 if (flags & MAP_FIXED)
870 return -EINVAL;
871
872 if ((flags & MAP_TYPE) != MAP_PRIVATE &&
873 (flags & MAP_TYPE) != MAP_SHARED)
874 return -EINVAL;
875
876 if (!len)
877 return -EINVAL;
878
879 /* Careful about overflows.. */
880 rlen = PAGE_ALIGN(len);
881 if (!rlen || rlen > TASK_SIZE)
882 return -ENOMEM;
883
884 /* offset overflow? */
885 if ((pgoff + (rlen >> PAGE_SHIFT)) < pgoff)
886 return -EOVERFLOW;
887
888 if (file) {
889 /* files must support mmap */
890 if (!file->f_op->mmap)
891 return -ENODEV;
892
893 /* work out if what we've got could possibly be shared
894 * - we support chardevs that provide their own "memory"
895 * - we support files/blockdevs that are memory backed
896 */
897 if (file->f_op->mmap_capabilities) {
898 capabilities = file->f_op->mmap_capabilities(file);
899 } else {
900 /* no explicit capabilities set, so assume some
901 * defaults */
902 switch (file_inode(file)->i_mode & S_IFMT) {
903 case S_IFREG:
904 case S_IFBLK:
905 capabilities = NOMMU_MAP_COPY;
906 break;
907
908 case S_IFCHR:
909 capabilities =
910 NOMMU_MAP_DIRECT |
911 NOMMU_MAP_READ |
912 NOMMU_MAP_WRITE;
913 break;
914
915 default:
916 return -EINVAL;
917 }
918 }
919
920 /* eliminate any capabilities that we can't support on this
921 * device */
922 if (!file->f_op->get_unmapped_area)
923 capabilities &= ~NOMMU_MAP_DIRECT;
924 if (!(file->f_mode & FMODE_CAN_READ))
925 capabilities &= ~NOMMU_MAP_COPY;
926
927 /* The file shall have been opened with read permission. */
928 if (!(file->f_mode & FMODE_READ))
929 return -EACCES;
930
931 if (flags & MAP_SHARED) {
932 /* do checks for writing, appending and locking */
933 if ((prot & PROT_WRITE) &&
934 !(file->f_mode & FMODE_WRITE))
935 return -EACCES;
936
937 if (IS_APPEND(file_inode(file)) &&
938 (file->f_mode & FMODE_WRITE))
939 return -EACCES;
940
941 if (locks_verify_locked(file))
942 return -EAGAIN;
943
944 if (!(capabilities & NOMMU_MAP_DIRECT))
945 return -ENODEV;
946
947 /* we mustn't privatise shared mappings */
948 capabilities &= ~NOMMU_MAP_COPY;
949 } else {
950 /* we're going to read the file into private memory we
951 * allocate */
952 if (!(capabilities & NOMMU_MAP_COPY))
953 return -ENODEV;
954
955 /* we don't permit a private writable mapping to be
956 * shared with the backing device */
957 if (prot & PROT_WRITE)
958 capabilities &= ~NOMMU_MAP_DIRECT;
959 }
960
961 if (capabilities & NOMMU_MAP_DIRECT) {
962 if (((prot & PROT_READ) && !(capabilities & NOMMU_MAP_READ)) ||
963 ((prot & PROT_WRITE) && !(capabilities & NOMMU_MAP_WRITE)) ||
964 ((prot & PROT_EXEC) && !(capabilities & NOMMU_MAP_EXEC))
965 ) {
966 capabilities &= ~NOMMU_MAP_DIRECT;
967 if (flags & MAP_SHARED) {
968 pr_warn("MAP_SHARED not completely supported on !MMU\n");
969 return -EINVAL;
970 }
971 }
972 }
973
974 /* handle executable mappings and implied executable
975 * mappings */
976 if (path_noexec(&file->f_path)) {
977 if (prot & PROT_EXEC)
978 return -EPERM;
979 } else if ((prot & PROT_READ) && !(prot & PROT_EXEC)) {
980 /* handle implication of PROT_EXEC by PROT_READ */
981 if (current->personality & READ_IMPLIES_EXEC) {
982 if (capabilities & NOMMU_MAP_EXEC)
983 prot |= PROT_EXEC;
984 }
985 } else if ((prot & PROT_READ) &&
986 (prot & PROT_EXEC) &&
987 !(capabilities & NOMMU_MAP_EXEC)
988 ) {
989 /* backing file is not executable, try to copy */
990 capabilities &= ~NOMMU_MAP_DIRECT;
991 }
992 } else {
993 /* anonymous mappings are always memory backed and can be
994 * privately mapped
995 */
996 capabilities = NOMMU_MAP_COPY;
997
998 /* handle PROT_EXEC implication by PROT_READ */
999 if ((prot & PROT_READ) &&
1000 (current->personality & READ_IMPLIES_EXEC))
1001 prot |= PROT_EXEC;
1002 }
1003
1004 /* allow the security API to have its say */
1005 ret = security_mmap_addr(addr);
1006 if (ret < 0)
1007 return ret;
1008
1009 /* looks okay */
1010 *_capabilities = capabilities;
1011 return 0;
1012}
1013
1014/*
1015 * we've determined that we can make the mapping, now translate what we
1016 * now know into VMA flags
1017 */
1018static unsigned long determine_vm_flags(struct file *file,
1019 unsigned long prot,
1020 unsigned long flags,
1021 unsigned long capabilities)
1022{
1023 unsigned long vm_flags;
1024
1025 vm_flags = calc_vm_prot_bits(prot, 0) | calc_vm_flag_bits(flags);
1026 /* vm_flags |= mm->def_flags; */
1027
1028 if (!(capabilities & NOMMU_MAP_DIRECT)) {
1029 /* attempt to share read-only copies of mapped file chunks */
1030 vm_flags |= VM_MAYREAD | VM_MAYWRITE | VM_MAYEXEC;
1031 if (file && !(prot & PROT_WRITE))
1032 vm_flags |= VM_MAYSHARE;
1033 } else {
1034 /* overlay a shareable mapping on the backing device or inode
1035 * if possible - used for chardevs, ramfs/tmpfs/shmfs and
1036 * romfs/cramfs */
1037 vm_flags |= VM_MAYSHARE | (capabilities & NOMMU_VMFLAGS);
1038 if (flags & MAP_SHARED)
1039 vm_flags |= VM_SHARED;
1040 }
1041
1042 /* refuse to let anyone share private mappings with this process if
1043 * it's being traced - otherwise breakpoints set in it may interfere
1044 * with another untraced process
1045 */
1046 if ((flags & MAP_PRIVATE) && current->ptrace)
1047 vm_flags &= ~VM_MAYSHARE;
1048
1049 return vm_flags;
1050}
1051
1052/*
1053 * set up a shared mapping on a file (the driver or filesystem provides and
1054 * pins the storage)
1055 */
1056static int do_mmap_shared_file(struct vm_area_struct *vma)
1057{
1058 int ret;
1059
1060 ret = call_mmap(vma->vm_file, vma);
1061 if (ret == 0) {
1062 vma->vm_region->vm_top = vma->vm_region->vm_end;
1063 return 0;
1064 }
1065 if (ret != -ENOSYS)
1066 return ret;
1067
1068 /* getting -ENOSYS indicates that direct mmap isn't possible (as
1069 * opposed to tried but failed) so we can only give a suitable error as
1070 * it's not possible to make a private copy if MAP_SHARED was given */
1071 return -ENODEV;
1072}
1073
1074/*
1075 * set up a private mapping or an anonymous shared mapping
1076 */
1077static int do_mmap_private(struct vm_area_struct *vma,
1078 struct vm_region *region,
1079 unsigned long len,
1080 unsigned long capabilities)
1081{
1082 unsigned long total, point;
1083 void *base;
1084 int ret, order;
1085
1086 /* invoke the file's mapping function so that it can keep track of
1087 * shared mappings on devices or memory
1088 * - VM_MAYSHARE will be set if it may attempt to share
1089 */
1090 if (capabilities & NOMMU_MAP_DIRECT) {
1091 ret = call_mmap(vma->vm_file, vma);
1092 if (ret == 0) {
1093 /* shouldn't return success if we're not sharing */
1094 BUG_ON(!(vma->vm_flags & VM_MAYSHARE));
1095 vma->vm_region->vm_top = vma->vm_region->vm_end;
1096 return 0;
1097 }
1098 if (ret != -ENOSYS)
1099 return ret;
1100
1101 /* getting an ENOSYS error indicates that direct mmap isn't
1102 * possible (as opposed to tried but failed) so we'll try to
1103 * make a private copy of the data and map that instead */
1104 }
1105
1106
1107 /* allocate some memory to hold the mapping
1108 * - note that this may not return a page-aligned address if the object
1109 * we're allocating is smaller than a page
1110 */
1111 order = get_order(len);
1112 total = 1 << order;
1113 point = len >> PAGE_SHIFT;
1114
1115 /* we don't want to allocate a power-of-2 sized page set */
1116 if (sysctl_nr_trim_pages && total - point >= sysctl_nr_trim_pages)
1117 total = point;
1118
1119 base = alloc_pages_exact(total << PAGE_SHIFT, GFP_KERNEL);
1120 if (!base)
1121 goto enomem;
1122
1123 atomic_long_add(total, &mmap_pages_allocated);
1124
1125 region->vm_flags = vma->vm_flags |= VM_MAPPED_COPY;
1126 region->vm_start = (unsigned long) base;
1127 region->vm_end = region->vm_start + len;
1128 region->vm_top = region->vm_start + (total << PAGE_SHIFT);
1129
1130 vma->vm_start = region->vm_start;
1131 vma->vm_end = region->vm_start + len;
1132
1133 if (vma->vm_file) {
1134 /* read the contents of a file into the copy */
1135 loff_t fpos;
1136
1137 fpos = vma->vm_pgoff;
1138 fpos <<= PAGE_SHIFT;
1139
1140 ret = kernel_read(vma->vm_file, base, len, &fpos);
1141 if (ret < 0)
1142 goto error_free;
1143
1144 /* clear the last little bit */
1145 if (ret < len)
1146 memset(base + ret, 0, len - ret);
1147
1148 }
1149
1150 return 0;
1151
1152error_free:
1153 free_page_series(region->vm_start, region->vm_top);
1154 region->vm_start = vma->vm_start = 0;
1155 region->vm_end = vma->vm_end = 0;
1156 region->vm_top = 0;
1157 return ret;
1158
1159enomem:
1160 pr_err("Allocation of length %lu from process %d (%s) failed\n",
1161 len, current->pid, current->comm);
1162 show_free_areas(0, NULL);
1163 return -ENOMEM;
1164}
1165
1166/*
1167 * handle mapping creation for uClinux
1168 */
1169unsigned long do_mmap(struct file *file,
1170 unsigned long addr,
1171 unsigned long len,
1172 unsigned long prot,
1173 unsigned long flags,
1174 vm_flags_t vm_flags,
1175 unsigned long pgoff,
1176 unsigned long *populate,
1177 struct list_head *uf)
1178{
1179 struct vm_area_struct *vma;
1180 struct vm_region *region;
1181 struct rb_node *rb;
1182 unsigned long capabilities, result;
1183 int ret;
1184
1185 *populate = 0;
1186
1187 /* decide whether we should attempt the mapping, and if so what sort of
1188 * mapping */
1189 ret = validate_mmap_request(file, addr, len, prot, flags, pgoff,
1190 &capabilities);
1191 if (ret < 0)
1192 return ret;
1193
1194 /* we ignore the address hint */
1195 addr = 0;
1196 len = PAGE_ALIGN(len);
1197
1198 /* we've determined that we can make the mapping, now translate what we
1199 * now know into VMA flags */
1200 vm_flags |= determine_vm_flags(file, prot, flags, capabilities);
1201
1202 /* we're going to need to record the mapping */
1203 region = kmem_cache_zalloc(vm_region_jar, GFP_KERNEL);
1204 if (!region)
1205 goto error_getting_region;
1206
1207 vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL);
1208 if (!vma)
1209 goto error_getting_vma;
1210
1211 region->vm_usage = 1;
1212 region->vm_flags = vm_flags;
1213 region->vm_pgoff = pgoff;
1214
1215 INIT_LIST_HEAD(&vma->anon_vma_chain);
1216 vma->vm_flags = vm_flags;
1217 vma->vm_pgoff = pgoff;
1218
1219 if (file) {
1220 region->vm_file = get_file(file);
1221 vma->vm_file = get_file(file);
1222 }
1223
1224 down_write(&nommu_region_sem);
1225
1226 /* if we want to share, we need to check for regions created by other
1227 * mmap() calls that overlap with our proposed mapping
1228 * - we can only share with a superset match on most regular files
1229 * - shared mappings on character devices and memory backed files are
1230 * permitted to overlap inexactly as far as we are concerned for in
1231 * these cases, sharing is handled in the driver or filesystem rather
1232 * than here
1233 */
1234 if (vm_flags & VM_MAYSHARE) {
1235 struct vm_region *pregion;
1236 unsigned long pglen, rpglen, pgend, rpgend, start;
1237
1238 pglen = (len + PAGE_SIZE - 1) >> PAGE_SHIFT;
1239 pgend = pgoff + pglen;
1240
1241 for (rb = rb_first(&nommu_region_tree); rb; rb = rb_next(rb)) {
1242 pregion = rb_entry(rb, struct vm_region, vm_rb);
1243
1244 if (!(pregion->vm_flags & VM_MAYSHARE))
1245 continue;
1246
1247 /* search for overlapping mappings on the same file */
1248 if (file_inode(pregion->vm_file) !=
1249 file_inode(file))
1250 continue;
1251
1252 if (pregion->vm_pgoff >= pgend)
1253 continue;
1254
1255 rpglen = pregion->vm_end - pregion->vm_start;
1256 rpglen = (rpglen + PAGE_SIZE - 1) >> PAGE_SHIFT;
1257 rpgend = pregion->vm_pgoff + rpglen;
1258 if (pgoff >= rpgend)
1259 continue;
1260
1261 /* handle inexactly overlapping matches between
1262 * mappings */
1263 if ((pregion->vm_pgoff != pgoff || rpglen != pglen) &&
1264 !(pgoff >= pregion->vm_pgoff && pgend <= rpgend)) {
1265 /* new mapping is not a subset of the region */
1266 if (!(capabilities & NOMMU_MAP_DIRECT))
1267 goto sharing_violation;
1268 continue;
1269 }
1270
1271 /* we've found a region we can share */
1272 pregion->vm_usage++;
1273 vma->vm_region = pregion;
1274 start = pregion->vm_start;
1275 start += (pgoff - pregion->vm_pgoff) << PAGE_SHIFT;
1276 vma->vm_start = start;
1277 vma->vm_end = start + len;
1278
1279 if (pregion->vm_flags & VM_MAPPED_COPY)
1280 vma->vm_flags |= VM_MAPPED_COPY;
1281 else {
1282 ret = do_mmap_shared_file(vma);
1283 if (ret < 0) {
1284 vma->vm_region = NULL;
1285 vma->vm_start = 0;
1286 vma->vm_end = 0;
1287 pregion->vm_usage--;
1288 pregion = NULL;
1289 goto error_just_free;
1290 }
1291 }
1292 fput(region->vm_file);
1293 kmem_cache_free(vm_region_jar, region);
1294 region = pregion;
1295 result = start;
1296 goto share;
1297 }
1298
1299 /* obtain the address at which to make a shared mapping
1300 * - this is the hook for quasi-memory character devices to
1301 * tell us the location of a shared mapping
1302 */
1303 if (capabilities & NOMMU_MAP_DIRECT) {
1304 addr = file->f_op->get_unmapped_area(file, addr, len,
1305 pgoff, flags);
1306 if (IS_ERR_VALUE(addr)) {
1307 ret = addr;
1308 if (ret != -ENOSYS)
1309 goto error_just_free;
1310
1311 /* the driver refused to tell us where to site
1312 * the mapping so we'll have to attempt to copy
1313 * it */
1314 ret = -ENODEV;
1315 if (!(capabilities & NOMMU_MAP_COPY))
1316 goto error_just_free;
1317
1318 capabilities &= ~NOMMU_MAP_DIRECT;
1319 } else {
1320 vma->vm_start = region->vm_start = addr;
1321 vma->vm_end = region->vm_end = addr + len;
1322 }
1323 }
1324 }
1325
1326 vma->vm_region = region;
1327
1328 /* set up the mapping
1329 * - the region is filled in if NOMMU_MAP_DIRECT is still set
1330 */
1331 if (file && vma->vm_flags & VM_SHARED)
1332 ret = do_mmap_shared_file(vma);
1333 else
1334 ret = do_mmap_private(vma, region, len, capabilities);
1335 if (ret < 0)
1336 goto error_just_free;
1337 add_nommu_region(region);
1338
1339 /* clear anonymous mappings that don't ask for uninitialized data */
1340 if (!vma->vm_file && !(flags & MAP_UNINITIALIZED))
1341 memset((void *)region->vm_start, 0,
1342 region->vm_end - region->vm_start);
1343
1344 /* okay... we have a mapping; now we have to register it */
1345 result = vma->vm_start;
1346
1347 current->mm->total_vm += len >> PAGE_SHIFT;
1348
1349share:
1350 add_vma_to_mm(current->mm, vma);
1351
1352 /* we flush the region from the icache only when the first executable
1353 * mapping of it is made */
1354 if (vma->vm_flags & VM_EXEC && !region->vm_icache_flushed) {
1355 flush_icache_range(region->vm_start, region->vm_end);
1356 region->vm_icache_flushed = true;
1357 }
1358
1359 up_write(&nommu_region_sem);
1360
1361 return result;
1362
1363error_just_free:
1364 up_write(&nommu_region_sem);
1365error:
1366 if (region->vm_file)
1367 fput(region->vm_file);
1368 kmem_cache_free(vm_region_jar, region);
1369 if (vma->vm_file)
1370 fput(vma->vm_file);
1371 kmem_cache_free(vm_area_cachep, vma);
1372 return ret;
1373
1374sharing_violation:
1375 up_write(&nommu_region_sem);
1376 pr_warn("Attempt to share mismatched mappings\n");
1377 ret = -EINVAL;
1378 goto error;
1379
1380error_getting_vma:
1381 kmem_cache_free(vm_region_jar, region);
1382 pr_warn("Allocation of vma for %lu byte allocation from process %d failed\n",
1383 len, current->pid);
1384 show_free_areas(0, NULL);
1385 return -ENOMEM;
1386
1387error_getting_region:
1388 pr_warn("Allocation of vm region for %lu byte allocation from process %d failed\n",
1389 len, current->pid);
1390 show_free_areas(0, NULL);
1391 return -ENOMEM;
1392}
1393
1394unsigned long ksys_mmap_pgoff(unsigned long addr, unsigned long len,
1395 unsigned long prot, unsigned long flags,
1396 unsigned long fd, unsigned long pgoff)
1397{
1398 struct file *file = NULL;
1399 unsigned long retval = -EBADF;
1400
1401 audit_mmap_fd(fd, flags);
1402 if (!(flags & MAP_ANONYMOUS)) {
1403 file = fget(fd);
1404 if (!file)
1405 goto out;
1406 }
1407
1408 flags &= ~(MAP_EXECUTABLE | MAP_DENYWRITE);
1409
1410 retval = vm_mmap_pgoff(file, addr, len, prot, flags, pgoff);
1411
1412 if (file)
1413 fput(file);
1414out:
1415 return retval;
1416}
1417
1418SYSCALL_DEFINE6(mmap_pgoff, unsigned long, addr, unsigned long, len,
1419 unsigned long, prot, unsigned long, flags,
1420 unsigned long, fd, unsigned long, pgoff)
1421{
1422 return ksys_mmap_pgoff(addr, len, prot, flags, fd, pgoff);
1423}
1424
1425#ifdef __ARCH_WANT_SYS_OLD_MMAP
1426struct mmap_arg_struct {
1427 unsigned long addr;
1428 unsigned long len;
1429 unsigned long prot;
1430 unsigned long flags;
1431 unsigned long fd;
1432 unsigned long offset;
1433};
1434
1435SYSCALL_DEFINE1(old_mmap, struct mmap_arg_struct __user *, arg)
1436{
1437 struct mmap_arg_struct a;
1438
1439 if (copy_from_user(&a, arg, sizeof(a)))
1440 return -EFAULT;
1441 if (offset_in_page(a.offset))
1442 return -EINVAL;
1443
1444 return ksys_mmap_pgoff(a.addr, a.len, a.prot, a.flags, a.fd,
1445 a.offset >> PAGE_SHIFT);
1446}
1447#endif /* __ARCH_WANT_SYS_OLD_MMAP */
1448
1449/*
1450 * split a vma into two pieces at address 'addr', a new vma is allocated either
1451 * for the first part or the tail.
1452 */
1453int split_vma(struct mm_struct *mm, struct vm_area_struct *vma,
1454 unsigned long addr, int new_below)
1455{
1456 struct vm_area_struct *new;
1457 struct vm_region *region;
1458 unsigned long npages;
1459
1460 /* we're only permitted to split anonymous regions (these should have
1461 * only a single usage on the region) */
1462 if (vma->vm_file)
1463 return -ENOMEM;
1464
1465 if (mm->map_count >= sysctl_max_map_count)
1466 return -ENOMEM;
1467
1468 region = kmem_cache_alloc(vm_region_jar, GFP_KERNEL);
1469 if (!region)
1470 return -ENOMEM;
1471
1472 new = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
1473 if (!new) {
1474 kmem_cache_free(vm_region_jar, region);
1475 return -ENOMEM;
1476 }
1477
1478 /* most fields are the same, copy all, and then fixup */
1479 *new = *vma;
1480 *region = *vma->vm_region;
1481 new->vm_region = region;
1482
1483 npages = (addr - vma->vm_start) >> PAGE_SHIFT;
1484
1485 if (new_below) {
1486 region->vm_top = region->vm_end = new->vm_end = addr;
1487 } else {
1488 region->vm_start = new->vm_start = addr;
1489 region->vm_pgoff = new->vm_pgoff += npages;
1490 }
1491
1492 if (new->vm_ops && new->vm_ops->open)
1493 new->vm_ops->open(new);
1494
1495 delete_vma_from_mm(vma);
1496 down_write(&nommu_region_sem);
1497 delete_nommu_region(vma->vm_region);
1498 if (new_below) {
1499 vma->vm_region->vm_start = vma->vm_start = addr;
1500 vma->vm_region->vm_pgoff = vma->vm_pgoff += npages;
1501 } else {
1502 vma->vm_region->vm_end = vma->vm_end = addr;
1503 vma->vm_region->vm_top = addr;
1504 }
1505 add_nommu_region(vma->vm_region);
1506 add_nommu_region(new->vm_region);
1507 up_write(&nommu_region_sem);
1508 add_vma_to_mm(mm, vma);
1509 add_vma_to_mm(mm, new);
1510 return 0;
1511}
1512
1513/*
1514 * shrink a VMA by removing the specified chunk from either the beginning or
1515 * the end
1516 */
1517static int shrink_vma(struct mm_struct *mm,
1518 struct vm_area_struct *vma,
1519 unsigned long from, unsigned long to)
1520{
1521 struct vm_region *region;
1522
1523 /* adjust the VMA's pointers, which may reposition it in the MM's tree
1524 * and list */
1525 delete_vma_from_mm(vma);
1526 if (from > vma->vm_start)
1527 vma->vm_end = from;
1528 else
1529 vma->vm_start = to;
1530 add_vma_to_mm(mm, vma);
1531
1532 /* cut the backing region down to size */
1533 region = vma->vm_region;
1534 BUG_ON(region->vm_usage != 1);
1535
1536 down_write(&nommu_region_sem);
1537 delete_nommu_region(region);
1538 if (from > region->vm_start) {
1539 to = region->vm_top;
1540 region->vm_top = region->vm_end = from;
1541 } else {
1542 region->vm_start = to;
1543 }
1544 add_nommu_region(region);
1545 up_write(&nommu_region_sem);
1546
1547 free_page_series(from, to);
1548 return 0;
1549}
1550
1551/*
1552 * release a mapping
1553 * - under NOMMU conditions the chunk to be unmapped must be backed by a single
1554 * VMA, though it need not cover the whole VMA
1555 */
1556int do_munmap(struct mm_struct *mm, unsigned long start, size_t len, struct list_head *uf)
1557{
1558 struct vm_area_struct *vma;
1559 unsigned long end;
1560 int ret;
1561
1562 len = PAGE_ALIGN(len);
1563 if (len == 0)
1564 return -EINVAL;
1565
1566 end = start + len;
1567
1568 /* find the first potentially overlapping VMA */
1569 vma = find_vma(mm, start);
1570 if (!vma) {
1571 static int limit;
1572 if (limit < 5) {
1573 pr_warn("munmap of memory not mmapped by process %d (%s): 0x%lx-0x%lx\n",
1574 current->pid, current->comm,
1575 start, start + len - 1);
1576 limit++;
1577 }
1578 return -EINVAL;
1579 }
1580
1581 /* we're allowed to split an anonymous VMA but not a file-backed one */
1582 if (vma->vm_file) {
1583 do {
1584 if (start > vma->vm_start)
1585 return -EINVAL;
1586 if (end == vma->vm_end)
1587 goto erase_whole_vma;
1588 vma = vma->vm_next;
1589 } while (vma);
1590 return -EINVAL;
1591 } else {
1592 /* the chunk must be a subset of the VMA found */
1593 if (start == vma->vm_start && end == vma->vm_end)
1594 goto erase_whole_vma;
1595 if (start < vma->vm_start || end > vma->vm_end)
1596 return -EINVAL;
1597 if (offset_in_page(start))
1598 return -EINVAL;
1599 if (end != vma->vm_end && offset_in_page(end))
1600 return -EINVAL;
1601 if (start != vma->vm_start && end != vma->vm_end) {
1602 ret = split_vma(mm, vma, start, 1);
1603 if (ret < 0)
1604 return ret;
1605 }
1606 return shrink_vma(mm, vma, start, end);
1607 }
1608
1609erase_whole_vma:
1610 delete_vma_from_mm(vma);
1611 delete_vma(mm, vma);
1612 return 0;
1613}
1614EXPORT_SYMBOL(do_munmap);
1615
1616int vm_munmap(unsigned long addr, size_t len)
1617{
1618 struct mm_struct *mm = current->mm;
1619 int ret;
1620
1621 down_write(&mm->mmap_sem);
1622 ret = do_munmap(mm, addr, len, NULL);
1623 up_write(&mm->mmap_sem);
1624 return ret;
1625}
1626EXPORT_SYMBOL(vm_munmap);
1627
1628SYSCALL_DEFINE2(munmap, unsigned long, addr, size_t, len)
1629{
1630 return vm_munmap(addr, len);
1631}
1632
1633/*
1634 * release all the mappings made in a process's VM space
1635 */
1636void exit_mmap(struct mm_struct *mm)
1637{
1638 struct vm_area_struct *vma;
1639
1640 if (!mm)
1641 return;
1642
1643 mm->total_vm = 0;
1644
1645 while ((vma = mm->mmap)) {
1646 mm->mmap = vma->vm_next;
1647 delete_vma_from_mm(vma);
1648 delete_vma(mm, vma);
1649 cond_resched();
1650 }
1651}
1652
1653int vm_brk(unsigned long addr, unsigned long len)
1654{
1655 return -ENOMEM;
1656}
1657
1658/*
1659 * expand (or shrink) an existing mapping, potentially moving it at the same
1660 * time (controlled by the MREMAP_MAYMOVE flag and available VM space)
1661 *
1662 * under NOMMU conditions, we only permit changing a mapping's size, and only
1663 * as long as it stays within the region allocated by do_mmap_private() and the
1664 * block is not shareable
1665 *
1666 * MREMAP_FIXED is not supported under NOMMU conditions
1667 */
1668static unsigned long do_mremap(unsigned long addr,
1669 unsigned long old_len, unsigned long new_len,
1670 unsigned long flags, unsigned long new_addr)
1671{
1672 struct vm_area_struct *vma;
1673
1674 /* insanity checks first */
1675 old_len = PAGE_ALIGN(old_len);
1676 new_len = PAGE_ALIGN(new_len);
1677 if (old_len == 0 || new_len == 0)
1678 return (unsigned long) -EINVAL;
1679
1680 if (offset_in_page(addr))
1681 return -EINVAL;
1682
1683 if (flags & MREMAP_FIXED && new_addr != addr)
1684 return (unsigned long) -EINVAL;
1685
1686 vma = find_vma_exact(current->mm, addr, old_len);
1687 if (!vma)
1688 return (unsigned long) -EINVAL;
1689
1690 if (vma->vm_end != vma->vm_start + old_len)
1691 return (unsigned long) -EFAULT;
1692
1693 if (vma->vm_flags & VM_MAYSHARE)
1694 return (unsigned long) -EPERM;
1695
1696 if (new_len > vma->vm_region->vm_end - vma->vm_region->vm_start)
1697 return (unsigned long) -ENOMEM;
1698
1699 /* all checks complete - do it */
1700 vma->vm_end = vma->vm_start + new_len;
1701 return vma->vm_start;
1702}
1703
1704SYSCALL_DEFINE5(mremap, unsigned long, addr, unsigned long, old_len,
1705 unsigned long, new_len, unsigned long, flags,
1706 unsigned long, new_addr)
1707{
1708 unsigned long ret;
1709
1710 down_write(¤t->mm->mmap_sem);
1711 ret = do_mremap(addr, old_len, new_len, flags, new_addr);
1712 up_write(¤t->mm->mmap_sem);
1713 return ret;
1714}
1715
1716struct page *follow_page_mask(struct vm_area_struct *vma,
1717 unsigned long address, unsigned int flags,
1718 unsigned int *page_mask)
1719{
1720 *page_mask = 0;
1721 return NULL;
1722}
1723
1724int remap_pfn_range(struct vm_area_struct *vma, unsigned long addr,
1725 unsigned long pfn, unsigned long size, pgprot_t prot)
1726{
1727 if (addr != (pfn << PAGE_SHIFT))
1728 return -EINVAL;
1729
1730 vma->vm_flags |= VM_IO | VM_PFNMAP | VM_DONTEXPAND | VM_DONTDUMP;
1731 return 0;
1732}
1733EXPORT_SYMBOL(remap_pfn_range);
1734
1735int vm_iomap_memory(struct vm_area_struct *vma, phys_addr_t start, unsigned long len)
1736{
1737 unsigned long pfn = start >> PAGE_SHIFT;
1738 unsigned long vm_len = vma->vm_end - vma->vm_start;
1739
1740 pfn += vma->vm_pgoff;
1741 return io_remap_pfn_range(vma, vma->vm_start, pfn, vm_len, vma->vm_page_prot);
1742}
1743EXPORT_SYMBOL(vm_iomap_memory);
1744
1745int remap_vmalloc_range(struct vm_area_struct *vma, void *addr,
1746 unsigned long pgoff)
1747{
1748 unsigned int size = vma->vm_end - vma->vm_start;
1749
1750 if (!(vma->vm_flags & VM_USERMAP))
1751 return -EINVAL;
1752
1753 vma->vm_start = (unsigned long)(addr + (pgoff << PAGE_SHIFT));
1754 vma->vm_end = vma->vm_start + size;
1755
1756 return 0;
1757}
1758EXPORT_SYMBOL(remap_vmalloc_range);
1759
1760unsigned long arch_get_unmapped_area(struct file *file, unsigned long addr,
1761 unsigned long len, unsigned long pgoff, unsigned long flags)
1762{
1763 return -ENOMEM;
1764}
1765
1766int filemap_fault(struct vm_fault *vmf)
1767{
1768 BUG();
1769 return 0;
1770}
1771EXPORT_SYMBOL(filemap_fault);
1772
1773void filemap_map_pages(struct vm_fault *vmf,
1774 pgoff_t start_pgoff, pgoff_t end_pgoff)
1775{
1776 BUG();
1777}
1778EXPORT_SYMBOL(filemap_map_pages);
1779
1780int __access_remote_vm(struct task_struct *tsk, struct mm_struct *mm,
1781 unsigned long addr, void *buf, int len, unsigned int gup_flags)
1782{
1783 struct vm_area_struct *vma;
1784 int write = gup_flags & FOLL_WRITE;
1785
1786 down_read(&mm->mmap_sem);
1787
1788 /* the access must start within one of the target process's mappings */
1789 vma = find_vma(mm, addr);
1790 if (vma) {
1791 /* don't overrun this mapping */
1792 if (addr + len >= vma->vm_end)
1793 len = vma->vm_end - addr;
1794
1795 /* only read or write mappings where it is permitted */
1796 if (write && vma->vm_flags & VM_MAYWRITE)
1797 copy_to_user_page(vma, NULL, addr,
1798 (void *) addr, buf, len);
1799 else if (!write && vma->vm_flags & VM_MAYREAD)
1800 copy_from_user_page(vma, NULL, addr,
1801 buf, (void *) addr, len);
1802 else
1803 len = 0;
1804 } else {
1805 len = 0;
1806 }
1807
1808 up_read(&mm->mmap_sem);
1809
1810 return len;
1811}
1812
1813/**
1814 * access_remote_vm - access another process' address space
1815 * @mm: the mm_struct of the target address space
1816 * @addr: start address to access
1817 * @buf: source or destination buffer
1818 * @len: number of bytes to transfer
1819 * @gup_flags: flags modifying lookup behaviour
1820 *
1821 * The caller must hold a reference on @mm.
1822 */
1823int access_remote_vm(struct mm_struct *mm, unsigned long addr,
1824 void *buf, int len, unsigned int gup_flags)
1825{
1826 return __access_remote_vm(NULL, mm, addr, buf, len, gup_flags);
1827}
1828
1829/*
1830 * Access another process' address space.
1831 * - source/target buffer must be kernel space
1832 */
1833int access_process_vm(struct task_struct *tsk, unsigned long addr, void *buf, int len,
1834 unsigned int gup_flags)
1835{
1836 struct mm_struct *mm;
1837
1838 if (addr + len < addr)
1839 return 0;
1840
1841 mm = get_task_mm(tsk);
1842 if (!mm)
1843 return 0;
1844
1845 len = __access_remote_vm(tsk, mm, addr, buf, len, gup_flags);
1846
1847 mmput(mm);
1848 return len;
1849}
1850EXPORT_SYMBOL_GPL(access_process_vm);
1851
1852/**
1853 * nommu_shrink_inode_mappings - Shrink the shared mappings on an inode
1854 * @inode: The inode to check
1855 * @size: The current filesize of the inode
1856 * @newsize: The proposed filesize of the inode
1857 *
1858 * Check the shared mappings on an inode on behalf of a shrinking truncate to
1859 * make sure that that any outstanding VMAs aren't broken and then shrink the
1860 * vm_regions that extend that beyond so that do_mmap_pgoff() doesn't
1861 * automatically grant mappings that are too large.
1862 */
1863int nommu_shrink_inode_mappings(struct inode *inode, size_t size,
1864 size_t newsize)
1865{
1866 struct vm_area_struct *vma;
1867 struct vm_region *region;
1868 pgoff_t low, high;
1869 size_t r_size, r_top;
1870
1871 low = newsize >> PAGE_SHIFT;
1872 high = (size + PAGE_SIZE - 1) >> PAGE_SHIFT;
1873
1874 down_write(&nommu_region_sem);
1875 i_mmap_lock_read(inode->i_mapping);
1876
1877 /* search for VMAs that fall within the dead zone */
1878 vma_interval_tree_foreach(vma, &inode->i_mapping->i_mmap, low, high) {
1879 /* found one - only interested if it's shared out of the page
1880 * cache */
1881 if (vma->vm_flags & VM_SHARED) {
1882 i_mmap_unlock_read(inode->i_mapping);
1883 up_write(&nommu_region_sem);
1884 return -ETXTBSY; /* not quite true, but near enough */
1885 }
1886 }
1887
1888 /* reduce any regions that overlap the dead zone - if in existence,
1889 * these will be pointed to by VMAs that don't overlap the dead zone
1890 *
1891 * we don't check for any regions that start beyond the EOF as there
1892 * shouldn't be any
1893 */
1894 vma_interval_tree_foreach(vma, &inode->i_mapping->i_mmap, 0, ULONG_MAX) {
1895 if (!(vma->vm_flags & VM_SHARED))
1896 continue;
1897
1898 region = vma->vm_region;
1899 r_size = region->vm_top - region->vm_start;
1900 r_top = (region->vm_pgoff << PAGE_SHIFT) + r_size;
1901
1902 if (r_top > newsize) {
1903 region->vm_top -= r_top - newsize;
1904 if (region->vm_end > region->vm_top)
1905 region->vm_end = region->vm_top;
1906 }
1907 }
1908
1909 i_mmap_unlock_read(inode->i_mapping);
1910 up_write(&nommu_region_sem);
1911 return 0;
1912}
1913
1914/*
1915 * Initialise sysctl_user_reserve_kbytes.
1916 *
1917 * This is intended to prevent a user from starting a single memory hogging
1918 * process, such that they cannot recover (kill the hog) in OVERCOMMIT_NEVER
1919 * mode.
1920 *
1921 * The default value is min(3% of free memory, 128MB)
1922 * 128MB is enough to recover with sshd/login, bash, and top/kill.
1923 */
1924static int __meminit init_user_reserve(void)
1925{
1926 unsigned long free_kbytes;
1927
1928 free_kbytes = global_zone_page_state(NR_FREE_PAGES) << (PAGE_SHIFT - 10);
1929
1930 sysctl_user_reserve_kbytes = min(free_kbytes / 32, 1UL << 17);
1931 return 0;
1932}
1933subsys_initcall(init_user_reserve);
1934
1935/*
1936 * Initialise sysctl_admin_reserve_kbytes.
1937 *
1938 * The purpose of sysctl_admin_reserve_kbytes is to allow the sys admin
1939 * to log in and kill a memory hogging process.
1940 *
1941 * Systems with more than 256MB will reserve 8MB, enough to recover
1942 * with sshd, bash, and top in OVERCOMMIT_GUESS. Smaller systems will
1943 * only reserve 3% of free pages by default.
1944 */
1945static int __meminit init_admin_reserve(void)
1946{
1947 unsigned long free_kbytes;
1948
1949 free_kbytes = global_zone_page_state(NR_FREE_PAGES) << (PAGE_SHIFT - 10);
1950
1951 sysctl_admin_reserve_kbytes = min(free_kbytes / 32, 1UL << 13);
1952 return 0;
1953}
1954subsys_initcall(init_admin_reserve);
1/*
2 * linux/mm/nommu.c
3 *
4 * Replacement code for mm functions to support CPU's that don't
5 * have any form of memory management unit (thus no virtual memory).
6 *
7 * See Documentation/nommu-mmap.txt
8 *
9 * Copyright (c) 2004-2008 David Howells <dhowells@redhat.com>
10 * Copyright (c) 2000-2003 David McCullough <davidm@snapgear.com>
11 * Copyright (c) 2000-2001 D Jeff Dionne <jeff@uClinux.org>
12 * Copyright (c) 2002 Greg Ungerer <gerg@snapgear.com>
13 * Copyright (c) 2007-2010 Paul Mundt <lethal@linux-sh.org>
14 */
15
16#include <linux/export.h>
17#include <linux/mm.h>
18#include <linux/vmacache.h>
19#include <linux/mman.h>
20#include <linux/swap.h>
21#include <linux/file.h>
22#include <linux/highmem.h>
23#include <linux/pagemap.h>
24#include <linux/slab.h>
25#include <linux/vmalloc.h>
26#include <linux/blkdev.h>
27#include <linux/backing-dev.h>
28#include <linux/compiler.h>
29#include <linux/mount.h>
30#include <linux/personality.h>
31#include <linux/security.h>
32#include <linux/syscalls.h>
33#include <linux/audit.h>
34#include <linux/sched/sysctl.h>
35
36#include <asm/uaccess.h>
37#include <asm/tlb.h>
38#include <asm/tlbflush.h>
39#include <asm/mmu_context.h>
40#include "internal.h"
41
42#if 0
43#define kenter(FMT, ...) \
44 printk(KERN_DEBUG "==> %s("FMT")\n", __func__, ##__VA_ARGS__)
45#define kleave(FMT, ...) \
46 printk(KERN_DEBUG "<== %s()"FMT"\n", __func__, ##__VA_ARGS__)
47#define kdebug(FMT, ...) \
48 printk(KERN_DEBUG "xxx" FMT"yyy\n", ##__VA_ARGS__)
49#else
50#define kenter(FMT, ...) \
51 no_printk(KERN_DEBUG "==> %s("FMT")\n", __func__, ##__VA_ARGS__)
52#define kleave(FMT, ...) \
53 no_printk(KERN_DEBUG "<== %s()"FMT"\n", __func__, ##__VA_ARGS__)
54#define kdebug(FMT, ...) \
55 no_printk(KERN_DEBUG FMT"\n", ##__VA_ARGS__)
56#endif
57
58void *high_memory;
59struct page *mem_map;
60unsigned long max_mapnr;
61unsigned long highest_memmap_pfn;
62struct percpu_counter vm_committed_as;
63int sysctl_overcommit_memory = OVERCOMMIT_GUESS; /* heuristic overcommit */
64int sysctl_overcommit_ratio = 50; /* default is 50% */
65unsigned long sysctl_overcommit_kbytes __read_mostly;
66int sysctl_max_map_count = DEFAULT_MAX_MAP_COUNT;
67int sysctl_nr_trim_pages = CONFIG_NOMMU_INITIAL_TRIM_EXCESS;
68unsigned long sysctl_user_reserve_kbytes __read_mostly = 1UL << 17; /* 128MB */
69unsigned long sysctl_admin_reserve_kbytes __read_mostly = 1UL << 13; /* 8MB */
70int heap_stack_gap = 0;
71
72atomic_long_t mmap_pages_allocated;
73
74/*
75 * The global memory commitment made in the system can be a metric
76 * that can be used to drive ballooning decisions when Linux is hosted
77 * as a guest. On Hyper-V, the host implements a policy engine for dynamically
78 * balancing memory across competing virtual machines that are hosted.
79 * Several metrics drive this policy engine including the guest reported
80 * memory commitment.
81 */
82unsigned long vm_memory_committed(void)
83{
84 return percpu_counter_read_positive(&vm_committed_as);
85}
86
87EXPORT_SYMBOL_GPL(vm_memory_committed);
88
89EXPORT_SYMBOL(mem_map);
90
91/* list of mapped, potentially shareable regions */
92static struct kmem_cache *vm_region_jar;
93struct rb_root nommu_region_tree = RB_ROOT;
94DECLARE_RWSEM(nommu_region_sem);
95
96const struct vm_operations_struct generic_file_vm_ops = {
97};
98
99/*
100 * Return the total memory allocated for this pointer, not
101 * just what the caller asked for.
102 *
103 * Doesn't have to be accurate, i.e. may have races.
104 */
105unsigned int kobjsize(const void *objp)
106{
107 struct page *page;
108
109 /*
110 * If the object we have should not have ksize performed on it,
111 * return size of 0
112 */
113 if (!objp || !virt_addr_valid(objp))
114 return 0;
115
116 page = virt_to_head_page(objp);
117
118 /*
119 * If the allocator sets PageSlab, we know the pointer came from
120 * kmalloc().
121 */
122 if (PageSlab(page))
123 return ksize(objp);
124
125 /*
126 * If it's not a compound page, see if we have a matching VMA
127 * region. This test is intentionally done in reverse order,
128 * so if there's no VMA, we still fall through and hand back
129 * PAGE_SIZE for 0-order pages.
130 */
131 if (!PageCompound(page)) {
132 struct vm_area_struct *vma;
133
134 vma = find_vma(current->mm, (unsigned long)objp);
135 if (vma)
136 return vma->vm_end - vma->vm_start;
137 }
138
139 /*
140 * The ksize() function is only guaranteed to work for pointers
141 * returned by kmalloc(). So handle arbitrary pointers here.
142 */
143 return PAGE_SIZE << compound_order(page);
144}
145
146long __get_user_pages(struct task_struct *tsk, struct mm_struct *mm,
147 unsigned long start, unsigned long nr_pages,
148 unsigned int foll_flags, struct page **pages,
149 struct vm_area_struct **vmas, int *nonblocking)
150{
151 struct vm_area_struct *vma;
152 unsigned long vm_flags;
153 int i;
154
155 /* calculate required read or write permissions.
156 * If FOLL_FORCE is set, we only require the "MAY" flags.
157 */
158 vm_flags = (foll_flags & FOLL_WRITE) ?
159 (VM_WRITE | VM_MAYWRITE) : (VM_READ | VM_MAYREAD);
160 vm_flags &= (foll_flags & FOLL_FORCE) ?
161 (VM_MAYREAD | VM_MAYWRITE) : (VM_READ | VM_WRITE);
162
163 for (i = 0; i < nr_pages; i++) {
164 vma = find_vma(mm, start);
165 if (!vma)
166 goto finish_or_fault;
167
168 /* protect what we can, including chardevs */
169 if ((vma->vm_flags & (VM_IO | VM_PFNMAP)) ||
170 !(vm_flags & vma->vm_flags))
171 goto finish_or_fault;
172
173 if (pages) {
174 pages[i] = virt_to_page(start);
175 if (pages[i])
176 page_cache_get(pages[i]);
177 }
178 if (vmas)
179 vmas[i] = vma;
180 start = (start + PAGE_SIZE) & PAGE_MASK;
181 }
182
183 return i;
184
185finish_or_fault:
186 return i ? : -EFAULT;
187}
188
189/*
190 * get a list of pages in an address range belonging to the specified process
191 * and indicate the VMA that covers each page
192 * - this is potentially dodgy as we may end incrementing the page count of a
193 * slab page or a secondary page from a compound page
194 * - don't permit access to VMAs that don't support it, such as I/O mappings
195 */
196long get_user_pages(struct task_struct *tsk, struct mm_struct *mm,
197 unsigned long start, unsigned long nr_pages,
198 int write, int force, struct page **pages,
199 struct vm_area_struct **vmas)
200{
201 int flags = 0;
202
203 if (write)
204 flags |= FOLL_WRITE;
205 if (force)
206 flags |= FOLL_FORCE;
207
208 return __get_user_pages(tsk, mm, start, nr_pages, flags, pages, vmas,
209 NULL);
210}
211EXPORT_SYMBOL(get_user_pages);
212
213/**
214 * follow_pfn - look up PFN at a user virtual address
215 * @vma: memory mapping
216 * @address: user virtual address
217 * @pfn: location to store found PFN
218 *
219 * Only IO mappings and raw PFN mappings are allowed.
220 *
221 * Returns zero and the pfn at @pfn on success, -ve otherwise.
222 */
223int follow_pfn(struct vm_area_struct *vma, unsigned long address,
224 unsigned long *pfn)
225{
226 if (!(vma->vm_flags & (VM_IO | VM_PFNMAP)))
227 return -EINVAL;
228
229 *pfn = address >> PAGE_SHIFT;
230 return 0;
231}
232EXPORT_SYMBOL(follow_pfn);
233
234LIST_HEAD(vmap_area_list);
235
236void vfree(const void *addr)
237{
238 kfree(addr);
239}
240EXPORT_SYMBOL(vfree);
241
242void *__vmalloc(unsigned long size, gfp_t gfp_mask, pgprot_t prot)
243{
244 /*
245 * You can't specify __GFP_HIGHMEM with kmalloc() since kmalloc()
246 * returns only a logical address.
247 */
248 return kmalloc(size, (gfp_mask | __GFP_COMP) & ~__GFP_HIGHMEM);
249}
250EXPORT_SYMBOL(__vmalloc);
251
252void *vmalloc_user(unsigned long size)
253{
254 void *ret;
255
256 ret = __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO,
257 PAGE_KERNEL);
258 if (ret) {
259 struct vm_area_struct *vma;
260
261 down_write(¤t->mm->mmap_sem);
262 vma = find_vma(current->mm, (unsigned long)ret);
263 if (vma)
264 vma->vm_flags |= VM_USERMAP;
265 up_write(¤t->mm->mmap_sem);
266 }
267
268 return ret;
269}
270EXPORT_SYMBOL(vmalloc_user);
271
272struct page *vmalloc_to_page(const void *addr)
273{
274 return virt_to_page(addr);
275}
276EXPORT_SYMBOL(vmalloc_to_page);
277
278unsigned long vmalloc_to_pfn(const void *addr)
279{
280 return page_to_pfn(virt_to_page(addr));
281}
282EXPORT_SYMBOL(vmalloc_to_pfn);
283
284long vread(char *buf, char *addr, unsigned long count)
285{
286 /* Don't allow overflow */
287 if ((unsigned long) buf + count < count)
288 count = -(unsigned long) buf;
289
290 memcpy(buf, addr, count);
291 return count;
292}
293
294long vwrite(char *buf, char *addr, unsigned long count)
295{
296 /* Don't allow overflow */
297 if ((unsigned long) addr + count < count)
298 count = -(unsigned long) addr;
299
300 memcpy(addr, buf, count);
301 return count;
302}
303
304/*
305 * vmalloc - allocate virtually continguos memory
306 *
307 * @size: allocation size
308 *
309 * Allocate enough pages to cover @size from the page level
310 * allocator and map them into continguos kernel virtual space.
311 *
312 * For tight control over page level allocator and protection flags
313 * use __vmalloc() instead.
314 */
315void *vmalloc(unsigned long size)
316{
317 return __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL);
318}
319EXPORT_SYMBOL(vmalloc);
320
321/*
322 * vzalloc - allocate virtually continguos memory with zero fill
323 *
324 * @size: allocation size
325 *
326 * Allocate enough pages to cover @size from the page level
327 * allocator and map them into continguos kernel virtual space.
328 * The memory allocated is set to zero.
329 *
330 * For tight control over page level allocator and protection flags
331 * use __vmalloc() instead.
332 */
333void *vzalloc(unsigned long size)
334{
335 return __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO,
336 PAGE_KERNEL);
337}
338EXPORT_SYMBOL(vzalloc);
339
340/**
341 * vmalloc_node - allocate memory on a specific node
342 * @size: allocation size
343 * @node: numa node
344 *
345 * Allocate enough pages to cover @size from the page level
346 * allocator and map them into contiguous kernel virtual space.
347 *
348 * For tight control over page level allocator and protection flags
349 * use __vmalloc() instead.
350 */
351void *vmalloc_node(unsigned long size, int node)
352{
353 return vmalloc(size);
354}
355EXPORT_SYMBOL(vmalloc_node);
356
357/**
358 * vzalloc_node - allocate memory on a specific node with zero fill
359 * @size: allocation size
360 * @node: numa node
361 *
362 * Allocate enough pages to cover @size from the page level
363 * allocator and map them into contiguous kernel virtual space.
364 * The memory allocated is set to zero.
365 *
366 * For tight control over page level allocator and protection flags
367 * use __vmalloc() instead.
368 */
369void *vzalloc_node(unsigned long size, int node)
370{
371 return vzalloc(size);
372}
373EXPORT_SYMBOL(vzalloc_node);
374
375#ifndef PAGE_KERNEL_EXEC
376# define PAGE_KERNEL_EXEC PAGE_KERNEL
377#endif
378
379/**
380 * vmalloc_exec - allocate virtually contiguous, executable memory
381 * @size: allocation size
382 *
383 * Kernel-internal function to allocate enough pages to cover @size
384 * the page level allocator and map them into contiguous and
385 * executable kernel virtual space.
386 *
387 * For tight control over page level allocator and protection flags
388 * use __vmalloc() instead.
389 */
390
391void *vmalloc_exec(unsigned long size)
392{
393 return __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL_EXEC);
394}
395
396/**
397 * vmalloc_32 - allocate virtually contiguous memory (32bit addressable)
398 * @size: allocation size
399 *
400 * Allocate enough 32bit PA addressable pages to cover @size from the
401 * page level allocator and map them into continguos kernel virtual space.
402 */
403void *vmalloc_32(unsigned long size)
404{
405 return __vmalloc(size, GFP_KERNEL, PAGE_KERNEL);
406}
407EXPORT_SYMBOL(vmalloc_32);
408
409/**
410 * vmalloc_32_user - allocate zeroed virtually contiguous 32bit memory
411 * @size: allocation size
412 *
413 * The resulting memory area is 32bit addressable and zeroed so it can be
414 * mapped to userspace without leaking data.
415 *
416 * VM_USERMAP is set on the corresponding VMA so that subsequent calls to
417 * remap_vmalloc_range() are permissible.
418 */
419void *vmalloc_32_user(unsigned long size)
420{
421 /*
422 * We'll have to sort out the ZONE_DMA bits for 64-bit,
423 * but for now this can simply use vmalloc_user() directly.
424 */
425 return vmalloc_user(size);
426}
427EXPORT_SYMBOL(vmalloc_32_user);
428
429void *vmap(struct page **pages, unsigned int count, unsigned long flags, pgprot_t prot)
430{
431 BUG();
432 return NULL;
433}
434EXPORT_SYMBOL(vmap);
435
436void vunmap(const void *addr)
437{
438 BUG();
439}
440EXPORT_SYMBOL(vunmap);
441
442void *vm_map_ram(struct page **pages, unsigned int count, int node, pgprot_t prot)
443{
444 BUG();
445 return NULL;
446}
447EXPORT_SYMBOL(vm_map_ram);
448
449void vm_unmap_ram(const void *mem, unsigned int count)
450{
451 BUG();
452}
453EXPORT_SYMBOL(vm_unmap_ram);
454
455void vm_unmap_aliases(void)
456{
457}
458EXPORT_SYMBOL_GPL(vm_unmap_aliases);
459
460/*
461 * Implement a stub for vmalloc_sync_all() if the architecture chose not to
462 * have one.
463 */
464void __weak vmalloc_sync_all(void)
465{
466}
467
468/**
469 * alloc_vm_area - allocate a range of kernel address space
470 * @size: size of the area
471 *
472 * Returns: NULL on failure, vm_struct on success
473 *
474 * This function reserves a range of kernel address space, and
475 * allocates pagetables to map that range. No actual mappings
476 * are created. If the kernel address space is not shared
477 * between processes, it syncs the pagetable across all
478 * processes.
479 */
480struct vm_struct *alloc_vm_area(size_t size, pte_t **ptes)
481{
482 BUG();
483 return NULL;
484}
485EXPORT_SYMBOL_GPL(alloc_vm_area);
486
487void free_vm_area(struct vm_struct *area)
488{
489 BUG();
490}
491EXPORT_SYMBOL_GPL(free_vm_area);
492
493int vm_insert_page(struct vm_area_struct *vma, unsigned long addr,
494 struct page *page)
495{
496 return -EINVAL;
497}
498EXPORT_SYMBOL(vm_insert_page);
499
500/*
501 * sys_brk() for the most part doesn't need the global kernel
502 * lock, except when an application is doing something nasty
503 * like trying to un-brk an area that has already been mapped
504 * to a regular file. in this case, the unmapping will need
505 * to invoke file system routines that need the global lock.
506 */
507SYSCALL_DEFINE1(brk, unsigned long, brk)
508{
509 struct mm_struct *mm = current->mm;
510
511 if (brk < mm->start_brk || brk > mm->context.end_brk)
512 return mm->brk;
513
514 if (mm->brk == brk)
515 return mm->brk;
516
517 /*
518 * Always allow shrinking brk
519 */
520 if (brk <= mm->brk) {
521 mm->brk = brk;
522 return brk;
523 }
524
525 /*
526 * Ok, looks good - let it rip.
527 */
528 flush_icache_range(mm->brk, brk);
529 return mm->brk = brk;
530}
531
532/*
533 * initialise the VMA and region record slabs
534 */
535void __init mmap_init(void)
536{
537 int ret;
538
539 ret = percpu_counter_init(&vm_committed_as, 0);
540 VM_BUG_ON(ret);
541 vm_region_jar = KMEM_CACHE(vm_region, SLAB_PANIC);
542}
543
544/*
545 * validate the region tree
546 * - the caller must hold the region lock
547 */
548#ifdef CONFIG_DEBUG_NOMMU_REGIONS
549static noinline void validate_nommu_regions(void)
550{
551 struct vm_region *region, *last;
552 struct rb_node *p, *lastp;
553
554 lastp = rb_first(&nommu_region_tree);
555 if (!lastp)
556 return;
557
558 last = rb_entry(lastp, struct vm_region, vm_rb);
559 BUG_ON(unlikely(last->vm_end <= last->vm_start));
560 BUG_ON(unlikely(last->vm_top < last->vm_end));
561
562 while ((p = rb_next(lastp))) {
563 region = rb_entry(p, struct vm_region, vm_rb);
564 last = rb_entry(lastp, struct vm_region, vm_rb);
565
566 BUG_ON(unlikely(region->vm_end <= region->vm_start));
567 BUG_ON(unlikely(region->vm_top < region->vm_end));
568 BUG_ON(unlikely(region->vm_start < last->vm_top));
569
570 lastp = p;
571 }
572}
573#else
574static void validate_nommu_regions(void)
575{
576}
577#endif
578
579/*
580 * add a region into the global tree
581 */
582static void add_nommu_region(struct vm_region *region)
583{
584 struct vm_region *pregion;
585 struct rb_node **p, *parent;
586
587 validate_nommu_regions();
588
589 parent = NULL;
590 p = &nommu_region_tree.rb_node;
591 while (*p) {
592 parent = *p;
593 pregion = rb_entry(parent, struct vm_region, vm_rb);
594 if (region->vm_start < pregion->vm_start)
595 p = &(*p)->rb_left;
596 else if (region->vm_start > pregion->vm_start)
597 p = &(*p)->rb_right;
598 else if (pregion == region)
599 return;
600 else
601 BUG();
602 }
603
604 rb_link_node(®ion->vm_rb, parent, p);
605 rb_insert_color(®ion->vm_rb, &nommu_region_tree);
606
607 validate_nommu_regions();
608}
609
610/*
611 * delete a region from the global tree
612 */
613static void delete_nommu_region(struct vm_region *region)
614{
615 BUG_ON(!nommu_region_tree.rb_node);
616
617 validate_nommu_regions();
618 rb_erase(®ion->vm_rb, &nommu_region_tree);
619 validate_nommu_regions();
620}
621
622/*
623 * free a contiguous series of pages
624 */
625static void free_page_series(unsigned long from, unsigned long to)
626{
627 for (; from < to; from += PAGE_SIZE) {
628 struct page *page = virt_to_page(from);
629
630 kdebug("- free %lx", from);
631 atomic_long_dec(&mmap_pages_allocated);
632 if (page_count(page) != 1)
633 kdebug("free page %p: refcount not one: %d",
634 page, page_count(page));
635 put_page(page);
636 }
637}
638
639/*
640 * release a reference to a region
641 * - the caller must hold the region semaphore for writing, which this releases
642 * - the region may not have been added to the tree yet, in which case vm_top
643 * will equal vm_start
644 */
645static void __put_nommu_region(struct vm_region *region)
646 __releases(nommu_region_sem)
647{
648 kenter("%p{%d}", region, region->vm_usage);
649
650 BUG_ON(!nommu_region_tree.rb_node);
651
652 if (--region->vm_usage == 0) {
653 if (region->vm_top > region->vm_start)
654 delete_nommu_region(region);
655 up_write(&nommu_region_sem);
656
657 if (region->vm_file)
658 fput(region->vm_file);
659
660 /* IO memory and memory shared directly out of the pagecache
661 * from ramfs/tmpfs mustn't be released here */
662 if (region->vm_flags & VM_MAPPED_COPY) {
663 kdebug("free series");
664 free_page_series(region->vm_start, region->vm_top);
665 }
666 kmem_cache_free(vm_region_jar, region);
667 } else {
668 up_write(&nommu_region_sem);
669 }
670}
671
672/*
673 * release a reference to a region
674 */
675static void put_nommu_region(struct vm_region *region)
676{
677 down_write(&nommu_region_sem);
678 __put_nommu_region(region);
679}
680
681/*
682 * update protection on a vma
683 */
684static void protect_vma(struct vm_area_struct *vma, unsigned long flags)
685{
686#ifdef CONFIG_MPU
687 struct mm_struct *mm = vma->vm_mm;
688 long start = vma->vm_start & PAGE_MASK;
689 while (start < vma->vm_end) {
690 protect_page(mm, start, flags);
691 start += PAGE_SIZE;
692 }
693 update_protections(mm);
694#endif
695}
696
697/*
698 * add a VMA into a process's mm_struct in the appropriate place in the list
699 * and tree and add to the address space's page tree also if not an anonymous
700 * page
701 * - should be called with mm->mmap_sem held writelocked
702 */
703static void add_vma_to_mm(struct mm_struct *mm, struct vm_area_struct *vma)
704{
705 struct vm_area_struct *pvma, *prev;
706 struct address_space *mapping;
707 struct rb_node **p, *parent, *rb_prev;
708
709 kenter(",%p", vma);
710
711 BUG_ON(!vma->vm_region);
712
713 mm->map_count++;
714 vma->vm_mm = mm;
715
716 protect_vma(vma, vma->vm_flags);
717
718 /* add the VMA to the mapping */
719 if (vma->vm_file) {
720 mapping = vma->vm_file->f_mapping;
721
722 mutex_lock(&mapping->i_mmap_mutex);
723 flush_dcache_mmap_lock(mapping);
724 vma_interval_tree_insert(vma, &mapping->i_mmap);
725 flush_dcache_mmap_unlock(mapping);
726 mutex_unlock(&mapping->i_mmap_mutex);
727 }
728
729 /* add the VMA to the tree */
730 parent = rb_prev = NULL;
731 p = &mm->mm_rb.rb_node;
732 while (*p) {
733 parent = *p;
734 pvma = rb_entry(parent, struct vm_area_struct, vm_rb);
735
736 /* sort by: start addr, end addr, VMA struct addr in that order
737 * (the latter is necessary as we may get identical VMAs) */
738 if (vma->vm_start < pvma->vm_start)
739 p = &(*p)->rb_left;
740 else if (vma->vm_start > pvma->vm_start) {
741 rb_prev = parent;
742 p = &(*p)->rb_right;
743 } else if (vma->vm_end < pvma->vm_end)
744 p = &(*p)->rb_left;
745 else if (vma->vm_end > pvma->vm_end) {
746 rb_prev = parent;
747 p = &(*p)->rb_right;
748 } else if (vma < pvma)
749 p = &(*p)->rb_left;
750 else if (vma > pvma) {
751 rb_prev = parent;
752 p = &(*p)->rb_right;
753 } else
754 BUG();
755 }
756
757 rb_link_node(&vma->vm_rb, parent, p);
758 rb_insert_color(&vma->vm_rb, &mm->mm_rb);
759
760 /* add VMA to the VMA list also */
761 prev = NULL;
762 if (rb_prev)
763 prev = rb_entry(rb_prev, struct vm_area_struct, vm_rb);
764
765 __vma_link_list(mm, vma, prev, parent);
766}
767
768/*
769 * delete a VMA from its owning mm_struct and address space
770 */
771static void delete_vma_from_mm(struct vm_area_struct *vma)
772{
773 int i;
774 struct address_space *mapping;
775 struct mm_struct *mm = vma->vm_mm;
776 struct task_struct *curr = current;
777
778 kenter("%p", vma);
779
780 protect_vma(vma, 0);
781
782 mm->map_count--;
783 for (i = 0; i < VMACACHE_SIZE; i++) {
784 /* if the vma is cached, invalidate the entire cache */
785 if (curr->vmacache[i] == vma) {
786 vmacache_invalidate(curr->mm);
787 break;
788 }
789 }
790
791 /* remove the VMA from the mapping */
792 if (vma->vm_file) {
793 mapping = vma->vm_file->f_mapping;
794
795 mutex_lock(&mapping->i_mmap_mutex);
796 flush_dcache_mmap_lock(mapping);
797 vma_interval_tree_remove(vma, &mapping->i_mmap);
798 flush_dcache_mmap_unlock(mapping);
799 mutex_unlock(&mapping->i_mmap_mutex);
800 }
801
802 /* remove from the MM's tree and list */
803 rb_erase(&vma->vm_rb, &mm->mm_rb);
804
805 if (vma->vm_prev)
806 vma->vm_prev->vm_next = vma->vm_next;
807 else
808 mm->mmap = vma->vm_next;
809
810 if (vma->vm_next)
811 vma->vm_next->vm_prev = vma->vm_prev;
812}
813
814/*
815 * destroy a VMA record
816 */
817static void delete_vma(struct mm_struct *mm, struct vm_area_struct *vma)
818{
819 kenter("%p", vma);
820 if (vma->vm_ops && vma->vm_ops->close)
821 vma->vm_ops->close(vma);
822 if (vma->vm_file)
823 fput(vma->vm_file);
824 put_nommu_region(vma->vm_region);
825 kmem_cache_free(vm_area_cachep, vma);
826}
827
828/*
829 * look up the first VMA in which addr resides, NULL if none
830 * - should be called with mm->mmap_sem at least held readlocked
831 */
832struct vm_area_struct *find_vma(struct mm_struct *mm, unsigned long addr)
833{
834 struct vm_area_struct *vma;
835
836 /* check the cache first */
837 vma = vmacache_find(mm, addr);
838 if (likely(vma))
839 return vma;
840
841 /* trawl the list (there may be multiple mappings in which addr
842 * resides) */
843 for (vma = mm->mmap; vma; vma = vma->vm_next) {
844 if (vma->vm_start > addr)
845 return NULL;
846 if (vma->vm_end > addr) {
847 vmacache_update(addr, vma);
848 return vma;
849 }
850 }
851
852 return NULL;
853}
854EXPORT_SYMBOL(find_vma);
855
856/*
857 * find a VMA
858 * - we don't extend stack VMAs under NOMMU conditions
859 */
860struct vm_area_struct *find_extend_vma(struct mm_struct *mm, unsigned long addr)
861{
862 return find_vma(mm, addr);
863}
864
865/*
866 * expand a stack to a given address
867 * - not supported under NOMMU conditions
868 */
869int expand_stack(struct vm_area_struct *vma, unsigned long address)
870{
871 return -ENOMEM;
872}
873
874/*
875 * look up the first VMA exactly that exactly matches addr
876 * - should be called with mm->mmap_sem at least held readlocked
877 */
878static struct vm_area_struct *find_vma_exact(struct mm_struct *mm,
879 unsigned long addr,
880 unsigned long len)
881{
882 struct vm_area_struct *vma;
883 unsigned long end = addr + len;
884
885 /* check the cache first */
886 vma = vmacache_find_exact(mm, addr, end);
887 if (vma)
888 return vma;
889
890 /* trawl the list (there may be multiple mappings in which addr
891 * resides) */
892 for (vma = mm->mmap; vma; vma = vma->vm_next) {
893 if (vma->vm_start < addr)
894 continue;
895 if (vma->vm_start > addr)
896 return NULL;
897 if (vma->vm_end == end) {
898 vmacache_update(addr, vma);
899 return vma;
900 }
901 }
902
903 return NULL;
904}
905
906/*
907 * determine whether a mapping should be permitted and, if so, what sort of
908 * mapping we're capable of supporting
909 */
910static int validate_mmap_request(struct file *file,
911 unsigned long addr,
912 unsigned long len,
913 unsigned long prot,
914 unsigned long flags,
915 unsigned long pgoff,
916 unsigned long *_capabilities)
917{
918 unsigned long capabilities, rlen;
919 int ret;
920
921 /* do the simple checks first */
922 if (flags & MAP_FIXED) {
923 printk(KERN_DEBUG
924 "%d: Can't do fixed-address/overlay mmap of RAM\n",
925 current->pid);
926 return -EINVAL;
927 }
928
929 if ((flags & MAP_TYPE) != MAP_PRIVATE &&
930 (flags & MAP_TYPE) != MAP_SHARED)
931 return -EINVAL;
932
933 if (!len)
934 return -EINVAL;
935
936 /* Careful about overflows.. */
937 rlen = PAGE_ALIGN(len);
938 if (!rlen || rlen > TASK_SIZE)
939 return -ENOMEM;
940
941 /* offset overflow? */
942 if ((pgoff + (rlen >> PAGE_SHIFT)) < pgoff)
943 return -EOVERFLOW;
944
945 if (file) {
946 /* validate file mapping requests */
947 struct address_space *mapping;
948
949 /* files must support mmap */
950 if (!file->f_op->mmap)
951 return -ENODEV;
952
953 /* work out if what we've got could possibly be shared
954 * - we support chardevs that provide their own "memory"
955 * - we support files/blockdevs that are memory backed
956 */
957 mapping = file->f_mapping;
958 if (!mapping)
959 mapping = file_inode(file)->i_mapping;
960
961 capabilities = 0;
962 if (mapping && mapping->backing_dev_info)
963 capabilities = mapping->backing_dev_info->capabilities;
964
965 if (!capabilities) {
966 /* no explicit capabilities set, so assume some
967 * defaults */
968 switch (file_inode(file)->i_mode & S_IFMT) {
969 case S_IFREG:
970 case S_IFBLK:
971 capabilities = BDI_CAP_MAP_COPY;
972 break;
973
974 case S_IFCHR:
975 capabilities =
976 BDI_CAP_MAP_DIRECT |
977 BDI_CAP_READ_MAP |
978 BDI_CAP_WRITE_MAP;
979 break;
980
981 default:
982 return -EINVAL;
983 }
984 }
985
986 /* eliminate any capabilities that we can't support on this
987 * device */
988 if (!file->f_op->get_unmapped_area)
989 capabilities &= ~BDI_CAP_MAP_DIRECT;
990 if (!file->f_op->read)
991 capabilities &= ~BDI_CAP_MAP_COPY;
992
993 /* The file shall have been opened with read permission. */
994 if (!(file->f_mode & FMODE_READ))
995 return -EACCES;
996
997 if (flags & MAP_SHARED) {
998 /* do checks for writing, appending and locking */
999 if ((prot & PROT_WRITE) &&
1000 !(file->f_mode & FMODE_WRITE))
1001 return -EACCES;
1002
1003 if (IS_APPEND(file_inode(file)) &&
1004 (file->f_mode & FMODE_WRITE))
1005 return -EACCES;
1006
1007 if (locks_verify_locked(file))
1008 return -EAGAIN;
1009
1010 if (!(capabilities & BDI_CAP_MAP_DIRECT))
1011 return -ENODEV;
1012
1013 /* we mustn't privatise shared mappings */
1014 capabilities &= ~BDI_CAP_MAP_COPY;
1015 } else {
1016 /* we're going to read the file into private memory we
1017 * allocate */
1018 if (!(capabilities & BDI_CAP_MAP_COPY))
1019 return -ENODEV;
1020
1021 /* we don't permit a private writable mapping to be
1022 * shared with the backing device */
1023 if (prot & PROT_WRITE)
1024 capabilities &= ~BDI_CAP_MAP_DIRECT;
1025 }
1026
1027 if (capabilities & BDI_CAP_MAP_DIRECT) {
1028 if (((prot & PROT_READ) && !(capabilities & BDI_CAP_READ_MAP)) ||
1029 ((prot & PROT_WRITE) && !(capabilities & BDI_CAP_WRITE_MAP)) ||
1030 ((prot & PROT_EXEC) && !(capabilities & BDI_CAP_EXEC_MAP))
1031 ) {
1032 capabilities &= ~BDI_CAP_MAP_DIRECT;
1033 if (flags & MAP_SHARED) {
1034 printk(KERN_WARNING
1035 "MAP_SHARED not completely supported on !MMU\n");
1036 return -EINVAL;
1037 }
1038 }
1039 }
1040
1041 /* handle executable mappings and implied executable
1042 * mappings */
1043 if (file->f_path.mnt->mnt_flags & MNT_NOEXEC) {
1044 if (prot & PROT_EXEC)
1045 return -EPERM;
1046 } else if ((prot & PROT_READ) && !(prot & PROT_EXEC)) {
1047 /* handle implication of PROT_EXEC by PROT_READ */
1048 if (current->personality & READ_IMPLIES_EXEC) {
1049 if (capabilities & BDI_CAP_EXEC_MAP)
1050 prot |= PROT_EXEC;
1051 }
1052 } else if ((prot & PROT_READ) &&
1053 (prot & PROT_EXEC) &&
1054 !(capabilities & BDI_CAP_EXEC_MAP)
1055 ) {
1056 /* backing file is not executable, try to copy */
1057 capabilities &= ~BDI_CAP_MAP_DIRECT;
1058 }
1059 } else {
1060 /* anonymous mappings are always memory backed and can be
1061 * privately mapped
1062 */
1063 capabilities = BDI_CAP_MAP_COPY;
1064
1065 /* handle PROT_EXEC implication by PROT_READ */
1066 if ((prot & PROT_READ) &&
1067 (current->personality & READ_IMPLIES_EXEC))
1068 prot |= PROT_EXEC;
1069 }
1070
1071 /* allow the security API to have its say */
1072 ret = security_mmap_addr(addr);
1073 if (ret < 0)
1074 return ret;
1075
1076 /* looks okay */
1077 *_capabilities = capabilities;
1078 return 0;
1079}
1080
1081/*
1082 * we've determined that we can make the mapping, now translate what we
1083 * now know into VMA flags
1084 */
1085static unsigned long determine_vm_flags(struct file *file,
1086 unsigned long prot,
1087 unsigned long flags,
1088 unsigned long capabilities)
1089{
1090 unsigned long vm_flags;
1091
1092 vm_flags = calc_vm_prot_bits(prot) | calc_vm_flag_bits(flags);
1093 /* vm_flags |= mm->def_flags; */
1094
1095 if (!(capabilities & BDI_CAP_MAP_DIRECT)) {
1096 /* attempt to share read-only copies of mapped file chunks */
1097 vm_flags |= VM_MAYREAD | VM_MAYWRITE | VM_MAYEXEC;
1098 if (file && !(prot & PROT_WRITE))
1099 vm_flags |= VM_MAYSHARE;
1100 } else {
1101 /* overlay a shareable mapping on the backing device or inode
1102 * if possible - used for chardevs, ramfs/tmpfs/shmfs and
1103 * romfs/cramfs */
1104 vm_flags |= VM_MAYSHARE | (capabilities & BDI_CAP_VMFLAGS);
1105 if (flags & MAP_SHARED)
1106 vm_flags |= VM_SHARED;
1107 }
1108
1109 /* refuse to let anyone share private mappings with this process if
1110 * it's being traced - otherwise breakpoints set in it may interfere
1111 * with another untraced process
1112 */
1113 if ((flags & MAP_PRIVATE) && current->ptrace)
1114 vm_flags &= ~VM_MAYSHARE;
1115
1116 return vm_flags;
1117}
1118
1119/*
1120 * set up a shared mapping on a file (the driver or filesystem provides and
1121 * pins the storage)
1122 */
1123static int do_mmap_shared_file(struct vm_area_struct *vma)
1124{
1125 int ret;
1126
1127 ret = vma->vm_file->f_op->mmap(vma->vm_file, vma);
1128 if (ret == 0) {
1129 vma->vm_region->vm_top = vma->vm_region->vm_end;
1130 return 0;
1131 }
1132 if (ret != -ENOSYS)
1133 return ret;
1134
1135 /* getting -ENOSYS indicates that direct mmap isn't possible (as
1136 * opposed to tried but failed) so we can only give a suitable error as
1137 * it's not possible to make a private copy if MAP_SHARED was given */
1138 return -ENODEV;
1139}
1140
1141/*
1142 * set up a private mapping or an anonymous shared mapping
1143 */
1144static int do_mmap_private(struct vm_area_struct *vma,
1145 struct vm_region *region,
1146 unsigned long len,
1147 unsigned long capabilities)
1148{
1149 struct page *pages;
1150 unsigned long total, point, n;
1151 void *base;
1152 int ret, order;
1153
1154 /* invoke the file's mapping function so that it can keep track of
1155 * shared mappings on devices or memory
1156 * - VM_MAYSHARE will be set if it may attempt to share
1157 */
1158 if (capabilities & BDI_CAP_MAP_DIRECT) {
1159 ret = vma->vm_file->f_op->mmap(vma->vm_file, vma);
1160 if (ret == 0) {
1161 /* shouldn't return success if we're not sharing */
1162 BUG_ON(!(vma->vm_flags & VM_MAYSHARE));
1163 vma->vm_region->vm_top = vma->vm_region->vm_end;
1164 return 0;
1165 }
1166 if (ret != -ENOSYS)
1167 return ret;
1168
1169 /* getting an ENOSYS error indicates that direct mmap isn't
1170 * possible (as opposed to tried but failed) so we'll try to
1171 * make a private copy of the data and map that instead */
1172 }
1173
1174
1175 /* allocate some memory to hold the mapping
1176 * - note that this may not return a page-aligned address if the object
1177 * we're allocating is smaller than a page
1178 */
1179 order = get_order(len);
1180 kdebug("alloc order %d for %lx", order, len);
1181
1182 pages = alloc_pages(GFP_KERNEL, order);
1183 if (!pages)
1184 goto enomem;
1185
1186 total = 1 << order;
1187 atomic_long_add(total, &mmap_pages_allocated);
1188
1189 point = len >> PAGE_SHIFT;
1190
1191 /* we allocated a power-of-2 sized page set, so we may want to trim off
1192 * the excess */
1193 if (sysctl_nr_trim_pages && total - point >= sysctl_nr_trim_pages) {
1194 while (total > point) {
1195 order = ilog2(total - point);
1196 n = 1 << order;
1197 kdebug("shave %lu/%lu @%lu", n, total - point, total);
1198 atomic_long_sub(n, &mmap_pages_allocated);
1199 total -= n;
1200 set_page_refcounted(pages + total);
1201 __free_pages(pages + total, order);
1202 }
1203 }
1204
1205 for (point = 1; point < total; point++)
1206 set_page_refcounted(&pages[point]);
1207
1208 base = page_address(pages);
1209 region->vm_flags = vma->vm_flags |= VM_MAPPED_COPY;
1210 region->vm_start = (unsigned long) base;
1211 region->vm_end = region->vm_start + len;
1212 region->vm_top = region->vm_start + (total << PAGE_SHIFT);
1213
1214 vma->vm_start = region->vm_start;
1215 vma->vm_end = region->vm_start + len;
1216
1217 if (vma->vm_file) {
1218 /* read the contents of a file into the copy */
1219 mm_segment_t old_fs;
1220 loff_t fpos;
1221
1222 fpos = vma->vm_pgoff;
1223 fpos <<= PAGE_SHIFT;
1224
1225 old_fs = get_fs();
1226 set_fs(KERNEL_DS);
1227 ret = vma->vm_file->f_op->read(vma->vm_file, base, len, &fpos);
1228 set_fs(old_fs);
1229
1230 if (ret < 0)
1231 goto error_free;
1232
1233 /* clear the last little bit */
1234 if (ret < len)
1235 memset(base + ret, 0, len - ret);
1236
1237 }
1238
1239 return 0;
1240
1241error_free:
1242 free_page_series(region->vm_start, region->vm_top);
1243 region->vm_start = vma->vm_start = 0;
1244 region->vm_end = vma->vm_end = 0;
1245 region->vm_top = 0;
1246 return ret;
1247
1248enomem:
1249 printk("Allocation of length %lu from process %d (%s) failed\n",
1250 len, current->pid, current->comm);
1251 show_free_areas(0);
1252 return -ENOMEM;
1253}
1254
1255/*
1256 * handle mapping creation for uClinux
1257 */
1258unsigned long do_mmap_pgoff(struct file *file,
1259 unsigned long addr,
1260 unsigned long len,
1261 unsigned long prot,
1262 unsigned long flags,
1263 unsigned long pgoff,
1264 unsigned long *populate)
1265{
1266 struct vm_area_struct *vma;
1267 struct vm_region *region;
1268 struct rb_node *rb;
1269 unsigned long capabilities, vm_flags, result;
1270 int ret;
1271
1272 kenter(",%lx,%lx,%lx,%lx,%lx", addr, len, prot, flags, pgoff);
1273
1274 *populate = 0;
1275
1276 /* decide whether we should attempt the mapping, and if so what sort of
1277 * mapping */
1278 ret = validate_mmap_request(file, addr, len, prot, flags, pgoff,
1279 &capabilities);
1280 if (ret < 0) {
1281 kleave(" = %d [val]", ret);
1282 return ret;
1283 }
1284
1285 /* we ignore the address hint */
1286 addr = 0;
1287 len = PAGE_ALIGN(len);
1288
1289 /* we've determined that we can make the mapping, now translate what we
1290 * now know into VMA flags */
1291 vm_flags = determine_vm_flags(file, prot, flags, capabilities);
1292
1293 /* we're going to need to record the mapping */
1294 region = kmem_cache_zalloc(vm_region_jar, GFP_KERNEL);
1295 if (!region)
1296 goto error_getting_region;
1297
1298 vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL);
1299 if (!vma)
1300 goto error_getting_vma;
1301
1302 region->vm_usage = 1;
1303 region->vm_flags = vm_flags;
1304 region->vm_pgoff = pgoff;
1305
1306 INIT_LIST_HEAD(&vma->anon_vma_chain);
1307 vma->vm_flags = vm_flags;
1308 vma->vm_pgoff = pgoff;
1309
1310 if (file) {
1311 region->vm_file = get_file(file);
1312 vma->vm_file = get_file(file);
1313 }
1314
1315 down_write(&nommu_region_sem);
1316
1317 /* if we want to share, we need to check for regions created by other
1318 * mmap() calls that overlap with our proposed mapping
1319 * - we can only share with a superset match on most regular files
1320 * - shared mappings on character devices and memory backed files are
1321 * permitted to overlap inexactly as far as we are concerned for in
1322 * these cases, sharing is handled in the driver or filesystem rather
1323 * than here
1324 */
1325 if (vm_flags & VM_MAYSHARE) {
1326 struct vm_region *pregion;
1327 unsigned long pglen, rpglen, pgend, rpgend, start;
1328
1329 pglen = (len + PAGE_SIZE - 1) >> PAGE_SHIFT;
1330 pgend = pgoff + pglen;
1331
1332 for (rb = rb_first(&nommu_region_tree); rb; rb = rb_next(rb)) {
1333 pregion = rb_entry(rb, struct vm_region, vm_rb);
1334
1335 if (!(pregion->vm_flags & VM_MAYSHARE))
1336 continue;
1337
1338 /* search for overlapping mappings on the same file */
1339 if (file_inode(pregion->vm_file) !=
1340 file_inode(file))
1341 continue;
1342
1343 if (pregion->vm_pgoff >= pgend)
1344 continue;
1345
1346 rpglen = pregion->vm_end - pregion->vm_start;
1347 rpglen = (rpglen + PAGE_SIZE - 1) >> PAGE_SHIFT;
1348 rpgend = pregion->vm_pgoff + rpglen;
1349 if (pgoff >= rpgend)
1350 continue;
1351
1352 /* handle inexactly overlapping matches between
1353 * mappings */
1354 if ((pregion->vm_pgoff != pgoff || rpglen != pglen) &&
1355 !(pgoff >= pregion->vm_pgoff && pgend <= rpgend)) {
1356 /* new mapping is not a subset of the region */
1357 if (!(capabilities & BDI_CAP_MAP_DIRECT))
1358 goto sharing_violation;
1359 continue;
1360 }
1361
1362 /* we've found a region we can share */
1363 pregion->vm_usage++;
1364 vma->vm_region = pregion;
1365 start = pregion->vm_start;
1366 start += (pgoff - pregion->vm_pgoff) << PAGE_SHIFT;
1367 vma->vm_start = start;
1368 vma->vm_end = start + len;
1369
1370 if (pregion->vm_flags & VM_MAPPED_COPY) {
1371 kdebug("share copy");
1372 vma->vm_flags |= VM_MAPPED_COPY;
1373 } else {
1374 kdebug("share mmap");
1375 ret = do_mmap_shared_file(vma);
1376 if (ret < 0) {
1377 vma->vm_region = NULL;
1378 vma->vm_start = 0;
1379 vma->vm_end = 0;
1380 pregion->vm_usage--;
1381 pregion = NULL;
1382 goto error_just_free;
1383 }
1384 }
1385 fput(region->vm_file);
1386 kmem_cache_free(vm_region_jar, region);
1387 region = pregion;
1388 result = start;
1389 goto share;
1390 }
1391
1392 /* obtain the address at which to make a shared mapping
1393 * - this is the hook for quasi-memory character devices to
1394 * tell us the location of a shared mapping
1395 */
1396 if (capabilities & BDI_CAP_MAP_DIRECT) {
1397 addr = file->f_op->get_unmapped_area(file, addr, len,
1398 pgoff, flags);
1399 if (IS_ERR_VALUE(addr)) {
1400 ret = addr;
1401 if (ret != -ENOSYS)
1402 goto error_just_free;
1403
1404 /* the driver refused to tell us where to site
1405 * the mapping so we'll have to attempt to copy
1406 * it */
1407 ret = -ENODEV;
1408 if (!(capabilities & BDI_CAP_MAP_COPY))
1409 goto error_just_free;
1410
1411 capabilities &= ~BDI_CAP_MAP_DIRECT;
1412 } else {
1413 vma->vm_start = region->vm_start = addr;
1414 vma->vm_end = region->vm_end = addr + len;
1415 }
1416 }
1417 }
1418
1419 vma->vm_region = region;
1420
1421 /* set up the mapping
1422 * - the region is filled in if BDI_CAP_MAP_DIRECT is still set
1423 */
1424 if (file && vma->vm_flags & VM_SHARED)
1425 ret = do_mmap_shared_file(vma);
1426 else
1427 ret = do_mmap_private(vma, region, len, capabilities);
1428 if (ret < 0)
1429 goto error_just_free;
1430 add_nommu_region(region);
1431
1432 /* clear anonymous mappings that don't ask for uninitialized data */
1433 if (!vma->vm_file && !(flags & MAP_UNINITIALIZED))
1434 memset((void *)region->vm_start, 0,
1435 region->vm_end - region->vm_start);
1436
1437 /* okay... we have a mapping; now we have to register it */
1438 result = vma->vm_start;
1439
1440 current->mm->total_vm += len >> PAGE_SHIFT;
1441
1442share:
1443 add_vma_to_mm(current->mm, vma);
1444
1445 /* we flush the region from the icache only when the first executable
1446 * mapping of it is made */
1447 if (vma->vm_flags & VM_EXEC && !region->vm_icache_flushed) {
1448 flush_icache_range(region->vm_start, region->vm_end);
1449 region->vm_icache_flushed = true;
1450 }
1451
1452 up_write(&nommu_region_sem);
1453
1454 kleave(" = %lx", result);
1455 return result;
1456
1457error_just_free:
1458 up_write(&nommu_region_sem);
1459error:
1460 if (region->vm_file)
1461 fput(region->vm_file);
1462 kmem_cache_free(vm_region_jar, region);
1463 if (vma->vm_file)
1464 fput(vma->vm_file);
1465 kmem_cache_free(vm_area_cachep, vma);
1466 kleave(" = %d", ret);
1467 return ret;
1468
1469sharing_violation:
1470 up_write(&nommu_region_sem);
1471 printk(KERN_WARNING "Attempt to share mismatched mappings\n");
1472 ret = -EINVAL;
1473 goto error;
1474
1475error_getting_vma:
1476 kmem_cache_free(vm_region_jar, region);
1477 printk(KERN_WARNING "Allocation of vma for %lu byte allocation"
1478 " from process %d failed\n",
1479 len, current->pid);
1480 show_free_areas(0);
1481 return -ENOMEM;
1482
1483error_getting_region:
1484 printk(KERN_WARNING "Allocation of vm region for %lu byte allocation"
1485 " from process %d failed\n",
1486 len, current->pid);
1487 show_free_areas(0);
1488 return -ENOMEM;
1489}
1490
1491SYSCALL_DEFINE6(mmap_pgoff, unsigned long, addr, unsigned long, len,
1492 unsigned long, prot, unsigned long, flags,
1493 unsigned long, fd, unsigned long, pgoff)
1494{
1495 struct file *file = NULL;
1496 unsigned long retval = -EBADF;
1497
1498 audit_mmap_fd(fd, flags);
1499 if (!(flags & MAP_ANONYMOUS)) {
1500 file = fget(fd);
1501 if (!file)
1502 goto out;
1503 }
1504
1505 flags &= ~(MAP_EXECUTABLE | MAP_DENYWRITE);
1506
1507 retval = vm_mmap_pgoff(file, addr, len, prot, flags, pgoff);
1508
1509 if (file)
1510 fput(file);
1511out:
1512 return retval;
1513}
1514
1515#ifdef __ARCH_WANT_SYS_OLD_MMAP
1516struct mmap_arg_struct {
1517 unsigned long addr;
1518 unsigned long len;
1519 unsigned long prot;
1520 unsigned long flags;
1521 unsigned long fd;
1522 unsigned long offset;
1523};
1524
1525SYSCALL_DEFINE1(old_mmap, struct mmap_arg_struct __user *, arg)
1526{
1527 struct mmap_arg_struct a;
1528
1529 if (copy_from_user(&a, arg, sizeof(a)))
1530 return -EFAULT;
1531 if (a.offset & ~PAGE_MASK)
1532 return -EINVAL;
1533
1534 return sys_mmap_pgoff(a.addr, a.len, a.prot, a.flags, a.fd,
1535 a.offset >> PAGE_SHIFT);
1536}
1537#endif /* __ARCH_WANT_SYS_OLD_MMAP */
1538
1539/*
1540 * split a vma into two pieces at address 'addr', a new vma is allocated either
1541 * for the first part or the tail.
1542 */
1543int split_vma(struct mm_struct *mm, struct vm_area_struct *vma,
1544 unsigned long addr, int new_below)
1545{
1546 struct vm_area_struct *new;
1547 struct vm_region *region;
1548 unsigned long npages;
1549
1550 kenter("");
1551
1552 /* we're only permitted to split anonymous regions (these should have
1553 * only a single usage on the region) */
1554 if (vma->vm_file)
1555 return -ENOMEM;
1556
1557 if (mm->map_count >= sysctl_max_map_count)
1558 return -ENOMEM;
1559
1560 region = kmem_cache_alloc(vm_region_jar, GFP_KERNEL);
1561 if (!region)
1562 return -ENOMEM;
1563
1564 new = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
1565 if (!new) {
1566 kmem_cache_free(vm_region_jar, region);
1567 return -ENOMEM;
1568 }
1569
1570 /* most fields are the same, copy all, and then fixup */
1571 *new = *vma;
1572 *region = *vma->vm_region;
1573 new->vm_region = region;
1574
1575 npages = (addr - vma->vm_start) >> PAGE_SHIFT;
1576
1577 if (new_below) {
1578 region->vm_top = region->vm_end = new->vm_end = addr;
1579 } else {
1580 region->vm_start = new->vm_start = addr;
1581 region->vm_pgoff = new->vm_pgoff += npages;
1582 }
1583
1584 if (new->vm_ops && new->vm_ops->open)
1585 new->vm_ops->open(new);
1586
1587 delete_vma_from_mm(vma);
1588 down_write(&nommu_region_sem);
1589 delete_nommu_region(vma->vm_region);
1590 if (new_below) {
1591 vma->vm_region->vm_start = vma->vm_start = addr;
1592 vma->vm_region->vm_pgoff = vma->vm_pgoff += npages;
1593 } else {
1594 vma->vm_region->vm_end = vma->vm_end = addr;
1595 vma->vm_region->vm_top = addr;
1596 }
1597 add_nommu_region(vma->vm_region);
1598 add_nommu_region(new->vm_region);
1599 up_write(&nommu_region_sem);
1600 add_vma_to_mm(mm, vma);
1601 add_vma_to_mm(mm, new);
1602 return 0;
1603}
1604
1605/*
1606 * shrink a VMA by removing the specified chunk from either the beginning or
1607 * the end
1608 */
1609static int shrink_vma(struct mm_struct *mm,
1610 struct vm_area_struct *vma,
1611 unsigned long from, unsigned long to)
1612{
1613 struct vm_region *region;
1614
1615 kenter("");
1616
1617 /* adjust the VMA's pointers, which may reposition it in the MM's tree
1618 * and list */
1619 delete_vma_from_mm(vma);
1620 if (from > vma->vm_start)
1621 vma->vm_end = from;
1622 else
1623 vma->vm_start = to;
1624 add_vma_to_mm(mm, vma);
1625
1626 /* cut the backing region down to size */
1627 region = vma->vm_region;
1628 BUG_ON(region->vm_usage != 1);
1629
1630 down_write(&nommu_region_sem);
1631 delete_nommu_region(region);
1632 if (from > region->vm_start) {
1633 to = region->vm_top;
1634 region->vm_top = region->vm_end = from;
1635 } else {
1636 region->vm_start = to;
1637 }
1638 add_nommu_region(region);
1639 up_write(&nommu_region_sem);
1640
1641 free_page_series(from, to);
1642 return 0;
1643}
1644
1645/*
1646 * release a mapping
1647 * - under NOMMU conditions the chunk to be unmapped must be backed by a single
1648 * VMA, though it need not cover the whole VMA
1649 */
1650int do_munmap(struct mm_struct *mm, unsigned long start, size_t len)
1651{
1652 struct vm_area_struct *vma;
1653 unsigned long end;
1654 int ret;
1655
1656 kenter(",%lx,%zx", start, len);
1657
1658 len = PAGE_ALIGN(len);
1659 if (len == 0)
1660 return -EINVAL;
1661
1662 end = start + len;
1663
1664 /* find the first potentially overlapping VMA */
1665 vma = find_vma(mm, start);
1666 if (!vma) {
1667 static int limit;
1668 if (limit < 5) {
1669 printk(KERN_WARNING
1670 "munmap of memory not mmapped by process %d"
1671 " (%s): 0x%lx-0x%lx\n",
1672 current->pid, current->comm,
1673 start, start + len - 1);
1674 limit++;
1675 }
1676 return -EINVAL;
1677 }
1678
1679 /* we're allowed to split an anonymous VMA but not a file-backed one */
1680 if (vma->vm_file) {
1681 do {
1682 if (start > vma->vm_start) {
1683 kleave(" = -EINVAL [miss]");
1684 return -EINVAL;
1685 }
1686 if (end == vma->vm_end)
1687 goto erase_whole_vma;
1688 vma = vma->vm_next;
1689 } while (vma);
1690 kleave(" = -EINVAL [split file]");
1691 return -EINVAL;
1692 } else {
1693 /* the chunk must be a subset of the VMA found */
1694 if (start == vma->vm_start && end == vma->vm_end)
1695 goto erase_whole_vma;
1696 if (start < vma->vm_start || end > vma->vm_end) {
1697 kleave(" = -EINVAL [superset]");
1698 return -EINVAL;
1699 }
1700 if (start & ~PAGE_MASK) {
1701 kleave(" = -EINVAL [unaligned start]");
1702 return -EINVAL;
1703 }
1704 if (end != vma->vm_end && end & ~PAGE_MASK) {
1705 kleave(" = -EINVAL [unaligned split]");
1706 return -EINVAL;
1707 }
1708 if (start != vma->vm_start && end != vma->vm_end) {
1709 ret = split_vma(mm, vma, start, 1);
1710 if (ret < 0) {
1711 kleave(" = %d [split]", ret);
1712 return ret;
1713 }
1714 }
1715 return shrink_vma(mm, vma, start, end);
1716 }
1717
1718erase_whole_vma:
1719 delete_vma_from_mm(vma);
1720 delete_vma(mm, vma);
1721 kleave(" = 0");
1722 return 0;
1723}
1724EXPORT_SYMBOL(do_munmap);
1725
1726int vm_munmap(unsigned long addr, size_t len)
1727{
1728 struct mm_struct *mm = current->mm;
1729 int ret;
1730
1731 down_write(&mm->mmap_sem);
1732 ret = do_munmap(mm, addr, len);
1733 up_write(&mm->mmap_sem);
1734 return ret;
1735}
1736EXPORT_SYMBOL(vm_munmap);
1737
1738SYSCALL_DEFINE2(munmap, unsigned long, addr, size_t, len)
1739{
1740 return vm_munmap(addr, len);
1741}
1742
1743/*
1744 * release all the mappings made in a process's VM space
1745 */
1746void exit_mmap(struct mm_struct *mm)
1747{
1748 struct vm_area_struct *vma;
1749
1750 if (!mm)
1751 return;
1752
1753 kenter("");
1754
1755 mm->total_vm = 0;
1756
1757 while ((vma = mm->mmap)) {
1758 mm->mmap = vma->vm_next;
1759 delete_vma_from_mm(vma);
1760 delete_vma(mm, vma);
1761 cond_resched();
1762 }
1763
1764 kleave("");
1765}
1766
1767unsigned long vm_brk(unsigned long addr, unsigned long len)
1768{
1769 return -ENOMEM;
1770}
1771
1772/*
1773 * expand (or shrink) an existing mapping, potentially moving it at the same
1774 * time (controlled by the MREMAP_MAYMOVE flag and available VM space)
1775 *
1776 * under NOMMU conditions, we only permit changing a mapping's size, and only
1777 * as long as it stays within the region allocated by do_mmap_private() and the
1778 * block is not shareable
1779 *
1780 * MREMAP_FIXED is not supported under NOMMU conditions
1781 */
1782static unsigned long do_mremap(unsigned long addr,
1783 unsigned long old_len, unsigned long new_len,
1784 unsigned long flags, unsigned long new_addr)
1785{
1786 struct vm_area_struct *vma;
1787
1788 /* insanity checks first */
1789 old_len = PAGE_ALIGN(old_len);
1790 new_len = PAGE_ALIGN(new_len);
1791 if (old_len == 0 || new_len == 0)
1792 return (unsigned long) -EINVAL;
1793
1794 if (addr & ~PAGE_MASK)
1795 return -EINVAL;
1796
1797 if (flags & MREMAP_FIXED && new_addr != addr)
1798 return (unsigned long) -EINVAL;
1799
1800 vma = find_vma_exact(current->mm, addr, old_len);
1801 if (!vma)
1802 return (unsigned long) -EINVAL;
1803
1804 if (vma->vm_end != vma->vm_start + old_len)
1805 return (unsigned long) -EFAULT;
1806
1807 if (vma->vm_flags & VM_MAYSHARE)
1808 return (unsigned long) -EPERM;
1809
1810 if (new_len > vma->vm_region->vm_end - vma->vm_region->vm_start)
1811 return (unsigned long) -ENOMEM;
1812
1813 /* all checks complete - do it */
1814 vma->vm_end = vma->vm_start + new_len;
1815 return vma->vm_start;
1816}
1817
1818SYSCALL_DEFINE5(mremap, unsigned long, addr, unsigned long, old_len,
1819 unsigned long, new_len, unsigned long, flags,
1820 unsigned long, new_addr)
1821{
1822 unsigned long ret;
1823
1824 down_write(¤t->mm->mmap_sem);
1825 ret = do_mremap(addr, old_len, new_len, flags, new_addr);
1826 up_write(¤t->mm->mmap_sem);
1827 return ret;
1828}
1829
1830struct page *follow_page_mask(struct vm_area_struct *vma,
1831 unsigned long address, unsigned int flags,
1832 unsigned int *page_mask)
1833{
1834 *page_mask = 0;
1835 return NULL;
1836}
1837
1838int remap_pfn_range(struct vm_area_struct *vma, unsigned long addr,
1839 unsigned long pfn, unsigned long size, pgprot_t prot)
1840{
1841 if (addr != (pfn << PAGE_SHIFT))
1842 return -EINVAL;
1843
1844 vma->vm_flags |= VM_IO | VM_PFNMAP | VM_DONTEXPAND | VM_DONTDUMP;
1845 return 0;
1846}
1847EXPORT_SYMBOL(remap_pfn_range);
1848
1849int vm_iomap_memory(struct vm_area_struct *vma, phys_addr_t start, unsigned long len)
1850{
1851 unsigned long pfn = start >> PAGE_SHIFT;
1852 unsigned long vm_len = vma->vm_end - vma->vm_start;
1853
1854 pfn += vma->vm_pgoff;
1855 return io_remap_pfn_range(vma, vma->vm_start, pfn, vm_len, vma->vm_page_prot);
1856}
1857EXPORT_SYMBOL(vm_iomap_memory);
1858
1859int remap_vmalloc_range(struct vm_area_struct *vma, void *addr,
1860 unsigned long pgoff)
1861{
1862 unsigned int size = vma->vm_end - vma->vm_start;
1863
1864 if (!(vma->vm_flags & VM_USERMAP))
1865 return -EINVAL;
1866
1867 vma->vm_start = (unsigned long)(addr + (pgoff << PAGE_SHIFT));
1868 vma->vm_end = vma->vm_start + size;
1869
1870 return 0;
1871}
1872EXPORT_SYMBOL(remap_vmalloc_range);
1873
1874unsigned long arch_get_unmapped_area(struct file *file, unsigned long addr,
1875 unsigned long len, unsigned long pgoff, unsigned long flags)
1876{
1877 return -ENOMEM;
1878}
1879
1880void unmap_mapping_range(struct address_space *mapping,
1881 loff_t const holebegin, loff_t const holelen,
1882 int even_cows)
1883{
1884}
1885EXPORT_SYMBOL(unmap_mapping_range);
1886
1887/*
1888 * Check that a process has enough memory to allocate a new virtual
1889 * mapping. 0 means there is enough memory for the allocation to
1890 * succeed and -ENOMEM implies there is not.
1891 *
1892 * We currently support three overcommit policies, which are set via the
1893 * vm.overcommit_memory sysctl. See Documentation/vm/overcommit-accounting
1894 *
1895 * Strict overcommit modes added 2002 Feb 26 by Alan Cox.
1896 * Additional code 2002 Jul 20 by Robert Love.
1897 *
1898 * cap_sys_admin is 1 if the process has admin privileges, 0 otherwise.
1899 *
1900 * Note this is a helper function intended to be used by LSMs which
1901 * wish to use this logic.
1902 */
1903int __vm_enough_memory(struct mm_struct *mm, long pages, int cap_sys_admin)
1904{
1905 unsigned long free, allowed, reserve;
1906
1907 vm_acct_memory(pages);
1908
1909 /*
1910 * Sometimes we want to use more memory than we have
1911 */
1912 if (sysctl_overcommit_memory == OVERCOMMIT_ALWAYS)
1913 return 0;
1914
1915 if (sysctl_overcommit_memory == OVERCOMMIT_GUESS) {
1916 free = global_page_state(NR_FREE_PAGES);
1917 free += global_page_state(NR_FILE_PAGES);
1918
1919 /*
1920 * shmem pages shouldn't be counted as free in this
1921 * case, they can't be purged, only swapped out, and
1922 * that won't affect the overall amount of available
1923 * memory in the system.
1924 */
1925 free -= global_page_state(NR_SHMEM);
1926
1927 free += get_nr_swap_pages();
1928
1929 /*
1930 * Any slabs which are created with the
1931 * SLAB_RECLAIM_ACCOUNT flag claim to have contents
1932 * which are reclaimable, under pressure. The dentry
1933 * cache and most inode caches should fall into this
1934 */
1935 free += global_page_state(NR_SLAB_RECLAIMABLE);
1936
1937 /*
1938 * Leave reserved pages. The pages are not for anonymous pages.
1939 */
1940 if (free <= totalreserve_pages)
1941 goto error;
1942 else
1943 free -= totalreserve_pages;
1944
1945 /*
1946 * Reserve some for root
1947 */
1948 if (!cap_sys_admin)
1949 free -= sysctl_admin_reserve_kbytes >> (PAGE_SHIFT - 10);
1950
1951 if (free > pages)
1952 return 0;
1953
1954 goto error;
1955 }
1956
1957 allowed = vm_commit_limit();
1958 /*
1959 * Reserve some 3% for root
1960 */
1961 if (!cap_sys_admin)
1962 allowed -= sysctl_admin_reserve_kbytes >> (PAGE_SHIFT - 10);
1963
1964 /*
1965 * Don't let a single process grow so big a user can't recover
1966 */
1967 if (mm) {
1968 reserve = sysctl_user_reserve_kbytes >> (PAGE_SHIFT - 10);
1969 allowed -= min(mm->total_vm / 32, reserve);
1970 }
1971
1972 if (percpu_counter_read_positive(&vm_committed_as) < allowed)
1973 return 0;
1974
1975error:
1976 vm_unacct_memory(pages);
1977
1978 return -ENOMEM;
1979}
1980
1981int in_gate_area_no_mm(unsigned long addr)
1982{
1983 return 0;
1984}
1985
1986int filemap_fault(struct vm_area_struct *vma, struct vm_fault *vmf)
1987{
1988 BUG();
1989 return 0;
1990}
1991EXPORT_SYMBOL(filemap_fault);
1992
1993void filemap_map_pages(struct vm_area_struct *vma, struct vm_fault *vmf)
1994{
1995 BUG();
1996}
1997EXPORT_SYMBOL(filemap_map_pages);
1998
1999int generic_file_remap_pages(struct vm_area_struct *vma, unsigned long addr,
2000 unsigned long size, pgoff_t pgoff)
2001{
2002 BUG();
2003 return 0;
2004}
2005EXPORT_SYMBOL(generic_file_remap_pages);
2006
2007static int __access_remote_vm(struct task_struct *tsk, struct mm_struct *mm,
2008 unsigned long addr, void *buf, int len, int write)
2009{
2010 struct vm_area_struct *vma;
2011
2012 down_read(&mm->mmap_sem);
2013
2014 /* the access must start within one of the target process's mappings */
2015 vma = find_vma(mm, addr);
2016 if (vma) {
2017 /* don't overrun this mapping */
2018 if (addr + len >= vma->vm_end)
2019 len = vma->vm_end - addr;
2020
2021 /* only read or write mappings where it is permitted */
2022 if (write && vma->vm_flags & VM_MAYWRITE)
2023 copy_to_user_page(vma, NULL, addr,
2024 (void *) addr, buf, len);
2025 else if (!write && vma->vm_flags & VM_MAYREAD)
2026 copy_from_user_page(vma, NULL, addr,
2027 buf, (void *) addr, len);
2028 else
2029 len = 0;
2030 } else {
2031 len = 0;
2032 }
2033
2034 up_read(&mm->mmap_sem);
2035
2036 return len;
2037}
2038
2039/**
2040 * @access_remote_vm - access another process' address space
2041 * @mm: the mm_struct of the target address space
2042 * @addr: start address to access
2043 * @buf: source or destination buffer
2044 * @len: number of bytes to transfer
2045 * @write: whether the access is a write
2046 *
2047 * The caller must hold a reference on @mm.
2048 */
2049int access_remote_vm(struct mm_struct *mm, unsigned long addr,
2050 void *buf, int len, int write)
2051{
2052 return __access_remote_vm(NULL, mm, addr, buf, len, write);
2053}
2054
2055/*
2056 * Access another process' address space.
2057 * - source/target buffer must be kernel space
2058 */
2059int access_process_vm(struct task_struct *tsk, unsigned long addr, void *buf, int len, int write)
2060{
2061 struct mm_struct *mm;
2062
2063 if (addr + len < addr)
2064 return 0;
2065
2066 mm = get_task_mm(tsk);
2067 if (!mm)
2068 return 0;
2069
2070 len = __access_remote_vm(tsk, mm, addr, buf, len, write);
2071
2072 mmput(mm);
2073 return len;
2074}
2075
2076/**
2077 * nommu_shrink_inode_mappings - Shrink the shared mappings on an inode
2078 * @inode: The inode to check
2079 * @size: The current filesize of the inode
2080 * @newsize: The proposed filesize of the inode
2081 *
2082 * Check the shared mappings on an inode on behalf of a shrinking truncate to
2083 * make sure that that any outstanding VMAs aren't broken and then shrink the
2084 * vm_regions that extend that beyond so that do_mmap_pgoff() doesn't
2085 * automatically grant mappings that are too large.
2086 */
2087int nommu_shrink_inode_mappings(struct inode *inode, size_t size,
2088 size_t newsize)
2089{
2090 struct vm_area_struct *vma;
2091 struct vm_region *region;
2092 pgoff_t low, high;
2093 size_t r_size, r_top;
2094
2095 low = newsize >> PAGE_SHIFT;
2096 high = (size + PAGE_SIZE - 1) >> PAGE_SHIFT;
2097
2098 down_write(&nommu_region_sem);
2099 mutex_lock(&inode->i_mapping->i_mmap_mutex);
2100
2101 /* search for VMAs that fall within the dead zone */
2102 vma_interval_tree_foreach(vma, &inode->i_mapping->i_mmap, low, high) {
2103 /* found one - only interested if it's shared out of the page
2104 * cache */
2105 if (vma->vm_flags & VM_SHARED) {
2106 mutex_unlock(&inode->i_mapping->i_mmap_mutex);
2107 up_write(&nommu_region_sem);
2108 return -ETXTBSY; /* not quite true, but near enough */
2109 }
2110 }
2111
2112 /* reduce any regions that overlap the dead zone - if in existence,
2113 * these will be pointed to by VMAs that don't overlap the dead zone
2114 *
2115 * we don't check for any regions that start beyond the EOF as there
2116 * shouldn't be any
2117 */
2118 vma_interval_tree_foreach(vma, &inode->i_mapping->i_mmap,
2119 0, ULONG_MAX) {
2120 if (!(vma->vm_flags & VM_SHARED))
2121 continue;
2122
2123 region = vma->vm_region;
2124 r_size = region->vm_top - region->vm_start;
2125 r_top = (region->vm_pgoff << PAGE_SHIFT) + r_size;
2126
2127 if (r_top > newsize) {
2128 region->vm_top -= r_top - newsize;
2129 if (region->vm_end > region->vm_top)
2130 region->vm_end = region->vm_top;
2131 }
2132 }
2133
2134 mutex_unlock(&inode->i_mapping->i_mmap_mutex);
2135 up_write(&nommu_region_sem);
2136 return 0;
2137}
2138
2139/*
2140 * Initialise sysctl_user_reserve_kbytes.
2141 *
2142 * This is intended to prevent a user from starting a single memory hogging
2143 * process, such that they cannot recover (kill the hog) in OVERCOMMIT_NEVER
2144 * mode.
2145 *
2146 * The default value is min(3% of free memory, 128MB)
2147 * 128MB is enough to recover with sshd/login, bash, and top/kill.
2148 */
2149static int __meminit init_user_reserve(void)
2150{
2151 unsigned long free_kbytes;
2152
2153 free_kbytes = global_page_state(NR_FREE_PAGES) << (PAGE_SHIFT - 10);
2154
2155 sysctl_user_reserve_kbytes = min(free_kbytes / 32, 1UL << 17);
2156 return 0;
2157}
2158module_init(init_user_reserve)
2159
2160/*
2161 * Initialise sysctl_admin_reserve_kbytes.
2162 *
2163 * The purpose of sysctl_admin_reserve_kbytes is to allow the sys admin
2164 * to log in and kill a memory hogging process.
2165 *
2166 * Systems with more than 256MB will reserve 8MB, enough to recover
2167 * with sshd, bash, and top in OVERCOMMIT_GUESS. Smaller systems will
2168 * only reserve 3% of free pages by default.
2169 */
2170static int __meminit init_admin_reserve(void)
2171{
2172 unsigned long free_kbytes;
2173
2174 free_kbytes = global_page_state(NR_FREE_PAGES) << (PAGE_SHIFT - 10);
2175
2176 sysctl_admin_reserve_kbytes = min(free_kbytes / 32, 1UL << 13);
2177 return 0;
2178}
2179module_init(init_admin_reserve)