Something went wrong. Try again.
(I'm so sorry!) Linux kernel mirror (for testing) git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
kernel os linux
Something went wrong. Try again.
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592// SPDX-License-Identifier: GPL-2.0/* * Copyright (C) 2002 Richard Henderson * Copyright (C) 2001 Rusty Russell, 2002, 2010 Rusty Russell IBM. * Copyright (C) 2023 Luis Chamberlain <mcgrof@kernel.org> * Copyright (C) 2024 Mike Rapoport IBM. */
#define pr_fmt(fmt) "execmem: " fmt
#include <linux/mm.h>#include <linux/mutex.h>#include <linux/vmalloc.h>#include <linux/execmem.h>#include <linux/maple_tree.h>#include <linux/set_memory.h>#include <linux/moduleloader.h>#include <linux/text-patching.h>
#include <asm/tlbflush.h>
#include "internal.h"#include "vmalloc.h"
static struct execmem_info *execmem_info __ro_after_init;static struct execmem_info default_execmem_info __ro_after_init;
#ifdef CONFIG_MMUstatic void *execmem_vmalloc(struct execmem_range *range, size_t size, pgprot_t pgprot, unsigned long vm_flags){ bool kasan = range->flags & EXECMEM_KASAN_SHADOW; gfp_t gfp_flags = GFP_KERNEL | __GFP_NOWARN; unsigned int align = range->alignment; unsigned long start = range->start; unsigned long end = range->end; void *p;
if (kasan) vm_flags |= VM_DEFER_KMEMLEAK;
p = __vmalloc_node_range(size, align, start, end, gfp_flags, pgprot, vm_flags, NUMA_NO_NODE, __builtin_return_address(0)); if (!p && range->fallback_start) { start = range->fallback_start; end = range->fallback_end; p = __vmalloc_node_range(size, align, start, end, gfp_flags, pgprot, vm_flags, NUMA_NO_NODE, __builtin_return_address(0)); }
if (!p) { if (!(vm_flags & VM_REQUIRE_HUGE_VMAP)) pr_warn_ratelimited("unable to allocate memory\n"); return NULL; }
if (kasan && (kasan_alloc_module_shadow(p, size, GFP_KERNEL) < 0)) { vfree(p); return NULL; }
return p;}
struct vm_struct *execmem_vmap(size_t size){ struct execmem_range *range = &execmem_info->ranges[EXECMEM_MODULE_DATA]; struct vm_struct *area;
area = __get_vm_area_node(size, range->alignment, PAGE_SHIFT, VM_ALLOC, range->start, range->end, NUMA_NO_NODE, GFP_KERNEL, __builtin_return_address(0)); if (!area && range->fallback_start) area = __get_vm_area_node(size, range->alignment, PAGE_SHIFT, VM_ALLOC, range->fallback_start, range->fallback_end, NUMA_NO_NODE, GFP_KERNEL, __builtin_return_address(0));
return area;}#elsestatic void *execmem_vmalloc(struct execmem_range *range, size_t size, pgprot_t pgprot, unsigned long vm_flags){ return vmalloc(size);}#endif /* CONFIG_MMU */
#ifdef CONFIG_ARCH_HAS_EXECMEM_ROXstruct execmem_cache { struct mutex mutex; struct maple_tree busy_areas; struct maple_tree free_areas; unsigned int pending_free_cnt; /* protected by mutex */};
/* delay to schedule asynchronous free if fast path free fails */#define FREE_DELAY (msecs_to_jiffies(10))
/* mark entries in busy_areas that should be freed asynchronously */#define PENDING_FREE_MASK (1 << (PAGE_SHIFT - 1))
static struct execmem_cache execmem_cache = { .mutex = __MUTEX_INITIALIZER(execmem_cache.mutex), .busy_areas = MTREE_INIT_EXT(busy_areas, MT_FLAGS_LOCK_EXTERN, execmem_cache.mutex), .free_areas = MTREE_INIT_EXT(free_areas, MT_FLAGS_LOCK_EXTERN, execmem_cache.mutex),};
static inline unsigned long mas_range_len(struct ma_state *mas){ return mas->last - mas->index + 1;}
static int execmem_force_rw(void *ptr, size_t size){ unsigned int nr = PAGE_ALIGN(size) >> PAGE_SHIFT; unsigned long addr = (unsigned long)ptr; int ret;
ret = set_memory_nx(addr, nr); if (ret) return ret;
return set_memory_rw(addr, nr);}
int execmem_restore_rox(void *ptr, size_t size){ unsigned int nr = PAGE_ALIGN(size) >> PAGE_SHIFT; unsigned long addr = (unsigned long)ptr;
return set_memory_rox(addr, nr);}
static void execmem_cache_clean(struct work_struct *work){ struct maple_tree *free_areas = &execmem_cache.free_areas; MA_STATE(mas, free_areas, 0, ULONG_MAX); void *area;
guard(mutex)(&execmem_cache.mutex); mas_for_each(&mas, area, ULONG_MAX) { struct vm_struct *vm = find_vm_area(area); size_t size = mas_range_len(&mas);
if (vm && get_vm_area_size(vm) == size) { VM_WARN_ON_ONCE(!IS_ALIGNED(mas.index, PMD_SIZE) || !IS_ALIGNED(size, PMD_SIZE));
/* * Preallocate to ensure mas_store does not fail * If there is no memory for the tree update, bail out, * next execmem_free() might be more lucky */ if (mas_preallocate(&mas, NULL, GFP_KERNEL)) break;
mas_store_prealloc(&mas, NULL); vfree(area); } }}
static DECLARE_WORK(execmem_cache_clean_work, execmem_cache_clean);
static int execmem_cache_add_locked(void *ptr, size_t size, gfp_t gfp_mask){ struct maple_tree *free_areas = &execmem_cache.free_areas; unsigned long addr = (unsigned long)ptr; MA_STATE(mas, free_areas, addr - 1, addr + 1); unsigned long lower, upper; void *area = NULL;
lower = addr; upper = addr + size - 1;
area = mas_walk(&mas); if (area && mas.last == addr - 1) lower = mas.index;
area = mas_next(&mas, ULONG_MAX); if (area && mas.index == addr + size) upper = mas.last;
mas_set_range(&mas, lower, upper); return mas_store_gfp(&mas, (void *)lower, gfp_mask);}
static bool within_range(struct execmem_range *range, struct ma_state *mas, size_t size){ unsigned long addr = mas->index;
if (addr >= range->start && addr + size < range->end) return true;
if (range->fallback_start && addr >= range->fallback_start && addr + size < range->fallback_end) return true;
return false;}
static void *execmem_cache_alloc_locked(struct execmem_range *range, size_t size){ struct maple_tree *free_areas = &execmem_cache.free_areas; struct maple_tree *busy_areas = &execmem_cache.busy_areas; MA_STATE(mas_free, free_areas, 0, ULONG_MAX); MA_STATE(mas_busy, busy_areas, 0, ULONG_MAX); unsigned long addr, last, area_size = 0; void *area, *ptr = NULL; int err;
mas_for_each(&mas_free, area, ULONG_MAX) { area_size = mas_range_len(&mas_free);
if (area_size >= size && within_range(range, &mas_free, size)) break; }
if (area_size < size) return NULL;
addr = mas_free.index; last = mas_free.last;
mas_set_range(&mas_free, addr, addr + size - 1); if (mas_preallocate(&mas_free, NULL, GFP_KERNEL)) return NULL;
/* insert allocated size to busy_areas at range [addr, addr + size) */ mas_set_range(&mas_busy, addr, addr + size - 1); err = mas_store_gfp(&mas_busy, (void *)addr, GFP_KERNEL); if (err) goto err_destroy_mas_free;
mas_store_prealloc(&mas_free, NULL); if (area_size > size) { /* * re-insert remaining free size to free_areas at range * [addr + size, last] * the range matches an existing entry, so this cannot allocate */ ptr = (void *)(addr + size); mas_set_range(&mas_free, addr + size, last); mas_store_gfp(&mas_free, ptr, GFP_KERNEL); } ptr = (void *)addr;
return ptr;
err_destroy_mas_free: mas_destroy(&mas_free); return NULL;}
static void *__execmem_cache_alloc(struct execmem_range *range, size_t size){ guard(mutex)(&execmem_cache.mutex);
return execmem_cache_alloc_locked(range, size);}
static void *execmem_vmalloc_rox(struct execmem_range *range, size_t size, unsigned long vm_flags){ void *p __free(vfree) = execmem_vmalloc(range, size, PAGE_KERNEL, vm_flags); int err;
if (!p) return NULL;
/* fill memory with instructions that will trap */ execmem_fill_trapping_insns(p, size); set_vm_flush_reset_perms(p); err = set_memory_rox((unsigned long)p, size >> PAGE_SHIFT); if (err) return NULL;
return no_free_ptr(p);}
static void *execmem_cache_populate_alloc(struct execmem_range *range, size_t size){ unsigned long vm_flags = VM_REQUIRE_HUGE_VMAP; size_t alloc_size = round_up(size, PMD_SIZE); void *p __free(vfree) = NULL; int err;
p = execmem_vmalloc_rox(range, alloc_size, vm_flags); if (!p) return NULL;
/* * New memory blocks must be allocated and added to the cache * as an atomic operation, otherwise they may be consumed * by a parallel call to the execmem_cache_alloc function. */ guard(mutex)(&execmem_cache.mutex); err = execmem_cache_add_locked(p, alloc_size, GFP_KERNEL); if (err) return NULL;
/* the chunk belongs to the cache now */ retain_and_null_ptr(p);
return execmem_cache_alloc_locked(range, size);}
static void *execmem_alloc_rox(struct execmem_range *range, size_t size){ return execmem_vmalloc_rox(range, size, 0);}
static void *execmem_cache_alloc(struct execmem_range *range, size_t size){ void *p;
p = __execmem_cache_alloc(range, size); if (p) return p;
return execmem_cache_populate_alloc(range, size);}
static inline bool is_pending_free(void *ptr){ return ((unsigned long)ptr & PENDING_FREE_MASK);}
static inline void *pending_free_set(void *ptr){ return (void *)((unsigned long)ptr | PENDING_FREE_MASK);}
static inline void *pending_free_clear(void *ptr){ return (void *)((unsigned long)ptr & ~PENDING_FREE_MASK);}
static int __execmem_cache_free(struct ma_state *mas, void *ptr, gfp_t gfp_mask){ size_t size = mas_range_len(mas); int err;
err = execmem_force_rw(ptr, size); if (err) return err;
execmem_fill_trapping_insns(ptr, size); execmem_restore_rox(ptr, size);
err = execmem_cache_add_locked(ptr, size, gfp_mask); if (err) return err;
mas_store_gfp(mas, NULL, gfp_mask); return 0;}
static void execmem_cache_free_slow(struct work_struct *work);static DECLARE_DELAYED_WORK(execmem_cache_free_work, execmem_cache_free_slow);
static void execmem_cache_free_slow(struct work_struct *work){ struct maple_tree *busy_areas = &execmem_cache.busy_areas; MA_STATE(mas, busy_areas, 0, ULONG_MAX); void *area;
guard(mutex)(&execmem_cache.mutex);
if (!execmem_cache.pending_free_cnt) return;
mas_for_each(&mas, area, ULONG_MAX) { if (!is_pending_free(area)) continue;
area = pending_free_clear(area); if (__execmem_cache_free(&mas, area, GFP_KERNEL)) continue;
execmem_cache.pending_free_cnt--; }
if (execmem_cache.pending_free_cnt) schedule_delayed_work(&execmem_cache_free_work, FREE_DELAY); else schedule_work(&execmem_cache_clean_work);}
static bool execmem_cache_free(void *ptr){ struct maple_tree *busy_areas = &execmem_cache.busy_areas; unsigned long addr = (unsigned long)ptr; MA_STATE(mas, busy_areas, addr, addr); void *area; int err;
guard(mutex)(&execmem_cache.mutex);
area = mas_walk(&mas); if (!area) return false;
err = __execmem_cache_free(&mas, area, GFP_KERNEL | __GFP_NORETRY); if (err) { /* * mas points to exact slot we've got the area from, nothing * else can modify the tree because of the mutex, so there * won't be any allocations in mas_store_gfp() and it will just * change the pointer. */ area = pending_free_set(area); mas_store_gfp(&mas, area, GFP_KERNEL); execmem_cache.pending_free_cnt++; schedule_delayed_work(&execmem_cache_free_work, FREE_DELAY); return true; }
schedule_work(&execmem_cache_clean_work);
return true;}
#else /* CONFIG_ARCH_HAS_EXECMEM_ROX *//* * when ROX cache is not used the permissions defined by architectures for * execmem ranges that are updated before use (e.g. EXECMEM_MODULE_TEXT) must * be writable anyway */static inline int execmem_force_rw(void *ptr, size_t size){ return 0;}
static void *execmem_cache_alloc(struct execmem_range *range, size_t size){ return NULL;}
static void *execmem_alloc_rox(struct execmem_range *range, size_t size){ return NULL;}
static bool execmem_cache_free(void *ptr){ return false;}#endif /* CONFIG_ARCH_HAS_EXECMEM_ROX */
void *execmem_alloc(enum execmem_type type, size_t size){ struct execmem_range *range = &execmem_info->ranges[type]; bool use_rox_cache = range->flags & EXECMEM_ROX_CACHE; unsigned long vm_flags = VM_FLUSH_RESET_PERMS; pgprot_t pgprot = range->pgprot; void *p = NULL;
size = PAGE_ALIGN(size);
if (use_rox_cache) { p = execmem_cache_alloc(range, size); if (!p) p = execmem_alloc_rox(range, size); } else { p = execmem_vmalloc(range, size, pgprot, vm_flags); }
return kasan_reset_tag(p);}
void *execmem_alloc_rw(enum execmem_type type, size_t size){ void *p __free(execmem) = execmem_alloc(type, size); int err;
if (!p) return NULL;
err = execmem_force_rw(p, size); if (err) return NULL;
return no_free_ptr(p);}
void execmem_free(void *ptr){ /* * This memory may be RO, and freeing RO memory in an interrupt is not * supported by vmalloc. */ WARN_ON(in_interrupt());
if (!execmem_cache_free(ptr)) vfree(ptr);}
bool execmem_is_rox(enum execmem_type type){ return !!(execmem_info->ranges[type].flags & EXECMEM_ROX_CACHE);}
static bool execmem_validate(struct execmem_info *info){ struct execmem_range *r = &info->ranges[EXECMEM_DEFAULT];
if (!r->alignment || !r->start || !r->end || !pgprot_val(r->pgprot)) { pr_crit("Invalid parameters for execmem allocator, module loading will fail"); return false; }
if (!IS_ENABLED(CONFIG_ARCH_HAS_EXECMEM_ROX)) { for (int i = EXECMEM_DEFAULT; i < EXECMEM_TYPE_MAX; i++) { r = &info->ranges[i];
if (r->flags & EXECMEM_ROX_CACHE) { pr_warn_once("ROX cache is not supported\n"); r->flags &= ~EXECMEM_ROX_CACHE; } } }
return true;}
static void execmem_init_missing(struct execmem_info *info){ struct execmem_range *default_range = &info->ranges[EXECMEM_DEFAULT];
for (int i = EXECMEM_DEFAULT + 1; i < EXECMEM_TYPE_MAX; i++) { struct execmem_range *r = &info->ranges[i];
if (!r->start) { if (i == EXECMEM_MODULE_DATA) r->pgprot = PAGE_KERNEL; else r->pgprot = default_range->pgprot; r->alignment = default_range->alignment; r->start = default_range->start; r->end = default_range->end; r->flags = default_range->flags; r->fallback_start = default_range->fallback_start; r->fallback_end = default_range->fallback_end; } }}
struct execmem_info * __weak execmem_arch_setup(void){ return NULL;}
static void __init __execmem_init(void){ struct execmem_info *info = execmem_arch_setup();
if (!info) { info = execmem_info = &default_execmem_info; info->ranges[EXECMEM_DEFAULT].start = VMALLOC_START; info->ranges[EXECMEM_DEFAULT].end = VMALLOC_END; info->ranges[EXECMEM_DEFAULT].pgprot = PAGE_KERNEL_EXEC; info->ranges[EXECMEM_DEFAULT].alignment = 1; }
if (!execmem_validate(info)) return;
execmem_init_missing(info);
execmem_info = info;}
#ifdef CONFIG_ARCH_WANTS_EXECMEM_LATEstatic int __init execmem_late_init(void){ __execmem_init(); return 0;}core_initcall(execmem_late_init);#elsevoid __init execmem_init(void){ __execmem_init();}#endif