Home | History | Annotate | Line # | Download | only in include
asan.h revision 1.1
      1  1.1  skrll /*	$NetBSD: asan.h,v 1.1 2020/07/10 12:25:09 skrll Exp $	*/
      2  1.1  skrll 
      3  1.1  skrll /*
      4  1.1  skrll  * Copyright (c) 2020 The NetBSD Foundation, Inc.
      5  1.1  skrll  * All rights reserved.
      6  1.1  skrll  *
      7  1.1  skrll  * This code is derived from software contributed to The NetBSD Foundation
      8  1.1  skrll  * by Nick Hudson.
      9  1.1  skrll  *
     10  1.1  skrll  * Redistribution and use in source and binary forms, with or without
     11  1.1  skrll  * modification, are permitted provided that the following conditions
     12  1.1  skrll  * are met:
     13  1.1  skrll  * 1. Redistributions of source code must retain the above copyright
     14  1.1  skrll  *    notice, this list of conditions and the following disclaimer.
     15  1.1  skrll  * 2. Redistributions in binary form must reproduce the above copyright
     16  1.1  skrll  *    notice, this list of conditions and the following disclaimer in the
     17  1.1  skrll  *    documentation and/or other materials provided with the distribution.
     18  1.1  skrll  *
     19  1.1  skrll  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     20  1.1  skrll  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     21  1.1  skrll  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     22  1.1  skrll  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     23  1.1  skrll  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     24  1.1  skrll  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     25  1.1  skrll  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     26  1.1  skrll  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     27  1.1  skrll  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     28  1.1  skrll  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     29  1.1  skrll  * POSSIBILITY OF SUCH DAMAGE.
     30  1.1  skrll  */
     31  1.1  skrll 
     32  1.1  skrll #include <sys/atomic.h>
     33  1.1  skrll #include <sys/ksyms.h>
     34  1.1  skrll 
     35  1.1  skrll #include <arm/vmparam.h>
     36  1.1  skrll #include <arm/arm32/machdep.h>
     37  1.1  skrll #include <arm/arm32/pmap.h>
     38  1.1  skrll 
     39  1.1  skrll #define KASAN_MD_SHADOW_START	VM_KERNEL_KASAN_BASE
     40  1.1  skrll #define KASAN_MD_SHADOW_END	VM_KERNEL_KASAN_END
     41  1.1  skrll #define __MD_KERNMEM_BASE	KERNEL_BASE
     42  1.1  skrll 
     43  1.1  skrll static inline int8_t *
     44  1.1  skrll kasan_md_addr_to_shad(const void *addr)
     45  1.1  skrll {
     46  1.1  skrll 	vaddr_t va = (vaddr_t)addr;
     47  1.1  skrll 	return (int8_t *)(KASAN_MD_SHADOW_START +
     48  1.1  skrll 	    ((va - __MD_KERNMEM_BASE) >> KASAN_SHADOW_SCALE_SHIFT));
     49  1.1  skrll }
     50  1.1  skrll 
     51  1.1  skrll static inline bool
     52  1.1  skrll kasan_md_unsupported(vaddr_t addr)
     53  1.1  skrll {
     54  1.1  skrll 	return addr < VM_MIN_KERNEL_ADDRESS ||
     55  1.1  skrll 	    addr >= KASAN_MD_SHADOW_START;
     56  1.1  skrll }
     57  1.1  skrll 
     58  1.1  skrll /* -------------------------------------------------------------------------- */
     59  1.1  skrll 
     60  1.1  skrll /*
     61  1.1  skrll  * Early mapping, used to map just the stack at boot time. We rely on the fact
     62  1.1  skrll  * that VA = PA + KERNEL_BASE.
     63  1.1  skrll  */
     64  1.1  skrll 
     65  1.1  skrll #define KASAN_NEARLYPAGES	2
     66  1.1  skrll 
     67  1.1  skrll static bool __md_early __read_mostly;
     68  1.1  skrll static size_t __md_nearlypages __attribute__((__section__(".data")));
     69  1.1  skrll static uint8_t __md_earlypages[KASAN_NEARLYPAGES * PAGE_SIZE]
     70  1.1  skrll     __aligned(PAGE_SIZE)  __attribute__((__section__(".data")));
     71  1.1  skrll 
     72  1.1  skrll static vaddr_t
     73  1.1  skrll __md_palloc(void)
     74  1.1  skrll {
     75  1.1  skrll 	paddr_t pa;
     76  1.1  skrll 
     77  1.1  skrll 	if (__predict_false(__md_early)) {
     78  1.1  skrll 		KASSERTMSG(__md_nearlypages < KASAN_NEARLYPAGES,
     79  1.1  skrll 		    "__md_nearlypages %zu", __md_nearlypages);
     80  1.1  skrll 
     81  1.1  skrll 		vaddr_t va = (vaddr_t)(&__md_earlypages[0] + __md_nearlypages * PAGE_SIZE);
     82  1.1  skrll 		__md_nearlypages++;
     83  1.1  skrll 		__builtin_memset((void *)va, 0, PAGE_SIZE);
     84  1.1  skrll 
     85  1.1  skrll 		return KERN_VTOPHYS(va);
     86  1.1  skrll 	}
     87  1.1  skrll 
     88  1.1  skrll 	if (!uvm.page_init_done) {
     89  1.1  skrll 		if (uvm_page_physget(&pa) == false)
     90  1.1  skrll 			panic("KASAN can't get a page");
     91  1.1  skrll 
     92  1.1  skrll 		return pa;
     93  1.1  skrll 	}
     94  1.1  skrll 
     95  1.1  skrll 	struct vm_page *pg;
     96  1.1  skrll retry:
     97  1.1  skrll 	pg = uvm_pagealloc(NULL, 0, NULL, 0);
     98  1.1  skrll 	if (pg == NULL) {
     99  1.1  skrll 		uvm_wait(__func__);
    100  1.1  skrll 		goto retry;
    101  1.1  skrll 	}
    102  1.1  skrll 	pa = VM_PAGE_TO_PHYS(pg);
    103  1.1  skrll 
    104  1.1  skrll 	return pa;
    105  1.1  skrll }
    106  1.1  skrll 
    107  1.1  skrll static void
    108  1.1  skrll kasan_md_shadow_map_page(vaddr_t va)
    109  1.1  skrll {
    110  1.1  skrll 	const uint32_t mask = L1_TABLE_SIZE - 1;
    111  1.1  skrll 	const paddr_t ttb = (paddr_t)(armreg_ttbr1_read() & ~mask);
    112  1.1  skrll 	pd_entry_t * const pdep = (pd_entry_t *)KERN_PHYSTOV(ttb);
    113  1.1  skrll 
    114  1.1  skrll 	const size_t l1slot = l1pte_index(va);
    115  1.1  skrll 	vaddr_t l2ptva;
    116  1.1  skrll 
    117  1.1  skrll 	KASSERT((va & PAGE_MASK) == 0);
    118  1.1  skrll 	KASSERT(__md_early || l1pte_page_p(pdep[l1slot]));
    119  1.1  skrll 
    120  1.1  skrll 	if (!l1pte_page_p(pdep[l1slot])) {
    121  1.1  skrll 		KASSERT(__md_early);
    122  1.1  skrll 		const paddr_t l2ptpa = __md_palloc();
    123  1.1  skrll 		const vaddr_t segl2va = va & -L2_S_SEGSIZE;
    124  1.1  skrll 		const size_t segl1slot = l1pte_index(segl2va);
    125  1.1  skrll 
    126  1.1  skrll 		const pd_entry_t npde =
    127  1.1  skrll 		    L1_C_PROTO | l2ptpa | L1_C_DOM(PMAP_DOMAIN_KERNEL);
    128  1.1  skrll 
    129  1.1  skrll 		l1pte_set(pdep + segl1slot, npde);
    130  1.1  skrll 		PDE_SYNC_RANGE(pdep, PAGE_SIZE / L2_T_SIZE);
    131  1.1  skrll 
    132  1.1  skrll 		l2ptva = KERN_PHYSTOV(l1pte_pa(pdep[l1slot]));
    133  1.1  skrll 	} else {
    134  1.1  skrll 		/*
    135  1.1  skrll 		 * The shadow map area L2PTs were allocated and mapped
    136  1.1  skrll 		 * by arm32_kernel_vm_init.  Use the array of pv_addr_t
    137  1.1  skrll 		 * to get the l2ptva.
    138  1.1  skrll 		 */
    139  1.1  skrll 		extern pv_addr_t kasan_l2pt[];
    140  1.1  skrll 		const size_t off = va - KASAN_MD_SHADOW_START;
    141  1.1  skrll 		const size_t segoff = off & (L2_S_SEGSIZE - 1);
    142  1.1  skrll 		const size_t idx = off / L2_S_SEGSIZE;
    143  1.1  skrll 		const vaddr_t segl2ptva = kasan_l2pt[idx].pv_va;
    144  1.1  skrll 		l2ptva = segl2ptva + l1pte_index(segoff) * L2_TABLE_SIZE_REAL;
    145  1.1  skrll 	}
    146  1.1  skrll 
    147  1.1  skrll 	pt_entry_t * l2pt = (pt_entry_t *)l2ptva;
    148  1.1  skrll 	pt_entry_t * const ptep = &l2pt[l2pte_index(va)];
    149  1.1  skrll 
    150  1.1  skrll 	if (!l2pte_valid_p(*ptep)) {
    151  1.1  skrll 		const int prot = VM_PROT_READ | VM_PROT_WRITE;
    152  1.1  skrll 		const paddr_t pa = __md_palloc();
    153  1.1  skrll 		pt_entry_t npte =
    154  1.1  skrll 		    L2_S_PROTO |
    155  1.1  skrll 		    pa |
    156  1.1  skrll 		    pte_l2_s_cache_mode_pt |
    157  1.1  skrll 		    L2_S_PROT(PTE_KERNEL, prot);
    158  1.1  skrll 
    159  1.1  skrll 		l2pte_set(ptep, npte, 0);
    160  1.1  skrll 		PTE_SYNC(ptep);
    161  1.1  skrll 		__builtin_memset((void *)va, 0, PAGE_SIZE);
    162  1.1  skrll 	}
    163  1.1  skrll }
    164  1.1  skrll 
    165  1.1  skrll /*
    166  1.1  skrll  * Map the init stacks of the BP and APs. We will map the rest in kasan_init.
    167  1.1  skrll  */
    168  1.1  skrll #define INIT_ARM_STACK_SHIFT	9
    169  1.1  skrll #define INIT_ARM_STACK_SIZE	(1 << INIT_ARM_STACK_SHIFT)
    170  1.1  skrll 
    171  1.1  skrll static void
    172  1.1  skrll kasan_md_early_init(void *stack)
    173  1.1  skrll {
    174  1.1  skrll 
    175  1.1  skrll 	__md_early = true;
    176  1.1  skrll 	__md_nearlypages = 0;
    177  1.1  skrll 	kasan_shadow_map(stack, INIT_ARM_STACK_SIZE * MAXCPUS);
    178  1.1  skrll 	__md_early = false;
    179  1.1  skrll }
    180  1.1  skrll 
    181  1.1  skrll static void
    182  1.1  skrll kasan_md_init(void)
    183  1.1  skrll {
    184  1.1  skrll 	extern vaddr_t kasan_kernelstart;
    185  1.1  skrll 	extern vaddr_t kasan_kernelsize;
    186  1.1  skrll 
    187  1.1  skrll 	kasan_shadow_map((void *)kasan_kernelstart, kasan_kernelsize);
    188  1.1  skrll 
    189  1.1  skrll 	/* The VAs we've created until now. */
    190  1.1  skrll 	vaddr_t eva;
    191  1.1  skrll 
    192  1.1  skrll 	eva = pmap_growkernel(KERNEL_VM_BASE);
    193  1.1  skrll 	kasan_shadow_map((void *)KERNEL_VM_BASE, eva - KERNEL_VM_BASE);
    194  1.1  skrll }
    195  1.1  skrll 
    196  1.1  skrll 
    197  1.1  skrll static inline bool
    198  1.1  skrll __md_unwind_end(const char *name)
    199  1.1  skrll {
    200  1.1  skrll 	static const char * const vectors[] = {
    201  1.1  skrll 		"undefined_entry",
    202  1.1  skrll 		"swi_entry",
    203  1.1  skrll 		"prefetch_abort_entry",
    204  1.1  skrll 		"data_abort_entry",
    205  1.1  skrll 		"address_exception_entry",
    206  1.1  skrll 		"irq_entry",
    207  1.1  skrll 		"fiqvector"
    208  1.1  skrll 	};
    209  1.1  skrll 
    210  1.1  skrll 	for (size_t i = 0; i < __arraycount(vectors); i++) {
    211  1.1  skrll 		if (!strncmp(name, vectors[i], strlen(vectors[i])))
    212  1.1  skrll 			return true;
    213  1.1  skrll 	}
    214  1.1  skrll 
    215  1.1  skrll 	return false;
    216  1.1  skrll }
    217  1.1  skrll 
    218  1.1  skrll static void
    219  1.1  skrll kasan_md_unwind(void)
    220  1.1  skrll {
    221  1.1  skrll 	uint32_t lr, *fp;
    222  1.1  skrll 	const char *mod;
    223  1.1  skrll 	const char *sym;
    224  1.1  skrll 	size_t nsym;
    225  1.1  skrll 	int error;
    226  1.1  skrll 
    227  1.1  skrll 	fp = (uint32_t *)__builtin_frame_address(0);
    228  1.1  skrll 	nsym = 0;
    229  1.1  skrll 
    230  1.1  skrll 	while (1) {
    231  1.1  skrll 		/*
    232  1.1  skrll 		 * normal frame
    233  1.1  skrll 		 *  fp[ 0] saved code pointer
    234  1.1  skrll 		 *  fp[-1] saved lr value
    235  1.1  skrll 		 *  fp[-2] saved sp value
    236  1.1  skrll 		 *  fp[-3] saved fp value
    237  1.1  skrll 		 */
    238  1.1  skrll 		lr = fp[-1];
    239  1.1  skrll 
    240  1.1  skrll 		if (lr < VM_MIN_KERNEL_ADDRESS) {
    241  1.1  skrll 			break;
    242  1.1  skrll 		}
    243  1.1  skrll 		error = ksyms_getname(&mod, &sym, (vaddr_t)lr, KSYMS_PROC);
    244  1.1  skrll 		if (error) {
    245  1.1  skrll 			break;
    246  1.1  skrll 		}
    247  1.1  skrll 		printf("#%zu %p in %s <%s>\n", nsym, (void *)lr, sym, mod);
    248  1.1  skrll 		if (__md_unwind_end(sym)) {
    249  1.1  skrll 			break;
    250  1.1  skrll 		}
    251  1.1  skrll 
    252  1.1  skrll 		fp = (uint32_t *)fp[-3];
    253  1.1  skrll 		if (fp == NULL) {
    254  1.1  skrll 			break;
    255  1.1  skrll 		}
    256  1.1  skrll 		nsym++;
    257  1.1  skrll 
    258  1.1  skrll 		if (nsym >= 15) {
    259  1.1  skrll 			break;
    260  1.1  skrll 		}
    261  1.1  skrll 	}
    262  1.1  skrll }
    263