6 * Address space accounting code <alan@lxorguk.ukuu.org.uk>
9 #include <linux/kernel.h>
10 #include <linux/slab.h>
11 #include <linux/backing-dev.h>
13 #include <linux/shm.h>
14 #include <linux/mman.h>
15 #include <linux/pagemap.h>
16 #include <linux/swap.h>
17 #include <linux/syscalls.h>
18 #include <linux/capability.h>
19 #include <linux/init.h>
20 #include <linux/file.h>
22 #include <linux/personality.h>
23 #include <linux/security.h>
24 #include <linux/hugetlb.h>
25 #include <linux/profile.h>
26 #include <linux/export.h>
27 #include <linux/mount.h>
28 #include <linux/mempolicy.h>
29 #include <linux/rmap.h>
30 #include <linux/mmu_notifier.h>
31 #include <linux/perf_event.h>
32 #include <linux/audit.h>
33 #include <linux/khugepaged.h>
34 #include <linux/uprobes.h>
35 #include <linux/rbtree_augmented.h>
36 #include <linux/sched/sysctl.h>
37 #include <linux/notifier.h>
38 #include <linux/memory.h>
40 #include <asm/uaccess.h>
41 #include <asm/cacheflush.h>
43 #include <asm/mmu_context.h>
47 #ifndef arch_mmap_check
48 #define arch_mmap_check(addr, len, flags) (0)
51 #ifndef arch_rebalance_pgtables
52 #define arch_rebalance_pgtables(addr, len) (addr)
55 static void unmap_region(struct mm_struct
*mm
,
56 struct vm_area_struct
*vma
, struct vm_area_struct
*prev
,
57 unsigned long start
, unsigned long end
);
59 /* description of effects of mapping type and prot in current implementation.
60 * this is due to the limited x86 page protection hardware. The expected
61 * behavior is in parens:
64 * PROT_NONE PROT_READ PROT_WRITE PROT_EXEC
65 * MAP_SHARED r: (no) no r: (yes) yes r: (no) yes r: (no) yes
66 * w: (no) no w: (no) no w: (yes) yes w: (no) no
67 * x: (no) no x: (no) yes x: (no) yes x: (yes) yes
69 * MAP_PRIVATE r: (no) no r: (yes) yes r: (no) yes r: (no) yes
70 * w: (no) no w: (no) no w: (copy) copy w: (no) no
71 * x: (no) no x: (no) yes x: (no) yes x: (yes) yes
74 pgprot_t protection_map
[16] = {
75 __P000
, __P001
, __P010
, __P011
, __P100
, __P101
, __P110
, __P111
,
76 __S000
, __S001
, __S010
, __S011
, __S100
, __S101
, __S110
, __S111
79 pgprot_t
vm_get_page_prot(unsigned long vm_flags
)
81 return __pgprot(pgprot_val(protection_map
[vm_flags
&
82 (VM_READ
|VM_WRITE
|VM_EXEC
|VM_SHARED
)]) |
83 pgprot_val(arch_vm_get_page_prot(vm_flags
)));
85 EXPORT_SYMBOL(vm_get_page_prot
);
87 int sysctl_overcommit_memory __read_mostly
= OVERCOMMIT_GUESS
; /* heuristic overcommit */
88 int sysctl_overcommit_ratio __read_mostly
= 50; /* default is 50% */
89 int sysctl_max_map_count __read_mostly
= DEFAULT_MAX_MAP_COUNT
;
90 unsigned long sysctl_user_reserve_kbytes __read_mostly
= 1UL << 17; /* 128MB */
91 unsigned long sysctl_admin_reserve_kbytes __read_mostly
= 1UL << 13; /* 8MB */
93 * Make sure vm_committed_as in one cacheline and not cacheline shared with
94 * other variables. It can be updated by several CPUs frequently.
96 struct percpu_counter vm_committed_as ____cacheline_aligned_in_smp
;
99 * The global memory commitment made in the system can be a metric
100 * that can be used to drive ballooning decisions when Linux is hosted
101 * as a guest. On Hyper-V, the host implements a policy engine for dynamically
102 * balancing memory across competing virtual machines that are hosted.
103 * Several metrics drive this policy engine including the guest reported
106 unsigned long vm_memory_committed(void)
108 return percpu_counter_read_positive(&vm_committed_as
);
110 EXPORT_SYMBOL_GPL(vm_memory_committed
);
113 * Check that a process has enough memory to allocate a new virtual
114 * mapping. 0 means there is enough memory for the allocation to
115 * succeed and -ENOMEM implies there is not.
117 * We currently support three overcommit policies, which are set via the
118 * vm.overcommit_memory sysctl. See Documentation/vm/overcommit-accounting
120 * Strict overcommit modes added 2002 Feb 26 by Alan Cox.
121 * Additional code 2002 Jul 20 by Robert Love.
123 * cap_sys_admin is 1 if the process has admin privileges, 0 otherwise.
125 * Note this is a helper function intended to be used by LSMs which
126 * wish to use this logic.
128 int __vm_enough_memory(struct mm_struct
*mm
, long pages
, int cap_sys_admin
)
130 unsigned long free
, allowed
, reserve
;
132 vm_acct_memory(pages
);
135 * Sometimes we want to use more memory than we have
137 if (sysctl_overcommit_memory
== OVERCOMMIT_ALWAYS
)
140 if (sysctl_overcommit_memory
== OVERCOMMIT_GUESS
) {
141 free
= global_page_state(NR_FREE_PAGES
);
142 free
+= global_page_state(NR_FILE_PAGES
);
145 * shmem pages shouldn't be counted as free in this
146 * case, they can't be purged, only swapped out, and
147 * that won't affect the overall amount of available
148 * memory in the system.
150 free
-= global_page_state(NR_SHMEM
);
152 free
+= get_nr_swap_pages();
155 * Any slabs which are created with the
156 * SLAB_RECLAIM_ACCOUNT flag claim to have contents
157 * which are reclaimable, under pressure. The dentry
158 * cache and most inode caches should fall into this
160 free
+= global_page_state(NR_SLAB_RECLAIMABLE
);
163 * Leave reserved pages. The pages are not for anonymous pages.
165 if (free
<= totalreserve_pages
)
168 free
-= totalreserve_pages
;
171 * Reserve some for root
174 free
-= sysctl_admin_reserve_kbytes
>> (PAGE_SHIFT
- 10);
182 allowed
= (totalram_pages
- hugetlb_total_pages())
183 * sysctl_overcommit_ratio
/ 100;
185 * Reserve some for root
188 allowed
-= sysctl_admin_reserve_kbytes
>> (PAGE_SHIFT
- 10);
189 allowed
+= total_swap_pages
;
192 * Don't let a single process grow so big a user can't recover
195 reserve
= sysctl_user_reserve_kbytes
>> (PAGE_SHIFT
- 10);
196 allowed
-= min(mm
->total_vm
/ 32, reserve
);
199 if (percpu_counter_read_positive(&vm_committed_as
) < allowed
)
202 vm_unacct_memory(pages
);
208 * Requires inode->i_mapping->i_mmap_mutex
210 static void __remove_shared_vm_struct(struct vm_area_struct
*vma
,
211 struct file
*file
, struct address_space
*mapping
)
213 if (vma
->vm_flags
& VM_DENYWRITE
)
214 atomic_inc(&file_inode(file
)->i_writecount
);
215 if (vma
->vm_flags
& VM_SHARED
)
216 mapping
->i_mmap_writable
--;
218 flush_dcache_mmap_lock(mapping
);
219 if (unlikely(vma
->vm_flags
& VM_NONLINEAR
))
220 list_del_init(&vma
->shared
.nonlinear
);
222 vma_interval_tree_remove(vma
, &mapping
->i_mmap
);
223 flush_dcache_mmap_unlock(mapping
);
227 * Unlink a file-based vm structure from its interval tree, to hide
228 * vma from rmap and vmtruncate before freeing its page tables.
230 void unlink_file_vma(struct vm_area_struct
*vma
)
232 struct file
*file
= vma
->vm_file
;
235 struct address_space
*mapping
= file
->f_mapping
;
236 mutex_lock(&mapping
->i_mmap_mutex
);
237 __remove_shared_vm_struct(vma
, file
, mapping
);
238 mutex_unlock(&mapping
->i_mmap_mutex
);
243 * Close a vm structure and free it, returning the next.
245 static struct vm_area_struct
*remove_vma(struct vm_area_struct
*vma
)
247 struct vm_area_struct
*next
= vma
->vm_next
;
250 if (vma
->vm_ops
&& vma
->vm_ops
->close
)
251 vma
->vm_ops
->close(vma
);
254 mpol_put(vma_policy(vma
));
255 kmem_cache_free(vm_area_cachep
, vma
);
259 static unsigned long do_brk(unsigned long addr
, unsigned long len
);
261 SYSCALL_DEFINE1(brk
, unsigned long, brk
)
263 unsigned long rlim
, retval
;
264 unsigned long newbrk
, oldbrk
;
265 struct mm_struct
*mm
= current
->mm
;
266 unsigned long min_brk
;
269 down_write(&mm
->mmap_sem
);
271 #ifdef CONFIG_COMPAT_BRK
273 * CONFIG_COMPAT_BRK can still be overridden by setting
274 * randomize_va_space to 2, which will still cause mm->start_brk
275 * to be arbitrarily shifted
277 if (current
->brk_randomized
)
278 min_brk
= mm
->start_brk
;
280 min_brk
= mm
->end_data
;
282 min_brk
= mm
->start_brk
;
288 * Check against rlimit here. If this check is done later after the test
289 * of oldbrk with newbrk then it can escape the test and let the data
290 * segment grow beyond its set limit the in case where the limit is
291 * not page aligned -Ram Gupta
293 rlim
= rlimit(RLIMIT_DATA
);
294 if (rlim
< RLIM_INFINITY
&& (brk
- mm
->start_brk
) +
295 (mm
->end_data
- mm
->start_data
) > rlim
)
298 newbrk
= PAGE_ALIGN(brk
);
299 oldbrk
= PAGE_ALIGN(mm
->brk
);
300 if (oldbrk
== newbrk
)
303 /* Always allow shrinking brk. */
304 if (brk
<= mm
->brk
) {
305 if (!do_munmap(mm
, newbrk
, oldbrk
-newbrk
))
310 /* Check against existing mmap mappings. */
311 if (find_vma_intersection(mm
, oldbrk
, newbrk
+PAGE_SIZE
))
314 /* Ok, looks good - let it rip. */
315 if (do_brk(oldbrk
, newbrk
-oldbrk
) != oldbrk
)
320 populate
= newbrk
> oldbrk
&& (mm
->def_flags
& VM_LOCKED
) != 0;
321 up_write(&mm
->mmap_sem
);
323 mm_populate(oldbrk
, newbrk
- oldbrk
);
328 up_write(&mm
->mmap_sem
);
332 static long vma_compute_subtree_gap(struct vm_area_struct
*vma
)
334 unsigned long max
, subtree_gap
;
337 max
-= vma
->vm_prev
->vm_end
;
338 if (vma
->vm_rb
.rb_left
) {
339 subtree_gap
= rb_entry(vma
->vm_rb
.rb_left
,
340 struct vm_area_struct
, vm_rb
)->rb_subtree_gap
;
341 if (subtree_gap
> max
)
344 if (vma
->vm_rb
.rb_right
) {
345 subtree_gap
= rb_entry(vma
->vm_rb
.rb_right
,
346 struct vm_area_struct
, vm_rb
)->rb_subtree_gap
;
347 if (subtree_gap
> max
)
353 #ifdef CONFIG_DEBUG_VM_RB
354 static int browse_rb(struct rb_root
*root
)
356 int i
= 0, j
, bug
= 0;
357 struct rb_node
*nd
, *pn
= NULL
;
358 unsigned long prev
= 0, pend
= 0;
360 for (nd
= rb_first(root
); nd
; nd
= rb_next(nd
)) {
361 struct vm_area_struct
*vma
;
362 vma
= rb_entry(nd
, struct vm_area_struct
, vm_rb
);
363 if (vma
->vm_start
< prev
) {
364 printk("vm_start %lx prev %lx\n", vma
->vm_start
, prev
);
367 if (vma
->vm_start
< pend
) {
368 printk("vm_start %lx pend %lx\n", vma
->vm_start
, pend
);
371 if (vma
->vm_start
> vma
->vm_end
) {
372 printk("vm_end %lx < vm_start %lx\n",
373 vma
->vm_end
, vma
->vm_start
);
376 if (vma
->rb_subtree_gap
!= vma_compute_subtree_gap(vma
)) {
377 printk("free gap %lx, correct %lx\n",
379 vma_compute_subtree_gap(vma
));
384 prev
= vma
->vm_start
;
388 for (nd
= pn
; nd
; nd
= rb_prev(nd
))
391 printk("backwards %d, forwards %d\n", j
, i
);
397 static void validate_mm_rb(struct rb_root
*root
, struct vm_area_struct
*ignore
)
401 for (nd
= rb_first(root
); nd
; nd
= rb_next(nd
)) {
402 struct vm_area_struct
*vma
;
403 vma
= rb_entry(nd
, struct vm_area_struct
, vm_rb
);
404 BUG_ON(vma
!= ignore
&&
405 vma
->rb_subtree_gap
!= vma_compute_subtree_gap(vma
));
409 void validate_mm(struct mm_struct
*mm
)
413 unsigned long highest_address
= 0;
414 struct vm_area_struct
*vma
= mm
->mmap
;
416 struct anon_vma_chain
*avc
;
417 vma_lock_anon_vma(vma
);
418 list_for_each_entry(avc
, &vma
->anon_vma_chain
, same_vma
)
419 anon_vma_interval_tree_verify(avc
);
420 vma_unlock_anon_vma(vma
);
421 highest_address
= vma
->vm_end
;
425 if (i
!= mm
->map_count
) {
426 printk("map_count %d vm_next %d\n", mm
->map_count
, i
);
429 if (highest_address
!= mm
->highest_vm_end
) {
430 printk("mm->highest_vm_end %lx, found %lx\n",
431 mm
->highest_vm_end
, highest_address
);
434 i
= browse_rb(&mm
->mm_rb
);
435 if (i
!= mm
->map_count
) {
436 printk("map_count %d rb %d\n", mm
->map_count
, i
);
442 #define validate_mm_rb(root, ignore) do { } while (0)
443 #define validate_mm(mm) do { } while (0)
446 RB_DECLARE_CALLBACKS(static, vma_gap_callbacks
, struct vm_area_struct
, vm_rb
,
447 unsigned long, rb_subtree_gap
, vma_compute_subtree_gap
)
450 * Update augmented rbtree rb_subtree_gap values after vma->vm_start or
451 * vma->vm_prev->vm_end values changed, without modifying the vma's position
454 static void vma_gap_update(struct vm_area_struct
*vma
)
457 * As it turns out, RB_DECLARE_CALLBACKS() already created a callback
458 * function that does exacltly what we want.
460 vma_gap_callbacks_propagate(&vma
->vm_rb
, NULL
);
463 static inline void vma_rb_insert(struct vm_area_struct
*vma
,
464 struct rb_root
*root
)
466 /* All rb_subtree_gap values must be consistent prior to insertion */
467 validate_mm_rb(root
, NULL
);
469 rb_insert_augmented(&vma
->vm_rb
, root
, &vma_gap_callbacks
);
472 static void vma_rb_erase(struct vm_area_struct
*vma
, struct rb_root
*root
)
475 * All rb_subtree_gap values must be consistent prior to erase,
476 * with the possible exception of the vma being erased.
478 validate_mm_rb(root
, vma
);
481 * Note rb_erase_augmented is a fairly large inline function,
482 * so make sure we instantiate it only once with our desired
483 * augmented rbtree callbacks.
485 rb_erase_augmented(&vma
->vm_rb
, root
, &vma_gap_callbacks
);
489 * vma has some anon_vma assigned, and is already inserted on that
490 * anon_vma's interval trees.
492 * Before updating the vma's vm_start / vm_end / vm_pgoff fields, the
493 * vma must be removed from the anon_vma's interval trees using
494 * anon_vma_interval_tree_pre_update_vma().
496 * After the update, the vma will be reinserted using
497 * anon_vma_interval_tree_post_update_vma().
499 * The entire update must be protected by exclusive mmap_sem and by
500 * the root anon_vma's mutex.
503 anon_vma_interval_tree_pre_update_vma(struct vm_area_struct
*vma
)
505 struct anon_vma_chain
*avc
;
507 list_for_each_entry(avc
, &vma
->anon_vma_chain
, same_vma
)
508 anon_vma_interval_tree_remove(avc
, &avc
->anon_vma
->rb_root
);
512 anon_vma_interval_tree_post_update_vma(struct vm_area_struct
*vma
)
514 struct anon_vma_chain
*avc
;
516 list_for_each_entry(avc
, &vma
->anon_vma_chain
, same_vma
)
517 anon_vma_interval_tree_insert(avc
, &avc
->anon_vma
->rb_root
);
520 static int find_vma_links(struct mm_struct
*mm
, unsigned long addr
,
521 unsigned long end
, struct vm_area_struct
**pprev
,
522 struct rb_node
***rb_link
, struct rb_node
**rb_parent
)
524 struct rb_node
**__rb_link
, *__rb_parent
, *rb_prev
;
526 __rb_link
= &mm
->mm_rb
.rb_node
;
527 rb_prev
= __rb_parent
= NULL
;
530 struct vm_area_struct
*vma_tmp
;
532 __rb_parent
= *__rb_link
;
533 vma_tmp
= rb_entry(__rb_parent
, struct vm_area_struct
, vm_rb
);
535 if (vma_tmp
->vm_end
> addr
) {
536 /* Fail if an existing vma overlaps the area */
537 if (vma_tmp
->vm_start
< end
)
539 __rb_link
= &__rb_parent
->rb_left
;
541 rb_prev
= __rb_parent
;
542 __rb_link
= &__rb_parent
->rb_right
;
548 *pprev
= rb_entry(rb_prev
, struct vm_area_struct
, vm_rb
);
549 *rb_link
= __rb_link
;
550 *rb_parent
= __rb_parent
;
554 static unsigned long count_vma_pages_range(struct mm_struct
*mm
,
555 unsigned long addr
, unsigned long end
)
557 unsigned long nr_pages
= 0;
558 struct vm_area_struct
*vma
;
560 /* Find first overlaping mapping */
561 vma
= find_vma_intersection(mm
, addr
, end
);
565 nr_pages
= (min(end
, vma
->vm_end
) -
566 max(addr
, vma
->vm_start
)) >> PAGE_SHIFT
;
568 /* Iterate over the rest of the overlaps */
569 for (vma
= vma
->vm_next
; vma
; vma
= vma
->vm_next
) {
570 unsigned long overlap_len
;
572 if (vma
->vm_start
> end
)
575 overlap_len
= min(end
, vma
->vm_end
) - vma
->vm_start
;
576 nr_pages
+= overlap_len
>> PAGE_SHIFT
;
582 void __vma_link_rb(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
583 struct rb_node
**rb_link
, struct rb_node
*rb_parent
)
585 /* Update tracking information for the gap following the new vma. */
587 vma_gap_update(vma
->vm_next
);
589 mm
->highest_vm_end
= vma
->vm_end
;
592 * vma->vm_prev wasn't known when we followed the rbtree to find the
593 * correct insertion point for that vma. As a result, we could not
594 * update the vma vm_rb parents rb_subtree_gap values on the way down.
595 * So, we first insert the vma with a zero rb_subtree_gap value
596 * (to be consistent with what we did on the way down), and then
597 * immediately update the gap to the correct value. Finally we
598 * rebalance the rbtree after all augmented values have been set.
600 rb_link_node(&vma
->vm_rb
, rb_parent
, rb_link
);
601 vma
->rb_subtree_gap
= 0;
603 vma_rb_insert(vma
, &mm
->mm_rb
);
606 static void __vma_link_file(struct vm_area_struct
*vma
)
612 struct address_space
*mapping
= file
->f_mapping
;
614 if (vma
->vm_flags
& VM_DENYWRITE
)
615 atomic_dec(&file_inode(file
)->i_writecount
);
616 if (vma
->vm_flags
& VM_SHARED
)
617 mapping
->i_mmap_writable
++;
619 flush_dcache_mmap_lock(mapping
);
620 if (unlikely(vma
->vm_flags
& VM_NONLINEAR
))
621 vma_nonlinear_insert(vma
, &mapping
->i_mmap_nonlinear
);
623 vma_interval_tree_insert(vma
, &mapping
->i_mmap
);
624 flush_dcache_mmap_unlock(mapping
);
629 __vma_link(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
630 struct vm_area_struct
*prev
, struct rb_node
**rb_link
,
631 struct rb_node
*rb_parent
)
633 __vma_link_list(mm
, vma
, prev
, rb_parent
);
634 __vma_link_rb(mm
, vma
, rb_link
, rb_parent
);
637 static void vma_link(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
638 struct vm_area_struct
*prev
, struct rb_node
**rb_link
,
639 struct rb_node
*rb_parent
)
641 struct address_space
*mapping
= NULL
;
644 mapping
= vma
->vm_file
->f_mapping
;
647 mutex_lock(&mapping
->i_mmap_mutex
);
649 __vma_link(mm
, vma
, prev
, rb_link
, rb_parent
);
650 __vma_link_file(vma
);
653 mutex_unlock(&mapping
->i_mmap_mutex
);
660 * Helper for vma_adjust() in the split_vma insert case: insert a vma into the
661 * mm's list and rbtree. It has already been inserted into the interval tree.
663 static void __insert_vm_struct(struct mm_struct
*mm
, struct vm_area_struct
*vma
)
665 struct vm_area_struct
*prev
;
666 struct rb_node
**rb_link
, *rb_parent
;
668 if (find_vma_links(mm
, vma
->vm_start
, vma
->vm_end
,
669 &prev
, &rb_link
, &rb_parent
))
671 __vma_link(mm
, vma
, prev
, rb_link
, rb_parent
);
676 __vma_unlink(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
677 struct vm_area_struct
*prev
)
679 struct vm_area_struct
*next
;
681 vma_rb_erase(vma
, &mm
->mm_rb
);
682 prev
->vm_next
= next
= vma
->vm_next
;
684 next
->vm_prev
= prev
;
685 if (mm
->mmap_cache
== vma
)
686 mm
->mmap_cache
= prev
;
690 * We cannot adjust vm_start, vm_end, vm_pgoff fields of a vma that
691 * is already present in an i_mmap tree without adjusting the tree.
692 * The following helper function should be used when such adjustments
693 * are necessary. The "insert" vma (if any) is to be inserted
694 * before we drop the necessary locks.
696 int vma_adjust(struct vm_area_struct
*vma
, unsigned long start
,
697 unsigned long end
, pgoff_t pgoff
, struct vm_area_struct
*insert
)
699 struct mm_struct
*mm
= vma
->vm_mm
;
700 struct vm_area_struct
*next
= vma
->vm_next
;
701 struct vm_area_struct
*importer
= NULL
;
702 struct address_space
*mapping
= NULL
;
703 struct rb_root
*root
= NULL
;
704 struct anon_vma
*anon_vma
= NULL
;
705 struct file
*file
= vma
->vm_file
;
706 bool start_changed
= false, end_changed
= false;
707 long adjust_next
= 0;
710 if (next
&& !insert
) {
711 struct vm_area_struct
*exporter
= NULL
;
713 if (end
>= next
->vm_end
) {
715 * vma expands, overlapping all the next, and
716 * perhaps the one after too (mprotect case 6).
718 again
: remove_next
= 1 + (end
> next
->vm_end
);
722 } else if (end
> next
->vm_start
) {
724 * vma expands, overlapping part of the next:
725 * mprotect case 5 shifting the boundary up.
727 adjust_next
= (end
- next
->vm_start
) >> PAGE_SHIFT
;
730 } else if (end
< vma
->vm_end
) {
732 * vma shrinks, and !insert tells it's not
733 * split_vma inserting another: so it must be
734 * mprotect case 4 shifting the boundary down.
736 adjust_next
= - ((vma
->vm_end
- end
) >> PAGE_SHIFT
);
742 * Easily overlooked: when mprotect shifts the boundary,
743 * make sure the expanding vma has anon_vma set if the
744 * shrinking vma had, to cover any anon pages imported.
746 if (exporter
&& exporter
->anon_vma
&& !importer
->anon_vma
) {
747 if (anon_vma_clone(importer
, exporter
))
749 importer
->anon_vma
= exporter
->anon_vma
;
754 mapping
= file
->f_mapping
;
755 if (!(vma
->vm_flags
& VM_NONLINEAR
)) {
756 root
= &mapping
->i_mmap
;
757 uprobe_munmap(vma
, vma
->vm_start
, vma
->vm_end
);
760 uprobe_munmap(next
, next
->vm_start
,
764 mutex_lock(&mapping
->i_mmap_mutex
);
767 * Put into interval tree now, so instantiated pages
768 * are visible to arm/parisc __flush_dcache_page
769 * throughout; but we cannot insert into address
770 * space until vma start or end is updated.
772 __vma_link_file(insert
);
776 vma_adjust_trans_huge(vma
, start
, end
, adjust_next
);
778 anon_vma
= vma
->anon_vma
;
779 if (!anon_vma
&& adjust_next
)
780 anon_vma
= next
->anon_vma
;
782 VM_BUG_ON(adjust_next
&& next
->anon_vma
&&
783 anon_vma
!= next
->anon_vma
);
784 anon_vma_lock_write(anon_vma
);
785 anon_vma_interval_tree_pre_update_vma(vma
);
787 anon_vma_interval_tree_pre_update_vma(next
);
791 flush_dcache_mmap_lock(mapping
);
792 vma_interval_tree_remove(vma
, root
);
794 vma_interval_tree_remove(next
, root
);
797 if (start
!= vma
->vm_start
) {
798 vma
->vm_start
= start
;
799 start_changed
= true;
801 if (end
!= vma
->vm_end
) {
805 vma
->vm_pgoff
= pgoff
;
807 next
->vm_start
+= adjust_next
<< PAGE_SHIFT
;
808 next
->vm_pgoff
+= adjust_next
;
813 vma_interval_tree_insert(next
, root
);
814 vma_interval_tree_insert(vma
, root
);
815 flush_dcache_mmap_unlock(mapping
);
820 * vma_merge has merged next into vma, and needs
821 * us to remove next before dropping the locks.
823 __vma_unlink(mm
, next
, vma
);
825 __remove_shared_vm_struct(next
, file
, mapping
);
828 * split_vma has split insert from vma, and needs
829 * us to insert it before dropping the locks
830 * (it may either follow vma or precede it).
832 __insert_vm_struct(mm
, insert
);
838 mm
->highest_vm_end
= end
;
839 else if (!adjust_next
)
840 vma_gap_update(next
);
845 anon_vma_interval_tree_post_update_vma(vma
);
847 anon_vma_interval_tree_post_update_vma(next
);
848 anon_vma_unlock_write(anon_vma
);
851 mutex_unlock(&mapping
->i_mmap_mutex
);
862 uprobe_munmap(next
, next
->vm_start
, next
->vm_end
);
866 anon_vma_merge(vma
, next
);
868 mpol_put(vma_policy(next
));
869 kmem_cache_free(vm_area_cachep
, next
);
871 * In mprotect's case 6 (see comments on vma_merge),
872 * we must remove another next too. It would clutter
873 * up the code too much to do both in one go.
876 if (remove_next
== 2)
879 vma_gap_update(next
);
881 mm
->highest_vm_end
= end
;
892 * If the vma has a ->close operation then the driver probably needs to release
893 * per-vma resources, so we don't attempt to merge those.
895 static inline int is_mergeable_vma(struct vm_area_struct
*vma
,
896 struct file
*file
, unsigned long vm_flags
,
897 const char __user
*anon_name
)
899 if (vma
->vm_flags
^ vm_flags
)
901 if (vma
->vm_file
!= file
)
903 if (vma
->vm_ops
&& vma
->vm_ops
->close
)
905 if (vma_get_anon_name(vma
) != anon_name
)
910 static inline int is_mergeable_anon_vma(struct anon_vma
*anon_vma1
,
911 struct anon_vma
*anon_vma2
,
912 struct vm_area_struct
*vma
)
915 * The list_is_singular() test is to avoid merging VMA cloned from
916 * parents. This can improve scalability caused by anon_vma lock.
918 if ((!anon_vma1
|| !anon_vma2
) && (!vma
||
919 list_is_singular(&vma
->anon_vma_chain
)))
921 return anon_vma1
== anon_vma2
;
925 * Return true if we can merge this (vm_flags,anon_vma,file,vm_pgoff)
926 * in front of (at a lower virtual address and file offset than) the vma.
928 * We cannot merge two vmas if they have differently assigned (non-NULL)
929 * anon_vmas, nor if same anon_vma is assigned but offsets incompatible.
931 * We don't check here for the merged mmap wrapping around the end of pagecache
932 * indices (16TB on ia32) because do_mmap_pgoff() does not permit mmap's which
933 * wrap, nor mmaps which cover the final page at index -1UL.
936 can_vma_merge_before(struct vm_area_struct
*vma
, unsigned long vm_flags
,
937 struct anon_vma
*anon_vma
, struct file
*file
, pgoff_t vm_pgoff
,
938 const char __user
*anon_name
)
940 if (is_mergeable_vma(vma
, file
, vm_flags
, anon_name
) &&
941 is_mergeable_anon_vma(anon_vma
, vma
->anon_vma
, vma
)) {
942 if (vma
->vm_pgoff
== vm_pgoff
)
949 * Return true if we can merge this (vm_flags,anon_vma,file,vm_pgoff)
950 * beyond (at a higher virtual address and file offset than) the vma.
952 * We cannot merge two vmas if they have differently assigned (non-NULL)
953 * anon_vmas, nor if same anon_vma is assigned but offsets incompatible.
956 can_vma_merge_after(struct vm_area_struct
*vma
, unsigned long vm_flags
,
957 struct anon_vma
*anon_vma
, struct file
*file
, pgoff_t vm_pgoff
,
958 const char __user
*anon_name
)
960 if (is_mergeable_vma(vma
, file
, vm_flags
, anon_name
) &&
961 is_mergeable_anon_vma(anon_vma
, vma
->anon_vma
, vma
)) {
963 vm_pglen
= (vma
->vm_end
- vma
->vm_start
) >> PAGE_SHIFT
;
964 if (vma
->vm_pgoff
+ vm_pglen
== vm_pgoff
)
971 * Given a mapping request (addr,end,vm_flags,file,pgoff,anon_name),
972 * figure out whether that can be merged with its predecessor or its
973 * successor. Or both (it neatly fills a hole).
975 * In most cases - when called for mmap, brk or mremap - [addr,end) is
976 * certain not to be mapped by the time vma_merge is called; but when
977 * called for mprotect, it is certain to be already mapped (either at
978 * an offset within prev, or at the start of next), and the flags of
979 * this area are about to be changed to vm_flags - and the no-change
980 * case has already been eliminated.
982 * The following mprotect cases have to be considered, where AAAA is
983 * the area passed down from mprotect_fixup, never extending beyond one
984 * vma, PPPPPP is the prev vma specified, and NNNNNN the next vma after:
986 * AAAA AAAA AAAA AAAA
987 * PPPPPPNNNNNN PPPPPPNNNNNN PPPPPPNNNNNN PPPPNNNNXXXX
988 * cannot merge might become might become might become
989 * PPNNNNNNNNNN PPPPPPPPPPNN PPPPPPPPPPPP 6 or
990 * mmap, brk or case 4 below case 5 below PPPPPPPPXXXX 7 or
991 * mremap move: PPPPNNNNNNNN 8
993 * PPPP NNNN PPPPPPPPPPPP PPPPPPPPNNNN PPPPNNNNNNNN
994 * might become case 1 below case 2 below case 3 below
996 * Odd one out? Case 8, because it extends NNNN but needs flags of XXXX:
997 * mprotect_fixup updates vm_flags & vm_page_prot on successful return.
999 struct vm_area_struct
*vma_merge(struct mm_struct
*mm
,
1000 struct vm_area_struct
*prev
, unsigned long addr
,
1001 unsigned long end
, unsigned long vm_flags
,
1002 struct anon_vma
*anon_vma
, struct file
*file
,
1003 pgoff_t pgoff
, struct mempolicy
*policy
,
1004 const char __user
*anon_name
)
1006 pgoff_t pglen
= (end
- addr
) >> PAGE_SHIFT
;
1007 struct vm_area_struct
*area
, *next
;
1011 * We later require that vma->vm_flags == vm_flags,
1012 * so this tests vma->vm_flags & VM_SPECIAL, too.
1014 if (vm_flags
& VM_SPECIAL
)
1018 next
= prev
->vm_next
;
1022 if (next
&& next
->vm_end
== end
) /* cases 6, 7, 8 */
1023 next
= next
->vm_next
;
1026 * Can it merge with the predecessor?
1028 if (prev
&& prev
->vm_end
== addr
&&
1029 mpol_equal(vma_policy(prev
), policy
) &&
1030 can_vma_merge_after(prev
, vm_flags
, anon_vma
,
1031 file
, pgoff
, anon_name
)) {
1033 * OK, it can. Can we now merge in the successor as well?
1035 if (next
&& end
== next
->vm_start
&&
1036 mpol_equal(policy
, vma_policy(next
)) &&
1037 can_vma_merge_before(next
, vm_flags
, anon_vma
,
1038 file
, pgoff
+pglen
, anon_name
) &&
1039 is_mergeable_anon_vma(prev
->anon_vma
,
1040 next
->anon_vma
, NULL
)) {
1042 err
= vma_adjust(prev
, prev
->vm_start
,
1043 next
->vm_end
, prev
->vm_pgoff
, NULL
);
1044 } else /* cases 2, 5, 7 */
1045 err
= vma_adjust(prev
, prev
->vm_start
,
1046 end
, prev
->vm_pgoff
, NULL
);
1049 khugepaged_enter_vma_merge(prev
);
1054 * Can this new request be merged in front of next?
1056 if (next
&& end
== next
->vm_start
&&
1057 mpol_equal(policy
, vma_policy(next
)) &&
1058 can_vma_merge_before(next
, vm_flags
, anon_vma
,
1059 file
, pgoff
+pglen
, anon_name
)) {
1060 if (prev
&& addr
< prev
->vm_end
) /* case 4 */
1061 err
= vma_adjust(prev
, prev
->vm_start
,
1062 addr
, prev
->vm_pgoff
, NULL
);
1063 else /* cases 3, 8 */
1064 err
= vma_adjust(area
, addr
, next
->vm_end
,
1065 next
->vm_pgoff
- pglen
, NULL
);
1068 khugepaged_enter_vma_merge(area
);
1076 * Rough compatbility check to quickly see if it's even worth looking
1077 * at sharing an anon_vma.
1079 * They need to have the same vm_file, and the flags can only differ
1080 * in things that mprotect may change.
1082 * NOTE! The fact that we share an anon_vma doesn't _have_ to mean that
1083 * we can merge the two vma's. For example, we refuse to merge a vma if
1084 * there is a vm_ops->close() function, because that indicates that the
1085 * driver is doing some kind of reference counting. But that doesn't
1086 * really matter for the anon_vma sharing case.
1088 static int anon_vma_compatible(struct vm_area_struct
*a
, struct vm_area_struct
*b
)
1090 return a
->vm_end
== b
->vm_start
&&
1091 mpol_equal(vma_policy(a
), vma_policy(b
)) &&
1092 a
->vm_file
== b
->vm_file
&&
1093 !((a
->vm_flags
^ b
->vm_flags
) & ~(VM_READ
|VM_WRITE
|VM_EXEC
)) &&
1094 b
->vm_pgoff
== a
->vm_pgoff
+ ((b
->vm_start
- a
->vm_start
) >> PAGE_SHIFT
);
1098 * Do some basic sanity checking to see if we can re-use the anon_vma
1099 * from 'old'. The 'a'/'b' vma's are in VM order - one of them will be
1100 * the same as 'old', the other will be the new one that is trying
1101 * to share the anon_vma.
1103 * NOTE! This runs with mm_sem held for reading, so it is possible that
1104 * the anon_vma of 'old' is concurrently in the process of being set up
1105 * by another page fault trying to merge _that_. But that's ok: if it
1106 * is being set up, that automatically means that it will be a singleton
1107 * acceptable for merging, so we can do all of this optimistically. But
1108 * we do that ACCESS_ONCE() to make sure that we never re-load the pointer.
1110 * IOW: that the "list_is_singular()" test on the anon_vma_chain only
1111 * matters for the 'stable anon_vma' case (ie the thing we want to avoid
1112 * is to return an anon_vma that is "complex" due to having gone through
1115 * We also make sure that the two vma's are compatible (adjacent,
1116 * and with the same memory policies). That's all stable, even with just
1117 * a read lock on the mm_sem.
1119 static struct anon_vma
*reusable_anon_vma(struct vm_area_struct
*old
, struct vm_area_struct
*a
, struct vm_area_struct
*b
)
1121 if (anon_vma_compatible(a
, b
)) {
1122 struct anon_vma
*anon_vma
= ACCESS_ONCE(old
->anon_vma
);
1124 if (anon_vma
&& list_is_singular(&old
->anon_vma_chain
))
1131 * find_mergeable_anon_vma is used by anon_vma_prepare, to check
1132 * neighbouring vmas for a suitable anon_vma, before it goes off
1133 * to allocate a new anon_vma. It checks because a repetitive
1134 * sequence of mprotects and faults may otherwise lead to distinct
1135 * anon_vmas being allocated, preventing vma merge in subsequent
1138 struct anon_vma
*find_mergeable_anon_vma(struct vm_area_struct
*vma
)
1140 struct anon_vma
*anon_vma
;
1141 struct vm_area_struct
*near
;
1143 near
= vma
->vm_next
;
1147 anon_vma
= reusable_anon_vma(near
, vma
, near
);
1151 near
= vma
->vm_prev
;
1155 anon_vma
= reusable_anon_vma(near
, near
, vma
);
1160 * There's no absolute need to look only at touching neighbours:
1161 * we could search further afield for "compatible" anon_vmas.
1162 * But it would probably just be a waste of time searching,
1163 * or lead to too many vmas hanging off the same anon_vma.
1164 * We're trying to allow mprotect remerging later on,
1165 * not trying to minimize memory used for anon_vmas.
1170 #ifdef CONFIG_PROC_FS
1171 void vm_stat_account(struct mm_struct
*mm
, unsigned long flags
,
1172 struct file
*file
, long pages
)
1174 const unsigned long stack_flags
1175 = VM_STACK_FLAGS
& (VM_GROWSUP
|VM_GROWSDOWN
);
1177 mm
->total_vm
+= pages
;
1180 mm
->shared_vm
+= pages
;
1181 if ((flags
& (VM_EXEC
|VM_WRITE
)) == VM_EXEC
)
1182 mm
->exec_vm
+= pages
;
1183 } else if (flags
& stack_flags
)
1184 mm
->stack_vm
+= pages
;
1186 #endif /* CONFIG_PROC_FS */
1189 * If a hint addr is less than mmap_min_addr change hint to be as
1190 * low as possible but still greater than mmap_min_addr
1192 static inline unsigned long round_hint_to_min(unsigned long hint
)
1195 if (((void *)hint
!= NULL
) &&
1196 (hint
< mmap_min_addr
))
1197 return PAGE_ALIGN(mmap_min_addr
);
1202 * The caller must hold down_write(¤t->mm->mmap_sem).
1205 unsigned long do_mmap_pgoff(struct file
*file
, unsigned long addr
,
1206 unsigned long len
, unsigned long prot
,
1207 unsigned long flags
, unsigned long pgoff
,
1208 unsigned long *populate
)
1210 struct mm_struct
* mm
= current
->mm
;
1211 struct inode
*inode
;
1212 vm_flags_t vm_flags
;
1217 * Does the application expect PROT_READ to imply PROT_EXEC?
1219 * (the exception is when the underlying filesystem is noexec
1220 * mounted, in which case we dont add PROT_EXEC.)
1222 if ((prot
& PROT_READ
) && (current
->personality
& READ_IMPLIES_EXEC
))
1223 if (!(file
&& (file
->f_path
.mnt
->mnt_flags
& MNT_NOEXEC
)))
1229 if (!(flags
& MAP_FIXED
))
1230 addr
= round_hint_to_min(addr
);
1232 /* Careful about overflows.. */
1233 len
= PAGE_ALIGN(len
);
1237 /* offset overflow? */
1238 if ((pgoff
+ (len
>> PAGE_SHIFT
)) < pgoff
)
1241 /* Too many mappings? */
1242 if (mm
->map_count
> sysctl_max_map_count
)
1245 /* Obtain the address to map to. we verify (or select) it and ensure
1246 * that it represents a valid section of the address space.
1248 addr
= get_unmapped_area(file
, addr
, len
, pgoff
, flags
);
1249 if (addr
& ~PAGE_MASK
)
1252 /* Do simple checking here so the lower-level routines won't have
1253 * to. we assume access permissions have been handled by the open
1254 * of the memory object, so we don't do any here.
1256 vm_flags
= calc_vm_prot_bits(prot
) | calc_vm_flag_bits(flags
) |
1257 mm
->def_flags
| VM_MAYREAD
| VM_MAYWRITE
| VM_MAYEXEC
;
1259 if (flags
& MAP_LOCKED
)
1260 if (!can_do_mlock())
1263 /* mlock MCL_FUTURE? */
1264 if (vm_flags
& VM_LOCKED
) {
1265 unsigned long locked
, lock_limit
;
1266 locked
= len
>> PAGE_SHIFT
;
1267 locked
+= mm
->locked_vm
;
1268 lock_limit
= rlimit(RLIMIT_MEMLOCK
);
1269 lock_limit
>>= PAGE_SHIFT
;
1270 if (locked
> lock_limit
&& !capable(CAP_IPC_LOCK
))
1274 inode
= file
? file_inode(file
) : NULL
;
1277 switch (flags
& MAP_TYPE
) {
1279 if ((prot
&PROT_WRITE
) && !(file
->f_mode
&FMODE_WRITE
))
1283 * Make sure we don't allow writing to an append-only
1286 if (IS_APPEND(inode
) && (file
->f_mode
& FMODE_WRITE
))
1290 * Make sure there are no mandatory locks on the file.
1292 if (locks_verify_locked(inode
))
1295 vm_flags
|= VM_SHARED
| VM_MAYSHARE
;
1296 if (!(file
->f_mode
& FMODE_WRITE
))
1297 vm_flags
&= ~(VM_MAYWRITE
| VM_SHARED
);
1301 if (!(file
->f_mode
& FMODE_READ
))
1303 if (file
->f_path
.mnt
->mnt_flags
& MNT_NOEXEC
) {
1304 if (vm_flags
& VM_EXEC
)
1306 vm_flags
&= ~VM_MAYEXEC
;
1309 if (!file
->f_op
|| !file
->f_op
->mmap
)
1317 switch (flags
& MAP_TYPE
) {
1323 vm_flags
|= VM_SHARED
| VM_MAYSHARE
;
1327 * Set pgoff according to addr for anon_vma.
1329 pgoff
= addr
>> PAGE_SHIFT
;
1337 * Set 'VM_NORESERVE' if we should not account for the
1338 * memory use of this mapping.
1340 if (flags
& MAP_NORESERVE
) {
1341 /* We honor MAP_NORESERVE if allowed to overcommit */
1342 if (sysctl_overcommit_memory
!= OVERCOMMIT_NEVER
)
1343 vm_flags
|= VM_NORESERVE
;
1345 /* hugetlb applies strict overcommit unless MAP_NORESERVE */
1346 if (file
&& is_file_hugepages(file
))
1347 vm_flags
|= VM_NORESERVE
;
1350 addr
= mmap_region(file
, addr
, len
, vm_flags
, pgoff
);
1351 if (!IS_ERR_VALUE(addr
) &&
1352 ((vm_flags
& VM_LOCKED
) ||
1353 (flags
& (MAP_POPULATE
| MAP_NONBLOCK
)) == MAP_POPULATE
))
1358 SYSCALL_DEFINE6(mmap_pgoff
, unsigned long, addr
, unsigned long, len
,
1359 unsigned long, prot
, unsigned long, flags
,
1360 unsigned long, fd
, unsigned long, pgoff
)
1362 struct file
*file
= NULL
;
1363 unsigned long retval
= -EBADF
;
1365 if (!(flags
& MAP_ANONYMOUS
)) {
1366 audit_mmap_fd(fd
, flags
);
1367 if (unlikely(flags
& MAP_HUGETLB
))
1372 if (is_file_hugepages(file
))
1373 len
= ALIGN(len
, huge_page_size(hstate_file(file
)));
1374 } else if (flags
& MAP_HUGETLB
) {
1375 struct user_struct
*user
= NULL
;
1376 struct hstate
*hs
= hstate_sizelog((flags
>> MAP_HUGE_SHIFT
) &
1382 len
= ALIGN(len
, huge_page_size(hs
));
1384 * VM_NORESERVE is used because the reservations will be
1385 * taken when vm_ops->mmap() is called
1386 * A dummy user value is used because we are not locking
1387 * memory so no accounting is necessary
1389 file
= hugetlb_file_setup(HUGETLB_ANON_FILE
, len
,
1391 &user
, HUGETLB_ANONHUGE_INODE
,
1392 (flags
>> MAP_HUGE_SHIFT
) & MAP_HUGE_MASK
);
1394 return PTR_ERR(file
);
1397 flags
&= ~(MAP_EXECUTABLE
| MAP_DENYWRITE
);
1399 retval
= vm_mmap_pgoff(file
, addr
, len
, prot
, flags
, pgoff
);
1406 #ifdef __ARCH_WANT_SYS_OLD_MMAP
1407 struct mmap_arg_struct
{
1411 unsigned long flags
;
1413 unsigned long offset
;
1416 SYSCALL_DEFINE1(old_mmap
, struct mmap_arg_struct __user
*, arg
)
1418 struct mmap_arg_struct a
;
1420 if (copy_from_user(&a
, arg
, sizeof(a
)))
1422 if (a
.offset
& ~PAGE_MASK
)
1425 return sys_mmap_pgoff(a
.addr
, a
.len
, a
.prot
, a
.flags
, a
.fd
,
1426 a
.offset
>> PAGE_SHIFT
);
1428 #endif /* __ARCH_WANT_SYS_OLD_MMAP */
1431 * Some shared mappigns will want the pages marked read-only
1432 * to track write events. If so, we'll downgrade vm_page_prot
1433 * to the private version (using protection_map[] without the
1436 int vma_wants_writenotify(struct vm_area_struct
*vma
)
1438 vm_flags_t vm_flags
= vma
->vm_flags
;
1440 /* If it was private or non-writable, the write bit is already clear */
1441 if ((vm_flags
& (VM_WRITE
|VM_SHARED
)) != ((VM_WRITE
|VM_SHARED
)))
1444 /* The backer wishes to know when pages are first written to? */
1445 if (vma
->vm_ops
&& vma
->vm_ops
->page_mkwrite
)
1448 /* The open routine did something to the protections already? */
1449 if (pgprot_val(vma
->vm_page_prot
) !=
1450 pgprot_val(vm_get_page_prot(vm_flags
)))
1453 /* Specialty mapping? */
1454 if (vm_flags
& VM_PFNMAP
)
1457 /* Can the mapping track the dirty pages? */
1458 return vma
->vm_file
&& vma
->vm_file
->f_mapping
&&
1459 mapping_cap_account_dirty(vma
->vm_file
->f_mapping
);
1463 * We account for memory if it's a private writeable mapping,
1464 * not hugepages and VM_NORESERVE wasn't set.
1466 static inline int accountable_mapping(struct file
*file
, vm_flags_t vm_flags
)
1469 * hugetlb has its own accounting separate from the core VM
1470 * VM_HUGETLB may not be set yet so we cannot check for that flag.
1472 if (file
&& is_file_hugepages(file
))
1475 return (vm_flags
& (VM_NORESERVE
| VM_SHARED
| VM_WRITE
)) == VM_WRITE
;
1478 unsigned long mmap_region(struct file
*file
, unsigned long addr
,
1479 unsigned long len
, vm_flags_t vm_flags
, unsigned long pgoff
)
1481 struct mm_struct
*mm
= current
->mm
;
1482 struct vm_area_struct
*vma
, *prev
;
1483 int correct_wcount
= 0;
1485 struct rb_node
**rb_link
, *rb_parent
;
1486 unsigned long charged
= 0;
1487 struct inode
*inode
= file
? file_inode(file
) : NULL
;
1489 /* Check against address space limit. */
1490 if (!may_expand_vm(mm
, len
>> PAGE_SHIFT
)) {
1491 unsigned long nr_pages
;
1494 * MAP_FIXED may remove pages of mappings that intersects with
1495 * requested mapping. Account for the pages it would unmap.
1497 if (!(vm_flags
& MAP_FIXED
))
1500 nr_pages
= count_vma_pages_range(mm
, addr
, addr
+ len
);
1502 if (!may_expand_vm(mm
, (len
>> PAGE_SHIFT
) - nr_pages
))
1506 /* Clear old maps */
1509 if (find_vma_links(mm
, addr
, addr
+ len
, &prev
, &rb_link
, &rb_parent
)) {
1510 if (do_munmap(mm
, addr
, len
))
1516 * Private writable mapping: check memory availability
1518 if (accountable_mapping(file
, vm_flags
)) {
1519 charged
= len
>> PAGE_SHIFT
;
1520 if (security_vm_enough_memory_mm(mm
, charged
))
1522 vm_flags
|= VM_ACCOUNT
;
1526 * Can we just expand an old mapping?
1528 vma
= vma_merge(mm
, prev
, addr
, addr
+ len
, vm_flags
, NULL
, file
, pgoff
,
1534 * Determine the object being mapped and call the appropriate
1535 * specific mapper. the address has already been validated, but
1536 * not unmapped, but the maps are removed from the list.
1538 vma
= kmem_cache_zalloc(vm_area_cachep
, GFP_KERNEL
);
1545 vma
->vm_start
= addr
;
1546 vma
->vm_end
= addr
+ len
;
1547 vma
->vm_flags
= vm_flags
;
1548 vma
->vm_page_prot
= vm_get_page_prot(vm_flags
);
1549 vma
->vm_pgoff
= pgoff
;
1550 INIT_LIST_HEAD(&vma
->anon_vma_chain
);
1552 error
= -EINVAL
; /* when rejecting VM_GROWSDOWN|VM_GROWSUP */
1555 if (vm_flags
& (VM_GROWSDOWN
|VM_GROWSUP
))
1557 if (vm_flags
& VM_DENYWRITE
) {
1558 error
= deny_write_access(file
);
1563 vma
->vm_file
= get_file(file
);
1564 error
= file
->f_op
->mmap(file
, vma
);
1566 goto unmap_and_free_vma
;
1568 /* Can addr have changed??
1570 * Answer: Yes, several device drivers can do it in their
1571 * f_op->mmap method. -DaveM
1572 * Bug: If addr is changed, prev, rb_link, rb_parent should
1573 * be updated for vma_link()
1575 WARN_ON_ONCE(addr
!= vma
->vm_start
);
1577 addr
= vma
->vm_start
;
1578 pgoff
= vma
->vm_pgoff
;
1579 vm_flags
= vma
->vm_flags
;
1580 } else if (vm_flags
& VM_SHARED
) {
1581 if (unlikely(vm_flags
& (VM_GROWSDOWN
|VM_GROWSUP
)))
1583 error
= shmem_zero_setup(vma
);
1588 if (vma_wants_writenotify(vma
)) {
1589 pgprot_t pprot
= vma
->vm_page_prot
;
1591 /* Can vma->vm_page_prot have changed??
1593 * Answer: Yes, drivers may have changed it in their
1594 * f_op->mmap method.
1596 * Ensures that vmas marked as uncached stay that way.
1598 vma
->vm_page_prot
= vm_get_page_prot(vm_flags
& ~VM_SHARED
);
1599 if (pgprot_val(pprot
) == pgprot_val(pgprot_noncached(pprot
)))
1600 vma
->vm_page_prot
= pgprot_noncached(vma
->vm_page_prot
);
1603 vma_link(mm
, vma
, prev
, rb_link
, rb_parent
);
1604 file
= vma
->vm_file
;
1606 /* Once vma denies write, undo our temporary denial count */
1608 atomic_inc(&inode
->i_writecount
);
1610 perf_event_mmap(vma
);
1612 vm_stat_account(mm
, vm_flags
, file
, len
>> PAGE_SHIFT
);
1613 if (vm_flags
& VM_LOCKED
) {
1614 if (!((vm_flags
& VM_SPECIAL
) || is_vm_hugetlb_page(vma
) ||
1615 vma
== get_gate_vma(current
->mm
)))
1616 mm
->locked_vm
+= (len
>> PAGE_SHIFT
);
1618 vma
->vm_flags
&= ~VM_LOCKED
;
1628 atomic_inc(&inode
->i_writecount
);
1629 vma
->vm_file
= NULL
;
1632 /* Undo any partial mapping done by a device driver. */
1633 unmap_region(mm
, vma
, prev
, vma
->vm_start
, vma
->vm_end
);
1636 kmem_cache_free(vm_area_cachep
, vma
);
1639 vm_unacct_memory(charged
);
1643 unsigned long unmapped_area(struct vm_unmapped_area_info
*info
)
1646 * We implement the search by looking for an rbtree node that
1647 * immediately follows a suitable gap. That is,
1648 * - gap_start = vma->vm_prev->vm_end <= info->high_limit - length;
1649 * - gap_end = vma->vm_start >= info->low_limit + length;
1650 * - gap_end - gap_start >= length
1653 struct mm_struct
*mm
= current
->mm
;
1654 struct vm_area_struct
*vma
;
1655 unsigned long length
, low_limit
, high_limit
, gap_start
, gap_end
;
1657 /* Adjust search length to account for worst case alignment overhead */
1658 length
= info
->length
+ info
->align_mask
;
1659 if (length
< info
->length
)
1662 /* Adjust search limits by the desired length */
1663 if (info
->high_limit
< length
)
1665 high_limit
= info
->high_limit
- length
;
1667 if (info
->low_limit
> high_limit
)
1669 low_limit
= info
->low_limit
+ length
;
1671 /* Check if rbtree root looks promising */
1672 if (RB_EMPTY_ROOT(&mm
->mm_rb
))
1674 vma
= rb_entry(mm
->mm_rb
.rb_node
, struct vm_area_struct
, vm_rb
);
1675 if (vma
->rb_subtree_gap
< length
)
1679 /* Visit left subtree if it looks promising */
1680 gap_end
= vma
->vm_start
;
1681 if (gap_end
>= low_limit
&& vma
->vm_rb
.rb_left
) {
1682 struct vm_area_struct
*left
=
1683 rb_entry(vma
->vm_rb
.rb_left
,
1684 struct vm_area_struct
, vm_rb
);
1685 if (left
->rb_subtree_gap
>= length
) {
1691 gap_start
= vma
->vm_prev
? vma
->vm_prev
->vm_end
: 0;
1693 /* Check if current node has a suitable gap */
1694 if (gap_start
> high_limit
)
1696 if (gap_end
>= low_limit
&& gap_end
- gap_start
>= length
)
1699 /* Visit right subtree if it looks promising */
1700 if (vma
->vm_rb
.rb_right
) {
1701 struct vm_area_struct
*right
=
1702 rb_entry(vma
->vm_rb
.rb_right
,
1703 struct vm_area_struct
, vm_rb
);
1704 if (right
->rb_subtree_gap
>= length
) {
1710 /* Go back up the rbtree to find next candidate node */
1712 struct rb_node
*prev
= &vma
->vm_rb
;
1713 if (!rb_parent(prev
))
1715 vma
= rb_entry(rb_parent(prev
),
1716 struct vm_area_struct
, vm_rb
);
1717 if (prev
== vma
->vm_rb
.rb_left
) {
1718 gap_start
= vma
->vm_prev
->vm_end
;
1719 gap_end
= vma
->vm_start
;
1726 /* Check highest gap, which does not precede any rbtree node */
1727 gap_start
= mm
->highest_vm_end
;
1728 gap_end
= ULONG_MAX
; /* Only for VM_BUG_ON below */
1729 if (gap_start
> high_limit
)
1733 /* We found a suitable gap. Clip it with the original low_limit. */
1734 if (gap_start
< info
->low_limit
)
1735 gap_start
= info
->low_limit
;
1737 /* Adjust gap address to the desired alignment */
1738 gap_start
+= (info
->align_offset
- gap_start
) & info
->align_mask
;
1740 VM_BUG_ON(gap_start
+ info
->length
> info
->high_limit
);
1741 VM_BUG_ON(gap_start
+ info
->length
> gap_end
);
1745 unsigned long unmapped_area_topdown(struct vm_unmapped_area_info
*info
)
1747 struct mm_struct
*mm
= current
->mm
;
1748 struct vm_area_struct
*vma
;
1749 unsigned long length
, low_limit
, high_limit
, gap_start
, gap_end
;
1751 /* Adjust search length to account for worst case alignment overhead */
1752 length
= info
->length
+ info
->align_mask
;
1753 if (length
< info
->length
)
1757 * Adjust search limits by the desired length.
1758 * See implementation comment at top of unmapped_area().
1760 gap_end
= info
->high_limit
;
1761 if (gap_end
< length
)
1763 high_limit
= gap_end
- length
;
1765 if (info
->low_limit
> high_limit
)
1767 low_limit
= info
->low_limit
+ length
;
1769 /* Check highest gap, which does not precede any rbtree node */
1770 gap_start
= mm
->highest_vm_end
;
1771 if (gap_start
<= high_limit
)
1774 /* Check if rbtree root looks promising */
1775 if (RB_EMPTY_ROOT(&mm
->mm_rb
))
1777 vma
= rb_entry(mm
->mm_rb
.rb_node
, struct vm_area_struct
, vm_rb
);
1778 if (vma
->rb_subtree_gap
< length
)
1782 /* Visit right subtree if it looks promising */
1783 gap_start
= vma
->vm_prev
? vma
->vm_prev
->vm_end
: 0;
1784 if (gap_start
<= high_limit
&& vma
->vm_rb
.rb_right
) {
1785 struct vm_area_struct
*right
=
1786 rb_entry(vma
->vm_rb
.rb_right
,
1787 struct vm_area_struct
, vm_rb
);
1788 if (right
->rb_subtree_gap
>= length
) {
1795 /* Check if current node has a suitable gap */
1796 gap_end
= vma
->vm_start
;
1797 if (gap_end
< low_limit
)
1799 if (gap_start
<= high_limit
&& gap_end
- gap_start
>= length
)
1802 /* Visit left subtree if it looks promising */
1803 if (vma
->vm_rb
.rb_left
) {
1804 struct vm_area_struct
*left
=
1805 rb_entry(vma
->vm_rb
.rb_left
,
1806 struct vm_area_struct
, vm_rb
);
1807 if (left
->rb_subtree_gap
>= length
) {
1813 /* Go back up the rbtree to find next candidate node */
1815 struct rb_node
*prev
= &vma
->vm_rb
;
1816 if (!rb_parent(prev
))
1818 vma
= rb_entry(rb_parent(prev
),
1819 struct vm_area_struct
, vm_rb
);
1820 if (prev
== vma
->vm_rb
.rb_right
) {
1821 gap_start
= vma
->vm_prev
?
1822 vma
->vm_prev
->vm_end
: 0;
1829 /* We found a suitable gap. Clip it with the original high_limit. */
1830 if (gap_end
> info
->high_limit
)
1831 gap_end
= info
->high_limit
;
1834 /* Compute highest gap address at the desired alignment */
1835 gap_end
-= info
->length
;
1836 gap_end
-= (gap_end
- info
->align_offset
) & info
->align_mask
;
1838 VM_BUG_ON(gap_end
< info
->low_limit
);
1839 VM_BUG_ON(gap_end
< gap_start
);
1843 /* Get an address range which is currently unmapped.
1844 * For shmat() with addr=0.
1846 * Ugly calling convention alert:
1847 * Return value with the low bits set means error value,
1849 * if (ret & ~PAGE_MASK)
1852 * This function "knows" that -ENOMEM has the bits set.
1854 #ifndef HAVE_ARCH_UNMAPPED_AREA
1856 arch_get_unmapped_area(struct file
*filp
, unsigned long addr
,
1857 unsigned long len
, unsigned long pgoff
, unsigned long flags
)
1859 struct mm_struct
*mm
= current
->mm
;
1860 struct vm_area_struct
*vma
;
1861 struct vm_unmapped_area_info info
;
1863 if (len
> TASK_SIZE
- mmap_min_addr
)
1866 if (flags
& MAP_FIXED
)
1870 addr
= PAGE_ALIGN(addr
);
1871 vma
= find_vma(mm
, addr
);
1872 if (TASK_SIZE
- len
>= addr
&& addr
>= mmap_min_addr
&&
1873 (!vma
|| addr
+ len
<= vma
->vm_start
))
1879 info
.low_limit
= TASK_UNMAPPED_BASE
;
1880 info
.high_limit
= TASK_SIZE
;
1881 info
.align_mask
= 0;
1882 return vm_unmapped_area(&info
);
1886 void arch_unmap_area(struct mm_struct
*mm
, unsigned long addr
)
1889 * Is this a new hole at the lowest possible address?
1891 if (addr
>= TASK_UNMAPPED_BASE
&& addr
< mm
->free_area_cache
)
1892 mm
->free_area_cache
= addr
;
1896 * This mmap-allocator allocates new areas top-down from below the
1897 * stack's low limit (the base):
1899 #ifndef HAVE_ARCH_UNMAPPED_AREA_TOPDOWN
1901 arch_get_unmapped_area_topdown(struct file
*filp
, const unsigned long addr0
,
1902 const unsigned long len
, const unsigned long pgoff
,
1903 const unsigned long flags
)
1905 struct vm_area_struct
*vma
;
1906 struct mm_struct
*mm
= current
->mm
;
1907 unsigned long addr
= addr0
;
1908 struct vm_unmapped_area_info info
;
1910 /* requested length too big for entire address space */
1911 if (len
> TASK_SIZE
- mmap_min_addr
)
1914 if (flags
& MAP_FIXED
)
1917 /* requesting a specific address */
1919 addr
= PAGE_ALIGN(addr
);
1920 vma
= find_vma(mm
, addr
);
1921 if (TASK_SIZE
- len
>= addr
&& addr
>= mmap_min_addr
&&
1922 (!vma
|| addr
+ len
<= vma
->vm_start
))
1926 info
.flags
= VM_UNMAPPED_AREA_TOPDOWN
;
1928 info
.low_limit
= max(PAGE_SIZE
, mmap_min_addr
);
1929 info
.high_limit
= mm
->mmap_base
;
1930 info
.align_mask
= 0;
1931 addr
= vm_unmapped_area(&info
);
1934 * A failed mmap() very likely causes application failure,
1935 * so fall back to the bottom-up function here. This scenario
1936 * can happen with large stack limits and large mmap()
1939 if (addr
& ~PAGE_MASK
) {
1940 VM_BUG_ON(addr
!= -ENOMEM
);
1942 info
.low_limit
= TASK_UNMAPPED_BASE
;
1943 info
.high_limit
= TASK_SIZE
;
1944 addr
= vm_unmapped_area(&info
);
1951 void arch_unmap_area_topdown(struct mm_struct
*mm
, unsigned long addr
)
1954 * Is this a new hole at the highest possible address?
1956 if (addr
> mm
->free_area_cache
)
1957 mm
->free_area_cache
= addr
;
1959 /* dont allow allocations above current base */
1960 if (mm
->free_area_cache
> mm
->mmap_base
)
1961 mm
->free_area_cache
= mm
->mmap_base
;
1965 get_unmapped_area(struct file
*file
, unsigned long addr
, unsigned long len
,
1966 unsigned long pgoff
, unsigned long flags
)
1968 unsigned long (*get_area
)(struct file
*, unsigned long,
1969 unsigned long, unsigned long, unsigned long);
1971 unsigned long error
= arch_mmap_check(addr
, len
, flags
);
1975 /* Careful about overflows.. */
1976 if (len
> TASK_SIZE
)
1979 get_area
= current
->mm
->get_unmapped_area
;
1980 if (file
&& file
->f_op
&& file
->f_op
->get_unmapped_area
)
1981 get_area
= file
->f_op
->get_unmapped_area
;
1982 addr
= get_area(file
, addr
, len
, pgoff
, flags
);
1983 if (IS_ERR_VALUE(addr
))
1986 if (addr
> TASK_SIZE
- len
)
1988 if (addr
& ~PAGE_MASK
)
1991 addr
= arch_rebalance_pgtables(addr
, len
);
1992 error
= security_mmap_addr(addr
);
1993 return error
? error
: addr
;
1996 EXPORT_SYMBOL(get_unmapped_area
);
1998 /* Look up the first VMA which satisfies addr < vm_end, NULL if none. */
1999 struct vm_area_struct
*find_vma(struct mm_struct
*mm
, unsigned long addr
)
2001 struct vm_area_struct
*vma
= NULL
;
2003 /* Check the cache first. */
2004 /* (Cache hit rate is typically around 35%.) */
2005 vma
= ACCESS_ONCE(mm
->mmap_cache
);
2006 if (!(vma
&& vma
->vm_end
> addr
&& vma
->vm_start
<= addr
)) {
2007 struct rb_node
*rb_node
;
2009 rb_node
= mm
->mm_rb
.rb_node
;
2013 struct vm_area_struct
*vma_tmp
;
2015 vma_tmp
= rb_entry(rb_node
,
2016 struct vm_area_struct
, vm_rb
);
2018 if (vma_tmp
->vm_end
> addr
) {
2020 if (vma_tmp
->vm_start
<= addr
)
2022 rb_node
= rb_node
->rb_left
;
2024 rb_node
= rb_node
->rb_right
;
2027 mm
->mmap_cache
= vma
;
2032 EXPORT_SYMBOL(find_vma
);
2035 * Same as find_vma, but also return a pointer to the previous VMA in *pprev.
2037 struct vm_area_struct
*
2038 find_vma_prev(struct mm_struct
*mm
, unsigned long addr
,
2039 struct vm_area_struct
**pprev
)
2041 struct vm_area_struct
*vma
;
2043 vma
= find_vma(mm
, addr
);
2045 *pprev
= vma
->vm_prev
;
2047 struct rb_node
*rb_node
= mm
->mm_rb
.rb_node
;
2050 *pprev
= rb_entry(rb_node
, struct vm_area_struct
, vm_rb
);
2051 rb_node
= rb_node
->rb_right
;
2058 * Verify that the stack growth is acceptable and
2059 * update accounting. This is shared with both the
2060 * grow-up and grow-down cases.
2062 static int acct_stack_growth(struct vm_area_struct
*vma
, unsigned long size
, unsigned long grow
)
2064 struct mm_struct
*mm
= vma
->vm_mm
;
2065 struct rlimit
*rlim
= current
->signal
->rlim
;
2066 unsigned long new_start
;
2068 /* address space limit tests */
2069 if (!may_expand_vm(mm
, grow
))
2072 /* Stack limit test */
2073 if (size
> ACCESS_ONCE(rlim
[RLIMIT_STACK
].rlim_cur
))
2076 /* mlock limit tests */
2077 if (vma
->vm_flags
& VM_LOCKED
) {
2078 unsigned long locked
;
2079 unsigned long limit
;
2080 locked
= mm
->locked_vm
+ grow
;
2081 limit
= ACCESS_ONCE(rlim
[RLIMIT_MEMLOCK
].rlim_cur
);
2082 limit
>>= PAGE_SHIFT
;
2083 if (locked
> limit
&& !capable(CAP_IPC_LOCK
))
2087 /* Check to ensure the stack will not grow into a hugetlb-only region */
2088 new_start
= (vma
->vm_flags
& VM_GROWSUP
) ? vma
->vm_start
:
2090 if (is_hugepage_only_range(vma
->vm_mm
, new_start
, size
))
2094 * Overcommit.. This must be the final test, as it will
2095 * update security statistics.
2097 if (security_vm_enough_memory_mm(mm
, grow
))
2100 /* Ok, everything looks good - let it rip */
2101 if (vma
->vm_flags
& VM_LOCKED
)
2102 mm
->locked_vm
+= grow
;
2103 vm_stat_account(mm
, vma
->vm_flags
, vma
->vm_file
, grow
);
2107 #if defined(CONFIG_STACK_GROWSUP) || defined(CONFIG_IA64)
2109 * PA-RISC uses this for its stack; IA64 for its Register Backing Store.
2110 * vma is the last one with address > vma->vm_end. Have to extend vma.
2112 int expand_upwards(struct vm_area_struct
*vma
, unsigned long address
)
2116 if (!(vma
->vm_flags
& VM_GROWSUP
))
2120 * We must make sure the anon_vma is allocated
2121 * so that the anon_vma locking is not a noop.
2123 if (unlikely(anon_vma_prepare(vma
)))
2125 vma_lock_anon_vma(vma
);
2128 * vma->vm_start/vm_end cannot change under us because the caller
2129 * is required to hold the mmap_sem in read mode. We need the
2130 * anon_vma lock to serialize against concurrent expand_stacks.
2131 * Also guard against wrapping around to address 0.
2133 if (address
< PAGE_ALIGN(address
+4))
2134 address
= PAGE_ALIGN(address
+4);
2136 vma_unlock_anon_vma(vma
);
2141 /* Somebody else might have raced and expanded it already */
2142 if (address
> vma
->vm_end
) {
2143 unsigned long size
, grow
;
2145 size
= address
- vma
->vm_start
;
2146 grow
= (address
- vma
->vm_end
) >> PAGE_SHIFT
;
2149 if (vma
->vm_pgoff
+ (size
>> PAGE_SHIFT
) >= vma
->vm_pgoff
) {
2150 error
= acct_stack_growth(vma
, size
, grow
);
2153 * vma_gap_update() doesn't support concurrent
2154 * updates, but we only hold a shared mmap_sem
2155 * lock here, so we need to protect against
2156 * concurrent vma expansions.
2157 * vma_lock_anon_vma() doesn't help here, as
2158 * we don't guarantee that all growable vmas
2159 * in a mm share the same root anon vma.
2160 * So, we reuse mm->page_table_lock to guard
2161 * against concurrent vma expansions.
2163 spin_lock(&vma
->vm_mm
->page_table_lock
);
2164 anon_vma_interval_tree_pre_update_vma(vma
);
2165 vma
->vm_end
= address
;
2166 anon_vma_interval_tree_post_update_vma(vma
);
2168 vma_gap_update(vma
->vm_next
);
2170 vma
->vm_mm
->highest_vm_end
= address
;
2171 spin_unlock(&vma
->vm_mm
->page_table_lock
);
2173 perf_event_mmap(vma
);
2177 vma_unlock_anon_vma(vma
);
2178 khugepaged_enter_vma_merge(vma
);
2179 validate_mm(vma
->vm_mm
);
2182 #endif /* CONFIG_STACK_GROWSUP || CONFIG_IA64 */
2185 * vma is the first one with address < vma->vm_start. Have to extend vma.
2187 int expand_downwards(struct vm_area_struct
*vma
,
2188 unsigned long address
)
2193 * We must make sure the anon_vma is allocated
2194 * so that the anon_vma locking is not a noop.
2196 if (unlikely(anon_vma_prepare(vma
)))
2199 address
&= PAGE_MASK
;
2200 error
= security_mmap_addr(address
);
2204 vma_lock_anon_vma(vma
);
2207 * vma->vm_start/vm_end cannot change under us because the caller
2208 * is required to hold the mmap_sem in read mode. We need the
2209 * anon_vma lock to serialize against concurrent expand_stacks.
2212 /* Somebody else might have raced and expanded it already */
2213 if (address
< vma
->vm_start
) {
2214 unsigned long size
, grow
;
2216 size
= vma
->vm_end
- address
;
2217 grow
= (vma
->vm_start
- address
) >> PAGE_SHIFT
;
2220 if (grow
<= vma
->vm_pgoff
) {
2221 error
= acct_stack_growth(vma
, size
, grow
);
2224 * vma_gap_update() doesn't support concurrent
2225 * updates, but we only hold a shared mmap_sem
2226 * lock here, so we need to protect against
2227 * concurrent vma expansions.
2228 * vma_lock_anon_vma() doesn't help here, as
2229 * we don't guarantee that all growable vmas
2230 * in a mm share the same root anon vma.
2231 * So, we reuse mm->page_table_lock to guard
2232 * against concurrent vma expansions.
2234 spin_lock(&vma
->vm_mm
->page_table_lock
);
2235 anon_vma_interval_tree_pre_update_vma(vma
);
2236 vma
->vm_start
= address
;
2237 vma
->vm_pgoff
-= grow
;
2238 anon_vma_interval_tree_post_update_vma(vma
);
2239 vma_gap_update(vma
);
2240 spin_unlock(&vma
->vm_mm
->page_table_lock
);
2242 perf_event_mmap(vma
);
2246 vma_unlock_anon_vma(vma
);
2247 khugepaged_enter_vma_merge(vma
);
2248 validate_mm(vma
->vm_mm
);
2253 * Note how expand_stack() refuses to expand the stack all the way to
2254 * abut the next virtual mapping, *unless* that mapping itself is also
2255 * a stack mapping. We want to leave room for a guard page, after all
2256 * (the guard page itself is not added here, that is done by the
2257 * actual page faulting logic)
2259 * This matches the behavior of the guard page logic (see mm/memory.c:
2260 * check_stack_guard_page()), which only allows the guard page to be
2261 * removed under these circumstances.
2263 #ifdef CONFIG_STACK_GROWSUP
2264 int expand_stack(struct vm_area_struct
*vma
, unsigned long address
)
2266 struct vm_area_struct
*next
;
2268 address
&= PAGE_MASK
;
2269 next
= vma
->vm_next
;
2270 if (next
&& next
->vm_start
== address
+ PAGE_SIZE
) {
2271 if (!(next
->vm_flags
& VM_GROWSUP
))
2274 return expand_upwards(vma
, address
);
2277 struct vm_area_struct
*
2278 find_extend_vma(struct mm_struct
*mm
, unsigned long addr
)
2280 struct vm_area_struct
*vma
, *prev
;
2283 vma
= find_vma_prev(mm
, addr
, &prev
);
2284 if (vma
&& (vma
->vm_start
<= addr
))
2286 if (!prev
|| expand_stack(prev
, addr
))
2288 if (prev
->vm_flags
& VM_LOCKED
)
2289 __mlock_vma_pages_range(prev
, addr
, prev
->vm_end
, NULL
);
2293 int expand_stack(struct vm_area_struct
*vma
, unsigned long address
)
2295 struct vm_area_struct
*prev
;
2297 address
&= PAGE_MASK
;
2298 prev
= vma
->vm_prev
;
2299 if (prev
&& prev
->vm_end
== address
) {
2300 if (!(prev
->vm_flags
& VM_GROWSDOWN
))
2303 return expand_downwards(vma
, address
);
2306 struct vm_area_struct
*
2307 find_extend_vma(struct mm_struct
* mm
, unsigned long addr
)
2309 struct vm_area_struct
* vma
;
2310 unsigned long start
;
2313 vma
= find_vma(mm
,addr
);
2316 if (vma
->vm_start
<= addr
)
2318 if (!(vma
->vm_flags
& VM_GROWSDOWN
))
2320 start
= vma
->vm_start
;
2321 if (expand_stack(vma
, addr
))
2323 if (vma
->vm_flags
& VM_LOCKED
)
2324 __mlock_vma_pages_range(vma
, addr
, start
, NULL
);
2330 * Ok - we have the memory areas we should free on the vma list,
2331 * so release them, and do the vma updates.
2333 * Called with the mm semaphore held.
2335 static void remove_vma_list(struct mm_struct
*mm
, struct vm_area_struct
*vma
)
2337 unsigned long nr_accounted
= 0;
2339 /* Update high watermark before we lower total_vm */
2340 update_hiwater_vm(mm
);
2342 long nrpages
= vma_pages(vma
);
2344 if (vma
->vm_flags
& VM_ACCOUNT
)
2345 nr_accounted
+= nrpages
;
2346 vm_stat_account(mm
, vma
->vm_flags
, vma
->vm_file
, -nrpages
);
2347 vma
= remove_vma(vma
);
2349 vm_unacct_memory(nr_accounted
);
2354 * Get rid of page table information in the indicated region.
2356 * Called with the mm semaphore held.
2358 static void unmap_region(struct mm_struct
*mm
,
2359 struct vm_area_struct
*vma
, struct vm_area_struct
*prev
,
2360 unsigned long start
, unsigned long end
)
2362 struct vm_area_struct
*next
= prev
? prev
->vm_next
: mm
->mmap
;
2363 struct mmu_gather tlb
;
2366 tlb_gather_mmu(&tlb
, mm
, start
, end
);
2367 update_hiwater_rss(mm
);
2368 unmap_vmas(&tlb
, vma
, start
, end
);
2369 free_pgtables(&tlb
, vma
, prev
? prev
->vm_end
: FIRST_USER_ADDRESS
,
2370 next
? next
->vm_start
: USER_PGTABLES_CEILING
);
2371 tlb_finish_mmu(&tlb
, start
, end
);
2375 * Create a list of vma's touched by the unmap, removing them from the mm's
2376 * vma list as we go..
2379 detach_vmas_to_be_unmapped(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
2380 struct vm_area_struct
*prev
, unsigned long end
)
2382 struct vm_area_struct
**insertion_point
;
2383 struct vm_area_struct
*tail_vma
= NULL
;
2386 insertion_point
= (prev
? &prev
->vm_next
: &mm
->mmap
);
2387 vma
->vm_prev
= NULL
;
2389 vma_rb_erase(vma
, &mm
->mm_rb
);
2393 } while (vma
&& vma
->vm_start
< end
);
2394 *insertion_point
= vma
;
2396 vma
->vm_prev
= prev
;
2397 vma_gap_update(vma
);
2399 mm
->highest_vm_end
= prev
? prev
->vm_end
: 0;
2400 tail_vma
->vm_next
= NULL
;
2401 if (mm
->unmap_area
== arch_unmap_area
)
2402 addr
= prev
? prev
->vm_end
: mm
->mmap_base
;
2404 addr
= vma
? vma
->vm_start
: mm
->mmap_base
;
2405 mm
->unmap_area(mm
, addr
);
2406 mm
->mmap_cache
= NULL
; /* Kill the cache. */
2410 * __split_vma() bypasses sysctl_max_map_count checking. We use this on the
2411 * munmap path where it doesn't make sense to fail.
2413 static int __split_vma(struct mm_struct
* mm
, struct vm_area_struct
* vma
,
2414 unsigned long addr
, int new_below
)
2416 struct mempolicy
*pol
;
2417 struct vm_area_struct
*new;
2420 if (is_vm_hugetlb_page(vma
) && (addr
&
2421 ~(huge_page_mask(hstate_vma(vma
)))))
2424 new = kmem_cache_alloc(vm_area_cachep
, GFP_KERNEL
);
2428 /* most fields are the same, copy all, and then fixup */
2431 INIT_LIST_HEAD(&new->anon_vma_chain
);
2436 new->vm_start
= addr
;
2437 new->vm_pgoff
+= ((addr
- vma
->vm_start
) >> PAGE_SHIFT
);
2440 pol
= mpol_dup(vma_policy(vma
));
2445 vma_set_policy(new, pol
);
2447 if (anon_vma_clone(new, vma
))
2451 get_file(new->vm_file
);
2453 if (new->vm_ops
&& new->vm_ops
->open
)
2454 new->vm_ops
->open(new);
2457 err
= vma_adjust(vma
, addr
, vma
->vm_end
, vma
->vm_pgoff
+
2458 ((addr
- new->vm_start
) >> PAGE_SHIFT
), new);
2460 err
= vma_adjust(vma
, vma
->vm_start
, addr
, vma
->vm_pgoff
, new);
2466 /* Clean everything up if vma_adjust failed. */
2467 if (new->vm_ops
&& new->vm_ops
->close
)
2468 new->vm_ops
->close(new);
2471 unlink_anon_vmas(new);
2475 kmem_cache_free(vm_area_cachep
, new);
2481 * Split a vma into two pieces at address 'addr', a new vma is allocated
2482 * either for the first part or the tail.
2484 int split_vma(struct mm_struct
*mm
, struct vm_area_struct
*vma
,
2485 unsigned long addr
, int new_below
)
2487 if (mm
->map_count
>= sysctl_max_map_count
)
2490 return __split_vma(mm
, vma
, addr
, new_below
);
2493 /* Munmap is split into 2 main parts -- this part which finds
2494 * what needs doing, and the areas themselves, which do the
2495 * work. This now handles partial unmappings.
2496 * Jeremy Fitzhardinge <jeremy@goop.org>
2498 #ifdef CONFIG_MTK_EXTMEM
2499 extern bool extmem_in_mspace(struct vm_area_struct
*vma
);
2500 extern void * get_virt_from_mspace(void * pa
);
2501 extern size_t extmem_get_mem_size(unsigned long pgoff
);
2502 extern void extmem_free(void* mem
);
2505 int do_munmap(struct mm_struct
*mm
, unsigned long start
, size_t len
)
2509 struct vm_area_struct
*vma
, *prev
, *last
;
2511 if ((start
& ~PAGE_MASK
) || start
> TASK_SIZE
|| len
> TASK_SIZE
-start
)
2514 if ((len
= PAGE_ALIGN(len
)) == 0)
2517 /* Find the first overlapping VMA */
2518 vma
= find_vma(mm
, start
);
2524 const char *name
=file
->f_path
.dentry
->d_iname
;
2525 if(name
&& (strstr(name
,"app_process") || strstr(name
,"app_process64") || strstr(name
,"main") || strstr(name
,"Binder_")))
2526 printk("name:%s unmap vm_start %lx end: %lx\n", name
, vma
->vm_start
, vma
->vm_end
);
2530 const char *name
= arch_vma_name(vma
);
2531 if(name
&& (strstr(name
,"app_process") || strstr(name
,"app_process64") || strstr(name
,"main") || strstr(name
,"Binder_")))
2532 printk("name:%s unmap vm_start %lx end: %lx\n", name
, vma
->vm_start
, vma
->vm_end
);
2534 prev
= vma
->vm_prev
;
2535 /* we have start < vma->vm_end */
2537 #ifdef CONFIG_MTK_EXTMEM
2538 /* get correct mmap size if in mspace. */
2539 if (extmem_in_mspace(vma
))
2540 len
= extmem_get_mem_size(vma
->vm_pgoff
);
2543 /* if it doesn't overlap, we have nothing.. */
2545 if (vma
->vm_start
>= end
)
2549 * If we need to split any vma, do it now to save pain later.
2551 * Note: mremap's move_vma VM_ACCOUNT handling assumes a partially
2552 * unmapped vm_area_struct will remain in use: so lower split_vma
2553 * places tmp vma above, and higher split_vma places tmp vma below.
2555 if (start
> vma
->vm_start
) {
2559 * Make sure that map_count on return from munmap() will
2560 * not exceed its limit; but let map_count go just above
2561 * its limit temporarily, to help free resources as expected.
2563 if (end
< vma
->vm_end
&& mm
->map_count
>= sysctl_max_map_count
)
2566 error
= __split_vma(mm
, vma
, start
, 0);
2572 /* Does it split the last one? */
2573 last
= find_vma(mm
, end
);
2574 if (last
&& end
> last
->vm_start
) {
2575 int error
= __split_vma(mm
, last
, end
, 1);
2579 vma
= prev
? prev
->vm_next
: mm
->mmap
;
2582 * unlock any mlock()ed ranges before detaching vmas
2584 if (mm
->locked_vm
) {
2585 struct vm_area_struct
*tmp
= vma
;
2586 while (tmp
&& tmp
->vm_start
< end
) {
2587 if (tmp
->vm_flags
& VM_LOCKED
) {
2588 mm
->locked_vm
-= vma_pages(tmp
);
2589 munlock_vma_pages_all(tmp
);
2596 * Remove the vma's, and unmap the actual pages
2598 detach_vmas_to_be_unmapped(mm
, vma
, prev
, end
);
2599 unmap_region(mm
, vma
, prev
, start
, end
);
2601 /* Fix up all other VM information */
2602 remove_vma_list(mm
, vma
);
2607 int vm_munmap(unsigned long start
, size_t len
)
2610 struct mm_struct
*mm
= current
->mm
;
2612 down_write(&mm
->mmap_sem
);
2613 ret
= do_munmap(mm
, start
, len
);
2614 up_write(&mm
->mmap_sem
);
2617 EXPORT_SYMBOL(vm_munmap
);
2619 SYSCALL_DEFINE2(munmap
, unsigned long, addr
, size_t, len
)
2621 profile_munmap(addr
);
2622 return vm_munmap(addr
, len
);
2625 static inline void verify_mm_writelocked(struct mm_struct
*mm
)
2627 #ifdef CONFIG_DEBUG_VM
2628 if (unlikely(down_read_trylock(&mm
->mmap_sem
))) {
2630 up_read(&mm
->mmap_sem
);
2636 * this is really a simplified "do_mmap". it only handles
2637 * anonymous maps. eventually we may be able to do some
2638 * brk-specific accounting here.
2640 static unsigned long do_brk(unsigned long addr
, unsigned long len
)
2642 struct mm_struct
* mm
= current
->mm
;
2643 struct vm_area_struct
* vma
, * prev
;
2644 unsigned long flags
;
2645 struct rb_node
** rb_link
, * rb_parent
;
2646 pgoff_t pgoff
= addr
>> PAGE_SHIFT
;
2649 len
= PAGE_ALIGN(len
);
2653 flags
= VM_DATA_DEFAULT_FLAGS
| VM_ACCOUNT
| mm
->def_flags
;
2655 error
= get_unmapped_area(NULL
, addr
, len
, 0, MAP_FIXED
);
2656 if (error
& ~PAGE_MASK
)
2662 if (mm
->def_flags
& VM_LOCKED
) {
2663 unsigned long locked
, lock_limit
;
2664 locked
= len
>> PAGE_SHIFT
;
2665 locked
+= mm
->locked_vm
;
2666 lock_limit
= rlimit(RLIMIT_MEMLOCK
);
2667 lock_limit
>>= PAGE_SHIFT
;
2668 if (locked
> lock_limit
&& !capable(CAP_IPC_LOCK
))
2673 * mm->mmap_sem is required to protect against another thread
2674 * changing the mappings in case we sleep.
2676 verify_mm_writelocked(mm
);
2679 * Clear old maps. this also does some error checking for us
2682 if (find_vma_links(mm
, addr
, addr
+ len
, &prev
, &rb_link
, &rb_parent
)) {
2683 if (do_munmap(mm
, addr
, len
))
2688 /* Check against address space limits *after* clearing old maps... */
2689 if (!may_expand_vm(mm
, len
>> PAGE_SHIFT
))
2692 if (mm
->map_count
> sysctl_max_map_count
)
2695 if (security_vm_enough_memory_mm(mm
, len
>> PAGE_SHIFT
))
2698 /* Can we just expand an old private anonymous mapping? */
2699 vma
= vma_merge(mm
, prev
, addr
, addr
+ len
, flags
,
2700 NULL
, NULL
, pgoff
, NULL
, NULL
);
2705 * create a vma struct for an anonymous mapping
2707 vma
= kmem_cache_zalloc(vm_area_cachep
, GFP_KERNEL
);
2709 vm_unacct_memory(len
>> PAGE_SHIFT
);
2713 INIT_LIST_HEAD(&vma
->anon_vma_chain
);
2715 vma
->vm_start
= addr
;
2716 vma
->vm_end
= addr
+ len
;
2717 vma
->vm_pgoff
= pgoff
;
2718 vma
->vm_flags
= flags
;
2719 vma
->vm_page_prot
= vm_get_page_prot(flags
);
2720 vma_link(mm
, vma
, prev
, rb_link
, rb_parent
);
2722 perf_event_mmap(vma
);
2723 mm
->total_vm
+= len
>> PAGE_SHIFT
;
2724 if (flags
& VM_LOCKED
)
2725 mm
->locked_vm
+= (len
>> PAGE_SHIFT
);
2729 unsigned long vm_brk(unsigned long addr
, unsigned long len
)
2731 struct mm_struct
*mm
= current
->mm
;
2735 down_write(&mm
->mmap_sem
);
2736 ret
= do_brk(addr
, len
);
2737 populate
= ((mm
->def_flags
& VM_LOCKED
) != 0);
2738 up_write(&mm
->mmap_sem
);
2740 mm_populate(addr
, len
);
2743 EXPORT_SYMBOL(vm_brk
);
2745 /* Release all mmaps. */
2746 void exit_mmap(struct mm_struct
*mm
)
2748 struct mmu_gather tlb
;
2749 struct vm_area_struct
*vma
;
2750 unsigned long nr_accounted
= 0;
2752 /* mm's last user has gone, and its about to be pulled down */
2753 mmu_notifier_release(mm
);
2755 if (mm
->locked_vm
) {
2758 if (vma
->vm_flags
& VM_LOCKED
)
2759 munlock_vma_pages_all(vma
);
2767 if (!vma
) /* Can happen if dup_mmap() received an OOM */
2772 tlb_gather_mmu(&tlb
, mm
, 0, -1);
2773 /* update_hiwater_rss(mm) here? but nobody should be looking */
2774 /* Use -1 here to ensure all VMAs in the mm are unmapped */
2775 unmap_vmas(&tlb
, vma
, 0, -1);
2777 free_pgtables(&tlb
, vma
, FIRST_USER_ADDRESS
, USER_PGTABLES_CEILING
);
2778 tlb_finish_mmu(&tlb
, 0, -1);
2781 * Walk the list again, actually closing and freeing it,
2782 * with preemption enabled, without holding any MM locks.
2785 if (vma
->vm_flags
& VM_ACCOUNT
)
2786 nr_accounted
+= vma_pages(vma
);
2787 vma
= remove_vma(vma
);
2789 vm_unacct_memory(nr_accounted
);
2791 WARN_ON(mm
->nr_ptes
> (FIRST_USER_ADDRESS
+PMD_SIZE
-1)>>PMD_SHIFT
);
2794 /* Insert vm structure into process list sorted by address
2795 * and into the inode's i_mmap tree. If vm_file is non-NULL
2796 * then i_mmap_mutex is taken here.
2798 int insert_vm_struct(struct mm_struct
*mm
, struct vm_area_struct
*vma
)
2800 struct vm_area_struct
*prev
;
2801 struct rb_node
**rb_link
, *rb_parent
;
2804 * The vm_pgoff of a purely anonymous vma should be irrelevant
2805 * until its first write fault, when page's anon_vma and index
2806 * are set. But now set the vm_pgoff it will almost certainly
2807 * end up with (unless mremap moves it elsewhere before that
2808 * first wfault), so /proc/pid/maps tells a consistent story.
2810 * By setting it to reflect the virtual start address of the
2811 * vma, merges and splits can happen in a seamless way, just
2812 * using the existing file pgoff checks and manipulations.
2813 * Similarly in do_mmap_pgoff and in do_brk.
2815 if (!vma
->vm_file
) {
2816 BUG_ON(vma
->anon_vma
);
2817 vma
->vm_pgoff
= vma
->vm_start
>> PAGE_SHIFT
;
2819 if (find_vma_links(mm
, vma
->vm_start
, vma
->vm_end
,
2820 &prev
, &rb_link
, &rb_parent
))
2822 if ((vma
->vm_flags
& VM_ACCOUNT
) &&
2823 security_vm_enough_memory_mm(mm
, vma_pages(vma
)))
2826 vma_link(mm
, vma
, prev
, rb_link
, rb_parent
);
2831 * Copy the vma structure to a new location in the same mm,
2832 * prior to moving page table entries, to effect an mremap move.
2834 struct vm_area_struct
*copy_vma(struct vm_area_struct
**vmap
,
2835 unsigned long addr
, unsigned long len
, pgoff_t pgoff
,
2836 bool *need_rmap_locks
)
2838 struct vm_area_struct
*vma
= *vmap
;
2839 unsigned long vma_start
= vma
->vm_start
;
2840 struct mm_struct
*mm
= vma
->vm_mm
;
2841 struct vm_area_struct
*new_vma
, *prev
;
2842 struct rb_node
**rb_link
, *rb_parent
;
2843 struct mempolicy
*pol
;
2844 bool faulted_in_anon_vma
= true;
2847 * If anonymous vma has not yet been faulted, update new pgoff
2848 * to match new location, to increase its chance of merging.
2850 if (unlikely(!vma
->vm_file
&& !vma
->anon_vma
)) {
2851 pgoff
= addr
>> PAGE_SHIFT
;
2852 faulted_in_anon_vma
= false;
2855 if (find_vma_links(mm
, addr
, addr
+ len
, &prev
, &rb_link
, &rb_parent
))
2856 return NULL
; /* should never get here */
2857 new_vma
= vma_merge(mm
, prev
, addr
, addr
+ len
, vma
->vm_flags
,
2858 vma
->anon_vma
, vma
->vm_file
, pgoff
, vma_policy(vma
),
2859 vma_get_anon_name(vma
));
2862 * Source vma may have been merged into new_vma
2864 if (unlikely(vma_start
>= new_vma
->vm_start
&&
2865 vma_start
< new_vma
->vm_end
)) {
2867 * The only way we can get a vma_merge with
2868 * self during an mremap is if the vma hasn't
2869 * been faulted in yet and we were allowed to
2870 * reset the dst vma->vm_pgoff to the
2871 * destination address of the mremap to allow
2872 * the merge to happen. mremap must change the
2873 * vm_pgoff linearity between src and dst vmas
2874 * (in turn preventing a vma_merge) to be
2875 * safe. It is only safe to keep the vm_pgoff
2876 * linear if there are no pages mapped yet.
2878 VM_BUG_ON(faulted_in_anon_vma
);
2879 *vmap
= vma
= new_vma
;
2881 *need_rmap_locks
= (new_vma
->vm_pgoff
<= vma
->vm_pgoff
);
2883 new_vma
= kmem_cache_alloc(vm_area_cachep
, GFP_KERNEL
);
2886 new_vma
->vm_start
= addr
;
2887 new_vma
->vm_end
= addr
+ len
;
2888 new_vma
->vm_pgoff
= pgoff
;
2889 pol
= mpol_dup(vma_policy(vma
));
2892 vma_set_policy(new_vma
, pol
);
2893 INIT_LIST_HEAD(&new_vma
->anon_vma_chain
);
2894 if (anon_vma_clone(new_vma
, vma
))
2895 goto out_free_mempol
;
2896 if (new_vma
->vm_file
)
2897 get_file(new_vma
->vm_file
);
2898 if (new_vma
->vm_ops
&& new_vma
->vm_ops
->open
)
2899 new_vma
->vm_ops
->open(new_vma
);
2900 vma_link(mm
, new_vma
, prev
, rb_link
, rb_parent
);
2901 *need_rmap_locks
= false;
2909 kmem_cache_free(vm_area_cachep
, new_vma
);
2914 * Return true if the calling process may expand its vm space by the passed
2917 int may_expand_vm(struct mm_struct
*mm
, unsigned long npages
)
2919 unsigned long cur
= mm
->total_vm
; /* pages */
2922 lim
= rlimit(RLIMIT_AS
) >> PAGE_SHIFT
;
2924 if (cur
+ npages
> lim
)
2930 static int special_mapping_fault(struct vm_area_struct
*vma
,
2931 struct vm_fault
*vmf
)
2934 struct page
**pages
;
2937 * special mappings have no vm_file, and in that case, the mm
2938 * uses vm_pgoff internally. So we have to subtract it from here.
2939 * We are allowed to do this because we are the mm; do not copy
2940 * this code into drivers!
2942 pgoff
= vmf
->pgoff
- vma
->vm_pgoff
;
2944 for (pages
= vma
->vm_private_data
; pgoff
&& *pages
; ++pages
)
2948 struct page
*page
= *pages
;
2954 return VM_FAULT_SIGBUS
;
2958 * Having a close hook prevents vma merging regardless of flags.
2960 static void special_mapping_close(struct vm_area_struct
*vma
)
2964 static const struct vm_operations_struct special_mapping_vmops
= {
2965 .close
= special_mapping_close
,
2966 .fault
= special_mapping_fault
,
2970 * Called with mm->mmap_sem held for writing.
2971 * Insert a new vma covering the given region, with the given flags.
2972 * Its pages are supplied by the given array of struct page *.
2973 * The array can be shorter than len >> PAGE_SHIFT if it's null-terminated.
2974 * The region past the last page supplied will always produce SIGBUS.
2975 * The array pointer and the pages it points to are assumed to stay alive
2976 * for as long as this mapping might exist.
2978 int install_special_mapping(struct mm_struct
*mm
,
2979 unsigned long addr
, unsigned long len
,
2980 unsigned long vm_flags
, struct page
**pages
)
2983 struct vm_area_struct
*vma
;
2985 vma
= kmem_cache_zalloc(vm_area_cachep
, GFP_KERNEL
);
2986 if (unlikely(vma
== NULL
))
2989 INIT_LIST_HEAD(&vma
->anon_vma_chain
);
2991 vma
->vm_start
= addr
;
2992 vma
->vm_end
= addr
+ len
;
2994 vma
->vm_flags
= vm_flags
| mm
->def_flags
| VM_DONTEXPAND
;
2995 vma
->vm_page_prot
= vm_get_page_prot(vma
->vm_flags
);
2997 vma
->vm_ops
= &special_mapping_vmops
;
2998 vma
->vm_private_data
= pages
;
3000 ret
= insert_vm_struct(mm
, vma
);
3004 mm
->total_vm
+= len
>> PAGE_SHIFT
;
3006 perf_event_mmap(vma
);
3011 kmem_cache_free(vm_area_cachep
, vma
);
3015 static DEFINE_MUTEX(mm_all_locks_mutex
);
3017 static void vm_lock_anon_vma(struct mm_struct
*mm
, struct anon_vma
*anon_vma
)
3019 if (!test_bit(0, (unsigned long *) &anon_vma
->root
->rb_root
.rb_node
)) {
3021 * The LSB of head.next can't change from under us
3022 * because we hold the mm_all_locks_mutex.
3024 down_write_nest_lock(&anon_vma
->root
->rwsem
, &mm
->mmap_sem
);
3026 * We can safely modify head.next after taking the
3027 * anon_vma->root->rwsem. If some other vma in this mm shares
3028 * the same anon_vma we won't take it again.
3030 * No need of atomic instructions here, head.next
3031 * can't change from under us thanks to the
3032 * anon_vma->root->rwsem.
3034 if (__test_and_set_bit(0, (unsigned long *)
3035 &anon_vma
->root
->rb_root
.rb_node
))
3040 static void vm_lock_mapping(struct mm_struct
*mm
, struct address_space
*mapping
)
3042 if (!test_bit(AS_MM_ALL_LOCKS
, &mapping
->flags
)) {
3044 * AS_MM_ALL_LOCKS can't change from under us because
3045 * we hold the mm_all_locks_mutex.
3047 * Operations on ->flags have to be atomic because
3048 * even if AS_MM_ALL_LOCKS is stable thanks to the
3049 * mm_all_locks_mutex, there may be other cpus
3050 * changing other bitflags in parallel to us.
3052 if (test_and_set_bit(AS_MM_ALL_LOCKS
, &mapping
->flags
))
3054 mutex_lock_nest_lock(&mapping
->i_mmap_mutex
, &mm
->mmap_sem
);
3059 * This operation locks against the VM for all pte/vma/mm related
3060 * operations that could ever happen on a certain mm. This includes
3061 * vmtruncate, try_to_unmap, and all page faults.
3063 * The caller must take the mmap_sem in write mode before calling
3064 * mm_take_all_locks(). The caller isn't allowed to release the
3065 * mmap_sem until mm_drop_all_locks() returns.
3067 * mmap_sem in write mode is required in order to block all operations
3068 * that could modify pagetables and free pages without need of
3069 * altering the vma layout (for example populate_range() with
3070 * nonlinear vmas). It's also needed in write mode to avoid new
3071 * anon_vmas to be associated with existing vmas.
3073 * A single task can't take more than one mm_take_all_locks() in a row
3074 * or it would deadlock.
3076 * The LSB in anon_vma->rb_root.rb_node and the AS_MM_ALL_LOCKS bitflag in
3077 * mapping->flags avoid to take the same lock twice, if more than one
3078 * vma in this mm is backed by the same anon_vma or address_space.
3080 * We can take all the locks in random order because the VM code
3081 * taking i_mmap_mutex or anon_vma->rwsem outside the mmap_sem never
3082 * takes more than one of them in a row. Secondly we're protected
3083 * against a concurrent mm_take_all_locks() by the mm_all_locks_mutex.
3085 * mm_take_all_locks() and mm_drop_all_locks are expensive operations
3086 * that may have to take thousand of locks.
3088 * mm_take_all_locks() can fail if it's interrupted by signals.
3090 int mm_take_all_locks(struct mm_struct
*mm
)
3092 struct vm_area_struct
*vma
;
3093 struct anon_vma_chain
*avc
;
3095 BUG_ON(down_read_trylock(&mm
->mmap_sem
));
3097 mutex_lock(&mm_all_locks_mutex
);
3099 for (vma
= mm
->mmap
; vma
; vma
= vma
->vm_next
) {
3100 if (signal_pending(current
))
3102 if (vma
->vm_file
&& vma
->vm_file
->f_mapping
)
3103 vm_lock_mapping(mm
, vma
->vm_file
->f_mapping
);
3106 for (vma
= mm
->mmap
; vma
; vma
= vma
->vm_next
) {
3107 if (signal_pending(current
))
3110 list_for_each_entry(avc
, &vma
->anon_vma_chain
, same_vma
)
3111 vm_lock_anon_vma(mm
, avc
->anon_vma
);
3117 mm_drop_all_locks(mm
);
3121 static void vm_unlock_anon_vma(struct anon_vma
*anon_vma
)
3123 if (test_bit(0, (unsigned long *) &anon_vma
->root
->rb_root
.rb_node
)) {
3125 * The LSB of head.next can't change to 0 from under
3126 * us because we hold the mm_all_locks_mutex.
3128 * We must however clear the bitflag before unlocking
3129 * the vma so the users using the anon_vma->rb_root will
3130 * never see our bitflag.
3132 * No need of atomic instructions here, head.next
3133 * can't change from under us until we release the
3134 * anon_vma->root->rwsem.
3136 if (!__test_and_clear_bit(0, (unsigned long *)
3137 &anon_vma
->root
->rb_root
.rb_node
))
3139 anon_vma_unlock_write(anon_vma
);
3143 static void vm_unlock_mapping(struct address_space
*mapping
)
3145 if (test_bit(AS_MM_ALL_LOCKS
, &mapping
->flags
)) {
3147 * AS_MM_ALL_LOCKS can't change to 0 from under us
3148 * because we hold the mm_all_locks_mutex.
3150 mutex_unlock(&mapping
->i_mmap_mutex
);
3151 if (!test_and_clear_bit(AS_MM_ALL_LOCKS
,
3158 * The mmap_sem cannot be released by the caller until
3159 * mm_drop_all_locks() returns.
3161 void mm_drop_all_locks(struct mm_struct
*mm
)
3163 struct vm_area_struct
*vma
;
3164 struct anon_vma_chain
*avc
;
3166 BUG_ON(down_read_trylock(&mm
->mmap_sem
));
3167 BUG_ON(!mutex_is_locked(&mm_all_locks_mutex
));
3169 for (vma
= mm
->mmap
; vma
; vma
= vma
->vm_next
) {
3171 list_for_each_entry(avc
, &vma
->anon_vma_chain
, same_vma
)
3172 vm_unlock_anon_vma(avc
->anon_vma
);
3173 if (vma
->vm_file
&& vma
->vm_file
->f_mapping
)
3174 vm_unlock_mapping(vma
->vm_file
->f_mapping
);
3177 mutex_unlock(&mm_all_locks_mutex
);
3181 * initialise the VMA slab
3183 void __init
mmap_init(void)
3187 ret
= percpu_counter_init(&vm_committed_as
, 0);
3192 * Initialise sysctl_user_reserve_kbytes.
3194 * This is intended to prevent a user from starting a single memory hogging
3195 * process, such that they cannot recover (kill the hog) in OVERCOMMIT_NEVER
3198 * The default value is min(3% of free memory, 128MB)
3199 * 128MB is enough to recover with sshd/login, bash, and top/kill.
3201 static int init_user_reserve(void)
3203 unsigned long free_kbytes
;
3205 free_kbytes
= global_page_state(NR_FREE_PAGES
) << (PAGE_SHIFT
- 10);
3207 sysctl_user_reserve_kbytes
= min(free_kbytes
/ 32, 1UL << 17);
3210 module_init(init_user_reserve
)
3213 * Initialise sysctl_admin_reserve_kbytes.
3215 * The purpose of sysctl_admin_reserve_kbytes is to allow the sys admin
3216 * to log in and kill a memory hogging process.
3218 * Systems with more than 256MB will reserve 8MB, enough to recover
3219 * with sshd, bash, and top in OVERCOMMIT_GUESS. Smaller systems will
3220 * only reserve 3% of free pages by default.
3222 static int init_admin_reserve(void)
3224 unsigned long free_kbytes
;
3226 free_kbytes
= global_page_state(NR_FREE_PAGES
) << (PAGE_SHIFT
- 10);
3228 sysctl_admin_reserve_kbytes
= min(free_kbytes
/ 32, 1UL << 13);
3231 module_init(init_admin_reserve
)
3234 * Reinititalise user and admin reserves if memory is added or removed.
3236 * The default user reserve max is 128MB, and the default max for the
3237 * admin reserve is 8MB. These are usually, but not always, enough to
3238 * enable recovery from a memory hogging process using login/sshd, a shell,
3239 * and tools like top. It may make sense to increase or even disable the
3240 * reserve depending on the existence of swap or variations in the recovery
3241 * tools. So, the admin may have changed them.
3243 * If memory is added and the reserves have been eliminated or increased above
3244 * the default max, then we'll trust the admin.
3246 * If memory is removed and there isn't enough free memory, then we
3247 * need to reset the reserves.
3249 * Otherwise keep the reserve set by the admin.
3251 static int reserve_mem_notifier(struct notifier_block
*nb
,
3252 unsigned long action
, void *data
)
3254 unsigned long tmp
, free_kbytes
;
3258 /* Default max is 128MB. Leave alone if modified by operator. */
3259 tmp
= sysctl_user_reserve_kbytes
;
3260 if (0 < tmp
&& tmp
< (1UL << 17))
3261 init_user_reserve();
3263 /* Default max is 8MB. Leave alone if modified by operator. */
3264 tmp
= sysctl_admin_reserve_kbytes
;
3265 if (0 < tmp
&& tmp
< (1UL << 13))
3266 init_admin_reserve();
3270 free_kbytes
= global_page_state(NR_FREE_PAGES
) << (PAGE_SHIFT
- 10);
3272 if (sysctl_user_reserve_kbytes
> free_kbytes
) {
3273 init_user_reserve();
3274 pr_info("vm.user_reserve_kbytes reset to %lu\n",
3275 sysctl_user_reserve_kbytes
);
3278 if (sysctl_admin_reserve_kbytes
> free_kbytes
) {
3279 init_admin_reserve();
3280 pr_info("vm.admin_reserve_kbytes reset to %lu\n",
3281 sysctl_admin_reserve_kbytes
);
3290 static struct notifier_block reserve_mem_nb
= {
3291 .notifier_call
= reserve_mem_notifier
,
3294 static int __meminit
init_reserve_notifier(void)
3296 if (register_hotmemory_notifier(&reserve_mem_nb
))
3297 printk("Failed registering memory add/remove notifier for admin reserve");
3301 module_init(init_reserve_notifier
)