Home | History | Annotate | Line # | Download | only in arm32
vm_machdep.c revision 1.73
      1 /*	$NetBSD: vm_machdep.c,v 1.73 2018/05/28 21:05:00 chs Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1994-1998 Mark Brinicombe.
      5  * Copyright (c) 1994 Brini.
      6  * All rights reserved.
      7  *
      8  * This code is derived from software written for Brini by Mark Brinicombe
      9  *
     10  * Redistribution and use in source and binary forms, with or without
     11  * modification, are permitted provided that the following conditions
     12  * are met:
     13  * 1. Redistributions of source code must retain the above copyright
     14  *    notice, this list of conditions and the following disclaimer.
     15  * 2. Redistributions in binary form must reproduce the above copyright
     16  *    notice, this list of conditions and the following disclaimer in the
     17  *    documentation and/or other materials provided with the distribution.
     18  * 3. All advertising materials mentioning features or use of this software
     19  *    must display the following acknowledgement:
     20  *	This product includes software developed by Brini.
     21  * 4. The name of the company nor the name of the author may be used to
     22  *    endorse or promote products derived from this software without specific
     23  *    prior written permission.
     24  *
     25  * THIS SOFTWARE IS PROVIDED BY BRINI ``AS IS'' AND ANY EXPRESS OR IMPLIED
     26  * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
     27  * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     28  * IN NO EVENT SHALL BRINI OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
     29  * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
     30  * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
     31  * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     32  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     33  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     34  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     35  * SUCH DAMAGE.
     36  *
     37  * RiscBSD kernel project
     38  *
     39  * vm_machdep.h
     40  *
     41  * vm machine specific bits
     42  *
     43  * Created      : 08/10/94
     44  */
     45 
     46 #include <sys/cdefs.h>
     47 __KERNEL_RCSID(0, "$NetBSD: vm_machdep.c,v 1.73 2018/05/28 21:05:00 chs Exp $");
     48 
     49 #include "opt_armfpe.h"
     50 #include "opt_pmap_debug.h"
     51 #include "opt_perfctrs.h"
     52 #include "opt_cputypes.h"
     53 
     54 #include <sys/param.h>
     55 #include <sys/systm.h>
     56 #include <sys/proc.h>
     57 #include <sys/malloc.h>
     58 #include <sys/vnode.h>
     59 #include <sys/cpu.h>
     60 #include <sys/buf.h>
     61 #include <sys/pmc.h>
     62 #include <sys/exec.h>
     63 #include <sys/syslog.h>
     64 
     65 #include <uvm/uvm_extern.h>
     66 
     67 #include <arm/vfpreg.h>
     68 
     69 #include <machine/pcb.h>
     70 #include <machine/pmap.h>
     71 #include <machine/reg.h>
     72 #include <machine/vmparam.h>
     73 
     74 void lwp_trampoline(void);
     75 
     76 /*
     77  * Special compilation symbols:
     78  *
     79  * STACKCHECKS - Fill undefined and supervisor stacks with a known pattern
     80  *		 on forking and check the pattern on exit, reporting
     81  *		 the amount of stack used.
     82  */
     83 
     84 void
     85 cpu_proc_fork(struct proc *p1, struct proc *p2)
     86 {
     87 
     88 #if defined(PERFCTRS)
     89 	if (PMC_ENABLED(p1))
     90 		pmc_md_fork(p1, p2);
     91 	else {
     92 		p2->p_md.pmc_enabled = 0;
     93 		p2->p_md.pmc_state = NULL;
     94 	}
     95 #endif
     96 	/*
     97 	 * Copy machine arch string (it's small so just memcpy it).
     98 	 */
     99 	memcpy(p2->p_md.md_march, p1->p_md.md_march, sizeof(p2->p_md.md_march));
    100 }
    101 
    102 /*
    103  * Finish a fork operation, with LWP l2 nearly set up.
    104  *
    105  * Copy and update the pcb and trapframe, making the child ready to run.
    106  *
    107  * Rig the child's kernel stack so that it will start out in
    108  * lwp_trampoline() which will call the specified func with the argument arg.
    109  *
    110  * If an alternate user-level stack is requested (with non-zero values
    111  * in both the stack and stacksize args), set up the user stack pointer
    112  * accordingly.
    113  */
    114 void
    115 cpu_lwp_fork(struct lwp *l1, struct lwp *l2, void *stack, size_t stacksize,
    116     void (*func)(void *), void *arg)
    117 {
    118 	struct switchframe *sf;
    119 	vaddr_t uv;
    120 
    121 	const struct pcb * const pcb1 = lwp_getpcb(l1);
    122 	struct pcb * const pcb2 = lwp_getpcb(l2);
    123 
    124 #ifdef PMAP_DEBUG
    125 	if (pmap_debug_level > 0)
    126 		printf("cpu_lwp_fork: %p %p %p %p\n", l1, l2, curlwp, &lwp0);
    127 #endif	/* PMAP_DEBUG */
    128 
    129 	/* Copy the pcb */
    130 	*pcb2 = *pcb1;
    131 
    132 #ifdef FPU_VFP
    133 	/*
    134 	 * Disable the VFP for a newly created LWP but remember if the
    135 	 * VFP state is valid.
    136 	 */
    137 	pcb2->pcb_vfp.vfp_fpexc &= ~VFP_FPEXC_EN;
    138 #endif
    139 
    140 	/*
    141 	 * Set up the kernel stack for the process.
    142 	 * Note: this stack is not in use if we are forking from p1
    143 	 */
    144 	uv = uvm_lwp_getuarea(l2);
    145 	pcb2->pcb_ksp = uv + USPACE_SVC_STACK_TOP;
    146 
    147 #ifdef STACKCHECKS
    148 	/* Fill the kernel stack with a known pattern */
    149 	memset((void *)(uv + USPACE_SVC_STACK_BOTTOM), 0xdd,
    150 	    (USPACE_SVC_STACK_TOP - USPACE_SVC_STACK_BOTTOM));
    151 #endif	/* STACKCHECKS */
    152 
    153 #ifdef PMAP_DEBUG
    154 	if (pmap_debug_level > 0) {
    155 		printf("l1: pcb=%p pid=%d pmap=%p\n",
    156 		    pcb1, l1->l_lid, l1->l_proc->p_vmspace->vm_map.pmap);
    157 		printf("l2: pcb=%p pid=%d pmap=%p\n",
    158 		    pcb2, l2->l_lid, l2->l_proc->p_vmspace->vm_map.pmap);
    159 	}
    160 #endif	/* PMAP_DEBUG */
    161 
    162 	struct trapframe *tf = (struct trapframe *)pcb2->pcb_ksp - 1;
    163 	lwp_settrapframe(l2, tf);
    164 	*tf = *lwp_trapframe(l1);
    165 
    166 	/*
    167 	 * If specified, give the child a different stack (make sure
    168 	 * it's 8-byte aligned).
    169 	 */
    170 	if (stack != NULL)
    171 		tf->tf_usr_sp = ((vaddr_t)(stack) + stacksize) & -8;
    172 
    173 	sf = (struct switchframe *)tf - 1;
    174 	sf->sf_r4 = (u_int)func;
    175 	sf->sf_r5 = (u_int)arg;
    176 	sf->sf_r7 = PSR_USR32_MODE;		/* for returning to userspace */
    177 	sf->sf_sp = (u_int)tf;
    178 	sf->sf_pc = (u_int)lwp_trampoline;
    179 	pcb2->pcb_ksp = (u_int)sf;
    180 }
    181 
    182 /*
    183  * cpu_exit is called as the last action during exit.
    184  *
    185  * We clean up a little and then call switch_exit() with the old proc as an
    186  * argument.  switch_exit() first switches to lwp0's context, and finally
    187  * jumps into switch() to wait for another process to wake up.
    188  */
    189 
    190 void
    191 cpu_lwp_free(struct lwp *l, int proc)
    192 {
    193 #ifdef STACKCHECKS
    194 	/* Report how much stack has been used - debugging */
    195 	struct pcb * const pcb = lwp_getpcb(l);
    196 	u_char *ptr;
    197 	u_int loop;
    198 
    199 	ptr = (u_char *)pcb + USPACE_SVC_STACK_BOTTOM;
    200 	for (loop = 0; loop < (USPACE_SVC_STACK_TOP - USPACE_SVC_STACK_BOTTOM)
    201 	    && *ptr == 0xdd; ++loop, ++ptr) ;
    202 	log(LOG_INFO, "%u bytes of svc stack fill pattern\n", loop);
    203 #endif	/* STACKCHECKS */
    204 }
    205 
    206 void
    207 cpu_lwp_free2(struct lwp *l)
    208 {
    209 }
    210 
    211 /*
    212  * Map a user I/O request into kernel virtual address space.
    213  * Note: the pages are already locked by uvm_vslock(), so we
    214  * do not need to pass an access_type to pmap_enter().
    215  */
    216 int
    217 vmapbuf(struct buf *bp, vsize_t len)
    218 {
    219 	struct pmap * const pm = vm_map_pmap(&bp->b_proc->p_vmspace->vm_map);
    220 	vaddr_t faddr, taddr, off;
    221 	paddr_t fpa;
    222 
    223 	KASSERT(pm != pmap_kernel());
    224 
    225 #ifdef PMAP_DEBUG
    226 	if (pmap_debug_level > 0)
    227 		printf("vmapbuf: bp=%08x buf=%08x len=%08x\n", (u_int)bp,
    228 		    (u_int)bp->b_data, (u_int)len);
    229 #endif	/* PMAP_DEBUG */
    230 
    231 	if ((bp->b_flags & B_PHYS) == 0)
    232 		panic("vmapbuf");
    233 
    234 	bp->b_saveaddr = bp->b_data;
    235 	faddr = trunc_page((vaddr_t)bp->b_data);
    236 	off = (vaddr_t)bp->b_data - faddr;
    237 	len = round_page(off + len);
    238 	taddr = uvm_km_alloc(phys_map, len, atop(faddr) & uvmexp.colormask,
    239 	    UVM_KMF_VAONLY | UVM_KMF_WAITVA | UVM_KMF_COLORMATCH);
    240 	bp->b_data = (void *)(taddr + off);
    241 
    242 	/*
    243 	 * The region is locked, so we expect that pmap_pte() will return
    244 	 * non-NULL.
    245 	 */
    246 	while (len) {
    247 		(void) pmap_extract(pm, faddr, &fpa);
    248 		pmap_enter(pmap_kernel(), taddr, fpa, VM_PROT_READ|VM_PROT_WRITE,
    249 		    VM_PROT_READ|VM_PROT_WRITE|PMAP_WIRED);
    250 		faddr += PAGE_SIZE;
    251 		taddr += PAGE_SIZE;
    252 		len -= PAGE_SIZE;
    253 	}
    254 	pmap_update(pmap_kernel());
    255 
    256 	return 0;
    257 }
    258 
    259 /*
    260  * Unmap a previously-mapped user I/O request.
    261  */
    262 void
    263 vunmapbuf(struct buf *bp, vsize_t len)
    264 {
    265 	vaddr_t addr, off;
    266 
    267 #ifdef PMAP_DEBUG
    268 	if (pmap_debug_level > 0)
    269 		printf("vunmapbuf: bp=%08x buf=%08x len=%08x\n",
    270 		    (u_int)bp, (u_int)bp->b_data, (u_int)len);
    271 #endif	/* PMAP_DEBUG */
    272 
    273 	if ((bp->b_flags & B_PHYS) == 0)
    274 		panic("vunmapbuf");
    275 
    276 	/*
    277 	 * Make sure the cache does not have dirty data for the
    278 	 * pages we had mapped.
    279 	 */
    280 	addr = trunc_page((vaddr_t)bp->b_data);
    281 	off = (vaddr_t)bp->b_data - addr;
    282 	len = round_page(off + len);
    283 
    284 	pmap_remove(pmap_kernel(), addr, addr + len);
    285 	pmap_update(pmap_kernel());
    286 	uvm_km_free(phys_map, addr, len, UVM_KMF_VAONLY);
    287 	bp->b_data = bp->b_saveaddr;
    288 	bp->b_saveaddr = 0;
    289 }
    290 
    291 void
    292 ktext_write(void *to, const void *from, size_t size)
    293 {
    294 	struct pmap *pmap = pmap_kernel();
    295 	pd_entry_t *pde, oldpde, tmppde;
    296 	pt_entry_t *pte, oldpte, tmppte;
    297 	vaddr_t pgva;
    298 	size_t limit, savesize;
    299 	const char *src;
    300 	char *dst;
    301 
    302 	/* XXX: gcc */
    303 	oldpte = 0;
    304 
    305 	if ((savesize = size) == 0)
    306 		return;
    307 
    308 	dst = (char *) to;
    309 	src = (const char *) from;
    310 
    311 	do {
    312 		/* Get the PDE of the current VA. */
    313 		if (pmap_get_pde_pte(pmap, (vaddr_t) dst, &pde, &pte) == false)
    314 			goto no_mapping;
    315 		switch ((oldpde = *pde) & L1_TYPE_MASK) {
    316 		case L1_TYPE_S:
    317 			pgva = (vaddr_t)dst & L1_S_FRAME;
    318 			limit = L1_S_SIZE - ((vaddr_t)dst & L1_S_OFFSET);
    319 
    320 			tmppde = l1pte_set_writable(oldpde);
    321 			*pde = tmppde;
    322 			PTE_SYNC(pde);
    323 			break;
    324 
    325 		case L1_TYPE_C:
    326 			pgva = (vaddr_t)dst & L2_S_FRAME;
    327 			limit = L2_S_SIZE - ((vaddr_t)dst & L2_S_OFFSET);
    328 
    329 			if (pte == NULL)
    330 				goto no_mapping;
    331 			oldpte = *pte;
    332 			tmppte = l2pte_set_writable(oldpte);
    333 			*pte = tmppte;
    334 			PTE_SYNC(pte);
    335 			break;
    336 
    337 		default:
    338 		no_mapping:
    339 			printf(" address 0x%08lx not a valid page\n",
    340 			    (vaddr_t) dst);
    341 			return;
    342 		}
    343 		cpu_tlb_flushD_SE(pgva);
    344 		cpu_cpwait();
    345 
    346 		if (limit > size)
    347 			limit = size;
    348 		size -= limit;
    349 
    350 		/*
    351 		 * Page is now writable.  Do as much access as we
    352 		 * can in this page.
    353 		 */
    354 		for (; limit > 0; limit--)
    355 			*dst++ = *src++;
    356 
    357 		/*
    358 		 * Restore old mapping permissions.
    359 		 */
    360 		switch (oldpde & L1_TYPE_MASK) {
    361 		case L1_TYPE_S:
    362 			*pde = oldpde;
    363 			PTE_SYNC(pde);
    364 			break;
    365 
    366 		case L1_TYPE_C:
    367 			*pte = oldpte;
    368 			PTE_SYNC(pte);
    369 			break;
    370 		}
    371 		cpu_tlb_flushD_SE(pgva);
    372 		cpu_cpwait();
    373 	} while (size != 0);
    374 
    375 	/* Sync the I-cache. */
    376 	cpu_icache_sync_range((vaddr_t)to, savesize);
    377 }
    378 
    379 /* End of vm_machdep.c */
    380