blob: 292ddc3cef9cba4bf58053da23bfcae5a2e9de02 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * mm/mmap.c
3 *
4 * Written by obz.
5 *
Alan Cox046c6882009-01-05 14:06:29 +00006 * Address space accounting code <alan@lxorguk.ukuu.org.uk>
Linus Torvalds1da177e2005-04-16 15:20:36 -07007 */
8
9#include <linux/slab.h>
Alexey Dobriyan4af3c9c2007-10-16 23:29:23 -070010#include <linux/backing-dev.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070011#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>
Randy.Dunlapc59ede72006-01-11 12:17:46 -080017#include <linux/capability.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070018#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/module.h>
26#include <linux/mount.h>
27#include <linux/mempolicy.h>
28#include <linux/rmap.h>
Andrea Arcangelicddb8a52008-07-28 15:46:29 -070029#include <linux/mmu_notifier.h>
Ingo Molnarcdd6c482009-09-21 12:02:48 +020030#include <linux/perf_event.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070031
32#include <asm/uaccess.h>
33#include <asm/cacheflush.h>
34#include <asm/tlb.h>
Jeremy Fitzhardinged6dd61c2007-05-02 19:27:14 +020035#include <asm/mmu_context.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070036
Jan Beulich42b77722008-07-23 21:27:10 -070037#include "internal.h"
38
Kirill Korotaev3a459752006-09-07 14:17:04 +040039#ifndef arch_mmap_check
40#define arch_mmap_check(addr, len, flags) (0)
41#endif
42
Martin Schwidefsky08e7d9b2008-02-04 22:29:16 -080043#ifndef arch_rebalance_pgtables
44#define arch_rebalance_pgtables(addr, len) (addr)
45#endif
46
Hugh Dickinse0da3822005-04-19 13:29:15 -070047static void unmap_region(struct mm_struct *mm,
48 struct vm_area_struct *vma, struct vm_area_struct *prev,
49 unsigned long start, unsigned long end);
50
Linus Torvalds1da177e2005-04-16 15:20:36 -070051/*
52 * WARNING: the debugging will use recursive algorithms so never enable this
53 * unless you know what you are doing.
54 */
55#undef DEBUG_MM_RB
56
57/* description of effects of mapping type and prot in current implementation.
58 * this is due to the limited x86 page protection hardware. The expected
59 * behavior is in parens:
60 *
61 * map_type prot
62 * PROT_NONE PROT_READ PROT_WRITE PROT_EXEC
63 * MAP_SHARED r: (no) no r: (yes) yes r: (no) yes r: (no) yes
64 * w: (no) no w: (no) no w: (yes) yes w: (no) no
65 * x: (no) no x: (no) yes x: (no) yes x: (yes) yes
66 *
67 * MAP_PRIVATE r: (no) no r: (yes) yes r: (no) yes r: (no) yes
68 * w: (no) no w: (no) no w: (copy) copy w: (no) no
69 * x: (no) no x: (no) yes x: (no) yes x: (yes) yes
70 *
71 */
72pgprot_t protection_map[16] = {
73 __P000, __P001, __P010, __P011, __P100, __P101, __P110, __P111,
74 __S000, __S001, __S010, __S011, __S100, __S101, __S110, __S111
75};
76
Hugh Dickins804af2c2006-07-26 21:39:49 +010077pgprot_t vm_get_page_prot(unsigned long vm_flags)
78{
Dave Kleikampb845f312008-07-08 00:28:51 +100079 return __pgprot(pgprot_val(protection_map[vm_flags &
80 (VM_READ|VM_WRITE|VM_EXEC|VM_SHARED)]) |
81 pgprot_val(arch_vm_get_page_prot(vm_flags)));
Hugh Dickins804af2c2006-07-26 21:39:49 +010082}
83EXPORT_SYMBOL(vm_get_page_prot);
84
Linus Torvalds1da177e2005-04-16 15:20:36 -070085int sysctl_overcommit_memory = OVERCOMMIT_GUESS; /* heuristic overcommit */
86int sysctl_overcommit_ratio = 50; /* default is 50% */
Christoph Lameterc3d8c142005-09-06 15:16:33 -070087int sysctl_max_map_count __read_mostly = DEFAULT_MAX_MAP_COUNT;
KOSAKI Motohiro00a62ce2009-04-30 15:08:51 -070088struct percpu_counter vm_committed_as;
Linus Torvalds1da177e2005-04-16 15:20:36 -070089
90/*
91 * Check that a process has enough memory to allocate a new virtual
92 * mapping. 0 means there is enough memory for the allocation to
93 * succeed and -ENOMEM implies there is not.
94 *
95 * We currently support three overcommit policies, which are set via the
96 * vm.overcommit_memory sysctl. See Documentation/vm/overcommit-accounting
97 *
98 * Strict overcommit modes added 2002 Feb 26 by Alan Cox.
99 * Additional code 2002 Jul 20 by Robert Love.
100 *
101 * cap_sys_admin is 1 if the process has admin privileges, 0 otherwise.
102 *
103 * Note this is a helper function intended to be used by LSMs which
104 * wish to use this logic.
105 */
Alan Cox34b4e4a2007-08-22 14:01:28 -0700106int __vm_enough_memory(struct mm_struct *mm, long pages, int cap_sys_admin)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700107{
108 unsigned long free, allowed;
109
110 vm_acct_memory(pages);
111
112 /*
113 * Sometimes we want to use more memory than we have
114 */
115 if (sysctl_overcommit_memory == OVERCOMMIT_ALWAYS)
116 return 0;
117
118 if (sysctl_overcommit_memory == OVERCOMMIT_GUESS) {
119 unsigned long n;
120
Christoph Lameter347ce432006-06-30 01:55:35 -0700121 free = global_page_state(NR_FILE_PAGES);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122 free += nr_swap_pages;
123
124 /*
125 * Any slabs which are created with the
126 * SLAB_RECLAIM_ACCOUNT flag claim to have contents
127 * which are reclaimable, under pressure. The dentry
128 * cache and most inode caches should fall into this
129 */
Christoph Lameter972d1a72006-09-25 23:31:51 -0700130 free += global_page_state(NR_SLAB_RECLAIMABLE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131
132 /*
133 * Leave the last 3% for root
134 */
135 if (!cap_sys_admin)
136 free -= free / 32;
137
138 if (free > pages)
139 return 0;
140
141 /*
142 * nr_free_pages() is very expensive on large systems,
143 * only call if we're about to fail.
144 */
145 n = nr_free_pages();
Hideo AOKI6d9f7832006-04-10 22:53:00 -0700146
147 /*
148 * Leave reserved pages. The pages are not for anonymous pages.
149 */
150 if (n <= totalreserve_pages)
151 goto error;
152 else
153 n -= totalreserve_pages;
154
155 /*
156 * Leave the last 3% for root
157 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700158 if (!cap_sys_admin)
159 n -= n / 32;
160 free += n;
161
162 if (free > pages)
163 return 0;
Hideo AOKI6d9f7832006-04-10 22:53:00 -0700164
165 goto error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700166 }
167
168 allowed = (totalram_pages - hugetlb_total_pages())
169 * sysctl_overcommit_ratio / 100;
170 /*
171 * Leave the last 3% for root
172 */
173 if (!cap_sys_admin)
174 allowed -= allowed / 32;
175 allowed += total_swap_pages;
176
177 /* Don't let a single process grow too big:
178 leave 3% of the size of this process for other processes */
Alan Cox731572d2008-10-29 14:01:20 -0700179 if (mm)
180 allowed -= mm->total_vm / 32;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700181
KOSAKI Motohiro00a62ce2009-04-30 15:08:51 -0700182 if (percpu_counter_read_positive(&vm_committed_as) < allowed)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700183 return 0;
Hideo AOKI6d9f7832006-04-10 22:53:00 -0700184error:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700185 vm_unacct_memory(pages);
186
187 return -ENOMEM;
188}
189
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190/*
191 * Requires inode->i_mapping->i_mmap_lock
192 */
193static void __remove_shared_vm_struct(struct vm_area_struct *vma,
194 struct file *file, struct address_space *mapping)
195{
196 if (vma->vm_flags & VM_DENYWRITE)
Josef "Jeff" Sipekd3ac7f82006-12-08 02:36:44 -0800197 atomic_inc(&file->f_path.dentry->d_inode->i_writecount);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700198 if (vma->vm_flags & VM_SHARED)
199 mapping->i_mmap_writable--;
200
201 flush_dcache_mmap_lock(mapping);
202 if (unlikely(vma->vm_flags & VM_NONLINEAR))
203 list_del_init(&vma->shared.vm_set.list);
204 else
205 vma_prio_tree_remove(vma, &mapping->i_mmap);
206 flush_dcache_mmap_unlock(mapping);
207}
208
209/*
Hugh Dickinsa8fb5612005-10-29 18:15:57 -0700210 * Unlink a file-based vm structure from its prio_tree, to hide
211 * vma from rmap and vmtruncate before freeing its page tables.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700212 */
Hugh Dickinsa8fb5612005-10-29 18:15:57 -0700213void unlink_file_vma(struct vm_area_struct *vma)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700214{
215 struct file *file = vma->vm_file;
216
Linus Torvalds1da177e2005-04-16 15:20:36 -0700217 if (file) {
218 struct address_space *mapping = file->f_mapping;
219 spin_lock(&mapping->i_mmap_lock);
220 __remove_shared_vm_struct(vma, file, mapping);
221 spin_unlock(&mapping->i_mmap_lock);
222 }
Hugh Dickinsa8fb5612005-10-29 18:15:57 -0700223}
224
225/*
226 * Close a vm structure and free it, returning the next.
227 */
228static struct vm_area_struct *remove_vma(struct vm_area_struct *vma)
229{
230 struct vm_area_struct *next = vma->vm_next;
231
Hugh Dickinsa8fb5612005-10-29 18:15:57 -0700232 might_sleep();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700233 if (vma->vm_ops && vma->vm_ops->close)
234 vma->vm_ops->close(vma);
Matt Helsley925d1c42008-04-29 01:01:36 -0700235 if (vma->vm_file) {
Hugh Dickinsa8fb5612005-10-29 18:15:57 -0700236 fput(vma->vm_file);
Matt Helsley925d1c42008-04-29 01:01:36 -0700237 if (vma->vm_flags & VM_EXECUTABLE)
238 removed_exe_file_vma(vma->vm_mm);
239 }
Lee Schermerhornf0be3d32008-04-28 02:13:08 -0700240 mpol_put(vma_policy(vma));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241 kmem_cache_free(vm_area_cachep, vma);
Hugh Dickinsa8fb5612005-10-29 18:15:57 -0700242 return next;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700243}
244
Heiko Carstens6a6160a2009-01-14 14:14:15 +0100245SYSCALL_DEFINE1(brk, unsigned long, brk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246{
247 unsigned long rlim, retval;
248 unsigned long newbrk, oldbrk;
249 struct mm_struct *mm = current->mm;
Jiri Kosinaa5b45922008-06-05 22:46:05 -0700250 unsigned long min_brk;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700251
252 down_write(&mm->mmap_sem);
253
Jiri Kosinaa5b45922008-06-05 22:46:05 -0700254#ifdef CONFIG_COMPAT_BRK
255 min_brk = mm->end_code;
256#else
257 min_brk = mm->start_brk;
258#endif
259 if (brk < min_brk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260 goto out;
Ram Gupta1e624192006-04-10 22:52:57 -0700261
262 /*
263 * Check against rlimit here. If this check is done later after the test
264 * of oldbrk with newbrk then it can escape the test and let the data
265 * segment grow beyond its set limit the in case where the limit is
266 * not page aligned -Ram Gupta
267 */
268 rlim = current->signal->rlim[RLIMIT_DATA].rlim_cur;
Jiri Kosinac1d171a2008-01-30 13:30:40 +0100269 if (rlim < RLIM_INFINITY && (brk - mm->start_brk) +
270 (mm->end_data - mm->start_data) > rlim)
Ram Gupta1e624192006-04-10 22:52:57 -0700271 goto out;
272
Linus Torvalds1da177e2005-04-16 15:20:36 -0700273 newbrk = PAGE_ALIGN(brk);
274 oldbrk = PAGE_ALIGN(mm->brk);
275 if (oldbrk == newbrk)
276 goto set_brk;
277
278 /* Always allow shrinking brk. */
279 if (brk <= mm->brk) {
280 if (!do_munmap(mm, newbrk, oldbrk-newbrk))
281 goto set_brk;
282 goto out;
283 }
284
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285 /* Check against existing mmap mappings. */
286 if (find_vma_intersection(mm, oldbrk, newbrk+PAGE_SIZE))
287 goto out;
288
289 /* Ok, looks good - let it rip. */
290 if (do_brk(oldbrk, newbrk-oldbrk) != oldbrk)
291 goto out;
292set_brk:
293 mm->brk = brk;
294out:
295 retval = mm->brk;
296 up_write(&mm->mmap_sem);
297 return retval;
298}
299
300#ifdef DEBUG_MM_RB
301static int browse_rb(struct rb_root *root)
302{
303 int i = 0, j;
304 struct rb_node *nd, *pn = NULL;
305 unsigned long prev = 0, pend = 0;
306
307 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
308 struct vm_area_struct *vma;
309 vma = rb_entry(nd, struct vm_area_struct, vm_rb);
310 if (vma->vm_start < prev)
311 printk("vm_start %lx prev %lx\n", vma->vm_start, prev), i = -1;
312 if (vma->vm_start < pend)
313 printk("vm_start %lx pend %lx\n", vma->vm_start, pend);
314 if (vma->vm_start > vma->vm_end)
315 printk("vm_end %lx < vm_start %lx\n", vma->vm_end, vma->vm_start);
316 i++;
317 pn = nd;
David Millerd1af65d2007-02-28 20:13:13 -0800318 prev = vma->vm_start;
319 pend = vma->vm_end;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700320 }
321 j = 0;
322 for (nd = pn; nd; nd = rb_prev(nd)) {
323 j++;
324 }
325 if (i != j)
326 printk("backwards %d, forwards %d\n", j, i), i = 0;
327 return i;
328}
329
330void validate_mm(struct mm_struct *mm)
331{
332 int bug = 0;
333 int i = 0;
334 struct vm_area_struct *tmp = mm->mmap;
335 while (tmp) {
336 tmp = tmp->vm_next;
337 i++;
338 }
339 if (i != mm->map_count)
340 printk("map_count %d vm_next %d\n", mm->map_count, i), bug = 1;
341 i = browse_rb(&mm->mm_rb);
342 if (i != mm->map_count)
343 printk("map_count %d rb %d\n", mm->map_count, i), bug = 1;
Eric Sesterhenn46a350e2006-04-01 01:23:29 +0200344 BUG_ON(bug);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700345}
346#else
347#define validate_mm(mm) do { } while (0)
348#endif
349
350static struct vm_area_struct *
351find_vma_prepare(struct mm_struct *mm, unsigned long addr,
352 struct vm_area_struct **pprev, struct rb_node ***rb_link,
353 struct rb_node ** rb_parent)
354{
355 struct vm_area_struct * vma;
356 struct rb_node ** __rb_link, * __rb_parent, * rb_prev;
357
358 __rb_link = &mm->mm_rb.rb_node;
359 rb_prev = __rb_parent = NULL;
360 vma = NULL;
361
362 while (*__rb_link) {
363 struct vm_area_struct *vma_tmp;
364
365 __rb_parent = *__rb_link;
366 vma_tmp = rb_entry(__rb_parent, struct vm_area_struct, vm_rb);
367
368 if (vma_tmp->vm_end > addr) {
369 vma = vma_tmp;
370 if (vma_tmp->vm_start <= addr)
Benny Halevydfe195f2008-08-05 13:01:41 -0700371 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700372 __rb_link = &__rb_parent->rb_left;
373 } else {
374 rb_prev = __rb_parent;
375 __rb_link = &__rb_parent->rb_right;
376 }
377 }
378
379 *pprev = NULL;
380 if (rb_prev)
381 *pprev = rb_entry(rb_prev, struct vm_area_struct, vm_rb);
382 *rb_link = __rb_link;
383 *rb_parent = __rb_parent;
384 return vma;
385}
386
387static inline void
388__vma_link_list(struct mm_struct *mm, struct vm_area_struct *vma,
389 struct vm_area_struct *prev, struct rb_node *rb_parent)
390{
391 if (prev) {
392 vma->vm_next = prev->vm_next;
393 prev->vm_next = vma;
394 } else {
395 mm->mmap = vma;
396 if (rb_parent)
397 vma->vm_next = rb_entry(rb_parent,
398 struct vm_area_struct, vm_rb);
399 else
400 vma->vm_next = NULL;
401 }
402}
403
404void __vma_link_rb(struct mm_struct *mm, struct vm_area_struct *vma,
405 struct rb_node **rb_link, struct rb_node *rb_parent)
406{
407 rb_link_node(&vma->vm_rb, rb_parent, rb_link);
408 rb_insert_color(&vma->vm_rb, &mm->mm_rb);
409}
410
Denys Vlasenkocb8f4882008-10-18 20:27:01 -0700411static void __vma_link_file(struct vm_area_struct *vma)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700412{
ZhenwenXu48aae422009-01-06 14:40:21 -0800413 struct file *file;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700414
415 file = vma->vm_file;
416 if (file) {
417 struct address_space *mapping = file->f_mapping;
418
419 if (vma->vm_flags & VM_DENYWRITE)
Josef "Jeff" Sipekd3ac7f82006-12-08 02:36:44 -0800420 atomic_dec(&file->f_path.dentry->d_inode->i_writecount);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700421 if (vma->vm_flags & VM_SHARED)
422 mapping->i_mmap_writable++;
423
424 flush_dcache_mmap_lock(mapping);
425 if (unlikely(vma->vm_flags & VM_NONLINEAR))
426 vma_nonlinear_insert(vma, &mapping->i_mmap_nonlinear);
427 else
428 vma_prio_tree_insert(vma, &mapping->i_mmap);
429 flush_dcache_mmap_unlock(mapping);
430 }
431}
432
433static void
434__vma_link(struct mm_struct *mm, struct vm_area_struct *vma,
435 struct vm_area_struct *prev, struct rb_node **rb_link,
436 struct rb_node *rb_parent)
437{
438 __vma_link_list(mm, vma, prev, rb_parent);
439 __vma_link_rb(mm, vma, rb_link, rb_parent);
440 __anon_vma_link(vma);
441}
442
443static void vma_link(struct mm_struct *mm, struct vm_area_struct *vma,
444 struct vm_area_struct *prev, struct rb_node **rb_link,
445 struct rb_node *rb_parent)
446{
447 struct address_space *mapping = NULL;
448
449 if (vma->vm_file)
450 mapping = vma->vm_file->f_mapping;
451
452 if (mapping) {
453 spin_lock(&mapping->i_mmap_lock);
454 vma->vm_truncate_count = mapping->truncate_count;
455 }
456 anon_vma_lock(vma);
457
458 __vma_link(mm, vma, prev, rb_link, rb_parent);
459 __vma_link_file(vma);
460
461 anon_vma_unlock(vma);
462 if (mapping)
463 spin_unlock(&mapping->i_mmap_lock);
464
465 mm->map_count++;
466 validate_mm(mm);
467}
468
469/*
470 * Helper for vma_adjust in the split_vma insert case:
471 * insert vm structure into list and rbtree and anon_vma,
472 * but it has already been inserted into prio_tree earlier.
473 */
ZhenwenXu48aae422009-01-06 14:40:21 -0800474static void __insert_vm_struct(struct mm_struct *mm, struct vm_area_struct *vma)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700475{
ZhenwenXu48aae422009-01-06 14:40:21 -0800476 struct vm_area_struct *__vma, *prev;
477 struct rb_node **rb_link, *rb_parent;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700478
479 __vma = find_vma_prepare(mm, vma->vm_start,&prev, &rb_link, &rb_parent);
Eric Sesterhenn46a350e2006-04-01 01:23:29 +0200480 BUG_ON(__vma && __vma->vm_start < vma->vm_end);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700481 __vma_link(mm, vma, prev, rb_link, rb_parent);
482 mm->map_count++;
483}
484
485static inline void
486__vma_unlink(struct mm_struct *mm, struct vm_area_struct *vma,
487 struct vm_area_struct *prev)
488{
489 prev->vm_next = vma->vm_next;
490 rb_erase(&vma->vm_rb, &mm->mm_rb);
491 if (mm->mmap_cache == vma)
492 mm->mmap_cache = prev;
493}
494
495/*
496 * We cannot adjust vm_start, vm_end, vm_pgoff fields of a vma that
497 * is already present in an i_mmap tree without adjusting the tree.
498 * The following helper function should be used when such adjustments
499 * are necessary. The "insert" vma (if any) is to be inserted
500 * before we drop the necessary locks.
501 */
502void vma_adjust(struct vm_area_struct *vma, unsigned long start,
503 unsigned long end, pgoff_t pgoff, struct vm_area_struct *insert)
504{
505 struct mm_struct *mm = vma->vm_mm;
506 struct vm_area_struct *next = vma->vm_next;
507 struct vm_area_struct *importer = NULL;
508 struct address_space *mapping = NULL;
509 struct prio_tree_root *root = NULL;
510 struct file *file = vma->vm_file;
511 struct anon_vma *anon_vma = NULL;
512 long adjust_next = 0;
513 int remove_next = 0;
514
515 if (next && !insert) {
516 if (end >= next->vm_end) {
517 /*
518 * vma expands, overlapping all the next, and
519 * perhaps the one after too (mprotect case 6).
520 */
521again: remove_next = 1 + (end > next->vm_end);
522 end = next->vm_end;
523 anon_vma = next->anon_vma;
524 importer = vma;
525 } else if (end > next->vm_start) {
526 /*
527 * vma expands, overlapping part of the next:
528 * mprotect case 5 shifting the boundary up.
529 */
530 adjust_next = (end - next->vm_start) >> PAGE_SHIFT;
531 anon_vma = next->anon_vma;
532 importer = vma;
533 } else if (end < vma->vm_end) {
534 /*
535 * vma shrinks, and !insert tells it's not
536 * split_vma inserting another: so it must be
537 * mprotect case 4 shifting the boundary down.
538 */
539 adjust_next = - ((vma->vm_end - end) >> PAGE_SHIFT);
540 anon_vma = next->anon_vma;
541 importer = next;
542 }
543 }
544
545 if (file) {
546 mapping = file->f_mapping;
547 if (!(vma->vm_flags & VM_NONLINEAR))
548 root = &mapping->i_mmap;
549 spin_lock(&mapping->i_mmap_lock);
550 if (importer &&
551 vma->vm_truncate_count != next->vm_truncate_count) {
552 /*
553 * unmap_mapping_range might be in progress:
554 * ensure that the expanding vma is rescanned.
555 */
556 importer->vm_truncate_count = 0;
557 }
558 if (insert) {
559 insert->vm_truncate_count = vma->vm_truncate_count;
560 /*
561 * Put into prio_tree now, so instantiated pages
562 * are visible to arm/parisc __flush_dcache_page
563 * throughout; but we cannot insert into address
564 * space until vma start or end is updated.
565 */
566 __vma_link_file(insert);
567 }
568 }
569
570 /*
571 * When changing only vma->vm_end, we don't really need
Lee Schermerhorn252c5f92009-09-21 17:03:40 -0700572 * anon_vma lock.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700573 */
Lee Schermerhorn252c5f92009-09-21 17:03:40 -0700574 if (vma->anon_vma && (insert || importer || start != vma->vm_start))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700575 anon_vma = vma->anon_vma;
576 if (anon_vma) {
577 spin_lock(&anon_vma->lock);
578 /*
579 * Easily overlooked: when mprotect shifts the boundary,
580 * make sure the expanding vma has anon_vma set if the
581 * shrinking vma had, to cover any anon pages imported.
582 */
583 if (importer && !importer->anon_vma) {
584 importer->anon_vma = anon_vma;
585 __anon_vma_link(importer);
586 }
587 }
588
589 if (root) {
590 flush_dcache_mmap_lock(mapping);
591 vma_prio_tree_remove(vma, root);
592 if (adjust_next)
593 vma_prio_tree_remove(next, root);
594 }
595
596 vma->vm_start = start;
597 vma->vm_end = end;
598 vma->vm_pgoff = pgoff;
599 if (adjust_next) {
600 next->vm_start += adjust_next << PAGE_SHIFT;
601 next->vm_pgoff += adjust_next;
602 }
603
604 if (root) {
605 if (adjust_next)
606 vma_prio_tree_insert(next, root);
607 vma_prio_tree_insert(vma, root);
608 flush_dcache_mmap_unlock(mapping);
609 }
610
611 if (remove_next) {
612 /*
613 * vma_merge has merged next into vma, and needs
614 * us to remove next before dropping the locks.
615 */
616 __vma_unlink(mm, next, vma);
617 if (file)
618 __remove_shared_vm_struct(next, file, mapping);
619 if (next->anon_vma)
620 __anon_vma_merge(vma, next);
621 } else if (insert) {
622 /*
623 * split_vma has split insert from vma, and needs
624 * us to insert it before dropping the locks
625 * (it may either follow vma or precede it).
626 */
627 __insert_vm_struct(mm, insert);
628 }
629
630 if (anon_vma)
631 spin_unlock(&anon_vma->lock);
632 if (mapping)
633 spin_unlock(&mapping->i_mmap_lock);
634
635 if (remove_next) {
Matt Helsley925d1c42008-04-29 01:01:36 -0700636 if (file) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700637 fput(file);
Matt Helsley925d1c42008-04-29 01:01:36 -0700638 if (next->vm_flags & VM_EXECUTABLE)
639 removed_exe_file_vma(mm);
640 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700641 mm->map_count--;
Lee Schermerhornf0be3d32008-04-28 02:13:08 -0700642 mpol_put(vma_policy(next));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700643 kmem_cache_free(vm_area_cachep, next);
644 /*
645 * In mprotect's case 6 (see comments on vma_merge),
646 * we must remove another next too. It would clutter
647 * up the code too much to do both in one go.
648 */
649 if (remove_next == 2) {
650 next = vma->vm_next;
651 goto again;
652 }
653 }
654
655 validate_mm(mm);
656}
657
658/*
659 * If the vma has a ->close operation then the driver probably needs to release
660 * per-vma resources, so we don't attempt to merge those.
661 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700662static inline int is_mergeable_vma(struct vm_area_struct *vma,
663 struct file *file, unsigned long vm_flags)
664{
Hugh Dickins8314c4f2009-09-21 17:02:25 -0700665 /* VM_CAN_NONLINEAR may get set later by f_op->mmap() */
666 if ((vma->vm_flags ^ vm_flags) & ~VM_CAN_NONLINEAR)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700667 return 0;
668 if (vma->vm_file != file)
669 return 0;
670 if (vma->vm_ops && vma->vm_ops->close)
671 return 0;
672 return 1;
673}
674
675static inline int is_mergeable_anon_vma(struct anon_vma *anon_vma1,
676 struct anon_vma *anon_vma2)
677{
678 return !anon_vma1 || !anon_vma2 || (anon_vma1 == anon_vma2);
679}
680
681/*
682 * Return true if we can merge this (vm_flags,anon_vma,file,vm_pgoff)
683 * in front of (at a lower virtual address and file offset than) the vma.
684 *
685 * We cannot merge two vmas if they have differently assigned (non-NULL)
686 * anon_vmas, nor if same anon_vma is assigned but offsets incompatible.
687 *
688 * We don't check here for the merged mmap wrapping around the end of pagecache
689 * indices (16TB on ia32) because do_mmap_pgoff() does not permit mmap's which
690 * wrap, nor mmaps which cover the final page at index -1UL.
691 */
692static int
693can_vma_merge_before(struct vm_area_struct *vma, unsigned long vm_flags,
694 struct anon_vma *anon_vma, struct file *file, pgoff_t vm_pgoff)
695{
696 if (is_mergeable_vma(vma, file, vm_flags) &&
697 is_mergeable_anon_vma(anon_vma, vma->anon_vma)) {
698 if (vma->vm_pgoff == vm_pgoff)
699 return 1;
700 }
701 return 0;
702}
703
704/*
705 * Return true if we can merge this (vm_flags,anon_vma,file,vm_pgoff)
706 * beyond (at a higher virtual address and file offset than) the vma.
707 *
708 * We cannot merge two vmas if they have differently assigned (non-NULL)
709 * anon_vmas, nor if same anon_vma is assigned but offsets incompatible.
710 */
711static int
712can_vma_merge_after(struct vm_area_struct *vma, unsigned long vm_flags,
713 struct anon_vma *anon_vma, struct file *file, pgoff_t vm_pgoff)
714{
715 if (is_mergeable_vma(vma, file, vm_flags) &&
716 is_mergeable_anon_vma(anon_vma, vma->anon_vma)) {
717 pgoff_t vm_pglen;
718 vm_pglen = (vma->vm_end - vma->vm_start) >> PAGE_SHIFT;
719 if (vma->vm_pgoff + vm_pglen == vm_pgoff)
720 return 1;
721 }
722 return 0;
723}
724
725/*
726 * Given a mapping request (addr,end,vm_flags,file,pgoff), figure out
727 * whether that can be merged with its predecessor or its successor.
728 * Or both (it neatly fills a hole).
729 *
730 * In most cases - when called for mmap, brk or mremap - [addr,end) is
731 * certain not to be mapped by the time vma_merge is called; but when
732 * called for mprotect, it is certain to be already mapped (either at
733 * an offset within prev, or at the start of next), and the flags of
734 * this area are about to be changed to vm_flags - and the no-change
735 * case has already been eliminated.
736 *
737 * The following mprotect cases have to be considered, where AAAA is
738 * the area passed down from mprotect_fixup, never extending beyond one
739 * vma, PPPPPP is the prev vma specified, and NNNNNN the next vma after:
740 *
741 * AAAA AAAA AAAA AAAA
742 * PPPPPPNNNNNN PPPPPPNNNNNN PPPPPPNNNNNN PPPPNNNNXXXX
743 * cannot merge might become might become might become
744 * PPNNNNNNNNNN PPPPPPPPPPNN PPPPPPPPPPPP 6 or
745 * mmap, brk or case 4 below case 5 below PPPPPPPPXXXX 7 or
746 * mremap move: PPPPNNNNNNNN 8
747 * AAAA
748 * PPPP NNNN PPPPPPPPPPPP PPPPPPPPNNNN PPPPNNNNNNNN
749 * might become case 1 below case 2 below case 3 below
750 *
751 * Odd one out? Case 8, because it extends NNNN but needs flags of XXXX:
752 * mprotect_fixup updates vm_flags & vm_page_prot on successful return.
753 */
754struct vm_area_struct *vma_merge(struct mm_struct *mm,
755 struct vm_area_struct *prev, unsigned long addr,
756 unsigned long end, unsigned long vm_flags,
757 struct anon_vma *anon_vma, struct file *file,
758 pgoff_t pgoff, struct mempolicy *policy)
759{
760 pgoff_t pglen = (end - addr) >> PAGE_SHIFT;
761 struct vm_area_struct *area, *next;
762
763 /*
764 * We later require that vma->vm_flags == vm_flags,
765 * so this tests vma->vm_flags & VM_SPECIAL, too.
766 */
767 if (vm_flags & VM_SPECIAL)
768 return NULL;
769
770 if (prev)
771 next = prev->vm_next;
772 else
773 next = mm->mmap;
774 area = next;
775 if (next && next->vm_end == end) /* cases 6, 7, 8 */
776 next = next->vm_next;
777
778 /*
779 * Can it merge with the predecessor?
780 */
781 if (prev && prev->vm_end == addr &&
782 mpol_equal(vma_policy(prev), policy) &&
783 can_vma_merge_after(prev, vm_flags,
784 anon_vma, file, pgoff)) {
785 /*
786 * OK, it can. Can we now merge in the successor as well?
787 */
788 if (next && end == next->vm_start &&
789 mpol_equal(policy, vma_policy(next)) &&
790 can_vma_merge_before(next, vm_flags,
791 anon_vma, file, pgoff+pglen) &&
792 is_mergeable_anon_vma(prev->anon_vma,
793 next->anon_vma)) {
794 /* cases 1, 6 */
795 vma_adjust(prev, prev->vm_start,
796 next->vm_end, prev->vm_pgoff, NULL);
797 } else /* cases 2, 5, 7 */
798 vma_adjust(prev, prev->vm_start,
799 end, prev->vm_pgoff, NULL);
800 return prev;
801 }
802
803 /*
804 * Can this new request be merged in front of next?
805 */
806 if (next && end == next->vm_start &&
807 mpol_equal(policy, vma_policy(next)) &&
808 can_vma_merge_before(next, vm_flags,
809 anon_vma, file, pgoff+pglen)) {
810 if (prev && addr < prev->vm_end) /* case 4 */
811 vma_adjust(prev, prev->vm_start,
812 addr, prev->vm_pgoff, NULL);
813 else /* cases 3, 8 */
814 vma_adjust(area, addr, next->vm_end,
815 next->vm_pgoff - pglen, NULL);
816 return area;
817 }
818
819 return NULL;
820}
821
822/*
823 * find_mergeable_anon_vma is used by anon_vma_prepare, to check
824 * neighbouring vmas for a suitable anon_vma, before it goes off
825 * to allocate a new anon_vma. It checks because a repetitive
826 * sequence of mprotects and faults may otherwise lead to distinct
827 * anon_vmas being allocated, preventing vma merge in subsequent
828 * mprotect.
829 */
830struct anon_vma *find_mergeable_anon_vma(struct vm_area_struct *vma)
831{
832 struct vm_area_struct *near;
833 unsigned long vm_flags;
834
835 near = vma->vm_next;
836 if (!near)
837 goto try_prev;
838
839 /*
840 * Since only mprotect tries to remerge vmas, match flags
841 * which might be mprotected into each other later on.
842 * Neither mlock nor madvise tries to remerge at present,
843 * so leave their flags as obstructing a merge.
844 */
845 vm_flags = vma->vm_flags & ~(VM_READ|VM_WRITE|VM_EXEC);
846 vm_flags |= near->vm_flags & (VM_READ|VM_WRITE|VM_EXEC);
847
848 if (near->anon_vma && vma->vm_end == near->vm_start &&
849 mpol_equal(vma_policy(vma), vma_policy(near)) &&
850 can_vma_merge_before(near, vm_flags,
851 NULL, vma->vm_file, vma->vm_pgoff +
852 ((vma->vm_end - vma->vm_start) >> PAGE_SHIFT)))
853 return near->anon_vma;
854try_prev:
855 /*
856 * It is potentially slow to have to call find_vma_prev here.
857 * But it's only on the first write fault on the vma, not
858 * every time, and we could devise a way to avoid it later
859 * (e.g. stash info in next's anon_vma_node when assigning
860 * an anon_vma, or when trying vma_merge). Another time.
861 */
Eric Sesterhenn46a350e2006-04-01 01:23:29 +0200862 BUG_ON(find_vma_prev(vma->vm_mm, vma->vm_start, &near) != vma);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700863 if (!near)
864 goto none;
865
866 vm_flags = vma->vm_flags & ~(VM_READ|VM_WRITE|VM_EXEC);
867 vm_flags |= near->vm_flags & (VM_READ|VM_WRITE|VM_EXEC);
868
869 if (near->anon_vma && near->vm_end == vma->vm_start &&
870 mpol_equal(vma_policy(near), vma_policy(vma)) &&
871 can_vma_merge_after(near, vm_flags,
872 NULL, vma->vm_file, vma->vm_pgoff))
873 return near->anon_vma;
874none:
875 /*
876 * There's no absolute need to look only at touching neighbours:
877 * we could search further afield for "compatible" anon_vmas.
878 * But it would probably just be a waste of time searching,
879 * or lead to too many vmas hanging off the same anon_vma.
880 * We're trying to allow mprotect remerging later on,
881 * not trying to minimize memory used for anon_vmas.
882 */
883 return NULL;
884}
885
886#ifdef CONFIG_PROC_FS
Hugh Dickinsab50b8e2005-10-29 18:15:56 -0700887void vm_stat_account(struct mm_struct *mm, unsigned long flags,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700888 struct file *file, long pages)
889{
890 const unsigned long stack_flags
891 = VM_STACK_FLAGS & (VM_GROWSUP|VM_GROWSDOWN);
892
Linus Torvalds1da177e2005-04-16 15:20:36 -0700893 if (file) {
894 mm->shared_vm += pages;
895 if ((flags & (VM_EXEC|VM_WRITE)) == VM_EXEC)
896 mm->exec_vm += pages;
897 } else if (flags & stack_flags)
898 mm->stack_vm += pages;
899 if (flags & (VM_RESERVED|VM_IO))
900 mm->reserved_vm += pages;
901}
902#endif /* CONFIG_PROC_FS */
903
904/*
Jianjun Kong27f5de72009-09-17 19:26:26 -0700905 * The caller must hold down_write(&current->mm->mmap_sem).
Linus Torvalds1da177e2005-04-16 15:20:36 -0700906 */
907
ZhenwenXu48aae422009-01-06 14:40:21 -0800908unsigned long do_mmap_pgoff(struct file *file, unsigned long addr,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700909 unsigned long len, unsigned long prot,
910 unsigned long flags, unsigned long pgoff)
911{
912 struct mm_struct * mm = current->mm;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700913 struct inode *inode;
914 unsigned int vm_flags;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700915 int error;
Miklos Szeredi0165ab42007-07-15 23:38:26 -0700916 unsigned long reqprot = prot;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700917
Linus Torvalds1da177e2005-04-16 15:20:36 -0700918 /*
919 * Does the application expect PROT_READ to imply PROT_EXEC?
920 *
921 * (the exception is when the underlying filesystem is noexec
922 * mounted, in which case we dont add PROT_EXEC.)
923 */
924 if ((prot & PROT_READ) && (current->personality & READ_IMPLIES_EXEC))
Josef "Jeff" Sipekd3ac7f82006-12-08 02:36:44 -0800925 if (!(file && (file->f_path.mnt->mnt_flags & MNT_NOEXEC)))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700926 prot |= PROT_EXEC;
927
928 if (!len)
929 return -EINVAL;
930
Eric Paris7cd94142007-11-26 18:47:40 -0500931 if (!(flags & MAP_FIXED))
932 addr = round_hint_to_min(addr);
933
Kirill Korotaev3a459752006-09-07 14:17:04 +0400934 error = arch_mmap_check(addr, len, flags);
935 if (error)
936 return error;
937
Linus Torvalds1da177e2005-04-16 15:20:36 -0700938 /* Careful about overflows.. */
939 len = PAGE_ALIGN(len);
940 if (!len || len > TASK_SIZE)
941 return -ENOMEM;
942
943 /* offset overflow? */
944 if ((pgoff + (len >> PAGE_SHIFT)) < pgoff)
945 return -EOVERFLOW;
946
947 /* Too many mappings? */
948 if (mm->map_count > sysctl_max_map_count)
949 return -ENOMEM;
950
Eric B Munson4e527802009-09-21 17:03:47 -0700951 if (flags & MAP_HUGETLB) {
952 struct user_struct *user = NULL;
953 if (file)
954 return -EINVAL;
955
956 /*
957 * VM_NORESERVE is used because the reservations will be
958 * taken when vm_ops->mmap() is called
959 * A dummy user value is used because we are not locking
960 * memory so no accounting is necessary
961 */
962 len = ALIGN(len, huge_page_size(&default_hstate));
963 file = hugetlb_file_setup(HUGETLB_ANON_FILE, len, VM_NORESERVE,
964 &user, HUGETLB_ANONHUGE_INODE);
965 if (IS_ERR(file))
966 return PTR_ERR(file);
967 }
968
Linus Torvalds1da177e2005-04-16 15:20:36 -0700969 /* Obtain the address to map to. we verify (or select) it and ensure
970 * that it represents a valid section of the address space.
971 */
972 addr = get_unmapped_area(file, addr, len, pgoff, flags);
973 if (addr & ~PAGE_MASK)
974 return addr;
975
976 /* Do simple checking here so the lower-level routines won't have
977 * to. we assume access permissions have been handled by the open
978 * of the memory object, so we don't do any here.
979 */
980 vm_flags = calc_vm_prot_bits(prot) | calc_vm_flag_bits(flags) |
981 mm->def_flags | VM_MAYREAD | VM_MAYWRITE | VM_MAYEXEC;
982
Huang Shijiecdf7b342009-09-21 17:03:36 -0700983 if (flags & MAP_LOCKED)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700984 if (!can_do_mlock())
985 return -EPERM;
Rik van Rielba470de2008-10-18 20:26:50 -0700986
Linus Torvalds1da177e2005-04-16 15:20:36 -0700987 /* mlock MCL_FUTURE? */
988 if (vm_flags & VM_LOCKED) {
989 unsigned long locked, lock_limit;
Chris Wright93ea1d02005-05-01 08:58:38 -0700990 locked = len >> PAGE_SHIFT;
991 locked += mm->locked_vm;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700992 lock_limit = current->signal->rlim[RLIMIT_MEMLOCK].rlim_cur;
Chris Wright93ea1d02005-05-01 08:58:38 -0700993 lock_limit >>= PAGE_SHIFT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700994 if (locked > lock_limit && !capable(CAP_IPC_LOCK))
995 return -EAGAIN;
996 }
997
Josef "Jeff" Sipekd3ac7f82006-12-08 02:36:44 -0800998 inode = file ? file->f_path.dentry->d_inode : NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700999
1000 if (file) {
1001 switch (flags & MAP_TYPE) {
1002 case MAP_SHARED:
1003 if ((prot&PROT_WRITE) && !(file->f_mode&FMODE_WRITE))
1004 return -EACCES;
1005
1006 /*
1007 * Make sure we don't allow writing to an append-only
1008 * file..
1009 */
1010 if (IS_APPEND(inode) && (file->f_mode & FMODE_WRITE))
1011 return -EACCES;
1012
1013 /*
1014 * Make sure there are no mandatory locks on the file.
1015 */
1016 if (locks_verify_locked(inode))
1017 return -EAGAIN;
1018
1019 vm_flags |= VM_SHARED | VM_MAYSHARE;
1020 if (!(file->f_mode & FMODE_WRITE))
1021 vm_flags &= ~(VM_MAYWRITE | VM_SHARED);
1022
1023 /* fall through */
1024 case MAP_PRIVATE:
1025 if (!(file->f_mode & FMODE_READ))
1026 return -EACCES;
Josef "Jeff" Sipekd3ac7f82006-12-08 02:36:44 -08001027 if (file->f_path.mnt->mnt_flags & MNT_NOEXEC) {
Linus Torvalds80c56062006-10-15 14:09:55 -07001028 if (vm_flags & VM_EXEC)
1029 return -EPERM;
1030 vm_flags &= ~VM_MAYEXEC;
1031 }
Linus Torvalds80c56062006-10-15 14:09:55 -07001032
1033 if (!file->f_op || !file->f_op->mmap)
1034 return -ENODEV;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001035 break;
1036
1037 default:
1038 return -EINVAL;
1039 }
1040 } else {
1041 switch (flags & MAP_TYPE) {
1042 case MAP_SHARED:
Tejun Heoce363942008-09-03 16:09:47 +02001043 /*
1044 * Ignore pgoff.
1045 */
1046 pgoff = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001047 vm_flags |= VM_SHARED | VM_MAYSHARE;
1048 break;
1049 case MAP_PRIVATE:
1050 /*
1051 * Set pgoff according to addr for anon_vma.
1052 */
1053 pgoff = addr >> PAGE_SHIFT;
1054 break;
1055 default:
1056 return -EINVAL;
1057 }
1058 }
1059
Eric Parised032182007-06-28 15:55:21 -04001060 error = security_file_mmap(file, reqprot, prot, flags, addr, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001061 if (error)
1062 return error;
Eric Parised032182007-06-28 15:55:21 -04001063
Mel Gorman5a6fe122009-02-10 14:02:27 +00001064 return mmap_region(file, addr, len, flags, vm_flags, pgoff);
Miklos Szeredi0165ab42007-07-15 23:38:26 -07001065}
1066EXPORT_SYMBOL(do_mmap_pgoff);
1067
Alexey Dobriyan4e950f62007-07-30 02:36:13 +04001068/*
1069 * Some shared mappigns will want the pages marked read-only
1070 * to track write events. If so, we'll downgrade vm_page_prot
1071 * to the private version (using protection_map[] without the
1072 * VM_SHARED bit).
1073 */
1074int vma_wants_writenotify(struct vm_area_struct *vma)
1075{
1076 unsigned int vm_flags = vma->vm_flags;
1077
1078 /* If it was private or non-writable, the write bit is already clear */
1079 if ((vm_flags & (VM_WRITE|VM_SHARED)) != ((VM_WRITE|VM_SHARED)))
1080 return 0;
1081
1082 /* The backer wishes to know when pages are first written to? */
1083 if (vma->vm_ops && vma->vm_ops->page_mkwrite)
1084 return 1;
1085
1086 /* The open routine did something to the protections already? */
1087 if (pgprot_val(vma->vm_page_prot) !=
Coly Li3ed75eb2007-10-18 23:39:15 -07001088 pgprot_val(vm_get_page_prot(vm_flags)))
Alexey Dobriyan4e950f62007-07-30 02:36:13 +04001089 return 0;
1090
1091 /* Specialty mapping? */
1092 if (vm_flags & (VM_PFNMAP|VM_INSERTPAGE))
1093 return 0;
1094
1095 /* Can the mapping track the dirty pages? */
1096 return vma->vm_file && vma->vm_file->f_mapping &&
1097 mapping_cap_account_dirty(vma->vm_file->f_mapping);
1098}
1099
Linus Torvaldsfc8744a2009-01-31 15:08:56 -08001100/*
1101 * We account for memory if it's a private writeable mapping,
Mel Gorman5a6fe122009-02-10 14:02:27 +00001102 * not hugepages and VM_NORESERVE wasn't set.
Linus Torvaldsfc8744a2009-01-31 15:08:56 -08001103 */
Mel Gorman5a6fe122009-02-10 14:02:27 +00001104static inline int accountable_mapping(struct file *file, unsigned int vm_flags)
Linus Torvaldsfc8744a2009-01-31 15:08:56 -08001105{
Mel Gorman5a6fe122009-02-10 14:02:27 +00001106 /*
1107 * hugetlb has its own accounting separate from the core VM
1108 * VM_HUGETLB may not be set yet so we cannot check for that flag.
1109 */
1110 if (file && is_file_hugepages(file))
1111 return 0;
1112
Linus Torvaldsfc8744a2009-01-31 15:08:56 -08001113 return (vm_flags & (VM_NORESERVE | VM_SHARED | VM_WRITE)) == VM_WRITE;
1114}
1115
Miklos Szeredi0165ab42007-07-15 23:38:26 -07001116unsigned long mmap_region(struct file *file, unsigned long addr,
1117 unsigned long len, unsigned long flags,
Mel Gorman5a6fe122009-02-10 14:02:27 +00001118 unsigned int vm_flags, unsigned long pgoff)
Miklos Szeredi0165ab42007-07-15 23:38:26 -07001119{
1120 struct mm_struct *mm = current->mm;
1121 struct vm_area_struct *vma, *prev;
1122 int correct_wcount = 0;
1123 int error;
1124 struct rb_node **rb_link, *rb_parent;
1125 unsigned long charged = 0;
1126 struct inode *inode = file ? file->f_path.dentry->d_inode : NULL;
1127
Linus Torvalds1da177e2005-04-16 15:20:36 -07001128 /* Clear old maps */
1129 error = -ENOMEM;
1130munmap_back:
1131 vma = find_vma_prepare(mm, addr, &prev, &rb_link, &rb_parent);
1132 if (vma && vma->vm_start < addr + len) {
1133 if (do_munmap(mm, addr, len))
1134 return -ENOMEM;
1135 goto munmap_back;
1136 }
1137
1138 /* Check against address space limit. */
akpm@osdl.org119f6572005-05-01 08:58:35 -07001139 if (!may_expand_vm(mm, len >> PAGE_SHIFT))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001140 return -ENOMEM;
1141
Linus Torvaldsfc8744a2009-01-31 15:08:56 -08001142 /*
1143 * Set 'VM_NORESERVE' if we should not account for the
Mel Gorman5a6fe122009-02-10 14:02:27 +00001144 * memory use of this mapping.
Linus Torvaldsfc8744a2009-01-31 15:08:56 -08001145 */
Mel Gorman5a6fe122009-02-10 14:02:27 +00001146 if ((flags & MAP_NORESERVE)) {
1147 /* We honor MAP_NORESERVE if allowed to overcommit */
1148 if (sysctl_overcommit_memory != OVERCOMMIT_NEVER)
1149 vm_flags |= VM_NORESERVE;
1150
1151 /* hugetlb applies strict overcommit unless MAP_NORESERVE */
1152 if (file && is_file_hugepages(file))
1153 vm_flags |= VM_NORESERVE;
1154 }
Andy Whitcroftcdfd4322008-07-23 21:27:28 -07001155
Linus Torvaldsfc8744a2009-01-31 15:08:56 -08001156 /*
1157 * Private writable mapping: check memory availability
1158 */
Mel Gorman5a6fe122009-02-10 14:02:27 +00001159 if (accountable_mapping(file, vm_flags)) {
Linus Torvaldsfc8744a2009-01-31 15:08:56 -08001160 charged = len >> PAGE_SHIFT;
1161 if (security_vm_enough_memory(charged))
1162 return -ENOMEM;
1163 vm_flags |= VM_ACCOUNT;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001164 }
1165
1166 /*
Linus Torvaldsde33c8d2009-01-29 17:46:42 -08001167 * Can we just expand an old mapping?
Linus Torvalds1da177e2005-04-16 15:20:36 -07001168 */
Linus Torvaldsde33c8d2009-01-29 17:46:42 -08001169 vma = vma_merge(mm, prev, addr, addr + len, vm_flags, NULL, file, pgoff, NULL);
1170 if (vma)
1171 goto out;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001172
1173 /*
1174 * Determine the object being mapped and call the appropriate
1175 * specific mapper. the address has already been validated, but
1176 * not unmapped, but the maps are removed from the list.
1177 */
Pekka Enbergc5e3b832006-03-25 03:06:43 -08001178 vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001179 if (!vma) {
1180 error = -ENOMEM;
1181 goto unacct_error;
1182 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001183
1184 vma->vm_mm = mm;
1185 vma->vm_start = addr;
1186 vma->vm_end = addr + len;
1187 vma->vm_flags = vm_flags;
Coly Li3ed75eb2007-10-18 23:39:15 -07001188 vma->vm_page_prot = vm_get_page_prot(vm_flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001189 vma->vm_pgoff = pgoff;
1190
1191 if (file) {
1192 error = -EINVAL;
1193 if (vm_flags & (VM_GROWSDOWN|VM_GROWSUP))
1194 goto free_vma;
1195 if (vm_flags & VM_DENYWRITE) {
1196 error = deny_write_access(file);
1197 if (error)
1198 goto free_vma;
1199 correct_wcount = 1;
1200 }
1201 vma->vm_file = file;
1202 get_file(file);
1203 error = file->f_op->mmap(file, vma);
1204 if (error)
1205 goto unmap_and_free_vma;
Matt Helsley925d1c42008-04-29 01:01:36 -07001206 if (vm_flags & VM_EXECUTABLE)
1207 added_exe_file_vma(mm);
Huang Shijief8dbf0a72009-09-21 17:03:41 -07001208
1209 /* Can addr have changed??
1210 *
1211 * Answer: Yes, several device drivers can do it in their
1212 * f_op->mmap method. -DaveM
1213 */
1214 addr = vma->vm_start;
1215 pgoff = vma->vm_pgoff;
1216 vm_flags = vma->vm_flags;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001217 } else if (vm_flags & VM_SHARED) {
1218 error = shmem_zero_setup(vma);
1219 if (error)
1220 goto free_vma;
1221 }
1222
Peter Zijlstrad08b3852006-09-25 23:30:57 -07001223 if (vma_wants_writenotify(vma))
Hugh Dickins1ddd4392007-10-22 20:45:12 -07001224 vma->vm_page_prot = vm_get_page_prot(vm_flags & ~VM_SHARED);
Peter Zijlstrad08b3852006-09-25 23:30:57 -07001225
Linus Torvaldsde33c8d2009-01-29 17:46:42 -08001226 vma_link(mm, vma, prev, rb_link, rb_parent);
1227 file = vma->vm_file;
Oleg Nesterov4d3d5b42008-04-28 02:12:10 -07001228
1229 /* Once vma denies write, undo our temporary denial count */
1230 if (correct_wcount)
1231 atomic_inc(&inode->i_writecount);
1232out:
Ingo Molnarcdd6c482009-09-21 12:02:48 +02001233 perf_event_mmap(vma);
Peter Zijlstra0a4a9392009-03-30 19:07:05 +02001234
Linus Torvalds1da177e2005-04-16 15:20:36 -07001235 mm->total_vm += len >> PAGE_SHIFT;
Hugh Dickinsab50b8e2005-10-29 18:15:56 -07001236 vm_stat_account(mm, vm_flags, file, len >> PAGE_SHIFT);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001237 if (vm_flags & VM_LOCKED) {
Rik van Rielba470de2008-10-18 20:26:50 -07001238 /*
1239 * makes pages present; downgrades, drops, reacquires mmap_sem
1240 */
1241 long nr_pages = mlock_vma_pages_range(vma, addr, addr + len);
1242 if (nr_pages < 0)
1243 return nr_pages; /* vma gone! */
1244 mm->locked_vm += (len >> PAGE_SHIFT) - nr_pages;
1245 } else if ((flags & MAP_POPULATE) && !(flags & MAP_NONBLOCK))
Nick Piggin54cb8822007-07-19 01:46:59 -07001246 make_pages_present(addr, addr + len);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001247 return addr;
1248
1249unmap_and_free_vma:
1250 if (correct_wcount)
1251 atomic_inc(&inode->i_writecount);
1252 vma->vm_file = NULL;
1253 fput(file);
1254
1255 /* Undo any partial mapping done by a device driver. */
Hugh Dickinse0da3822005-04-19 13:29:15 -07001256 unmap_region(mm, vma, prev, vma->vm_start, vma->vm_end);
1257 charged = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001258free_vma:
1259 kmem_cache_free(vm_area_cachep, vma);
1260unacct_error:
1261 if (charged)
1262 vm_unacct_memory(charged);
1263 return error;
1264}
1265
Linus Torvalds1da177e2005-04-16 15:20:36 -07001266/* Get an address range which is currently unmapped.
1267 * For shmat() with addr=0.
1268 *
1269 * Ugly calling convention alert:
1270 * Return value with the low bits set means error value,
1271 * ie
1272 * if (ret & ~PAGE_MASK)
1273 * error = ret;
1274 *
1275 * This function "knows" that -ENOMEM has the bits set.
1276 */
1277#ifndef HAVE_ARCH_UNMAPPED_AREA
1278unsigned long
1279arch_get_unmapped_area(struct file *filp, unsigned long addr,
1280 unsigned long len, unsigned long pgoff, unsigned long flags)
1281{
1282 struct mm_struct *mm = current->mm;
1283 struct vm_area_struct *vma;
1284 unsigned long start_addr;
1285
1286 if (len > TASK_SIZE)
1287 return -ENOMEM;
1288
Benjamin Herrenschmidt06abdfb2007-05-06 14:50:13 -07001289 if (flags & MAP_FIXED)
1290 return addr;
1291
Linus Torvalds1da177e2005-04-16 15:20:36 -07001292 if (addr) {
1293 addr = PAGE_ALIGN(addr);
1294 vma = find_vma(mm, addr);
1295 if (TASK_SIZE - len >= addr &&
1296 (!vma || addr + len <= vma->vm_start))
1297 return addr;
1298 }
Wolfgang Wander1363c3c2005-06-21 17:14:49 -07001299 if (len > mm->cached_hole_size) {
1300 start_addr = addr = mm->free_area_cache;
1301 } else {
1302 start_addr = addr = TASK_UNMAPPED_BASE;
1303 mm->cached_hole_size = 0;
1304 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001305
1306full_search:
1307 for (vma = find_vma(mm, addr); ; vma = vma->vm_next) {
1308 /* At this point: (!vma || addr < vma->vm_end). */
1309 if (TASK_SIZE - len < addr) {
1310 /*
1311 * Start a new search - just in case we missed
1312 * some holes.
1313 */
1314 if (start_addr != TASK_UNMAPPED_BASE) {
Wolfgang Wander1363c3c2005-06-21 17:14:49 -07001315 addr = TASK_UNMAPPED_BASE;
1316 start_addr = addr;
1317 mm->cached_hole_size = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001318 goto full_search;
1319 }
1320 return -ENOMEM;
1321 }
1322 if (!vma || addr + len <= vma->vm_start) {
1323 /*
1324 * Remember the place where we stopped the search:
1325 */
1326 mm->free_area_cache = addr + len;
1327 return addr;
1328 }
Wolfgang Wander1363c3c2005-06-21 17:14:49 -07001329 if (addr + mm->cached_hole_size < vma->vm_start)
1330 mm->cached_hole_size = vma->vm_start - addr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001331 addr = vma->vm_end;
1332 }
1333}
1334#endif
1335
Wolfgang Wander1363c3c2005-06-21 17:14:49 -07001336void arch_unmap_area(struct mm_struct *mm, unsigned long addr)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001337{
1338 /*
1339 * Is this a new hole at the lowest possible address?
1340 */
Wolfgang Wander1363c3c2005-06-21 17:14:49 -07001341 if (addr >= TASK_UNMAPPED_BASE && addr < mm->free_area_cache) {
1342 mm->free_area_cache = addr;
1343 mm->cached_hole_size = ~0UL;
1344 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001345}
1346
1347/*
1348 * This mmap-allocator allocates new areas top-down from below the
1349 * stack's low limit (the base):
1350 */
1351#ifndef HAVE_ARCH_UNMAPPED_AREA_TOPDOWN
1352unsigned long
1353arch_get_unmapped_area_topdown(struct file *filp, const unsigned long addr0,
1354 const unsigned long len, const unsigned long pgoff,
1355 const unsigned long flags)
1356{
1357 struct vm_area_struct *vma;
1358 struct mm_struct *mm = current->mm;
1359 unsigned long addr = addr0;
1360
1361 /* requested length too big for entire address space */
1362 if (len > TASK_SIZE)
1363 return -ENOMEM;
1364
Benjamin Herrenschmidt06abdfb2007-05-06 14:50:13 -07001365 if (flags & MAP_FIXED)
1366 return addr;
1367
Linus Torvalds1da177e2005-04-16 15:20:36 -07001368 /* requesting a specific address */
1369 if (addr) {
1370 addr = PAGE_ALIGN(addr);
1371 vma = find_vma(mm, addr);
1372 if (TASK_SIZE - len >= addr &&
1373 (!vma || addr + len <= vma->vm_start))
1374 return addr;
1375 }
1376
Wolfgang Wander1363c3c2005-06-21 17:14:49 -07001377 /* check if free_area_cache is useful for us */
1378 if (len <= mm->cached_hole_size) {
1379 mm->cached_hole_size = 0;
1380 mm->free_area_cache = mm->mmap_base;
1381 }
1382
Linus Torvalds1da177e2005-04-16 15:20:36 -07001383 /* either no address requested or can't fit in requested address hole */
1384 addr = mm->free_area_cache;
1385
1386 /* make sure it can fit in the remaining address space */
Linus Torvalds49a43872005-05-18 15:39:33 -07001387 if (addr > len) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001388 vma = find_vma(mm, addr-len);
1389 if (!vma || addr <= vma->vm_start)
1390 /* remember the address as a hint for next time */
1391 return (mm->free_area_cache = addr-len);
1392 }
1393
Chris Wright73219d12005-06-21 17:14:52 -07001394 if (mm->mmap_base < len)
1395 goto bottomup;
1396
Linus Torvalds1da177e2005-04-16 15:20:36 -07001397 addr = mm->mmap_base-len;
1398
1399 do {
1400 /*
1401 * Lookup failure means no vma is above this address,
1402 * else if new region fits below vma->vm_start,
1403 * return with success:
1404 */
1405 vma = find_vma(mm, addr);
1406 if (!vma || addr+len <= vma->vm_start)
1407 /* remember the address as a hint for next time */
1408 return (mm->free_area_cache = addr);
1409
Wolfgang Wander1363c3c2005-06-21 17:14:49 -07001410 /* remember the largest hole we saw so far */
1411 if (addr + mm->cached_hole_size < vma->vm_start)
1412 mm->cached_hole_size = vma->vm_start - addr;
1413
Linus Torvalds1da177e2005-04-16 15:20:36 -07001414 /* try just below the current vma->vm_start */
1415 addr = vma->vm_start-len;
Linus Torvalds49a43872005-05-18 15:39:33 -07001416 } while (len < vma->vm_start);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001417
Chris Wright73219d12005-06-21 17:14:52 -07001418bottomup:
Linus Torvalds1da177e2005-04-16 15:20:36 -07001419 /*
1420 * A failed mmap() very likely causes application failure,
1421 * so fall back to the bottom-up function here. This scenario
1422 * can happen with large stack limits and large mmap()
1423 * allocations.
1424 */
Wolfgang Wander1363c3c2005-06-21 17:14:49 -07001425 mm->cached_hole_size = ~0UL;
1426 mm->free_area_cache = TASK_UNMAPPED_BASE;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001427 addr = arch_get_unmapped_area(filp, addr0, len, pgoff, flags);
1428 /*
1429 * Restore the topdown base:
1430 */
1431 mm->free_area_cache = mm->mmap_base;
Wolfgang Wander1363c3c2005-06-21 17:14:49 -07001432 mm->cached_hole_size = ~0UL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001433
1434 return addr;
1435}
1436#endif
1437
Wolfgang Wander1363c3c2005-06-21 17:14:49 -07001438void arch_unmap_area_topdown(struct mm_struct *mm, unsigned long addr)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001439{
1440 /*
1441 * Is this a new hole at the highest possible address?
1442 */
Wolfgang Wander1363c3c2005-06-21 17:14:49 -07001443 if (addr > mm->free_area_cache)
1444 mm->free_area_cache = addr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001445
1446 /* dont allow allocations above current base */
Wolfgang Wander1363c3c2005-06-21 17:14:49 -07001447 if (mm->free_area_cache > mm->mmap_base)
1448 mm->free_area_cache = mm->mmap_base;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001449}
1450
1451unsigned long
1452get_unmapped_area(struct file *file, unsigned long addr, unsigned long len,
1453 unsigned long pgoff, unsigned long flags)
1454{
Benjamin Herrenschmidt06abdfb2007-05-06 14:50:13 -07001455 unsigned long (*get_area)(struct file *, unsigned long,
1456 unsigned long, unsigned long, unsigned long);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001457
Benjamin Herrenschmidt06abdfb2007-05-06 14:50:13 -07001458 get_area = current->mm->get_unmapped_area;
1459 if (file && file->f_op && file->f_op->get_unmapped_area)
1460 get_area = file->f_op->get_unmapped_area;
1461 addr = get_area(file, addr, len, pgoff, flags);
1462 if (IS_ERR_VALUE(addr))
1463 return addr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001464
Linus Torvalds07ab67c2005-05-19 22:43:37 -07001465 if (addr > TASK_SIZE - len)
1466 return -ENOMEM;
1467 if (addr & ~PAGE_MASK)
1468 return -EINVAL;
Benjamin Herrenschmidt06abdfb2007-05-06 14:50:13 -07001469
Martin Schwidefsky08e7d9b2008-02-04 22:29:16 -08001470 return arch_rebalance_pgtables(addr, len);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001471}
1472
1473EXPORT_SYMBOL(get_unmapped_area);
1474
1475/* Look up the first VMA which satisfies addr < vm_end, NULL if none. */
ZhenwenXu48aae422009-01-06 14:40:21 -08001476struct vm_area_struct *find_vma(struct mm_struct *mm, unsigned long addr)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001477{
1478 struct vm_area_struct *vma = NULL;
1479
1480 if (mm) {
1481 /* Check the cache first. */
1482 /* (Cache hit rate is typically around 35%.) */
1483 vma = mm->mmap_cache;
1484 if (!(vma && vma->vm_end > addr && vma->vm_start <= addr)) {
1485 struct rb_node * rb_node;
1486
1487 rb_node = mm->mm_rb.rb_node;
1488 vma = NULL;
1489
1490 while (rb_node) {
1491 struct vm_area_struct * vma_tmp;
1492
1493 vma_tmp = rb_entry(rb_node,
1494 struct vm_area_struct, vm_rb);
1495
1496 if (vma_tmp->vm_end > addr) {
1497 vma = vma_tmp;
1498 if (vma_tmp->vm_start <= addr)
1499 break;
1500 rb_node = rb_node->rb_left;
1501 } else
1502 rb_node = rb_node->rb_right;
1503 }
1504 if (vma)
1505 mm->mmap_cache = vma;
1506 }
1507 }
1508 return vma;
1509}
1510
1511EXPORT_SYMBOL(find_vma);
1512
1513/* Same as find_vma, but also return a pointer to the previous VMA in *pprev. */
1514struct vm_area_struct *
1515find_vma_prev(struct mm_struct *mm, unsigned long addr,
1516 struct vm_area_struct **pprev)
1517{
1518 struct vm_area_struct *vma = NULL, *prev = NULL;
ZhenwenXu48aae422009-01-06 14:40:21 -08001519 struct rb_node *rb_node;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001520 if (!mm)
1521 goto out;
1522
1523 /* Guard against addr being lower than the first VMA */
1524 vma = mm->mmap;
1525
1526 /* Go through the RB tree quickly. */
1527 rb_node = mm->mm_rb.rb_node;
1528
1529 while (rb_node) {
1530 struct vm_area_struct *vma_tmp;
1531 vma_tmp = rb_entry(rb_node, struct vm_area_struct, vm_rb);
1532
1533 if (addr < vma_tmp->vm_end) {
1534 rb_node = rb_node->rb_left;
1535 } else {
1536 prev = vma_tmp;
1537 if (!prev->vm_next || (addr < prev->vm_next->vm_end))
1538 break;
1539 rb_node = rb_node->rb_right;
1540 }
1541 }
1542
1543out:
1544 *pprev = prev;
1545 return prev ? prev->vm_next : vma;
1546}
1547
1548/*
1549 * Verify that the stack growth is acceptable and
1550 * update accounting. This is shared with both the
1551 * grow-up and grow-down cases.
1552 */
ZhenwenXu48aae422009-01-06 14:40:21 -08001553static int acct_stack_growth(struct vm_area_struct *vma, unsigned long size, unsigned long grow)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001554{
1555 struct mm_struct *mm = vma->vm_mm;
1556 struct rlimit *rlim = current->signal->rlim;
Adam Litke0d59a012007-01-30 14:35:39 -08001557 unsigned long new_start;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001558
1559 /* address space limit tests */
akpm@osdl.org119f6572005-05-01 08:58:35 -07001560 if (!may_expand_vm(mm, grow))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001561 return -ENOMEM;
1562
1563 /* Stack limit test */
1564 if (size > rlim[RLIMIT_STACK].rlim_cur)
1565 return -ENOMEM;
1566
1567 /* mlock limit tests */
1568 if (vma->vm_flags & VM_LOCKED) {
1569 unsigned long locked;
1570 unsigned long limit;
1571 locked = mm->locked_vm + grow;
1572 limit = rlim[RLIMIT_MEMLOCK].rlim_cur >> PAGE_SHIFT;
1573 if (locked > limit && !capable(CAP_IPC_LOCK))
1574 return -ENOMEM;
1575 }
1576
Adam Litke0d59a012007-01-30 14:35:39 -08001577 /* Check to ensure the stack will not grow into a hugetlb-only region */
1578 new_start = (vma->vm_flags & VM_GROWSUP) ? vma->vm_start :
1579 vma->vm_end - size;
1580 if (is_hugepage_only_range(vma->vm_mm, new_start, size))
1581 return -EFAULT;
1582
Linus Torvalds1da177e2005-04-16 15:20:36 -07001583 /*
1584 * Overcommit.. This must be the final test, as it will
1585 * update security statistics.
1586 */
Hugh Dickins05fa1992009-04-16 21:58:12 +01001587 if (security_vm_enough_memory_mm(mm, grow))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001588 return -ENOMEM;
1589
1590 /* Ok, everything looks good - let it rip */
1591 mm->total_vm += grow;
1592 if (vma->vm_flags & VM_LOCKED)
1593 mm->locked_vm += grow;
Hugh Dickinsab50b8e2005-10-29 18:15:56 -07001594 vm_stat_account(mm, vma->vm_flags, vma->vm_file, grow);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001595 return 0;
1596}
1597
Hugh Dickins46dea3d2005-10-29 18:16:20 -07001598#if defined(CONFIG_STACK_GROWSUP) || defined(CONFIG_IA64)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001599/*
Hugh Dickins46dea3d2005-10-29 18:16:20 -07001600 * PA-RISC uses this for its stack; IA64 for its Register Backing Store.
1601 * vma is the last one with address > vma->vm_end. Have to extend vma.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001602 */
Matthew Wilcox9ab88512005-11-18 16:16:42 -05001603#ifndef CONFIG_IA64
Denys Vlasenkocb8f4882008-10-18 20:27:01 -07001604static
Hugh Dickins46dea3d2005-10-29 18:16:20 -07001605#endif
1606int expand_upwards(struct vm_area_struct *vma, unsigned long address)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001607{
1608 int error;
1609
1610 if (!(vma->vm_flags & VM_GROWSUP))
1611 return -EFAULT;
1612
1613 /*
1614 * We must make sure the anon_vma is allocated
1615 * so that the anon_vma locking is not a noop.
1616 */
1617 if (unlikely(anon_vma_prepare(vma)))
1618 return -ENOMEM;
1619 anon_vma_lock(vma);
1620
1621 /*
1622 * vma->vm_start/vm_end cannot change under us because the caller
1623 * is required to hold the mmap_sem in read mode. We need the
1624 * anon_vma lock to serialize against concurrent expand_stacks.
Helge Deller06b32f32006-12-19 19:28:33 +01001625 * Also guard against wrapping around to address 0.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001626 */
Helge Deller06b32f32006-12-19 19:28:33 +01001627 if (address < PAGE_ALIGN(address+4))
1628 address = PAGE_ALIGN(address+4);
1629 else {
1630 anon_vma_unlock(vma);
1631 return -ENOMEM;
1632 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001633 error = 0;
1634
1635 /* Somebody else might have raced and expanded it already */
1636 if (address > vma->vm_end) {
1637 unsigned long size, grow;
1638
1639 size = address - vma->vm_start;
1640 grow = (address - vma->vm_end) >> PAGE_SHIFT;
1641
1642 error = acct_stack_growth(vma, size, grow);
1643 if (!error)
1644 vma->vm_end = address;
1645 }
1646 anon_vma_unlock(vma);
1647 return error;
1648}
Hugh Dickins46dea3d2005-10-29 18:16:20 -07001649#endif /* CONFIG_STACK_GROWSUP || CONFIG_IA64 */
1650
Linus Torvalds1da177e2005-04-16 15:20:36 -07001651/*
1652 * vma is the first one with address < vma->vm_start. Have to extend vma.
1653 */
Denys Vlasenkocb8f4882008-10-18 20:27:01 -07001654static int expand_downwards(struct vm_area_struct *vma,
Ollie Wildb6a2fea2007-07-19 01:48:16 -07001655 unsigned long address)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001656{
1657 int error;
1658
1659 /*
1660 * We must make sure the anon_vma is allocated
1661 * so that the anon_vma locking is not a noop.
1662 */
1663 if (unlikely(anon_vma_prepare(vma)))
1664 return -ENOMEM;
Eric Paris88694772007-11-26 18:47:26 -05001665
1666 address &= PAGE_MASK;
Richard Knutsson88c3f7a2007-12-08 12:02:48 +01001667 error = security_file_mmap(NULL, 0, 0, 0, address, 1);
Eric Paris88694772007-11-26 18:47:26 -05001668 if (error)
1669 return error;
1670
Linus Torvalds1da177e2005-04-16 15:20:36 -07001671 anon_vma_lock(vma);
1672
1673 /*
1674 * vma->vm_start/vm_end cannot change under us because the caller
1675 * is required to hold the mmap_sem in read mode. We need the
1676 * anon_vma lock to serialize against concurrent expand_stacks.
1677 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001678
1679 /* Somebody else might have raced and expanded it already */
1680 if (address < vma->vm_start) {
1681 unsigned long size, grow;
1682
1683 size = vma->vm_end - address;
1684 grow = (vma->vm_start - address) >> PAGE_SHIFT;
1685
1686 error = acct_stack_growth(vma, size, grow);
1687 if (!error) {
1688 vma->vm_start = address;
1689 vma->vm_pgoff -= grow;
1690 }
1691 }
1692 anon_vma_unlock(vma);
1693 return error;
1694}
1695
Ollie Wildb6a2fea2007-07-19 01:48:16 -07001696int expand_stack_downwards(struct vm_area_struct *vma, unsigned long address)
1697{
1698 return expand_downwards(vma, address);
1699}
1700
1701#ifdef CONFIG_STACK_GROWSUP
1702int expand_stack(struct vm_area_struct *vma, unsigned long address)
1703{
1704 return expand_upwards(vma, address);
1705}
1706
1707struct vm_area_struct *
1708find_extend_vma(struct mm_struct *mm, unsigned long addr)
1709{
1710 struct vm_area_struct *vma, *prev;
1711
1712 addr &= PAGE_MASK;
1713 vma = find_vma_prev(mm, addr, &prev);
1714 if (vma && (vma->vm_start <= addr))
1715 return vma;
Denys Vlasenko1c127182008-11-12 01:24:41 +01001716 if (!prev || expand_stack(prev, addr))
Ollie Wildb6a2fea2007-07-19 01:48:16 -07001717 return NULL;
Rik van Rielba470de2008-10-18 20:26:50 -07001718 if (prev->vm_flags & VM_LOCKED) {
1719 if (mlock_vma_pages_range(prev, addr, prev->vm_end) < 0)
1720 return NULL; /* vma gone! */
1721 }
Ollie Wildb6a2fea2007-07-19 01:48:16 -07001722 return prev;
1723}
1724#else
1725int expand_stack(struct vm_area_struct *vma, unsigned long address)
1726{
1727 return expand_downwards(vma, address);
1728}
1729
Linus Torvalds1da177e2005-04-16 15:20:36 -07001730struct vm_area_struct *
1731find_extend_vma(struct mm_struct * mm, unsigned long addr)
1732{
1733 struct vm_area_struct * vma;
1734 unsigned long start;
1735
1736 addr &= PAGE_MASK;
1737 vma = find_vma(mm,addr);
1738 if (!vma)
1739 return NULL;
1740 if (vma->vm_start <= addr)
1741 return vma;
1742 if (!(vma->vm_flags & VM_GROWSDOWN))
1743 return NULL;
1744 start = vma->vm_start;
1745 if (expand_stack(vma, addr))
1746 return NULL;
Rik van Rielba470de2008-10-18 20:26:50 -07001747 if (vma->vm_flags & VM_LOCKED) {
1748 if (mlock_vma_pages_range(vma, addr, start) < 0)
1749 return NULL; /* vma gone! */
1750 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001751 return vma;
1752}
1753#endif
1754
Linus Torvalds1da177e2005-04-16 15:20:36 -07001755/*
Hugh Dickins2c0b3812005-10-29 18:15:56 -07001756 * Ok - we have the memory areas we should free on the vma list,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001757 * so release them, and do the vma updates.
Hugh Dickins2c0b3812005-10-29 18:15:56 -07001758 *
1759 * Called with the mm semaphore held.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001760 */
Hugh Dickins2c0b3812005-10-29 18:15:56 -07001761static void remove_vma_list(struct mm_struct *mm, struct vm_area_struct *vma)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001762{
Hugh Dickins365e9c872005-10-29 18:16:18 -07001763 /* Update high watermark before we lower total_vm */
1764 update_hiwater_vm(mm);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001765 do {
Hugh Dickins2c0b3812005-10-29 18:15:56 -07001766 long nrpages = vma_pages(vma);
1767
1768 mm->total_vm -= nrpages;
Hugh Dickins2c0b3812005-10-29 18:15:56 -07001769 vm_stat_account(mm, vma->vm_flags, vma->vm_file, -nrpages);
Hugh Dickinsa8fb5612005-10-29 18:15:57 -07001770 vma = remove_vma(vma);
Hugh Dickins146425a2005-04-19 13:29:18 -07001771 } while (vma);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001772 validate_mm(mm);
1773}
1774
1775/*
1776 * Get rid of page table information in the indicated region.
1777 *
Paolo 'Blaisorblade' Giarrussof10df682005-09-21 09:55:37 -07001778 * Called with the mm semaphore held.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001779 */
1780static void unmap_region(struct mm_struct *mm,
Hugh Dickinse0da3822005-04-19 13:29:15 -07001781 struct vm_area_struct *vma, struct vm_area_struct *prev,
1782 unsigned long start, unsigned long end)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001783{
Hugh Dickinse0da3822005-04-19 13:29:15 -07001784 struct vm_area_struct *next = prev? prev->vm_next: mm->mmap;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001785 struct mmu_gather *tlb;
1786 unsigned long nr_accounted = 0;
1787
1788 lru_add_drain();
1789 tlb = tlb_gather_mmu(mm, 0);
Hugh Dickins365e9c872005-10-29 18:16:18 -07001790 update_hiwater_rss(mm);
Hugh Dickins508034a2005-10-29 18:16:30 -07001791 unmap_vmas(&tlb, vma, start, end, &nr_accounted, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001792 vm_unacct_memory(nr_accounted);
Jan Beulich42b77722008-07-23 21:27:10 -07001793 free_pgtables(tlb, vma, prev? prev->vm_end: FIRST_USER_ADDRESS,
Hugh Dickinse0da3822005-04-19 13:29:15 -07001794 next? next->vm_start: 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001795 tlb_finish_mmu(tlb, start, end);
1796}
1797
1798/*
1799 * Create a list of vma's touched by the unmap, removing them from the mm's
1800 * vma list as we go..
1801 */
1802static void
1803detach_vmas_to_be_unmapped(struct mm_struct *mm, struct vm_area_struct *vma,
1804 struct vm_area_struct *prev, unsigned long end)
1805{
1806 struct vm_area_struct **insertion_point;
1807 struct vm_area_struct *tail_vma = NULL;
Wolfgang Wander1363c3c2005-06-21 17:14:49 -07001808 unsigned long addr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001809
1810 insertion_point = (prev ? &prev->vm_next : &mm->mmap);
1811 do {
1812 rb_erase(&vma->vm_rb, &mm->mm_rb);
1813 mm->map_count--;
1814 tail_vma = vma;
1815 vma = vma->vm_next;
1816 } while (vma && vma->vm_start < end);
1817 *insertion_point = vma;
1818 tail_vma->vm_next = NULL;
Wolfgang Wander1363c3c2005-06-21 17:14:49 -07001819 if (mm->unmap_area == arch_unmap_area)
1820 addr = prev ? prev->vm_end : mm->mmap_base;
1821 else
1822 addr = vma ? vma->vm_start : mm->mmap_base;
1823 mm->unmap_area(mm, addr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001824 mm->mmap_cache = NULL; /* Kill the cache. */
1825}
1826
1827/*
1828 * Split a vma into two pieces at address 'addr', a new vma is allocated
Michael Opdenacker59c51592007-05-09 08:57:56 +02001829 * either for the first part or the tail.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001830 */
1831int split_vma(struct mm_struct * mm, struct vm_area_struct * vma,
1832 unsigned long addr, int new_below)
1833{
1834 struct mempolicy *pol;
1835 struct vm_area_struct *new;
1836
Andi Kleena5516432008-07-23 21:27:41 -07001837 if (is_vm_hugetlb_page(vma) && (addr &
1838 ~(huge_page_mask(hstate_vma(vma)))))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001839 return -EINVAL;
1840
1841 if (mm->map_count >= sysctl_max_map_count)
1842 return -ENOMEM;
1843
Christoph Lametere94b1762006-12-06 20:33:17 -08001844 new = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001845 if (!new)
1846 return -ENOMEM;
1847
1848 /* most fields are the same, copy all, and then fixup */
1849 *new = *vma;
1850
1851 if (new_below)
1852 new->vm_end = addr;
1853 else {
1854 new->vm_start = addr;
1855 new->vm_pgoff += ((addr - vma->vm_start) >> PAGE_SHIFT);
1856 }
1857
Lee Schermerhorn846a16b2008-04-28 02:13:09 -07001858 pol = mpol_dup(vma_policy(vma));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001859 if (IS_ERR(pol)) {
1860 kmem_cache_free(vm_area_cachep, new);
1861 return PTR_ERR(pol);
1862 }
1863 vma_set_policy(new, pol);
1864
Matt Helsley925d1c42008-04-29 01:01:36 -07001865 if (new->vm_file) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001866 get_file(new->vm_file);
Matt Helsley925d1c42008-04-29 01:01:36 -07001867 if (vma->vm_flags & VM_EXECUTABLE)
1868 added_exe_file_vma(mm);
1869 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001870
1871 if (new->vm_ops && new->vm_ops->open)
1872 new->vm_ops->open(new);
1873
1874 if (new_below)
1875 vma_adjust(vma, addr, vma->vm_end, vma->vm_pgoff +
1876 ((addr - new->vm_start) >> PAGE_SHIFT), new);
1877 else
1878 vma_adjust(vma, vma->vm_start, addr, vma->vm_pgoff, new);
1879
1880 return 0;
1881}
1882
1883/* Munmap is split into 2 main parts -- this part which finds
1884 * what needs doing, and the areas themselves, which do the
1885 * work. This now handles partial unmappings.
1886 * Jeremy Fitzhardinge <jeremy@goop.org>
1887 */
1888int do_munmap(struct mm_struct *mm, unsigned long start, size_t len)
1889{
1890 unsigned long end;
Hugh Dickins146425a2005-04-19 13:29:18 -07001891 struct vm_area_struct *vma, *prev, *last;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001892
1893 if ((start & ~PAGE_MASK) || start > TASK_SIZE || len > TASK_SIZE-start)
1894 return -EINVAL;
1895
1896 if ((len = PAGE_ALIGN(len)) == 0)
1897 return -EINVAL;
1898
1899 /* Find the first overlapping VMA */
Hugh Dickins146425a2005-04-19 13:29:18 -07001900 vma = find_vma_prev(mm, start, &prev);
1901 if (!vma)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001902 return 0;
Hugh Dickins146425a2005-04-19 13:29:18 -07001903 /* we have start < vma->vm_end */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001904
1905 /* if it doesn't overlap, we have nothing.. */
1906 end = start + len;
Hugh Dickins146425a2005-04-19 13:29:18 -07001907 if (vma->vm_start >= end)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001908 return 0;
1909
1910 /*
1911 * If we need to split any vma, do it now to save pain later.
1912 *
1913 * Note: mremap's move_vma VM_ACCOUNT handling assumes a partially
1914 * unmapped vm_area_struct will remain in use: so lower split_vma
1915 * places tmp vma above, and higher split_vma places tmp vma below.
1916 */
Hugh Dickins146425a2005-04-19 13:29:18 -07001917 if (start > vma->vm_start) {
1918 int error = split_vma(mm, vma, start, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001919 if (error)
1920 return error;
Hugh Dickins146425a2005-04-19 13:29:18 -07001921 prev = vma;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001922 }
1923
1924 /* Does it split the last one? */
1925 last = find_vma(mm, end);
1926 if (last && end > last->vm_start) {
1927 int error = split_vma(mm, last, end, 1);
1928 if (error)
1929 return error;
1930 }
Hugh Dickins146425a2005-04-19 13:29:18 -07001931 vma = prev? prev->vm_next: mm->mmap;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001932
1933 /*
Rik van Rielba470de2008-10-18 20:26:50 -07001934 * unlock any mlock()ed ranges before detaching vmas
1935 */
1936 if (mm->locked_vm) {
1937 struct vm_area_struct *tmp = vma;
1938 while (tmp && tmp->vm_start < end) {
1939 if (tmp->vm_flags & VM_LOCKED) {
1940 mm->locked_vm -= vma_pages(tmp);
1941 munlock_vma_pages_all(tmp);
1942 }
1943 tmp = tmp->vm_next;
1944 }
1945 }
1946
1947 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001948 * Remove the vma's, and unmap the actual pages
1949 */
Hugh Dickins146425a2005-04-19 13:29:18 -07001950 detach_vmas_to_be_unmapped(mm, vma, prev, end);
1951 unmap_region(mm, vma, prev, start, end);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001952
1953 /* Fix up all other VM information */
Hugh Dickins2c0b3812005-10-29 18:15:56 -07001954 remove_vma_list(mm, vma);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001955
1956 return 0;
1957}
1958
1959EXPORT_SYMBOL(do_munmap);
1960
Heiko Carstens6a6160a2009-01-14 14:14:15 +01001961SYSCALL_DEFINE2(munmap, unsigned long, addr, size_t, len)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001962{
1963 int ret;
1964 struct mm_struct *mm = current->mm;
1965
1966 profile_munmap(addr);
1967
1968 down_write(&mm->mmap_sem);
1969 ret = do_munmap(mm, addr, len);
1970 up_write(&mm->mmap_sem);
1971 return ret;
1972}
1973
1974static inline void verify_mm_writelocked(struct mm_struct *mm)
1975{
Paul E. McKenneya241ec62005-10-30 15:03:12 -08001976#ifdef CONFIG_DEBUG_VM
Linus Torvalds1da177e2005-04-16 15:20:36 -07001977 if (unlikely(down_read_trylock(&mm->mmap_sem))) {
1978 WARN_ON(1);
1979 up_read(&mm->mmap_sem);
1980 }
1981#endif
1982}
1983
1984/*
1985 * this is really a simplified "do_mmap". it only handles
1986 * anonymous maps. eventually we may be able to do some
1987 * brk-specific accounting here.
1988 */
1989unsigned long do_brk(unsigned long addr, unsigned long len)
1990{
1991 struct mm_struct * mm = current->mm;
1992 struct vm_area_struct * vma, * prev;
1993 unsigned long flags;
1994 struct rb_node ** rb_link, * rb_parent;
1995 pgoff_t pgoff = addr >> PAGE_SHIFT;
Kirill Korotaev3a459752006-09-07 14:17:04 +04001996 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001997
1998 len = PAGE_ALIGN(len);
1999 if (!len)
2000 return addr;
2001
2002 if ((addr + len) > TASK_SIZE || (addr + len) < addr)
2003 return -EINVAL;
2004
Hugh Dickinscd2579d2006-11-14 13:43:38 +00002005 if (is_hugepage_only_range(mm, addr, len))
2006 return -EINVAL;
David Gibsoncb07c9a2006-11-14 02:03:38 -08002007
Richard Knutsson88c3f7a2007-12-08 12:02:48 +01002008 error = security_file_mmap(NULL, 0, 0, 0, addr, 1);
Eric Paris5a211a52007-12-04 11:06:55 -05002009 if (error)
2010 return error;
2011
Kirill Korotaev3a459752006-09-07 14:17:04 +04002012 flags = VM_DATA_DEFAULT_FLAGS | VM_ACCOUNT | mm->def_flags;
2013
2014 error = arch_mmap_check(addr, len, flags);
2015 if (error)
2016 return error;
2017
Linus Torvalds1da177e2005-04-16 15:20:36 -07002018 /*
2019 * mlock MCL_FUTURE?
2020 */
2021 if (mm->def_flags & VM_LOCKED) {
2022 unsigned long locked, lock_limit;
Chris Wright93ea1d02005-05-01 08:58:38 -07002023 locked = len >> PAGE_SHIFT;
2024 locked += mm->locked_vm;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002025 lock_limit = current->signal->rlim[RLIMIT_MEMLOCK].rlim_cur;
Chris Wright93ea1d02005-05-01 08:58:38 -07002026 lock_limit >>= PAGE_SHIFT;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002027 if (locked > lock_limit && !capable(CAP_IPC_LOCK))
2028 return -EAGAIN;
2029 }
2030
2031 /*
2032 * mm->mmap_sem is required to protect against another thread
2033 * changing the mappings in case we sleep.
2034 */
2035 verify_mm_writelocked(mm);
2036
2037 /*
2038 * Clear old maps. this also does some error checking for us
2039 */
2040 munmap_back:
2041 vma = find_vma_prepare(mm, addr, &prev, &rb_link, &rb_parent);
2042 if (vma && vma->vm_start < addr + len) {
2043 if (do_munmap(mm, addr, len))
2044 return -ENOMEM;
2045 goto munmap_back;
2046 }
2047
2048 /* Check against address space limits *after* clearing old maps... */
akpm@osdl.org119f6572005-05-01 08:58:35 -07002049 if (!may_expand_vm(mm, len >> PAGE_SHIFT))
Linus Torvalds1da177e2005-04-16 15:20:36 -07002050 return -ENOMEM;
2051
2052 if (mm->map_count > sysctl_max_map_count)
2053 return -ENOMEM;
2054
2055 if (security_vm_enough_memory(len >> PAGE_SHIFT))
2056 return -ENOMEM;
2057
Linus Torvalds1da177e2005-04-16 15:20:36 -07002058 /* Can we just expand an old private anonymous mapping? */
Rik van Rielba470de2008-10-18 20:26:50 -07002059 vma = vma_merge(mm, prev, addr, addr + len, flags,
2060 NULL, NULL, pgoff, NULL);
2061 if (vma)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002062 goto out;
2063
2064 /*
2065 * create a vma struct for an anonymous mapping
2066 */
Pekka Enbergc5e3b832006-03-25 03:06:43 -08002067 vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002068 if (!vma) {
2069 vm_unacct_memory(len >> PAGE_SHIFT);
2070 return -ENOMEM;
2071 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002072
2073 vma->vm_mm = mm;
2074 vma->vm_start = addr;
2075 vma->vm_end = addr + len;
2076 vma->vm_pgoff = pgoff;
2077 vma->vm_flags = flags;
Coly Li3ed75eb2007-10-18 23:39:15 -07002078 vma->vm_page_prot = vm_get_page_prot(flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002079 vma_link(mm, vma, prev, rb_link, rb_parent);
2080out:
2081 mm->total_vm += len >> PAGE_SHIFT;
2082 if (flags & VM_LOCKED) {
Rik van Rielba470de2008-10-18 20:26:50 -07002083 if (!mlock_vma_pages_range(vma, addr, addr + len))
2084 mm->locked_vm += (len >> PAGE_SHIFT);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002085 }
2086 return addr;
2087}
2088
2089EXPORT_SYMBOL(do_brk);
2090
2091/* Release all mmaps. */
2092void exit_mmap(struct mm_struct *mm)
2093{
2094 struct mmu_gather *tlb;
Rik van Rielba470de2008-10-18 20:26:50 -07002095 struct vm_area_struct *vma;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002096 unsigned long nr_accounted = 0;
Hugh Dickinsee39b372005-04-19 13:29:15 -07002097 unsigned long end;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002098
Jeremy Fitzhardinged6dd61c2007-05-02 19:27:14 +02002099 /* mm's last user has gone, and its about to be pulled down */
Andrea Arcangelicddb8a52008-07-28 15:46:29 -07002100 mmu_notifier_release(mm);
Jeremy Fitzhardinged6dd61c2007-05-02 19:27:14 +02002101
Rik van Rielba470de2008-10-18 20:26:50 -07002102 if (mm->locked_vm) {
2103 vma = mm->mmap;
2104 while (vma) {
2105 if (vma->vm_flags & VM_LOCKED)
2106 munlock_vma_pages_all(vma);
2107 vma = vma->vm_next;
2108 }
2109 }
Jeremy Fitzhardinge9480c532009-02-11 13:04:41 -08002110
2111 arch_exit_mmap(mm);
2112
Rik van Rielba470de2008-10-18 20:26:50 -07002113 vma = mm->mmap;
Jeremy Fitzhardinge9480c532009-02-11 13:04:41 -08002114 if (!vma) /* Can happen if dup_mmap() received an OOM */
2115 return;
2116
Linus Torvalds1da177e2005-04-16 15:20:36 -07002117 lru_add_drain();
Linus Torvalds1da177e2005-04-16 15:20:36 -07002118 flush_cache_mm(mm);
Hugh Dickinse0da3822005-04-19 13:29:15 -07002119 tlb = tlb_gather_mmu(mm, 1);
Oleg Nesterov901608d2009-01-06 14:40:29 -08002120 /* update_hiwater_rss(mm) here? but nobody should be looking */
Hugh Dickinse0da3822005-04-19 13:29:15 -07002121 /* Use -1 here to ensure all VMAs in the mm are unmapped */
Hugh Dickins508034a2005-10-29 18:16:30 -07002122 end = unmap_vmas(&tlb, vma, 0, -1, &nr_accounted, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002123 vm_unacct_memory(nr_accounted);
Hugh Dickins9ba69292009-09-21 17:02:20 -07002124
Jan Beulich42b77722008-07-23 21:27:10 -07002125 free_pgtables(tlb, vma, FIRST_USER_ADDRESS, 0);
Hugh Dickinsee39b372005-04-19 13:29:15 -07002126 tlb_finish_mmu(tlb, 0, end);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002127
Linus Torvalds1da177e2005-04-16 15:20:36 -07002128 /*
Hugh Dickins8f4f8c12005-10-29 18:16:29 -07002129 * Walk the list again, actually closing and freeing it,
2130 * with preemption enabled, without holding any MM locks.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002131 */
Hugh Dickinsa8fb5612005-10-29 18:15:57 -07002132 while (vma)
2133 vma = remove_vma(vma);
Hugh Dickinse0da3822005-04-19 13:29:15 -07002134
Hugh Dickinse2cdef82005-04-19 13:29:19 -07002135 BUG_ON(mm->nr_ptes > (FIRST_USER_ADDRESS+PMD_SIZE-1)>>PMD_SHIFT);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002136}
2137
2138/* Insert vm structure into process list sorted by address
2139 * and into the inode's i_mmap tree. If vm_file is non-NULL
2140 * then i_mmap_lock is taken here.
2141 */
2142int insert_vm_struct(struct mm_struct * mm, struct vm_area_struct * vma)
2143{
2144 struct vm_area_struct * __vma, * prev;
2145 struct rb_node ** rb_link, * rb_parent;
2146
2147 /*
2148 * The vm_pgoff of a purely anonymous vma should be irrelevant
2149 * until its first write fault, when page's anon_vma and index
2150 * are set. But now set the vm_pgoff it will almost certainly
2151 * end up with (unless mremap moves it elsewhere before that
2152 * first wfault), so /proc/pid/maps tells a consistent story.
2153 *
2154 * By setting it to reflect the virtual start address of the
2155 * vma, merges and splits can happen in a seamless way, just
2156 * using the existing file pgoff checks and manipulations.
2157 * Similarly in do_mmap_pgoff and in do_brk.
2158 */
2159 if (!vma->vm_file) {
2160 BUG_ON(vma->anon_vma);
2161 vma->vm_pgoff = vma->vm_start >> PAGE_SHIFT;
2162 }
2163 __vma = find_vma_prepare(mm,vma->vm_start,&prev,&rb_link,&rb_parent);
2164 if (__vma && __vma->vm_start < vma->vm_end)
2165 return -ENOMEM;
Hugh Dickins2fd4ef82005-09-14 06:13:02 +01002166 if ((vma->vm_flags & VM_ACCOUNT) &&
Alan Cox34b4e4a2007-08-22 14:01:28 -07002167 security_vm_enough_memory_mm(mm, vma_pages(vma)))
Hugh Dickins2fd4ef82005-09-14 06:13:02 +01002168 return -ENOMEM;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002169 vma_link(mm, vma, prev, rb_link, rb_parent);
2170 return 0;
2171}
2172
2173/*
2174 * Copy the vma structure to a new location in the same mm,
2175 * prior to moving page table entries, to effect an mremap move.
2176 */
2177struct vm_area_struct *copy_vma(struct vm_area_struct **vmap,
2178 unsigned long addr, unsigned long len, pgoff_t pgoff)
2179{
2180 struct vm_area_struct *vma = *vmap;
2181 unsigned long vma_start = vma->vm_start;
2182 struct mm_struct *mm = vma->vm_mm;
2183 struct vm_area_struct *new_vma, *prev;
2184 struct rb_node **rb_link, *rb_parent;
2185 struct mempolicy *pol;
2186
2187 /*
2188 * If anonymous vma has not yet been faulted, update new pgoff
2189 * to match new location, to increase its chance of merging.
2190 */
2191 if (!vma->vm_file && !vma->anon_vma)
2192 pgoff = addr >> PAGE_SHIFT;
2193
2194 find_vma_prepare(mm, addr, &prev, &rb_link, &rb_parent);
2195 new_vma = vma_merge(mm, prev, addr, addr + len, vma->vm_flags,
2196 vma->anon_vma, vma->vm_file, pgoff, vma_policy(vma));
2197 if (new_vma) {
2198 /*
2199 * Source vma may have been merged into new_vma
2200 */
2201 if (vma_start >= new_vma->vm_start &&
2202 vma_start < new_vma->vm_end)
2203 *vmap = new_vma;
2204 } else {
Christoph Lametere94b1762006-12-06 20:33:17 -08002205 new_vma = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002206 if (new_vma) {
2207 *new_vma = *vma;
Lee Schermerhorn846a16b2008-04-28 02:13:09 -07002208 pol = mpol_dup(vma_policy(vma));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002209 if (IS_ERR(pol)) {
2210 kmem_cache_free(vm_area_cachep, new_vma);
2211 return NULL;
2212 }
2213 vma_set_policy(new_vma, pol);
2214 new_vma->vm_start = addr;
2215 new_vma->vm_end = addr + len;
2216 new_vma->vm_pgoff = pgoff;
Matt Helsley925d1c42008-04-29 01:01:36 -07002217 if (new_vma->vm_file) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002218 get_file(new_vma->vm_file);
Matt Helsley925d1c42008-04-29 01:01:36 -07002219 if (vma->vm_flags & VM_EXECUTABLE)
2220 added_exe_file_vma(mm);
2221 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002222 if (new_vma->vm_ops && new_vma->vm_ops->open)
2223 new_vma->vm_ops->open(new_vma);
2224 vma_link(mm, new_vma, prev, rb_link, rb_parent);
2225 }
2226 }
2227 return new_vma;
2228}
akpm@osdl.org119f6572005-05-01 08:58:35 -07002229
2230/*
2231 * Return true if the calling process may expand its vm space by the passed
2232 * number of pages
2233 */
2234int may_expand_vm(struct mm_struct *mm, unsigned long npages)
2235{
2236 unsigned long cur = mm->total_vm; /* pages */
2237 unsigned long lim;
2238
2239 lim = current->signal->rlim[RLIMIT_AS].rlim_cur >> PAGE_SHIFT;
2240
2241 if (cur + npages > lim)
2242 return 0;
2243 return 1;
2244}
Roland McGrathfa5dc222007-02-08 14:20:41 -08002245
2246
Nick Pigginb1d0e4f2008-02-09 01:15:19 +01002247static int special_mapping_fault(struct vm_area_struct *vma,
2248 struct vm_fault *vmf)
Roland McGrathfa5dc222007-02-08 14:20:41 -08002249{
Nick Pigginb1d0e4f2008-02-09 01:15:19 +01002250 pgoff_t pgoff;
Roland McGrathfa5dc222007-02-08 14:20:41 -08002251 struct page **pages;
2252
Nick Pigginb1d0e4f2008-02-09 01:15:19 +01002253 /*
2254 * special mappings have no vm_file, and in that case, the mm
2255 * uses vm_pgoff internally. So we have to subtract it from here.
2256 * We are allowed to do this because we are the mm; do not copy
2257 * this code into drivers!
2258 */
2259 pgoff = vmf->pgoff - vma->vm_pgoff;
Roland McGrathfa5dc222007-02-08 14:20:41 -08002260
Nick Pigginb1d0e4f2008-02-09 01:15:19 +01002261 for (pages = vma->vm_private_data; pgoff && *pages; ++pages)
2262 pgoff--;
Roland McGrathfa5dc222007-02-08 14:20:41 -08002263
2264 if (*pages) {
2265 struct page *page = *pages;
2266 get_page(page);
Nick Pigginb1d0e4f2008-02-09 01:15:19 +01002267 vmf->page = page;
2268 return 0;
Roland McGrathfa5dc222007-02-08 14:20:41 -08002269 }
2270
Nick Pigginb1d0e4f2008-02-09 01:15:19 +01002271 return VM_FAULT_SIGBUS;
Roland McGrathfa5dc222007-02-08 14:20:41 -08002272}
2273
2274/*
2275 * Having a close hook prevents vma merging regardless of flags.
2276 */
2277static void special_mapping_close(struct vm_area_struct *vma)
2278{
2279}
2280
Alexey Dobriyanf0f37e22009-09-27 22:29:37 +04002281static const struct vm_operations_struct special_mapping_vmops = {
Roland McGrathfa5dc222007-02-08 14:20:41 -08002282 .close = special_mapping_close,
Nick Pigginb1d0e4f2008-02-09 01:15:19 +01002283 .fault = special_mapping_fault,
Roland McGrathfa5dc222007-02-08 14:20:41 -08002284};
2285
2286/*
2287 * Called with mm->mmap_sem held for writing.
2288 * Insert a new vma covering the given region, with the given flags.
2289 * Its pages are supplied by the given array of struct page *.
2290 * The array can be shorter than len >> PAGE_SHIFT if it's null-terminated.
2291 * The region past the last page supplied will always produce SIGBUS.
2292 * The array pointer and the pages it points to are assumed to stay alive
2293 * for as long as this mapping might exist.
2294 */
2295int install_special_mapping(struct mm_struct *mm,
2296 unsigned long addr, unsigned long len,
2297 unsigned long vm_flags, struct page **pages)
2298{
2299 struct vm_area_struct *vma;
2300
2301 vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL);
2302 if (unlikely(vma == NULL))
2303 return -ENOMEM;
2304
2305 vma->vm_mm = mm;
2306 vma->vm_start = addr;
2307 vma->vm_end = addr + len;
2308
Nick Piggin2f987352008-02-02 03:08:53 +01002309 vma->vm_flags = vm_flags | mm->def_flags | VM_DONTEXPAND;
Coly Li3ed75eb2007-10-18 23:39:15 -07002310 vma->vm_page_prot = vm_get_page_prot(vma->vm_flags);
Roland McGrathfa5dc222007-02-08 14:20:41 -08002311
2312 vma->vm_ops = &special_mapping_vmops;
2313 vma->vm_private_data = pages;
2314
2315 if (unlikely(insert_vm_struct(mm, vma))) {
2316 kmem_cache_free(vm_area_cachep, vma);
2317 return -ENOMEM;
2318 }
2319
2320 mm->total_vm += len >> PAGE_SHIFT;
2321
Ingo Molnarcdd6c482009-09-21 12:02:48 +02002322 perf_event_mmap(vma);
Peter Zijlstra089dd792009-06-05 14:04:55 +02002323
Roland McGrathfa5dc222007-02-08 14:20:41 -08002324 return 0;
2325}
Andrea Arcangeli7906d002008-07-28 15:46:26 -07002326
2327static DEFINE_MUTEX(mm_all_locks_mutex);
2328
Peter Zijlstra454ed842008-08-11 09:30:25 +02002329static void vm_lock_anon_vma(struct mm_struct *mm, struct anon_vma *anon_vma)
Andrea Arcangeli7906d002008-07-28 15:46:26 -07002330{
2331 if (!test_bit(0, (unsigned long *) &anon_vma->head.next)) {
2332 /*
2333 * The LSB of head.next can't change from under us
2334 * because we hold the mm_all_locks_mutex.
2335 */
Peter Zijlstra454ed842008-08-11 09:30:25 +02002336 spin_lock_nest_lock(&anon_vma->lock, &mm->mmap_sem);
Andrea Arcangeli7906d002008-07-28 15:46:26 -07002337 /*
2338 * We can safely modify head.next after taking the
2339 * anon_vma->lock. If some other vma in this mm shares
2340 * the same anon_vma we won't take it again.
2341 *
2342 * No need of atomic instructions here, head.next
2343 * can't change from under us thanks to the
2344 * anon_vma->lock.
2345 */
2346 if (__test_and_set_bit(0, (unsigned long *)
2347 &anon_vma->head.next))
2348 BUG();
2349 }
2350}
2351
Peter Zijlstra454ed842008-08-11 09:30:25 +02002352static void vm_lock_mapping(struct mm_struct *mm, struct address_space *mapping)
Andrea Arcangeli7906d002008-07-28 15:46:26 -07002353{
2354 if (!test_bit(AS_MM_ALL_LOCKS, &mapping->flags)) {
2355 /*
2356 * AS_MM_ALL_LOCKS can't change from under us because
2357 * we hold the mm_all_locks_mutex.
2358 *
2359 * Operations on ->flags have to be atomic because
2360 * even if AS_MM_ALL_LOCKS is stable thanks to the
2361 * mm_all_locks_mutex, there may be other cpus
2362 * changing other bitflags in parallel to us.
2363 */
2364 if (test_and_set_bit(AS_MM_ALL_LOCKS, &mapping->flags))
2365 BUG();
Peter Zijlstra454ed842008-08-11 09:30:25 +02002366 spin_lock_nest_lock(&mapping->i_mmap_lock, &mm->mmap_sem);
Andrea Arcangeli7906d002008-07-28 15:46:26 -07002367 }
2368}
2369
2370/*
2371 * This operation locks against the VM for all pte/vma/mm related
2372 * operations that could ever happen on a certain mm. This includes
2373 * vmtruncate, try_to_unmap, and all page faults.
2374 *
2375 * The caller must take the mmap_sem in write mode before calling
2376 * mm_take_all_locks(). The caller isn't allowed to release the
2377 * mmap_sem until mm_drop_all_locks() returns.
2378 *
2379 * mmap_sem in write mode is required in order to block all operations
2380 * that could modify pagetables and free pages without need of
2381 * altering the vma layout (for example populate_range() with
2382 * nonlinear vmas). It's also needed in write mode to avoid new
2383 * anon_vmas to be associated with existing vmas.
2384 *
2385 * A single task can't take more than one mm_take_all_locks() in a row
2386 * or it would deadlock.
2387 *
2388 * The LSB in anon_vma->head.next and the AS_MM_ALL_LOCKS bitflag in
2389 * mapping->flags avoid to take the same lock twice, if more than one
2390 * vma in this mm is backed by the same anon_vma or address_space.
2391 *
2392 * We can take all the locks in random order because the VM code
2393 * taking i_mmap_lock or anon_vma->lock outside the mmap_sem never
2394 * takes more than one of them in a row. Secondly we're protected
2395 * against a concurrent mm_take_all_locks() by the mm_all_locks_mutex.
2396 *
2397 * mm_take_all_locks() and mm_drop_all_locks are expensive operations
2398 * that may have to take thousand of locks.
2399 *
2400 * mm_take_all_locks() can fail if it's interrupted by signals.
2401 */
2402int mm_take_all_locks(struct mm_struct *mm)
2403{
2404 struct vm_area_struct *vma;
2405 int ret = -EINTR;
2406
2407 BUG_ON(down_read_trylock(&mm->mmap_sem));
2408
2409 mutex_lock(&mm_all_locks_mutex);
2410
2411 for (vma = mm->mmap; vma; vma = vma->vm_next) {
2412 if (signal_pending(current))
2413 goto out_unlock;
Andrea Arcangeli7906d002008-07-28 15:46:26 -07002414 if (vma->vm_file && vma->vm_file->f_mapping)
Peter Zijlstra454ed842008-08-11 09:30:25 +02002415 vm_lock_mapping(mm, vma->vm_file->f_mapping);
Andrea Arcangeli7906d002008-07-28 15:46:26 -07002416 }
Peter Zijlstra7cd5a022008-08-11 09:30:25 +02002417
2418 for (vma = mm->mmap; vma; vma = vma->vm_next) {
2419 if (signal_pending(current))
2420 goto out_unlock;
2421 if (vma->anon_vma)
2422 vm_lock_anon_vma(mm, vma->anon_vma);
2423 }
2424
Andrea Arcangeli7906d002008-07-28 15:46:26 -07002425 ret = 0;
2426
2427out_unlock:
2428 if (ret)
2429 mm_drop_all_locks(mm);
2430
2431 return ret;
2432}
2433
2434static void vm_unlock_anon_vma(struct anon_vma *anon_vma)
2435{
2436 if (test_bit(0, (unsigned long *) &anon_vma->head.next)) {
2437 /*
2438 * The LSB of head.next can't change to 0 from under
2439 * us because we hold the mm_all_locks_mutex.
2440 *
2441 * We must however clear the bitflag before unlocking
2442 * the vma so the users using the anon_vma->head will
2443 * never see our bitflag.
2444 *
2445 * No need of atomic instructions here, head.next
2446 * can't change from under us until we release the
2447 * anon_vma->lock.
2448 */
2449 if (!__test_and_clear_bit(0, (unsigned long *)
2450 &anon_vma->head.next))
2451 BUG();
2452 spin_unlock(&anon_vma->lock);
2453 }
2454}
2455
2456static void vm_unlock_mapping(struct address_space *mapping)
2457{
2458 if (test_bit(AS_MM_ALL_LOCKS, &mapping->flags)) {
2459 /*
2460 * AS_MM_ALL_LOCKS can't change to 0 from under us
2461 * because we hold the mm_all_locks_mutex.
2462 */
2463 spin_unlock(&mapping->i_mmap_lock);
2464 if (!test_and_clear_bit(AS_MM_ALL_LOCKS,
2465 &mapping->flags))
2466 BUG();
2467 }
2468}
2469
2470/*
2471 * The mmap_sem cannot be released by the caller until
2472 * mm_drop_all_locks() returns.
2473 */
2474void mm_drop_all_locks(struct mm_struct *mm)
2475{
2476 struct vm_area_struct *vma;
2477
2478 BUG_ON(down_read_trylock(&mm->mmap_sem));
2479 BUG_ON(!mutex_is_locked(&mm_all_locks_mutex));
2480
2481 for (vma = mm->mmap; vma; vma = vma->vm_next) {
2482 if (vma->anon_vma)
2483 vm_unlock_anon_vma(vma->anon_vma);
2484 if (vma->vm_file && vma->vm_file->f_mapping)
2485 vm_unlock_mapping(vma->vm_file->f_mapping);
2486 }
2487
2488 mutex_unlock(&mm_all_locks_mutex);
2489}
David Howells8feae132009-01-08 12:04:47 +00002490
2491/*
2492 * initialise the VMA slab
2493 */
2494void __init mmap_init(void)
2495{
KOSAKI Motohiro00a62ce2009-04-30 15:08:51 -07002496 int ret;
2497
2498 ret = percpu_counter_init(&vm_committed_as, 0);
2499 VM_BUG_ON(ret);
David Howells8feae132009-01-08 12:04:47 +00002500}