1 // SPDX-License-Identifier: GPL-2.0-only
3 #include <linux/slab.h>
4 #include <linux/string.h>
5 #include <linux/compiler.h>
6 #include <linux/export.h>
8 #include <linux/sched.h>
9 #include <linux/sched/mm.h>
10 #include <linux/sched/signal.h>
11 #include <linux/sched/task_stack.h>
12 #include <linux/security.h>
13 #include <linux/swap.h>
14 #include <linux/swapops.h>
15 #include <linux/mman.h>
16 #include <linux/hugetlb.h>
17 #include <linux/vmalloc.h>
18 #include <linux/userfaultfd_k.h>
19 #include <linux/elf.h>
20 #include <linux/elf-randomize.h>
21 #include <linux/personality.h>
22 #include <linux/random.h>
23 #include <linux/processor.h>
24 #include <linux/sizes.h>
25 #include <linux/compat.h>
27 #include <linux/uaccess.h>
33 * kfree_const - conditionally free memory
34 * @x: pointer to the memory
36 * Function calls kfree only if @x is not in .rodata section.
38 void kfree_const(const void *x
)
40 if (!is_kernel_rodata((unsigned long)x
))
43 EXPORT_SYMBOL(kfree_const
);
46 * kstrdup - allocate space for and copy an existing string
47 * @s: the string to duplicate
48 * @gfp: the GFP mask used in the kmalloc() call when allocating memory
50 * Return: newly allocated copy of @s or %NULL in case of error
53 char *kstrdup(const char *s
, gfp_t gfp
)
62 buf
= kmalloc_track_caller(len
, gfp
);
67 EXPORT_SYMBOL(kstrdup
);
70 * kstrdup_const - conditionally duplicate an existing const string
71 * @s: the string to duplicate
72 * @gfp: the GFP mask used in the kmalloc() call when allocating memory
74 * Note: Strings allocated by kstrdup_const should be freed by kfree_const and
75 * must not be passed to krealloc().
77 * Return: source string if it is in .rodata section otherwise
78 * fallback to kstrdup.
80 const char *kstrdup_const(const char *s
, gfp_t gfp
)
82 if (is_kernel_rodata((unsigned long)s
))
85 return kstrdup(s
, gfp
);
87 EXPORT_SYMBOL(kstrdup_const
);
90 * kstrndup - allocate space for and copy an existing string
91 * @s: the string to duplicate
92 * @max: read at most @max chars from @s
93 * @gfp: the GFP mask used in the kmalloc() call when allocating memory
95 * Note: Use kmemdup_nul() instead if the size is known exactly.
97 * Return: newly allocated copy of @s or %NULL in case of error
99 char *kstrndup(const char *s
, size_t max
, gfp_t gfp
)
107 len
= strnlen(s
, max
);
108 buf
= kmalloc_track_caller(len
+1, gfp
);
115 EXPORT_SYMBOL(kstrndup
);
118 * kmemdup - duplicate region of memory
120 * @src: memory region to duplicate
121 * @len: memory region length
122 * @gfp: GFP mask to use
124 * Return: newly allocated copy of @src or %NULL in case of error,
125 * result is physically contiguous. Use kfree() to free.
127 void *kmemdup(const void *src
, size_t len
, gfp_t gfp
)
131 p
= kmalloc_track_caller(len
, gfp
);
136 EXPORT_SYMBOL(kmemdup
);
139 * kvmemdup - duplicate region of memory
141 * @src: memory region to duplicate
142 * @len: memory region length
143 * @gfp: GFP mask to use
145 * Return: newly allocated copy of @src or %NULL in case of error,
146 * result may be not physically contiguous. Use kvfree() to free.
148 void *kvmemdup(const void *src
, size_t len
, gfp_t gfp
)
152 p
= kvmalloc(len
, gfp
);
157 EXPORT_SYMBOL(kvmemdup
);
160 * kmemdup_nul - Create a NUL-terminated string from unterminated data
161 * @s: The data to stringify
162 * @len: The size of the data
163 * @gfp: the GFP mask used in the kmalloc() call when allocating memory
165 * Return: newly allocated copy of @s with NUL-termination or %NULL in
168 char *kmemdup_nul(const char *s
, size_t len
, gfp_t gfp
)
175 buf
= kmalloc_track_caller(len
+ 1, gfp
);
182 EXPORT_SYMBOL(kmemdup_nul
);
185 * memdup_user - duplicate memory region from user space
187 * @src: source address in user space
188 * @len: number of bytes to copy
190 * Return: an ERR_PTR() on failure. Result is physically
191 * contiguous, to be freed by kfree().
193 void *memdup_user(const void __user
*src
, size_t len
)
197 p
= kmalloc_track_caller(len
, GFP_USER
| __GFP_NOWARN
);
199 return ERR_PTR(-ENOMEM
);
201 if (copy_from_user(p
, src
, len
)) {
203 return ERR_PTR(-EFAULT
);
208 EXPORT_SYMBOL(memdup_user
);
211 * vmemdup_user - duplicate memory region from user space
213 * @src: source address in user space
214 * @len: number of bytes to copy
216 * Return: an ERR_PTR() on failure. Result may be not
217 * physically contiguous. Use kvfree() to free.
219 void *vmemdup_user(const void __user
*src
, size_t len
)
223 p
= kvmalloc(len
, GFP_USER
);
225 return ERR_PTR(-ENOMEM
);
227 if (copy_from_user(p
, src
, len
)) {
229 return ERR_PTR(-EFAULT
);
234 EXPORT_SYMBOL(vmemdup_user
);
237 * strndup_user - duplicate an existing string from user space
238 * @s: The string to duplicate
239 * @n: Maximum number of bytes to copy, including the trailing NUL.
241 * Return: newly allocated copy of @s or an ERR_PTR() in case of error
243 char *strndup_user(const char __user
*s
, long n
)
248 length
= strnlen_user(s
, n
);
251 return ERR_PTR(-EFAULT
);
254 return ERR_PTR(-EINVAL
);
256 p
= memdup_user(s
, length
);
261 p
[length
- 1] = '\0';
265 EXPORT_SYMBOL(strndup_user
);
268 * memdup_user_nul - duplicate memory region from user space and NUL-terminate
270 * @src: source address in user space
271 * @len: number of bytes to copy
273 * Return: an ERR_PTR() on failure.
275 void *memdup_user_nul(const void __user
*src
, size_t len
)
280 * Always use GFP_KERNEL, since copy_from_user() can sleep and
281 * cause pagefault, which makes it pointless to use GFP_NOFS
284 p
= kmalloc_track_caller(len
+ 1, GFP_KERNEL
);
286 return ERR_PTR(-ENOMEM
);
288 if (copy_from_user(p
, src
, len
)) {
290 return ERR_PTR(-EFAULT
);
296 EXPORT_SYMBOL(memdup_user_nul
);
298 /* Check if the vma is being used as a stack by this task */
299 int vma_is_stack_for_current(struct vm_area_struct
*vma
)
301 struct task_struct
* __maybe_unused t
= current
;
303 return (vma
->vm_start
<= KSTK_ESP(t
) && vma
->vm_end
>= KSTK_ESP(t
));
307 * Change backing file, only valid to use during initial VMA setup.
309 void vma_set_file(struct vm_area_struct
*vma
, struct file
*file
)
311 /* Changing an anonymous vma with this is illegal */
313 swap(vma
->vm_file
, file
);
316 EXPORT_SYMBOL(vma_set_file
);
318 #ifndef STACK_RND_MASK
319 #define STACK_RND_MASK (0x7ff >> (PAGE_SHIFT - 12)) /* 8MB of VA */
322 unsigned long randomize_stack_top(unsigned long stack_top
)
324 unsigned long random_variable
= 0;
326 if (current
->flags
& PF_RANDOMIZE
) {
327 random_variable
= get_random_long();
328 random_variable
&= STACK_RND_MASK
;
329 random_variable
<<= PAGE_SHIFT
;
331 #ifdef CONFIG_STACK_GROWSUP
332 return PAGE_ALIGN(stack_top
) + random_variable
;
334 return PAGE_ALIGN(stack_top
) - random_variable
;
339 * randomize_page - Generate a random, page aligned address
340 * @start: The smallest acceptable address the caller will take.
341 * @range: The size of the area, starting at @start, within which the
342 * random address must fall.
344 * If @start + @range would overflow, @range is capped.
346 * NOTE: Historical use of randomize_range, which this replaces, presumed that
347 * @start was already page aligned. We now align it regardless.
349 * Return: A page aligned address within [start, start + range). On error,
350 * @start is returned.
352 unsigned long randomize_page(unsigned long start
, unsigned long range
)
354 if (!PAGE_ALIGNED(start
)) {
355 range
-= PAGE_ALIGN(start
) - start
;
356 start
= PAGE_ALIGN(start
);
359 if (start
> ULONG_MAX
- range
)
360 range
= ULONG_MAX
- start
;
362 range
>>= PAGE_SHIFT
;
367 return start
+ (get_random_long() % range
<< PAGE_SHIFT
);
370 #ifdef CONFIG_ARCH_WANT_DEFAULT_TOPDOWN_MMAP_LAYOUT
371 unsigned long __weak
arch_randomize_brk(struct mm_struct
*mm
)
373 /* Is the current task 32bit ? */
374 if (!IS_ENABLED(CONFIG_64BIT
) || is_compat_task())
375 return randomize_page(mm
->brk
, SZ_32M
);
377 return randomize_page(mm
->brk
, SZ_1G
);
380 unsigned long arch_mmap_rnd(void)
384 #ifdef CONFIG_HAVE_ARCH_MMAP_RND_COMPAT_BITS
385 if (is_compat_task())
386 rnd
= get_random_long() & ((1UL << mmap_rnd_compat_bits
) - 1);
388 #endif /* CONFIG_HAVE_ARCH_MMAP_RND_COMPAT_BITS */
389 rnd
= get_random_long() & ((1UL << mmap_rnd_bits
) - 1);
391 return rnd
<< PAGE_SHIFT
;
394 static int mmap_is_legacy(struct rlimit
*rlim_stack
)
396 if (current
->personality
& ADDR_COMPAT_LAYOUT
)
399 /* On parisc the stack always grows up - so a unlimited stack should
400 * not be an indicator to use the legacy memory layout. */
401 if (rlim_stack
->rlim_cur
== RLIM_INFINITY
&&
402 !IS_ENABLED(CONFIG_STACK_GROWSUP
))
405 return sysctl_legacy_va_layout
;
409 * Leave enough space between the mmap area and the stack to honour ulimit in
410 * the face of randomisation.
412 #define MIN_GAP (SZ_128M)
413 #define MAX_GAP (STACK_TOP / 6 * 5)
415 static unsigned long mmap_base(unsigned long rnd
, struct rlimit
*rlim_stack
)
417 unsigned long gap
= rlim_stack
->rlim_cur
;
418 unsigned long pad
= stack_guard_gap
;
420 /* Account for stack randomization if necessary */
421 if (current
->flags
& PF_RANDOMIZE
)
422 pad
+= (STACK_RND_MASK
<< PAGE_SHIFT
);
424 /* Values close to RLIM_INFINITY can overflow. */
430 else if (gap
> MAX_GAP
)
433 return PAGE_ALIGN(STACK_TOP
- gap
- rnd
);
436 void arch_pick_mmap_layout(struct mm_struct
*mm
, struct rlimit
*rlim_stack
)
438 unsigned long random_factor
= 0UL;
440 if (current
->flags
& PF_RANDOMIZE
)
441 random_factor
= arch_mmap_rnd();
443 if (mmap_is_legacy(rlim_stack
)) {
444 mm
->mmap_base
= TASK_UNMAPPED_BASE
+ random_factor
;
445 mm
->get_unmapped_area
= arch_get_unmapped_area
;
447 mm
->mmap_base
= mmap_base(random_factor
, rlim_stack
);
448 mm
->get_unmapped_area
= arch_get_unmapped_area_topdown
;
451 #elif defined(CONFIG_MMU) && !defined(HAVE_ARCH_PICK_MMAP_LAYOUT)
452 void arch_pick_mmap_layout(struct mm_struct
*mm
, struct rlimit
*rlim_stack
)
454 mm
->mmap_base
= TASK_UNMAPPED_BASE
;
455 mm
->get_unmapped_area
= arch_get_unmapped_area
;
460 * __account_locked_vm - account locked pages to an mm's locked_vm
461 * @mm: mm to account against
462 * @pages: number of pages to account
463 * @inc: %true if @pages should be considered positive, %false if not
464 * @task: task used to check RLIMIT_MEMLOCK
465 * @bypass_rlim: %true if checking RLIMIT_MEMLOCK should be skipped
467 * Assumes @task and @mm are valid (i.e. at least one reference on each), and
468 * that mmap_lock is held as writer.
472 * * -ENOMEM if RLIMIT_MEMLOCK would be exceeded.
474 int __account_locked_vm(struct mm_struct
*mm
, unsigned long pages
, bool inc
,
475 struct task_struct
*task
, bool bypass_rlim
)
477 unsigned long locked_vm
, limit
;
480 mmap_assert_write_locked(mm
);
482 locked_vm
= mm
->locked_vm
;
485 limit
= task_rlimit(task
, RLIMIT_MEMLOCK
) >> PAGE_SHIFT
;
486 if (locked_vm
+ pages
> limit
)
490 mm
->locked_vm
= locked_vm
+ pages
;
492 WARN_ON_ONCE(pages
> locked_vm
);
493 mm
->locked_vm
= locked_vm
- pages
;
496 pr_debug("%s: [%d] caller %ps %c%lu %lu/%lu%s\n", __func__
, task
->pid
,
497 (void *)_RET_IP_
, (inc
) ? '+' : '-', pages
<< PAGE_SHIFT
,
498 locked_vm
<< PAGE_SHIFT
, task_rlimit(task
, RLIMIT_MEMLOCK
),
499 ret
? " - exceeded" : "");
503 EXPORT_SYMBOL_GPL(__account_locked_vm
);
506 * account_locked_vm - account locked pages to an mm's locked_vm
507 * @mm: mm to account against, may be NULL
508 * @pages: number of pages to account
509 * @inc: %true if @pages should be considered positive, %false if not
511 * Assumes a non-NULL @mm is valid (i.e. at least one reference on it).
514 * * 0 on success, or if mm is NULL
515 * * -ENOMEM if RLIMIT_MEMLOCK would be exceeded.
517 int account_locked_vm(struct mm_struct
*mm
, unsigned long pages
, bool inc
)
521 if (pages
== 0 || !mm
)
525 ret
= __account_locked_vm(mm
, pages
, inc
, current
,
526 capable(CAP_IPC_LOCK
));
527 mmap_write_unlock(mm
);
531 EXPORT_SYMBOL_GPL(account_locked_vm
);
533 unsigned long vm_mmap_pgoff(struct file
*file
, unsigned long addr
,
534 unsigned long len
, unsigned long prot
,
535 unsigned long flag
, unsigned long pgoff
)
538 struct mm_struct
*mm
= current
->mm
;
539 unsigned long populate
;
542 ret
= security_mmap_file(file
, prot
, flag
);
544 if (mmap_write_lock_killable(mm
))
546 ret
= do_mmap(file
, addr
, len
, prot
, flag
, 0, pgoff
, &populate
,
548 mmap_write_unlock(mm
);
549 userfaultfd_unmap_complete(mm
, &uf
);
551 mm_populate(ret
, populate
);
556 unsigned long vm_mmap(struct file
*file
, unsigned long addr
,
557 unsigned long len
, unsigned long prot
,
558 unsigned long flag
, unsigned long offset
)
560 if (unlikely(offset
+ PAGE_ALIGN(len
) < offset
))
562 if (unlikely(offset_in_page(offset
)))
565 return vm_mmap_pgoff(file
, addr
, len
, prot
, flag
, offset
>> PAGE_SHIFT
);
567 EXPORT_SYMBOL(vm_mmap
);
570 * kvmalloc_node - attempt to allocate physically contiguous memory, but upon
571 * failure, fall back to non-contiguous (vmalloc) allocation.
572 * @size: size of the request.
573 * @flags: gfp mask for the allocation - must be compatible (superset) with GFP_KERNEL.
574 * @node: numa node to allocate from
576 * Uses kmalloc to get the memory but if the allocation fails then falls back
577 * to the vmalloc allocator. Use kvfree for freeing the memory.
579 * GFP_NOWAIT and GFP_ATOMIC are not supported, neither is the __GFP_NORETRY modifier.
580 * __GFP_RETRY_MAYFAIL is supported, and it should be used only if kmalloc is
581 * preferable to the vmalloc fallback, due to visible performance drawbacks.
583 * Return: pointer to the allocated memory of %NULL in case of failure
585 void *kvmalloc_node(size_t size
, gfp_t flags
, int node
)
587 gfp_t kmalloc_flags
= flags
;
591 * We want to attempt a large physically contiguous block first because
592 * it is less likely to fragment multiple larger blocks and therefore
593 * contribute to a long term fragmentation less than vmalloc fallback.
594 * However make sure that larger requests are not too disruptive - no
595 * OOM killer and no allocation failure warnings as we have a fallback.
597 if (size
> PAGE_SIZE
) {
598 kmalloc_flags
|= __GFP_NOWARN
;
600 if (!(kmalloc_flags
& __GFP_RETRY_MAYFAIL
))
601 kmalloc_flags
|= __GFP_NORETRY
;
603 /* nofail semantic is implemented by the vmalloc fallback */
604 kmalloc_flags
&= ~__GFP_NOFAIL
;
607 ret
= kmalloc_node(size
, kmalloc_flags
, node
);
610 * It doesn't really make sense to fallback to vmalloc for sub page
613 if (ret
|| size
<= PAGE_SIZE
)
616 /* non-sleeping allocations are not supported by vmalloc */
617 if (!gfpflags_allow_blocking(flags
))
620 /* Don't even allow crazy sizes */
621 if (unlikely(size
> INT_MAX
)) {
622 WARN_ON_ONCE(!(flags
& __GFP_NOWARN
));
627 * kvmalloc() can always use VM_ALLOW_HUGE_VMAP,
628 * since the callers already cannot assume anything
629 * about the resulting pointer, and cannot play
632 return __vmalloc_node_range(size
, 1, VMALLOC_START
, VMALLOC_END
,
633 flags
, PAGE_KERNEL
, VM_ALLOW_HUGE_VMAP
,
634 node
, __builtin_return_address(0));
636 EXPORT_SYMBOL(kvmalloc_node
);
639 * kvfree() - Free memory.
640 * @addr: Pointer to allocated memory.
642 * kvfree frees memory allocated by any of vmalloc(), kmalloc() or kvmalloc().
643 * It is slightly more efficient to use kfree() or vfree() if you are certain
644 * that you know which one to use.
646 * Context: Either preemptible task context or not-NMI interrupt.
648 void kvfree(const void *addr
)
650 if (is_vmalloc_addr(addr
))
655 EXPORT_SYMBOL(kvfree
);
658 * kvfree_sensitive - Free a data object containing sensitive information.
659 * @addr: address of the data object to be freed.
660 * @len: length of the data object.
662 * Use the special memzero_explicit() function to clear the content of a
663 * kvmalloc'ed object containing sensitive data to make sure that the
664 * compiler won't optimize out the data clearing.
666 void kvfree_sensitive(const void *addr
, size_t len
)
668 if (likely(!ZERO_OR_NULL_PTR(addr
))) {
669 memzero_explicit((void *)addr
, len
);
673 EXPORT_SYMBOL(kvfree_sensitive
);
675 void *kvrealloc(const void *p
, size_t oldsize
, size_t newsize
, gfp_t flags
)
679 if (oldsize
>= newsize
)
681 newp
= kvmalloc(newsize
, flags
);
684 memcpy(newp
, p
, oldsize
);
688 EXPORT_SYMBOL(kvrealloc
);
691 * __vmalloc_array - allocate memory for a virtually contiguous array.
692 * @n: number of elements.
693 * @size: element size.
694 * @flags: the type of memory to allocate (see kmalloc).
696 void *__vmalloc_array(size_t n
, size_t size
, gfp_t flags
)
700 if (unlikely(check_mul_overflow(n
, size
, &bytes
)))
702 return __vmalloc(bytes
, flags
);
704 EXPORT_SYMBOL(__vmalloc_array
);
707 * vmalloc_array - allocate memory for a virtually contiguous array.
708 * @n: number of elements.
709 * @size: element size.
711 void *vmalloc_array(size_t n
, size_t size
)
713 return __vmalloc_array(n
, size
, GFP_KERNEL
);
715 EXPORT_SYMBOL(vmalloc_array
);
718 * __vcalloc - allocate and zero memory for a virtually contiguous array.
719 * @n: number of elements.
720 * @size: element size.
721 * @flags: the type of memory to allocate (see kmalloc).
723 void *__vcalloc(size_t n
, size_t size
, gfp_t flags
)
725 return __vmalloc_array(n
, size
, flags
| __GFP_ZERO
);
727 EXPORT_SYMBOL(__vcalloc
);
730 * vcalloc - allocate and zero memory for a virtually contiguous array.
731 * @n: number of elements.
732 * @size: element size.
734 void *vcalloc(size_t n
, size_t size
)
736 return __vmalloc_array(n
, size
, GFP_KERNEL
| __GFP_ZERO
);
738 EXPORT_SYMBOL(vcalloc
);
740 struct anon_vma
*folio_anon_vma(struct folio
*folio
)
742 unsigned long mapping
= (unsigned long)folio
->mapping
;
744 if ((mapping
& PAGE_MAPPING_FLAGS
) != PAGE_MAPPING_ANON
)
746 return (void *)(mapping
- PAGE_MAPPING_ANON
);
750 * folio_mapping - Find the mapping where this folio is stored.
753 * For folios which are in the page cache, return the mapping that this
754 * page belongs to. Folios in the swap cache return the swap mapping
755 * this page is stored in (which is different from the mapping for the
756 * swap file or swap device where the data is stored).
758 * You can call this for folios which aren't in the swap cache or page
759 * cache and it will return NULL.
761 struct address_space
*folio_mapping(struct folio
*folio
)
763 struct address_space
*mapping
;
765 /* This happens if someone calls flush_dcache_page on slab page */
766 if (unlikely(folio_test_slab(folio
)))
769 if (unlikely(folio_test_swapcache(folio
)))
770 return swap_address_space(folio
->swap
);
772 mapping
= folio
->mapping
;
773 if ((unsigned long)mapping
& PAGE_MAPPING_FLAGS
)
778 EXPORT_SYMBOL(folio_mapping
);
781 * folio_copy - Copy the contents of one folio to another.
782 * @dst: Folio to copy to.
783 * @src: Folio to copy from.
785 * The bytes in the folio represented by @src are copied to @dst.
786 * Assumes the caller has validated that @dst is at least as large as @src.
787 * Can be called in atomic context for order-0 folios, but if the folio is
788 * larger, it may sleep.
790 void folio_copy(struct folio
*dst
, struct folio
*src
)
793 long nr
= folio_nr_pages(src
);
796 copy_highpage(folio_page(dst
, i
), folio_page(src
, i
));
803 int sysctl_overcommit_memory __read_mostly
= OVERCOMMIT_GUESS
;
804 int sysctl_overcommit_ratio __read_mostly
= 50;
805 unsigned long sysctl_overcommit_kbytes __read_mostly
;
806 int sysctl_max_map_count __read_mostly
= DEFAULT_MAX_MAP_COUNT
;
807 unsigned long sysctl_user_reserve_kbytes __read_mostly
= 1UL << 17; /* 128MB */
808 unsigned long sysctl_admin_reserve_kbytes __read_mostly
= 1UL << 13; /* 8MB */
810 int overcommit_ratio_handler(struct ctl_table
*table
, int write
, void *buffer
,
811 size_t *lenp
, loff_t
*ppos
)
815 ret
= proc_dointvec(table
, write
, buffer
, lenp
, ppos
);
816 if (ret
== 0 && write
)
817 sysctl_overcommit_kbytes
= 0;
821 static void sync_overcommit_as(struct work_struct
*dummy
)
823 percpu_counter_sync(&vm_committed_as
);
826 int overcommit_policy_handler(struct ctl_table
*table
, int write
, void *buffer
,
827 size_t *lenp
, loff_t
*ppos
)
834 * The deviation of sync_overcommit_as could be big with loose policy
835 * like OVERCOMMIT_ALWAYS/OVERCOMMIT_GUESS. When changing policy to
836 * strict OVERCOMMIT_NEVER, we need to reduce the deviation to comply
837 * with the strict "NEVER", and to avoid possible race condition (even
838 * though user usually won't too frequently do the switching to policy
839 * OVERCOMMIT_NEVER), the switch is done in the following order:
840 * 1. changing the batch
841 * 2. sync percpu count on each CPU
842 * 3. switch the policy
846 t
.data
= &new_policy
;
847 ret
= proc_dointvec_minmax(&t
, write
, buffer
, lenp
, ppos
);
848 if (ret
|| new_policy
== -1)
851 mm_compute_batch(new_policy
);
852 if (new_policy
== OVERCOMMIT_NEVER
)
853 schedule_on_each_cpu(sync_overcommit_as
);
854 sysctl_overcommit_memory
= new_policy
;
856 ret
= proc_dointvec_minmax(table
, write
, buffer
, lenp
, ppos
);
862 int overcommit_kbytes_handler(struct ctl_table
*table
, int write
, void *buffer
,
863 size_t *lenp
, loff_t
*ppos
)
867 ret
= proc_doulongvec_minmax(table
, write
, buffer
, lenp
, ppos
);
868 if (ret
== 0 && write
)
869 sysctl_overcommit_ratio
= 0;
874 * Committed memory limit enforced when OVERCOMMIT_NEVER policy is used
876 unsigned long vm_commit_limit(void)
878 unsigned long allowed
;
880 if (sysctl_overcommit_kbytes
)
881 allowed
= sysctl_overcommit_kbytes
>> (PAGE_SHIFT
- 10);
883 allowed
= ((totalram_pages() - hugetlb_total_pages())
884 * sysctl_overcommit_ratio
/ 100);
885 allowed
+= total_swap_pages
;
891 * Make sure vm_committed_as in one cacheline and not cacheline shared with
892 * other variables. It can be updated by several CPUs frequently.
894 struct percpu_counter vm_committed_as ____cacheline_aligned_in_smp
;
897 * The global memory commitment made in the system can be a metric
898 * that can be used to drive ballooning decisions when Linux is hosted
899 * as a guest. On Hyper-V, the host implements a policy engine for dynamically
900 * balancing memory across competing virtual machines that are hosted.
901 * Several metrics drive this policy engine including the guest reported
904 * The time cost of this is very low for small platforms, and for big
905 * platform like a 2S/36C/72T Skylake server, in worst case where
906 * vm_committed_as's spinlock is under severe contention, the time cost
907 * could be about 30~40 microseconds.
909 unsigned long vm_memory_committed(void)
911 return percpu_counter_sum_positive(&vm_committed_as
);
913 EXPORT_SYMBOL_GPL(vm_memory_committed
);
916 * Check that a process has enough memory to allocate a new virtual
917 * mapping. 0 means there is enough memory for the allocation to
918 * succeed and -ENOMEM implies there is not.
920 * We currently support three overcommit policies, which are set via the
921 * vm.overcommit_memory sysctl. See Documentation/mm/overcommit-accounting.rst
923 * Strict overcommit modes added 2002 Feb 26 by Alan Cox.
924 * Additional code 2002 Jul 20 by Robert Love.
926 * cap_sys_admin is 1 if the process has admin privileges, 0 otherwise.
928 * Note this is a helper function intended to be used by LSMs which
929 * wish to use this logic.
931 int __vm_enough_memory(struct mm_struct
*mm
, long pages
, int cap_sys_admin
)
935 vm_acct_memory(pages
);
938 * Sometimes we want to use more memory than we have
940 if (sysctl_overcommit_memory
== OVERCOMMIT_ALWAYS
)
943 if (sysctl_overcommit_memory
== OVERCOMMIT_GUESS
) {
944 if (pages
> totalram_pages() + total_swap_pages
)
949 allowed
= vm_commit_limit();
951 * Reserve some for root
954 allowed
-= sysctl_admin_reserve_kbytes
>> (PAGE_SHIFT
- 10);
957 * Don't let a single process grow so big a user can't recover
960 long reserve
= sysctl_user_reserve_kbytes
>> (PAGE_SHIFT
- 10);
962 allowed
-= min_t(long, mm
->total_vm
/ 32, reserve
);
965 if (percpu_counter_read_positive(&vm_committed_as
) < allowed
)
968 pr_warn_ratelimited("%s: pid: %d, comm: %s, not enough memory for the allocation\n",
969 __func__
, current
->pid
, current
->comm
);
970 vm_unacct_memory(pages
);
976 * get_cmdline() - copy the cmdline value to a buffer.
977 * @task: the task whose cmdline value to copy.
978 * @buffer: the buffer to copy to.
979 * @buflen: the length of the buffer. Larger cmdline values are truncated
982 * Return: the size of the cmdline field copied. Note that the copy does
983 * not guarantee an ending NULL byte.
985 int get_cmdline(struct task_struct
*task
, char *buffer
, int buflen
)
989 struct mm_struct
*mm
= get_task_mm(task
);
990 unsigned long arg_start
, arg_end
, env_start
, env_end
;
994 goto out_mm
; /* Shh! No looking before we're done */
996 spin_lock(&mm
->arg_lock
);
997 arg_start
= mm
->arg_start
;
998 arg_end
= mm
->arg_end
;
999 env_start
= mm
->env_start
;
1000 env_end
= mm
->env_end
;
1001 spin_unlock(&mm
->arg_lock
);
1003 len
= arg_end
- arg_start
;
1008 res
= access_process_vm(task
, arg_start
, buffer
, len
, FOLL_FORCE
);
1011 * If the nul at the end of args has been overwritten, then
1012 * assume application is using setproctitle(3).
1014 if (res
> 0 && buffer
[res
-1] != '\0' && len
< buflen
) {
1015 len
= strnlen(buffer
, res
);
1019 len
= env_end
- env_start
;
1020 if (len
> buflen
- res
)
1022 res
+= access_process_vm(task
, env_start
,
1025 res
= strnlen(buffer
, res
);
1034 int __weak
memcmp_pages(struct page
*page1
, struct page
*page2
)
1036 char *addr1
, *addr2
;
1039 addr1
= kmap_atomic(page1
);
1040 addr2
= kmap_atomic(page2
);
1041 ret
= memcmp(addr1
, addr2
, PAGE_SIZE
);
1042 kunmap_atomic(addr2
);
1043 kunmap_atomic(addr1
);
1047 #ifdef CONFIG_PRINTK
1049 * mem_dump_obj - Print available provenance information
1050 * @object: object for which to find provenance information.
1052 * This function uses pr_cont(), so that the caller is expected to have
1053 * printed out whatever preamble is appropriate. The provenance information
1054 * depends on the type of object and on how much debugging is enabled.
1055 * For example, for a slab-cache object, the slab name is printed, and,
1056 * if available, the return address and stack trace from the allocation
1057 * and last free path of that object.
1059 void mem_dump_obj(void *object
)
1063 if (kmem_valid_obj(object
)) {
1064 kmem_dump_obj(object
);
1068 if (vmalloc_dump_obj(object
))
1071 if (virt_addr_valid(object
))
1072 type
= "non-slab/vmalloc memory";
1073 else if (object
== NULL
)
1074 type
= "NULL pointer";
1075 else if (object
== ZERO_SIZE_PTR
)
1076 type
= "zero-size pointer";
1078 type
= "non-paged memory";
1080 pr_cont(" %s\n", type
);
1082 EXPORT_SYMBOL_GPL(mem_dump_obj
);
1086 * A driver might set a page logically offline -- PageOffline() -- and
1087 * turn the page inaccessible in the hypervisor; after that, access to page
1088 * content can be fatal.
1090 * Some special PFN walkers -- i.e., /proc/kcore -- read content of random
1091 * pages after checking PageOffline(); however, these PFN walkers can race
1092 * with drivers that set PageOffline().
1094 * page_offline_freeze()/page_offline_thaw() allows for a subsystem to
1095 * synchronize with such drivers, achieving that a page cannot be set
1096 * PageOffline() while frozen.
1098 * page_offline_begin()/page_offline_end() is used by drivers that care about
1099 * such races when setting a page PageOffline().
1101 static DECLARE_RWSEM(page_offline_rwsem
);
1103 void page_offline_freeze(void)
1105 down_read(&page_offline_rwsem
);
1108 void page_offline_thaw(void)
1110 up_read(&page_offline_rwsem
);
1113 void page_offline_begin(void)
1115 down_write(&page_offline_rwsem
);
1117 EXPORT_SYMBOL(page_offline_begin
);
1119 void page_offline_end(void)
1121 up_write(&page_offline_rwsem
);
1123 EXPORT_SYMBOL(page_offline_end
);
1125 #ifndef flush_dcache_folio
1126 void flush_dcache_folio(struct folio
*folio
)
1128 long i
, nr
= folio_nr_pages(folio
);
1130 for (i
= 0; i
< nr
; i
++)
1131 flush_dcache_page(folio_page(folio
, i
));
1133 EXPORT_SYMBOL(flush_dcache_folio
);