blob: 0ee6be4f1ba44e231da18c7e38d217610ac4bcd5 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07002 * flexible mmap layout support
3 *
4 * Copyright 2003-2004 Red Hat Inc., Durham, North Carolina.
5 * All Rights Reserved.
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
11 *
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 *
21 *
22 * Started by Ingo Molnar <mingo@elte.hu>
23 */
24
25#include <linux/personality.h>
26#include <linux/mm.h>
Anton Blanchard9f14c422009-02-22 01:50:01 +000027#include <linux/random.h>
Ingo Molnar3f07c012017-02-08 18:51:30 +010028#include <linux/sched/signal.h>
Ingo Molnar01042602017-02-08 18:51:31 +010029#include <linux/sched/mm.h>
Daniel Axtens7f92bc52016-01-06 11:45:51 +110030#include <linux/elf-randomize.h>
Aneesh Kumar K.V7a0eede2016-04-29 23:26:11 +100031#include <linux/security.h>
32#include <linux/mman.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070033
34/*
35 * Top of mmap area (just below the process stack).
36 *
Anton Blanchard002b0ec2009-02-22 01:50:06 +000037 * Leave at least a ~128 MB hole on 32bit applications.
38 *
39 * On 64bit applications we randomise the stack by 1GB so we need to
40 * space our mmap start address by a further 1GB, otherwise there is a
41 * chance the mmap area will end up closer to the stack than our ulimit
42 * requires.
Linus Torvalds1da177e2005-04-16 15:20:36 -070043 */
Anton Blanchard002b0ec2009-02-22 01:50:06 +000044#define MIN_GAP32 (128*1024*1024)
45#define MIN_GAP64 ((128 + 1024)*1024*1024UL)
46#define MIN_GAP ((is_32bit_task()) ? MIN_GAP32 : MIN_GAP64)
Linus Torvalds1da177e2005-04-16 15:20:36 -070047#define MAX_GAP (TASK_SIZE/6*5)
48
Anton Blanchard13a2cb32009-02-22 01:50:00 +000049static inline int mmap_is_legacy(void)
50{
51 if (current->personality & ADDR_COMPAT_LAYOUT)
52 return 1;
53
Jiri Slaby4bf936b2010-01-06 05:24:31 +000054 if (rlimit(RLIMIT_STACK) == RLIM_INFINITY)
Anton Blanchard13a2cb32009-02-22 01:50:00 +000055 return 1;
56
57 return sysctl_legacy_va_layout;
58}
59
Kees Cook2b68f6c2015-04-14 15:48:00 -070060unsigned long arch_mmap_rnd(void)
Anton Blanchard9f14c422009-02-22 01:50:01 +000061{
Michael Ellerman9fea59b2017-04-21 00:36:20 +100062 unsigned long shift, rnd;
Anton Blanchard9f14c422009-02-22 01:50:01 +000063
Michael Ellerman9fea59b2017-04-21 00:36:20 +100064 shift = mmap_rnd_bits;
65#ifdef CONFIG_COMPAT
Kees Cooked632272015-04-14 15:47:54 -070066 if (is_32bit_task())
Michael Ellerman9fea59b2017-04-21 00:36:20 +100067 shift = mmap_rnd_compat_bits;
68#endif
Michael Ellermanb4099462017-04-25 20:49:24 +100069 rnd = get_random_long() % (1ul << shift);
Kees Cooked632272015-04-14 15:47:54 -070070
Dan McGeefa8cbaa2011-10-17 13:05:23 +000071 return rnd << PAGE_SHIFT;
Anton Blanchard9f14c422009-02-22 01:50:01 +000072}
73
Kees Cooked632272015-04-14 15:47:54 -070074static inline unsigned long mmap_base(unsigned long rnd)
Linus Torvalds1da177e2005-04-16 15:20:36 -070075{
Jiri Slaby4bf936b2010-01-06 05:24:31 +000076 unsigned long gap = rlimit(RLIMIT_STACK);
Linus Torvalds1da177e2005-04-16 15:20:36 -070077
78 if (gap < MIN_GAP)
79 gap = MIN_GAP;
80 else if (gap > MAX_GAP)
81 gap = MAX_GAP;
82
Aneesh Kumar K.Vf4ea6dc2017-03-30 16:35:21 +053083 return PAGE_ALIGN(DEFAULT_MAP_WINDOW - gap - rnd);
Linus Torvalds1da177e2005-04-16 15:20:36 -070084}
85
Aneesh Kumar K.V7a0eede2016-04-29 23:26:11 +100086#ifdef CONFIG_PPC_RADIX_MMU
87/*
88 * Same function as generic code used only for radix, because we don't need to overload
89 * the generic one. But we will have to duplicate, because hash select
90 * HAVE_ARCH_UNMAPPED_AREA
91 */
92static unsigned long
93radix__arch_get_unmapped_area(struct file *filp, unsigned long addr,
94 unsigned long len, unsigned long pgoff,
95 unsigned long flags)
96{
97 struct mm_struct *mm = current->mm;
98 struct vm_area_struct *vma;
99 struct vm_unmapped_area_info info;
100
Aneesh Kumar K.V321f7d22017-04-18 12:31:27 +0530101 if (unlikely(addr > mm->context.addr_limit &&
102 mm->context.addr_limit != TASK_SIZE))
Aneesh Kumar K.Vf4ea6dc2017-03-30 16:35:21 +0530103 mm->context.addr_limit = TASK_SIZE;
104
Aneesh Kumar K.Vbe77e992017-04-14 00:48:21 +0530105 if (len > mm->task_size - mmap_min_addr)
Aneesh Kumar K.V7a0eede2016-04-29 23:26:11 +1000106 return -ENOMEM;
107
108 if (flags & MAP_FIXED)
109 return addr;
110
111 if (addr) {
112 addr = PAGE_ALIGN(addr);
113 vma = find_vma(mm, addr);
Aneesh Kumar K.Vbe77e992017-04-14 00:48:21 +0530114 if (mm->task_size - len >= addr && addr >= mmap_min_addr &&
Hugh Dickins1be71072017-06-19 04:03:24 -0700115 (!vma || addr + len <= vm_start_gap(vma)))
Aneesh Kumar K.V7a0eede2016-04-29 23:26:11 +1000116 return addr;
117 }
118
119 info.flags = 0;
120 info.length = len;
121 info.low_limit = mm->mmap_base;
Aneesh Kumar K.V7a0eede2016-04-29 23:26:11 +1000122 info.align_mask = 0;
Aneesh Kumar K.Vf4ea6dc2017-03-30 16:35:21 +0530123
124 if (unlikely(addr > DEFAULT_MAP_WINDOW))
125 info.high_limit = mm->context.addr_limit;
126 else
127 info.high_limit = DEFAULT_MAP_WINDOW;
128
Aneesh Kumar K.V7a0eede2016-04-29 23:26:11 +1000129 return vm_unmapped_area(&info);
130}
131
132static unsigned long
133radix__arch_get_unmapped_area_topdown(struct file *filp,
134 const unsigned long addr0,
135 const unsigned long len,
136 const unsigned long pgoff,
137 const unsigned long flags)
138{
139 struct vm_area_struct *vma;
140 struct mm_struct *mm = current->mm;
141 unsigned long addr = addr0;
142 struct vm_unmapped_area_info info;
143
Aneesh Kumar K.V321f7d22017-04-18 12:31:27 +0530144 if (unlikely(addr > mm->context.addr_limit &&
145 mm->context.addr_limit != TASK_SIZE))
Aneesh Kumar K.Vf4ea6dc2017-03-30 16:35:21 +0530146 mm->context.addr_limit = TASK_SIZE;
147
Aneesh Kumar K.V7a0eede2016-04-29 23:26:11 +1000148 /* requested length too big for entire address space */
Aneesh Kumar K.Vbe77e992017-04-14 00:48:21 +0530149 if (len > mm->task_size - mmap_min_addr)
Aneesh Kumar K.V7a0eede2016-04-29 23:26:11 +1000150 return -ENOMEM;
151
152 if (flags & MAP_FIXED)
153 return addr;
154
155 /* requesting a specific address */
156 if (addr) {
157 addr = PAGE_ALIGN(addr);
158 vma = find_vma(mm, addr);
Aneesh Kumar K.Vbe77e992017-04-14 00:48:21 +0530159 if (mm->task_size - len >= addr && addr >= mmap_min_addr &&
Hugh Dickins1be71072017-06-19 04:03:24 -0700160 (!vma || addr + len <= vm_start_gap(vma)))
Aneesh Kumar K.V7a0eede2016-04-29 23:26:11 +1000161 return addr;
162 }
163
164 info.flags = VM_UNMAPPED_AREA_TOPDOWN;
165 info.length = len;
166 info.low_limit = max(PAGE_SIZE, mmap_min_addr);
167 info.high_limit = mm->mmap_base;
168 info.align_mask = 0;
Aneesh Kumar K.Vf4ea6dc2017-03-30 16:35:21 +0530169
170 if (addr > DEFAULT_MAP_WINDOW)
171 info.high_limit += mm->context.addr_limit - DEFAULT_MAP_WINDOW;
172
Aneesh Kumar K.V7a0eede2016-04-29 23:26:11 +1000173 addr = vm_unmapped_area(&info);
Aneesh Kumar K.Vf4ea6dc2017-03-30 16:35:21 +0530174 if (!(addr & ~PAGE_MASK))
175 return addr;
176 VM_BUG_ON(addr != -ENOMEM);
Aneesh Kumar K.V7a0eede2016-04-29 23:26:11 +1000177
178 /*
179 * A failed mmap() very likely causes application failure,
180 * so fall back to the bottom-up function here. This scenario
181 * can happen with large stack limits and large mmap()
182 * allocations.
183 */
Aneesh Kumar K.Vf4ea6dc2017-03-30 16:35:21 +0530184 return radix__arch_get_unmapped_area(filp, addr0, len, pgoff, flags);
Aneesh Kumar K.V7a0eede2016-04-29 23:26:11 +1000185}
186
187static void radix__arch_pick_mmap_layout(struct mm_struct *mm,
188 unsigned long random_factor)
189{
190 if (mmap_is_legacy()) {
191 mm->mmap_base = TASK_UNMAPPED_BASE;
192 mm->get_unmapped_area = radix__arch_get_unmapped_area;
193 } else {
194 mm->mmap_base = mmap_base(random_factor);
195 mm->get_unmapped_area = radix__arch_get_unmapped_area_topdown;
196 }
197}
198#else
199/* dummy */
200extern void radix__arch_pick_mmap_layout(struct mm_struct *mm,
201 unsigned long random_factor);
202#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700203/*
204 * This function, called very early during the creation of a new
205 * process VM image, sets up which VM layout function to use:
206 */
207void arch_pick_mmap_layout(struct mm_struct *mm)
208{
Kees Cooked632272015-04-14 15:47:54 -0700209 unsigned long random_factor = 0UL;
210
211 if (current->flags & PF_RANDOMIZE)
Kees Cook2b68f6c2015-04-14 15:48:00 -0700212 random_factor = arch_mmap_rnd();
Kees Cooked632272015-04-14 15:47:54 -0700213
Aneesh Kumar K.V7a0eede2016-04-29 23:26:11 +1000214 if (radix_enabled())
215 return radix__arch_pick_mmap_layout(mm, random_factor);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700216 /*
217 * Fall back to the standard layout if the personality
218 * bit is set, or if the expected stack growth is unlimited:
219 */
220 if (mmap_is_legacy()) {
221 mm->mmap_base = TASK_UNMAPPED_BASE;
222 mm->get_unmapped_area = arch_get_unmapped_area;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700223 } else {
Kees Cooked632272015-04-14 15:47:54 -0700224 mm->mmap_base = mmap_base(random_factor);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700225 mm->get_unmapped_area = arch_get_unmapped_area_topdown;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700226 }
227}