|
@@ -183,6 +183,7 @@ SYSCALL_DEFINE1(brk, unsigned long, brk)
|
|
|
unsigned long retval;
|
|
|
unsigned long newbrk, oldbrk;
|
|
|
struct mm_struct *mm = current->mm;
|
|
|
+ struct vm_area_struct *next;
|
|
|
unsigned long min_brk;
|
|
|
bool populate;
|
|
|
LIST_HEAD(uf);
|
|
@@ -229,7 +230,8 @@ SYSCALL_DEFINE1(brk, unsigned long, brk)
|
|
|
}
|
|
|
|
|
|
/* Check against existing mmap mappings. */
|
|
|
- if (find_vma_intersection(mm, oldbrk, newbrk+PAGE_SIZE))
|
|
|
+ next = find_vma(mm, oldbrk);
|
|
|
+ if (next && newbrk + PAGE_SIZE > vm_start_gap(next))
|
|
|
goto out;
|
|
|
|
|
|
/* Ok, looks good - let it rip. */
|
|
@@ -253,10 +255,22 @@ out:
|
|
|
|
|
|
static long vma_compute_subtree_gap(struct vm_area_struct *vma)
|
|
|
{
|
|
|
- unsigned long max, subtree_gap;
|
|
|
- max = vma->vm_start;
|
|
|
- if (vma->vm_prev)
|
|
|
- max -= vma->vm_prev->vm_end;
|
|
|
+ unsigned long max, prev_end, subtree_gap;
|
|
|
+
|
|
|
+ /*
|
|
|
+ * Note: in the rare case of a VM_GROWSDOWN above a VM_GROWSUP, we
|
|
|
+ * allow two stack_guard_gaps between them here, and when choosing
|
|
|
+ * an unmapped area; whereas when expanding we only require one.
|
|
|
+ * That's a little inconsistent, but keeps the code here simpler.
|
|
|
+ */
|
|
|
+ max = vm_start_gap(vma);
|
|
|
+ if (vma->vm_prev) {
|
|
|
+ prev_end = vm_end_gap(vma->vm_prev);
|
|
|
+ if (max > prev_end)
|
|
|
+ max -= prev_end;
|
|
|
+ else
|
|
|
+ max = 0;
|
|
|
+ }
|
|
|
if (vma->vm_rb.rb_left) {
|
|
|
subtree_gap = rb_entry(vma->vm_rb.rb_left,
|
|
|
struct vm_area_struct, vm_rb)->rb_subtree_gap;
|
|
@@ -352,7 +366,7 @@ static void validate_mm(struct mm_struct *mm)
|
|
|
anon_vma_unlock_read(anon_vma);
|
|
|
}
|
|
|
|
|
|
- highest_address = vma->vm_end;
|
|
|
+ highest_address = vm_end_gap(vma);
|
|
|
vma = vma->vm_next;
|
|
|
i++;
|
|
|
}
|
|
@@ -541,7 +555,7 @@ void __vma_link_rb(struct mm_struct *mm, struct vm_area_struct *vma,
|
|
|
if (vma->vm_next)
|
|
|
vma_gap_update(vma->vm_next);
|
|
|
else
|
|
|
- mm->highest_vm_end = vma->vm_end;
|
|
|
+ mm->highest_vm_end = vm_end_gap(vma);
|
|
|
|
|
|
/*
|
|
|
* vma->vm_prev wasn't known when we followed the rbtree to find the
|
|
@@ -856,7 +870,7 @@ again:
|
|
|
vma_gap_update(vma);
|
|
|
if (end_changed) {
|
|
|
if (!next)
|
|
|
- mm->highest_vm_end = end;
|
|
|
+ mm->highest_vm_end = vm_end_gap(vma);
|
|
|
else if (!adjust_next)
|
|
|
vma_gap_update(next);
|
|
|
}
|
|
@@ -941,7 +955,7 @@ again:
|
|
|
* mm->highest_vm_end doesn't need any update
|
|
|
* in remove_next == 1 case.
|
|
|
*/
|
|
|
- VM_WARN_ON(mm->highest_vm_end != end);
|
|
|
+ VM_WARN_ON(mm->highest_vm_end != vm_end_gap(vma));
|
|
|
}
|
|
|
}
|
|
|
if (insert && file)
|
|
@@ -1787,7 +1801,7 @@ unsigned long unmapped_area(struct vm_unmapped_area_info *info)
|
|
|
|
|
|
while (true) {
|
|
|
/* Visit left subtree if it looks promising */
|
|
|
- gap_end = vma->vm_start;
|
|
|
+ gap_end = vm_start_gap(vma);
|
|
|
if (gap_end >= low_limit && vma->vm_rb.rb_left) {
|
|
|
struct vm_area_struct *left =
|
|
|
rb_entry(vma->vm_rb.rb_left,
|
|
@@ -1798,7 +1812,7 @@ unsigned long unmapped_area(struct vm_unmapped_area_info *info)
|
|
|
}
|
|
|
}
|
|
|
|
|
|
- gap_start = vma->vm_prev ? vma->vm_prev->vm_end : 0;
|
|
|
+ gap_start = vma->vm_prev ? vm_end_gap(vma->vm_prev) : 0;
|
|
|
check_current:
|
|
|
/* Check if current node has a suitable gap */
|
|
|
if (gap_start > high_limit)
|
|
@@ -1825,8 +1839,8 @@ check_current:
|
|
|
vma = rb_entry(rb_parent(prev),
|
|
|
struct vm_area_struct, vm_rb);
|
|
|
if (prev == vma->vm_rb.rb_left) {
|
|
|
- gap_start = vma->vm_prev->vm_end;
|
|
|
- gap_end = vma->vm_start;
|
|
|
+ gap_start = vm_end_gap(vma->vm_prev);
|
|
|
+ gap_end = vm_start_gap(vma);
|
|
|
goto check_current;
|
|
|
}
|
|
|
}
|
|
@@ -1890,7 +1904,7 @@ unsigned long unmapped_area_topdown(struct vm_unmapped_area_info *info)
|
|
|
|
|
|
while (true) {
|
|
|
/* Visit right subtree if it looks promising */
|
|
|
- gap_start = vma->vm_prev ? vma->vm_prev->vm_end : 0;
|
|
|
+ gap_start = vma->vm_prev ? vm_end_gap(vma->vm_prev) : 0;
|
|
|
if (gap_start <= high_limit && vma->vm_rb.rb_right) {
|
|
|
struct vm_area_struct *right =
|
|
|
rb_entry(vma->vm_rb.rb_right,
|
|
@@ -1903,7 +1917,7 @@ unsigned long unmapped_area_topdown(struct vm_unmapped_area_info *info)
|
|
|
|
|
|
check_current:
|
|
|
/* Check if current node has a suitable gap */
|
|
|
- gap_end = vma->vm_start;
|
|
|
+ gap_end = vm_start_gap(vma);
|
|
|
if (gap_end < low_limit)
|
|
|
return -ENOMEM;
|
|
|
if (gap_start <= high_limit && gap_end - gap_start >= length)
|
|
@@ -1929,7 +1943,7 @@ check_current:
|
|
|
struct vm_area_struct, vm_rb);
|
|
|
if (prev == vma->vm_rb.rb_right) {
|
|
|
gap_start = vma->vm_prev ?
|
|
|
- vma->vm_prev->vm_end : 0;
|
|
|
+ vm_end_gap(vma->vm_prev) : 0;
|
|
|
goto check_current;
|
|
|
}
|
|
|
}
|
|
@@ -1967,7 +1981,7 @@ arch_get_unmapped_area(struct file *filp, unsigned long addr,
|
|
|
unsigned long len, unsigned long pgoff, unsigned long flags)
|
|
|
{
|
|
|
struct mm_struct *mm = current->mm;
|
|
|
- struct vm_area_struct *vma;
|
|
|
+ struct vm_area_struct *vma, *prev;
|
|
|
struct vm_unmapped_area_info info;
|
|
|
|
|
|
if (len > TASK_SIZE - mmap_min_addr)
|
|
@@ -1978,9 +1992,10 @@ arch_get_unmapped_area(struct file *filp, unsigned long addr,
|
|
|
|
|
|
if (addr) {
|
|
|
addr = PAGE_ALIGN(addr);
|
|
|
- vma = find_vma(mm, addr);
|
|
|
+ vma = find_vma_prev(mm, addr, &prev);
|
|
|
if (TASK_SIZE - len >= addr && addr >= mmap_min_addr &&
|
|
|
- (!vma || addr + len <= vma->vm_start))
|
|
|
+ (!vma || addr + len <= vm_start_gap(vma)) &&
|
|
|
+ (!prev || addr >= vm_end_gap(prev)))
|
|
|
return addr;
|
|
|
}
|
|
|
|
|
@@ -2003,7 +2018,7 @@ arch_get_unmapped_area_topdown(struct file *filp, const unsigned long addr0,
|
|
|
const unsigned long len, const unsigned long pgoff,
|
|
|
const unsigned long flags)
|
|
|
{
|
|
|
- struct vm_area_struct *vma;
|
|
|
+ struct vm_area_struct *vma, *prev;
|
|
|
struct mm_struct *mm = current->mm;
|
|
|
unsigned long addr = addr0;
|
|
|
struct vm_unmapped_area_info info;
|
|
@@ -2018,9 +2033,10 @@ arch_get_unmapped_area_topdown(struct file *filp, const unsigned long addr0,
|
|
|
/* requesting a specific address */
|
|
|
if (addr) {
|
|
|
addr = PAGE_ALIGN(addr);
|
|
|
- vma = find_vma(mm, addr);
|
|
|
+ vma = find_vma_prev(mm, addr, &prev);
|
|
|
if (TASK_SIZE - len >= addr && addr >= mmap_min_addr &&
|
|
|
- (!vma || addr + len <= vma->vm_start))
|
|
|
+ (!vma || addr + len <= vm_start_gap(vma)) &&
|
|
|
+ (!prev || addr >= vm_end_gap(prev)))
|
|
|
return addr;
|
|
|
}
|
|
|
|
|
@@ -2155,21 +2171,19 @@ find_vma_prev(struct mm_struct *mm, unsigned long addr,
|
|
|
* update accounting. This is shared with both the
|
|
|
* grow-up and grow-down cases.
|
|
|
*/
|
|
|
-static int acct_stack_growth(struct vm_area_struct *vma, unsigned long size, unsigned long grow)
|
|
|
+static int acct_stack_growth(struct vm_area_struct *vma,
|
|
|
+ unsigned long size, unsigned long grow)
|
|
|
{
|
|
|
struct mm_struct *mm = vma->vm_mm;
|
|
|
struct rlimit *rlim = current->signal->rlim;
|
|
|
- unsigned long new_start, actual_size;
|
|
|
+ unsigned long new_start;
|
|
|
|
|
|
/* address space limit tests */
|
|
|
if (!may_expand_vm(mm, vma->vm_flags, grow))
|
|
|
return -ENOMEM;
|
|
|
|
|
|
/* Stack limit test */
|
|
|
- actual_size = size;
|
|
|
- if (size && (vma->vm_flags & (VM_GROWSUP | VM_GROWSDOWN)))
|
|
|
- actual_size -= PAGE_SIZE;
|
|
|
- if (actual_size > READ_ONCE(rlim[RLIMIT_STACK].rlim_cur))
|
|
|
+ if (size > READ_ONCE(rlim[RLIMIT_STACK].rlim_cur))
|
|
|
return -ENOMEM;
|
|
|
|
|
|
/* mlock limit tests */
|
|
@@ -2207,17 +2221,30 @@ static int acct_stack_growth(struct vm_area_struct *vma, unsigned long size, uns
|
|
|
int expand_upwards(struct vm_area_struct *vma, unsigned long address)
|
|
|
{
|
|
|
struct mm_struct *mm = vma->vm_mm;
|
|
|
+ struct vm_area_struct *next;
|
|
|
+ unsigned long gap_addr;
|
|
|
int error = 0;
|
|
|
|
|
|
if (!(vma->vm_flags & VM_GROWSUP))
|
|
|
return -EFAULT;
|
|
|
|
|
|
/* Guard against wrapping around to address 0. */
|
|
|
- if (address < PAGE_ALIGN(address+4))
|
|
|
- address = PAGE_ALIGN(address+4);
|
|
|
- else
|
|
|
+ address &= PAGE_MASK;
|
|
|
+ address += PAGE_SIZE;
|
|
|
+ if (!address)
|
|
|
return -ENOMEM;
|
|
|
|
|
|
+ /* Enforce stack_guard_gap */
|
|
|
+ gap_addr = address + stack_guard_gap;
|
|
|
+ if (gap_addr < address)
|
|
|
+ return -ENOMEM;
|
|
|
+ next = vma->vm_next;
|
|
|
+ if (next && next->vm_start < gap_addr) {
|
|
|
+ if (!(next->vm_flags & VM_GROWSUP))
|
|
|
+ return -ENOMEM;
|
|
|
+ /* Check that both stack segments have the same anon_vma? */
|
|
|
+ }
|
|
|
+
|
|
|
/* We must make sure the anon_vma is allocated. */
|
|
|
if (unlikely(anon_vma_prepare(vma)))
|
|
|
return -ENOMEM;
|
|
@@ -2261,7 +2288,7 @@ int expand_upwards(struct vm_area_struct *vma, unsigned long address)
|
|
|
if (vma->vm_next)
|
|
|
vma_gap_update(vma->vm_next);
|
|
|
else
|
|
|
- mm->highest_vm_end = address;
|
|
|
+ mm->highest_vm_end = vm_end_gap(vma);
|
|
|
spin_unlock(&mm->page_table_lock);
|
|
|
|
|
|
perf_event_mmap(vma);
|
|
@@ -2282,6 +2309,8 @@ int expand_downwards(struct vm_area_struct *vma,
|
|
|
unsigned long address)
|
|
|
{
|
|
|
struct mm_struct *mm = vma->vm_mm;
|
|
|
+ struct vm_area_struct *prev;
|
|
|
+ unsigned long gap_addr;
|
|
|
int error;
|
|
|
|
|
|
address &= PAGE_MASK;
|
|
@@ -2289,6 +2318,17 @@ int expand_downwards(struct vm_area_struct *vma,
|
|
|
if (error)
|
|
|
return error;
|
|
|
|
|
|
+ /* Enforce stack_guard_gap */
|
|
|
+ gap_addr = address - stack_guard_gap;
|
|
|
+ if (gap_addr > address)
|
|
|
+ return -ENOMEM;
|
|
|
+ prev = vma->vm_prev;
|
|
|
+ if (prev && prev->vm_end > gap_addr) {
|
|
|
+ if (!(prev->vm_flags & VM_GROWSDOWN))
|
|
|
+ return -ENOMEM;
|
|
|
+ /* Check that both stack segments have the same anon_vma? */
|
|
|
+ }
|
|
|
+
|
|
|
/* We must make sure the anon_vma is allocated. */
|
|
|
if (unlikely(anon_vma_prepare(vma)))
|
|
|
return -ENOMEM;
|
|
@@ -2343,28 +2383,25 @@ int expand_downwards(struct vm_area_struct *vma,
|
|
|
return error;
|
|
|
}
|
|
|
|
|
|
-/*
|
|
|
- * Note how expand_stack() refuses to expand the stack all the way to
|
|
|
- * abut the next virtual mapping, *unless* that mapping itself is also
|
|
|
- * a stack mapping. We want to leave room for a guard page, after all
|
|
|
- * (the guard page itself is not added here, that is done by the
|
|
|
- * actual page faulting logic)
|
|
|
- *
|
|
|
- * This matches the behavior of the guard page logic (see mm/memory.c:
|
|
|
- * check_stack_guard_page()), which only allows the guard page to be
|
|
|
- * removed under these circumstances.
|
|
|
- */
|
|
|
+/* enforced gap between the expanding stack and other mappings. */
|
|
|
+unsigned long stack_guard_gap = 256UL<<PAGE_SHIFT;
|
|
|
+
|
|
|
+static int __init cmdline_parse_stack_guard_gap(char *p)
|
|
|
+{
|
|
|
+ unsigned long val;
|
|
|
+ char *endptr;
|
|
|
+
|
|
|
+ val = simple_strtoul(p, &endptr, 10);
|
|
|
+ if (!*endptr)
|
|
|
+ stack_guard_gap = val << PAGE_SHIFT;
|
|
|
+
|
|
|
+ return 0;
|
|
|
+}
|
|
|
+__setup("stack_guard_gap=", cmdline_parse_stack_guard_gap);
|
|
|
+
|
|
|
#ifdef CONFIG_STACK_GROWSUP
|
|
|
int expand_stack(struct vm_area_struct *vma, unsigned long address)
|
|
|
{
|
|
|
- struct vm_area_struct *next;
|
|
|
-
|
|
|
- address &= PAGE_MASK;
|
|
|
- next = vma->vm_next;
|
|
|
- if (next && next->vm_start == address + PAGE_SIZE) {
|
|
|
- if (!(next->vm_flags & VM_GROWSUP))
|
|
|
- return -ENOMEM;
|
|
|
- }
|
|
|
return expand_upwards(vma, address);
|
|
|
}
|
|
|
|
|
@@ -2386,14 +2423,6 @@ find_extend_vma(struct mm_struct *mm, unsigned long addr)
|
|
|
#else
|
|
|
int expand_stack(struct vm_area_struct *vma, unsigned long address)
|
|
|
{
|
|
|
- struct vm_area_struct *prev;
|
|
|
-
|
|
|
- address &= PAGE_MASK;
|
|
|
- prev = vma->vm_prev;
|
|
|
- if (prev && prev->vm_end == address) {
|
|
|
- if (!(prev->vm_flags & VM_GROWSDOWN))
|
|
|
- return -ENOMEM;
|
|
|
- }
|
|
|
return expand_downwards(vma, address);
|
|
|
}
|
|
|
|
|
@@ -2491,7 +2520,7 @@ detach_vmas_to_be_unmapped(struct mm_struct *mm, struct vm_area_struct *vma,
|
|
|
vma->vm_prev = prev;
|
|
|
vma_gap_update(vma);
|
|
|
} else
|
|
|
- mm->highest_vm_end = prev ? prev->vm_end : 0;
|
|
|
+ mm->highest_vm_end = prev ? vm_end_gap(prev) : 0;
|
|
|
tail_vma->vm_next = NULL;
|
|
|
|
|
|
/* Kill the cache */
|