mirror of
https://github.com/torvalds/linux.git
synced 2024-11-10 14:11:52 +00:00
902861e34c
from hotplugged memory rather than only from main memory. Series "implement "memmap on memory" feature on s390". - More folio conversions from Matthew Wilcox in the series "Convert memcontrol charge moving to use folios" "mm: convert mm counter to take a folio" - Chengming Zhou has optimized zswap's rbtree locking, providing significant reductions in system time and modest but measurable reductions in overall runtimes. The series is "mm/zswap: optimize the scalability of zswap rb-tree". - Chengming Zhou has also provided the series "mm/zswap: optimize zswap lru list" which provides measurable runtime benefits in some swap-intensive situations. - And Chengming Zhou further optimizes zswap in the series "mm/zswap: optimize for dynamic zswap_pools". Measured improvements are modest. - zswap cleanups and simplifications from Yosry Ahmed in the series "mm: zswap: simplify zswap_swapoff()". - In the series "Add DAX ABI for memmap_on_memory", Vishal Verma has contributed several DAX cleanups as well as adding a sysfs tunable to control the memmap_on_memory setting when the dax device is hotplugged as system memory. - Johannes Weiner has added the large series "mm: zswap: cleanups", which does that. - More DAMON work from SeongJae Park in the series "mm/damon: make DAMON debugfs interface deprecation unignorable" "selftests/damon: add more tests for core functionalities and corner cases" "Docs/mm/damon: misc readability improvements" "mm/damon: let DAMOS feeds and tame/auto-tune itself" - In the series "mm/mempolicy: weighted interleave mempolicy and sysfs extension" Rakie Kim has developed a new mempolicy interleaving policy wherein we allocate memory across nodes in a weighted fashion rather than uniformly. This is beneficial in heterogeneous memory environments appearing with CXL. - Christophe Leroy has contributed some cleanup and consolidation work against the ARM pagetable dumping code in the series "mm: ptdump: Refactor CONFIG_DEBUG_WX and check_wx_pages debugfs attribute". - Luis Chamberlain has added some additional xarray selftesting in the series "test_xarray: advanced API multi-index tests". - Muhammad Usama Anjum has reworked the selftest code to make its human-readable output conform to the TAP ("Test Anything Protocol") format. Amongst other things, this opens up the use of third-party tools to parse and process out selftesting results. - Ryan Roberts has added fork()-time PTE batching of THP ptes in the series "mm/memory: optimize fork() with PTE-mapped THP". Mainly targeted at arm64, this significantly speeds up fork() when the process has a large number of pte-mapped folios. - David Hildenbrand also gets in on the THP pte batching game in his series "mm/memory: optimize unmap/zap with PTE-mapped THP". It implements batching during munmap() and other pte teardown situations. The microbenchmark improvements are nice. - And in the series "Transparent Contiguous PTEs for User Mappings" Ryan Roberts further utilizes arm's pte's contiguous bit ("contpte mappings"). Kernel build times on arm64 improved nicely. Ryan's series "Address some contpte nits" provides some followup work. - In the series "mm/hugetlb: Restore the reservation" Breno Leitao has fixed an obscure hugetlb race which was causing unnecessary page faults. He has also added a reproducer under the selftest code. - In the series "selftests/mm: Output cleanups for the compaction test", Mark Brown did what the title claims. - Kinsey Ho has added the series "mm/mglru: code cleanup and refactoring". - Even more zswap material from Nhat Pham. The series "fix and extend zswap kselftests" does as claimed. - In the series "Introduce cpu_dcache_is_aliasing() to fix DAX regression" Mathieu Desnoyers has cleaned up and fixed rather a mess in our handling of DAX on archiecctures which have virtually aliasing data caches. The arm architecture is the main beneficiary. - Lokesh Gidra's series "per-vma locks in userfaultfd" provides dramatic improvements in worst-case mmap_lock hold times during certain userfaultfd operations. - Some page_owner enhancements and maintenance work from Oscar Salvador in his series "page_owner: print stacks and their outstanding allocations" "page_owner: Fixup and cleanup" - Uladzislau Rezki has contributed some vmalloc scalability improvements in his series "Mitigate a vmap lock contention". It realizes a 12x improvement for a certain microbenchmark. - Some kexec/crash cleanup work from Baoquan He in the series "Split crash out from kexec and clean up related config items". - Some zsmalloc maintenance work from Chengming Zhou in the series "mm/zsmalloc: fix and optimize objects/page migration" "mm/zsmalloc: some cleanup for get/set_zspage_mapping()" - Zi Yan has taught the MM to perform compaction on folios larger than order=0. This a step along the path to implementaton of the merging of large anonymous folios. The series is named "Enable >0 order folio memory compaction". - Christoph Hellwig has done quite a lot of cleanup work in the pagecache writeback code in his series "convert write_cache_pages() to an iterator". - Some modest hugetlb cleanups and speedups in Vishal Moola's series "Handle hugetlb faults under the VMA lock". - Zi Yan has changed the page splitting code so we can split huge pages into sizes other than order-0 to better utilize large folios. The series is named "Split a folio to any lower order folios". - David Hildenbrand has contributed the series "mm: remove total_mapcount()", a cleanup. - Matthew Wilcox has sought to improve the performance of bulk memory freeing in his series "Rearrange batched folio freeing". - Gang Li's series "hugetlb: parallelize hugetlb page init on boot" provides large improvements in bootup times on large machines which are configured to use large numbers of hugetlb pages. - Matthew Wilcox's series "PageFlags cleanups" does that. - Qi Zheng's series "minor fixes and supplement for ptdesc" does that also. S390 is affected. - Cleanups to our pagemap utility functions from Peter Xu in his series "mm/treewide: Replace pXd_large() with pXd_leaf()". - Nico Pache has fixed a few things with our hugepage selftests in his series "selftests/mm: Improve Hugepage Test Handling in MM Selftests". - Also, of course, many singleton patches to many things. Please see the individual changelogs for details. -----BEGIN PGP SIGNATURE----- iHUEABYIAB0WIQTTMBEPP41GrTpTJgfdBJ7gKXxAjgUCZfJpPQAKCRDdBJ7gKXxA joxeAP9TrcMEuHnLmBlhIXkWbIR4+ki+pA3v+gNTlJiBhnfVSgD9G55t1aBaRplx TMNhHfyiHYDTx/GAV9NXW84tasJSDgA= =TG55 -----END PGP SIGNATURE----- Merge tag 'mm-stable-2024-03-13-20-04' of git://git.kernel.org/pub/scm/linux/kernel/git/akpm/mm Pull MM updates from Andrew Morton: - Sumanth Korikkar has taught s390 to allocate hotplug-time page frames from hotplugged memory rather than only from main memory. Series "implement "memmap on memory" feature on s390". - More folio conversions from Matthew Wilcox in the series "Convert memcontrol charge moving to use folios" "mm: convert mm counter to take a folio" - Chengming Zhou has optimized zswap's rbtree locking, providing significant reductions in system time and modest but measurable reductions in overall runtimes. The series is "mm/zswap: optimize the scalability of zswap rb-tree". - Chengming Zhou has also provided the series "mm/zswap: optimize zswap lru list" which provides measurable runtime benefits in some swap-intensive situations. - And Chengming Zhou further optimizes zswap in the series "mm/zswap: optimize for dynamic zswap_pools". Measured improvements are modest. - zswap cleanups and simplifications from Yosry Ahmed in the series "mm: zswap: simplify zswap_swapoff()". - In the series "Add DAX ABI for memmap_on_memory", Vishal Verma has contributed several DAX cleanups as well as adding a sysfs tunable to control the memmap_on_memory setting when the dax device is hotplugged as system memory. - Johannes Weiner has added the large series "mm: zswap: cleanups", which does that. - More DAMON work from SeongJae Park in the series "mm/damon: make DAMON debugfs interface deprecation unignorable" "selftests/damon: add more tests for core functionalities and corner cases" "Docs/mm/damon: misc readability improvements" "mm/damon: let DAMOS feeds and tame/auto-tune itself" - In the series "mm/mempolicy: weighted interleave mempolicy and sysfs extension" Rakie Kim has developed a new mempolicy interleaving policy wherein we allocate memory across nodes in a weighted fashion rather than uniformly. This is beneficial in heterogeneous memory environments appearing with CXL. - Christophe Leroy has contributed some cleanup and consolidation work against the ARM pagetable dumping code in the series "mm: ptdump: Refactor CONFIG_DEBUG_WX and check_wx_pages debugfs attribute". - Luis Chamberlain has added some additional xarray selftesting in the series "test_xarray: advanced API multi-index tests". - Muhammad Usama Anjum has reworked the selftest code to make its human-readable output conform to the TAP ("Test Anything Protocol") format. Amongst other things, this opens up the use of third-party tools to parse and process out selftesting results. - Ryan Roberts has added fork()-time PTE batching of THP ptes in the series "mm/memory: optimize fork() with PTE-mapped THP". Mainly targeted at arm64, this significantly speeds up fork() when the process has a large number of pte-mapped folios. - David Hildenbrand also gets in on the THP pte batching game in his series "mm/memory: optimize unmap/zap with PTE-mapped THP". It implements batching during munmap() and other pte teardown situations. The microbenchmark improvements are nice. - And in the series "Transparent Contiguous PTEs for User Mappings" Ryan Roberts further utilizes arm's pte's contiguous bit ("contpte mappings"). Kernel build times on arm64 improved nicely. Ryan's series "Address some contpte nits" provides some followup work. - In the series "mm/hugetlb: Restore the reservation" Breno Leitao has fixed an obscure hugetlb race which was causing unnecessary page faults. He has also added a reproducer under the selftest code. - In the series "selftests/mm: Output cleanups for the compaction test", Mark Brown did what the title claims. - Kinsey Ho has added the series "mm/mglru: code cleanup and refactoring". - Even more zswap material from Nhat Pham. The series "fix and extend zswap kselftests" does as claimed. - In the series "Introduce cpu_dcache_is_aliasing() to fix DAX regression" Mathieu Desnoyers has cleaned up and fixed rather a mess in our handling of DAX on archiecctures which have virtually aliasing data caches. The arm architecture is the main beneficiary. - Lokesh Gidra's series "per-vma locks in userfaultfd" provides dramatic improvements in worst-case mmap_lock hold times during certain userfaultfd operations. - Some page_owner enhancements and maintenance work from Oscar Salvador in his series "page_owner: print stacks and their outstanding allocations" "page_owner: Fixup and cleanup" - Uladzislau Rezki has contributed some vmalloc scalability improvements in his series "Mitigate a vmap lock contention". It realizes a 12x improvement for a certain microbenchmark. - Some kexec/crash cleanup work from Baoquan He in the series "Split crash out from kexec and clean up related config items". - Some zsmalloc maintenance work from Chengming Zhou in the series "mm/zsmalloc: fix and optimize objects/page migration" "mm/zsmalloc: some cleanup for get/set_zspage_mapping()" - Zi Yan has taught the MM to perform compaction on folios larger than order=0. This a step along the path to implementaton of the merging of large anonymous folios. The series is named "Enable >0 order folio memory compaction". - Christoph Hellwig has done quite a lot of cleanup work in the pagecache writeback code in his series "convert write_cache_pages() to an iterator". - Some modest hugetlb cleanups and speedups in Vishal Moola's series "Handle hugetlb faults under the VMA lock". - Zi Yan has changed the page splitting code so we can split huge pages into sizes other than order-0 to better utilize large folios. The series is named "Split a folio to any lower order folios". - David Hildenbrand has contributed the series "mm: remove total_mapcount()", a cleanup. - Matthew Wilcox has sought to improve the performance of bulk memory freeing in his series "Rearrange batched folio freeing". - Gang Li's series "hugetlb: parallelize hugetlb page init on boot" provides large improvements in bootup times on large machines which are configured to use large numbers of hugetlb pages. - Matthew Wilcox's series "PageFlags cleanups" does that. - Qi Zheng's series "minor fixes and supplement for ptdesc" does that also. S390 is affected. - Cleanups to our pagemap utility functions from Peter Xu in his series "mm/treewide: Replace pXd_large() with pXd_leaf()". - Nico Pache has fixed a few things with our hugepage selftests in his series "selftests/mm: Improve Hugepage Test Handling in MM Selftests". - Also, of course, many singleton patches to many things. Please see the individual changelogs for details. * tag 'mm-stable-2024-03-13-20-04' of git://git.kernel.org/pub/scm/linux/kernel/git/akpm/mm: (435 commits) mm/zswap: remove the memcpy if acomp is not sleepable crypto: introduce: acomp_is_async to expose if comp drivers might sleep memtest: use {READ,WRITE}_ONCE in memory scanning mm: prohibit the last subpage from reusing the entire large folio mm: recover pud_leaf() definitions in nopmd case selftests/mm: skip the hugetlb-madvise tests on unmet hugepage requirements selftests/mm: skip uffd hugetlb tests with insufficient hugepages selftests/mm: dont fail testsuite due to a lack of hugepages mm/huge_memory: skip invalid debugfs new_order input for folio split mm/huge_memory: check new folio order when split a folio mm, vmscan: retry kswapd's priority loop with cache_trim_mode off on failure mm: add an explicit smp_wmb() to UFFDIO_CONTINUE mm: fix list corruption in put_pages_list mm: remove folio from deferred split list before uncharging it filemap: avoid unnecessary major faults in filemap_fault() mm,page_owner: drop unnecessary check mm,page_owner: check for null stack_record before bumping its refcount mm: swap: fix race between free_swap_and_cache() and swapoff() mm/treewide: align up pXd_leaf() retval across archs mm/treewide: drop pXd_large() ...
413 lines
12 KiB
C
413 lines
12 KiB
C
// SPDX-License-Identifier: GPL-2.0-only
|
|
/*
|
|
* This file contains kasan initialization code for ARM64.
|
|
*
|
|
* Copyright (c) 2015 Samsung Electronics Co., Ltd.
|
|
* Author: Andrey Ryabinin <ryabinin.a.a@gmail.com>
|
|
*/
|
|
|
|
#define pr_fmt(fmt) "kasan: " fmt
|
|
#include <linux/kasan.h>
|
|
#include <linux/kernel.h>
|
|
#include <linux/sched/task.h>
|
|
#include <linux/memblock.h>
|
|
#include <linux/start_kernel.h>
|
|
#include <linux/mm.h>
|
|
|
|
#include <asm/mmu_context.h>
|
|
#include <asm/kernel-pgtable.h>
|
|
#include <asm/page.h>
|
|
#include <asm/pgalloc.h>
|
|
#include <asm/sections.h>
|
|
#include <asm/tlbflush.h>
|
|
|
|
#if defined(CONFIG_KASAN_GENERIC) || defined(CONFIG_KASAN_SW_TAGS)
|
|
|
|
static pgd_t tmp_pg_dir[PTRS_PER_PTE] __initdata __aligned(PAGE_SIZE);
|
|
|
|
/*
|
|
* The p*d_populate functions call virt_to_phys implicitly so they can't be used
|
|
* directly on kernel symbols (bm_p*d). All the early functions are called too
|
|
* early to use lm_alias so __p*d_populate functions must be used to populate
|
|
* with the physical address from __pa_symbol.
|
|
*/
|
|
|
|
static phys_addr_t __init kasan_alloc_zeroed_page(int node)
|
|
{
|
|
void *p = memblock_alloc_try_nid(PAGE_SIZE, PAGE_SIZE,
|
|
__pa(MAX_DMA_ADDRESS),
|
|
MEMBLOCK_ALLOC_NOLEAKTRACE, node);
|
|
if (!p)
|
|
panic("%s: Failed to allocate %lu bytes align=0x%lx nid=%d from=%llx\n",
|
|
__func__, PAGE_SIZE, PAGE_SIZE, node,
|
|
__pa(MAX_DMA_ADDRESS));
|
|
|
|
return __pa(p);
|
|
}
|
|
|
|
static phys_addr_t __init kasan_alloc_raw_page(int node)
|
|
{
|
|
void *p = memblock_alloc_try_nid_raw(PAGE_SIZE, PAGE_SIZE,
|
|
__pa(MAX_DMA_ADDRESS),
|
|
MEMBLOCK_ALLOC_NOLEAKTRACE,
|
|
node);
|
|
if (!p)
|
|
panic("%s: Failed to allocate %lu bytes align=0x%lx nid=%d from=%llx\n",
|
|
__func__, PAGE_SIZE, PAGE_SIZE, node,
|
|
__pa(MAX_DMA_ADDRESS));
|
|
|
|
return __pa(p);
|
|
}
|
|
|
|
static pte_t *__init kasan_pte_offset(pmd_t *pmdp, unsigned long addr, int node,
|
|
bool early)
|
|
{
|
|
if (pmd_none(READ_ONCE(*pmdp))) {
|
|
phys_addr_t pte_phys = early ?
|
|
__pa_symbol(kasan_early_shadow_pte)
|
|
: kasan_alloc_zeroed_page(node);
|
|
__pmd_populate(pmdp, pte_phys, PMD_TYPE_TABLE);
|
|
}
|
|
|
|
return early ? pte_offset_kimg(pmdp, addr)
|
|
: pte_offset_kernel(pmdp, addr);
|
|
}
|
|
|
|
static pmd_t *__init kasan_pmd_offset(pud_t *pudp, unsigned long addr, int node,
|
|
bool early)
|
|
{
|
|
if (pud_none(READ_ONCE(*pudp))) {
|
|
phys_addr_t pmd_phys = early ?
|
|
__pa_symbol(kasan_early_shadow_pmd)
|
|
: kasan_alloc_zeroed_page(node);
|
|
__pud_populate(pudp, pmd_phys, PUD_TYPE_TABLE);
|
|
}
|
|
|
|
return early ? pmd_offset_kimg(pudp, addr) : pmd_offset(pudp, addr);
|
|
}
|
|
|
|
static pud_t *__init kasan_pud_offset(p4d_t *p4dp, unsigned long addr, int node,
|
|
bool early)
|
|
{
|
|
if (p4d_none(READ_ONCE(*p4dp))) {
|
|
phys_addr_t pud_phys = early ?
|
|
__pa_symbol(kasan_early_shadow_pud)
|
|
: kasan_alloc_zeroed_page(node);
|
|
__p4d_populate(p4dp, pud_phys, P4D_TYPE_TABLE);
|
|
}
|
|
|
|
return early ? pud_offset_kimg(p4dp, addr) : pud_offset(p4dp, addr);
|
|
}
|
|
|
|
static p4d_t *__init kasan_p4d_offset(pgd_t *pgdp, unsigned long addr, int node,
|
|
bool early)
|
|
{
|
|
if (pgd_none(READ_ONCE(*pgdp))) {
|
|
phys_addr_t p4d_phys = early ?
|
|
__pa_symbol(kasan_early_shadow_p4d)
|
|
: kasan_alloc_zeroed_page(node);
|
|
__pgd_populate(pgdp, p4d_phys, PGD_TYPE_TABLE);
|
|
}
|
|
|
|
return early ? p4d_offset_kimg(pgdp, addr) : p4d_offset(pgdp, addr);
|
|
}
|
|
|
|
static void __init kasan_pte_populate(pmd_t *pmdp, unsigned long addr,
|
|
unsigned long end, int node, bool early)
|
|
{
|
|
unsigned long next;
|
|
pte_t *ptep = kasan_pte_offset(pmdp, addr, node, early);
|
|
|
|
do {
|
|
phys_addr_t page_phys = early ?
|
|
__pa_symbol(kasan_early_shadow_page)
|
|
: kasan_alloc_raw_page(node);
|
|
if (!early)
|
|
memset(__va(page_phys), KASAN_SHADOW_INIT, PAGE_SIZE);
|
|
next = addr + PAGE_SIZE;
|
|
__set_pte(ptep, pfn_pte(__phys_to_pfn(page_phys), PAGE_KERNEL));
|
|
} while (ptep++, addr = next, addr != end && pte_none(__ptep_get(ptep)));
|
|
}
|
|
|
|
static void __init kasan_pmd_populate(pud_t *pudp, unsigned long addr,
|
|
unsigned long end, int node, bool early)
|
|
{
|
|
unsigned long next;
|
|
pmd_t *pmdp = kasan_pmd_offset(pudp, addr, node, early);
|
|
|
|
do {
|
|
next = pmd_addr_end(addr, end);
|
|
kasan_pte_populate(pmdp, addr, next, node, early);
|
|
} while (pmdp++, addr = next, addr != end && pmd_none(READ_ONCE(*pmdp)));
|
|
}
|
|
|
|
static void __init kasan_pud_populate(p4d_t *p4dp, unsigned long addr,
|
|
unsigned long end, int node, bool early)
|
|
{
|
|
unsigned long next;
|
|
pud_t *pudp = kasan_pud_offset(p4dp, addr, node, early);
|
|
|
|
do {
|
|
next = pud_addr_end(addr, end);
|
|
kasan_pmd_populate(pudp, addr, next, node, early);
|
|
} while (pudp++, addr = next, addr != end && pud_none(READ_ONCE(*pudp)));
|
|
}
|
|
|
|
static void __init kasan_p4d_populate(pgd_t *pgdp, unsigned long addr,
|
|
unsigned long end, int node, bool early)
|
|
{
|
|
unsigned long next;
|
|
p4d_t *p4dp = kasan_p4d_offset(pgdp, addr, node, early);
|
|
|
|
do {
|
|
next = p4d_addr_end(addr, end);
|
|
kasan_pud_populate(p4dp, addr, next, node, early);
|
|
} while (p4dp++, addr = next, addr != end && p4d_none(READ_ONCE(*p4dp)));
|
|
}
|
|
|
|
static void __init kasan_pgd_populate(unsigned long addr, unsigned long end,
|
|
int node, bool early)
|
|
{
|
|
unsigned long next;
|
|
pgd_t *pgdp;
|
|
|
|
pgdp = pgd_offset_k(addr);
|
|
do {
|
|
next = pgd_addr_end(addr, end);
|
|
kasan_p4d_populate(pgdp, addr, next, node, early);
|
|
} while (pgdp++, addr = next, addr != end);
|
|
}
|
|
|
|
#if defined(CONFIG_ARM64_64K_PAGES) || CONFIG_PGTABLE_LEVELS > 4
|
|
#define SHADOW_ALIGN P4D_SIZE
|
|
#else
|
|
#define SHADOW_ALIGN PUD_SIZE
|
|
#endif
|
|
|
|
/*
|
|
* Return whether 'addr' is aligned to the size covered by a root level
|
|
* descriptor.
|
|
*/
|
|
static bool __init root_level_aligned(u64 addr)
|
|
{
|
|
int shift = (ARM64_HW_PGTABLE_LEVELS(vabits_actual) - 1) * (PAGE_SHIFT - 3);
|
|
|
|
return (addr % (PAGE_SIZE << shift)) == 0;
|
|
}
|
|
|
|
/* The early shadow maps everything to a single page of zeroes */
|
|
asmlinkage void __init kasan_early_init(void)
|
|
{
|
|
BUILD_BUG_ON(KASAN_SHADOW_OFFSET !=
|
|
KASAN_SHADOW_END - (1UL << (64 - KASAN_SHADOW_SCALE_SHIFT)));
|
|
BUILD_BUG_ON(!IS_ALIGNED(_KASAN_SHADOW_START(VA_BITS), SHADOW_ALIGN));
|
|
BUILD_BUG_ON(!IS_ALIGNED(_KASAN_SHADOW_START(VA_BITS_MIN), SHADOW_ALIGN));
|
|
BUILD_BUG_ON(!IS_ALIGNED(KASAN_SHADOW_END, SHADOW_ALIGN));
|
|
|
|
if (!root_level_aligned(KASAN_SHADOW_START)) {
|
|
/*
|
|
* The start address is misaligned, and so the next level table
|
|
* will be shared with the linear region. This can happen with
|
|
* 4 or 5 level paging, so install a generic pte_t[] as the
|
|
* next level. This prevents the kasan_pgd_populate call below
|
|
* from inserting an entry that refers to the shared KASAN zero
|
|
* shadow pud_t[]/p4d_t[], which could end up getting corrupted
|
|
* when the linear region is mapped.
|
|
*/
|
|
static pte_t tbl[PTRS_PER_PTE] __page_aligned_bss;
|
|
pgd_t *pgdp = pgd_offset_k(KASAN_SHADOW_START);
|
|
|
|
set_pgd(pgdp, __pgd(__pa_symbol(tbl) | PGD_TYPE_TABLE));
|
|
}
|
|
|
|
kasan_pgd_populate(KASAN_SHADOW_START, KASAN_SHADOW_END, NUMA_NO_NODE,
|
|
true);
|
|
}
|
|
|
|
/* Set up full kasan mappings, ensuring that the mapped pages are zeroed */
|
|
static void __init kasan_map_populate(unsigned long start, unsigned long end,
|
|
int node)
|
|
{
|
|
kasan_pgd_populate(start & PAGE_MASK, PAGE_ALIGN(end), node, false);
|
|
}
|
|
|
|
/*
|
|
* Return the descriptor index of 'addr' in the root level table
|
|
*/
|
|
static int __init root_level_idx(u64 addr)
|
|
{
|
|
/*
|
|
* On 64k pages, the TTBR1 range root tables are extended for 52-bit
|
|
* virtual addressing, and TTBR1 will simply point to the pgd_t entry
|
|
* that covers the start of the 48-bit addressable VA space if LVA is
|
|
* not implemented. This means we need to index the table as usual,
|
|
* instead of masking off bits based on vabits_actual.
|
|
*/
|
|
u64 vabits = IS_ENABLED(CONFIG_ARM64_64K_PAGES) ? VA_BITS
|
|
: vabits_actual;
|
|
int shift = (ARM64_HW_PGTABLE_LEVELS(vabits) - 1) * (PAGE_SHIFT - 3);
|
|
|
|
return (addr & ~_PAGE_OFFSET(vabits)) >> (shift + PAGE_SHIFT);
|
|
}
|
|
|
|
/*
|
|
* Clone a next level table from swapper_pg_dir into tmp_pg_dir
|
|
*/
|
|
static void __init clone_next_level(u64 addr, pgd_t *tmp_pg_dir, pud_t *pud)
|
|
{
|
|
int idx = root_level_idx(addr);
|
|
pgd_t pgd = READ_ONCE(swapper_pg_dir[idx]);
|
|
pud_t *pudp = (pud_t *)__phys_to_kimg(__pgd_to_phys(pgd));
|
|
|
|
memcpy(pud, pudp, PAGE_SIZE);
|
|
tmp_pg_dir[idx] = __pgd(__phys_to_pgd_val(__pa_symbol(pud)) |
|
|
PUD_TYPE_TABLE);
|
|
}
|
|
|
|
/*
|
|
* Return the descriptor index of 'addr' in the next level table
|
|
*/
|
|
static int __init next_level_idx(u64 addr)
|
|
{
|
|
int shift = (ARM64_HW_PGTABLE_LEVELS(vabits_actual) - 2) * (PAGE_SHIFT - 3);
|
|
|
|
return (addr >> (shift + PAGE_SHIFT)) % PTRS_PER_PTE;
|
|
}
|
|
|
|
/*
|
|
* Dereference the table descriptor at 'pgd_idx' and clear the entries from
|
|
* 'start' to 'end' (exclusive) from the table.
|
|
*/
|
|
static void __init clear_next_level(int pgd_idx, int start, int end)
|
|
{
|
|
pgd_t pgd = READ_ONCE(swapper_pg_dir[pgd_idx]);
|
|
pud_t *pudp = (pud_t *)__phys_to_kimg(__pgd_to_phys(pgd));
|
|
|
|
memset(&pudp[start], 0, (end - start) * sizeof(pud_t));
|
|
}
|
|
|
|
static void __init clear_shadow(u64 start, u64 end)
|
|
{
|
|
int l = root_level_idx(start), m = root_level_idx(end);
|
|
|
|
if (!root_level_aligned(start))
|
|
clear_next_level(l++, next_level_idx(start), PTRS_PER_PTE);
|
|
if (!root_level_aligned(end))
|
|
clear_next_level(m, 0, next_level_idx(end));
|
|
memset(&swapper_pg_dir[l], 0, (m - l) * sizeof(pgd_t));
|
|
}
|
|
|
|
static void __init kasan_init_shadow(void)
|
|
{
|
|
static pud_t pud[2][PTRS_PER_PUD] __initdata __aligned(PAGE_SIZE);
|
|
u64 kimg_shadow_start, kimg_shadow_end;
|
|
u64 mod_shadow_start;
|
|
u64 vmalloc_shadow_end;
|
|
phys_addr_t pa_start, pa_end;
|
|
u64 i;
|
|
|
|
kimg_shadow_start = (u64)kasan_mem_to_shadow(KERNEL_START) & PAGE_MASK;
|
|
kimg_shadow_end = PAGE_ALIGN((u64)kasan_mem_to_shadow(KERNEL_END));
|
|
|
|
mod_shadow_start = (u64)kasan_mem_to_shadow((void *)MODULES_VADDR);
|
|
|
|
vmalloc_shadow_end = (u64)kasan_mem_to_shadow((void *)VMALLOC_END);
|
|
|
|
/*
|
|
* We are going to perform proper setup of shadow memory.
|
|
* At first we should unmap early shadow (clear_pgds() call below).
|
|
* However, instrumented code couldn't execute without shadow memory.
|
|
* tmp_pg_dir used to keep early shadow mapped until full shadow
|
|
* setup will be finished.
|
|
*/
|
|
memcpy(tmp_pg_dir, swapper_pg_dir, sizeof(tmp_pg_dir));
|
|
|
|
/*
|
|
* If the start or end address of the shadow region is not aligned to
|
|
* the root level size, we have to allocate a temporary next-level table
|
|
* in each case, clone the next level of descriptors, and install the
|
|
* table into tmp_pg_dir. Note that with 5 levels of paging, the next
|
|
* level will in fact be p4d_t, but that makes no difference in this
|
|
* case.
|
|
*/
|
|
if (!root_level_aligned(KASAN_SHADOW_START))
|
|
clone_next_level(KASAN_SHADOW_START, tmp_pg_dir, pud[0]);
|
|
if (!root_level_aligned(KASAN_SHADOW_END))
|
|
clone_next_level(KASAN_SHADOW_END, tmp_pg_dir, pud[1]);
|
|
dsb(ishst);
|
|
cpu_replace_ttbr1(lm_alias(tmp_pg_dir));
|
|
|
|
clear_shadow(KASAN_SHADOW_START, KASAN_SHADOW_END);
|
|
|
|
kasan_map_populate(kimg_shadow_start, kimg_shadow_end,
|
|
early_pfn_to_nid(virt_to_pfn(lm_alias(KERNEL_START))));
|
|
|
|
kasan_populate_early_shadow(kasan_mem_to_shadow((void *)PAGE_END),
|
|
(void *)mod_shadow_start);
|
|
|
|
BUILD_BUG_ON(VMALLOC_START != MODULES_END);
|
|
kasan_populate_early_shadow((void *)vmalloc_shadow_end,
|
|
(void *)KASAN_SHADOW_END);
|
|
|
|
for_each_mem_range(i, &pa_start, &pa_end) {
|
|
void *start = (void *)__phys_to_virt(pa_start);
|
|
void *end = (void *)__phys_to_virt(pa_end);
|
|
|
|
if (start >= end)
|
|
break;
|
|
|
|
kasan_map_populate((unsigned long)kasan_mem_to_shadow(start),
|
|
(unsigned long)kasan_mem_to_shadow(end),
|
|
early_pfn_to_nid(virt_to_pfn(start)));
|
|
}
|
|
|
|
/*
|
|
* KAsan may reuse the contents of kasan_early_shadow_pte directly,
|
|
* so we should make sure that it maps the zero page read-only.
|
|
*/
|
|
for (i = 0; i < PTRS_PER_PTE; i++)
|
|
__set_pte(&kasan_early_shadow_pte[i],
|
|
pfn_pte(sym_to_pfn(kasan_early_shadow_page),
|
|
PAGE_KERNEL_RO));
|
|
|
|
memset(kasan_early_shadow_page, KASAN_SHADOW_INIT, PAGE_SIZE);
|
|
cpu_replace_ttbr1(lm_alias(swapper_pg_dir));
|
|
}
|
|
|
|
static void __init kasan_init_depth(void)
|
|
{
|
|
init_task.kasan_depth = 0;
|
|
}
|
|
|
|
#ifdef CONFIG_KASAN_VMALLOC
|
|
void __init kasan_populate_early_vm_area_shadow(void *start, unsigned long size)
|
|
{
|
|
unsigned long shadow_start, shadow_end;
|
|
|
|
if (!is_vmalloc_or_module_addr(start))
|
|
return;
|
|
|
|
shadow_start = (unsigned long)kasan_mem_to_shadow(start);
|
|
shadow_start = ALIGN_DOWN(shadow_start, PAGE_SIZE);
|
|
shadow_end = (unsigned long)kasan_mem_to_shadow(start + size);
|
|
shadow_end = ALIGN(shadow_end, PAGE_SIZE);
|
|
kasan_map_populate(shadow_start, shadow_end, NUMA_NO_NODE);
|
|
}
|
|
#endif
|
|
|
|
void __init kasan_init(void)
|
|
{
|
|
kasan_init_shadow();
|
|
kasan_init_depth();
|
|
#if defined(CONFIG_KASAN_GENERIC)
|
|
/*
|
|
* Generic KASAN is now fully initialized.
|
|
* Software and Hardware Tag-Based modes still require
|
|
* kasan_init_sw_tags() and kasan_init_hw_tags() correspondingly.
|
|
*/
|
|
pr_info("KernelAddressSanitizer initialized (generic)\n");
|
|
#endif
|
|
}
|
|
|
|
#endif /* CONFIG_KASAN_GENERIC || CONFIG_KASAN_SW_TAGS */
|