]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * linux/mm/nommu.c | |
3 | * | |
4 | * Replacement code for mm functions to support CPU's that don't | |
5 | * have any form of memory management unit (thus no virtual memory). | |
6 | * | |
7 | * See Documentation/nommu-mmap.txt | |
8 | * | |
8feae131 | 9 | * Copyright (c) 2004-2008 David Howells <[email protected]> |
1da177e4 LT |
10 | * Copyright (c) 2000-2003 David McCullough <[email protected]> |
11 | * Copyright (c) 2000-2001 D Jeff Dionne <[email protected]> | |
12 | * Copyright (c) 2002 Greg Ungerer <[email protected]> | |
29c185e5 | 13 | * Copyright (c) 2007-2010 Paul Mundt <[email protected]> |
1da177e4 LT |
14 | */ |
15 | ||
b95f1b31 | 16 | #include <linux/export.h> |
1da177e4 LT |
17 | #include <linux/mm.h> |
18 | #include <linux/mman.h> | |
19 | #include <linux/swap.h> | |
20 | #include <linux/file.h> | |
21 | #include <linux/highmem.h> | |
22 | #include <linux/pagemap.h> | |
23 | #include <linux/slab.h> | |
24 | #include <linux/vmalloc.h> | |
1da177e4 LT |
25 | #include <linux/blkdev.h> |
26 | #include <linux/backing-dev.h> | |
27 | #include <linux/mount.h> | |
28 | #include <linux/personality.h> | |
29 | #include <linux/security.h> | |
30 | #include <linux/syscalls.h> | |
120a795d | 31 | #include <linux/audit.h> |
cf4aebc2 | 32 | #include <linux/sched/sysctl.h> |
1da177e4 LT |
33 | |
34 | #include <asm/uaccess.h> | |
35 | #include <asm/tlb.h> | |
36 | #include <asm/tlbflush.h> | |
eb8cdec4 | 37 | #include <asm/mmu_context.h> |
8feae131 DH |
38 | #include "internal.h" |
39 | ||
8feae131 DH |
40 | #if 0 |
41 | #define kenter(FMT, ...) \ | |
42 | printk(KERN_DEBUG "==> %s("FMT")\n", __func__, ##__VA_ARGS__) | |
43 | #define kleave(FMT, ...) \ | |
44 | printk(KERN_DEBUG "<== %s()"FMT"\n", __func__, ##__VA_ARGS__) | |
45 | #define kdebug(FMT, ...) \ | |
46 | printk(KERN_DEBUG "xxx" FMT"yyy\n", ##__VA_ARGS__) | |
47 | #else | |
48 | #define kenter(FMT, ...) \ | |
49 | no_printk(KERN_DEBUG "==> %s("FMT")\n", __func__, ##__VA_ARGS__) | |
50 | #define kleave(FMT, ...) \ | |
51 | no_printk(KERN_DEBUG "<== %s()"FMT"\n", __func__, ##__VA_ARGS__) | |
52 | #define kdebug(FMT, ...) \ | |
53 | no_printk(KERN_DEBUG FMT"\n", ##__VA_ARGS__) | |
54 | #endif | |
1da177e4 LT |
55 | |
56 | void *high_memory; | |
57 | struct page *mem_map; | |
58 | unsigned long max_mapnr; | |
59 | unsigned long num_physpages; | |
4266c97a | 60 | unsigned long highest_memmap_pfn; |
00a62ce9 | 61 | struct percpu_counter vm_committed_as; |
1da177e4 LT |
62 | int sysctl_overcommit_memory = OVERCOMMIT_GUESS; /* heuristic overcommit */ |
63 | int sysctl_overcommit_ratio = 50; /* default is 50% */ | |
64 | int sysctl_max_map_count = DEFAULT_MAX_MAP_COUNT; | |
fc4d5c29 | 65 | int sysctl_nr_trim_pages = CONFIG_NOMMU_INITIAL_TRIM_EXCESS; |
c9b1d098 | 66 | unsigned long sysctl_user_reserve_kbytes __read_mostly = 1UL << 17; /* 128MB */ |
4eeab4f5 | 67 | unsigned long sysctl_admin_reserve_kbytes __read_mostly = 1UL << 13; /* 8MB */ |
1da177e4 LT |
68 | int heap_stack_gap = 0; |
69 | ||
33e5d769 | 70 | atomic_long_t mmap_pages_allocated; |
8feae131 | 71 | |
997071bc S |
72 | /* |
73 | * The global memory commitment made in the system can be a metric | |
74 | * that can be used to drive ballooning decisions when Linux is hosted | |
75 | * as a guest. On Hyper-V, the host implements a policy engine for dynamically | |
76 | * balancing memory across competing virtual machines that are hosted. | |
77 | * Several metrics drive this policy engine including the guest reported | |
78 | * memory commitment. | |
79 | */ | |
80 | unsigned long vm_memory_committed(void) | |
81 | { | |
82 | return percpu_counter_read_positive(&vm_committed_as); | |
83 | } | |
84 | ||
85 | EXPORT_SYMBOL_GPL(vm_memory_committed); | |
86 | ||
1da177e4 | 87 | EXPORT_SYMBOL(mem_map); |
6a04de6d | 88 | EXPORT_SYMBOL(num_physpages); |
1da177e4 | 89 | |
8feae131 DH |
90 | /* list of mapped, potentially shareable regions */ |
91 | static struct kmem_cache *vm_region_jar; | |
92 | struct rb_root nommu_region_tree = RB_ROOT; | |
93 | DECLARE_RWSEM(nommu_region_sem); | |
1da177e4 | 94 | |
f0f37e2f | 95 | const struct vm_operations_struct generic_file_vm_ops = { |
1da177e4 LT |
96 | }; |
97 | ||
1da177e4 LT |
98 | /* |
99 | * Return the total memory allocated for this pointer, not | |
100 | * just what the caller asked for. | |
101 | * | |
102 | * Doesn't have to be accurate, i.e. may have races. | |
103 | */ | |
104 | unsigned int kobjsize(const void *objp) | |
105 | { | |
106 | struct page *page; | |
107 | ||
4016a139 MH |
108 | /* |
109 | * If the object we have should not have ksize performed on it, | |
110 | * return size of 0 | |
111 | */ | |
5a1603be | 112 | if (!objp || !virt_addr_valid(objp)) |
6cfd53fc PM |
113 | return 0; |
114 | ||
115 | page = virt_to_head_page(objp); | |
6cfd53fc PM |
116 | |
117 | /* | |
118 | * If the allocator sets PageSlab, we know the pointer came from | |
119 | * kmalloc(). | |
120 | */ | |
1da177e4 LT |
121 | if (PageSlab(page)) |
122 | return ksize(objp); | |
123 | ||
ab2e83ea PM |
124 | /* |
125 | * If it's not a compound page, see if we have a matching VMA | |
126 | * region. This test is intentionally done in reverse order, | |
127 | * so if there's no VMA, we still fall through and hand back | |
128 | * PAGE_SIZE for 0-order pages. | |
129 | */ | |
130 | if (!PageCompound(page)) { | |
131 | struct vm_area_struct *vma; | |
132 | ||
133 | vma = find_vma(current->mm, (unsigned long)objp); | |
134 | if (vma) | |
135 | return vma->vm_end - vma->vm_start; | |
136 | } | |
137 | ||
6cfd53fc PM |
138 | /* |
139 | * The ksize() function is only guaranteed to work for pointers | |
5a1603be | 140 | * returned by kmalloc(). So handle arbitrary pointers here. |
6cfd53fc | 141 | */ |
5a1603be | 142 | return PAGE_SIZE << compound_order(page); |
1da177e4 LT |
143 | } |
144 | ||
28a35716 ML |
145 | long __get_user_pages(struct task_struct *tsk, struct mm_struct *mm, |
146 | unsigned long start, unsigned long nr_pages, | |
147 | unsigned int foll_flags, struct page **pages, | |
148 | struct vm_area_struct **vmas, int *nonblocking) | |
1da177e4 | 149 | { |
910e46da | 150 | struct vm_area_struct *vma; |
7b4d5b8b DH |
151 | unsigned long vm_flags; |
152 | int i; | |
153 | ||
154 | /* calculate required read or write permissions. | |
58fa879e | 155 | * If FOLL_FORCE is set, we only require the "MAY" flags. |
7b4d5b8b | 156 | */ |
58fa879e HD |
157 | vm_flags = (foll_flags & FOLL_WRITE) ? |
158 | (VM_WRITE | VM_MAYWRITE) : (VM_READ | VM_MAYREAD); | |
159 | vm_flags &= (foll_flags & FOLL_FORCE) ? | |
160 | (VM_MAYREAD | VM_MAYWRITE) : (VM_READ | VM_WRITE); | |
1da177e4 | 161 | |
9d73777e | 162 | for (i = 0; i < nr_pages; i++) { |
7561e8ca | 163 | vma = find_vma(mm, start); |
7b4d5b8b DH |
164 | if (!vma) |
165 | goto finish_or_fault; | |
166 | ||
167 | /* protect what we can, including chardevs */ | |
1c3aff1c HD |
168 | if ((vma->vm_flags & (VM_IO | VM_PFNMAP)) || |
169 | !(vm_flags & vma->vm_flags)) | |
7b4d5b8b | 170 | goto finish_or_fault; |
910e46da | 171 | |
1da177e4 LT |
172 | if (pages) { |
173 | pages[i] = virt_to_page(start); | |
174 | if (pages[i]) | |
175 | page_cache_get(pages[i]); | |
176 | } | |
177 | if (vmas) | |
910e46da | 178 | vmas[i] = vma; |
e1ee65d8 | 179 | start = (start + PAGE_SIZE) & PAGE_MASK; |
1da177e4 | 180 | } |
7b4d5b8b DH |
181 | |
182 | return i; | |
183 | ||
184 | finish_or_fault: | |
185 | return i ? : -EFAULT; | |
1da177e4 | 186 | } |
b291f000 | 187 | |
b291f000 NP |
188 | /* |
189 | * get a list of pages in an address range belonging to the specified process | |
190 | * and indicate the VMA that covers each page | |
191 | * - this is potentially dodgy as we may end incrementing the page count of a | |
192 | * slab page or a secondary page from a compound page | |
193 | * - don't permit access to VMAs that don't support it, such as I/O mappings | |
194 | */ | |
28a35716 ML |
195 | long get_user_pages(struct task_struct *tsk, struct mm_struct *mm, |
196 | unsigned long start, unsigned long nr_pages, | |
197 | int write, int force, struct page **pages, | |
198 | struct vm_area_struct **vmas) | |
b291f000 NP |
199 | { |
200 | int flags = 0; | |
201 | ||
202 | if (write) | |
58fa879e | 203 | flags |= FOLL_WRITE; |
b291f000 | 204 | if (force) |
58fa879e | 205 | flags |= FOLL_FORCE; |
b291f000 | 206 | |
53a7706d ML |
207 | return __get_user_pages(tsk, mm, start, nr_pages, flags, pages, vmas, |
208 | NULL); | |
b291f000 | 209 | } |
66aa2b4b GU |
210 | EXPORT_SYMBOL(get_user_pages); |
211 | ||
dfc2f91a PM |
212 | /** |
213 | * follow_pfn - look up PFN at a user virtual address | |
214 | * @vma: memory mapping | |
215 | * @address: user virtual address | |
216 | * @pfn: location to store found PFN | |
217 | * | |
218 | * Only IO mappings and raw PFN mappings are allowed. | |
219 | * | |
220 | * Returns zero and the pfn at @pfn on success, -ve otherwise. | |
221 | */ | |
222 | int follow_pfn(struct vm_area_struct *vma, unsigned long address, | |
223 | unsigned long *pfn) | |
224 | { | |
225 | if (!(vma->vm_flags & (VM_IO | VM_PFNMAP))) | |
226 | return -EINVAL; | |
227 | ||
228 | *pfn = address >> PAGE_SHIFT; | |
229 | return 0; | |
230 | } | |
231 | EXPORT_SYMBOL(follow_pfn); | |
232 | ||
f1c4069e | 233 | LIST_HEAD(vmap_area_list); |
1da177e4 | 234 | |
b3bdda02 | 235 | void vfree(const void *addr) |
1da177e4 LT |
236 | { |
237 | kfree(addr); | |
238 | } | |
b5073173 | 239 | EXPORT_SYMBOL(vfree); |
1da177e4 | 240 | |
dd0fc66f | 241 | void *__vmalloc(unsigned long size, gfp_t gfp_mask, pgprot_t prot) |
1da177e4 LT |
242 | { |
243 | /* | |
8518609d RD |
244 | * You can't specify __GFP_HIGHMEM with kmalloc() since kmalloc() |
245 | * returns only a logical address. | |
1da177e4 | 246 | */ |
84097518 | 247 | return kmalloc(size, (gfp_mask | __GFP_COMP) & ~__GFP_HIGHMEM); |
1da177e4 | 248 | } |
b5073173 | 249 | EXPORT_SYMBOL(__vmalloc); |
1da177e4 | 250 | |
f905bc44 PM |
251 | void *vmalloc_user(unsigned long size) |
252 | { | |
253 | void *ret; | |
254 | ||
255 | ret = __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO, | |
256 | PAGE_KERNEL); | |
257 | if (ret) { | |
258 | struct vm_area_struct *vma; | |
259 | ||
260 | down_write(¤t->mm->mmap_sem); | |
261 | vma = find_vma(current->mm, (unsigned long)ret); | |
262 | if (vma) | |
263 | vma->vm_flags |= VM_USERMAP; | |
264 | up_write(¤t->mm->mmap_sem); | |
265 | } | |
266 | ||
267 | return ret; | |
268 | } | |
269 | EXPORT_SYMBOL(vmalloc_user); | |
270 | ||
b3bdda02 | 271 | struct page *vmalloc_to_page(const void *addr) |
1da177e4 LT |
272 | { |
273 | return virt_to_page(addr); | |
274 | } | |
b5073173 | 275 | EXPORT_SYMBOL(vmalloc_to_page); |
1da177e4 | 276 | |
b3bdda02 | 277 | unsigned long vmalloc_to_pfn(const void *addr) |
1da177e4 LT |
278 | { |
279 | return page_to_pfn(virt_to_page(addr)); | |
280 | } | |
b5073173 | 281 | EXPORT_SYMBOL(vmalloc_to_pfn); |
1da177e4 LT |
282 | |
283 | long vread(char *buf, char *addr, unsigned long count) | |
284 | { | |
285 | memcpy(buf, addr, count); | |
286 | return count; | |
287 | } | |
288 | ||
289 | long vwrite(char *buf, char *addr, unsigned long count) | |
290 | { | |
291 | /* Don't allow overflow */ | |
292 | if ((unsigned long) addr + count < count) | |
293 | count = -(unsigned long) addr; | |
294 | ||
295 | memcpy(addr, buf, count); | |
296 | return(count); | |
297 | } | |
298 | ||
299 | /* | |
300 | * vmalloc - allocate virtually continguos memory | |
301 | * | |
302 | * @size: allocation size | |
303 | * | |
304 | * Allocate enough pages to cover @size from the page level | |
305 | * allocator and map them into continguos kernel virtual space. | |
306 | * | |
c1c8897f | 307 | * For tight control over page level allocator and protection flags |
1da177e4 LT |
308 | * use __vmalloc() instead. |
309 | */ | |
310 | void *vmalloc(unsigned long size) | |
311 | { | |
312 | return __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL); | |
313 | } | |
f6138882 AM |
314 | EXPORT_SYMBOL(vmalloc); |
315 | ||
e1ca7788 DY |
316 | /* |
317 | * vzalloc - allocate virtually continguos memory with zero fill | |
318 | * | |
319 | * @size: allocation size | |
320 | * | |
321 | * Allocate enough pages to cover @size from the page level | |
322 | * allocator and map them into continguos kernel virtual space. | |
323 | * The memory allocated is set to zero. | |
324 | * | |
325 | * For tight control over page level allocator and protection flags | |
326 | * use __vmalloc() instead. | |
327 | */ | |
328 | void *vzalloc(unsigned long size) | |
329 | { | |
330 | return __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO, | |
331 | PAGE_KERNEL); | |
332 | } | |
333 | EXPORT_SYMBOL(vzalloc); | |
334 | ||
335 | /** | |
336 | * vmalloc_node - allocate memory on a specific node | |
337 | * @size: allocation size | |
338 | * @node: numa node | |
339 | * | |
340 | * Allocate enough pages to cover @size from the page level | |
341 | * allocator and map them into contiguous kernel virtual space. | |
342 | * | |
343 | * For tight control over page level allocator and protection flags | |
344 | * use __vmalloc() instead. | |
345 | */ | |
f6138882 AM |
346 | void *vmalloc_node(unsigned long size, int node) |
347 | { | |
348 | return vmalloc(size); | |
349 | } | |
9a14f653 | 350 | EXPORT_SYMBOL(vmalloc_node); |
e1ca7788 DY |
351 | |
352 | /** | |
353 | * vzalloc_node - allocate memory on a specific node with zero fill | |
354 | * @size: allocation size | |
355 | * @node: numa node | |
356 | * | |
357 | * Allocate enough pages to cover @size from the page level | |
358 | * allocator and map them into contiguous kernel virtual space. | |
359 | * The memory allocated is set to zero. | |
360 | * | |
361 | * For tight control over page level allocator and protection flags | |
362 | * use __vmalloc() instead. | |
363 | */ | |
364 | void *vzalloc_node(unsigned long size, int node) | |
365 | { | |
366 | return vzalloc(size); | |
367 | } | |
368 | EXPORT_SYMBOL(vzalloc_node); | |
1da177e4 | 369 | |
1af446ed PM |
370 | #ifndef PAGE_KERNEL_EXEC |
371 | # define PAGE_KERNEL_EXEC PAGE_KERNEL | |
372 | #endif | |
373 | ||
374 | /** | |
375 | * vmalloc_exec - allocate virtually contiguous, executable memory | |
376 | * @size: allocation size | |
377 | * | |
378 | * Kernel-internal function to allocate enough pages to cover @size | |
379 | * the page level allocator and map them into contiguous and | |
380 | * executable kernel virtual space. | |
381 | * | |
382 | * For tight control over page level allocator and protection flags | |
383 | * use __vmalloc() instead. | |
384 | */ | |
385 | ||
386 | void *vmalloc_exec(unsigned long size) | |
387 | { | |
388 | return __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL_EXEC); | |
389 | } | |
390 | ||
b5073173 PM |
391 | /** |
392 | * vmalloc_32 - allocate virtually contiguous memory (32bit addressable) | |
1da177e4 LT |
393 | * @size: allocation size |
394 | * | |
395 | * Allocate enough 32bit PA addressable pages to cover @size from the | |
396 | * page level allocator and map them into continguos kernel virtual space. | |
397 | */ | |
398 | void *vmalloc_32(unsigned long size) | |
399 | { | |
400 | return __vmalloc(size, GFP_KERNEL, PAGE_KERNEL); | |
401 | } | |
b5073173 PM |
402 | EXPORT_SYMBOL(vmalloc_32); |
403 | ||
404 | /** | |
405 | * vmalloc_32_user - allocate zeroed virtually contiguous 32bit memory | |
406 | * @size: allocation size | |
407 | * | |
408 | * The resulting memory area is 32bit addressable and zeroed so it can be | |
409 | * mapped to userspace without leaking data. | |
f905bc44 PM |
410 | * |
411 | * VM_USERMAP is set on the corresponding VMA so that subsequent calls to | |
412 | * remap_vmalloc_range() are permissible. | |
b5073173 PM |
413 | */ |
414 | void *vmalloc_32_user(unsigned long size) | |
415 | { | |
f905bc44 PM |
416 | /* |
417 | * We'll have to sort out the ZONE_DMA bits for 64-bit, | |
418 | * but for now this can simply use vmalloc_user() directly. | |
419 | */ | |
420 | return vmalloc_user(size); | |
b5073173 PM |
421 | } |
422 | EXPORT_SYMBOL(vmalloc_32_user); | |
1da177e4 LT |
423 | |
424 | void *vmap(struct page **pages, unsigned int count, unsigned long flags, pgprot_t prot) | |
425 | { | |
426 | BUG(); | |
427 | return NULL; | |
428 | } | |
b5073173 | 429 | EXPORT_SYMBOL(vmap); |
1da177e4 | 430 | |
b3bdda02 | 431 | void vunmap(const void *addr) |
1da177e4 LT |
432 | { |
433 | BUG(); | |
434 | } | |
b5073173 | 435 | EXPORT_SYMBOL(vunmap); |
1da177e4 | 436 | |
eb6434d9 PM |
437 | void *vm_map_ram(struct page **pages, unsigned int count, int node, pgprot_t prot) |
438 | { | |
439 | BUG(); | |
440 | return NULL; | |
441 | } | |
442 | EXPORT_SYMBOL(vm_map_ram); | |
443 | ||
444 | void vm_unmap_ram(const void *mem, unsigned int count) | |
445 | { | |
446 | BUG(); | |
447 | } | |
448 | EXPORT_SYMBOL(vm_unmap_ram); | |
449 | ||
450 | void vm_unmap_aliases(void) | |
451 | { | |
452 | } | |
453 | EXPORT_SYMBOL_GPL(vm_unmap_aliases); | |
454 | ||
1eeb66a1 CH |
455 | /* |
456 | * Implement a stub for vmalloc_sync_all() if the architecture chose not to | |
457 | * have one. | |
458 | */ | |
459 | void __attribute__((weak)) vmalloc_sync_all(void) | |
460 | { | |
461 | } | |
462 | ||
29c185e5 PM |
463 | /** |
464 | * alloc_vm_area - allocate a range of kernel address space | |
465 | * @size: size of the area | |
466 | * | |
467 | * Returns: NULL on failure, vm_struct on success | |
468 | * | |
469 | * This function reserves a range of kernel address space, and | |
470 | * allocates pagetables to map that range. No actual mappings | |
471 | * are created. If the kernel address space is not shared | |
472 | * between processes, it syncs the pagetable across all | |
473 | * processes. | |
474 | */ | |
cd12909c | 475 | struct vm_struct *alloc_vm_area(size_t size, pte_t **ptes) |
29c185e5 PM |
476 | { |
477 | BUG(); | |
478 | return NULL; | |
479 | } | |
480 | EXPORT_SYMBOL_GPL(alloc_vm_area); | |
481 | ||
482 | void free_vm_area(struct vm_struct *area) | |
483 | { | |
484 | BUG(); | |
485 | } | |
486 | EXPORT_SYMBOL_GPL(free_vm_area); | |
487 | ||
b5073173 PM |
488 | int vm_insert_page(struct vm_area_struct *vma, unsigned long addr, |
489 | struct page *page) | |
490 | { | |
491 | return -EINVAL; | |
492 | } | |
493 | EXPORT_SYMBOL(vm_insert_page); | |
494 | ||
1da177e4 LT |
495 | /* |
496 | * sys_brk() for the most part doesn't need the global kernel | |
497 | * lock, except when an application is doing something nasty | |
498 | * like trying to un-brk an area that has already been mapped | |
499 | * to a regular file. in this case, the unmapping will need | |
500 | * to invoke file system routines that need the global lock. | |
501 | */ | |
6a6160a7 | 502 | SYSCALL_DEFINE1(brk, unsigned long, brk) |
1da177e4 LT |
503 | { |
504 | struct mm_struct *mm = current->mm; | |
505 | ||
506 | if (brk < mm->start_brk || brk > mm->context.end_brk) | |
507 | return mm->brk; | |
508 | ||
509 | if (mm->brk == brk) | |
510 | return mm->brk; | |
511 | ||
512 | /* | |
513 | * Always allow shrinking brk | |
514 | */ | |
515 | if (brk <= mm->brk) { | |
516 | mm->brk = brk; | |
517 | return brk; | |
518 | } | |
519 | ||
520 | /* | |
521 | * Ok, looks good - let it rip. | |
522 | */ | |
cfe79c00 | 523 | flush_icache_range(mm->brk, brk); |
1da177e4 LT |
524 | return mm->brk = brk; |
525 | } | |
526 | ||
8feae131 DH |
527 | /* |
528 | * initialise the VMA and region record slabs | |
529 | */ | |
530 | void __init mmap_init(void) | |
1da177e4 | 531 | { |
00a62ce9 KM |
532 | int ret; |
533 | ||
534 | ret = percpu_counter_init(&vm_committed_as, 0); | |
535 | VM_BUG_ON(ret); | |
33e5d769 | 536 | vm_region_jar = KMEM_CACHE(vm_region, SLAB_PANIC); |
1da177e4 | 537 | } |
1da177e4 | 538 | |
3034097a | 539 | /* |
8feae131 DH |
540 | * validate the region tree |
541 | * - the caller must hold the region lock | |
3034097a | 542 | */ |
8feae131 DH |
543 | #ifdef CONFIG_DEBUG_NOMMU_REGIONS |
544 | static noinline void validate_nommu_regions(void) | |
3034097a | 545 | { |
8feae131 DH |
546 | struct vm_region *region, *last; |
547 | struct rb_node *p, *lastp; | |
3034097a | 548 | |
8feae131 DH |
549 | lastp = rb_first(&nommu_region_tree); |
550 | if (!lastp) | |
551 | return; | |
552 | ||
553 | last = rb_entry(lastp, struct vm_region, vm_rb); | |
33e5d769 DH |
554 | BUG_ON(unlikely(last->vm_end <= last->vm_start)); |
555 | BUG_ON(unlikely(last->vm_top < last->vm_end)); | |
8feae131 DH |
556 | |
557 | while ((p = rb_next(lastp))) { | |
558 | region = rb_entry(p, struct vm_region, vm_rb); | |
559 | last = rb_entry(lastp, struct vm_region, vm_rb); | |
560 | ||
33e5d769 DH |
561 | BUG_ON(unlikely(region->vm_end <= region->vm_start)); |
562 | BUG_ON(unlikely(region->vm_top < region->vm_end)); | |
563 | BUG_ON(unlikely(region->vm_start < last->vm_top)); | |
3034097a | 564 | |
8feae131 DH |
565 | lastp = p; |
566 | } | |
3034097a | 567 | } |
8feae131 | 568 | #else |
33e5d769 DH |
569 | static void validate_nommu_regions(void) |
570 | { | |
571 | } | |
8feae131 | 572 | #endif |
3034097a DH |
573 | |
574 | /* | |
8feae131 | 575 | * add a region into the global tree |
3034097a | 576 | */ |
8feae131 | 577 | static void add_nommu_region(struct vm_region *region) |
3034097a | 578 | { |
8feae131 DH |
579 | struct vm_region *pregion; |
580 | struct rb_node **p, *parent; | |
3034097a | 581 | |
8feae131 DH |
582 | validate_nommu_regions(); |
583 | ||
8feae131 DH |
584 | parent = NULL; |
585 | p = &nommu_region_tree.rb_node; | |
586 | while (*p) { | |
587 | parent = *p; | |
588 | pregion = rb_entry(parent, struct vm_region, vm_rb); | |
589 | if (region->vm_start < pregion->vm_start) | |
590 | p = &(*p)->rb_left; | |
591 | else if (region->vm_start > pregion->vm_start) | |
592 | p = &(*p)->rb_right; | |
593 | else if (pregion == region) | |
594 | return; | |
595 | else | |
596 | BUG(); | |
3034097a DH |
597 | } |
598 | ||
8feae131 DH |
599 | rb_link_node(®ion->vm_rb, parent, p); |
600 | rb_insert_color(®ion->vm_rb, &nommu_region_tree); | |
3034097a | 601 | |
8feae131 | 602 | validate_nommu_regions(); |
3034097a | 603 | } |
3034097a | 604 | |
930e652a | 605 | /* |
8feae131 | 606 | * delete a region from the global tree |
930e652a | 607 | */ |
8feae131 | 608 | static void delete_nommu_region(struct vm_region *region) |
930e652a | 609 | { |
8feae131 | 610 | BUG_ON(!nommu_region_tree.rb_node); |
930e652a | 611 | |
8feae131 DH |
612 | validate_nommu_regions(); |
613 | rb_erase(®ion->vm_rb, &nommu_region_tree); | |
614 | validate_nommu_regions(); | |
57c8f63e GU |
615 | } |
616 | ||
6fa5f80b | 617 | /* |
8feae131 | 618 | * free a contiguous series of pages |
6fa5f80b | 619 | */ |
8feae131 | 620 | static void free_page_series(unsigned long from, unsigned long to) |
6fa5f80b | 621 | { |
8feae131 DH |
622 | for (; from < to; from += PAGE_SIZE) { |
623 | struct page *page = virt_to_page(from); | |
624 | ||
625 | kdebug("- free %lx", from); | |
33e5d769 | 626 | atomic_long_dec(&mmap_pages_allocated); |
8feae131 | 627 | if (page_count(page) != 1) |
33e5d769 DH |
628 | kdebug("free page %p: refcount not one: %d", |
629 | page, page_count(page)); | |
8feae131 | 630 | put_page(page); |
6fa5f80b | 631 | } |
6fa5f80b DH |
632 | } |
633 | ||
3034097a | 634 | /* |
8feae131 | 635 | * release a reference to a region |
33e5d769 | 636 | * - the caller must hold the region semaphore for writing, which this releases |
dd8632a1 | 637 | * - the region may not have been added to the tree yet, in which case vm_top |
8feae131 | 638 | * will equal vm_start |
3034097a | 639 | */ |
8feae131 DH |
640 | static void __put_nommu_region(struct vm_region *region) |
641 | __releases(nommu_region_sem) | |
1da177e4 | 642 | { |
1e2ae599 | 643 | kenter("%p{%d}", region, region->vm_usage); |
1da177e4 | 644 | |
8feae131 | 645 | BUG_ON(!nommu_region_tree.rb_node); |
1da177e4 | 646 | |
1e2ae599 | 647 | if (--region->vm_usage == 0) { |
dd8632a1 | 648 | if (region->vm_top > region->vm_start) |
8feae131 DH |
649 | delete_nommu_region(region); |
650 | up_write(&nommu_region_sem); | |
651 | ||
652 | if (region->vm_file) | |
653 | fput(region->vm_file); | |
654 | ||
655 | /* IO memory and memory shared directly out of the pagecache | |
656 | * from ramfs/tmpfs mustn't be released here */ | |
657 | if (region->vm_flags & VM_MAPPED_COPY) { | |
658 | kdebug("free series"); | |
dd8632a1 | 659 | free_page_series(region->vm_start, region->vm_top); |
8feae131 DH |
660 | } |
661 | kmem_cache_free(vm_region_jar, region); | |
662 | } else { | |
663 | up_write(&nommu_region_sem); | |
1da177e4 | 664 | } |
8feae131 | 665 | } |
1da177e4 | 666 | |
8feae131 DH |
667 | /* |
668 | * release a reference to a region | |
669 | */ | |
670 | static void put_nommu_region(struct vm_region *region) | |
671 | { | |
672 | down_write(&nommu_region_sem); | |
673 | __put_nommu_region(region); | |
1da177e4 LT |
674 | } |
675 | ||
eb8cdec4 BS |
676 | /* |
677 | * update protection on a vma | |
678 | */ | |
679 | static void protect_vma(struct vm_area_struct *vma, unsigned long flags) | |
680 | { | |
681 | #ifdef CONFIG_MPU | |
682 | struct mm_struct *mm = vma->vm_mm; | |
683 | long start = vma->vm_start & PAGE_MASK; | |
684 | while (start < vma->vm_end) { | |
685 | protect_page(mm, start, flags); | |
686 | start += PAGE_SIZE; | |
687 | } | |
688 | update_protections(mm); | |
689 | #endif | |
690 | } | |
691 | ||
3034097a | 692 | /* |
8feae131 DH |
693 | * add a VMA into a process's mm_struct in the appropriate place in the list |
694 | * and tree and add to the address space's page tree also if not an anonymous | |
695 | * page | |
696 | * - should be called with mm->mmap_sem held writelocked | |
3034097a | 697 | */ |
8feae131 | 698 | static void add_vma_to_mm(struct mm_struct *mm, struct vm_area_struct *vma) |
1da177e4 | 699 | { |
6038def0 | 700 | struct vm_area_struct *pvma, *prev; |
1da177e4 | 701 | struct address_space *mapping; |
6038def0 | 702 | struct rb_node **p, *parent, *rb_prev; |
8feae131 DH |
703 | |
704 | kenter(",%p", vma); | |
705 | ||
706 | BUG_ON(!vma->vm_region); | |
707 | ||
708 | mm->map_count++; | |
709 | vma->vm_mm = mm; | |
1da177e4 | 710 | |
eb8cdec4 BS |
711 | protect_vma(vma, vma->vm_flags); |
712 | ||
1da177e4 LT |
713 | /* add the VMA to the mapping */ |
714 | if (vma->vm_file) { | |
715 | mapping = vma->vm_file->f_mapping; | |
716 | ||
918e556e | 717 | mutex_lock(&mapping->i_mmap_mutex); |
1da177e4 | 718 | flush_dcache_mmap_lock(mapping); |
6b2dbba8 | 719 | vma_interval_tree_insert(vma, &mapping->i_mmap); |
1da177e4 | 720 | flush_dcache_mmap_unlock(mapping); |
918e556e | 721 | mutex_unlock(&mapping->i_mmap_mutex); |
1da177e4 LT |
722 | } |
723 | ||
8feae131 | 724 | /* add the VMA to the tree */ |
6038def0 | 725 | parent = rb_prev = NULL; |
8feae131 | 726 | p = &mm->mm_rb.rb_node; |
1da177e4 LT |
727 | while (*p) { |
728 | parent = *p; | |
729 | pvma = rb_entry(parent, struct vm_area_struct, vm_rb); | |
730 | ||
8feae131 DH |
731 | /* sort by: start addr, end addr, VMA struct addr in that order |
732 | * (the latter is necessary as we may get identical VMAs) */ | |
733 | if (vma->vm_start < pvma->vm_start) | |
1da177e4 | 734 | p = &(*p)->rb_left; |
6038def0 NK |
735 | else if (vma->vm_start > pvma->vm_start) { |
736 | rb_prev = parent; | |
1da177e4 | 737 | p = &(*p)->rb_right; |
6038def0 | 738 | } else if (vma->vm_end < pvma->vm_end) |
8feae131 | 739 | p = &(*p)->rb_left; |
6038def0 NK |
740 | else if (vma->vm_end > pvma->vm_end) { |
741 | rb_prev = parent; | |
8feae131 | 742 | p = &(*p)->rb_right; |
6038def0 | 743 | } else if (vma < pvma) |
8feae131 | 744 | p = &(*p)->rb_left; |
6038def0 NK |
745 | else if (vma > pvma) { |
746 | rb_prev = parent; | |
8feae131 | 747 | p = &(*p)->rb_right; |
6038def0 | 748 | } else |
8feae131 | 749 | BUG(); |
1da177e4 LT |
750 | } |
751 | ||
752 | rb_link_node(&vma->vm_rb, parent, p); | |
8feae131 DH |
753 | rb_insert_color(&vma->vm_rb, &mm->mm_rb); |
754 | ||
755 | /* add VMA to the VMA list also */ | |
6038def0 NK |
756 | prev = NULL; |
757 | if (rb_prev) | |
758 | prev = rb_entry(rb_prev, struct vm_area_struct, vm_rb); | |
8feae131 | 759 | |
6038def0 | 760 | __vma_link_list(mm, vma, prev, parent); |
1da177e4 LT |
761 | } |
762 | ||
3034097a | 763 | /* |
8feae131 | 764 | * delete a VMA from its owning mm_struct and address space |
3034097a | 765 | */ |
8feae131 | 766 | static void delete_vma_from_mm(struct vm_area_struct *vma) |
1da177e4 LT |
767 | { |
768 | struct address_space *mapping; | |
8feae131 DH |
769 | struct mm_struct *mm = vma->vm_mm; |
770 | ||
771 | kenter("%p", vma); | |
772 | ||
eb8cdec4 BS |
773 | protect_vma(vma, 0); |
774 | ||
8feae131 DH |
775 | mm->map_count--; |
776 | if (mm->mmap_cache == vma) | |
777 | mm->mmap_cache = NULL; | |
1da177e4 LT |
778 | |
779 | /* remove the VMA from the mapping */ | |
780 | if (vma->vm_file) { | |
781 | mapping = vma->vm_file->f_mapping; | |
782 | ||
918e556e | 783 | mutex_lock(&mapping->i_mmap_mutex); |
1da177e4 | 784 | flush_dcache_mmap_lock(mapping); |
6b2dbba8 | 785 | vma_interval_tree_remove(vma, &mapping->i_mmap); |
1da177e4 | 786 | flush_dcache_mmap_unlock(mapping); |
918e556e | 787 | mutex_unlock(&mapping->i_mmap_mutex); |
1da177e4 LT |
788 | } |
789 | ||
8feae131 DH |
790 | /* remove from the MM's tree and list */ |
791 | rb_erase(&vma->vm_rb, &mm->mm_rb); | |
b951bf2c NK |
792 | |
793 | if (vma->vm_prev) | |
794 | vma->vm_prev->vm_next = vma->vm_next; | |
795 | else | |
796 | mm->mmap = vma->vm_next; | |
797 | ||
798 | if (vma->vm_next) | |
799 | vma->vm_next->vm_prev = vma->vm_prev; | |
8feae131 DH |
800 | } |
801 | ||
802 | /* | |
803 | * destroy a VMA record | |
804 | */ | |
805 | static void delete_vma(struct mm_struct *mm, struct vm_area_struct *vma) | |
806 | { | |
807 | kenter("%p", vma); | |
808 | if (vma->vm_ops && vma->vm_ops->close) | |
809 | vma->vm_ops->close(vma); | |
e9714acf | 810 | if (vma->vm_file) |
8feae131 | 811 | fput(vma->vm_file); |
8feae131 DH |
812 | put_nommu_region(vma->vm_region); |
813 | kmem_cache_free(vm_area_cachep, vma); | |
814 | } | |
815 | ||
816 | /* | |
817 | * look up the first VMA in which addr resides, NULL if none | |
818 | * - should be called with mm->mmap_sem at least held readlocked | |
819 | */ | |
820 | struct vm_area_struct *find_vma(struct mm_struct *mm, unsigned long addr) | |
821 | { | |
822 | struct vm_area_struct *vma; | |
8feae131 DH |
823 | |
824 | /* check the cache first */ | |
b6a9b7f6 | 825 | vma = ACCESS_ONCE(mm->mmap_cache); |
8feae131 DH |
826 | if (vma && vma->vm_start <= addr && vma->vm_end > addr) |
827 | return vma; | |
828 | ||
e922c4c5 | 829 | /* trawl the list (there may be multiple mappings in which addr |
8feae131 | 830 | * resides) */ |
e922c4c5 | 831 | for (vma = mm->mmap; vma; vma = vma->vm_next) { |
8feae131 DH |
832 | if (vma->vm_start > addr) |
833 | return NULL; | |
834 | if (vma->vm_end > addr) { | |
835 | mm->mmap_cache = vma; | |
836 | return vma; | |
837 | } | |
838 | } | |
839 | ||
840 | return NULL; | |
841 | } | |
842 | EXPORT_SYMBOL(find_vma); | |
843 | ||
844 | /* | |
845 | * find a VMA | |
846 | * - we don't extend stack VMAs under NOMMU conditions | |
847 | */ | |
848 | struct vm_area_struct *find_extend_vma(struct mm_struct *mm, unsigned long addr) | |
849 | { | |
7561e8ca | 850 | return find_vma(mm, addr); |
8feae131 DH |
851 | } |
852 | ||
853 | /* | |
854 | * expand a stack to a given address | |
855 | * - not supported under NOMMU conditions | |
856 | */ | |
857 | int expand_stack(struct vm_area_struct *vma, unsigned long address) | |
858 | { | |
859 | return -ENOMEM; | |
860 | } | |
861 | ||
862 | /* | |
863 | * look up the first VMA exactly that exactly matches addr | |
864 | * - should be called with mm->mmap_sem at least held readlocked | |
865 | */ | |
866 | static struct vm_area_struct *find_vma_exact(struct mm_struct *mm, | |
867 | unsigned long addr, | |
868 | unsigned long len) | |
869 | { | |
870 | struct vm_area_struct *vma; | |
8feae131 DH |
871 | unsigned long end = addr + len; |
872 | ||
873 | /* check the cache first */ | |
874 | vma = mm->mmap_cache; | |
875 | if (vma && vma->vm_start == addr && vma->vm_end == end) | |
876 | return vma; | |
877 | ||
e922c4c5 | 878 | /* trawl the list (there may be multiple mappings in which addr |
8feae131 | 879 | * resides) */ |
e922c4c5 | 880 | for (vma = mm->mmap; vma; vma = vma->vm_next) { |
8feae131 DH |
881 | if (vma->vm_start < addr) |
882 | continue; | |
883 | if (vma->vm_start > addr) | |
884 | return NULL; | |
885 | if (vma->vm_end == end) { | |
886 | mm->mmap_cache = vma; | |
887 | return vma; | |
888 | } | |
889 | } | |
890 | ||
891 | return NULL; | |
1da177e4 LT |
892 | } |
893 | ||
894 | /* | |
895 | * determine whether a mapping should be permitted and, if so, what sort of | |
896 | * mapping we're capable of supporting | |
897 | */ | |
898 | static int validate_mmap_request(struct file *file, | |
899 | unsigned long addr, | |
900 | unsigned long len, | |
901 | unsigned long prot, | |
902 | unsigned long flags, | |
903 | unsigned long pgoff, | |
904 | unsigned long *_capabilities) | |
905 | { | |
8feae131 | 906 | unsigned long capabilities, rlen; |
1da177e4 LT |
907 | int ret; |
908 | ||
909 | /* do the simple checks first */ | |
06aab5a3 | 910 | if (flags & MAP_FIXED) { |
1da177e4 LT |
911 | printk(KERN_DEBUG |
912 | "%d: Can't do fixed-address/overlay mmap of RAM\n", | |
913 | current->pid); | |
914 | return -EINVAL; | |
915 | } | |
916 | ||
917 | if ((flags & MAP_TYPE) != MAP_PRIVATE && | |
918 | (flags & MAP_TYPE) != MAP_SHARED) | |
919 | return -EINVAL; | |
920 | ||
f81cff0d | 921 | if (!len) |
1da177e4 LT |
922 | return -EINVAL; |
923 | ||
f81cff0d | 924 | /* Careful about overflows.. */ |
8feae131 DH |
925 | rlen = PAGE_ALIGN(len); |
926 | if (!rlen || rlen > TASK_SIZE) | |
f81cff0d MF |
927 | return -ENOMEM; |
928 | ||
1da177e4 | 929 | /* offset overflow? */ |
8feae131 | 930 | if ((pgoff + (rlen >> PAGE_SHIFT)) < pgoff) |
f81cff0d | 931 | return -EOVERFLOW; |
1da177e4 LT |
932 | |
933 | if (file) { | |
934 | /* validate file mapping requests */ | |
935 | struct address_space *mapping; | |
936 | ||
937 | /* files must support mmap */ | |
938 | if (!file->f_op || !file->f_op->mmap) | |
939 | return -ENODEV; | |
940 | ||
941 | /* work out if what we've got could possibly be shared | |
942 | * - we support chardevs that provide their own "memory" | |
943 | * - we support files/blockdevs that are memory backed | |
944 | */ | |
945 | mapping = file->f_mapping; | |
946 | if (!mapping) | |
496ad9aa | 947 | mapping = file_inode(file)->i_mapping; |
1da177e4 LT |
948 | |
949 | capabilities = 0; | |
950 | if (mapping && mapping->backing_dev_info) | |
951 | capabilities = mapping->backing_dev_info->capabilities; | |
952 | ||
953 | if (!capabilities) { | |
954 | /* no explicit capabilities set, so assume some | |
955 | * defaults */ | |
496ad9aa | 956 | switch (file_inode(file)->i_mode & S_IFMT) { |
1da177e4 LT |
957 | case S_IFREG: |
958 | case S_IFBLK: | |
959 | capabilities = BDI_CAP_MAP_COPY; | |
960 | break; | |
961 | ||
962 | case S_IFCHR: | |
963 | capabilities = | |
964 | BDI_CAP_MAP_DIRECT | | |
965 | BDI_CAP_READ_MAP | | |
966 | BDI_CAP_WRITE_MAP; | |
967 | break; | |
968 | ||
969 | default: | |
970 | return -EINVAL; | |
971 | } | |
972 | } | |
973 | ||
974 | /* eliminate any capabilities that we can't support on this | |
975 | * device */ | |
976 | if (!file->f_op->get_unmapped_area) | |
977 | capabilities &= ~BDI_CAP_MAP_DIRECT; | |
978 | if (!file->f_op->read) | |
979 | capabilities &= ~BDI_CAP_MAP_COPY; | |
980 | ||
28d7a6ae GY |
981 | /* The file shall have been opened with read permission. */ |
982 | if (!(file->f_mode & FMODE_READ)) | |
983 | return -EACCES; | |
984 | ||
1da177e4 LT |
985 | if (flags & MAP_SHARED) { |
986 | /* do checks for writing, appending and locking */ | |
987 | if ((prot & PROT_WRITE) && | |
988 | !(file->f_mode & FMODE_WRITE)) | |
989 | return -EACCES; | |
990 | ||
496ad9aa | 991 | if (IS_APPEND(file_inode(file)) && |
1da177e4 LT |
992 | (file->f_mode & FMODE_WRITE)) |
993 | return -EACCES; | |
994 | ||
496ad9aa | 995 | if (locks_verify_locked(file_inode(file))) |
1da177e4 LT |
996 | return -EAGAIN; |
997 | ||
998 | if (!(capabilities & BDI_CAP_MAP_DIRECT)) | |
999 | return -ENODEV; | |
1000 | ||
1da177e4 LT |
1001 | /* we mustn't privatise shared mappings */ |
1002 | capabilities &= ~BDI_CAP_MAP_COPY; | |
1003 | } | |
1004 | else { | |
1005 | /* we're going to read the file into private memory we | |
1006 | * allocate */ | |
1007 | if (!(capabilities & BDI_CAP_MAP_COPY)) | |
1008 | return -ENODEV; | |
1009 | ||
1010 | /* we don't permit a private writable mapping to be | |
1011 | * shared with the backing device */ | |
1012 | if (prot & PROT_WRITE) | |
1013 | capabilities &= ~BDI_CAP_MAP_DIRECT; | |
1014 | } | |
1015 | ||
3c7b2045 BS |
1016 | if (capabilities & BDI_CAP_MAP_DIRECT) { |
1017 | if (((prot & PROT_READ) && !(capabilities & BDI_CAP_READ_MAP)) || | |
1018 | ((prot & PROT_WRITE) && !(capabilities & BDI_CAP_WRITE_MAP)) || | |
1019 | ((prot & PROT_EXEC) && !(capabilities & BDI_CAP_EXEC_MAP)) | |
1020 | ) { | |
1021 | capabilities &= ~BDI_CAP_MAP_DIRECT; | |
1022 | if (flags & MAP_SHARED) { | |
1023 | printk(KERN_WARNING | |
1024 | "MAP_SHARED not completely supported on !MMU\n"); | |
1025 | return -EINVAL; | |
1026 | } | |
1027 | } | |
1028 | } | |
1029 | ||
1da177e4 LT |
1030 | /* handle executable mappings and implied executable |
1031 | * mappings */ | |
e9536ae7 | 1032 | if (file->f_path.mnt->mnt_flags & MNT_NOEXEC) { |
1da177e4 LT |
1033 | if (prot & PROT_EXEC) |
1034 | return -EPERM; | |
1035 | } | |
1036 | else if ((prot & PROT_READ) && !(prot & PROT_EXEC)) { | |
1037 | /* handle implication of PROT_EXEC by PROT_READ */ | |
1038 | if (current->personality & READ_IMPLIES_EXEC) { | |
1039 | if (capabilities & BDI_CAP_EXEC_MAP) | |
1040 | prot |= PROT_EXEC; | |
1041 | } | |
1042 | } | |
1043 | else if ((prot & PROT_READ) && | |
1044 | (prot & PROT_EXEC) && | |
1045 | !(capabilities & BDI_CAP_EXEC_MAP) | |
1046 | ) { | |
1047 | /* backing file is not executable, try to copy */ | |
1048 | capabilities &= ~BDI_CAP_MAP_DIRECT; | |
1049 | } | |
1050 | } | |
1051 | else { | |
1052 | /* anonymous mappings are always memory backed and can be | |
1053 | * privately mapped | |
1054 | */ | |
1055 | capabilities = BDI_CAP_MAP_COPY; | |
1056 | ||
1057 | /* handle PROT_EXEC implication by PROT_READ */ | |
1058 | if ((prot & PROT_READ) && | |
1059 | (current->personality & READ_IMPLIES_EXEC)) | |
1060 | prot |= PROT_EXEC; | |
1061 | } | |
1062 | ||
1063 | /* allow the security API to have its say */ | |
e5467859 | 1064 | ret = security_mmap_addr(addr); |
1da177e4 LT |
1065 | if (ret < 0) |
1066 | return ret; | |
1067 | ||
1068 | /* looks okay */ | |
1069 | *_capabilities = capabilities; | |
1070 | return 0; | |
1071 | } | |
1072 | ||
1073 | /* | |
1074 | * we've determined that we can make the mapping, now translate what we | |
1075 | * now know into VMA flags | |
1076 | */ | |
1077 | static unsigned long determine_vm_flags(struct file *file, | |
1078 | unsigned long prot, | |
1079 | unsigned long flags, | |
1080 | unsigned long capabilities) | |
1081 | { | |
1082 | unsigned long vm_flags; | |
1083 | ||
1084 | vm_flags = calc_vm_prot_bits(prot) | calc_vm_flag_bits(flags); | |
1da177e4 LT |
1085 | /* vm_flags |= mm->def_flags; */ |
1086 | ||
1087 | if (!(capabilities & BDI_CAP_MAP_DIRECT)) { | |
1088 | /* attempt to share read-only copies of mapped file chunks */ | |
3c7b2045 | 1089 | vm_flags |= VM_MAYREAD | VM_MAYWRITE | VM_MAYEXEC; |
1da177e4 LT |
1090 | if (file && !(prot & PROT_WRITE)) |
1091 | vm_flags |= VM_MAYSHARE; | |
3c7b2045 | 1092 | } else { |
1da177e4 LT |
1093 | /* overlay a shareable mapping on the backing device or inode |
1094 | * if possible - used for chardevs, ramfs/tmpfs/shmfs and | |
1095 | * romfs/cramfs */ | |
3c7b2045 | 1096 | vm_flags |= VM_MAYSHARE | (capabilities & BDI_CAP_VMFLAGS); |
1da177e4 | 1097 | if (flags & MAP_SHARED) |
3c7b2045 | 1098 | vm_flags |= VM_SHARED; |
1da177e4 LT |
1099 | } |
1100 | ||
1101 | /* refuse to let anyone share private mappings with this process if | |
1102 | * it's being traced - otherwise breakpoints set in it may interfere | |
1103 | * with another untraced process | |
1104 | */ | |
a288eecc | 1105 | if ((flags & MAP_PRIVATE) && current->ptrace) |
1da177e4 LT |
1106 | vm_flags &= ~VM_MAYSHARE; |
1107 | ||
1108 | return vm_flags; | |
1109 | } | |
1110 | ||
1111 | /* | |
8feae131 DH |
1112 | * set up a shared mapping on a file (the driver or filesystem provides and |
1113 | * pins the storage) | |
1da177e4 | 1114 | */ |
8feae131 | 1115 | static int do_mmap_shared_file(struct vm_area_struct *vma) |
1da177e4 LT |
1116 | { |
1117 | int ret; | |
1118 | ||
1119 | ret = vma->vm_file->f_op->mmap(vma->vm_file, vma); | |
dd8632a1 PM |
1120 | if (ret == 0) { |
1121 | vma->vm_region->vm_top = vma->vm_region->vm_end; | |
645d83c5 | 1122 | return 0; |
dd8632a1 | 1123 | } |
1da177e4 LT |
1124 | if (ret != -ENOSYS) |
1125 | return ret; | |
1126 | ||
3fa30460 DH |
1127 | /* getting -ENOSYS indicates that direct mmap isn't possible (as |
1128 | * opposed to tried but failed) so we can only give a suitable error as | |
1129 | * it's not possible to make a private copy if MAP_SHARED was given */ | |
1da177e4 LT |
1130 | return -ENODEV; |
1131 | } | |
1132 | ||
1133 | /* | |
1134 | * set up a private mapping or an anonymous shared mapping | |
1135 | */ | |
8feae131 DH |
1136 | static int do_mmap_private(struct vm_area_struct *vma, |
1137 | struct vm_region *region, | |
645d83c5 DH |
1138 | unsigned long len, |
1139 | unsigned long capabilities) | |
1da177e4 | 1140 | { |
8feae131 | 1141 | struct page *pages; |
f67d9b15 | 1142 | unsigned long total, point, n; |
1da177e4 | 1143 | void *base; |
8feae131 | 1144 | int ret, order; |
1da177e4 LT |
1145 | |
1146 | /* invoke the file's mapping function so that it can keep track of | |
1147 | * shared mappings on devices or memory | |
1148 | * - VM_MAYSHARE will be set if it may attempt to share | |
1149 | */ | |
645d83c5 | 1150 | if (capabilities & BDI_CAP_MAP_DIRECT) { |
1da177e4 | 1151 | ret = vma->vm_file->f_op->mmap(vma->vm_file, vma); |
dd8632a1 | 1152 | if (ret == 0) { |
1da177e4 | 1153 | /* shouldn't return success if we're not sharing */ |
dd8632a1 PM |
1154 | BUG_ON(!(vma->vm_flags & VM_MAYSHARE)); |
1155 | vma->vm_region->vm_top = vma->vm_region->vm_end; | |
645d83c5 | 1156 | return 0; |
1da177e4 | 1157 | } |
dd8632a1 PM |
1158 | if (ret != -ENOSYS) |
1159 | return ret; | |
1da177e4 LT |
1160 | |
1161 | /* getting an ENOSYS error indicates that direct mmap isn't | |
1162 | * possible (as opposed to tried but failed) so we'll try to | |
1163 | * make a private copy of the data and map that instead */ | |
1164 | } | |
1165 | ||
8feae131 | 1166 | |
1da177e4 LT |
1167 | /* allocate some memory to hold the mapping |
1168 | * - note that this may not return a page-aligned address if the object | |
1169 | * we're allocating is smaller than a page | |
1170 | */ | |
f67d9b15 | 1171 | order = get_order(len); |
8feae131 DH |
1172 | kdebug("alloc order %d for %lx", order, len); |
1173 | ||
1174 | pages = alloc_pages(GFP_KERNEL, order); | |
1175 | if (!pages) | |
1da177e4 LT |
1176 | goto enomem; |
1177 | ||
8feae131 | 1178 | total = 1 << order; |
33e5d769 | 1179 | atomic_long_add(total, &mmap_pages_allocated); |
8feae131 | 1180 | |
f67d9b15 | 1181 | point = len >> PAGE_SHIFT; |
dd8632a1 PM |
1182 | |
1183 | /* we allocated a power-of-2 sized page set, so we may want to trim off | |
1184 | * the excess */ | |
1185 | if (sysctl_nr_trim_pages && total - point >= sysctl_nr_trim_pages) { | |
1186 | while (total > point) { | |
1187 | order = ilog2(total - point); | |
1188 | n = 1 << order; | |
1189 | kdebug("shave %lu/%lu @%lu", n, total - point, total); | |
33e5d769 | 1190 | atomic_long_sub(n, &mmap_pages_allocated); |
dd8632a1 PM |
1191 | total -= n; |
1192 | set_page_refcounted(pages + total); | |
1193 | __free_pages(pages + total, order); | |
1194 | } | |
8feae131 DH |
1195 | } |
1196 | ||
8feae131 DH |
1197 | for (point = 1; point < total; point++) |
1198 | set_page_refcounted(&pages[point]); | |
1da177e4 | 1199 | |
8feae131 DH |
1200 | base = page_address(pages); |
1201 | region->vm_flags = vma->vm_flags |= VM_MAPPED_COPY; | |
1202 | region->vm_start = (unsigned long) base; | |
f67d9b15 | 1203 | region->vm_end = region->vm_start + len; |
dd8632a1 | 1204 | region->vm_top = region->vm_start + (total << PAGE_SHIFT); |
8feae131 DH |
1205 | |
1206 | vma->vm_start = region->vm_start; | |
1207 | vma->vm_end = region->vm_start + len; | |
1da177e4 LT |
1208 | |
1209 | if (vma->vm_file) { | |
1210 | /* read the contents of a file into the copy */ | |
1211 | mm_segment_t old_fs; | |
1212 | loff_t fpos; | |
1213 | ||
1214 | fpos = vma->vm_pgoff; | |
1215 | fpos <<= PAGE_SHIFT; | |
1216 | ||
1217 | old_fs = get_fs(); | |
1218 | set_fs(KERNEL_DS); | |
f67d9b15 | 1219 | ret = vma->vm_file->f_op->read(vma->vm_file, base, len, &fpos); |
1da177e4 LT |
1220 | set_fs(old_fs); |
1221 | ||
1222 | if (ret < 0) | |
1223 | goto error_free; | |
1224 | ||
1225 | /* clear the last little bit */ | |
f67d9b15 BL |
1226 | if (ret < len) |
1227 | memset(base + ret, 0, len - ret); | |
1da177e4 | 1228 | |
1da177e4 LT |
1229 | } |
1230 | ||
1231 | return 0; | |
1232 | ||
1233 | error_free: | |
7223bb4a | 1234 | free_page_series(region->vm_start, region->vm_top); |
8feae131 DH |
1235 | region->vm_start = vma->vm_start = 0; |
1236 | region->vm_end = vma->vm_end = 0; | |
dd8632a1 | 1237 | region->vm_top = 0; |
1da177e4 LT |
1238 | return ret; |
1239 | ||
1240 | enomem: | |
05ae6fa3 GU |
1241 | printk("Allocation of length %lu from process %d (%s) failed\n", |
1242 | len, current->pid, current->comm); | |
7bf02ea2 | 1243 | show_free_areas(0); |
1da177e4 LT |
1244 | return -ENOMEM; |
1245 | } | |
1246 | ||
1247 | /* | |
1248 | * handle mapping creation for uClinux | |
1249 | */ | |
e3fc629d | 1250 | unsigned long do_mmap_pgoff(struct file *file, |
1da177e4 LT |
1251 | unsigned long addr, |
1252 | unsigned long len, | |
1253 | unsigned long prot, | |
1254 | unsigned long flags, | |
bebeb3d6 | 1255 | unsigned long pgoff, |
41badc15 | 1256 | unsigned long *populate) |
1da177e4 | 1257 | { |
8feae131 DH |
1258 | struct vm_area_struct *vma; |
1259 | struct vm_region *region; | |
1da177e4 | 1260 | struct rb_node *rb; |
8feae131 | 1261 | unsigned long capabilities, vm_flags, result; |
1da177e4 LT |
1262 | int ret; |
1263 | ||
8feae131 DH |
1264 | kenter(",%lx,%lx,%lx,%lx,%lx", addr, len, prot, flags, pgoff); |
1265 | ||
41badc15 | 1266 | *populate = 0; |
bebeb3d6 | 1267 | |
1da177e4 LT |
1268 | /* decide whether we should attempt the mapping, and if so what sort of |
1269 | * mapping */ | |
1270 | ret = validate_mmap_request(file, addr, len, prot, flags, pgoff, | |
1271 | &capabilities); | |
8feae131 DH |
1272 | if (ret < 0) { |
1273 | kleave(" = %d [val]", ret); | |
1da177e4 | 1274 | return ret; |
8feae131 | 1275 | } |
1da177e4 | 1276 | |
06aab5a3 DH |
1277 | /* we ignore the address hint */ |
1278 | addr = 0; | |
f67d9b15 | 1279 | len = PAGE_ALIGN(len); |
06aab5a3 | 1280 | |
1da177e4 LT |
1281 | /* we've determined that we can make the mapping, now translate what we |
1282 | * now know into VMA flags */ | |
1283 | vm_flags = determine_vm_flags(file, prot, flags, capabilities); | |
1284 | ||
8feae131 DH |
1285 | /* we're going to need to record the mapping */ |
1286 | region = kmem_cache_zalloc(vm_region_jar, GFP_KERNEL); | |
1287 | if (!region) | |
1288 | goto error_getting_region; | |
1289 | ||
1290 | vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL); | |
1291 | if (!vma) | |
1292 | goto error_getting_vma; | |
1da177e4 | 1293 | |
1e2ae599 | 1294 | region->vm_usage = 1; |
8feae131 DH |
1295 | region->vm_flags = vm_flags; |
1296 | region->vm_pgoff = pgoff; | |
1297 | ||
5beb4930 | 1298 | INIT_LIST_HEAD(&vma->anon_vma_chain); |
8feae131 DH |
1299 | vma->vm_flags = vm_flags; |
1300 | vma->vm_pgoff = pgoff; | |
1da177e4 | 1301 | |
8feae131 | 1302 | if (file) { |
cb0942b8 AV |
1303 | region->vm_file = get_file(file); |
1304 | vma->vm_file = get_file(file); | |
8feae131 DH |
1305 | } |
1306 | ||
1307 | down_write(&nommu_region_sem); | |
1308 | ||
1309 | /* if we want to share, we need to check for regions created by other | |
1da177e4 | 1310 | * mmap() calls that overlap with our proposed mapping |
8feae131 | 1311 | * - we can only share with a superset match on most regular files |
1da177e4 LT |
1312 | * - shared mappings on character devices and memory backed files are |
1313 | * permitted to overlap inexactly as far as we are concerned for in | |
1314 | * these cases, sharing is handled in the driver or filesystem rather | |
1315 | * than here | |
1316 | */ | |
1317 | if (vm_flags & VM_MAYSHARE) { | |
8feae131 DH |
1318 | struct vm_region *pregion; |
1319 | unsigned long pglen, rpglen, pgend, rpgend, start; | |
1da177e4 | 1320 | |
8feae131 DH |
1321 | pglen = (len + PAGE_SIZE - 1) >> PAGE_SHIFT; |
1322 | pgend = pgoff + pglen; | |
165b2392 | 1323 | |
8feae131 DH |
1324 | for (rb = rb_first(&nommu_region_tree); rb; rb = rb_next(rb)) { |
1325 | pregion = rb_entry(rb, struct vm_region, vm_rb); | |
1da177e4 | 1326 | |
8feae131 | 1327 | if (!(pregion->vm_flags & VM_MAYSHARE)) |
1da177e4 LT |
1328 | continue; |
1329 | ||
1330 | /* search for overlapping mappings on the same file */ | |
496ad9aa AV |
1331 | if (file_inode(pregion->vm_file) != |
1332 | file_inode(file)) | |
1da177e4 LT |
1333 | continue; |
1334 | ||
8feae131 | 1335 | if (pregion->vm_pgoff >= pgend) |
1da177e4 LT |
1336 | continue; |
1337 | ||
8feae131 DH |
1338 | rpglen = pregion->vm_end - pregion->vm_start; |
1339 | rpglen = (rpglen + PAGE_SIZE - 1) >> PAGE_SHIFT; | |
1340 | rpgend = pregion->vm_pgoff + rpglen; | |
1341 | if (pgoff >= rpgend) | |
1da177e4 LT |
1342 | continue; |
1343 | ||
8feae131 DH |
1344 | /* handle inexactly overlapping matches between |
1345 | * mappings */ | |
1346 | if ((pregion->vm_pgoff != pgoff || rpglen != pglen) && | |
1347 | !(pgoff >= pregion->vm_pgoff && pgend <= rpgend)) { | |
1348 | /* new mapping is not a subset of the region */ | |
1da177e4 LT |
1349 | if (!(capabilities & BDI_CAP_MAP_DIRECT)) |
1350 | goto sharing_violation; | |
1351 | continue; | |
1352 | } | |
1353 | ||
8feae131 | 1354 | /* we've found a region we can share */ |
1e2ae599 | 1355 | pregion->vm_usage++; |
8feae131 DH |
1356 | vma->vm_region = pregion; |
1357 | start = pregion->vm_start; | |
1358 | start += (pgoff - pregion->vm_pgoff) << PAGE_SHIFT; | |
1359 | vma->vm_start = start; | |
1360 | vma->vm_end = start + len; | |
1361 | ||
1362 | if (pregion->vm_flags & VM_MAPPED_COPY) { | |
1363 | kdebug("share copy"); | |
1364 | vma->vm_flags |= VM_MAPPED_COPY; | |
1365 | } else { | |
1366 | kdebug("share mmap"); | |
1367 | ret = do_mmap_shared_file(vma); | |
1368 | if (ret < 0) { | |
1369 | vma->vm_region = NULL; | |
1370 | vma->vm_start = 0; | |
1371 | vma->vm_end = 0; | |
1e2ae599 | 1372 | pregion->vm_usage--; |
8feae131 DH |
1373 | pregion = NULL; |
1374 | goto error_just_free; | |
1375 | } | |
1376 | } | |
1377 | fput(region->vm_file); | |
1378 | kmem_cache_free(vm_region_jar, region); | |
1379 | region = pregion; | |
1380 | result = start; | |
1381 | goto share; | |
1da177e4 LT |
1382 | } |
1383 | ||
1da177e4 LT |
1384 | /* obtain the address at which to make a shared mapping |
1385 | * - this is the hook for quasi-memory character devices to | |
1386 | * tell us the location of a shared mapping | |
1387 | */ | |
645d83c5 | 1388 | if (capabilities & BDI_CAP_MAP_DIRECT) { |
1da177e4 LT |
1389 | addr = file->f_op->get_unmapped_area(file, addr, len, |
1390 | pgoff, flags); | |
bb005a59 | 1391 | if (IS_ERR_VALUE(addr)) { |
1da177e4 | 1392 | ret = addr; |
bb005a59 | 1393 | if (ret != -ENOSYS) |
8feae131 | 1394 | goto error_just_free; |
1da177e4 LT |
1395 | |
1396 | /* the driver refused to tell us where to site | |
1397 | * the mapping so we'll have to attempt to copy | |
1398 | * it */ | |
bb005a59 | 1399 | ret = -ENODEV; |
1da177e4 | 1400 | if (!(capabilities & BDI_CAP_MAP_COPY)) |
8feae131 | 1401 | goto error_just_free; |
1da177e4 LT |
1402 | |
1403 | capabilities &= ~BDI_CAP_MAP_DIRECT; | |
8feae131 DH |
1404 | } else { |
1405 | vma->vm_start = region->vm_start = addr; | |
1406 | vma->vm_end = region->vm_end = addr + len; | |
1da177e4 LT |
1407 | } |
1408 | } | |
1409 | } | |
1410 | ||
8feae131 | 1411 | vma->vm_region = region; |
1da177e4 | 1412 | |
645d83c5 DH |
1413 | /* set up the mapping |
1414 | * - the region is filled in if BDI_CAP_MAP_DIRECT is still set | |
1415 | */ | |
1da177e4 | 1416 | if (file && vma->vm_flags & VM_SHARED) |
8feae131 | 1417 | ret = do_mmap_shared_file(vma); |
1da177e4 | 1418 | else |
645d83c5 | 1419 | ret = do_mmap_private(vma, region, len, capabilities); |
1da177e4 | 1420 | if (ret < 0) |
645d83c5 DH |
1421 | goto error_just_free; |
1422 | add_nommu_region(region); | |
8feae131 | 1423 | |
ea637639 JZ |
1424 | /* clear anonymous mappings that don't ask for uninitialized data */ |
1425 | if (!vma->vm_file && !(flags & MAP_UNINITIALIZED)) | |
1426 | memset((void *)region->vm_start, 0, | |
1427 | region->vm_end - region->vm_start); | |
1428 | ||
1da177e4 | 1429 | /* okay... we have a mapping; now we have to register it */ |
8feae131 | 1430 | result = vma->vm_start; |
1da177e4 | 1431 | |
1da177e4 LT |
1432 | current->mm->total_vm += len >> PAGE_SHIFT; |
1433 | ||
8feae131 DH |
1434 | share: |
1435 | add_vma_to_mm(current->mm, vma); | |
1da177e4 | 1436 | |
cfe79c00 MF |
1437 | /* we flush the region from the icache only when the first executable |
1438 | * mapping of it is made */ | |
1439 | if (vma->vm_flags & VM_EXEC && !region->vm_icache_flushed) { | |
1440 | flush_icache_range(region->vm_start, region->vm_end); | |
1441 | region->vm_icache_flushed = true; | |
1442 | } | |
1da177e4 | 1443 | |
cfe79c00 | 1444 | up_write(&nommu_region_sem); |
1da177e4 | 1445 | |
8feae131 DH |
1446 | kleave(" = %lx", result); |
1447 | return result; | |
1da177e4 | 1448 | |
8feae131 DH |
1449 | error_just_free: |
1450 | up_write(&nommu_region_sem); | |
1451 | error: | |
89a86402 DH |
1452 | if (region->vm_file) |
1453 | fput(region->vm_file); | |
8feae131 | 1454 | kmem_cache_free(vm_region_jar, region); |
89a86402 DH |
1455 | if (vma->vm_file) |
1456 | fput(vma->vm_file); | |
8feae131 DH |
1457 | kmem_cache_free(vm_area_cachep, vma); |
1458 | kleave(" = %d", ret); | |
1459 | return ret; | |
1460 | ||
1461 | sharing_violation: | |
1462 | up_write(&nommu_region_sem); | |
1463 | printk(KERN_WARNING "Attempt to share mismatched mappings\n"); | |
1464 | ret = -EINVAL; | |
1465 | goto error; | |
1da177e4 | 1466 | |
8feae131 DH |
1467 | error_getting_vma: |
1468 | kmem_cache_free(vm_region_jar, region); | |
1469 | printk(KERN_WARNING "Allocation of vma for %lu byte allocation" | |
1470 | " from process %d failed\n", | |
1da177e4 | 1471 | len, current->pid); |
7bf02ea2 | 1472 | show_free_areas(0); |
1da177e4 LT |
1473 | return -ENOMEM; |
1474 | ||
8feae131 DH |
1475 | error_getting_region: |
1476 | printk(KERN_WARNING "Allocation of vm region for %lu byte allocation" | |
1477 | " from process %d failed\n", | |
1da177e4 | 1478 | len, current->pid); |
7bf02ea2 | 1479 | show_free_areas(0); |
1da177e4 LT |
1480 | return -ENOMEM; |
1481 | } | |
6be5ceb0 | 1482 | |
66f0dc48 HD |
1483 | SYSCALL_DEFINE6(mmap_pgoff, unsigned long, addr, unsigned long, len, |
1484 | unsigned long, prot, unsigned long, flags, | |
1485 | unsigned long, fd, unsigned long, pgoff) | |
1486 | { | |
1487 | struct file *file = NULL; | |
1488 | unsigned long retval = -EBADF; | |
1489 | ||
120a795d | 1490 | audit_mmap_fd(fd, flags); |
66f0dc48 HD |
1491 | if (!(flags & MAP_ANONYMOUS)) { |
1492 | file = fget(fd); | |
1493 | if (!file) | |
1494 | goto out; | |
1495 | } | |
1496 | ||
1497 | flags &= ~(MAP_EXECUTABLE | MAP_DENYWRITE); | |
1498 | ||
ad1ed293 | 1499 | retval = vm_mmap_pgoff(file, addr, len, prot, flags, pgoff); |
66f0dc48 HD |
1500 | |
1501 | if (file) | |
1502 | fput(file); | |
1503 | out: | |
1504 | return retval; | |
1505 | } | |
1506 | ||
a4679373 CH |
1507 | #ifdef __ARCH_WANT_SYS_OLD_MMAP |
1508 | struct mmap_arg_struct { | |
1509 | unsigned long addr; | |
1510 | unsigned long len; | |
1511 | unsigned long prot; | |
1512 | unsigned long flags; | |
1513 | unsigned long fd; | |
1514 | unsigned long offset; | |
1515 | }; | |
1516 | ||
1517 | SYSCALL_DEFINE1(old_mmap, struct mmap_arg_struct __user *, arg) | |
1518 | { | |
1519 | struct mmap_arg_struct a; | |
1520 | ||
1521 | if (copy_from_user(&a, arg, sizeof(a))) | |
1522 | return -EFAULT; | |
1523 | if (a.offset & ~PAGE_MASK) | |
1524 | return -EINVAL; | |
1525 | ||
1526 | return sys_mmap_pgoff(a.addr, a.len, a.prot, a.flags, a.fd, | |
1527 | a.offset >> PAGE_SHIFT); | |
1528 | } | |
1529 | #endif /* __ARCH_WANT_SYS_OLD_MMAP */ | |
1530 | ||
1da177e4 | 1531 | /* |
8feae131 DH |
1532 | * split a vma into two pieces at address 'addr', a new vma is allocated either |
1533 | * for the first part or the tail. | |
1da177e4 | 1534 | */ |
8feae131 DH |
1535 | int split_vma(struct mm_struct *mm, struct vm_area_struct *vma, |
1536 | unsigned long addr, int new_below) | |
1da177e4 | 1537 | { |
8feae131 DH |
1538 | struct vm_area_struct *new; |
1539 | struct vm_region *region; | |
1540 | unsigned long npages; | |
1da177e4 | 1541 | |
8feae131 | 1542 | kenter(""); |
1da177e4 | 1543 | |
779c1023 DH |
1544 | /* we're only permitted to split anonymous regions (these should have |
1545 | * only a single usage on the region) */ | |
1546 | if (vma->vm_file) | |
8feae131 | 1547 | return -ENOMEM; |
1da177e4 | 1548 | |
8feae131 DH |
1549 | if (mm->map_count >= sysctl_max_map_count) |
1550 | return -ENOMEM; | |
1da177e4 | 1551 | |
8feae131 DH |
1552 | region = kmem_cache_alloc(vm_region_jar, GFP_KERNEL); |
1553 | if (!region) | |
1554 | return -ENOMEM; | |
1da177e4 | 1555 | |
8feae131 DH |
1556 | new = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL); |
1557 | if (!new) { | |
1558 | kmem_cache_free(vm_region_jar, region); | |
1559 | return -ENOMEM; | |
1560 | } | |
1561 | ||
1562 | /* most fields are the same, copy all, and then fixup */ | |
1563 | *new = *vma; | |
1564 | *region = *vma->vm_region; | |
1565 | new->vm_region = region; | |
1566 | ||
1567 | npages = (addr - vma->vm_start) >> PAGE_SHIFT; | |
1568 | ||
1569 | if (new_below) { | |
dd8632a1 | 1570 | region->vm_top = region->vm_end = new->vm_end = addr; |
8feae131 DH |
1571 | } else { |
1572 | region->vm_start = new->vm_start = addr; | |
1573 | region->vm_pgoff = new->vm_pgoff += npages; | |
1da177e4 | 1574 | } |
8feae131 DH |
1575 | |
1576 | if (new->vm_ops && new->vm_ops->open) | |
1577 | new->vm_ops->open(new); | |
1578 | ||
1579 | delete_vma_from_mm(vma); | |
1580 | down_write(&nommu_region_sem); | |
1581 | delete_nommu_region(vma->vm_region); | |
1582 | if (new_below) { | |
1583 | vma->vm_region->vm_start = vma->vm_start = addr; | |
1584 | vma->vm_region->vm_pgoff = vma->vm_pgoff += npages; | |
1585 | } else { | |
1586 | vma->vm_region->vm_end = vma->vm_end = addr; | |
dd8632a1 | 1587 | vma->vm_region->vm_top = addr; |
8feae131 DH |
1588 | } |
1589 | add_nommu_region(vma->vm_region); | |
1590 | add_nommu_region(new->vm_region); | |
1591 | up_write(&nommu_region_sem); | |
1592 | add_vma_to_mm(mm, vma); | |
1593 | add_vma_to_mm(mm, new); | |
1594 | return 0; | |
1da177e4 LT |
1595 | } |
1596 | ||
3034097a | 1597 | /* |
8feae131 DH |
1598 | * shrink a VMA by removing the specified chunk from either the beginning or |
1599 | * the end | |
3034097a | 1600 | */ |
8feae131 DH |
1601 | static int shrink_vma(struct mm_struct *mm, |
1602 | struct vm_area_struct *vma, | |
1603 | unsigned long from, unsigned long to) | |
1da177e4 | 1604 | { |
8feae131 | 1605 | struct vm_region *region; |
1da177e4 | 1606 | |
8feae131 | 1607 | kenter(""); |
1da177e4 | 1608 | |
8feae131 DH |
1609 | /* adjust the VMA's pointers, which may reposition it in the MM's tree |
1610 | * and list */ | |
1611 | delete_vma_from_mm(vma); | |
1612 | if (from > vma->vm_start) | |
1613 | vma->vm_end = from; | |
1614 | else | |
1615 | vma->vm_start = to; | |
1616 | add_vma_to_mm(mm, vma); | |
1da177e4 | 1617 | |
8feae131 DH |
1618 | /* cut the backing region down to size */ |
1619 | region = vma->vm_region; | |
1e2ae599 | 1620 | BUG_ON(region->vm_usage != 1); |
8feae131 DH |
1621 | |
1622 | down_write(&nommu_region_sem); | |
1623 | delete_nommu_region(region); | |
dd8632a1 PM |
1624 | if (from > region->vm_start) { |
1625 | to = region->vm_top; | |
1626 | region->vm_top = region->vm_end = from; | |
1627 | } else { | |
8feae131 | 1628 | region->vm_start = to; |
dd8632a1 | 1629 | } |
8feae131 DH |
1630 | add_nommu_region(region); |
1631 | up_write(&nommu_region_sem); | |
1632 | ||
1633 | free_page_series(from, to); | |
1634 | return 0; | |
1635 | } | |
1da177e4 | 1636 | |
8feae131 DH |
1637 | /* |
1638 | * release a mapping | |
1639 | * - under NOMMU conditions the chunk to be unmapped must be backed by a single | |
1640 | * VMA, though it need not cover the whole VMA | |
1641 | */ | |
1642 | int do_munmap(struct mm_struct *mm, unsigned long start, size_t len) | |
1643 | { | |
1644 | struct vm_area_struct *vma; | |
f67d9b15 | 1645 | unsigned long end; |
8feae131 | 1646 | int ret; |
1da177e4 | 1647 | |
8feae131 | 1648 | kenter(",%lx,%zx", start, len); |
1da177e4 | 1649 | |
f67d9b15 | 1650 | len = PAGE_ALIGN(len); |
8feae131 DH |
1651 | if (len == 0) |
1652 | return -EINVAL; | |
365e9c87 | 1653 | |
f67d9b15 BL |
1654 | end = start + len; |
1655 | ||
8feae131 DH |
1656 | /* find the first potentially overlapping VMA */ |
1657 | vma = find_vma(mm, start); | |
1658 | if (!vma) { | |
33e5d769 DH |
1659 | static int limit = 0; |
1660 | if (limit < 5) { | |
1661 | printk(KERN_WARNING | |
1662 | "munmap of memory not mmapped by process %d" | |
1663 | " (%s): 0x%lx-0x%lx\n", | |
1664 | current->pid, current->comm, | |
1665 | start, start + len - 1); | |
1666 | limit++; | |
1667 | } | |
8feae131 DH |
1668 | return -EINVAL; |
1669 | } | |
1da177e4 | 1670 | |
8feae131 DH |
1671 | /* we're allowed to split an anonymous VMA but not a file-backed one */ |
1672 | if (vma->vm_file) { | |
1673 | do { | |
1674 | if (start > vma->vm_start) { | |
1675 | kleave(" = -EINVAL [miss]"); | |
1676 | return -EINVAL; | |
1677 | } | |
1678 | if (end == vma->vm_end) | |
1679 | goto erase_whole_vma; | |
d75a310c NK |
1680 | vma = vma->vm_next; |
1681 | } while (vma); | |
8feae131 DH |
1682 | kleave(" = -EINVAL [split file]"); |
1683 | return -EINVAL; | |
1684 | } else { | |
1685 | /* the chunk must be a subset of the VMA found */ | |
1686 | if (start == vma->vm_start && end == vma->vm_end) | |
1687 | goto erase_whole_vma; | |
1688 | if (start < vma->vm_start || end > vma->vm_end) { | |
1689 | kleave(" = -EINVAL [superset]"); | |
1690 | return -EINVAL; | |
1691 | } | |
1692 | if (start & ~PAGE_MASK) { | |
1693 | kleave(" = -EINVAL [unaligned start]"); | |
1694 | return -EINVAL; | |
1695 | } | |
1696 | if (end != vma->vm_end && end & ~PAGE_MASK) { | |
1697 | kleave(" = -EINVAL [unaligned split]"); | |
1698 | return -EINVAL; | |
1699 | } | |
1700 | if (start != vma->vm_start && end != vma->vm_end) { | |
1701 | ret = split_vma(mm, vma, start, 1); | |
1702 | if (ret < 0) { | |
1703 | kleave(" = %d [split]", ret); | |
1704 | return ret; | |
1705 | } | |
1706 | } | |
1707 | return shrink_vma(mm, vma, start, end); | |
1708 | } | |
1da177e4 | 1709 | |
8feae131 DH |
1710 | erase_whole_vma: |
1711 | delete_vma_from_mm(vma); | |
1712 | delete_vma(mm, vma); | |
1713 | kleave(" = 0"); | |
1da177e4 LT |
1714 | return 0; |
1715 | } | |
b5073173 | 1716 | EXPORT_SYMBOL(do_munmap); |
1da177e4 | 1717 | |
bfce281c | 1718 | int vm_munmap(unsigned long addr, size_t len) |
3034097a | 1719 | { |
bfce281c | 1720 | struct mm_struct *mm = current->mm; |
3034097a | 1721 | int ret; |
3034097a DH |
1722 | |
1723 | down_write(&mm->mmap_sem); | |
1724 | ret = do_munmap(mm, addr, len); | |
1725 | up_write(&mm->mmap_sem); | |
1726 | return ret; | |
1727 | } | |
a46ef99d LT |
1728 | EXPORT_SYMBOL(vm_munmap); |
1729 | ||
1730 | SYSCALL_DEFINE2(munmap, unsigned long, addr, size_t, len) | |
1731 | { | |
bfce281c | 1732 | return vm_munmap(addr, len); |
a46ef99d | 1733 | } |
3034097a DH |
1734 | |
1735 | /* | |
8feae131 | 1736 | * release all the mappings made in a process's VM space |
3034097a | 1737 | */ |
8feae131 | 1738 | void exit_mmap(struct mm_struct *mm) |
1da177e4 | 1739 | { |
8feae131 | 1740 | struct vm_area_struct *vma; |
1da177e4 | 1741 | |
8feae131 DH |
1742 | if (!mm) |
1743 | return; | |
1da177e4 | 1744 | |
8feae131 | 1745 | kenter(""); |
1da177e4 | 1746 | |
8feae131 | 1747 | mm->total_vm = 0; |
1da177e4 | 1748 | |
8feae131 DH |
1749 | while ((vma = mm->mmap)) { |
1750 | mm->mmap = vma->vm_next; | |
1751 | delete_vma_from_mm(vma); | |
1752 | delete_vma(mm, vma); | |
04c34961 | 1753 | cond_resched(); |
1da177e4 | 1754 | } |
8feae131 DH |
1755 | |
1756 | kleave(""); | |
1da177e4 LT |
1757 | } |
1758 | ||
e4eb1ff6 | 1759 | unsigned long vm_brk(unsigned long addr, unsigned long len) |
1da177e4 LT |
1760 | { |
1761 | return -ENOMEM; | |
1762 | } | |
1763 | ||
1764 | /* | |
6fa5f80b DH |
1765 | * expand (or shrink) an existing mapping, potentially moving it at the same |
1766 | * time (controlled by the MREMAP_MAYMOVE flag and available VM space) | |
1da177e4 | 1767 | * |
6fa5f80b | 1768 | * under NOMMU conditions, we only permit changing a mapping's size, and only |
8feae131 DH |
1769 | * as long as it stays within the region allocated by do_mmap_private() and the |
1770 | * block is not shareable | |
1da177e4 | 1771 | * |
6fa5f80b | 1772 | * MREMAP_FIXED is not supported under NOMMU conditions |
1da177e4 | 1773 | */ |
4b377bab | 1774 | static unsigned long do_mremap(unsigned long addr, |
1da177e4 LT |
1775 | unsigned long old_len, unsigned long new_len, |
1776 | unsigned long flags, unsigned long new_addr) | |
1777 | { | |
6fa5f80b | 1778 | struct vm_area_struct *vma; |
1da177e4 LT |
1779 | |
1780 | /* insanity checks first */ | |
f67d9b15 BL |
1781 | old_len = PAGE_ALIGN(old_len); |
1782 | new_len = PAGE_ALIGN(new_len); | |
8feae131 | 1783 | if (old_len == 0 || new_len == 0) |
1da177e4 LT |
1784 | return (unsigned long) -EINVAL; |
1785 | ||
8feae131 DH |
1786 | if (addr & ~PAGE_MASK) |
1787 | return -EINVAL; | |
1788 | ||
1da177e4 LT |
1789 | if (flags & MREMAP_FIXED && new_addr != addr) |
1790 | return (unsigned long) -EINVAL; | |
1791 | ||
8feae131 | 1792 | vma = find_vma_exact(current->mm, addr, old_len); |
6fa5f80b DH |
1793 | if (!vma) |
1794 | return (unsigned long) -EINVAL; | |
1da177e4 | 1795 | |
6fa5f80b | 1796 | if (vma->vm_end != vma->vm_start + old_len) |
1da177e4 LT |
1797 | return (unsigned long) -EFAULT; |
1798 | ||
6fa5f80b | 1799 | if (vma->vm_flags & VM_MAYSHARE) |
1da177e4 LT |
1800 | return (unsigned long) -EPERM; |
1801 | ||
8feae131 | 1802 | if (new_len > vma->vm_region->vm_end - vma->vm_region->vm_start) |
1da177e4 LT |
1803 | return (unsigned long) -ENOMEM; |
1804 | ||
1805 | /* all checks complete - do it */ | |
6fa5f80b | 1806 | vma->vm_end = vma->vm_start + new_len; |
6fa5f80b DH |
1807 | return vma->vm_start; |
1808 | } | |
1809 | ||
6a6160a7 HC |
1810 | SYSCALL_DEFINE5(mremap, unsigned long, addr, unsigned long, old_len, |
1811 | unsigned long, new_len, unsigned long, flags, | |
1812 | unsigned long, new_addr) | |
6fa5f80b DH |
1813 | { |
1814 | unsigned long ret; | |
1815 | ||
1816 | down_write(¤t->mm->mmap_sem); | |
1817 | ret = do_mremap(addr, old_len, new_len, flags, new_addr); | |
1818 | up_write(¤t->mm->mmap_sem); | |
1819 | return ret; | |
1da177e4 LT |
1820 | } |
1821 | ||
240aadee ML |
1822 | struct page *follow_page_mask(struct vm_area_struct *vma, |
1823 | unsigned long address, unsigned int flags, | |
1824 | unsigned int *page_mask) | |
1da177e4 | 1825 | { |
240aadee | 1826 | *page_mask = 0; |
1da177e4 LT |
1827 | return NULL; |
1828 | } | |
1829 | ||
8f3b1327 BL |
1830 | int remap_pfn_range(struct vm_area_struct *vma, unsigned long addr, |
1831 | unsigned long pfn, unsigned long size, pgprot_t prot) | |
1da177e4 | 1832 | { |
8f3b1327 BL |
1833 | if (addr != (pfn << PAGE_SHIFT)) |
1834 | return -EINVAL; | |
1835 | ||
314e51b9 | 1836 | vma->vm_flags |= VM_IO | VM_PFNMAP | VM_DONTEXPAND | VM_DONTDUMP; |
66aa2b4b | 1837 | return 0; |
1da177e4 | 1838 | } |
22c4af40 | 1839 | EXPORT_SYMBOL(remap_pfn_range); |
1da177e4 | 1840 | |
3c0b9de6 LT |
1841 | int vm_iomap_memory(struct vm_area_struct *vma, phys_addr_t start, unsigned long len) |
1842 | { | |
1843 | unsigned long pfn = start >> PAGE_SHIFT; | |
1844 | unsigned long vm_len = vma->vm_end - vma->vm_start; | |
1845 | ||
1846 | pfn += vma->vm_pgoff; | |
1847 | return io_remap_pfn_range(vma, vma->vm_start, pfn, vm_len, vma->vm_page_prot); | |
1848 | } | |
1849 | EXPORT_SYMBOL(vm_iomap_memory); | |
1850 | ||
f905bc44 PM |
1851 | int remap_vmalloc_range(struct vm_area_struct *vma, void *addr, |
1852 | unsigned long pgoff) | |
1853 | { | |
1854 | unsigned int size = vma->vm_end - vma->vm_start; | |
1855 | ||
1856 | if (!(vma->vm_flags & VM_USERMAP)) | |
1857 | return -EINVAL; | |
1858 | ||
1859 | vma->vm_start = (unsigned long)(addr + (pgoff << PAGE_SHIFT)); | |
1860 | vma->vm_end = vma->vm_start + size; | |
1861 | ||
1862 | return 0; | |
1863 | } | |
1864 | EXPORT_SYMBOL(remap_vmalloc_range); | |
1865 | ||
1da177e4 LT |
1866 | unsigned long arch_get_unmapped_area(struct file *file, unsigned long addr, |
1867 | unsigned long len, unsigned long pgoff, unsigned long flags) | |
1868 | { | |
1869 | return -ENOMEM; | |
1870 | } | |
1871 | ||
1363c3cd | 1872 | void arch_unmap_area(struct mm_struct *mm, unsigned long addr) |
1da177e4 LT |
1873 | { |
1874 | } | |
1875 | ||
1da177e4 LT |
1876 | void unmap_mapping_range(struct address_space *mapping, |
1877 | loff_t const holebegin, loff_t const holelen, | |
1878 | int even_cows) | |
1879 | { | |
1880 | } | |
22c4af40 | 1881 | EXPORT_SYMBOL(unmap_mapping_range); |
1da177e4 LT |
1882 | |
1883 | /* | |
1884 | * Check that a process has enough memory to allocate a new virtual | |
1885 | * mapping. 0 means there is enough memory for the allocation to | |
1886 | * succeed and -ENOMEM implies there is not. | |
1887 | * | |
1888 | * We currently support three overcommit policies, which are set via the | |
1889 | * vm.overcommit_memory sysctl. See Documentation/vm/overcommit-accounting | |
1890 | * | |
1891 | * Strict overcommit modes added 2002 Feb 26 by Alan Cox. | |
1892 | * Additional code 2002 Jul 20 by Robert Love. | |
1893 | * | |
1894 | * cap_sys_admin is 1 if the process has admin privileges, 0 otherwise. | |
1895 | * | |
1896 | * Note this is a helper function intended to be used by LSMs which | |
1897 | * wish to use this logic. | |
1898 | */ | |
34b4e4aa | 1899 | int __vm_enough_memory(struct mm_struct *mm, long pages, int cap_sys_admin) |
1da177e4 | 1900 | { |
c9b1d098 | 1901 | unsigned long free, allowed, reserve; |
1da177e4 LT |
1902 | |
1903 | vm_acct_memory(pages); | |
1904 | ||
1905 | /* | |
1906 | * Sometimes we want to use more memory than we have | |
1907 | */ | |
1908 | if (sysctl_overcommit_memory == OVERCOMMIT_ALWAYS) | |
1909 | return 0; | |
1910 | ||
1911 | if (sysctl_overcommit_memory == OVERCOMMIT_GUESS) { | |
c15bef30 DF |
1912 | free = global_page_state(NR_FREE_PAGES); |
1913 | free += global_page_state(NR_FILE_PAGES); | |
1914 | ||
1915 | /* | |
1916 | * shmem pages shouldn't be counted as free in this | |
1917 | * case, they can't be purged, only swapped out, and | |
1918 | * that won't affect the overall amount of available | |
1919 | * memory in the system. | |
1920 | */ | |
1921 | free -= global_page_state(NR_SHMEM); | |
1da177e4 | 1922 | |
ec8acf20 | 1923 | free += get_nr_swap_pages(); |
1da177e4 LT |
1924 | |
1925 | /* | |
1926 | * Any slabs which are created with the | |
1927 | * SLAB_RECLAIM_ACCOUNT flag claim to have contents | |
1928 | * which are reclaimable, under pressure. The dentry | |
1929 | * cache and most inode caches should fall into this | |
1930 | */ | |
972d1a7b | 1931 | free += global_page_state(NR_SLAB_RECLAIMABLE); |
1da177e4 | 1932 | |
d5ddc79b HA |
1933 | /* |
1934 | * Leave reserved pages. The pages are not for anonymous pages. | |
1935 | */ | |
c15bef30 | 1936 | if (free <= totalreserve_pages) |
d5ddc79b HA |
1937 | goto error; |
1938 | else | |
c15bef30 | 1939 | free -= totalreserve_pages; |
d5ddc79b HA |
1940 | |
1941 | /* | |
4eeab4f5 | 1942 | * Reserve some for root |
d5ddc79b | 1943 | */ |
1da177e4 | 1944 | if (!cap_sys_admin) |
4eeab4f5 | 1945 | free -= sysctl_admin_reserve_kbytes >> (PAGE_SHIFT - 10); |
1da177e4 LT |
1946 | |
1947 | if (free > pages) | |
1948 | return 0; | |
d5ddc79b HA |
1949 | |
1950 | goto error; | |
1da177e4 LT |
1951 | } |
1952 | ||
1953 | allowed = totalram_pages * sysctl_overcommit_ratio / 100; | |
1954 | /* | |
4eeab4f5 | 1955 | * Reserve some 3% for root |
1da177e4 LT |
1956 | */ |
1957 | if (!cap_sys_admin) | |
4eeab4f5 | 1958 | allowed -= sysctl_admin_reserve_kbytes >> (PAGE_SHIFT - 10); |
1da177e4 LT |
1959 | allowed += total_swap_pages; |
1960 | ||
c9b1d098 AS |
1961 | /* |
1962 | * Don't let a single process grow so big a user can't recover | |
1963 | */ | |
1964 | if (mm) { | |
1965 | reserve = sysctl_user_reserve_kbytes >> (PAGE_SHIFT - 10); | |
1966 | allowed -= min(mm->total_vm / 32, reserve); | |
1967 | } | |
1da177e4 | 1968 | |
00a62ce9 | 1969 | if (percpu_counter_read_positive(&vm_committed_as) < allowed) |
1da177e4 | 1970 | return 0; |
00a62ce9 | 1971 | |
d5ddc79b | 1972 | error: |
1da177e4 LT |
1973 | vm_unacct_memory(pages); |
1974 | ||
1975 | return -ENOMEM; | |
1976 | } | |
1977 | ||
cae5d390 | 1978 | int in_gate_area_no_mm(unsigned long addr) |
1da177e4 LT |
1979 | { |
1980 | return 0; | |
1981 | } | |
b0e15190 | 1982 | |
d0217ac0 | 1983 | int filemap_fault(struct vm_area_struct *vma, struct vm_fault *vmf) |
b0e15190 DH |
1984 | { |
1985 | BUG(); | |
d0217ac0 | 1986 | return 0; |
b0e15190 | 1987 | } |
b5073173 | 1988 | EXPORT_SYMBOL(filemap_fault); |
0ec76a11 | 1989 | |
0b173bc4 KK |
1990 | int generic_file_remap_pages(struct vm_area_struct *vma, unsigned long addr, |
1991 | unsigned long size, pgoff_t pgoff) | |
1992 | { | |
1993 | BUG(); | |
1994 | return 0; | |
1995 | } | |
1996 | EXPORT_SYMBOL(generic_file_remap_pages); | |
1997 | ||
f55f199b MF |
1998 | static int __access_remote_vm(struct task_struct *tsk, struct mm_struct *mm, |
1999 | unsigned long addr, void *buf, int len, int write) | |
0ec76a11 | 2000 | { |
0ec76a11 | 2001 | struct vm_area_struct *vma; |
0ec76a11 DH |
2002 | |
2003 | down_read(&mm->mmap_sem); | |
2004 | ||
2005 | /* the access must start within one of the target process's mappings */ | |
0159b141 DH |
2006 | vma = find_vma(mm, addr); |
2007 | if (vma) { | |
0ec76a11 DH |
2008 | /* don't overrun this mapping */ |
2009 | if (addr + len >= vma->vm_end) | |
2010 | len = vma->vm_end - addr; | |
2011 | ||
2012 | /* only read or write mappings where it is permitted */ | |
d00c7b99 | 2013 | if (write && vma->vm_flags & VM_MAYWRITE) |
7959722b JZ |
2014 | copy_to_user_page(vma, NULL, addr, |
2015 | (void *) addr, buf, len); | |
d00c7b99 | 2016 | else if (!write && vma->vm_flags & VM_MAYREAD) |
7959722b JZ |
2017 | copy_from_user_page(vma, NULL, addr, |
2018 | buf, (void *) addr, len); | |
0ec76a11 DH |
2019 | else |
2020 | len = 0; | |
2021 | } else { | |
2022 | len = 0; | |
2023 | } | |
2024 | ||
2025 | up_read(&mm->mmap_sem); | |
f55f199b MF |
2026 | |
2027 | return len; | |
2028 | } | |
2029 | ||
2030 | /** | |
2031 | * @access_remote_vm - access another process' address space | |
2032 | * @mm: the mm_struct of the target address space | |
2033 | * @addr: start address to access | |
2034 | * @buf: source or destination buffer | |
2035 | * @len: number of bytes to transfer | |
2036 | * @write: whether the access is a write | |
2037 | * | |
2038 | * The caller must hold a reference on @mm. | |
2039 | */ | |
2040 | int access_remote_vm(struct mm_struct *mm, unsigned long addr, | |
2041 | void *buf, int len, int write) | |
2042 | { | |
2043 | return __access_remote_vm(NULL, mm, addr, buf, len, write); | |
2044 | } | |
2045 | ||
2046 | /* | |
2047 | * Access another process' address space. | |
2048 | * - source/target buffer must be kernel space | |
2049 | */ | |
2050 | int access_process_vm(struct task_struct *tsk, unsigned long addr, void *buf, int len, int write) | |
2051 | { | |
2052 | struct mm_struct *mm; | |
2053 | ||
2054 | if (addr + len < addr) | |
2055 | return 0; | |
2056 | ||
2057 | mm = get_task_mm(tsk); | |
2058 | if (!mm) | |
2059 | return 0; | |
2060 | ||
2061 | len = __access_remote_vm(tsk, mm, addr, buf, len, write); | |
2062 | ||
0ec76a11 DH |
2063 | mmput(mm); |
2064 | return len; | |
2065 | } | |
7e660872 DH |
2066 | |
2067 | /** | |
2068 | * nommu_shrink_inode_mappings - Shrink the shared mappings on an inode | |
2069 | * @inode: The inode to check | |
2070 | * @size: The current filesize of the inode | |
2071 | * @newsize: The proposed filesize of the inode | |
2072 | * | |
2073 | * Check the shared mappings on an inode on behalf of a shrinking truncate to | |
2074 | * make sure that that any outstanding VMAs aren't broken and then shrink the | |
2075 | * vm_regions that extend that beyond so that do_mmap_pgoff() doesn't | |
2076 | * automatically grant mappings that are too large. | |
2077 | */ | |
2078 | int nommu_shrink_inode_mappings(struct inode *inode, size_t size, | |
2079 | size_t newsize) | |
2080 | { | |
2081 | struct vm_area_struct *vma; | |
7e660872 DH |
2082 | struct vm_region *region; |
2083 | pgoff_t low, high; | |
2084 | size_t r_size, r_top; | |
2085 | ||
2086 | low = newsize >> PAGE_SHIFT; | |
2087 | high = (size + PAGE_SIZE - 1) >> PAGE_SHIFT; | |
2088 | ||
2089 | down_write(&nommu_region_sem); | |
918e556e | 2090 | mutex_lock(&inode->i_mapping->i_mmap_mutex); |
7e660872 DH |
2091 | |
2092 | /* search for VMAs that fall within the dead zone */ | |
6b2dbba8 | 2093 | vma_interval_tree_foreach(vma, &inode->i_mapping->i_mmap, low, high) { |
7e660872 DH |
2094 | /* found one - only interested if it's shared out of the page |
2095 | * cache */ | |
2096 | if (vma->vm_flags & VM_SHARED) { | |
918e556e | 2097 | mutex_unlock(&inode->i_mapping->i_mmap_mutex); |
7e660872 DH |
2098 | up_write(&nommu_region_sem); |
2099 | return -ETXTBSY; /* not quite true, but near enough */ | |
2100 | } | |
2101 | } | |
2102 | ||
2103 | /* reduce any regions that overlap the dead zone - if in existence, | |
2104 | * these will be pointed to by VMAs that don't overlap the dead zone | |
2105 | * | |
2106 | * we don't check for any regions that start beyond the EOF as there | |
2107 | * shouldn't be any | |
2108 | */ | |
6b2dbba8 ML |
2109 | vma_interval_tree_foreach(vma, &inode->i_mapping->i_mmap, |
2110 | 0, ULONG_MAX) { | |
7e660872 DH |
2111 | if (!(vma->vm_flags & VM_SHARED)) |
2112 | continue; | |
2113 | ||
2114 | region = vma->vm_region; | |
2115 | r_size = region->vm_top - region->vm_start; | |
2116 | r_top = (region->vm_pgoff << PAGE_SHIFT) + r_size; | |
2117 | ||
2118 | if (r_top > newsize) { | |
2119 | region->vm_top -= r_top - newsize; | |
2120 | if (region->vm_end > region->vm_top) | |
2121 | region->vm_end = region->vm_top; | |
2122 | } | |
2123 | } | |
2124 | ||
918e556e | 2125 | mutex_unlock(&inode->i_mapping->i_mmap_mutex); |
7e660872 DH |
2126 | up_write(&nommu_region_sem); |
2127 | return 0; | |
2128 | } | |
c9b1d098 AS |
2129 | |
2130 | /* | |
2131 | * Initialise sysctl_user_reserve_kbytes. | |
2132 | * | |
2133 | * This is intended to prevent a user from starting a single memory hogging | |
2134 | * process, such that they cannot recover (kill the hog) in OVERCOMMIT_NEVER | |
2135 | * mode. | |
2136 | * | |
2137 | * The default value is min(3% of free memory, 128MB) | |
2138 | * 128MB is enough to recover with sshd/login, bash, and top/kill. | |
2139 | */ | |
2140 | static int __meminit init_user_reserve(void) | |
2141 | { | |
2142 | unsigned long free_kbytes; | |
2143 | ||
2144 | free_kbytes = global_page_state(NR_FREE_PAGES) << (PAGE_SHIFT - 10); | |
2145 | ||
2146 | sysctl_user_reserve_kbytes = min(free_kbytes / 32, 1UL << 17); | |
2147 | return 0; | |
2148 | } | |
2149 | module_init(init_user_reserve) | |
4eeab4f5 AS |
2150 | |
2151 | /* | |
2152 | * Initialise sysctl_admin_reserve_kbytes. | |
2153 | * | |
2154 | * The purpose of sysctl_admin_reserve_kbytes is to allow the sys admin | |
2155 | * to log in and kill a memory hogging process. | |
2156 | * | |
2157 | * Systems with more than 256MB will reserve 8MB, enough to recover | |
2158 | * with sshd, bash, and top in OVERCOMMIT_GUESS. Smaller systems will | |
2159 | * only reserve 3% of free pages by default. | |
2160 | */ | |
2161 | static int __meminit init_admin_reserve(void) | |
2162 | { | |
2163 | unsigned long free_kbytes; | |
2164 | ||
2165 | free_kbytes = global_page_state(NR_FREE_PAGES) << (PAGE_SHIFT - 10); | |
2166 | ||
2167 | sysctl_admin_reserve_kbytes = min(free_kbytes / 32, 1UL << 13); | |
2168 | return 0; | |
2169 | } | |
2170 | module_init(init_admin_reserve) |