2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* flexible mmap layout support
|
|
|
|
*
|
|
|
|
* Copyright 2003-2004 Red Hat Inc., Durham, North Carolina.
|
|
|
|
* All Rights Reserved.
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* Started by Ingo Molnar <mingo@elte.hu>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/personality.h>
|
|
|
|
#include <linux/mm.h>
|
2009-02-22 08:50:01 +07:00
|
|
|
#include <linux/random.h>
|
2017-02-09 00:51:30 +07:00
|
|
|
#include <linux/sched/signal.h>
|
2017-02-09 00:51:31 +07:00
|
|
|
#include <linux/sched/mm.h>
|
2016-01-06 07:45:51 +07:00
|
|
|
#include <linux/elf-randomize.h>
|
2016-04-29 20:26:11 +07:00
|
|
|
#include <linux/security.h>
|
|
|
|
#include <linux/mman.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Top of mmap area (just below the process stack).
|
|
|
|
*
|
2017-07-13 04:36:39 +07:00
|
|
|
* Leave at least a ~128 MB hole.
|
2005-04-17 05:20:36 +07:00
|
|
|
*/
|
2017-07-13 04:36:39 +07:00
|
|
|
#define MIN_GAP (128*1024*1024)
|
2005-04-17 05:20:36 +07:00
|
|
|
#define MAX_GAP (TASK_SIZE/6*5)
|
|
|
|
|
2009-02-22 08:50:00 +07:00
|
|
|
static inline int mmap_is_legacy(void)
|
|
|
|
{
|
|
|
|
if (current->personality & ADDR_COMPAT_LAYOUT)
|
|
|
|
return 1;
|
|
|
|
|
2010-01-06 12:24:31 +07:00
|
|
|
if (rlimit(RLIMIT_STACK) == RLIM_INFINITY)
|
2009-02-22 08:50:00 +07:00
|
|
|
return 1;
|
|
|
|
|
|
|
|
return sysctl_legacy_va_layout;
|
|
|
|
}
|
|
|
|
|
2015-04-15 05:48:00 +07:00
|
|
|
unsigned long arch_mmap_rnd(void)
|
2009-02-22 08:50:01 +07:00
|
|
|
{
|
2017-04-20 21:36:20 +07:00
|
|
|
unsigned long shift, rnd;
|
2015-04-15 05:47:54 +07:00
|
|
|
|
2017-04-20 21:36:20 +07:00
|
|
|
shift = mmap_rnd_bits;
|
|
|
|
#ifdef CONFIG_COMPAT
|
2015-04-15 05:47:54 +07:00
|
|
|
if (is_32bit_task())
|
2017-04-20 21:36:20 +07:00
|
|
|
shift = mmap_rnd_compat_bits;
|
|
|
|
#endif
|
2017-04-25 17:49:24 +07:00
|
|
|
rnd = get_random_long() % (1ul << shift);
|
2009-02-22 08:50:01 +07:00
|
|
|
|
2011-10-17 20:05:23 +07:00
|
|
|
return rnd << PAGE_SHIFT;
|
2009-02-22 08:50:01 +07:00
|
|
|
}
|
|
|
|
|
2017-07-13 04:36:39 +07:00
|
|
|
static inline unsigned long stack_maxrandom_size(void)
|
|
|
|
{
|
|
|
|
if (!(current->flags & PF_RANDOMIZE))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* 8MB for 32bit, 1GB for 64bit */
|
|
|
|
if (is_32bit_task())
|
|
|
|
return (1<<23);
|
|
|
|
else
|
|
|
|
return (1<<30);
|
|
|
|
}
|
|
|
|
|
2015-04-15 05:47:54 +07:00
|
|
|
static inline unsigned long mmap_base(unsigned long rnd)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2010-01-06 12:24:31 +07:00
|
|
|
unsigned long gap = rlimit(RLIMIT_STACK);
|
2017-07-13 04:36:39 +07:00
|
|
|
unsigned long pad = stack_maxrandom_size() + stack_guard_gap;
|
|
|
|
|
|
|
|
/* Values close to RLIM_INFINITY can overflow. */
|
|
|
|
if (gap + pad > gap)
|
|
|
|
gap += pad;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
if (gap < MIN_GAP)
|
|
|
|
gap = MIN_GAP;
|
|
|
|
else if (gap > MAX_GAP)
|
|
|
|
gap = MAX_GAP;
|
|
|
|
|
2017-03-30 18:05:21 +07:00
|
|
|
return PAGE_ALIGN(DEFAULT_MAP_WINDOW - gap - rnd);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2016-04-29 20:26:11 +07:00
|
|
|
#ifdef CONFIG_PPC_RADIX_MMU
|
|
|
|
/*
|
|
|
|
* Same function as generic code used only for radix, because we don't need to overload
|
|
|
|
* the generic one. But we will have to duplicate, because hash select
|
|
|
|
* HAVE_ARCH_UNMAPPED_AREA
|
|
|
|
*/
|
|
|
|
static unsigned long
|
|
|
|
radix__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;
|
2017-11-10 00:27:39 +07:00
|
|
|
int fixed = (flags & MAP_FIXED);
|
|
|
|
unsigned long high_limit;
|
2016-04-29 20:26:11 +07:00
|
|
|
struct vm_unmapped_area_info info;
|
|
|
|
|
2017-11-10 00:27:39 +07:00
|
|
|
high_limit = DEFAULT_MAP_WINDOW;
|
|
|
|
if (addr >= high_limit || (fixed && (addr + len > high_limit)))
|
|
|
|
high_limit = TASK_SIZE;
|
|
|
|
|
|
|
|
if (len > high_limit)
|
|
|
|
return -ENOMEM;
|
2017-11-10 00:27:40 +07:00
|
|
|
|
2017-11-10 00:27:39 +07:00
|
|
|
if (fixed) {
|
|
|
|
if (addr > high_limit - len)
|
|
|
|
return -ENOMEM;
|
2016-04-29 20:26:11 +07:00
|
|
|
return addr;
|
2017-11-10 00:27:40 +07:00
|
|
|
}
|
2016-04-29 20:26:11 +07:00
|
|
|
|
|
|
|
if (addr) {
|
|
|
|
addr = PAGE_ALIGN(addr);
|
|
|
|
vma = find_vma(mm, addr);
|
2017-11-10 00:27:39 +07:00
|
|
|
if (high_limit - len >= addr && addr >= mmap_min_addr &&
|
mm: larger stack guard gap, between vmas
Stack guard page is a useful feature to reduce a risk of stack smashing
into a different mapping. We have been using a single page gap which
is sufficient to prevent having stack adjacent to a different mapping.
But this seems to be insufficient in the light of the stack usage in
userspace. E.g. glibc uses as large as 64kB alloca() in many commonly
used functions. Others use constructs liks gid_t buffer[NGROUPS_MAX]
which is 256kB or stack strings with MAX_ARG_STRLEN.
This will become especially dangerous for suid binaries and the default
no limit for the stack size limit because those applications can be
tricked to consume a large portion of the stack and a single glibc call
could jump over the guard page. These attacks are not theoretical,
unfortunatelly.
Make those attacks less probable by increasing the stack guard gap
to 1MB (on systems with 4k pages; but make it depend on the page size
because systems with larger base pages might cap stack allocations in
the PAGE_SIZE units) which should cover larger alloca() and VLA stack
allocations. It is obviously not a full fix because the problem is
somehow inherent, but it should reduce attack space a lot.
One could argue that the gap size should be configurable from userspace,
but that can be done later when somebody finds that the new 1MB is wrong
for some special case applications. For now, add a kernel command line
option (stack_guard_gap) to specify the stack gap size (in page units).
Implementation wise, first delete all the old code for stack guard page:
because although we could get away with accounting one extra page in a
stack vma, accounting a larger gap can break userspace - case in point,
a program run with "ulimit -S -v 20000" failed when the 1MB gap was
counted for RLIMIT_AS; similar problems could come with RLIMIT_MLOCK
and strict non-overcommit mode.
Instead of keeping gap inside the stack vma, maintain the stack guard
gap as a gap between vmas: using vm_start_gap() in place of vm_start
(or vm_end_gap() in place of vm_end if VM_GROWSUP) in just those few
places which need to respect the gap - mainly arch_get_unmapped_area(),
and and the vma tree's subtree_gap support for that.
Original-patch-by: Oleg Nesterov <oleg@redhat.com>
Original-patch-by: Michal Hocko <mhocko@suse.com>
Signed-off-by: Hugh Dickins <hughd@google.com>
Acked-by: Michal Hocko <mhocko@suse.com>
Tested-by: Helge Deller <deller@gmx.de> # parisc
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2017-06-19 18:03:24 +07:00
|
|
|
(!vma || addr + len <= vm_start_gap(vma)))
|
2016-04-29 20:26:11 +07:00
|
|
|
return addr;
|
|
|
|
}
|
|
|
|
|
|
|
|
info.flags = 0;
|
|
|
|
info.length = len;
|
|
|
|
info.low_limit = mm->mmap_base;
|
2017-11-10 00:27:39 +07:00
|
|
|
info.high_limit = high_limit;
|
2016-04-29 20:26:11 +07:00
|
|
|
info.align_mask = 0;
|
2017-03-30 18:05:21 +07:00
|
|
|
|
2016-04-29 20:26:11 +07:00
|
|
|
return vm_unmapped_area(&info);
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned long
|
|
|
|
radix__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 mm_struct *mm = current->mm;
|
|
|
|
unsigned long addr = addr0;
|
2017-11-10 00:27:39 +07:00
|
|
|
int fixed = (flags & MAP_FIXED);
|
|
|
|
unsigned long high_limit;
|
2016-04-29 20:26:11 +07:00
|
|
|
struct vm_unmapped_area_info info;
|
|
|
|
|
2017-11-10 00:27:39 +07:00
|
|
|
high_limit = DEFAULT_MAP_WINDOW;
|
|
|
|
if (addr >= high_limit || (fixed && (addr + len > high_limit)))
|
|
|
|
high_limit = TASK_SIZE;
|
|
|
|
|
|
|
|
if (len > high_limit)
|
|
|
|
return -ENOMEM;
|
2017-11-10 00:27:40 +07:00
|
|
|
|
2017-11-10 00:27:39 +07:00
|
|
|
if (fixed) {
|
|
|
|
if (addr > high_limit - len)
|
|
|
|
return -ENOMEM;
|
2016-04-29 20:26:11 +07:00
|
|
|
return addr;
|
2017-11-10 00:27:40 +07:00
|
|
|
}
|
2016-04-29 20:26:11 +07:00
|
|
|
|
|
|
|
if (addr) {
|
|
|
|
addr = PAGE_ALIGN(addr);
|
|
|
|
vma = find_vma(mm, addr);
|
2017-11-10 00:27:39 +07:00
|
|
|
if (high_limit - len >= addr && addr >= mmap_min_addr &&
|
|
|
|
(!vma || addr + len <= vm_start_gap(vma)))
|
2016-04-29 20:26:11 +07:00
|
|
|
return addr;
|
|
|
|
}
|
|
|
|
|
|
|
|
info.flags = VM_UNMAPPED_AREA_TOPDOWN;
|
|
|
|
info.length = len;
|
|
|
|
info.low_limit = max(PAGE_SIZE, mmap_min_addr);
|
2017-11-10 00:27:39 +07:00
|
|
|
info.high_limit = mm->mmap_base + (high_limit - DEFAULT_MAP_WINDOW);
|
2016-04-29 20:26:11 +07:00
|
|
|
info.align_mask = 0;
|
2017-03-30 18:05:21 +07:00
|
|
|
|
2016-04-29 20:26:11 +07:00
|
|
|
addr = vm_unmapped_area(&info);
|
2017-03-30 18:05:21 +07:00
|
|
|
if (!(addr & ~PAGE_MASK))
|
|
|
|
return addr;
|
|
|
|
VM_BUG_ON(addr != -ENOMEM);
|
2016-04-29 20:26:11 +07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* A failed mmap() very likely causes application failure,
|
|
|
|
* so fall back to the bottom-up function here. This scenario
|
|
|
|
* can happen with large stack limits and large mmap()
|
|
|
|
* allocations.
|
|
|
|
*/
|
2017-03-30 18:05:21 +07:00
|
|
|
return radix__arch_get_unmapped_area(filp, addr0, len, pgoff, flags);
|
2016-04-29 20:26:11 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
static void radix__arch_pick_mmap_layout(struct mm_struct *mm,
|
|
|
|
unsigned long random_factor)
|
|
|
|
{
|
|
|
|
if (mmap_is_legacy()) {
|
|
|
|
mm->mmap_base = TASK_UNMAPPED_BASE;
|
|
|
|
mm->get_unmapped_area = radix__arch_get_unmapped_area;
|
|
|
|
} else {
|
|
|
|
mm->mmap_base = mmap_base(random_factor);
|
|
|
|
mm->get_unmapped_area = radix__arch_get_unmapped_area_topdown;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
/* dummy */
|
|
|
|
extern void radix__arch_pick_mmap_layout(struct mm_struct *mm,
|
|
|
|
unsigned long random_factor);
|
|
|
|
#endif
|
2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* This function, called very early during the creation of a new
|
|
|
|
* process VM image, sets up which VM layout function to use:
|
|
|
|
*/
|
|
|
|
void arch_pick_mmap_layout(struct mm_struct *mm)
|
|
|
|
{
|
2015-04-15 05:47:54 +07:00
|
|
|
unsigned long random_factor = 0UL;
|
|
|
|
|
|
|
|
if (current->flags & PF_RANDOMIZE)
|
2015-04-15 05:48:00 +07:00
|
|
|
random_factor = arch_mmap_rnd();
|
2015-04-15 05:47:54 +07:00
|
|
|
|
2016-04-29 20:26:11 +07:00
|
|
|
if (radix_enabled())
|
|
|
|
return radix__arch_pick_mmap_layout(mm, random_factor);
|
2005-04-17 05:20:36 +07:00
|
|
|
/*
|
|
|
|
* Fall back to the standard layout if the personality
|
|
|
|
* bit is set, or if the expected stack growth is unlimited:
|
|
|
|
*/
|
|
|
|
if (mmap_is_legacy()) {
|
|
|
|
mm->mmap_base = TASK_UNMAPPED_BASE;
|
|
|
|
mm->get_unmapped_area = arch_get_unmapped_area;
|
|
|
|
} else {
|
2015-04-15 05:47:54 +07:00
|
|
|
mm->mmap_base = mmap_base(random_factor);
|
2005-04-17 05:20:36 +07:00
|
|
|
mm->get_unmapped_area = arch_get_unmapped_area_topdown;
|
|
|
|
}
|
|
|
|
}
|