Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * mm/mmap.c | |
3 | * | |
4 | * Written by obz. | |
5 | * | |
6 | * Address space accounting code <alan@redhat.com> | |
7 | */ | |
8 | ||
9 | #include <linux/slab.h> | |
10 | #include <linux/mm.h> | |
11 | #include <linux/shm.h> | |
12 | #include <linux/mman.h> | |
13 | #include <linux/pagemap.h> | |
14 | #include <linux/swap.h> | |
15 | #include <linux/syscalls.h> | |
c59ede7b | 16 | #include <linux/capability.h> |
1da177e4 LT |
17 | #include <linux/init.h> |
18 | #include <linux/file.h> | |
19 | #include <linux/fs.h> | |
20 | #include <linux/personality.h> | |
21 | #include <linux/security.h> | |
22 | #include <linux/hugetlb.h> | |
23 | #include <linux/profile.h> | |
24 | #include <linux/module.h> | |
25 | #include <linux/mount.h> | |
26 | #include <linux/mempolicy.h> | |
27 | #include <linux/rmap.h> | |
28 | ||
29 | #include <asm/uaccess.h> | |
30 | #include <asm/cacheflush.h> | |
31 | #include <asm/tlb.h> | |
32 | ||
3a459756 KK |
33 | #ifndef arch_mmap_check |
34 | #define arch_mmap_check(addr, len, flags) (0) | |
35 | #endif | |
36 | ||
e0da382c HD |
37 | static void unmap_region(struct mm_struct *mm, |
38 | struct vm_area_struct *vma, struct vm_area_struct *prev, | |
39 | unsigned long start, unsigned long end); | |
40 | ||
1da177e4 LT |
41 | /* |
42 | * WARNING: the debugging will use recursive algorithms so never enable this | |
43 | * unless you know what you are doing. | |
44 | */ | |
45 | #undef DEBUG_MM_RB | |
46 | ||
47 | /* description of effects of mapping type and prot in current implementation. | |
48 | * this is due to the limited x86 page protection hardware. The expected | |
49 | * behavior is in parens: | |
50 | * | |
51 | * map_type prot | |
52 | * PROT_NONE PROT_READ PROT_WRITE PROT_EXEC | |
53 | * MAP_SHARED r: (no) no r: (yes) yes r: (no) yes r: (no) yes | |
54 | * w: (no) no w: (no) no w: (yes) yes w: (no) no | |
55 | * x: (no) no x: (no) yes x: (no) yes x: (yes) yes | |
56 | * | |
57 | * MAP_PRIVATE r: (no) no r: (yes) yes r: (no) yes r: (no) yes | |
58 | * w: (no) no w: (no) no w: (copy) copy w: (no) no | |
59 | * x: (no) no x: (no) yes x: (no) yes x: (yes) yes | |
60 | * | |
61 | */ | |
62 | pgprot_t protection_map[16] = { | |
63 | __P000, __P001, __P010, __P011, __P100, __P101, __P110, __P111, | |
64 | __S000, __S001, __S010, __S011, __S100, __S101, __S110, __S111 | |
65 | }; | |
66 | ||
804af2cf HD |
67 | pgprot_t vm_get_page_prot(unsigned long vm_flags) |
68 | { | |
69 | return protection_map[vm_flags & | |
70 | (VM_READ|VM_WRITE|VM_EXEC|VM_SHARED)]; | |
71 | } | |
72 | EXPORT_SYMBOL(vm_get_page_prot); | |
73 | ||
1da177e4 LT |
74 | int sysctl_overcommit_memory = OVERCOMMIT_GUESS; /* heuristic overcommit */ |
75 | int sysctl_overcommit_ratio = 50; /* default is 50% */ | |
c3d8c141 | 76 | int sysctl_max_map_count __read_mostly = DEFAULT_MAX_MAP_COUNT; |
1da177e4 LT |
77 | atomic_t vm_committed_space = ATOMIC_INIT(0); |
78 | ||
79 | /* | |
80 | * Check that a process has enough memory to allocate a new virtual | |
81 | * mapping. 0 means there is enough memory for the allocation to | |
82 | * succeed and -ENOMEM implies there is not. | |
83 | * | |
84 | * We currently support three overcommit policies, which are set via the | |
85 | * vm.overcommit_memory sysctl. See Documentation/vm/overcommit-accounting | |
86 | * | |
87 | * Strict overcommit modes added 2002 Feb 26 by Alan Cox. | |
88 | * Additional code 2002 Jul 20 by Robert Love. | |
89 | * | |
90 | * cap_sys_admin is 1 if the process has admin privileges, 0 otherwise. | |
91 | * | |
92 | * Note this is a helper function intended to be used by LSMs which | |
93 | * wish to use this logic. | |
94 | */ | |
95 | int __vm_enough_memory(long pages, int cap_sys_admin) | |
96 | { | |
97 | unsigned long free, allowed; | |
98 | ||
99 | vm_acct_memory(pages); | |
100 | ||
101 | /* | |
102 | * Sometimes we want to use more memory than we have | |
103 | */ | |
104 | if (sysctl_overcommit_memory == OVERCOMMIT_ALWAYS) | |
105 | return 0; | |
106 | ||
107 | if (sysctl_overcommit_memory == OVERCOMMIT_GUESS) { | |
108 | unsigned long n; | |
109 | ||
347ce434 | 110 | free = global_page_state(NR_FILE_PAGES); |
1da177e4 LT |
111 | free += nr_swap_pages; |
112 | ||
113 | /* | |
114 | * Any slabs which are created with the | |
115 | * SLAB_RECLAIM_ACCOUNT flag claim to have contents | |
116 | * which are reclaimable, under pressure. The dentry | |
117 | * cache and most inode caches should fall into this | |
118 | */ | |
972d1a7b | 119 | free += global_page_state(NR_SLAB_RECLAIMABLE); |
1da177e4 LT |
120 | |
121 | /* | |
122 | * Leave the last 3% for root | |
123 | */ | |
124 | if (!cap_sys_admin) | |
125 | free -= free / 32; | |
126 | ||
127 | if (free > pages) | |
128 | return 0; | |
129 | ||
130 | /* | |
131 | * nr_free_pages() is very expensive on large systems, | |
132 | * only call if we're about to fail. | |
133 | */ | |
134 | n = nr_free_pages(); | |
6d9f7839 HA |
135 | |
136 | /* | |
137 | * Leave reserved pages. The pages are not for anonymous pages. | |
138 | */ | |
139 | if (n <= totalreserve_pages) | |
140 | goto error; | |
141 | else | |
142 | n -= totalreserve_pages; | |
143 | ||
144 | /* | |
145 | * Leave the last 3% for root | |
146 | */ | |
1da177e4 LT |
147 | if (!cap_sys_admin) |
148 | n -= n / 32; | |
149 | free += n; | |
150 | ||
151 | if (free > pages) | |
152 | return 0; | |
6d9f7839 HA |
153 | |
154 | goto error; | |
1da177e4 LT |
155 | } |
156 | ||
157 | allowed = (totalram_pages - hugetlb_total_pages()) | |
158 | * sysctl_overcommit_ratio / 100; | |
159 | /* | |
160 | * Leave the last 3% for root | |
161 | */ | |
162 | if (!cap_sys_admin) | |
163 | allowed -= allowed / 32; | |
164 | allowed += total_swap_pages; | |
165 | ||
166 | /* Don't let a single process grow too big: | |
167 | leave 3% of the size of this process for other processes */ | |
168 | allowed -= current->mm->total_vm / 32; | |
169 | ||
2f60f8d3 SD |
170 | /* |
171 | * cast `allowed' as a signed long because vm_committed_space | |
172 | * sometimes has a negative value | |
173 | */ | |
174 | if (atomic_read(&vm_committed_space) < (long)allowed) | |
1da177e4 | 175 | return 0; |
6d9f7839 | 176 | error: |
1da177e4 LT |
177 | vm_unacct_memory(pages); |
178 | ||
179 | return -ENOMEM; | |
180 | } | |
181 | ||
1da177e4 LT |
182 | EXPORT_SYMBOL(__vm_enough_memory); |
183 | ||
184 | /* | |
185 | * Requires inode->i_mapping->i_mmap_lock | |
186 | */ | |
187 | static void __remove_shared_vm_struct(struct vm_area_struct *vma, | |
188 | struct file *file, struct address_space *mapping) | |
189 | { | |
190 | if (vma->vm_flags & VM_DENYWRITE) | |
191 | atomic_inc(&file->f_dentry->d_inode->i_writecount); | |
192 | if (vma->vm_flags & VM_SHARED) | |
193 | mapping->i_mmap_writable--; | |
194 | ||
195 | flush_dcache_mmap_lock(mapping); | |
196 | if (unlikely(vma->vm_flags & VM_NONLINEAR)) | |
197 | list_del_init(&vma->shared.vm_set.list); | |
198 | else | |
199 | vma_prio_tree_remove(vma, &mapping->i_mmap); | |
200 | flush_dcache_mmap_unlock(mapping); | |
201 | } | |
202 | ||
203 | /* | |
a8fb5618 HD |
204 | * Unlink a file-based vm structure from its prio_tree, to hide |
205 | * vma from rmap and vmtruncate before freeing its page tables. | |
1da177e4 | 206 | */ |
a8fb5618 | 207 | void unlink_file_vma(struct vm_area_struct *vma) |
1da177e4 LT |
208 | { |
209 | struct file *file = vma->vm_file; | |
210 | ||
1da177e4 LT |
211 | if (file) { |
212 | struct address_space *mapping = file->f_mapping; | |
213 | spin_lock(&mapping->i_mmap_lock); | |
214 | __remove_shared_vm_struct(vma, file, mapping); | |
215 | spin_unlock(&mapping->i_mmap_lock); | |
216 | } | |
a8fb5618 HD |
217 | } |
218 | ||
219 | /* | |
220 | * Close a vm structure and free it, returning the next. | |
221 | */ | |
222 | static struct vm_area_struct *remove_vma(struct vm_area_struct *vma) | |
223 | { | |
224 | struct vm_area_struct *next = vma->vm_next; | |
225 | ||
a8fb5618 | 226 | might_sleep(); |
1da177e4 LT |
227 | if (vma->vm_ops && vma->vm_ops->close) |
228 | vma->vm_ops->close(vma); | |
a8fb5618 HD |
229 | if (vma->vm_file) |
230 | fput(vma->vm_file); | |
1da177e4 LT |
231 | mpol_free(vma_policy(vma)); |
232 | kmem_cache_free(vm_area_cachep, vma); | |
a8fb5618 | 233 | return next; |
1da177e4 LT |
234 | } |
235 | ||
1da177e4 LT |
236 | asmlinkage unsigned long sys_brk(unsigned long brk) |
237 | { | |
238 | unsigned long rlim, retval; | |
239 | unsigned long newbrk, oldbrk; | |
240 | struct mm_struct *mm = current->mm; | |
241 | ||
242 | down_write(&mm->mmap_sem); | |
243 | ||
244 | if (brk < mm->end_code) | |
245 | goto out; | |
1e624196 RG |
246 | |
247 | /* | |
248 | * Check against rlimit here. If this check is done later after the test | |
249 | * of oldbrk with newbrk then it can escape the test and let the data | |
250 | * segment grow beyond its set limit the in case where the limit is | |
251 | * not page aligned -Ram Gupta | |
252 | */ | |
253 | rlim = current->signal->rlim[RLIMIT_DATA].rlim_cur; | |
254 | if (rlim < RLIM_INFINITY && brk - mm->start_data > rlim) | |
255 | goto out; | |
256 | ||
1da177e4 LT |
257 | newbrk = PAGE_ALIGN(brk); |
258 | oldbrk = PAGE_ALIGN(mm->brk); | |
259 | if (oldbrk == newbrk) | |
260 | goto set_brk; | |
261 | ||
262 | /* Always allow shrinking brk. */ | |
263 | if (brk <= mm->brk) { | |
264 | if (!do_munmap(mm, newbrk, oldbrk-newbrk)) | |
265 | goto set_brk; | |
266 | goto out; | |
267 | } | |
268 | ||
1da177e4 LT |
269 | /* Check against existing mmap mappings. */ |
270 | if (find_vma_intersection(mm, oldbrk, newbrk+PAGE_SIZE)) | |
271 | goto out; | |
272 | ||
273 | /* Ok, looks good - let it rip. */ | |
274 | if (do_brk(oldbrk, newbrk-oldbrk) != oldbrk) | |
275 | goto out; | |
276 | set_brk: | |
277 | mm->brk = brk; | |
278 | out: | |
279 | retval = mm->brk; | |
280 | up_write(&mm->mmap_sem); | |
281 | return retval; | |
282 | } | |
283 | ||
284 | #ifdef DEBUG_MM_RB | |
285 | static int browse_rb(struct rb_root *root) | |
286 | { | |
287 | int i = 0, j; | |
288 | struct rb_node *nd, *pn = NULL; | |
289 | unsigned long prev = 0, pend = 0; | |
290 | ||
291 | for (nd = rb_first(root); nd; nd = rb_next(nd)) { | |
292 | struct vm_area_struct *vma; | |
293 | vma = rb_entry(nd, struct vm_area_struct, vm_rb); | |
294 | if (vma->vm_start < prev) | |
295 | printk("vm_start %lx prev %lx\n", vma->vm_start, prev), i = -1; | |
296 | if (vma->vm_start < pend) | |
297 | printk("vm_start %lx pend %lx\n", vma->vm_start, pend); | |
298 | if (vma->vm_start > vma->vm_end) | |
299 | printk("vm_end %lx < vm_start %lx\n", vma->vm_end, vma->vm_start); | |
300 | i++; | |
301 | pn = nd; | |
302 | } | |
303 | j = 0; | |
304 | for (nd = pn; nd; nd = rb_prev(nd)) { | |
305 | j++; | |
306 | } | |
307 | if (i != j) | |
308 | printk("backwards %d, forwards %d\n", j, i), i = 0; | |
309 | return i; | |
310 | } | |
311 | ||
312 | void validate_mm(struct mm_struct *mm) | |
313 | { | |
314 | int bug = 0; | |
315 | int i = 0; | |
316 | struct vm_area_struct *tmp = mm->mmap; | |
317 | while (tmp) { | |
318 | tmp = tmp->vm_next; | |
319 | i++; | |
320 | } | |
321 | if (i != mm->map_count) | |
322 | printk("map_count %d vm_next %d\n", mm->map_count, i), bug = 1; | |
323 | i = browse_rb(&mm->mm_rb); | |
324 | if (i != mm->map_count) | |
325 | printk("map_count %d rb %d\n", mm->map_count, i), bug = 1; | |
46a350ef | 326 | BUG_ON(bug); |
1da177e4 LT |
327 | } |
328 | #else | |
329 | #define validate_mm(mm) do { } while (0) | |
330 | #endif | |
331 | ||
332 | static struct vm_area_struct * | |
333 | find_vma_prepare(struct mm_struct *mm, unsigned long addr, | |
334 | struct vm_area_struct **pprev, struct rb_node ***rb_link, | |
335 | struct rb_node ** rb_parent) | |
336 | { | |
337 | struct vm_area_struct * vma; | |
338 | struct rb_node ** __rb_link, * __rb_parent, * rb_prev; | |
339 | ||
340 | __rb_link = &mm->mm_rb.rb_node; | |
341 | rb_prev = __rb_parent = NULL; | |
342 | vma = NULL; | |
343 | ||
344 | while (*__rb_link) { | |
345 | struct vm_area_struct *vma_tmp; | |
346 | ||
347 | __rb_parent = *__rb_link; | |
348 | vma_tmp = rb_entry(__rb_parent, struct vm_area_struct, vm_rb); | |
349 | ||
350 | if (vma_tmp->vm_end > addr) { | |
351 | vma = vma_tmp; | |
352 | if (vma_tmp->vm_start <= addr) | |
353 | return vma; | |
354 | __rb_link = &__rb_parent->rb_left; | |
355 | } else { | |
356 | rb_prev = __rb_parent; | |
357 | __rb_link = &__rb_parent->rb_right; | |
358 | } | |
359 | } | |
360 | ||
361 | *pprev = NULL; | |
362 | if (rb_prev) | |
363 | *pprev = rb_entry(rb_prev, struct vm_area_struct, vm_rb); | |
364 | *rb_link = __rb_link; | |
365 | *rb_parent = __rb_parent; | |
366 | return vma; | |
367 | } | |
368 | ||
369 | static inline void | |
370 | __vma_link_list(struct mm_struct *mm, struct vm_area_struct *vma, | |
371 | struct vm_area_struct *prev, struct rb_node *rb_parent) | |
372 | { | |
373 | if (prev) { | |
374 | vma->vm_next = prev->vm_next; | |
375 | prev->vm_next = vma; | |
376 | } else { | |
377 | mm->mmap = vma; | |
378 | if (rb_parent) | |
379 | vma->vm_next = rb_entry(rb_parent, | |
380 | struct vm_area_struct, vm_rb); | |
381 | else | |
382 | vma->vm_next = NULL; | |
383 | } | |
384 | } | |
385 | ||
386 | void __vma_link_rb(struct mm_struct *mm, struct vm_area_struct *vma, | |
387 | struct rb_node **rb_link, struct rb_node *rb_parent) | |
388 | { | |
389 | rb_link_node(&vma->vm_rb, rb_parent, rb_link); | |
390 | rb_insert_color(&vma->vm_rb, &mm->mm_rb); | |
391 | } | |
392 | ||
393 | static inline void __vma_link_file(struct vm_area_struct *vma) | |
394 | { | |
395 | struct file * file; | |
396 | ||
397 | file = vma->vm_file; | |
398 | if (file) { | |
399 | struct address_space *mapping = file->f_mapping; | |
400 | ||
401 | if (vma->vm_flags & VM_DENYWRITE) | |
402 | atomic_dec(&file->f_dentry->d_inode->i_writecount); | |
403 | if (vma->vm_flags & VM_SHARED) | |
404 | mapping->i_mmap_writable++; | |
405 | ||
406 | flush_dcache_mmap_lock(mapping); | |
407 | if (unlikely(vma->vm_flags & VM_NONLINEAR)) | |
408 | vma_nonlinear_insert(vma, &mapping->i_mmap_nonlinear); | |
409 | else | |
410 | vma_prio_tree_insert(vma, &mapping->i_mmap); | |
411 | flush_dcache_mmap_unlock(mapping); | |
412 | } | |
413 | } | |
414 | ||
415 | static void | |
416 | __vma_link(struct mm_struct *mm, struct vm_area_struct *vma, | |
417 | struct vm_area_struct *prev, struct rb_node **rb_link, | |
418 | struct rb_node *rb_parent) | |
419 | { | |
420 | __vma_link_list(mm, vma, prev, rb_parent); | |
421 | __vma_link_rb(mm, vma, rb_link, rb_parent); | |
422 | __anon_vma_link(vma); | |
423 | } | |
424 | ||
425 | static void vma_link(struct mm_struct *mm, struct vm_area_struct *vma, | |
426 | struct vm_area_struct *prev, struct rb_node **rb_link, | |
427 | struct rb_node *rb_parent) | |
428 | { | |
429 | struct address_space *mapping = NULL; | |
430 | ||
431 | if (vma->vm_file) | |
432 | mapping = vma->vm_file->f_mapping; | |
433 | ||
434 | if (mapping) { | |
435 | spin_lock(&mapping->i_mmap_lock); | |
436 | vma->vm_truncate_count = mapping->truncate_count; | |
437 | } | |
438 | anon_vma_lock(vma); | |
439 | ||
440 | __vma_link(mm, vma, prev, rb_link, rb_parent); | |
441 | __vma_link_file(vma); | |
442 | ||
443 | anon_vma_unlock(vma); | |
444 | if (mapping) | |
445 | spin_unlock(&mapping->i_mmap_lock); | |
446 | ||
447 | mm->map_count++; | |
448 | validate_mm(mm); | |
449 | } | |
450 | ||
451 | /* | |
452 | * Helper for vma_adjust in the split_vma insert case: | |
453 | * insert vm structure into list and rbtree and anon_vma, | |
454 | * but it has already been inserted into prio_tree earlier. | |
455 | */ | |
456 | static void | |
457 | __insert_vm_struct(struct mm_struct * mm, struct vm_area_struct * vma) | |
458 | { | |
459 | struct vm_area_struct * __vma, * prev; | |
460 | struct rb_node ** rb_link, * rb_parent; | |
461 | ||
462 | __vma = find_vma_prepare(mm, vma->vm_start,&prev, &rb_link, &rb_parent); | |
46a350ef | 463 | BUG_ON(__vma && __vma->vm_start < vma->vm_end); |
1da177e4 LT |
464 | __vma_link(mm, vma, prev, rb_link, rb_parent); |
465 | mm->map_count++; | |
466 | } | |
467 | ||
468 | static inline void | |
469 | __vma_unlink(struct mm_struct *mm, struct vm_area_struct *vma, | |
470 | struct vm_area_struct *prev) | |
471 | { | |
472 | prev->vm_next = vma->vm_next; | |
473 | rb_erase(&vma->vm_rb, &mm->mm_rb); | |
474 | if (mm->mmap_cache == vma) | |
475 | mm->mmap_cache = prev; | |
476 | } | |
477 | ||
478 | /* | |
479 | * We cannot adjust vm_start, vm_end, vm_pgoff fields of a vma that | |
480 | * is already present in an i_mmap tree without adjusting the tree. | |
481 | * The following helper function should be used when such adjustments | |
482 | * are necessary. The "insert" vma (if any) is to be inserted | |
483 | * before we drop the necessary locks. | |
484 | */ | |
485 | void vma_adjust(struct vm_area_struct *vma, unsigned long start, | |
486 | unsigned long end, pgoff_t pgoff, struct vm_area_struct *insert) | |
487 | { | |
488 | struct mm_struct *mm = vma->vm_mm; | |
489 | struct vm_area_struct *next = vma->vm_next; | |
490 | struct vm_area_struct *importer = NULL; | |
491 | struct address_space *mapping = NULL; | |
492 | struct prio_tree_root *root = NULL; | |
493 | struct file *file = vma->vm_file; | |
494 | struct anon_vma *anon_vma = NULL; | |
495 | long adjust_next = 0; | |
496 | int remove_next = 0; | |
497 | ||
498 | if (next && !insert) { | |
499 | if (end >= next->vm_end) { | |
500 | /* | |
501 | * vma expands, overlapping all the next, and | |
502 | * perhaps the one after too (mprotect case 6). | |
503 | */ | |
504 | again: remove_next = 1 + (end > next->vm_end); | |
505 | end = next->vm_end; | |
506 | anon_vma = next->anon_vma; | |
507 | importer = vma; | |
508 | } else if (end > next->vm_start) { | |
509 | /* | |
510 | * vma expands, overlapping part of the next: | |
511 | * mprotect case 5 shifting the boundary up. | |
512 | */ | |
513 | adjust_next = (end - next->vm_start) >> PAGE_SHIFT; | |
514 | anon_vma = next->anon_vma; | |
515 | importer = vma; | |
516 | } else if (end < vma->vm_end) { | |
517 | /* | |
518 | * vma shrinks, and !insert tells it's not | |
519 | * split_vma inserting another: so it must be | |
520 | * mprotect case 4 shifting the boundary down. | |
521 | */ | |
522 | adjust_next = - ((vma->vm_end - end) >> PAGE_SHIFT); | |
523 | anon_vma = next->anon_vma; | |
524 | importer = next; | |
525 | } | |
526 | } | |
527 | ||
528 | if (file) { | |
529 | mapping = file->f_mapping; | |
530 | if (!(vma->vm_flags & VM_NONLINEAR)) | |
531 | root = &mapping->i_mmap; | |
532 | spin_lock(&mapping->i_mmap_lock); | |
533 | if (importer && | |
534 | vma->vm_truncate_count != next->vm_truncate_count) { | |
535 | /* | |
536 | * unmap_mapping_range might be in progress: | |
537 | * ensure that the expanding vma is rescanned. | |
538 | */ | |
539 | importer->vm_truncate_count = 0; | |
540 | } | |
541 | if (insert) { | |
542 | insert->vm_truncate_count = vma->vm_truncate_count; | |
543 | /* | |
544 | * Put into prio_tree now, so instantiated pages | |
545 | * are visible to arm/parisc __flush_dcache_page | |
546 | * throughout; but we cannot insert into address | |
547 | * space until vma start or end is updated. | |
548 | */ | |
549 | __vma_link_file(insert); | |
550 | } | |
551 | } | |
552 | ||
553 | /* | |
554 | * When changing only vma->vm_end, we don't really need | |
555 | * anon_vma lock: but is that case worth optimizing out? | |
556 | */ | |
557 | if (vma->anon_vma) | |
558 | anon_vma = vma->anon_vma; | |
559 | if (anon_vma) { | |
560 | spin_lock(&anon_vma->lock); | |
561 | /* | |
562 | * Easily overlooked: when mprotect shifts the boundary, | |
563 | * make sure the expanding vma has anon_vma set if the | |
564 | * shrinking vma had, to cover any anon pages imported. | |
565 | */ | |
566 | if (importer && !importer->anon_vma) { | |
567 | importer->anon_vma = anon_vma; | |
568 | __anon_vma_link(importer); | |
569 | } | |
570 | } | |
571 | ||
572 | if (root) { | |
573 | flush_dcache_mmap_lock(mapping); | |
574 | vma_prio_tree_remove(vma, root); | |
575 | if (adjust_next) | |
576 | vma_prio_tree_remove(next, root); | |
577 | } | |
578 | ||
579 | vma->vm_start = start; | |
580 | vma->vm_end = end; | |
581 | vma->vm_pgoff = pgoff; | |
582 | if (adjust_next) { | |
583 | next->vm_start += adjust_next << PAGE_SHIFT; | |
584 | next->vm_pgoff += adjust_next; | |
585 | } | |
586 | ||
587 | if (root) { | |
588 | if (adjust_next) | |
589 | vma_prio_tree_insert(next, root); | |
590 | vma_prio_tree_insert(vma, root); | |
591 | flush_dcache_mmap_unlock(mapping); | |
592 | } | |
593 | ||
594 | if (remove_next) { | |
595 | /* | |
596 | * vma_merge has merged next into vma, and needs | |
597 | * us to remove next before dropping the locks. | |
598 | */ | |
599 | __vma_unlink(mm, next, vma); | |
600 | if (file) | |
601 | __remove_shared_vm_struct(next, file, mapping); | |
602 | if (next->anon_vma) | |
603 | __anon_vma_merge(vma, next); | |
604 | } else if (insert) { | |
605 | /* | |
606 | * split_vma has split insert from vma, and needs | |
607 | * us to insert it before dropping the locks | |
608 | * (it may either follow vma or precede it). | |
609 | */ | |
610 | __insert_vm_struct(mm, insert); | |
611 | } | |
612 | ||
613 | if (anon_vma) | |
614 | spin_unlock(&anon_vma->lock); | |
615 | if (mapping) | |
616 | spin_unlock(&mapping->i_mmap_lock); | |
617 | ||
618 | if (remove_next) { | |
619 | if (file) | |
620 | fput(file); | |
621 | mm->map_count--; | |
622 | mpol_free(vma_policy(next)); | |
623 | kmem_cache_free(vm_area_cachep, next); | |
624 | /* | |
625 | * In mprotect's case 6 (see comments on vma_merge), | |
626 | * we must remove another next too. It would clutter | |
627 | * up the code too much to do both in one go. | |
628 | */ | |
629 | if (remove_next == 2) { | |
630 | next = vma->vm_next; | |
631 | goto again; | |
632 | } | |
633 | } | |
634 | ||
635 | validate_mm(mm); | |
636 | } | |
637 | ||
638 | /* | |
639 | * If the vma has a ->close operation then the driver probably needs to release | |
640 | * per-vma resources, so we don't attempt to merge those. | |
641 | */ | |
a6f563db | 642 | #define VM_SPECIAL (VM_IO | VM_DONTEXPAND | VM_RESERVED | VM_PFNMAP) |
1da177e4 LT |
643 | |
644 | static inline int is_mergeable_vma(struct vm_area_struct *vma, | |
645 | struct file *file, unsigned long vm_flags) | |
646 | { | |
647 | if (vma->vm_flags != vm_flags) | |
648 | return 0; | |
649 | if (vma->vm_file != file) | |
650 | return 0; | |
651 | if (vma->vm_ops && vma->vm_ops->close) | |
652 | return 0; | |
653 | return 1; | |
654 | } | |
655 | ||
656 | static inline int is_mergeable_anon_vma(struct anon_vma *anon_vma1, | |
657 | struct anon_vma *anon_vma2) | |
658 | { | |
659 | return !anon_vma1 || !anon_vma2 || (anon_vma1 == anon_vma2); | |
660 | } | |
661 | ||
662 | /* | |
663 | * Return true if we can merge this (vm_flags,anon_vma,file,vm_pgoff) | |
664 | * in front of (at a lower virtual address and file offset than) the vma. | |
665 | * | |
666 | * We cannot merge two vmas if they have differently assigned (non-NULL) | |
667 | * anon_vmas, nor if same anon_vma is assigned but offsets incompatible. | |
668 | * | |
669 | * We don't check here for the merged mmap wrapping around the end of pagecache | |
670 | * indices (16TB on ia32) because do_mmap_pgoff() does not permit mmap's which | |
671 | * wrap, nor mmaps which cover the final page at index -1UL. | |
672 | */ | |
673 | static int | |
674 | can_vma_merge_before(struct vm_area_struct *vma, unsigned long vm_flags, | |
675 | struct anon_vma *anon_vma, struct file *file, pgoff_t vm_pgoff) | |
676 | { | |
677 | if (is_mergeable_vma(vma, file, vm_flags) && | |
678 | is_mergeable_anon_vma(anon_vma, vma->anon_vma)) { | |
679 | if (vma->vm_pgoff == vm_pgoff) | |
680 | return 1; | |
681 | } | |
682 | return 0; | |
683 | } | |
684 | ||
685 | /* | |
686 | * Return true if we can merge this (vm_flags,anon_vma,file,vm_pgoff) | |
687 | * beyond (at a higher virtual address and file offset than) the vma. | |
688 | * | |
689 | * We cannot merge two vmas if they have differently assigned (non-NULL) | |
690 | * anon_vmas, nor if same anon_vma is assigned but offsets incompatible. | |
691 | */ | |
692 | static int | |
693 | can_vma_merge_after(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 | pgoff_t vm_pglen; | |
699 | vm_pglen = (vma->vm_end - vma->vm_start) >> PAGE_SHIFT; | |
700 | if (vma->vm_pgoff + vm_pglen == vm_pgoff) | |
701 | return 1; | |
702 | } | |
703 | return 0; | |
704 | } | |
705 | ||
706 | /* | |
707 | * Given a mapping request (addr,end,vm_flags,file,pgoff), figure out | |
708 | * whether that can be merged with its predecessor or its successor. | |
709 | * Or both (it neatly fills a hole). | |
710 | * | |
711 | * In most cases - when called for mmap, brk or mremap - [addr,end) is | |
712 | * certain not to be mapped by the time vma_merge is called; but when | |
713 | * called for mprotect, it is certain to be already mapped (either at | |
714 | * an offset within prev, or at the start of next), and the flags of | |
715 | * this area are about to be changed to vm_flags - and the no-change | |
716 | * case has already been eliminated. | |
717 | * | |
718 | * The following mprotect cases have to be considered, where AAAA is | |
719 | * the area passed down from mprotect_fixup, never extending beyond one | |
720 | * vma, PPPPPP is the prev vma specified, and NNNNNN the next vma after: | |
721 | * | |
722 | * AAAA AAAA AAAA AAAA | |
723 | * PPPPPPNNNNNN PPPPPPNNNNNN PPPPPPNNNNNN PPPPNNNNXXXX | |
724 | * cannot merge might become might become might become | |
725 | * PPNNNNNNNNNN PPPPPPPPPPNN PPPPPPPPPPPP 6 or | |
726 | * mmap, brk or case 4 below case 5 below PPPPPPPPXXXX 7 or | |
727 | * mremap move: PPPPNNNNNNNN 8 | |
728 | * AAAA | |
729 | * PPPP NNNN PPPPPPPPPPPP PPPPPPPPNNNN PPPPNNNNNNNN | |
730 | * might become case 1 below case 2 below case 3 below | |
731 | * | |
732 | * Odd one out? Case 8, because it extends NNNN but needs flags of XXXX: | |
733 | * mprotect_fixup updates vm_flags & vm_page_prot on successful return. | |
734 | */ | |
735 | struct vm_area_struct *vma_merge(struct mm_struct *mm, | |
736 | struct vm_area_struct *prev, unsigned long addr, | |
737 | unsigned long end, unsigned long vm_flags, | |
738 | struct anon_vma *anon_vma, struct file *file, | |
739 | pgoff_t pgoff, struct mempolicy *policy) | |
740 | { | |
741 | pgoff_t pglen = (end - addr) >> PAGE_SHIFT; | |
742 | struct vm_area_struct *area, *next; | |
743 | ||
744 | /* | |
745 | * We later require that vma->vm_flags == vm_flags, | |
746 | * so this tests vma->vm_flags & VM_SPECIAL, too. | |
747 | */ | |
748 | if (vm_flags & VM_SPECIAL) | |
749 | return NULL; | |
750 | ||
751 | if (prev) | |
752 | next = prev->vm_next; | |
753 | else | |
754 | next = mm->mmap; | |
755 | area = next; | |
756 | if (next && next->vm_end == end) /* cases 6, 7, 8 */ | |
757 | next = next->vm_next; | |
758 | ||
759 | /* | |
760 | * Can it merge with the predecessor? | |
761 | */ | |
762 | if (prev && prev->vm_end == addr && | |
763 | mpol_equal(vma_policy(prev), policy) && | |
764 | can_vma_merge_after(prev, vm_flags, | |
765 | anon_vma, file, pgoff)) { | |
766 | /* | |
767 | * OK, it can. Can we now merge in the successor as well? | |
768 | */ | |
769 | if (next && end == next->vm_start && | |
770 | mpol_equal(policy, vma_policy(next)) && | |
771 | can_vma_merge_before(next, vm_flags, | |
772 | anon_vma, file, pgoff+pglen) && | |
773 | is_mergeable_anon_vma(prev->anon_vma, | |
774 | next->anon_vma)) { | |
775 | /* cases 1, 6 */ | |
776 | vma_adjust(prev, prev->vm_start, | |
777 | next->vm_end, prev->vm_pgoff, NULL); | |
778 | } else /* cases 2, 5, 7 */ | |
779 | vma_adjust(prev, prev->vm_start, | |
780 | end, prev->vm_pgoff, NULL); | |
781 | return prev; | |
782 | } | |
783 | ||
784 | /* | |
785 | * Can this new request be merged in front of next? | |
786 | */ | |
787 | if (next && end == next->vm_start && | |
788 | mpol_equal(policy, vma_policy(next)) && | |
789 | can_vma_merge_before(next, vm_flags, | |
790 | anon_vma, file, pgoff+pglen)) { | |
791 | if (prev && addr < prev->vm_end) /* case 4 */ | |
792 | vma_adjust(prev, prev->vm_start, | |
793 | addr, prev->vm_pgoff, NULL); | |
794 | else /* cases 3, 8 */ | |
795 | vma_adjust(area, addr, next->vm_end, | |
796 | next->vm_pgoff - pglen, NULL); | |
797 | return area; | |
798 | } | |
799 | ||
800 | return NULL; | |
801 | } | |
802 | ||
803 | /* | |
804 | * find_mergeable_anon_vma is used by anon_vma_prepare, to check | |
805 | * neighbouring vmas for a suitable anon_vma, before it goes off | |
806 | * to allocate a new anon_vma. It checks because a repetitive | |
807 | * sequence of mprotects and faults may otherwise lead to distinct | |
808 | * anon_vmas being allocated, preventing vma merge in subsequent | |
809 | * mprotect. | |
810 | */ | |
811 | struct anon_vma *find_mergeable_anon_vma(struct vm_area_struct *vma) | |
812 | { | |
813 | struct vm_area_struct *near; | |
814 | unsigned long vm_flags; | |
815 | ||
816 | near = vma->vm_next; | |
817 | if (!near) | |
818 | goto try_prev; | |
819 | ||
820 | /* | |
821 | * Since only mprotect tries to remerge vmas, match flags | |
822 | * which might be mprotected into each other later on. | |
823 | * Neither mlock nor madvise tries to remerge at present, | |
824 | * so leave their flags as obstructing a merge. | |
825 | */ | |
826 | vm_flags = vma->vm_flags & ~(VM_READ|VM_WRITE|VM_EXEC); | |
827 | vm_flags |= near->vm_flags & (VM_READ|VM_WRITE|VM_EXEC); | |
828 | ||
829 | if (near->anon_vma && vma->vm_end == near->vm_start && | |
830 | mpol_equal(vma_policy(vma), vma_policy(near)) && | |
831 | can_vma_merge_before(near, vm_flags, | |
832 | NULL, vma->vm_file, vma->vm_pgoff + | |
833 | ((vma->vm_end - vma->vm_start) >> PAGE_SHIFT))) | |
834 | return near->anon_vma; | |
835 | try_prev: | |
836 | /* | |
837 | * It is potentially slow to have to call find_vma_prev here. | |
838 | * But it's only on the first write fault on the vma, not | |
839 | * every time, and we could devise a way to avoid it later | |
840 | * (e.g. stash info in next's anon_vma_node when assigning | |
841 | * an anon_vma, or when trying vma_merge). Another time. | |
842 | */ | |
46a350ef | 843 | BUG_ON(find_vma_prev(vma->vm_mm, vma->vm_start, &near) != vma); |
1da177e4 LT |
844 | if (!near) |
845 | goto none; | |
846 | ||
847 | vm_flags = vma->vm_flags & ~(VM_READ|VM_WRITE|VM_EXEC); | |
848 | vm_flags |= near->vm_flags & (VM_READ|VM_WRITE|VM_EXEC); | |
849 | ||
850 | if (near->anon_vma && near->vm_end == vma->vm_start && | |
851 | mpol_equal(vma_policy(near), vma_policy(vma)) && | |
852 | can_vma_merge_after(near, vm_flags, | |
853 | NULL, vma->vm_file, vma->vm_pgoff)) | |
854 | return near->anon_vma; | |
855 | none: | |
856 | /* | |
857 | * There's no absolute need to look only at touching neighbours: | |
858 | * we could search further afield for "compatible" anon_vmas. | |
859 | * But it would probably just be a waste of time searching, | |
860 | * or lead to too many vmas hanging off the same anon_vma. | |
861 | * We're trying to allow mprotect remerging later on, | |
862 | * not trying to minimize memory used for anon_vmas. | |
863 | */ | |
864 | return NULL; | |
865 | } | |
866 | ||
867 | #ifdef CONFIG_PROC_FS | |
ab50b8ed | 868 | void vm_stat_account(struct mm_struct *mm, unsigned long flags, |
1da177e4 LT |
869 | struct file *file, long pages) |
870 | { | |
871 | const unsigned long stack_flags | |
872 | = VM_STACK_FLAGS & (VM_GROWSUP|VM_GROWSDOWN); | |
873 | ||
1da177e4 LT |
874 | if (file) { |
875 | mm->shared_vm += pages; | |
876 | if ((flags & (VM_EXEC|VM_WRITE)) == VM_EXEC) | |
877 | mm->exec_vm += pages; | |
878 | } else if (flags & stack_flags) | |
879 | mm->stack_vm += pages; | |
880 | if (flags & (VM_RESERVED|VM_IO)) | |
881 | mm->reserved_vm += pages; | |
882 | } | |
883 | #endif /* CONFIG_PROC_FS */ | |
884 | ||
885 | /* | |
886 | * The caller must hold down_write(current->mm->mmap_sem). | |
887 | */ | |
888 | ||
889 | unsigned long do_mmap_pgoff(struct file * file, unsigned long addr, | |
890 | unsigned long len, unsigned long prot, | |
891 | unsigned long flags, unsigned long pgoff) | |
892 | { | |
893 | struct mm_struct * mm = current->mm; | |
894 | struct vm_area_struct * vma, * prev; | |
895 | struct inode *inode; | |
896 | unsigned int vm_flags; | |
897 | int correct_wcount = 0; | |
898 | int error; | |
899 | struct rb_node ** rb_link, * rb_parent; | |
900 | int accountable = 1; | |
901 | unsigned long charged = 0, reqprot = prot; | |
902 | ||
903 | if (file) { | |
904 | if (is_file_hugepages(file)) | |
905 | accountable = 0; | |
906 | ||
907 | if (!file->f_op || !file->f_op->mmap) | |
908 | return -ENODEV; | |
909 | ||
910 | if ((prot & PROT_EXEC) && | |
911 | (file->f_vfsmnt->mnt_flags & MNT_NOEXEC)) | |
912 | return -EPERM; | |
913 | } | |
914 | /* | |
915 | * Does the application expect PROT_READ to imply PROT_EXEC? | |
916 | * | |
917 | * (the exception is when the underlying filesystem is noexec | |
918 | * mounted, in which case we dont add PROT_EXEC.) | |
919 | */ | |
920 | if ((prot & PROT_READ) && (current->personality & READ_IMPLIES_EXEC)) | |
921 | if (!(file && (file->f_vfsmnt->mnt_flags & MNT_NOEXEC))) | |
922 | prot |= PROT_EXEC; | |
923 | ||
924 | if (!len) | |
925 | return -EINVAL; | |
926 | ||
3a459756 KK |
927 | error = arch_mmap_check(addr, len, flags); |
928 | if (error) | |
929 | return error; | |
930 | ||
1da177e4 LT |
931 | /* Careful about overflows.. */ |
932 | len = PAGE_ALIGN(len); | |
933 | if (!len || len > TASK_SIZE) | |
934 | return -ENOMEM; | |
935 | ||
936 | /* offset overflow? */ | |
937 | if ((pgoff + (len >> PAGE_SHIFT)) < pgoff) | |
938 | return -EOVERFLOW; | |
939 | ||
940 | /* Too many mappings? */ | |
941 | if (mm->map_count > sysctl_max_map_count) | |
942 | return -ENOMEM; | |
943 | ||
944 | /* Obtain the address to map to. we verify (or select) it and ensure | |
945 | * that it represents a valid section of the address space. | |
946 | */ | |
947 | addr = get_unmapped_area(file, addr, len, pgoff, flags); | |
948 | if (addr & ~PAGE_MASK) | |
949 | return addr; | |
950 | ||
951 | /* Do simple checking here so the lower-level routines won't have | |
952 | * to. we assume access permissions have been handled by the open | |
953 | * of the memory object, so we don't do any here. | |
954 | */ | |
955 | vm_flags = calc_vm_prot_bits(prot) | calc_vm_flag_bits(flags) | | |
956 | mm->def_flags | VM_MAYREAD | VM_MAYWRITE | VM_MAYEXEC; | |
957 | ||
958 | if (flags & MAP_LOCKED) { | |
959 | if (!can_do_mlock()) | |
960 | return -EPERM; | |
961 | vm_flags |= VM_LOCKED; | |
962 | } | |
963 | /* mlock MCL_FUTURE? */ | |
964 | if (vm_flags & VM_LOCKED) { | |
965 | unsigned long locked, lock_limit; | |
93ea1d0a CW |
966 | locked = len >> PAGE_SHIFT; |
967 | locked += mm->locked_vm; | |
1da177e4 | 968 | lock_limit = current->signal->rlim[RLIMIT_MEMLOCK].rlim_cur; |
93ea1d0a | 969 | lock_limit >>= PAGE_SHIFT; |
1da177e4 LT |
970 | if (locked > lock_limit && !capable(CAP_IPC_LOCK)) |
971 | return -EAGAIN; | |
972 | } | |
973 | ||
974 | inode = file ? file->f_dentry->d_inode : NULL; | |
975 | ||
976 | if (file) { | |
977 | switch (flags & MAP_TYPE) { | |
978 | case MAP_SHARED: | |
979 | if ((prot&PROT_WRITE) && !(file->f_mode&FMODE_WRITE)) | |
980 | return -EACCES; | |
981 | ||
982 | /* | |
983 | * Make sure we don't allow writing to an append-only | |
984 | * file.. | |
985 | */ | |
986 | if (IS_APPEND(inode) && (file->f_mode & FMODE_WRITE)) | |
987 | return -EACCES; | |
988 | ||
989 | /* | |
990 | * Make sure there are no mandatory locks on the file. | |
991 | */ | |
992 | if (locks_verify_locked(inode)) | |
993 | return -EAGAIN; | |
994 | ||
995 | vm_flags |= VM_SHARED | VM_MAYSHARE; | |
996 | if (!(file->f_mode & FMODE_WRITE)) | |
997 | vm_flags &= ~(VM_MAYWRITE | VM_SHARED); | |
998 | ||
999 | /* fall through */ | |
1000 | case MAP_PRIVATE: | |
1001 | if (!(file->f_mode & FMODE_READ)) | |
1002 | return -EACCES; | |
1003 | break; | |
1004 | ||
1005 | default: | |
1006 | return -EINVAL; | |
1007 | } | |
1008 | } else { | |
1009 | switch (flags & MAP_TYPE) { | |
1010 | case MAP_SHARED: | |
1011 | vm_flags |= VM_SHARED | VM_MAYSHARE; | |
1012 | break; | |
1013 | case MAP_PRIVATE: | |
1014 | /* | |
1015 | * Set pgoff according to addr for anon_vma. | |
1016 | */ | |
1017 | pgoff = addr >> PAGE_SHIFT; | |
1018 | break; | |
1019 | default: | |
1020 | return -EINVAL; | |
1021 | } | |
1022 | } | |
1023 | ||
1024 | error = security_file_mmap(file, reqprot, prot, flags); | |
1025 | if (error) | |
1026 | return error; | |
1027 | ||
1028 | /* Clear old maps */ | |
1029 | error = -ENOMEM; | |
1030 | munmap_back: | |
1031 | vma = find_vma_prepare(mm, addr, &prev, &rb_link, &rb_parent); | |
1032 | if (vma && vma->vm_start < addr + len) { | |
1033 | if (do_munmap(mm, addr, len)) | |
1034 | return -ENOMEM; | |
1035 | goto munmap_back; | |
1036 | } | |
1037 | ||
1038 | /* Check against address space limit. */ | |
119f657c | 1039 | if (!may_expand_vm(mm, len >> PAGE_SHIFT)) |
1da177e4 LT |
1040 | return -ENOMEM; |
1041 | ||
1042 | if (accountable && (!(flags & MAP_NORESERVE) || | |
1043 | sysctl_overcommit_memory == OVERCOMMIT_NEVER)) { | |
1044 | if (vm_flags & VM_SHARED) { | |
1045 | /* Check memory availability in shmem_file_setup? */ | |
1046 | vm_flags |= VM_ACCOUNT; | |
1047 | } else if (vm_flags & VM_WRITE) { | |
1048 | /* | |
1049 | * Private writable mapping: check memory availability | |
1050 | */ | |
1051 | charged = len >> PAGE_SHIFT; | |
1052 | if (security_vm_enough_memory(charged)) | |
1053 | return -ENOMEM; | |
1054 | vm_flags |= VM_ACCOUNT; | |
1055 | } | |
1056 | } | |
1057 | ||
1058 | /* | |
1059 | * Can we just expand an old private anonymous mapping? | |
1060 | * The VM_SHARED test is necessary because shmem_zero_setup | |
1061 | * will create the file object for a shared anonymous map below. | |
1062 | */ | |
1063 | if (!file && !(vm_flags & VM_SHARED) && | |
1064 | vma_merge(mm, prev, addr, addr + len, vm_flags, | |
1065 | NULL, NULL, pgoff, NULL)) | |
1066 | goto out; | |
1067 | ||
1068 | /* | |
1069 | * Determine the object being mapped and call the appropriate | |
1070 | * specific mapper. the address has already been validated, but | |
1071 | * not unmapped, but the maps are removed from the list. | |
1072 | */ | |
c5e3b83e | 1073 | vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL); |
1da177e4 LT |
1074 | if (!vma) { |
1075 | error = -ENOMEM; | |
1076 | goto unacct_error; | |
1077 | } | |
1da177e4 LT |
1078 | |
1079 | vma->vm_mm = mm; | |
1080 | vma->vm_start = addr; | |
1081 | vma->vm_end = addr + len; | |
1082 | vma->vm_flags = vm_flags; | |
9637a5ef DH |
1083 | vma->vm_page_prot = protection_map[vm_flags & |
1084 | (VM_READ|VM_WRITE|VM_EXEC|VM_SHARED)]; | |
1da177e4 LT |
1085 | vma->vm_pgoff = pgoff; |
1086 | ||
1087 | if (file) { | |
1088 | error = -EINVAL; | |
1089 | if (vm_flags & (VM_GROWSDOWN|VM_GROWSUP)) | |
1090 | goto free_vma; | |
1091 | if (vm_flags & VM_DENYWRITE) { | |
1092 | error = deny_write_access(file); | |
1093 | if (error) | |
1094 | goto free_vma; | |
1095 | correct_wcount = 1; | |
1096 | } | |
1097 | vma->vm_file = file; | |
1098 | get_file(file); | |
1099 | error = file->f_op->mmap(file, vma); | |
1100 | if (error) | |
1101 | goto unmap_and_free_vma; | |
1102 | } else if (vm_flags & VM_SHARED) { | |
1103 | error = shmem_zero_setup(vma); | |
1104 | if (error) | |
1105 | goto free_vma; | |
1106 | } | |
1107 | ||
1108 | /* We set VM_ACCOUNT in a shared mapping's vm_flags, to inform | |
1109 | * shmem_zero_setup (perhaps called through /dev/zero's ->mmap) | |
1110 | * that memory reservation must be checked; but that reservation | |
1111 | * belongs to shared memory object, not to vma: so now clear it. | |
1112 | */ | |
1113 | if ((vm_flags & (VM_SHARED|VM_ACCOUNT)) == (VM_SHARED|VM_ACCOUNT)) | |
1114 | vma->vm_flags &= ~VM_ACCOUNT; | |
1115 | ||
1116 | /* Can addr have changed?? | |
1117 | * | |
1118 | * Answer: Yes, several device drivers can do it in their | |
1119 | * f_op->mmap method. -DaveM | |
1120 | */ | |
1121 | addr = vma->vm_start; | |
1122 | pgoff = vma->vm_pgoff; | |
1123 | vm_flags = vma->vm_flags; | |
1124 | ||
d08b3851 PZ |
1125 | if (vma_wants_writenotify(vma)) |
1126 | vma->vm_page_prot = | |
1127 | protection_map[vm_flags & (VM_READ|VM_WRITE|VM_EXEC)]; | |
1128 | ||
1da177e4 LT |
1129 | if (!file || !vma_merge(mm, prev, addr, vma->vm_end, |
1130 | vma->vm_flags, NULL, file, pgoff, vma_policy(vma))) { | |
1131 | file = vma->vm_file; | |
1132 | vma_link(mm, vma, prev, rb_link, rb_parent); | |
1133 | if (correct_wcount) | |
1134 | atomic_inc(&inode->i_writecount); | |
1135 | } else { | |
1136 | if (file) { | |
1137 | if (correct_wcount) | |
1138 | atomic_inc(&inode->i_writecount); | |
1139 | fput(file); | |
1140 | } | |
1141 | mpol_free(vma_policy(vma)); | |
1142 | kmem_cache_free(vm_area_cachep, vma); | |
1143 | } | |
1144 | out: | |
1145 | mm->total_vm += len >> PAGE_SHIFT; | |
ab50b8ed | 1146 | vm_stat_account(mm, vm_flags, file, len >> PAGE_SHIFT); |
1da177e4 LT |
1147 | if (vm_flags & VM_LOCKED) { |
1148 | mm->locked_vm += len >> PAGE_SHIFT; | |
1149 | make_pages_present(addr, addr + len); | |
1150 | } | |
1151 | if (flags & MAP_POPULATE) { | |
1152 | up_write(&mm->mmap_sem); | |
1153 | sys_remap_file_pages(addr, len, 0, | |
1154 | pgoff, flags & MAP_NONBLOCK); | |
1155 | down_write(&mm->mmap_sem); | |
1156 | } | |
1157 | return addr; | |
1158 | ||
1159 | unmap_and_free_vma: | |
1160 | if (correct_wcount) | |
1161 | atomic_inc(&inode->i_writecount); | |
1162 | vma->vm_file = NULL; | |
1163 | fput(file); | |
1164 | ||
1165 | /* Undo any partial mapping done by a device driver. */ | |
e0da382c HD |
1166 | unmap_region(mm, vma, prev, vma->vm_start, vma->vm_end); |
1167 | charged = 0; | |
1da177e4 LT |
1168 | free_vma: |
1169 | kmem_cache_free(vm_area_cachep, vma); | |
1170 | unacct_error: | |
1171 | if (charged) | |
1172 | vm_unacct_memory(charged); | |
1173 | return error; | |
1174 | } | |
1175 | ||
1176 | EXPORT_SYMBOL(do_mmap_pgoff); | |
1177 | ||
1178 | /* Get an address range which is currently unmapped. | |
1179 | * For shmat() with addr=0. | |
1180 | * | |
1181 | * Ugly calling convention alert: | |
1182 | * Return value with the low bits set means error value, | |
1183 | * ie | |
1184 | * if (ret & ~PAGE_MASK) | |
1185 | * error = ret; | |
1186 | * | |
1187 | * This function "knows" that -ENOMEM has the bits set. | |
1188 | */ | |
1189 | #ifndef HAVE_ARCH_UNMAPPED_AREA | |
1190 | unsigned long | |
1191 | arch_get_unmapped_area(struct file *filp, unsigned long addr, | |
1192 | unsigned long len, unsigned long pgoff, unsigned long flags) | |
1193 | { | |
1194 | struct mm_struct *mm = current->mm; | |
1195 | struct vm_area_struct *vma; | |
1196 | unsigned long start_addr; | |
1197 | ||
1198 | if (len > TASK_SIZE) | |
1199 | return -ENOMEM; | |
1200 | ||
1201 | if (addr) { | |
1202 | addr = PAGE_ALIGN(addr); | |
1203 | vma = find_vma(mm, addr); | |
1204 | if (TASK_SIZE - len >= addr && | |
1205 | (!vma || addr + len <= vma->vm_start)) | |
1206 | return addr; | |
1207 | } | |
1363c3cd WW |
1208 | if (len > mm->cached_hole_size) { |
1209 | start_addr = addr = mm->free_area_cache; | |
1210 | } else { | |
1211 | start_addr = addr = TASK_UNMAPPED_BASE; | |
1212 | mm->cached_hole_size = 0; | |
1213 | } | |
1da177e4 LT |
1214 | |
1215 | full_search: | |
1216 | for (vma = find_vma(mm, addr); ; vma = vma->vm_next) { | |
1217 | /* At this point: (!vma || addr < vma->vm_end). */ | |
1218 | if (TASK_SIZE - len < addr) { | |
1219 | /* | |
1220 | * Start a new search - just in case we missed | |
1221 | * some holes. | |
1222 | */ | |
1223 | if (start_addr != TASK_UNMAPPED_BASE) { | |
1363c3cd WW |
1224 | addr = TASK_UNMAPPED_BASE; |
1225 | start_addr = addr; | |
1226 | mm->cached_hole_size = 0; | |
1da177e4 LT |
1227 | goto full_search; |
1228 | } | |
1229 | return -ENOMEM; | |
1230 | } | |
1231 | if (!vma || addr + len <= vma->vm_start) { | |
1232 | /* | |
1233 | * Remember the place where we stopped the search: | |
1234 | */ | |
1235 | mm->free_area_cache = addr + len; | |
1236 | return addr; | |
1237 | } | |
1363c3cd WW |
1238 | if (addr + mm->cached_hole_size < vma->vm_start) |
1239 | mm->cached_hole_size = vma->vm_start - addr; | |
1da177e4 LT |
1240 | addr = vma->vm_end; |
1241 | } | |
1242 | } | |
1243 | #endif | |
1244 | ||
1363c3cd | 1245 | void arch_unmap_area(struct mm_struct *mm, unsigned long addr) |
1da177e4 LT |
1246 | { |
1247 | /* | |
1248 | * Is this a new hole at the lowest possible address? | |
1249 | */ | |
1363c3cd WW |
1250 | if (addr >= TASK_UNMAPPED_BASE && addr < mm->free_area_cache) { |
1251 | mm->free_area_cache = addr; | |
1252 | mm->cached_hole_size = ~0UL; | |
1253 | } | |
1da177e4 LT |
1254 | } |
1255 | ||
1256 | /* | |
1257 | * This mmap-allocator allocates new areas top-down from below the | |
1258 | * stack's low limit (the base): | |
1259 | */ | |
1260 | #ifndef HAVE_ARCH_UNMAPPED_AREA_TOPDOWN | |
1261 | unsigned long | |
1262 | arch_get_unmapped_area_topdown(struct file *filp, const unsigned long addr0, | |
1263 | const unsigned long len, const unsigned long pgoff, | |
1264 | const unsigned long flags) | |
1265 | { | |
1266 | struct vm_area_struct *vma; | |
1267 | struct mm_struct *mm = current->mm; | |
1268 | unsigned long addr = addr0; | |
1269 | ||
1270 | /* requested length too big for entire address space */ | |
1271 | if (len > TASK_SIZE) | |
1272 | return -ENOMEM; | |
1273 | ||
1274 | /* requesting a specific address */ | |
1275 | if (addr) { | |
1276 | addr = PAGE_ALIGN(addr); | |
1277 | vma = find_vma(mm, addr); | |
1278 | if (TASK_SIZE - len >= addr && | |
1279 | (!vma || addr + len <= vma->vm_start)) | |
1280 | return addr; | |
1281 | } | |
1282 | ||
1363c3cd WW |
1283 | /* check if free_area_cache is useful for us */ |
1284 | if (len <= mm->cached_hole_size) { | |
1285 | mm->cached_hole_size = 0; | |
1286 | mm->free_area_cache = mm->mmap_base; | |
1287 | } | |
1288 | ||
1da177e4 LT |
1289 | /* either no address requested or can't fit in requested address hole */ |
1290 | addr = mm->free_area_cache; | |
1291 | ||
1292 | /* make sure it can fit in the remaining address space */ | |
49a43876 | 1293 | if (addr > len) { |
1da177e4 LT |
1294 | vma = find_vma(mm, addr-len); |
1295 | if (!vma || addr <= vma->vm_start) | |
1296 | /* remember the address as a hint for next time */ | |
1297 | return (mm->free_area_cache = addr-len); | |
1298 | } | |
1299 | ||
73219d17 CW |
1300 | if (mm->mmap_base < len) |
1301 | goto bottomup; | |
1302 | ||
1da177e4 LT |
1303 | addr = mm->mmap_base-len; |
1304 | ||
1305 | do { | |
1306 | /* | |
1307 | * Lookup failure means no vma is above this address, | |
1308 | * else if new region fits below vma->vm_start, | |
1309 | * return with success: | |
1310 | */ | |
1311 | vma = find_vma(mm, addr); | |
1312 | if (!vma || addr+len <= vma->vm_start) | |
1313 | /* remember the address as a hint for next time */ | |
1314 | return (mm->free_area_cache = addr); | |
1315 | ||
1363c3cd WW |
1316 | /* remember the largest hole we saw so far */ |
1317 | if (addr + mm->cached_hole_size < vma->vm_start) | |
1318 | mm->cached_hole_size = vma->vm_start - addr; | |
1319 | ||
1da177e4 LT |
1320 | /* try just below the current vma->vm_start */ |
1321 | addr = vma->vm_start-len; | |
49a43876 | 1322 | } while (len < vma->vm_start); |
1da177e4 | 1323 | |
73219d17 | 1324 | bottomup: |
1da177e4 LT |
1325 | /* |
1326 | * A failed mmap() very likely causes application failure, | |
1327 | * so fall back to the bottom-up function here. This scenario | |
1328 | * can happen with large stack limits and large mmap() | |
1329 | * allocations. | |
1330 | */ | |
1363c3cd WW |
1331 | mm->cached_hole_size = ~0UL; |
1332 | mm->free_area_cache = TASK_UNMAPPED_BASE; | |
1da177e4 LT |
1333 | addr = arch_get_unmapped_area(filp, addr0, len, pgoff, flags); |
1334 | /* | |
1335 | * Restore the topdown base: | |
1336 | */ | |
1337 | mm->free_area_cache = mm->mmap_base; | |
1363c3cd | 1338 | mm->cached_hole_size = ~0UL; |
1da177e4 LT |
1339 | |
1340 | return addr; | |
1341 | } | |
1342 | #endif | |
1343 | ||
1363c3cd | 1344 | void arch_unmap_area_topdown(struct mm_struct *mm, unsigned long addr) |
1da177e4 LT |
1345 | { |
1346 | /* | |
1347 | * Is this a new hole at the highest possible address? | |
1348 | */ | |
1363c3cd WW |
1349 | if (addr > mm->free_area_cache) |
1350 | mm->free_area_cache = addr; | |
1da177e4 LT |
1351 | |
1352 | /* dont allow allocations above current base */ | |
1363c3cd WW |
1353 | if (mm->free_area_cache > mm->mmap_base) |
1354 | mm->free_area_cache = mm->mmap_base; | |
1da177e4 LT |
1355 | } |
1356 | ||
1357 | unsigned long | |
1358 | get_unmapped_area(struct file *file, unsigned long addr, unsigned long len, | |
1359 | unsigned long pgoff, unsigned long flags) | |
1360 | { | |
07ab67c8 | 1361 | unsigned long ret; |
1da177e4 | 1362 | |
07ab67c8 LT |
1363 | if (!(flags & MAP_FIXED)) { |
1364 | unsigned long (*get_area)(struct file *, unsigned long, unsigned long, unsigned long, unsigned long); | |
1da177e4 | 1365 | |
07ab67c8 LT |
1366 | get_area = current->mm->get_unmapped_area; |
1367 | if (file && file->f_op && file->f_op->get_unmapped_area) | |
1368 | get_area = file->f_op->get_unmapped_area; | |
1369 | addr = get_area(file, addr, len, pgoff, flags); | |
1370 | if (IS_ERR_VALUE(addr)) | |
1371 | return addr; | |
1372 | } | |
1da177e4 | 1373 | |
07ab67c8 LT |
1374 | if (addr > TASK_SIZE - len) |
1375 | return -ENOMEM; | |
1376 | if (addr & ~PAGE_MASK) | |
1377 | return -EINVAL; | |
1378 | if (file && is_file_hugepages(file)) { | |
1379 | /* | |
1380 | * Check if the given range is hugepage aligned, and | |
1381 | * can be made suitable for hugepages. | |
1382 | */ | |
1383 | ret = prepare_hugepage_range(addr, len); | |
1384 | } else { | |
1385 | /* | |
1386 | * Ensure that a normal request is not falling in a | |
1387 | * reserved hugepage range. For some archs like IA-64, | |
1388 | * there is a separate region for hugepages. | |
1389 | */ | |
1390 | ret = is_hugepage_only_range(current->mm, addr, len); | |
1391 | } | |
1392 | if (ret) | |
1393 | return -EINVAL; | |
1394 | return addr; | |
1da177e4 LT |
1395 | } |
1396 | ||
1397 | EXPORT_SYMBOL(get_unmapped_area); | |
1398 | ||
1399 | /* Look up the first VMA which satisfies addr < vm_end, NULL if none. */ | |
1400 | struct vm_area_struct * find_vma(struct mm_struct * mm, unsigned long addr) | |
1401 | { | |
1402 | struct vm_area_struct *vma = NULL; | |
1403 | ||
1404 | if (mm) { | |
1405 | /* Check the cache first. */ | |
1406 | /* (Cache hit rate is typically around 35%.) */ | |
1407 | vma = mm->mmap_cache; | |
1408 | if (!(vma && vma->vm_end > addr && vma->vm_start <= addr)) { | |
1409 | struct rb_node * rb_node; | |
1410 | ||
1411 | rb_node = mm->mm_rb.rb_node; | |
1412 | vma = NULL; | |
1413 | ||
1414 | while (rb_node) { | |
1415 | struct vm_area_struct * vma_tmp; | |
1416 | ||
1417 | vma_tmp = rb_entry(rb_node, | |
1418 | struct vm_area_struct, vm_rb); | |
1419 | ||
1420 | if (vma_tmp->vm_end > addr) { | |
1421 | vma = vma_tmp; | |
1422 | if (vma_tmp->vm_start <= addr) | |
1423 | break; | |
1424 | rb_node = rb_node->rb_left; | |
1425 | } else | |
1426 | rb_node = rb_node->rb_right; | |
1427 | } | |
1428 | if (vma) | |
1429 | mm->mmap_cache = vma; | |
1430 | } | |
1431 | } | |
1432 | return vma; | |
1433 | } | |
1434 | ||
1435 | EXPORT_SYMBOL(find_vma); | |
1436 | ||
1437 | /* Same as find_vma, but also return a pointer to the previous VMA in *pprev. */ | |
1438 | struct vm_area_struct * | |
1439 | find_vma_prev(struct mm_struct *mm, unsigned long addr, | |
1440 | struct vm_area_struct **pprev) | |
1441 | { | |
1442 | struct vm_area_struct *vma = NULL, *prev = NULL; | |
1443 | struct rb_node * rb_node; | |
1444 | if (!mm) | |
1445 | goto out; | |
1446 | ||
1447 | /* Guard against addr being lower than the first VMA */ | |
1448 | vma = mm->mmap; | |
1449 | ||
1450 | /* Go through the RB tree quickly. */ | |
1451 | rb_node = mm->mm_rb.rb_node; | |
1452 | ||
1453 | while (rb_node) { | |
1454 | struct vm_area_struct *vma_tmp; | |
1455 | vma_tmp = rb_entry(rb_node, struct vm_area_struct, vm_rb); | |
1456 | ||
1457 | if (addr < vma_tmp->vm_end) { | |
1458 | rb_node = rb_node->rb_left; | |
1459 | } else { | |
1460 | prev = vma_tmp; | |
1461 | if (!prev->vm_next || (addr < prev->vm_next->vm_end)) | |
1462 | break; | |
1463 | rb_node = rb_node->rb_right; | |
1464 | } | |
1465 | } | |
1466 | ||
1467 | out: | |
1468 | *pprev = prev; | |
1469 | return prev ? prev->vm_next : vma; | |
1470 | } | |
1471 | ||
1472 | /* | |
1473 | * Verify that the stack growth is acceptable and | |
1474 | * update accounting. This is shared with both the | |
1475 | * grow-up and grow-down cases. | |
1476 | */ | |
1477 | static int acct_stack_growth(struct vm_area_struct * vma, unsigned long size, unsigned long grow) | |
1478 | { | |
1479 | struct mm_struct *mm = vma->vm_mm; | |
1480 | struct rlimit *rlim = current->signal->rlim; | |
1481 | ||
1482 | /* address space limit tests */ | |
119f657c | 1483 | if (!may_expand_vm(mm, grow)) |
1da177e4 LT |
1484 | return -ENOMEM; |
1485 | ||
1486 | /* Stack limit test */ | |
1487 | if (size > rlim[RLIMIT_STACK].rlim_cur) | |
1488 | return -ENOMEM; | |
1489 | ||
1490 | /* mlock limit tests */ | |
1491 | if (vma->vm_flags & VM_LOCKED) { | |
1492 | unsigned long locked; | |
1493 | unsigned long limit; | |
1494 | locked = mm->locked_vm + grow; | |
1495 | limit = rlim[RLIMIT_MEMLOCK].rlim_cur >> PAGE_SHIFT; | |
1496 | if (locked > limit && !capable(CAP_IPC_LOCK)) | |
1497 | return -ENOMEM; | |
1498 | } | |
1499 | ||
1500 | /* | |
1501 | * Overcommit.. This must be the final test, as it will | |
1502 | * update security statistics. | |
1503 | */ | |
1504 | if (security_vm_enough_memory(grow)) | |
1505 | return -ENOMEM; | |
1506 | ||
1507 | /* Ok, everything looks good - let it rip */ | |
1508 | mm->total_vm += grow; | |
1509 | if (vma->vm_flags & VM_LOCKED) | |
1510 | mm->locked_vm += grow; | |
ab50b8ed | 1511 | vm_stat_account(mm, vma->vm_flags, vma->vm_file, grow); |
1da177e4 LT |
1512 | return 0; |
1513 | } | |
1514 | ||
46dea3d0 | 1515 | #if defined(CONFIG_STACK_GROWSUP) || defined(CONFIG_IA64) |
1da177e4 | 1516 | /* |
46dea3d0 HD |
1517 | * PA-RISC uses this for its stack; IA64 for its Register Backing Store. |
1518 | * vma is the last one with address > vma->vm_end. Have to extend vma. | |
1da177e4 | 1519 | */ |
9ab88515 | 1520 | #ifndef CONFIG_IA64 |
46dea3d0 HD |
1521 | static inline |
1522 | #endif | |
1523 | int expand_upwards(struct vm_area_struct *vma, unsigned long address) | |
1da177e4 LT |
1524 | { |
1525 | int error; | |
1526 | ||
1527 | if (!(vma->vm_flags & VM_GROWSUP)) | |
1528 | return -EFAULT; | |
1529 | ||
1530 | /* | |
1531 | * We must make sure the anon_vma is allocated | |
1532 | * so that the anon_vma locking is not a noop. | |
1533 | */ | |
1534 | if (unlikely(anon_vma_prepare(vma))) | |
1535 | return -ENOMEM; | |
1536 | anon_vma_lock(vma); | |
1537 | ||
1538 | /* | |
1539 | * vma->vm_start/vm_end cannot change under us because the caller | |
1540 | * is required to hold the mmap_sem in read mode. We need the | |
1541 | * anon_vma lock to serialize against concurrent expand_stacks. | |
1542 | */ | |
1543 | address += 4 + PAGE_SIZE - 1; | |
1544 | address &= PAGE_MASK; | |
1545 | error = 0; | |
1546 | ||
1547 | /* Somebody else might have raced and expanded it already */ | |
1548 | if (address > vma->vm_end) { | |
1549 | unsigned long size, grow; | |
1550 | ||
1551 | size = address - vma->vm_start; | |
1552 | grow = (address - vma->vm_end) >> PAGE_SHIFT; | |
1553 | ||
1554 | error = acct_stack_growth(vma, size, grow); | |
1555 | if (!error) | |
1556 | vma->vm_end = address; | |
1557 | } | |
1558 | anon_vma_unlock(vma); | |
1559 | return error; | |
1560 | } | |
46dea3d0 HD |
1561 | #endif /* CONFIG_STACK_GROWSUP || CONFIG_IA64 */ |
1562 | ||
1563 | #ifdef CONFIG_STACK_GROWSUP | |
1564 | int expand_stack(struct vm_area_struct *vma, unsigned long address) | |
1565 | { | |
1566 | return expand_upwards(vma, address); | |
1567 | } | |
1da177e4 LT |
1568 | |
1569 | struct vm_area_struct * | |
1570 | find_extend_vma(struct mm_struct *mm, unsigned long addr) | |
1571 | { | |
1572 | struct vm_area_struct *vma, *prev; | |
1573 | ||
1574 | addr &= PAGE_MASK; | |
1575 | vma = find_vma_prev(mm, addr, &prev); | |
1576 | if (vma && (vma->vm_start <= addr)) | |
1577 | return vma; | |
1578 | if (!prev || expand_stack(prev, addr)) | |
1579 | return NULL; | |
1580 | if (prev->vm_flags & VM_LOCKED) { | |
1581 | make_pages_present(addr, prev->vm_end); | |
1582 | } | |
1583 | return prev; | |
1584 | } | |
1585 | #else | |
1586 | /* | |
1587 | * vma is the first one with address < vma->vm_start. Have to extend vma. | |
1588 | */ | |
1589 | int expand_stack(struct vm_area_struct *vma, unsigned long address) | |
1590 | { | |
1591 | int error; | |
1592 | ||
1593 | /* | |
1594 | * We must make sure the anon_vma is allocated | |
1595 | * so that the anon_vma locking is not a noop. | |
1596 | */ | |
1597 | if (unlikely(anon_vma_prepare(vma))) | |
1598 | return -ENOMEM; | |
1599 | anon_vma_lock(vma); | |
1600 | ||
1601 | /* | |
1602 | * vma->vm_start/vm_end cannot change under us because the caller | |
1603 | * is required to hold the mmap_sem in read mode. We need the | |
1604 | * anon_vma lock to serialize against concurrent expand_stacks. | |
1605 | */ | |
1606 | address &= PAGE_MASK; | |
1607 | error = 0; | |
1608 | ||
1609 | /* Somebody else might have raced and expanded it already */ | |
1610 | if (address < vma->vm_start) { | |
1611 | unsigned long size, grow; | |
1612 | ||
1613 | size = vma->vm_end - address; | |
1614 | grow = (vma->vm_start - address) >> PAGE_SHIFT; | |
1615 | ||
1616 | error = acct_stack_growth(vma, size, grow); | |
1617 | if (!error) { | |
1618 | vma->vm_start = address; | |
1619 | vma->vm_pgoff -= grow; | |
1620 | } | |
1621 | } | |
1622 | anon_vma_unlock(vma); | |
1623 | return error; | |
1624 | } | |
1625 | ||
1626 | struct vm_area_struct * | |
1627 | find_extend_vma(struct mm_struct * mm, unsigned long addr) | |
1628 | { | |
1629 | struct vm_area_struct * vma; | |
1630 | unsigned long start; | |
1631 | ||
1632 | addr &= PAGE_MASK; | |
1633 | vma = find_vma(mm,addr); | |
1634 | if (!vma) | |
1635 | return NULL; | |
1636 | if (vma->vm_start <= addr) | |
1637 | return vma; | |
1638 | if (!(vma->vm_flags & VM_GROWSDOWN)) | |
1639 | return NULL; | |
1640 | start = vma->vm_start; | |
1641 | if (expand_stack(vma, addr)) | |
1642 | return NULL; | |
1643 | if (vma->vm_flags & VM_LOCKED) { | |
1644 | make_pages_present(addr, start); | |
1645 | } | |
1646 | return vma; | |
1647 | } | |
1648 | #endif | |
1649 | ||
1da177e4 | 1650 | /* |
2c0b3814 | 1651 | * Ok - we have the memory areas we should free on the vma list, |
1da177e4 | 1652 | * so release them, and do the vma updates. |
2c0b3814 HD |
1653 | * |
1654 | * Called with the mm semaphore held. | |
1da177e4 | 1655 | */ |
2c0b3814 | 1656 | static void remove_vma_list(struct mm_struct *mm, struct vm_area_struct *vma) |
1da177e4 | 1657 | { |
365e9c87 HD |
1658 | /* Update high watermark before we lower total_vm */ |
1659 | update_hiwater_vm(mm); | |
1da177e4 | 1660 | do { |
2c0b3814 HD |
1661 | long nrpages = vma_pages(vma); |
1662 | ||
1663 | mm->total_vm -= nrpages; | |
1664 | if (vma->vm_flags & VM_LOCKED) | |
1665 | mm->locked_vm -= nrpages; | |
1666 | vm_stat_account(mm, vma->vm_flags, vma->vm_file, -nrpages); | |
a8fb5618 | 1667 | vma = remove_vma(vma); |
146425a3 | 1668 | } while (vma); |
1da177e4 LT |
1669 | validate_mm(mm); |
1670 | } | |
1671 | ||
1672 | /* | |
1673 | * Get rid of page table information in the indicated region. | |
1674 | * | |
f10df686 | 1675 | * Called with the mm semaphore held. |
1da177e4 LT |
1676 | */ |
1677 | static void unmap_region(struct mm_struct *mm, | |
e0da382c HD |
1678 | struct vm_area_struct *vma, struct vm_area_struct *prev, |
1679 | unsigned long start, unsigned long end) | |
1da177e4 | 1680 | { |
e0da382c | 1681 | struct vm_area_struct *next = prev? prev->vm_next: mm->mmap; |
1da177e4 LT |
1682 | struct mmu_gather *tlb; |
1683 | unsigned long nr_accounted = 0; | |
1684 | ||
1685 | lru_add_drain(); | |
1686 | tlb = tlb_gather_mmu(mm, 0); | |
365e9c87 | 1687 | update_hiwater_rss(mm); |
508034a3 | 1688 | unmap_vmas(&tlb, vma, start, end, &nr_accounted, NULL); |
1da177e4 | 1689 | vm_unacct_memory(nr_accounted); |
e2cdef8c | 1690 | free_pgtables(&tlb, vma, prev? prev->vm_end: FIRST_USER_ADDRESS, |
e0da382c | 1691 | next? next->vm_start: 0); |
1da177e4 LT |
1692 | tlb_finish_mmu(tlb, start, end); |
1693 | } | |
1694 | ||
1695 | /* | |
1696 | * Create a list of vma's touched by the unmap, removing them from the mm's | |
1697 | * vma list as we go.. | |
1698 | */ | |
1699 | static void | |
1700 | detach_vmas_to_be_unmapped(struct mm_struct *mm, struct vm_area_struct *vma, | |
1701 | struct vm_area_struct *prev, unsigned long end) | |
1702 | { | |
1703 | struct vm_area_struct **insertion_point; | |
1704 | struct vm_area_struct *tail_vma = NULL; | |
1363c3cd | 1705 | unsigned long addr; |
1da177e4 LT |
1706 | |
1707 | insertion_point = (prev ? &prev->vm_next : &mm->mmap); | |
1708 | do { | |
1709 | rb_erase(&vma->vm_rb, &mm->mm_rb); | |
1710 | mm->map_count--; | |
1711 | tail_vma = vma; | |
1712 | vma = vma->vm_next; | |
1713 | } while (vma && vma->vm_start < end); | |
1714 | *insertion_point = vma; | |
1715 | tail_vma->vm_next = NULL; | |
1363c3cd WW |
1716 | if (mm->unmap_area == arch_unmap_area) |
1717 | addr = prev ? prev->vm_end : mm->mmap_base; | |
1718 | else | |
1719 | addr = vma ? vma->vm_start : mm->mmap_base; | |
1720 | mm->unmap_area(mm, addr); | |
1da177e4 LT |
1721 | mm->mmap_cache = NULL; /* Kill the cache. */ |
1722 | } | |
1723 | ||
1724 | /* | |
1725 | * Split a vma into two pieces at address 'addr', a new vma is allocated | |
1726 | * either for the first part or the the tail. | |
1727 | */ | |
1728 | int split_vma(struct mm_struct * mm, struct vm_area_struct * vma, | |
1729 | unsigned long addr, int new_below) | |
1730 | { | |
1731 | struct mempolicy *pol; | |
1732 | struct vm_area_struct *new; | |
1733 | ||
1734 | if (is_vm_hugetlb_page(vma) && (addr & ~HPAGE_MASK)) | |
1735 | return -EINVAL; | |
1736 | ||
1737 | if (mm->map_count >= sysctl_max_map_count) | |
1738 | return -ENOMEM; | |
1739 | ||
1740 | new = kmem_cache_alloc(vm_area_cachep, SLAB_KERNEL); | |
1741 | if (!new) | |
1742 | return -ENOMEM; | |
1743 | ||
1744 | /* most fields are the same, copy all, and then fixup */ | |
1745 | *new = *vma; | |
1746 | ||
1747 | if (new_below) | |
1748 | new->vm_end = addr; | |
1749 | else { | |
1750 | new->vm_start = addr; | |
1751 | new->vm_pgoff += ((addr - vma->vm_start) >> PAGE_SHIFT); | |
1752 | } | |
1753 | ||
1754 | pol = mpol_copy(vma_policy(vma)); | |
1755 | if (IS_ERR(pol)) { | |
1756 | kmem_cache_free(vm_area_cachep, new); | |
1757 | return PTR_ERR(pol); | |
1758 | } | |
1759 | vma_set_policy(new, pol); | |
1760 | ||
1761 | if (new->vm_file) | |
1762 | get_file(new->vm_file); | |
1763 | ||
1764 | if (new->vm_ops && new->vm_ops->open) | |
1765 | new->vm_ops->open(new); | |
1766 | ||
1767 | if (new_below) | |
1768 | vma_adjust(vma, addr, vma->vm_end, vma->vm_pgoff + | |
1769 | ((addr - new->vm_start) >> PAGE_SHIFT), new); | |
1770 | else | |
1771 | vma_adjust(vma, vma->vm_start, addr, vma->vm_pgoff, new); | |
1772 | ||
1773 | return 0; | |
1774 | } | |
1775 | ||
1776 | /* Munmap is split into 2 main parts -- this part which finds | |
1777 | * what needs doing, and the areas themselves, which do the | |
1778 | * work. This now handles partial unmappings. | |
1779 | * Jeremy Fitzhardinge <jeremy@goop.org> | |
1780 | */ | |
1781 | int do_munmap(struct mm_struct *mm, unsigned long start, size_t len) | |
1782 | { | |
1783 | unsigned long end; | |
146425a3 | 1784 | struct vm_area_struct *vma, *prev, *last; |
1da177e4 LT |
1785 | |
1786 | if ((start & ~PAGE_MASK) || start > TASK_SIZE || len > TASK_SIZE-start) | |
1787 | return -EINVAL; | |
1788 | ||
1789 | if ((len = PAGE_ALIGN(len)) == 0) | |
1790 | return -EINVAL; | |
1791 | ||
1792 | /* Find the first overlapping VMA */ | |
146425a3 HD |
1793 | vma = find_vma_prev(mm, start, &prev); |
1794 | if (!vma) | |
1da177e4 | 1795 | return 0; |
146425a3 | 1796 | /* we have start < vma->vm_end */ |
1da177e4 LT |
1797 | |
1798 | /* if it doesn't overlap, we have nothing.. */ | |
1799 | end = start + len; | |
146425a3 | 1800 | if (vma->vm_start >= end) |
1da177e4 LT |
1801 | return 0; |
1802 | ||
1803 | /* | |
1804 | * If we need to split any vma, do it now to save pain later. | |
1805 | * | |
1806 | * Note: mremap's move_vma VM_ACCOUNT handling assumes a partially | |
1807 | * unmapped vm_area_struct will remain in use: so lower split_vma | |
1808 | * places tmp vma above, and higher split_vma places tmp vma below. | |
1809 | */ | |
146425a3 HD |
1810 | if (start > vma->vm_start) { |
1811 | int error = split_vma(mm, vma, start, 0); | |
1da177e4 LT |
1812 | if (error) |
1813 | return error; | |
146425a3 | 1814 | prev = vma; |
1da177e4 LT |
1815 | } |
1816 | ||
1817 | /* Does it split the last one? */ | |
1818 | last = find_vma(mm, end); | |
1819 | if (last && end > last->vm_start) { | |
1820 | int error = split_vma(mm, last, end, 1); | |
1821 | if (error) | |
1822 | return error; | |
1823 | } | |
146425a3 | 1824 | vma = prev? prev->vm_next: mm->mmap; |
1da177e4 LT |
1825 | |
1826 | /* | |
1827 | * Remove the vma's, and unmap the actual pages | |
1828 | */ | |
146425a3 HD |
1829 | detach_vmas_to_be_unmapped(mm, vma, prev, end); |
1830 | unmap_region(mm, vma, prev, start, end); | |
1da177e4 LT |
1831 | |
1832 | /* Fix up all other VM information */ | |
2c0b3814 | 1833 | remove_vma_list(mm, vma); |
1da177e4 LT |
1834 | |
1835 | return 0; | |
1836 | } | |
1837 | ||
1838 | EXPORT_SYMBOL(do_munmap); | |
1839 | ||
1840 | asmlinkage long sys_munmap(unsigned long addr, size_t len) | |
1841 | { | |
1842 | int ret; | |
1843 | struct mm_struct *mm = current->mm; | |
1844 | ||
1845 | profile_munmap(addr); | |
1846 | ||
1847 | down_write(&mm->mmap_sem); | |
1848 | ret = do_munmap(mm, addr, len); | |
1849 | up_write(&mm->mmap_sem); | |
1850 | return ret; | |
1851 | } | |
1852 | ||
1853 | static inline void verify_mm_writelocked(struct mm_struct *mm) | |
1854 | { | |
a241ec65 | 1855 | #ifdef CONFIG_DEBUG_VM |
1da177e4 LT |
1856 | if (unlikely(down_read_trylock(&mm->mmap_sem))) { |
1857 | WARN_ON(1); | |
1858 | up_read(&mm->mmap_sem); | |
1859 | } | |
1860 | #endif | |
1861 | } | |
1862 | ||
1863 | /* | |
1864 | * this is really a simplified "do_mmap". it only handles | |
1865 | * anonymous maps. eventually we may be able to do some | |
1866 | * brk-specific accounting here. | |
1867 | */ | |
1868 | unsigned long do_brk(unsigned long addr, unsigned long len) | |
1869 | { | |
1870 | struct mm_struct * mm = current->mm; | |
1871 | struct vm_area_struct * vma, * prev; | |
1872 | unsigned long flags; | |
1873 | struct rb_node ** rb_link, * rb_parent; | |
1874 | pgoff_t pgoff = addr >> PAGE_SHIFT; | |
3a459756 | 1875 | int error; |
1da177e4 LT |
1876 | |
1877 | len = PAGE_ALIGN(len); | |
1878 | if (!len) | |
1879 | return addr; | |
1880 | ||
1881 | if ((addr + len) > TASK_SIZE || (addr + len) < addr) | |
1882 | return -EINVAL; | |
1883 | ||
3a459756 KK |
1884 | flags = VM_DATA_DEFAULT_FLAGS | VM_ACCOUNT | mm->def_flags; |
1885 | ||
1886 | error = arch_mmap_check(addr, len, flags); | |
1887 | if (error) | |
1888 | return error; | |
1889 | ||
1da177e4 LT |
1890 | /* |
1891 | * mlock MCL_FUTURE? | |
1892 | */ | |
1893 | if (mm->def_flags & VM_LOCKED) { | |
1894 | unsigned long locked, lock_limit; | |
93ea1d0a CW |
1895 | locked = len >> PAGE_SHIFT; |
1896 | locked += mm->locked_vm; | |
1da177e4 | 1897 | lock_limit = current->signal->rlim[RLIMIT_MEMLOCK].rlim_cur; |
93ea1d0a | 1898 | lock_limit >>= PAGE_SHIFT; |
1da177e4 LT |
1899 | if (locked > lock_limit && !capable(CAP_IPC_LOCK)) |
1900 | return -EAGAIN; | |
1901 | } | |
1902 | ||
1903 | /* | |
1904 | * mm->mmap_sem is required to protect against another thread | |
1905 | * changing the mappings in case we sleep. | |
1906 | */ | |
1907 | verify_mm_writelocked(mm); | |
1908 | ||
1909 | /* | |
1910 | * Clear old maps. this also does some error checking for us | |
1911 | */ | |
1912 | munmap_back: | |
1913 | vma = find_vma_prepare(mm, addr, &prev, &rb_link, &rb_parent); | |
1914 | if (vma && vma->vm_start < addr + len) { | |
1915 | if (do_munmap(mm, addr, len)) | |
1916 | return -ENOMEM; | |
1917 | goto munmap_back; | |
1918 | } | |
1919 | ||
1920 | /* Check against address space limits *after* clearing old maps... */ | |
119f657c | 1921 | if (!may_expand_vm(mm, len >> PAGE_SHIFT)) |
1da177e4 LT |
1922 | return -ENOMEM; |
1923 | ||
1924 | if (mm->map_count > sysctl_max_map_count) | |
1925 | return -ENOMEM; | |
1926 | ||
1927 | if (security_vm_enough_memory(len >> PAGE_SHIFT)) | |
1928 | return -ENOMEM; | |
1929 | ||
1da177e4 LT |
1930 | /* Can we just expand an old private anonymous mapping? */ |
1931 | if (vma_merge(mm, prev, addr, addr + len, flags, | |
1932 | NULL, NULL, pgoff, NULL)) | |
1933 | goto out; | |
1934 | ||
1935 | /* | |
1936 | * create a vma struct for an anonymous mapping | |
1937 | */ | |
c5e3b83e | 1938 | vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL); |
1da177e4 LT |
1939 | if (!vma) { |
1940 | vm_unacct_memory(len >> PAGE_SHIFT); | |
1941 | return -ENOMEM; | |
1942 | } | |
1da177e4 LT |
1943 | |
1944 | vma->vm_mm = mm; | |
1945 | vma->vm_start = addr; | |
1946 | vma->vm_end = addr + len; | |
1947 | vma->vm_pgoff = pgoff; | |
1948 | vma->vm_flags = flags; | |
9637a5ef DH |
1949 | vma->vm_page_prot = protection_map[flags & |
1950 | (VM_READ|VM_WRITE|VM_EXEC|VM_SHARED)]; | |
1da177e4 LT |
1951 | vma_link(mm, vma, prev, rb_link, rb_parent); |
1952 | out: | |
1953 | mm->total_vm += len >> PAGE_SHIFT; | |
1954 | if (flags & VM_LOCKED) { | |
1955 | mm->locked_vm += len >> PAGE_SHIFT; | |
1956 | make_pages_present(addr, addr + len); | |
1957 | } | |
1958 | return addr; | |
1959 | } | |
1960 | ||
1961 | EXPORT_SYMBOL(do_brk); | |
1962 | ||
1963 | /* Release all mmaps. */ | |
1964 | void exit_mmap(struct mm_struct *mm) | |
1965 | { | |
1966 | struct mmu_gather *tlb; | |
e0da382c | 1967 | struct vm_area_struct *vma = mm->mmap; |
1da177e4 | 1968 | unsigned long nr_accounted = 0; |
ee39b37b | 1969 | unsigned long end; |
1da177e4 LT |
1970 | |
1971 | lru_add_drain(); | |
1da177e4 | 1972 | flush_cache_mm(mm); |
e0da382c | 1973 | tlb = tlb_gather_mmu(mm, 1); |
365e9c87 | 1974 | /* Don't update_hiwater_rss(mm) here, do_exit already did */ |
e0da382c | 1975 | /* Use -1 here to ensure all VMAs in the mm are unmapped */ |
508034a3 | 1976 | end = unmap_vmas(&tlb, vma, 0, -1, &nr_accounted, NULL); |
1da177e4 | 1977 | vm_unacct_memory(nr_accounted); |
e2cdef8c | 1978 | free_pgtables(&tlb, vma, FIRST_USER_ADDRESS, 0); |
ee39b37b | 1979 | tlb_finish_mmu(tlb, 0, end); |
1da177e4 | 1980 | |
1da177e4 | 1981 | /* |
8f4f8c16 HD |
1982 | * Walk the list again, actually closing and freeing it, |
1983 | * with preemption enabled, without holding any MM locks. | |
1da177e4 | 1984 | */ |
a8fb5618 HD |
1985 | while (vma) |
1986 | vma = remove_vma(vma); | |
e0da382c | 1987 | |
e2cdef8c | 1988 | BUG_ON(mm->nr_ptes > (FIRST_USER_ADDRESS+PMD_SIZE-1)>>PMD_SHIFT); |
1da177e4 LT |
1989 | } |
1990 | ||
1991 | /* Insert vm structure into process list sorted by address | |
1992 | * and into the inode's i_mmap tree. If vm_file is non-NULL | |
1993 | * then i_mmap_lock is taken here. | |
1994 | */ | |
1995 | int insert_vm_struct(struct mm_struct * mm, struct vm_area_struct * vma) | |
1996 | { | |
1997 | struct vm_area_struct * __vma, * prev; | |
1998 | struct rb_node ** rb_link, * rb_parent; | |
1999 | ||
2000 | /* | |
2001 | * The vm_pgoff of a purely anonymous vma should be irrelevant | |
2002 | * until its first write fault, when page's anon_vma and index | |
2003 | * are set. But now set the vm_pgoff it will almost certainly | |
2004 | * end up with (unless mremap moves it elsewhere before that | |
2005 | * first wfault), so /proc/pid/maps tells a consistent story. | |
2006 | * | |
2007 | * By setting it to reflect the virtual start address of the | |
2008 | * vma, merges and splits can happen in a seamless way, just | |
2009 | * using the existing file pgoff checks and manipulations. | |
2010 | * Similarly in do_mmap_pgoff and in do_brk. | |
2011 | */ | |
2012 | if (!vma->vm_file) { | |
2013 | BUG_ON(vma->anon_vma); | |
2014 | vma->vm_pgoff = vma->vm_start >> PAGE_SHIFT; | |
2015 | } | |
2016 | __vma = find_vma_prepare(mm,vma->vm_start,&prev,&rb_link,&rb_parent); | |
2017 | if (__vma && __vma->vm_start < vma->vm_end) | |
2018 | return -ENOMEM; | |
2fd4ef85 HD |
2019 | if ((vma->vm_flags & VM_ACCOUNT) && |
2020 | security_vm_enough_memory(vma_pages(vma))) | |
2021 | return -ENOMEM; | |
1da177e4 LT |
2022 | vma_link(mm, vma, prev, rb_link, rb_parent); |
2023 | return 0; | |
2024 | } | |
2025 | ||
2026 | /* | |
2027 | * Copy the vma structure to a new location in the same mm, | |
2028 | * prior to moving page table entries, to effect an mremap move. | |
2029 | */ | |
2030 | struct vm_area_struct *copy_vma(struct vm_area_struct **vmap, | |
2031 | unsigned long addr, unsigned long len, pgoff_t pgoff) | |
2032 | { | |
2033 | struct vm_area_struct *vma = *vmap; | |
2034 | unsigned long vma_start = vma->vm_start; | |
2035 | struct mm_struct *mm = vma->vm_mm; | |
2036 | struct vm_area_struct *new_vma, *prev; | |
2037 | struct rb_node **rb_link, *rb_parent; | |
2038 | struct mempolicy *pol; | |
2039 | ||
2040 | /* | |
2041 | * If anonymous vma has not yet been faulted, update new pgoff | |
2042 | * to match new location, to increase its chance of merging. | |
2043 | */ | |
2044 | if (!vma->vm_file && !vma->anon_vma) | |
2045 | pgoff = addr >> PAGE_SHIFT; | |
2046 | ||
2047 | find_vma_prepare(mm, addr, &prev, &rb_link, &rb_parent); | |
2048 | new_vma = vma_merge(mm, prev, addr, addr + len, vma->vm_flags, | |
2049 | vma->anon_vma, vma->vm_file, pgoff, vma_policy(vma)); | |
2050 | if (new_vma) { | |
2051 | /* | |
2052 | * Source vma may have been merged into new_vma | |
2053 | */ | |
2054 | if (vma_start >= new_vma->vm_start && | |
2055 | vma_start < new_vma->vm_end) | |
2056 | *vmap = new_vma; | |
2057 | } else { | |
2058 | new_vma = kmem_cache_alloc(vm_area_cachep, SLAB_KERNEL); | |
2059 | if (new_vma) { | |
2060 | *new_vma = *vma; | |
2061 | pol = mpol_copy(vma_policy(vma)); | |
2062 | if (IS_ERR(pol)) { | |
2063 | kmem_cache_free(vm_area_cachep, new_vma); | |
2064 | return NULL; | |
2065 | } | |
2066 | vma_set_policy(new_vma, pol); | |
2067 | new_vma->vm_start = addr; | |
2068 | new_vma->vm_end = addr + len; | |
2069 | new_vma->vm_pgoff = pgoff; | |
2070 | if (new_vma->vm_file) | |
2071 | get_file(new_vma->vm_file); | |
2072 | if (new_vma->vm_ops && new_vma->vm_ops->open) | |
2073 | new_vma->vm_ops->open(new_vma); | |
2074 | vma_link(mm, new_vma, prev, rb_link, rb_parent); | |
2075 | } | |
2076 | } | |
2077 | return new_vma; | |
2078 | } | |
119f657c | 2079 | |
2080 | /* | |
2081 | * Return true if the calling process may expand its vm space by the passed | |
2082 | * number of pages | |
2083 | */ | |
2084 | int may_expand_vm(struct mm_struct *mm, unsigned long npages) | |
2085 | { | |
2086 | unsigned long cur = mm->total_vm; /* pages */ | |
2087 | unsigned long lim; | |
2088 | ||
2089 | lim = current->signal->rlim[RLIMIT_AS].rlim_cur >> PAGE_SHIFT; | |
2090 | ||
2091 | if (cur + npages > lim) | |
2092 | return 0; | |
2093 | return 1; | |
2094 | } |