mm: fix find_vma_prev
[pandora-kernel.git] / mm / mmap.c
1 /*
2  * mm/mmap.c
3  *
4  * Written by obz.
5  *
6  * Address space accounting code        <alan@lxorguk.ukuu.org.uk>
7  */
8
9 #include <linux/slab.h>
10 #include <linux/backing-dev.h>
11 #include <linux/mm.h>
12 #include <linux/shm.h>
13 #include <linux/mman.h>
14 #include <linux/pagemap.h>
15 #include <linux/swap.h>
16 #include <linux/syscalls.h>
17 #include <linux/capability.h>
18 #include <linux/init.h>
19 #include <linux/file.h>
20 #include <linux/fs.h>
21 #include <linux/personality.h>
22 #include <linux/security.h>
23 #include <linux/hugetlb.h>
24 #include <linux/profile.h>
25 #include <linux/export.h>
26 #include <linux/mount.h>
27 #include <linux/mempolicy.h>
28 #include <linux/rmap.h>
29 #include <linux/mmu_notifier.h>
30 #include <linux/perf_event.h>
31 #include <linux/audit.h>
32 #include <linux/khugepaged.h>
33
34 #include <asm/uaccess.h>
35 #include <asm/cacheflush.h>
36 #include <asm/tlb.h>
37 #include <asm/mmu_context.h>
38
39 #include "internal.h"
40
41 #ifndef arch_mmap_check
42 #define arch_mmap_check(addr, len, flags)       (0)
43 #endif
44
45 #ifndef arch_rebalance_pgtables
46 #define arch_rebalance_pgtables(addr, len)              (addr)
47 #endif
48
49 static void unmap_region(struct mm_struct *mm,
50                 struct vm_area_struct *vma, struct vm_area_struct *prev,
51                 unsigned long start, unsigned long end);
52
53 /*
54  * WARNING: the debugging will use recursive algorithms so never enable this
55  * unless you know what you are doing.
56  */
57 #undef DEBUG_MM_RB
58
59 /* description of effects of mapping type and prot in current implementation.
60  * this is due to the limited x86 page protection hardware.  The expected
61  * behavior is in parens:
62  *
63  * map_type     prot
64  *              PROT_NONE       PROT_READ       PROT_WRITE      PROT_EXEC
65  * MAP_SHARED   r: (no) no      r: (yes) yes    r: (no) yes     r: (no) yes
66  *              w: (no) no      w: (no) no      w: (yes) yes    w: (no) no
67  *              x: (no) no      x: (no) yes     x: (no) yes     x: (yes) yes
68  *              
69  * MAP_PRIVATE  r: (no) no      r: (yes) yes    r: (no) yes     r: (no) yes
70  *              w: (no) no      w: (no) no      w: (copy) copy  w: (no) no
71  *              x: (no) no      x: (no) yes     x: (no) yes     x: (yes) yes
72  *
73  */
74 pgprot_t protection_map[16] = {
75         __P000, __P001, __P010, __P011, __P100, __P101, __P110, __P111,
76         __S000, __S001, __S010, __S011, __S100, __S101, __S110, __S111
77 };
78
79 pgprot_t vm_get_page_prot(unsigned long vm_flags)
80 {
81         return __pgprot(pgprot_val(protection_map[vm_flags &
82                                 (VM_READ|VM_WRITE|VM_EXEC|VM_SHARED)]) |
83                         pgprot_val(arch_vm_get_page_prot(vm_flags)));
84 }
85 EXPORT_SYMBOL(vm_get_page_prot);
86
87 int sysctl_overcommit_memory __read_mostly = OVERCOMMIT_GUESS;  /* heuristic overcommit */
88 int sysctl_overcommit_ratio __read_mostly = 50; /* default is 50% */
89 int sysctl_max_map_count __read_mostly = DEFAULT_MAX_MAP_COUNT;
90 /*
91  * Make sure vm_committed_as in one cacheline and not cacheline shared with
92  * other variables. It can be updated by several CPUs frequently.
93  */
94 struct percpu_counter vm_committed_as ____cacheline_aligned_in_smp;
95
96 /*
97  * Check that a process has enough memory to allocate a new virtual
98  * mapping. 0 means there is enough memory for the allocation to
99  * succeed and -ENOMEM implies there is not.
100  *
101  * We currently support three overcommit policies, which are set via the
102  * vm.overcommit_memory sysctl.  See Documentation/vm/overcommit-accounting
103  *
104  * Strict overcommit modes added 2002 Feb 26 by Alan Cox.
105  * Additional code 2002 Jul 20 by Robert Love.
106  *
107  * cap_sys_admin is 1 if the process has admin privileges, 0 otherwise.
108  *
109  * Note this is a helper function intended to be used by LSMs which
110  * wish to use this logic.
111  */
112 int __vm_enough_memory(struct mm_struct *mm, long pages, int cap_sys_admin)
113 {
114         long free, allowed;
115
116         vm_acct_memory(pages);
117
118         /*
119          * Sometimes we want to use more memory than we have
120          */
121         if (sysctl_overcommit_memory == OVERCOMMIT_ALWAYS)
122                 return 0;
123
124         if (sysctl_overcommit_memory == OVERCOMMIT_GUESS) {
125                 free = global_page_state(NR_FREE_PAGES);
126                 free += global_page_state(NR_FILE_PAGES);
127
128                 /*
129                  * shmem pages shouldn't be counted as free in this
130                  * case, they can't be purged, only swapped out, and
131                  * that won't affect the overall amount of available
132                  * memory in the system.
133                  */
134                 free -= global_page_state(NR_SHMEM);
135
136                 free += nr_swap_pages;
137
138                 /*
139                  * Any slabs which are created with the
140                  * SLAB_RECLAIM_ACCOUNT flag claim to have contents
141                  * which are reclaimable, under pressure.  The dentry
142                  * cache and most inode caches should fall into this
143                  */
144                 free += global_page_state(NR_SLAB_RECLAIMABLE);
145
146                 /*
147                  * Leave reserved pages. The pages are not for anonymous pages.
148                  */
149                 if (free <= totalreserve_pages)
150                         goto error;
151                 else
152                         free -= totalreserve_pages;
153
154                 /*
155                  * Leave the last 3% for root
156                  */
157                 if (!cap_sys_admin)
158                         free -= free / 32;
159
160                 if (free > pages)
161                         return 0;
162
163                 goto error;
164         }
165
166         allowed = (totalram_pages - hugetlb_total_pages())
167                 * sysctl_overcommit_ratio / 100;
168         /*
169          * Leave the last 3% for root
170          */
171         if (!cap_sys_admin)
172                 allowed -= allowed / 32;
173         allowed += total_swap_pages;
174
175         /* Don't let a single process grow too big:
176            leave 3% of the size of this process for other processes */
177         if (mm)
178                 allowed -= mm->total_vm / 32;
179
180         if (percpu_counter_read_positive(&vm_committed_as) < allowed)
181                 return 0;
182 error:
183         vm_unacct_memory(pages);
184
185         return -ENOMEM;
186 }
187
188 /*
189  * Requires inode->i_mapping->i_mmap_mutex
190  */
191 static void __remove_shared_vm_struct(struct vm_area_struct *vma,
192                 struct file *file, struct address_space *mapping)
193 {
194         if (vma->vm_flags & VM_DENYWRITE)
195                 atomic_inc(&file->f_path.dentry->d_inode->i_writecount);
196         if (vma->vm_flags & VM_SHARED)
197                 mapping->i_mmap_writable--;
198
199         flush_dcache_mmap_lock(mapping);
200         if (unlikely(vma->vm_flags & VM_NONLINEAR))
201                 list_del_init(&vma->shared.vm_set.list);
202         else
203                 vma_prio_tree_remove(vma, &mapping->i_mmap);
204         flush_dcache_mmap_unlock(mapping);
205 }
206
207 /*
208  * Unlink a file-based vm structure from its prio_tree, to hide
209  * vma from rmap and vmtruncate before freeing its page tables.
210  */
211 void unlink_file_vma(struct vm_area_struct *vma)
212 {
213         struct file *file = vma->vm_file;
214
215         if (file) {
216                 struct address_space *mapping = file->f_mapping;
217                 mutex_lock(&mapping->i_mmap_mutex);
218                 __remove_shared_vm_struct(vma, file, mapping);
219                 mutex_unlock(&mapping->i_mmap_mutex);
220         }
221 }
222
223 /*
224  * Close a vm structure and free it, returning the next.
225  */
226 static struct vm_area_struct *remove_vma(struct vm_area_struct *vma)
227 {
228         struct vm_area_struct *next = vma->vm_next;
229
230         might_sleep();
231         if (vma->vm_ops && vma->vm_ops->close)
232                 vma->vm_ops->close(vma);
233         if (vma->vm_file) {
234                 fput(vma->vm_file);
235                 if (vma->vm_flags & VM_EXECUTABLE)
236                         removed_exe_file_vma(vma->vm_mm);
237         }
238         mpol_put(vma_policy(vma));
239         kmem_cache_free(vm_area_cachep, vma);
240         return next;
241 }
242
243 SYSCALL_DEFINE1(brk, unsigned long, brk)
244 {
245         unsigned long rlim, retval;
246         unsigned long newbrk, oldbrk;
247         struct mm_struct *mm = current->mm;
248         struct vm_area_struct *next;
249         unsigned long min_brk;
250
251         down_write(&mm->mmap_sem);
252
253 #ifdef CONFIG_COMPAT_BRK
254         /*
255          * CONFIG_COMPAT_BRK can still be overridden by setting
256          * randomize_va_space to 2, which will still cause mm->start_brk
257          * to be arbitrarily shifted
258          */
259         if (current->brk_randomized)
260                 min_brk = mm->start_brk;
261         else
262                 min_brk = mm->end_data;
263 #else
264         min_brk = mm->start_brk;
265 #endif
266         if (brk < min_brk)
267                 goto out;
268
269         /*
270          * Check against rlimit here. If this check is done later after the test
271          * of oldbrk with newbrk then it can escape the test and let the data
272          * segment grow beyond its set limit the in case where the limit is
273          * not page aligned -Ram Gupta
274          */
275         rlim = rlimit(RLIMIT_DATA);
276         if (rlim < RLIM_INFINITY && (brk - mm->start_brk) +
277                         (mm->end_data - mm->start_data) > rlim)
278                 goto out;
279
280         newbrk = PAGE_ALIGN(brk);
281         oldbrk = PAGE_ALIGN(mm->brk);
282         if (oldbrk == newbrk)
283                 goto set_brk;
284
285         /* Always allow shrinking brk. */
286         if (brk <= mm->brk) {
287                 if (!do_munmap(mm, newbrk, oldbrk-newbrk))
288                         goto set_brk;
289                 goto out;
290         }
291
292         /* Check against existing mmap mappings. */
293         next = find_vma(mm, oldbrk);
294         if (next && newbrk + PAGE_SIZE > vm_start_gap(next))
295                 goto out;
296
297         /* Ok, looks good - let it rip. */
298         if (do_brk(oldbrk, newbrk-oldbrk) != oldbrk)
299                 goto out;
300 set_brk:
301         mm->brk = brk;
302 out:
303         retval = mm->brk;
304         up_write(&mm->mmap_sem);
305         return retval;
306 }
307
308 #ifdef DEBUG_MM_RB
309 static int browse_rb(struct rb_root *root)
310 {
311         int i = 0, j;
312         struct rb_node *nd, *pn = NULL;
313         unsigned long prev = 0, pend = 0;
314
315         for (nd = rb_first(root); nd; nd = rb_next(nd)) {
316                 struct vm_area_struct *vma;
317                 vma = rb_entry(nd, struct vm_area_struct, vm_rb);
318                 if (vma->vm_start < prev)
319                         printk("vm_start %lx prev %lx\n", vma->vm_start, prev), i = -1;
320                 if (vma->vm_start < pend)
321                         printk("vm_start %lx pend %lx\n", vma->vm_start, pend);
322                 if (vma->vm_start > vma->vm_end)
323                         printk("vm_end %lx < vm_start %lx\n", vma->vm_end, vma->vm_start);
324                 i++;
325                 pn = nd;
326                 prev = vma->vm_start;
327                 pend = vma->vm_end;
328         }
329         j = 0;
330         for (nd = pn; nd; nd = rb_prev(nd)) {
331                 j++;
332         }
333         if (i != j)
334                 printk("backwards %d, forwards %d\n", j, i), i = 0;
335         return i;
336 }
337
338 void validate_mm(struct mm_struct *mm)
339 {
340         int bug = 0;
341         int i = 0;
342         struct vm_area_struct *tmp = mm->mmap;
343         while (tmp) {
344                 tmp = tmp->vm_next;
345                 i++;
346         }
347         if (i != mm->map_count)
348                 printk("map_count %d vm_next %d\n", mm->map_count, i), bug = 1;
349         i = browse_rb(&mm->mm_rb);
350         if (i != mm->map_count)
351                 printk("map_count %d rb %d\n", mm->map_count, i), bug = 1;
352         BUG_ON(bug);
353 }
354 #else
355 #define validate_mm(mm) do { } while (0)
356 #endif
357
358 static struct vm_area_struct *
359 find_vma_prepare(struct mm_struct *mm, unsigned long addr,
360                 struct vm_area_struct **pprev, struct rb_node ***rb_link,
361                 struct rb_node ** rb_parent)
362 {
363         struct vm_area_struct * vma;
364         struct rb_node ** __rb_link, * __rb_parent, * rb_prev;
365
366         __rb_link = &mm->mm_rb.rb_node;
367         rb_prev = __rb_parent = NULL;
368         vma = NULL;
369
370         while (*__rb_link) {
371                 struct vm_area_struct *vma_tmp;
372
373                 __rb_parent = *__rb_link;
374                 vma_tmp = rb_entry(__rb_parent, struct vm_area_struct, vm_rb);
375
376                 if (vma_tmp->vm_end > addr) {
377                         vma = vma_tmp;
378                         if (vma_tmp->vm_start <= addr)
379                                 break;
380                         __rb_link = &__rb_parent->rb_left;
381                 } else {
382                         rb_prev = __rb_parent;
383                         __rb_link = &__rb_parent->rb_right;
384                 }
385         }
386
387         *pprev = NULL;
388         if (rb_prev)
389                 *pprev = rb_entry(rb_prev, struct vm_area_struct, vm_rb);
390         *rb_link = __rb_link;
391         *rb_parent = __rb_parent;
392         return vma;
393 }
394
395 void __vma_link_rb(struct mm_struct *mm, struct vm_area_struct *vma,
396                 struct rb_node **rb_link, struct rb_node *rb_parent)
397 {
398         rb_link_node(&vma->vm_rb, rb_parent, rb_link);
399         rb_insert_color(&vma->vm_rb, &mm->mm_rb);
400 }
401
402 static void __vma_link_file(struct vm_area_struct *vma)
403 {
404         struct file *file;
405
406         file = vma->vm_file;
407         if (file) {
408                 struct address_space *mapping = file->f_mapping;
409
410                 if (vma->vm_flags & VM_DENYWRITE)
411                         atomic_dec(&file->f_path.dentry->d_inode->i_writecount);
412                 if (vma->vm_flags & VM_SHARED)
413                         mapping->i_mmap_writable++;
414
415                 flush_dcache_mmap_lock(mapping);
416                 if (unlikely(vma->vm_flags & VM_NONLINEAR))
417                         vma_nonlinear_insert(vma, &mapping->i_mmap_nonlinear);
418                 else
419                         vma_prio_tree_insert(vma, &mapping->i_mmap);
420                 flush_dcache_mmap_unlock(mapping);
421         }
422 }
423
424 static void
425 __vma_link(struct mm_struct *mm, struct vm_area_struct *vma,
426         struct vm_area_struct *prev, struct rb_node **rb_link,
427         struct rb_node *rb_parent)
428 {
429         __vma_link_list(mm, vma, prev, rb_parent);
430         __vma_link_rb(mm, vma, rb_link, rb_parent);
431 }
432
433 static void vma_link(struct mm_struct *mm, struct vm_area_struct *vma,
434                         struct vm_area_struct *prev, struct rb_node **rb_link,
435                         struct rb_node *rb_parent)
436 {
437         struct address_space *mapping = NULL;
438
439         if (vma->vm_file)
440                 mapping = vma->vm_file->f_mapping;
441
442         if (mapping)
443                 mutex_lock(&mapping->i_mmap_mutex);
444
445         __vma_link(mm, vma, prev, rb_link, rb_parent);
446         __vma_link_file(vma);
447
448         if (mapping)
449                 mutex_unlock(&mapping->i_mmap_mutex);
450
451         mm->map_count++;
452         validate_mm(mm);
453 }
454
455 /*
456  * Helper for vma_adjust in the split_vma insert case:
457  * insert vm structure into list and rbtree and anon_vma,
458  * but it has already been inserted into prio_tree earlier.
459  */
460 static void __insert_vm_struct(struct mm_struct *mm, struct vm_area_struct *vma)
461 {
462         struct vm_area_struct *__vma, *prev;
463         struct rb_node **rb_link, *rb_parent;
464
465         __vma = find_vma_prepare(mm, vma->vm_start,&prev, &rb_link, &rb_parent);
466         BUG_ON(__vma && __vma->vm_start < vma->vm_end);
467         __vma_link(mm, vma, prev, rb_link, rb_parent);
468         mm->map_count++;
469 }
470
471 static inline void
472 __vma_unlink(struct mm_struct *mm, struct vm_area_struct *vma,
473                 struct vm_area_struct *prev)
474 {
475         struct vm_area_struct *next = vma->vm_next;
476
477         prev->vm_next = next;
478         if (next)
479                 next->vm_prev = prev;
480         rb_erase(&vma->vm_rb, &mm->mm_rb);
481         if (mm->mmap_cache == vma)
482                 mm->mmap_cache = prev;
483 }
484
485 /*
486  * We cannot adjust vm_start, vm_end, vm_pgoff fields of a vma that
487  * is already present in an i_mmap tree without adjusting the tree.
488  * The following helper function should be used when such adjustments
489  * are necessary.  The "insert" vma (if any) is to be inserted
490  * before we drop the necessary locks.
491  */
492 int vma_adjust(struct vm_area_struct *vma, unsigned long start,
493         unsigned long end, pgoff_t pgoff, struct vm_area_struct *insert)
494 {
495         struct mm_struct *mm = vma->vm_mm;
496         struct vm_area_struct *next = vma->vm_next;
497         struct vm_area_struct *importer = NULL;
498         struct address_space *mapping = NULL;
499         struct prio_tree_root *root = NULL;
500         struct anon_vma *anon_vma = NULL;
501         struct file *file = vma->vm_file;
502         long adjust_next = 0;
503         int remove_next = 0;
504
505         if (next && !insert) {
506                 struct vm_area_struct *exporter = NULL;
507
508                 if (end >= next->vm_end) {
509                         /*
510                          * vma expands, overlapping all the next, and
511                          * perhaps the one after too (mprotect case 6).
512                          */
513 again:                  remove_next = 1 + (end > next->vm_end);
514                         end = next->vm_end;
515                         exporter = next;
516                         importer = vma;
517                 } else if (end > next->vm_start) {
518                         /*
519                          * vma expands, overlapping part of the next:
520                          * mprotect case 5 shifting the boundary up.
521                          */
522                         adjust_next = (end - next->vm_start) >> PAGE_SHIFT;
523                         exporter = next;
524                         importer = vma;
525                 } else if (end < vma->vm_end) {
526                         /*
527                          * vma shrinks, and !insert tells it's not
528                          * split_vma inserting another: so it must be
529                          * mprotect case 4 shifting the boundary down.
530                          */
531                         adjust_next = - ((vma->vm_end - end) >> PAGE_SHIFT);
532                         exporter = vma;
533                         importer = next;
534                 }
535
536                 /*
537                  * Easily overlooked: when mprotect shifts the boundary,
538                  * make sure the expanding vma has anon_vma set if the
539                  * shrinking vma had, to cover any anon pages imported.
540                  */
541                 if (exporter && exporter->anon_vma && !importer->anon_vma) {
542                         int error;
543
544                         importer->anon_vma = exporter->anon_vma;
545                         error = anon_vma_clone(importer, exporter);
546                         if (error)
547                                 return error;
548                 }
549         }
550
551         if (file) {
552                 mapping = file->f_mapping;
553                 if (!(vma->vm_flags & VM_NONLINEAR))
554                         root = &mapping->i_mmap;
555                 mutex_lock(&mapping->i_mmap_mutex);
556                 if (insert) {
557                         /*
558                          * Put into prio_tree now, so instantiated pages
559                          * are visible to arm/parisc __flush_dcache_page
560                          * throughout; but we cannot insert into address
561                          * space until vma start or end is updated.
562                          */
563                         __vma_link_file(insert);
564                 }
565         }
566
567         vma_adjust_trans_huge(vma, start, end, adjust_next);
568
569         /*
570          * When changing only vma->vm_end, we don't really need anon_vma
571          * lock. This is a fairly rare case by itself, but the anon_vma
572          * lock may be shared between many sibling processes.  Skipping
573          * the lock for brk adjustments makes a difference sometimes.
574          */
575         if (vma->anon_vma && (importer || start != vma->vm_start)) {
576                 anon_vma = vma->anon_vma;
577                 anon_vma_lock(anon_vma);
578         }
579
580         if (root) {
581                 flush_dcache_mmap_lock(mapping);
582                 vma_prio_tree_remove(vma, root);
583                 if (adjust_next)
584                         vma_prio_tree_remove(next, root);
585         }
586
587         vma->vm_start = start;
588         vma->vm_end = end;
589         vma->vm_pgoff = pgoff;
590         if (adjust_next) {
591                 next->vm_start += adjust_next << PAGE_SHIFT;
592                 next->vm_pgoff += adjust_next;
593         }
594
595         if (root) {
596                 if (adjust_next)
597                         vma_prio_tree_insert(next, root);
598                 vma_prio_tree_insert(vma, root);
599                 flush_dcache_mmap_unlock(mapping);
600         }
601
602         if (remove_next) {
603                 /*
604                  * vma_merge has merged next into vma, and needs
605                  * us to remove next before dropping the locks.
606                  */
607                 __vma_unlink(mm, next, vma);
608                 if (file)
609                         __remove_shared_vm_struct(next, file, mapping);
610         } else if (insert) {
611                 /*
612                  * split_vma has split insert from vma, and needs
613                  * us to insert it before dropping the locks
614                  * (it may either follow vma or precede it).
615                  */
616                 __insert_vm_struct(mm, insert);
617         }
618
619         if (anon_vma)
620                 anon_vma_unlock(anon_vma);
621         if (mapping)
622                 mutex_unlock(&mapping->i_mmap_mutex);
623
624         if (remove_next) {
625                 if (file) {
626                         fput(file);
627                         if (next->vm_flags & VM_EXECUTABLE)
628                                 removed_exe_file_vma(mm);
629                 }
630                 if (next->anon_vma)
631                         anon_vma_merge(vma, next);
632                 mm->map_count--;
633                 mpol_put(vma_policy(next));
634                 kmem_cache_free(vm_area_cachep, next);
635                 /*
636                  * In mprotect's case 6 (see comments on vma_merge),
637                  * we must remove another next too. It would clutter
638                  * up the code too much to do both in one go.
639                  */
640                 if (remove_next == 2) {
641                         next = vma->vm_next;
642                         goto again;
643                 }
644         }
645
646         validate_mm(mm);
647
648         return 0;
649 }
650
651 /*
652  * If the vma has a ->close operation then the driver probably needs to release
653  * per-vma resources, so we don't attempt to merge those.
654  */
655 static inline int is_mergeable_vma(struct vm_area_struct *vma,
656                         struct file *file, unsigned long vm_flags)
657 {
658         /* VM_CAN_NONLINEAR may get set later by f_op->mmap() */
659         if ((vma->vm_flags ^ vm_flags) & ~VM_CAN_NONLINEAR)
660                 return 0;
661         if (vma->vm_file != file)
662                 return 0;
663         if (vma->vm_ops && vma->vm_ops->close)
664                 return 0;
665         return 1;
666 }
667
668 static inline int is_mergeable_anon_vma(struct anon_vma *anon_vma1,
669                                         struct anon_vma *anon_vma2,
670                                         struct vm_area_struct *vma)
671 {
672         /*
673          * The list_is_singular() test is to avoid merging VMA cloned from
674          * parents. This can improve scalability caused by anon_vma lock.
675          */
676         if ((!anon_vma1 || !anon_vma2) && (!vma ||
677                 list_is_singular(&vma->anon_vma_chain)))
678                 return 1;
679         return anon_vma1 == anon_vma2;
680 }
681
682 /*
683  * Return true if we can merge this (vm_flags,anon_vma,file,vm_pgoff)
684  * in front of (at a lower virtual address and file offset than) the vma.
685  *
686  * We cannot merge two vmas if they have differently assigned (non-NULL)
687  * anon_vmas, nor if same anon_vma is assigned but offsets incompatible.
688  *
689  * We don't check here for the merged mmap wrapping around the end of pagecache
690  * indices (16TB on ia32) because do_mmap_pgoff() does not permit mmap's which
691  * wrap, nor mmaps which cover the final page at index -1UL.
692  */
693 static int
694 can_vma_merge_before(struct vm_area_struct *vma, unsigned long vm_flags,
695         struct anon_vma *anon_vma, struct file *file, pgoff_t vm_pgoff)
696 {
697         if (is_mergeable_vma(vma, file, vm_flags) &&
698             is_mergeable_anon_vma(anon_vma, vma->anon_vma, vma)) {
699                 if (vma->vm_pgoff == vm_pgoff)
700                         return 1;
701         }
702         return 0;
703 }
704
705 /*
706  * Return true if we can merge this (vm_flags,anon_vma,file,vm_pgoff)
707  * beyond (at a higher virtual address and file offset than) the vma.
708  *
709  * We cannot merge two vmas if they have differently assigned (non-NULL)
710  * anon_vmas, nor if same anon_vma is assigned but offsets incompatible.
711  */
712 static int
713 can_vma_merge_after(struct vm_area_struct *vma, unsigned long vm_flags,
714         struct anon_vma *anon_vma, struct file *file, pgoff_t vm_pgoff)
715 {
716         if (is_mergeable_vma(vma, file, vm_flags) &&
717             is_mergeable_anon_vma(anon_vma, vma->anon_vma, vma)) {
718                 pgoff_t vm_pglen;
719                 vm_pglen = (vma->vm_end - vma->vm_start) >> PAGE_SHIFT;
720                 if (vma->vm_pgoff + vm_pglen == vm_pgoff)
721                         return 1;
722         }
723         return 0;
724 }
725
726 /*
727  * Given a mapping request (addr,end,vm_flags,file,pgoff), figure out
728  * whether that can be merged with its predecessor or its successor.
729  * Or both (it neatly fills a hole).
730  *
731  * In most cases - when called for mmap, brk or mremap - [addr,end) is
732  * certain not to be mapped by the time vma_merge is called; but when
733  * called for mprotect, it is certain to be already mapped (either at
734  * an offset within prev, or at the start of next), and the flags of
735  * this area are about to be changed to vm_flags - and the no-change
736  * case has already been eliminated.
737  *
738  * The following mprotect cases have to be considered, where AAAA is
739  * the area passed down from mprotect_fixup, never extending beyond one
740  * vma, PPPPPP is the prev vma specified, and NNNNNN the next vma after:
741  *
742  *     AAAA             AAAA                AAAA          AAAA
743  *    PPPPPPNNNNNN    PPPPPPNNNNNN    PPPPPPNNNNNN    PPPPNNNNXXXX
744  *    cannot merge    might become    might become    might become
745  *                    PPNNNNNNNNNN    PPPPPPPPPPNN    PPPPPPPPPPPP 6 or
746  *    mmap, brk or    case 4 below    case 5 below    PPPPPPPPXXXX 7 or
747  *    mremap move:                                    PPPPNNNNNNNN 8
748  *        AAAA
749  *    PPPP    NNNN    PPPPPPPPPPPP    PPPPPPPPNNNN    PPPPNNNNNNNN
750  *    might become    case 1 below    case 2 below    case 3 below
751  *
752  * Odd one out? Case 8, because it extends NNNN but needs flags of XXXX:
753  * mprotect_fixup updates vm_flags & vm_page_prot on successful return.
754  */
755 struct vm_area_struct *vma_merge(struct mm_struct *mm,
756                         struct vm_area_struct *prev, unsigned long addr,
757                         unsigned long end, unsigned long vm_flags,
758                         struct anon_vma *anon_vma, struct file *file,
759                         pgoff_t pgoff, struct mempolicy *policy)
760 {
761         pgoff_t pglen = (end - addr) >> PAGE_SHIFT;
762         struct vm_area_struct *area, *next;
763         int err;
764
765         /*
766          * We later require that vma->vm_flags == vm_flags,
767          * so this tests vma->vm_flags & VM_SPECIAL, too.
768          */
769         if (vm_flags & VM_SPECIAL)
770                 return NULL;
771
772         if (prev)
773                 next = prev->vm_next;
774         else
775                 next = mm->mmap;
776         area = next;
777         if (next && next->vm_end == end)                /* cases 6, 7, 8 */
778                 next = next->vm_next;
779
780         /*
781          * Can it merge with the predecessor?
782          */
783         if (prev && prev->vm_end == addr &&
784                         mpol_equal(vma_policy(prev), policy) &&
785                         can_vma_merge_after(prev, vm_flags,
786                                                 anon_vma, file, pgoff)) {
787                 /*
788                  * OK, it can.  Can we now merge in the successor as well?
789                  */
790                 if (next && end == next->vm_start &&
791                                 mpol_equal(policy, vma_policy(next)) &&
792                                 can_vma_merge_before(next, vm_flags,
793                                         anon_vma, file, pgoff+pglen) &&
794                                 is_mergeable_anon_vma(prev->anon_vma,
795                                                       next->anon_vma, NULL)) {
796                                                         /* cases 1, 6 */
797                         err = vma_adjust(prev, prev->vm_start,
798                                 next->vm_end, prev->vm_pgoff, NULL);
799                 } else                                  /* cases 2, 5, 7 */
800                         err = vma_adjust(prev, prev->vm_start,
801                                 end, prev->vm_pgoff, NULL);
802                 if (err)
803                         return NULL;
804                 khugepaged_enter_vma_merge(prev, vm_flags);
805                 return prev;
806         }
807
808         /*
809          * Can this new request be merged in front of next?
810          */
811         if (next && end == next->vm_start &&
812                         mpol_equal(policy, vma_policy(next)) &&
813                         can_vma_merge_before(next, vm_flags,
814                                         anon_vma, file, pgoff+pglen)) {
815                 if (prev && addr < prev->vm_end)        /* case 4 */
816                         err = vma_adjust(prev, prev->vm_start,
817                                 addr, prev->vm_pgoff, NULL);
818                 else                                    /* cases 3, 8 */
819                         err = vma_adjust(area, addr, next->vm_end,
820                                 next->vm_pgoff - pglen, NULL);
821                 if (err)
822                         return NULL;
823                 khugepaged_enter_vma_merge(area, vm_flags);
824                 return area;
825         }
826
827         return NULL;
828 }
829
830 /*
831  * Rough compatbility check to quickly see if it's even worth looking
832  * at sharing an anon_vma.
833  *
834  * They need to have the same vm_file, and the flags can only differ
835  * in things that mprotect may change.
836  *
837  * NOTE! The fact that we share an anon_vma doesn't _have_ to mean that
838  * we can merge the two vma's. For example, we refuse to merge a vma if
839  * there is a vm_ops->close() function, because that indicates that the
840  * driver is doing some kind of reference counting. But that doesn't
841  * really matter for the anon_vma sharing case.
842  */
843 static int anon_vma_compatible(struct vm_area_struct *a, struct vm_area_struct *b)
844 {
845         return a->vm_end == b->vm_start &&
846                 mpol_equal(vma_policy(a), vma_policy(b)) &&
847                 a->vm_file == b->vm_file &&
848                 !((a->vm_flags ^ b->vm_flags) & ~(VM_READ|VM_WRITE|VM_EXEC)) &&
849                 b->vm_pgoff == a->vm_pgoff + ((b->vm_start - a->vm_start) >> PAGE_SHIFT);
850 }
851
852 /*
853  * Do some basic sanity checking to see if we can re-use the anon_vma
854  * from 'old'. The 'a'/'b' vma's are in VM order - one of them will be
855  * the same as 'old', the other will be the new one that is trying
856  * to share the anon_vma.
857  *
858  * NOTE! This runs with mm_sem held for reading, so it is possible that
859  * the anon_vma of 'old' is concurrently in the process of being set up
860  * by another page fault trying to merge _that_. But that's ok: if it
861  * is being set up, that automatically means that it will be a singleton
862  * acceptable for merging, so we can do all of this optimistically. But
863  * we do that ACCESS_ONCE() to make sure that we never re-load the pointer.
864  *
865  * IOW: that the "list_is_singular()" test on the anon_vma_chain only
866  * matters for the 'stable anon_vma' case (ie the thing we want to avoid
867  * is to return an anon_vma that is "complex" due to having gone through
868  * a fork).
869  *
870  * We also make sure that the two vma's are compatible (adjacent,
871  * and with the same memory policies). That's all stable, even with just
872  * a read lock on the mm_sem.
873  */
874 static struct anon_vma *reusable_anon_vma(struct vm_area_struct *old, struct vm_area_struct *a, struct vm_area_struct *b)
875 {
876         if (anon_vma_compatible(a, b)) {
877                 struct anon_vma *anon_vma = ACCESS_ONCE(old->anon_vma);
878
879                 if (anon_vma && list_is_singular(&old->anon_vma_chain))
880                         return anon_vma;
881         }
882         return NULL;
883 }
884
885 /*
886  * find_mergeable_anon_vma is used by anon_vma_prepare, to check
887  * neighbouring vmas for a suitable anon_vma, before it goes off
888  * to allocate a new anon_vma.  It checks because a repetitive
889  * sequence of mprotects and faults may otherwise lead to distinct
890  * anon_vmas being allocated, preventing vma merge in subsequent
891  * mprotect.
892  */
893 struct anon_vma *find_mergeable_anon_vma(struct vm_area_struct *vma)
894 {
895         struct anon_vma *anon_vma;
896         struct vm_area_struct *near;
897
898         near = vma->vm_next;
899         if (!near)
900                 goto try_prev;
901
902         anon_vma = reusable_anon_vma(near, vma, near);
903         if (anon_vma)
904                 return anon_vma;
905 try_prev:
906         near = vma->vm_prev;
907         if (!near)
908                 goto none;
909
910         anon_vma = reusable_anon_vma(near, near, vma);
911         if (anon_vma)
912                 return anon_vma;
913 none:
914         /*
915          * There's no absolute need to look only at touching neighbours:
916          * we could search further afield for "compatible" anon_vmas.
917          * But it would probably just be a waste of time searching,
918          * or lead to too many vmas hanging off the same anon_vma.
919          * We're trying to allow mprotect remerging later on,
920          * not trying to minimize memory used for anon_vmas.
921          */
922         return NULL;
923 }
924
925 #ifdef CONFIG_PROC_FS
926 void vm_stat_account(struct mm_struct *mm, unsigned long flags,
927                                                 struct file *file, long pages)
928 {
929         const unsigned long stack_flags
930                 = VM_STACK_FLAGS & (VM_GROWSUP|VM_GROWSDOWN);
931
932         if (file) {
933                 mm->shared_vm += pages;
934                 if ((flags & (VM_EXEC|VM_WRITE)) == VM_EXEC)
935                         mm->exec_vm += pages;
936         } else if (flags & stack_flags)
937                 mm->stack_vm += pages;
938         if (flags & (VM_RESERVED|VM_IO))
939                 mm->reserved_vm += pages;
940 }
941 #endif /* CONFIG_PROC_FS */
942
943 /*
944  * The caller must hold down_write(&current->mm->mmap_sem).
945  */
946
947 unsigned long do_mmap_pgoff(struct file *file, unsigned long addr,
948                         unsigned long len, unsigned long prot,
949                         unsigned long flags, unsigned long pgoff)
950 {
951         struct mm_struct * mm = current->mm;
952         struct inode *inode;
953         vm_flags_t vm_flags;
954         int error;
955         unsigned long reqprot = prot;
956
957         /*
958          * Does the application expect PROT_READ to imply PROT_EXEC?
959          *
960          * (the exception is when the underlying filesystem is noexec
961          *  mounted, in which case we dont add PROT_EXEC.)
962          */
963         if ((prot & PROT_READ) && (current->personality & READ_IMPLIES_EXEC))
964                 if (!(file && (file->f_path.mnt->mnt_flags & MNT_NOEXEC)))
965                         prot |= PROT_EXEC;
966
967         if (!len)
968                 return -EINVAL;
969
970         if (!(flags & MAP_FIXED))
971                 addr = round_hint_to_min(addr);
972
973         /* Careful about overflows.. */
974         len = PAGE_ALIGN(len);
975         if (!len)
976                 return -ENOMEM;
977
978         /* offset overflow? */
979         if ((pgoff + (len >> PAGE_SHIFT)) < pgoff)
980                return -EOVERFLOW;
981
982         /* Too many mappings? */
983         if (mm->map_count > sysctl_max_map_count)
984                 return -ENOMEM;
985
986         /* Obtain the address to map to. we verify (or select) it and ensure
987          * that it represents a valid section of the address space.
988          */
989         addr = get_unmapped_area(file, addr, len, pgoff, flags);
990         if (addr & ~PAGE_MASK)
991                 return addr;
992
993         /* Do simple checking here so the lower-level routines won't have
994          * to. we assume access permissions have been handled by the open
995          * of the memory object, so we don't do any here.
996          */
997         vm_flags = calc_vm_prot_bits(prot) | calc_vm_flag_bits(flags) |
998                         mm->def_flags | VM_MAYREAD | VM_MAYWRITE | VM_MAYEXEC;
999
1000         if (flags & MAP_LOCKED)
1001                 if (!can_do_mlock())
1002                         return -EPERM;
1003
1004         /* mlock MCL_FUTURE? */
1005         if (vm_flags & VM_LOCKED) {
1006                 unsigned long locked, lock_limit;
1007                 locked = len >> PAGE_SHIFT;
1008                 locked += mm->locked_vm;
1009                 lock_limit = rlimit(RLIMIT_MEMLOCK);
1010                 lock_limit >>= PAGE_SHIFT;
1011                 if (locked > lock_limit && !capable(CAP_IPC_LOCK))
1012                         return -EAGAIN;
1013         }
1014
1015         inode = file ? file->f_path.dentry->d_inode : NULL;
1016
1017         if (file) {
1018                 switch (flags & MAP_TYPE) {
1019                 case MAP_SHARED:
1020                         if ((prot&PROT_WRITE) && !(file->f_mode&FMODE_WRITE))
1021                                 return -EACCES;
1022
1023                         /*
1024                          * Make sure we don't allow writing to an append-only
1025                          * file..
1026                          */
1027                         if (IS_APPEND(inode) && (file->f_mode & FMODE_WRITE))
1028                                 return -EACCES;
1029
1030                         /*
1031                          * Make sure there are no mandatory locks on the file.
1032                          */
1033                         if (locks_verify_locked(inode))
1034                                 return -EAGAIN;
1035
1036                         vm_flags |= VM_SHARED | VM_MAYSHARE;
1037                         if (!(file->f_mode & FMODE_WRITE))
1038                                 vm_flags &= ~(VM_MAYWRITE | VM_SHARED);
1039
1040                         /* fall through */
1041                 case MAP_PRIVATE:
1042                         if (!(file->f_mode & FMODE_READ))
1043                                 return -EACCES;
1044                         if (file->f_path.mnt->mnt_flags & MNT_NOEXEC) {
1045                                 if (vm_flags & VM_EXEC)
1046                                         return -EPERM;
1047                                 vm_flags &= ~VM_MAYEXEC;
1048                         }
1049
1050                         if (!file->f_op || !file->f_op->mmap)
1051                                 return -ENODEV;
1052                         break;
1053
1054                 default:
1055                         return -EINVAL;
1056                 }
1057         } else {
1058                 switch (flags & MAP_TYPE) {
1059                 case MAP_SHARED:
1060                         /*
1061                          * Ignore pgoff.
1062                          */
1063                         pgoff = 0;
1064                         vm_flags |= VM_SHARED | VM_MAYSHARE;
1065                         break;
1066                 case MAP_PRIVATE:
1067                         /*
1068                          * Set pgoff according to addr for anon_vma.
1069                          */
1070                         pgoff = addr >> PAGE_SHIFT;
1071                         break;
1072                 default:
1073                         return -EINVAL;
1074                 }
1075         }
1076
1077         error = security_file_mmap(file, reqprot, prot, flags, addr, 0);
1078         if (error)
1079                 return error;
1080
1081         return mmap_region(file, addr, len, flags, vm_flags, pgoff);
1082 }
1083 EXPORT_SYMBOL(do_mmap_pgoff);
1084
1085 SYSCALL_DEFINE6(mmap_pgoff, unsigned long, addr, unsigned long, len,
1086                 unsigned long, prot, unsigned long, flags,
1087                 unsigned long, fd, unsigned long, pgoff)
1088 {
1089         struct file *file = NULL;
1090         unsigned long retval = -EBADF;
1091
1092         if (!(flags & MAP_ANONYMOUS)) {
1093                 audit_mmap_fd(fd, flags);
1094                 if (unlikely(flags & MAP_HUGETLB))
1095                         return -EINVAL;
1096                 file = fget(fd);
1097                 if (!file)
1098                         goto out;
1099         } else if (flags & MAP_HUGETLB) {
1100                 struct user_struct *user = NULL;
1101                 /*
1102                  * VM_NORESERVE is used because the reservations will be
1103                  * taken when vm_ops->mmap() is called
1104                  * A dummy user value is used because we are not locking
1105                  * memory so no accounting is necessary
1106                  */
1107                 len = ALIGN(len, huge_page_size(&default_hstate));
1108                 file = hugetlb_file_setup(HUGETLB_ANON_FILE, len, VM_NORESERVE,
1109                                                 &user, HUGETLB_ANONHUGE_INODE);
1110                 if (IS_ERR(file))
1111                         return PTR_ERR(file);
1112         }
1113
1114         flags &= ~(MAP_EXECUTABLE | MAP_DENYWRITE);
1115
1116         down_write(&current->mm->mmap_sem);
1117         retval = do_mmap_pgoff(file, addr, len, prot, flags, pgoff);
1118         up_write(&current->mm->mmap_sem);
1119
1120         if (file)
1121                 fput(file);
1122 out:
1123         return retval;
1124 }
1125
1126 #ifdef __ARCH_WANT_SYS_OLD_MMAP
1127 struct mmap_arg_struct {
1128         unsigned long addr;
1129         unsigned long len;
1130         unsigned long prot;
1131         unsigned long flags;
1132         unsigned long fd;
1133         unsigned long offset;
1134 };
1135
1136 SYSCALL_DEFINE1(old_mmap, struct mmap_arg_struct __user *, arg)
1137 {
1138         struct mmap_arg_struct a;
1139
1140         if (copy_from_user(&a, arg, sizeof(a)))
1141                 return -EFAULT;
1142         if (a.offset & ~PAGE_MASK)
1143                 return -EINVAL;
1144
1145         return sys_mmap_pgoff(a.addr, a.len, a.prot, a.flags, a.fd,
1146                               a.offset >> PAGE_SHIFT);
1147 }
1148 #endif /* __ARCH_WANT_SYS_OLD_MMAP */
1149
1150 /*
1151  * Some shared mappigns will want the pages marked read-only
1152  * to track write events. If so, we'll downgrade vm_page_prot
1153  * to the private version (using protection_map[] without the
1154  * VM_SHARED bit).
1155  */
1156 int vma_wants_writenotify(struct vm_area_struct *vma)
1157 {
1158         vm_flags_t vm_flags = vma->vm_flags;
1159
1160         /* If it was private or non-writable, the write bit is already clear */
1161         if ((vm_flags & (VM_WRITE|VM_SHARED)) != ((VM_WRITE|VM_SHARED)))
1162                 return 0;
1163
1164         /* The backer wishes to know when pages are first written to? */
1165         if (vma->vm_ops && vma->vm_ops->page_mkwrite)
1166                 return 1;
1167
1168         /* The open routine did something to the protections already? */
1169         if (pgprot_val(vma->vm_page_prot) !=
1170             pgprot_val(vm_get_page_prot(vm_flags)))
1171                 return 0;
1172
1173         /* Specialty mapping? */
1174         if (vm_flags & (VM_PFNMAP|VM_INSERTPAGE))
1175                 return 0;
1176
1177         /* Can the mapping track the dirty pages? */
1178         return vma->vm_file && vma->vm_file->f_mapping &&
1179                 mapping_cap_account_dirty(vma->vm_file->f_mapping);
1180 }
1181
1182 /*
1183  * We account for memory if it's a private writeable mapping,
1184  * not hugepages and VM_NORESERVE wasn't set.
1185  */
1186 static inline int accountable_mapping(struct file *file, vm_flags_t vm_flags)
1187 {
1188         /*
1189          * hugetlb has its own accounting separate from the core VM
1190          * VM_HUGETLB may not be set yet so we cannot check for that flag.
1191          */
1192         if (file && is_file_hugepages(file))
1193                 return 0;
1194
1195         return (vm_flags & (VM_NORESERVE | VM_SHARED | VM_WRITE)) == VM_WRITE;
1196 }
1197
1198 unsigned long mmap_region(struct file *file, unsigned long addr,
1199                           unsigned long len, unsigned long flags,
1200                           vm_flags_t vm_flags, unsigned long pgoff)
1201 {
1202         struct mm_struct *mm = current->mm;
1203         struct vm_area_struct *vma, *prev;
1204         int correct_wcount = 0;
1205         int error;
1206         struct rb_node **rb_link, *rb_parent;
1207         unsigned long charged = 0;
1208         struct inode *inode =  file ? file->f_path.dentry->d_inode : NULL;
1209
1210         /* Clear old maps */
1211         error = -ENOMEM;
1212 munmap_back:
1213         vma = find_vma_prepare(mm, addr, &prev, &rb_link, &rb_parent);
1214         if (vma && vma->vm_start < addr + len) {
1215                 if (do_munmap(mm, addr, len))
1216                         return -ENOMEM;
1217                 goto munmap_back;
1218         }
1219
1220         /* Check against address space limit. */
1221         if (!may_expand_vm(mm, len >> PAGE_SHIFT))
1222                 return -ENOMEM;
1223
1224         /*
1225          * Set 'VM_NORESERVE' if we should not account for the
1226          * memory use of this mapping.
1227          */
1228         if ((flags & MAP_NORESERVE)) {
1229                 /* We honor MAP_NORESERVE if allowed to overcommit */
1230                 if (sysctl_overcommit_memory != OVERCOMMIT_NEVER)
1231                         vm_flags |= VM_NORESERVE;
1232
1233                 /* hugetlb applies strict overcommit unless MAP_NORESERVE */
1234                 if (file && is_file_hugepages(file))
1235                         vm_flags |= VM_NORESERVE;
1236         }
1237
1238         /*
1239          * Private writable mapping: check memory availability
1240          */
1241         if (accountable_mapping(file, vm_flags)) {
1242                 charged = len >> PAGE_SHIFT;
1243                 if (security_vm_enough_memory(charged))
1244                         return -ENOMEM;
1245                 vm_flags |= VM_ACCOUNT;
1246         }
1247
1248         /*
1249          * Can we just expand an old mapping?
1250          */
1251         vma = vma_merge(mm, prev, addr, addr + len, vm_flags, NULL, file, pgoff, NULL);
1252         if (vma)
1253                 goto out;
1254
1255         /*
1256          * Determine the object being mapped and call the appropriate
1257          * specific mapper. the address has already been validated, but
1258          * not unmapped, but the maps are removed from the list.
1259          */
1260         vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL);
1261         if (!vma) {
1262                 error = -ENOMEM;
1263                 goto unacct_error;
1264         }
1265
1266         vma->vm_mm = mm;
1267         vma->vm_start = addr;
1268         vma->vm_end = addr + len;
1269         vma->vm_flags = vm_flags;
1270         vma->vm_page_prot = vm_get_page_prot(vm_flags);
1271         vma->vm_pgoff = pgoff;
1272         INIT_LIST_HEAD(&vma->anon_vma_chain);
1273
1274         if (file) {
1275                 error = -EINVAL;
1276                 if (vm_flags & (VM_GROWSDOWN|VM_GROWSUP))
1277                         goto free_vma;
1278                 if (vm_flags & VM_DENYWRITE) {
1279                         error = deny_write_access(file);
1280                         if (error)
1281                                 goto free_vma;
1282                         correct_wcount = 1;
1283                 }
1284                 vma->vm_file = file;
1285                 get_file(file);
1286                 error = file->f_op->mmap(file, vma);
1287                 if (error)
1288                         goto unmap_and_free_vma;
1289                 if (vm_flags & VM_EXECUTABLE)
1290                         added_exe_file_vma(mm);
1291
1292                 /* Can addr have changed??
1293                  *
1294                  * Answer: Yes, several device drivers can do it in their
1295                  *         f_op->mmap method. -DaveM
1296                  */
1297                 addr = vma->vm_start;
1298                 pgoff = vma->vm_pgoff;
1299                 vm_flags = vma->vm_flags;
1300         } else if (vm_flags & VM_SHARED) {
1301                 error = shmem_zero_setup(vma);
1302                 if (error)
1303                         goto free_vma;
1304         }
1305
1306         if (vma_wants_writenotify(vma)) {
1307                 pgprot_t pprot = vma->vm_page_prot;
1308
1309                 /* Can vma->vm_page_prot have changed??
1310                  *
1311                  * Answer: Yes, drivers may have changed it in their
1312                  *         f_op->mmap method.
1313                  *
1314                  * Ensures that vmas marked as uncached stay that way.
1315                  */
1316                 vma->vm_page_prot = vm_get_page_prot(vm_flags & ~VM_SHARED);
1317                 if (pgprot_val(pprot) == pgprot_val(pgprot_noncached(pprot)))
1318                         vma->vm_page_prot = pgprot_noncached(vma->vm_page_prot);
1319         }
1320
1321         vma_link(mm, vma, prev, rb_link, rb_parent);
1322         file = vma->vm_file;
1323
1324         /* Once vma denies write, undo our temporary denial count */
1325         if (correct_wcount)
1326                 atomic_inc(&inode->i_writecount);
1327 out:
1328         perf_event_mmap(vma);
1329
1330         mm->total_vm += len >> PAGE_SHIFT;
1331         vm_stat_account(mm, vm_flags, file, len >> PAGE_SHIFT);
1332         if (vm_flags & VM_LOCKED) {
1333                 if (!mlock_vma_pages_range(vma, addr, addr + len))
1334                         mm->locked_vm += (len >> PAGE_SHIFT);
1335         } else if ((flags & MAP_POPULATE) && !(flags & MAP_NONBLOCK))
1336                 make_pages_present(addr, addr + len);
1337         return addr;
1338
1339 unmap_and_free_vma:
1340         if (correct_wcount)
1341                 atomic_inc(&inode->i_writecount);
1342         vma->vm_file = NULL;
1343         fput(file);
1344
1345         /* Undo any partial mapping done by a device driver. */
1346         unmap_region(mm, vma, prev, vma->vm_start, vma->vm_end);
1347         charged = 0;
1348 free_vma:
1349         kmem_cache_free(vm_area_cachep, vma);
1350 unacct_error:
1351         if (charged)
1352                 vm_unacct_memory(charged);
1353         return error;
1354 }
1355
1356 /* Get an address range which is currently unmapped.
1357  * For shmat() with addr=0.
1358  *
1359  * Ugly calling convention alert:
1360  * Return value with the low bits set means error value,
1361  * ie
1362  *      if (ret & ~PAGE_MASK)
1363  *              error = ret;
1364  *
1365  * This function "knows" that -ENOMEM has the bits set.
1366  */
1367 #ifndef HAVE_ARCH_UNMAPPED_AREA
1368 unsigned long
1369 arch_get_unmapped_area(struct file *filp, unsigned long addr,
1370                 unsigned long len, unsigned long pgoff, unsigned long flags)
1371 {
1372         struct mm_struct *mm = current->mm;
1373         struct vm_area_struct *vma, *prev;
1374         unsigned long start_addr, vm_start, prev_end;
1375
1376         if (len > TASK_SIZE - mmap_min_addr)
1377                 return -ENOMEM;
1378
1379         if (flags & MAP_FIXED)
1380                 return addr;
1381
1382         if (addr) {
1383                 addr = PAGE_ALIGN(addr);
1384                 vma = find_vma_prev(mm, addr, &prev);
1385                 if (TASK_SIZE - len >= addr && addr >= mmap_min_addr &&
1386                     (!vma || addr + len <= vm_start_gap(vma)) &&
1387                     (!prev || addr >= vm_end_gap(prev)))
1388                         return addr;
1389         }
1390         if (len > mm->cached_hole_size) {
1391                 start_addr = addr = mm->free_area_cache;
1392         } else {
1393                 start_addr = addr = TASK_UNMAPPED_BASE;
1394                 mm->cached_hole_size = 0;
1395         }
1396
1397 full_search:
1398         for (vma = find_vma_prev(mm, addr, &prev); ; prev = vma,
1399                                                 vma = vma->vm_next) {
1400                 if (prev) {
1401                         prev_end = vm_end_gap(prev);
1402                         if (addr < prev_end) {
1403                                 addr = prev_end;
1404                                 /* If vma already violates gap, forget it */
1405                                 if (vma && addr > vma->vm_start)
1406                                         addr = vma->vm_start;
1407                         }
1408                 }
1409                 /* At this point:  (!vma || addr < vma->vm_end). */
1410                 if (TASK_SIZE - len < addr) {
1411                         /*
1412                          * Start a new search - just in case we missed
1413                          * some holes.
1414                          */
1415                         if (start_addr != TASK_UNMAPPED_BASE) {
1416                                 addr = TASK_UNMAPPED_BASE;
1417                                 start_addr = addr;
1418                                 mm->cached_hole_size = 0;
1419                                 goto full_search;
1420                         }
1421                         return -ENOMEM;
1422                 }
1423                 vm_start = vma ? vm_start_gap(vma) : TASK_SIZE;
1424                 if (addr + len <= vm_start) {
1425                         /*
1426                          * Remember the place where we stopped the search:
1427                          */
1428                         mm->free_area_cache = addr + len;
1429                         return addr;
1430                 }
1431                 if (addr + mm->cached_hole_size < vm_start)
1432                         mm->cached_hole_size = vm_start - addr;
1433         }
1434 }
1435 #endif  
1436
1437 void arch_unmap_area(struct mm_struct *mm, unsigned long addr)
1438 {
1439         /*
1440          * Is this a new hole at the lowest possible address?
1441          */
1442         if (addr >= TASK_UNMAPPED_BASE && addr < mm->free_area_cache) {
1443                 mm->free_area_cache = addr;
1444                 mm->cached_hole_size = ~0UL;
1445         }
1446 }
1447
1448 /*
1449  * This mmap-allocator allocates new areas top-down from below the
1450  * stack's low limit (the base):
1451  */
1452 #ifndef HAVE_ARCH_UNMAPPED_AREA_TOPDOWN
1453 unsigned long
1454 arch_get_unmapped_area_topdown(struct file *filp, const unsigned long addr0,
1455                           const unsigned long len, const unsigned long pgoff,
1456                           const unsigned long flags)
1457 {
1458         struct vm_area_struct *vma, *prev;
1459         struct mm_struct *mm = current->mm;
1460         unsigned long addr = addr0;
1461         unsigned long vm_start, prev_end;
1462         unsigned long low_limit = max(PAGE_SIZE, mmap_min_addr);
1463
1464         /* requested length too big for entire address space */
1465         if (len > TASK_SIZE - mmap_min_addr)
1466                 return -ENOMEM;
1467
1468         if (flags & MAP_FIXED)
1469                 return addr;
1470
1471         /* requesting a specific address */
1472         if (addr) {
1473                 addr = PAGE_ALIGN(addr);
1474                 vma = find_vma_prev(mm, addr, &prev);
1475                 if (TASK_SIZE - len >= addr && addr >= mmap_min_addr &&
1476                                 (!vma || addr + len <= vm_start_gap(vma)) &&
1477                                 (!prev || addr >= vm_end_gap(prev)))
1478                         return addr;
1479         }
1480
1481         /* check if free_area_cache is useful for us */
1482         if (len <= mm->cached_hole_size) {
1483                 mm->cached_hole_size = 0;
1484                 mm->free_area_cache = mm->mmap_base;
1485         }
1486
1487         /* either no address requested or can't fit in requested address hole */
1488         addr = mm->free_area_cache;
1489
1490         /* make sure it can fit in the remaining address space */
1491         if (addr >= low_limit + len) {
1492                 vma = find_vma_prev(mm, addr-len, &prev);
1493                 if ((!vma || addr <= vm_start_gap(vma)) &&
1494                     (!prev || addr-len >= vm_end_gap(prev)))
1495                         /* remember the address as a hint for next time */
1496                         return (mm->free_area_cache = addr-len);
1497         }
1498
1499         if (mm->mmap_base < low_limit + len)
1500                 goto bottomup;
1501
1502         addr = mm->mmap_base-len;
1503
1504         do {
1505                 /*
1506                  * Lookup failure means no vma is above this address,
1507                  * else if new region fits below vma->vm_start,
1508                  * return with success:
1509                  */
1510                 vma = find_vma_prev(mm, addr, &prev);
1511                 vm_start = vma ? vm_start_gap(vma) : mm->mmap_base;
1512                 prev_end = prev ? vm_end_gap(prev) : low_limit;
1513
1514                 if (addr + len <= vm_start && addr >= prev_end)
1515                         /* remember the address as a hint for next time */
1516                         return (mm->free_area_cache = addr);
1517
1518                 /* remember the largest hole we saw so far */
1519                 if (addr + mm->cached_hole_size < vm_start)
1520                         mm->cached_hole_size = vm_start - addr;
1521
1522                 /* try just below the current vma->vm_start */
1523                 addr = vm_start - len;
1524         } while (vm_start >= low_limit + len);
1525
1526 bottomup:
1527         /*
1528          * A failed mmap() very likely causes application failure,
1529          * so fall back to the bottom-up function here. This scenario
1530          * can happen with large stack limits and large mmap()
1531          * allocations.
1532          */
1533         mm->cached_hole_size = ~0UL;
1534         mm->free_area_cache = TASK_UNMAPPED_BASE;
1535         addr = arch_get_unmapped_area(filp, addr0, len, pgoff, flags);
1536         /*
1537          * Restore the topdown base:
1538          */
1539         mm->free_area_cache = mm->mmap_base;
1540         mm->cached_hole_size = ~0UL;
1541
1542         return addr;
1543 }
1544 #endif
1545
1546 void arch_unmap_area_topdown(struct mm_struct *mm, unsigned long addr)
1547 {
1548         /*
1549          * Is this a new hole at the highest possible address?
1550          */
1551         if (addr > mm->free_area_cache)
1552                 mm->free_area_cache = addr;
1553
1554         /* dont allow allocations above current base */
1555         if (mm->free_area_cache > mm->mmap_base)
1556                 mm->free_area_cache = mm->mmap_base;
1557 }
1558
1559 unsigned long
1560 get_unmapped_area(struct file *file, unsigned long addr, unsigned long len,
1561                 unsigned long pgoff, unsigned long flags)
1562 {
1563         unsigned long (*get_area)(struct file *, unsigned long,
1564                                   unsigned long, unsigned long, unsigned long);
1565
1566         unsigned long error = arch_mmap_check(addr, len, flags);
1567         if (error)
1568                 return error;
1569
1570         /* Careful about overflows.. */
1571         if (len > TASK_SIZE)
1572                 return -ENOMEM;
1573
1574         get_area = current->mm->get_unmapped_area;
1575         if (file && file->f_op && file->f_op->get_unmapped_area)
1576                 get_area = file->f_op->get_unmapped_area;
1577         addr = get_area(file, addr, len, pgoff, flags);
1578         if (IS_ERR_VALUE(addr))
1579                 return addr;
1580
1581         if (addr > TASK_SIZE - len)
1582                 return -ENOMEM;
1583         if (addr & ~PAGE_MASK)
1584                 return -EINVAL;
1585
1586         return arch_rebalance_pgtables(addr, len);
1587 }
1588
1589 EXPORT_SYMBOL(get_unmapped_area);
1590
1591 /* Look up the first VMA which satisfies  addr < vm_end,  NULL if none. */
1592 struct vm_area_struct *find_vma(struct mm_struct *mm, unsigned long addr)
1593 {
1594         struct vm_area_struct *vma = NULL;
1595
1596         if (mm) {
1597                 /* Check the cache first. */
1598                 /* (Cache hit rate is typically around 35%.) */
1599                 vma = ACCESS_ONCE(mm->mmap_cache);
1600                 if (!(vma && vma->vm_end > addr && vma->vm_start <= addr)) {
1601                         struct rb_node * rb_node;
1602
1603                         rb_node = mm->mm_rb.rb_node;
1604                         vma = NULL;
1605
1606                         while (rb_node) {
1607                                 struct vm_area_struct * vma_tmp;
1608
1609                                 vma_tmp = rb_entry(rb_node,
1610                                                 struct vm_area_struct, vm_rb);
1611
1612                                 if (vma_tmp->vm_end > addr) {
1613                                         vma = vma_tmp;
1614                                         if (vma_tmp->vm_start <= addr)
1615                                                 break;
1616                                         rb_node = rb_node->rb_left;
1617                                 } else
1618                                         rb_node = rb_node->rb_right;
1619                         }
1620                         if (vma)
1621                                 mm->mmap_cache = vma;
1622                 }
1623         }
1624         return vma;
1625 }
1626
1627 EXPORT_SYMBOL(find_vma);
1628
1629 /*
1630  * Same as find_vma, but also return a pointer to the previous VMA in *pprev.
1631  */
1632 struct vm_area_struct *
1633 find_vma_prev(struct mm_struct *mm, unsigned long addr,
1634                         struct vm_area_struct **pprev)
1635 {
1636         struct vm_area_struct *vma;
1637
1638         vma = find_vma(mm, addr);
1639         if (vma) {
1640                 *pprev = vma->vm_prev;
1641         } else {
1642                 struct rb_node *rb_node = mm->mm_rb.rb_node;
1643                 *pprev = NULL;
1644                 while (rb_node) {
1645                         *pprev = rb_entry(rb_node, struct vm_area_struct, vm_rb);
1646                         rb_node = rb_node->rb_right;
1647                 }
1648         }
1649         return vma;
1650 }
1651
1652 /*
1653  * Verify that the stack growth is acceptable and
1654  * update accounting. This is shared with both the
1655  * grow-up and grow-down cases.
1656  */
1657 static int acct_stack_growth(struct vm_area_struct *vma,
1658                              unsigned long size, unsigned long grow)
1659 {
1660         struct mm_struct *mm = vma->vm_mm;
1661         struct rlimit *rlim = current->signal->rlim;
1662         unsigned long new_start;
1663
1664         /* address space limit tests */
1665         if (!may_expand_vm(mm, grow))
1666                 return -ENOMEM;
1667
1668         /* Stack limit test */
1669         if (size > ACCESS_ONCE(rlim[RLIMIT_STACK].rlim_cur))
1670                 return -ENOMEM;
1671
1672         /* mlock limit tests */
1673         if (vma->vm_flags & VM_LOCKED) {
1674                 unsigned long locked;
1675                 unsigned long limit;
1676                 locked = mm->locked_vm + grow;
1677                 limit = ACCESS_ONCE(rlim[RLIMIT_MEMLOCK].rlim_cur);
1678                 limit >>= PAGE_SHIFT;
1679                 if (locked > limit && !capable(CAP_IPC_LOCK))
1680                         return -ENOMEM;
1681         }
1682
1683         /* Check to ensure the stack will not grow into a hugetlb-only region */
1684         new_start = (vma->vm_flags & VM_GROWSUP) ? vma->vm_start :
1685                         vma->vm_end - size;
1686         if (is_hugepage_only_range(vma->vm_mm, new_start, size))
1687                 return -EFAULT;
1688
1689         /*
1690          * Overcommit..  This must be the final test, as it will
1691          * update security statistics.
1692          */
1693         if (security_vm_enough_memory_mm(mm, grow))
1694                 return -ENOMEM;
1695
1696         /* Ok, everything looks good - let it rip */
1697         mm->total_vm += grow;
1698         if (vma->vm_flags & VM_LOCKED)
1699                 mm->locked_vm += grow;
1700         vm_stat_account(mm, vma->vm_flags, vma->vm_file, grow);
1701         return 0;
1702 }
1703
1704 #if defined(CONFIG_STACK_GROWSUP) || defined(CONFIG_IA64)
1705 /*
1706  * PA-RISC uses this for its stack; IA64 for its Register Backing Store.
1707  * vma is the last one with address > vma->vm_end.  Have to extend vma.
1708  */
1709 int expand_upwards(struct vm_area_struct *vma, unsigned long address)
1710 {
1711         struct vm_area_struct *next;
1712         unsigned long gap_addr;
1713         int error = 0;
1714
1715         if (!(vma->vm_flags & VM_GROWSUP))
1716                 return -EFAULT;
1717
1718         /* Guard against exceeding limits of the address space. */
1719         address &= PAGE_MASK;
1720         if (address >= TASK_SIZE)
1721                 return -ENOMEM;
1722         address += PAGE_SIZE;
1723
1724         /* Enforce stack_guard_gap */
1725         gap_addr = address + stack_guard_gap;
1726
1727         /* Guard against overflow */
1728         if (gap_addr < address || gap_addr > TASK_SIZE)
1729                 gap_addr = TASK_SIZE;
1730
1731         next = vma->vm_next;
1732         if (next && next->vm_start < gap_addr) {
1733                 if (!(next->vm_flags & VM_GROWSUP))
1734                         return -ENOMEM;
1735                 /* Check that both stack segments have the same anon_vma? */
1736         }
1737
1738         /* We must make sure the anon_vma is allocated. */
1739         if (unlikely(anon_vma_prepare(vma)))
1740                 return -ENOMEM;
1741
1742         /*
1743          * vma->vm_start/vm_end cannot change under us because the caller
1744          * is required to hold the mmap_sem in read mode.  We need the
1745          * anon_vma lock to serialize against concurrent expand_stacks.
1746          */
1747         vma_lock_anon_vma(vma);
1748
1749         /* Somebody else might have raced and expanded it already */
1750         if (address > vma->vm_end) {
1751                 unsigned long size, grow;
1752
1753                 size = address - vma->vm_start;
1754                 grow = (address - vma->vm_end) >> PAGE_SHIFT;
1755
1756                 error = -ENOMEM;
1757                 if (vma->vm_pgoff + (size >> PAGE_SHIFT) >= vma->vm_pgoff) {
1758                         error = acct_stack_growth(vma, size, grow);
1759                         if (!error) {
1760                                 vma->vm_end = address;
1761                                 perf_event_mmap(vma);
1762                         }
1763                 }
1764         }
1765         vma_unlock_anon_vma(vma);
1766         khugepaged_enter_vma_merge(vma, vma->vm_flags);
1767         return error;
1768 }
1769 #endif /* CONFIG_STACK_GROWSUP || CONFIG_IA64 */
1770
1771 /*
1772  * vma is the first one with address < vma->vm_start.  Have to extend vma.
1773  */
1774 int expand_downwards(struct vm_area_struct *vma,
1775                                    unsigned long address)
1776 {
1777         struct vm_area_struct *prev;
1778         unsigned long gap_addr;
1779         int error;
1780
1781         address &= PAGE_MASK;
1782         error = security_file_mmap(NULL, 0, 0, 0, address, 1);
1783         if (error)
1784                 return error;
1785
1786         /* Enforce stack_guard_gap */
1787         gap_addr = address - stack_guard_gap;
1788         if (gap_addr > address)
1789                 return -ENOMEM;
1790         prev = vma->vm_prev;
1791         if (prev && prev->vm_end > gap_addr) {
1792                 if (!(prev->vm_flags & VM_GROWSDOWN))
1793                         return -ENOMEM;
1794                 /* Check that both stack segments have the same anon_vma? */
1795         }
1796
1797         /* We must make sure the anon_vma is allocated. */
1798         if (unlikely(anon_vma_prepare(vma)))
1799                 return -ENOMEM;
1800
1801         /*
1802          * vma->vm_start/vm_end cannot change under us because the caller
1803          * is required to hold the mmap_sem in read mode.  We need the
1804          * anon_vma lock to serialize against concurrent expand_stacks.
1805          */
1806         vma_lock_anon_vma(vma);
1807
1808         /* Somebody else might have raced and expanded it already */
1809         if (address < vma->vm_start) {
1810                 unsigned long size, grow;
1811
1812                 size = vma->vm_end - address;
1813                 grow = (vma->vm_start - address) >> PAGE_SHIFT;
1814
1815                 error = -ENOMEM;
1816                 if (grow <= vma->vm_pgoff) {
1817                         error = acct_stack_growth(vma, size, grow);
1818                         if (!error) {
1819                                 vma->vm_start = address;
1820                                 vma->vm_pgoff -= grow;
1821                                 perf_event_mmap(vma);
1822                         }
1823                 }
1824         }
1825         vma_unlock_anon_vma(vma);
1826         khugepaged_enter_vma_merge(vma, vma->vm_flags);
1827         return error;
1828 }
1829
1830 /* enforced gap between the expanding stack and other mappings. */
1831 unsigned long stack_guard_gap = 256UL<<PAGE_SHIFT;
1832
1833 static int __init cmdline_parse_stack_guard_gap(char *p)
1834 {
1835         unsigned long val;
1836         char *endptr;
1837
1838         val = simple_strtoul(p, &endptr, 10);
1839         if (!*endptr)
1840                 stack_guard_gap = val << PAGE_SHIFT;
1841
1842         return 0;
1843 }
1844 __setup("stack_guard_gap=", cmdline_parse_stack_guard_gap);
1845
1846 #ifdef CONFIG_STACK_GROWSUP
1847 int expand_stack(struct vm_area_struct *vma, unsigned long address)
1848 {
1849         return expand_upwards(vma, address);
1850 }
1851
1852 struct vm_area_struct *
1853 find_extend_vma(struct mm_struct *mm, unsigned long addr)
1854 {
1855         struct vm_area_struct *vma, *prev;
1856
1857         addr &= PAGE_MASK;
1858         vma = find_vma_prev(mm, addr, &prev);
1859         if (vma && (vma->vm_start <= addr))
1860                 return vma;
1861         if (!prev || expand_stack(prev, addr))
1862                 return NULL;
1863         if (prev->vm_flags & VM_LOCKED) {
1864                 mlock_vma_pages_range(prev, addr, prev->vm_end);
1865         }
1866         return prev;
1867 }
1868 #else
1869 int expand_stack(struct vm_area_struct *vma, unsigned long address)
1870 {
1871         return expand_downwards(vma, address);
1872 }
1873
1874 struct vm_area_struct *
1875 find_extend_vma(struct mm_struct * mm, unsigned long addr)
1876 {
1877         struct vm_area_struct * vma;
1878         unsigned long start;
1879
1880         addr &= PAGE_MASK;
1881         vma = find_vma(mm,addr);
1882         if (!vma)
1883                 return NULL;
1884         if (vma->vm_start <= addr)
1885                 return vma;
1886         if (!(vma->vm_flags & VM_GROWSDOWN))
1887                 return NULL;
1888         start = vma->vm_start;
1889         if (expand_stack(vma, addr))
1890                 return NULL;
1891         if (vma->vm_flags & VM_LOCKED) {
1892                 mlock_vma_pages_range(vma, addr, start);
1893         }
1894         return vma;
1895 }
1896 #endif
1897
1898 /*
1899  * Ok - we have the memory areas we should free on the vma list,
1900  * so release them, and do the vma updates.
1901  *
1902  * Called with the mm semaphore held.
1903  */
1904 static void remove_vma_list(struct mm_struct *mm, struct vm_area_struct *vma)
1905 {
1906         /* Update high watermark before we lower total_vm */
1907         update_hiwater_vm(mm);
1908         do {
1909                 long nrpages = vma_pages(vma);
1910
1911                 mm->total_vm -= nrpages;
1912                 vm_stat_account(mm, vma->vm_flags, vma->vm_file, -nrpages);
1913                 vma = remove_vma(vma);
1914         } while (vma);
1915         validate_mm(mm);
1916 }
1917
1918 /*
1919  * Get rid of page table information in the indicated region.
1920  *
1921  * Called with the mm semaphore held.
1922  */
1923 static void unmap_region(struct mm_struct *mm,
1924                 struct vm_area_struct *vma, struct vm_area_struct *prev,
1925                 unsigned long start, unsigned long end)
1926 {
1927         struct vm_area_struct *next = prev? prev->vm_next: mm->mmap;
1928         struct mmu_gather tlb;
1929         unsigned long nr_accounted = 0;
1930
1931         lru_add_drain();
1932         tlb_gather_mmu(&tlb, mm, 0);
1933         update_hiwater_rss(mm);
1934         unmap_vmas(&tlb, vma, start, end, &nr_accounted, NULL);
1935         vm_unacct_memory(nr_accounted);
1936         free_pgtables(&tlb, vma, prev ? prev->vm_end : FIRST_USER_ADDRESS,
1937                                  next ? next->vm_start : 0);
1938         tlb_finish_mmu(&tlb, start, end);
1939 }
1940
1941 /*
1942  * Create a list of vma's touched by the unmap, removing them from the mm's
1943  * vma list as we go..
1944  */
1945 static void
1946 detach_vmas_to_be_unmapped(struct mm_struct *mm, struct vm_area_struct *vma,
1947         struct vm_area_struct *prev, unsigned long end)
1948 {
1949         struct vm_area_struct **insertion_point;
1950         struct vm_area_struct *tail_vma = NULL;
1951         unsigned long addr;
1952
1953         insertion_point = (prev ? &prev->vm_next : &mm->mmap);
1954         vma->vm_prev = NULL;
1955         do {
1956                 rb_erase(&vma->vm_rb, &mm->mm_rb);
1957                 mm->map_count--;
1958                 tail_vma = vma;
1959                 vma = vma->vm_next;
1960         } while (vma && vma->vm_start < end);
1961         *insertion_point = vma;
1962         if (vma)
1963                 vma->vm_prev = prev;
1964         tail_vma->vm_next = NULL;
1965         if (mm->unmap_area == arch_unmap_area)
1966                 addr = prev ? prev->vm_end : mm->mmap_base;
1967         else
1968                 addr = vma ?  vma->vm_start : mm->mmap_base;
1969         mm->unmap_area(mm, addr);
1970         mm->mmap_cache = NULL;          /* Kill the cache. */
1971 }
1972
1973 /*
1974  * __split_vma() bypasses sysctl_max_map_count checking.  We use this on the
1975  * munmap path where it doesn't make sense to fail.
1976  */
1977 static int __split_vma(struct mm_struct * mm, struct vm_area_struct * vma,
1978               unsigned long addr, int new_below)
1979 {
1980         struct mempolicy *pol;
1981         struct vm_area_struct *new;
1982         int err = -ENOMEM;
1983
1984         if (is_vm_hugetlb_page(vma) && (addr &
1985                                         ~(huge_page_mask(hstate_vma(vma)))))
1986                 return -EINVAL;
1987
1988         new = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
1989         if (!new)
1990                 goto out_err;
1991
1992         /* most fields are the same, copy all, and then fixup */
1993         *new = *vma;
1994
1995         INIT_LIST_HEAD(&new->anon_vma_chain);
1996
1997         if (new_below)
1998                 new->vm_end = addr;
1999         else {
2000                 new->vm_start = addr;
2001                 new->vm_pgoff += ((addr - vma->vm_start) >> PAGE_SHIFT);
2002         }
2003
2004         pol = mpol_dup(vma_policy(vma));
2005         if (IS_ERR(pol)) {
2006                 err = PTR_ERR(pol);
2007                 goto out_free_vma;
2008         }
2009         vma_set_policy(new, pol);
2010
2011         if (anon_vma_clone(new, vma))
2012                 goto out_free_mpol;
2013
2014         if (new->vm_file) {
2015                 get_file(new->vm_file);
2016                 if (vma->vm_flags & VM_EXECUTABLE)
2017                         added_exe_file_vma(mm);
2018         }
2019
2020         if (new->vm_ops && new->vm_ops->open)
2021                 new->vm_ops->open(new);
2022
2023         if (new_below)
2024                 err = vma_adjust(vma, addr, vma->vm_end, vma->vm_pgoff +
2025                         ((addr - new->vm_start) >> PAGE_SHIFT), new);
2026         else
2027                 err = vma_adjust(vma, vma->vm_start, addr, vma->vm_pgoff, new);
2028
2029         /* Success. */
2030         if (!err)
2031                 return 0;
2032
2033         /* Clean everything up if vma_adjust failed. */
2034         if (new->vm_ops && new->vm_ops->close)
2035                 new->vm_ops->close(new);
2036         if (new->vm_file) {
2037                 if (vma->vm_flags & VM_EXECUTABLE)
2038                         removed_exe_file_vma(mm);
2039                 fput(new->vm_file);
2040         }
2041         unlink_anon_vmas(new);
2042  out_free_mpol:
2043         mpol_put(pol);
2044  out_free_vma:
2045         kmem_cache_free(vm_area_cachep, new);
2046  out_err:
2047         return err;
2048 }
2049
2050 /*
2051  * Split a vma into two pieces at address 'addr', a new vma is allocated
2052  * either for the first part or the tail.
2053  */
2054 int split_vma(struct mm_struct *mm, struct vm_area_struct *vma,
2055               unsigned long addr, int new_below)
2056 {
2057         if (mm->map_count >= sysctl_max_map_count)
2058                 return -ENOMEM;
2059
2060         return __split_vma(mm, vma, addr, new_below);
2061 }
2062
2063 /* Munmap is split into 2 main parts -- this part which finds
2064  * what needs doing, and the areas themselves, which do the
2065  * work.  This now handles partial unmappings.
2066  * Jeremy Fitzhardinge <jeremy@goop.org>
2067  */
2068 int do_munmap(struct mm_struct *mm, unsigned long start, size_t len)
2069 {
2070         unsigned long end;
2071         struct vm_area_struct *vma, *prev, *last;
2072
2073         if ((start & ~PAGE_MASK) || start > TASK_SIZE || len > TASK_SIZE-start)
2074                 return -EINVAL;
2075
2076         if ((len = PAGE_ALIGN(len)) == 0)
2077                 return -EINVAL;
2078
2079         /* Find the first overlapping VMA */
2080         vma = find_vma(mm, start);
2081         if (!vma)
2082                 return 0;
2083         prev = vma->vm_prev;
2084         /* we have  start < vma->vm_end  */
2085
2086         /* if it doesn't overlap, we have nothing.. */
2087         end = start + len;
2088         if (vma->vm_start >= end)
2089                 return 0;
2090
2091         /*
2092          * If we need to split any vma, do it now to save pain later.
2093          *
2094          * Note: mremap's move_vma VM_ACCOUNT handling assumes a partially
2095          * unmapped vm_area_struct will remain in use: so lower split_vma
2096          * places tmp vma above, and higher split_vma places tmp vma below.
2097          */
2098         if (start > vma->vm_start) {
2099                 int error;
2100
2101                 /*
2102                  * Make sure that map_count on return from munmap() will
2103                  * not exceed its limit; but let map_count go just above
2104                  * its limit temporarily, to help free resources as expected.
2105                  */
2106                 if (end < vma->vm_end && mm->map_count >= sysctl_max_map_count)
2107                         return -ENOMEM;
2108
2109                 error = __split_vma(mm, vma, start, 0);
2110                 if (error)
2111                         return error;
2112                 prev = vma;
2113         }
2114
2115         /* Does it split the last one? */
2116         last = find_vma(mm, end);
2117         if (last && end > last->vm_start) {
2118                 int error = __split_vma(mm, last, end, 1);
2119                 if (error)
2120                         return error;
2121         }
2122         vma = prev? prev->vm_next: mm->mmap;
2123
2124         /*
2125          * unlock any mlock()ed ranges before detaching vmas
2126          */
2127         if (mm->locked_vm) {
2128                 struct vm_area_struct *tmp = vma;
2129                 while (tmp && tmp->vm_start < end) {
2130                         if (tmp->vm_flags & VM_LOCKED) {
2131                                 mm->locked_vm -= vma_pages(tmp);
2132                                 munlock_vma_pages_all(tmp);
2133                         }
2134                         tmp = tmp->vm_next;
2135                 }
2136         }
2137
2138         /*
2139          * Remove the vma's, and unmap the actual pages
2140          */
2141         detach_vmas_to_be_unmapped(mm, vma, prev, end);
2142         unmap_region(mm, vma, prev, start, end);
2143
2144         /* Fix up all other VM information */
2145         remove_vma_list(mm, vma);
2146
2147         return 0;
2148 }
2149
2150 EXPORT_SYMBOL(do_munmap);
2151
2152 SYSCALL_DEFINE2(munmap, unsigned long, addr, size_t, len)
2153 {
2154         int ret;
2155         struct mm_struct *mm = current->mm;
2156
2157         profile_munmap(addr);
2158
2159         down_write(&mm->mmap_sem);
2160         ret = do_munmap(mm, addr, len);
2161         up_write(&mm->mmap_sem);
2162         return ret;
2163 }
2164
2165 static inline void verify_mm_writelocked(struct mm_struct *mm)
2166 {
2167 #ifdef CONFIG_DEBUG_VM
2168         if (unlikely(down_read_trylock(&mm->mmap_sem))) {
2169                 WARN_ON(1);
2170                 up_read(&mm->mmap_sem);
2171         }
2172 #endif
2173 }
2174
2175 /*
2176  *  this is really a simplified "do_mmap".  it only handles
2177  *  anonymous maps.  eventually we may be able to do some
2178  *  brk-specific accounting here.
2179  */
2180 unsigned long do_brk(unsigned long addr, unsigned long len)
2181 {
2182         struct mm_struct * mm = current->mm;
2183         struct vm_area_struct * vma, * prev;
2184         unsigned long flags;
2185         struct rb_node ** rb_link, * rb_parent;
2186         pgoff_t pgoff = addr >> PAGE_SHIFT;
2187         int error;
2188
2189         len = PAGE_ALIGN(len);
2190         if (!len)
2191                 return addr;
2192
2193         error = security_file_mmap(NULL, 0, 0, 0, addr, 1);
2194         if (error)
2195                 return error;
2196
2197         flags = VM_DATA_DEFAULT_FLAGS | VM_ACCOUNT | mm->def_flags;
2198
2199         error = get_unmapped_area(NULL, addr, len, 0, MAP_FIXED);
2200         if (error & ~PAGE_MASK)
2201                 return error;
2202
2203         /*
2204          * mlock MCL_FUTURE?
2205          */
2206         if (mm->def_flags & VM_LOCKED) {
2207                 unsigned long locked, lock_limit;
2208                 locked = len >> PAGE_SHIFT;
2209                 locked += mm->locked_vm;
2210                 lock_limit = rlimit(RLIMIT_MEMLOCK);
2211                 lock_limit >>= PAGE_SHIFT;
2212                 if (locked > lock_limit && !capable(CAP_IPC_LOCK))
2213                         return -EAGAIN;
2214         }
2215
2216         /*
2217          * mm->mmap_sem is required to protect against another thread
2218          * changing the mappings in case we sleep.
2219          */
2220         verify_mm_writelocked(mm);
2221
2222         /*
2223          * Clear old maps.  this also does some error checking for us
2224          */
2225  munmap_back:
2226         vma = find_vma_prepare(mm, addr, &prev, &rb_link, &rb_parent);
2227         if (vma && vma->vm_start < addr + len) {
2228                 if (do_munmap(mm, addr, len))
2229                         return -ENOMEM;
2230                 goto munmap_back;
2231         }
2232
2233         /* Check against address space limits *after* clearing old maps... */
2234         if (!may_expand_vm(mm, len >> PAGE_SHIFT))
2235                 return -ENOMEM;
2236
2237         if (mm->map_count > sysctl_max_map_count)
2238                 return -ENOMEM;
2239
2240         if (security_vm_enough_memory(len >> PAGE_SHIFT))
2241                 return -ENOMEM;
2242
2243         /* Can we just expand an old private anonymous mapping? */
2244         vma = vma_merge(mm, prev, addr, addr + len, flags,
2245                                         NULL, NULL, pgoff, NULL);
2246         if (vma)
2247                 goto out;
2248
2249         /*
2250          * create a vma struct for an anonymous mapping
2251          */
2252         vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL);
2253         if (!vma) {
2254                 vm_unacct_memory(len >> PAGE_SHIFT);
2255                 return -ENOMEM;
2256         }
2257
2258         INIT_LIST_HEAD(&vma->anon_vma_chain);
2259         vma->vm_mm = mm;
2260         vma->vm_start = addr;
2261         vma->vm_end = addr + len;
2262         vma->vm_pgoff = pgoff;
2263         vma->vm_flags = flags;
2264         vma->vm_page_prot = vm_get_page_prot(flags);
2265         vma_link(mm, vma, prev, rb_link, rb_parent);
2266 out:
2267         perf_event_mmap(vma);
2268         mm->total_vm += len >> PAGE_SHIFT;
2269         if (flags & VM_LOCKED) {
2270                 if (!mlock_vma_pages_range(vma, addr, addr + len))
2271                         mm->locked_vm += (len >> PAGE_SHIFT);
2272         }
2273         return addr;
2274 }
2275
2276 EXPORT_SYMBOL(do_brk);
2277
2278 /* Release all mmaps. */
2279 void exit_mmap(struct mm_struct *mm)
2280 {
2281         struct mmu_gather tlb;
2282         struct vm_area_struct *vma;
2283         unsigned long nr_accounted = 0;
2284         unsigned long end;
2285
2286         /* mm's last user has gone, and its about to be pulled down */
2287         mmu_notifier_release(mm);
2288
2289         if (mm->locked_vm) {
2290                 vma = mm->mmap;
2291                 while (vma) {
2292                         if (vma->vm_flags & VM_LOCKED)
2293                                 munlock_vma_pages_all(vma);
2294                         vma = vma->vm_next;
2295                 }
2296         }
2297
2298         arch_exit_mmap(mm);
2299
2300         vma = mm->mmap;
2301         if (!vma)       /* Can happen if dup_mmap() received an OOM */
2302                 return;
2303
2304         lru_add_drain();
2305         flush_cache_mm(mm);
2306         tlb_gather_mmu(&tlb, mm, 1);
2307         /* update_hiwater_rss(mm) here? but nobody should be looking */
2308         /* Use -1 here to ensure all VMAs in the mm are unmapped */
2309         end = unmap_vmas(&tlb, vma, 0, -1, &nr_accounted, NULL);
2310         vm_unacct_memory(nr_accounted);
2311
2312         free_pgtables(&tlb, vma, FIRST_USER_ADDRESS, 0);
2313         tlb_finish_mmu(&tlb, 0, end);
2314
2315         /*
2316          * Walk the list again, actually closing and freeing it,
2317          * with preemption enabled, without holding any MM locks.
2318          */
2319         while (vma)
2320                 vma = remove_vma(vma);
2321
2322         BUG_ON(mm->nr_ptes > (FIRST_USER_ADDRESS+PMD_SIZE-1)>>PMD_SHIFT);
2323 }
2324
2325 /* Insert vm structure into process list sorted by address
2326  * and into the inode's i_mmap tree.  If vm_file is non-NULL
2327  * then i_mmap_mutex is taken here.
2328  */
2329 int insert_vm_struct(struct mm_struct * mm, struct vm_area_struct * vma)
2330 {
2331         struct vm_area_struct * __vma, * prev;
2332         struct rb_node ** rb_link, * rb_parent;
2333
2334         /*
2335          * The vm_pgoff of a purely anonymous vma should be irrelevant
2336          * until its first write fault, when page's anon_vma and index
2337          * are set.  But now set the vm_pgoff it will almost certainly
2338          * end up with (unless mremap moves it elsewhere before that
2339          * first wfault), so /proc/pid/maps tells a consistent story.
2340          *
2341          * By setting it to reflect the virtual start address of the
2342          * vma, merges and splits can happen in a seamless way, just
2343          * using the existing file pgoff checks and manipulations.
2344          * Similarly in do_mmap_pgoff and in do_brk.
2345          */
2346         if (!vma->vm_file) {
2347                 BUG_ON(vma->anon_vma);
2348                 vma->vm_pgoff = vma->vm_start >> PAGE_SHIFT;
2349         }
2350         __vma = find_vma_prepare(mm,vma->vm_start,&prev,&rb_link,&rb_parent);
2351         if (__vma && __vma->vm_start < vma->vm_end)
2352                 return -ENOMEM;
2353         if ((vma->vm_flags & VM_ACCOUNT) &&
2354              security_vm_enough_memory_mm(mm, vma_pages(vma)))
2355                 return -ENOMEM;
2356         vma_link(mm, vma, prev, rb_link, rb_parent);
2357         return 0;
2358 }
2359
2360 /*
2361  * Copy the vma structure to a new location in the same mm,
2362  * prior to moving page table entries, to effect an mremap move.
2363  */
2364 struct vm_area_struct *copy_vma(struct vm_area_struct **vmap,
2365         unsigned long addr, unsigned long len, pgoff_t pgoff)
2366 {
2367         struct vm_area_struct *vma = *vmap;
2368         unsigned long vma_start = vma->vm_start;
2369         struct mm_struct *mm = vma->vm_mm;
2370         struct vm_area_struct *new_vma, *prev;
2371         struct rb_node **rb_link, *rb_parent;
2372         struct mempolicy *pol;
2373
2374         /*
2375          * If anonymous vma has not yet been faulted, update new pgoff
2376          * to match new location, to increase its chance of merging.
2377          */
2378         if (!vma->vm_file && !vma->anon_vma)
2379                 pgoff = addr >> PAGE_SHIFT;
2380
2381         find_vma_prepare(mm, addr, &prev, &rb_link, &rb_parent);
2382         new_vma = vma_merge(mm, prev, addr, addr + len, vma->vm_flags,
2383                         vma->anon_vma, vma->vm_file, pgoff, vma_policy(vma));
2384         if (new_vma) {
2385                 /*
2386                  * Source vma may have been merged into new_vma
2387                  */
2388                 if (vma_start >= new_vma->vm_start &&
2389                     vma_start < new_vma->vm_end)
2390                         *vmap = new_vma;
2391         } else {
2392                 new_vma = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
2393                 if (new_vma) {
2394                         *new_vma = *vma;
2395                         pol = mpol_dup(vma_policy(vma));
2396                         if (IS_ERR(pol))
2397                                 goto out_free_vma;
2398                         INIT_LIST_HEAD(&new_vma->anon_vma_chain);
2399                         if (anon_vma_clone(new_vma, vma))
2400                                 goto out_free_mempol;
2401                         vma_set_policy(new_vma, pol);
2402                         new_vma->vm_start = addr;
2403                         new_vma->vm_end = addr + len;
2404                         new_vma->vm_pgoff = pgoff;
2405                         if (new_vma->vm_file) {
2406                                 get_file(new_vma->vm_file);
2407                                 if (vma->vm_flags & VM_EXECUTABLE)
2408                                         added_exe_file_vma(mm);
2409                         }
2410                         if (new_vma->vm_ops && new_vma->vm_ops->open)
2411                                 new_vma->vm_ops->open(new_vma);
2412                         vma_link(mm, new_vma, prev, rb_link, rb_parent);
2413                 }
2414         }
2415         return new_vma;
2416
2417  out_free_mempol:
2418         mpol_put(pol);
2419  out_free_vma:
2420         kmem_cache_free(vm_area_cachep, new_vma);
2421         return NULL;
2422 }
2423
2424 /*
2425  * Return true if the calling process may expand its vm space by the passed
2426  * number of pages
2427  */
2428 int may_expand_vm(struct mm_struct *mm, unsigned long npages)
2429 {
2430         unsigned long cur = mm->total_vm;       /* pages */
2431         unsigned long lim;
2432
2433         lim = rlimit(RLIMIT_AS) >> PAGE_SHIFT;
2434
2435         if (cur + npages > lim)
2436                 return 0;
2437         return 1;
2438 }
2439
2440
2441 static int special_mapping_fault(struct vm_area_struct *vma,
2442                                 struct vm_fault *vmf)
2443 {
2444         pgoff_t pgoff;
2445         struct page **pages;
2446
2447         /*
2448          * special mappings have no vm_file, and in that case, the mm
2449          * uses vm_pgoff internally. So we have to subtract it from here.
2450          * We are allowed to do this because we are the mm; do not copy
2451          * this code into drivers!
2452          */
2453         pgoff = vmf->pgoff - vma->vm_pgoff;
2454
2455         for (pages = vma->vm_private_data; pgoff && *pages; ++pages)
2456                 pgoff--;
2457
2458         if (*pages) {
2459                 struct page *page = *pages;
2460                 get_page(page);
2461                 vmf->page = page;
2462                 return 0;
2463         }
2464
2465         return VM_FAULT_SIGBUS;
2466 }
2467
2468 /*
2469  * Having a close hook prevents vma merging regardless of flags.
2470  */
2471 static void special_mapping_close(struct vm_area_struct *vma)
2472 {
2473 }
2474
2475 static const struct vm_operations_struct special_mapping_vmops = {
2476         .close = special_mapping_close,
2477         .fault = special_mapping_fault,
2478 };
2479
2480 /*
2481  * Called with mm->mmap_sem held for writing.
2482  * Insert a new vma covering the given region, with the given flags.
2483  * Its pages are supplied by the given array of struct page *.
2484  * The array can be shorter than len >> PAGE_SHIFT if it's null-terminated.
2485  * The region past the last page supplied will always produce SIGBUS.
2486  * The array pointer and the pages it points to are assumed to stay alive
2487  * for as long as this mapping might exist.
2488  */
2489 int install_special_mapping(struct mm_struct *mm,
2490                             unsigned long addr, unsigned long len,
2491                             unsigned long vm_flags, struct page **pages)
2492 {
2493         int ret;
2494         struct vm_area_struct *vma;
2495
2496         vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL);
2497         if (unlikely(vma == NULL))
2498                 return -ENOMEM;
2499
2500         INIT_LIST_HEAD(&vma->anon_vma_chain);
2501         vma->vm_mm = mm;
2502         vma->vm_start = addr;
2503         vma->vm_end = addr + len;
2504
2505         vma->vm_flags = vm_flags | mm->def_flags | VM_DONTEXPAND;
2506         vma->vm_page_prot = vm_get_page_prot(vma->vm_flags);
2507
2508         vma->vm_ops = &special_mapping_vmops;
2509         vma->vm_private_data = pages;
2510
2511         ret = security_file_mmap(NULL, 0, 0, 0, vma->vm_start, 1);
2512         if (ret)
2513                 goto out;
2514
2515         ret = insert_vm_struct(mm, vma);
2516         if (ret)
2517                 goto out;
2518
2519         mm->total_vm += len >> PAGE_SHIFT;
2520
2521         perf_event_mmap(vma);
2522
2523         return 0;
2524
2525 out:
2526         kmem_cache_free(vm_area_cachep, vma);
2527         return ret;
2528 }
2529
2530 static DEFINE_MUTEX(mm_all_locks_mutex);
2531
2532 static void vm_lock_anon_vma(struct mm_struct *mm, struct anon_vma *anon_vma)
2533 {
2534         if (!test_bit(0, (unsigned long *) &anon_vma->root->head.next)) {
2535                 /*
2536                  * The LSB of head.next can't change from under us
2537                  * because we hold the mm_all_locks_mutex.
2538                  */
2539                 mutex_lock_nest_lock(&anon_vma->root->mutex, &mm->mmap_sem);
2540                 /*
2541                  * We can safely modify head.next after taking the
2542                  * anon_vma->root->mutex. If some other vma in this mm shares
2543                  * the same anon_vma we won't take it again.
2544                  *
2545                  * No need of atomic instructions here, head.next
2546                  * can't change from under us thanks to the
2547                  * anon_vma->root->mutex.
2548                  */
2549                 if (__test_and_set_bit(0, (unsigned long *)
2550                                        &anon_vma->root->head.next))
2551                         BUG();
2552         }
2553 }
2554
2555 static void vm_lock_mapping(struct mm_struct *mm, struct address_space *mapping)
2556 {
2557         if (!test_bit(AS_MM_ALL_LOCKS, &mapping->flags)) {
2558                 /*
2559                  * AS_MM_ALL_LOCKS can't change from under us because
2560                  * we hold the mm_all_locks_mutex.
2561                  *
2562                  * Operations on ->flags have to be atomic because
2563                  * even if AS_MM_ALL_LOCKS is stable thanks to the
2564                  * mm_all_locks_mutex, there may be other cpus
2565                  * changing other bitflags in parallel to us.
2566                  */
2567                 if (test_and_set_bit(AS_MM_ALL_LOCKS, &mapping->flags))
2568                         BUG();
2569                 mutex_lock_nest_lock(&mapping->i_mmap_mutex, &mm->mmap_sem);
2570         }
2571 }
2572
2573 /*
2574  * This operation locks against the VM for all pte/vma/mm related
2575  * operations that could ever happen on a certain mm. This includes
2576  * vmtruncate, try_to_unmap, and all page faults.
2577  *
2578  * The caller must take the mmap_sem in write mode before calling
2579  * mm_take_all_locks(). The caller isn't allowed to release the
2580  * mmap_sem until mm_drop_all_locks() returns.
2581  *
2582  * mmap_sem in write mode is required in order to block all operations
2583  * that could modify pagetables and free pages without need of
2584  * altering the vma layout (for example populate_range() with
2585  * nonlinear vmas). It's also needed in write mode to avoid new
2586  * anon_vmas to be associated with existing vmas.
2587  *
2588  * A single task can't take more than one mm_take_all_locks() in a row
2589  * or it would deadlock.
2590  *
2591  * The LSB in anon_vma->head.next and the AS_MM_ALL_LOCKS bitflag in
2592  * mapping->flags avoid to take the same lock twice, if more than one
2593  * vma in this mm is backed by the same anon_vma or address_space.
2594  *
2595  * We can take all the locks in random order because the VM code
2596  * taking i_mmap_mutex or anon_vma->mutex outside the mmap_sem never
2597  * takes more than one of them in a row. Secondly we're protected
2598  * against a concurrent mm_take_all_locks() by the mm_all_locks_mutex.
2599  *
2600  * mm_take_all_locks() and mm_drop_all_locks are expensive operations
2601  * that may have to take thousand of locks.
2602  *
2603  * mm_take_all_locks() can fail if it's interrupted by signals.
2604  */
2605 int mm_take_all_locks(struct mm_struct *mm)
2606 {
2607         struct vm_area_struct *vma;
2608         struct anon_vma_chain *avc;
2609
2610         BUG_ON(down_read_trylock(&mm->mmap_sem));
2611
2612         mutex_lock(&mm_all_locks_mutex);
2613
2614         for (vma = mm->mmap; vma; vma = vma->vm_next) {
2615                 if (signal_pending(current))
2616                         goto out_unlock;
2617                 if (vma->vm_file && vma->vm_file->f_mapping)
2618                         vm_lock_mapping(mm, vma->vm_file->f_mapping);
2619         }
2620
2621         for (vma = mm->mmap; vma; vma = vma->vm_next) {
2622                 if (signal_pending(current))
2623                         goto out_unlock;
2624                 if (vma->anon_vma)
2625                         list_for_each_entry(avc, &vma->anon_vma_chain, same_vma)
2626                                 vm_lock_anon_vma(mm, avc->anon_vma);
2627         }
2628
2629         return 0;
2630
2631 out_unlock:
2632         mm_drop_all_locks(mm);
2633         return -EINTR;
2634 }
2635
2636 static void vm_unlock_anon_vma(struct anon_vma *anon_vma)
2637 {
2638         if (test_bit(0, (unsigned long *) &anon_vma->root->head.next)) {
2639                 /*
2640                  * The LSB of head.next can't change to 0 from under
2641                  * us because we hold the mm_all_locks_mutex.
2642                  *
2643                  * We must however clear the bitflag before unlocking
2644                  * the vma so the users using the anon_vma->head will
2645                  * never see our bitflag.
2646                  *
2647                  * No need of atomic instructions here, head.next
2648                  * can't change from under us until we release the
2649                  * anon_vma->root->mutex.
2650                  */
2651                 if (!__test_and_clear_bit(0, (unsigned long *)
2652                                           &anon_vma->root->head.next))
2653                         BUG();
2654                 anon_vma_unlock(anon_vma);
2655         }
2656 }
2657
2658 static void vm_unlock_mapping(struct address_space *mapping)
2659 {
2660         if (test_bit(AS_MM_ALL_LOCKS, &mapping->flags)) {
2661                 /*
2662                  * AS_MM_ALL_LOCKS can't change to 0 from under us
2663                  * because we hold the mm_all_locks_mutex.
2664                  */
2665                 mutex_unlock(&mapping->i_mmap_mutex);
2666                 if (!test_and_clear_bit(AS_MM_ALL_LOCKS,
2667                                         &mapping->flags))
2668                         BUG();
2669         }
2670 }
2671
2672 /*
2673  * The mmap_sem cannot be released by the caller until
2674  * mm_drop_all_locks() returns.
2675  */
2676 void mm_drop_all_locks(struct mm_struct *mm)
2677 {
2678         struct vm_area_struct *vma;
2679         struct anon_vma_chain *avc;
2680
2681         BUG_ON(down_read_trylock(&mm->mmap_sem));
2682         BUG_ON(!mutex_is_locked(&mm_all_locks_mutex));
2683
2684         for (vma = mm->mmap; vma; vma = vma->vm_next) {
2685                 if (vma->anon_vma)
2686                         list_for_each_entry(avc, &vma->anon_vma_chain, same_vma)
2687                                 vm_unlock_anon_vma(avc->anon_vma);
2688                 if (vma->vm_file && vma->vm_file->f_mapping)
2689                         vm_unlock_mapping(vma->vm_file->f_mapping);
2690         }
2691
2692         mutex_unlock(&mm_all_locks_mutex);
2693 }
2694
2695 /*
2696  * initialise the VMA slab
2697  */
2698 void __init mmap_init(void)
2699 {
2700         int ret;
2701
2702         ret = percpu_counter_init(&vm_committed_as, 0);
2703         VM_BUG_ON(ret);
2704 }