Home | History | Annotate | Line # | Download | only in arm32
vm_machdep.c revision 1.42
      1 /*	$NetBSD: vm_machdep.c,v 1.42 2008/01/19 15:04:10 chris 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.42 2008/01/19 15:04:10 chris Exp $");
     48 
     49 #include "opt_armfpe.h"
     50 #include "opt_pmap_debug.h"
     51 #include "opt_perfctrs.h"
     52 
     53 #include <sys/param.h>
     54 #include <sys/systm.h>
     55 #include <sys/proc.h>
     56 #include <sys/malloc.h>
     57 #include <sys/vnode.h>
     58 #include <sys/buf.h>
     59 #include <sys/pmc.h>
     60 #include <sys/user.h>
     61 #include <sys/exec.h>
     62 #include <sys/syslog.h>
     63 
     64 #include <uvm/uvm_extern.h>
     65 
     66 #include <machine/cpu.h>
     67 #include <machine/pmap.h>
     68 #include <machine/reg.h>
     69 #include <machine/vmparam.h>
     70 
     71 #ifdef ARMFPE
     72 #include <arm/fpe-arm/armfpe.h>
     73 #endif
     74 
     75 extern pv_addr_t systempage;
     76 
     77 int process_read_regs	__P((struct proc *p, struct reg *regs));
     78 int process_read_fpregs	__P((struct proc *p, struct fpreg *regs));
     79 
     80 void lwp_trampoline(void);
     81 
     82 /*
     83  * Special compilation symbols:
     84  *
     85  * STACKCHECKS - Fill undefined and supervisor stacks with a known pattern
     86  *		 on forking and check the pattern on exit, reporting
     87  *		 the amount of stack used.
     88  */
     89 
     90 void
     91 cpu_proc_fork(p1, p2)
     92 	struct proc *p1, *p2;
     93 {
     94 
     95 #if defined(PERFCTRS)
     96 	if (PMC_ENABLED(p1))
     97 		pmc_md_fork(p1, p2);
     98 	else {
     99 		p2->p_md.pmc_enabled = 0;
    100 		p2->p_md.pmc_state = NULL;
    101 	}
    102 #endif
    103 }
    104 
    105 /*
    106  * Finish a fork operation, with process p2 nearly set up.
    107  * Copy and update the pcb and trap frame, making the child ready to run.
    108  *
    109  * Rig the child's kernel stack so that it will start out in
    110  * proc_trampoline() and call child_return() with p2 as an
    111  * argument. This causes the newly-created child process to go
    112  * directly to user level with an apparent return value of 0 from
    113  * fork(), while the parent process returns normally.
    114  *
    115  * p1 is the process being forked; if p1 == &proc0, we are creating
    116  * a kernel thread, and the return path and argument are specified with
    117  * `func' and `arg'.
    118  *
    119  * If an alternate user-level stack is requested (with non-zero values
    120  * in both the stack and stacksize args), set up the user stack pointer
    121  * accordingly.
    122  */
    123 void
    124 cpu_lwp_fork(struct lwp *l1, struct lwp *l2, void *stack, size_t stacksize,
    125     void (*func)(void *), void *arg)
    126 {
    127 	struct pcb *pcb = (struct pcb *)&l2->l_addr->u_pcb;
    128 	struct trapframe *tf;
    129 	struct switchframe *sf;
    130 
    131 #ifdef PMAP_DEBUG
    132 	if (pmap_debug_level >= 0)
    133 		printf("cpu_lwp_fork: %p %p %p %p\n", l1, l2, curlwp, &lwp0);
    134 #endif	/* PMAP_DEBUG */
    135 
    136 #if 0 /* XXX */
    137 	if (l1 == curlwp) {
    138 		/* Sync the PCB before we copy it. */
    139 		savectx(curpcb);
    140 	}
    141 #endif
    142 
    143 	/* Copy the pcb */
    144 	*pcb = l1->l_addr->u_pcb;
    145 
    146 	/*
    147 	 * Set up the stack for the process.
    148 	 * Note: this stack is not in use if we are forking from p1
    149 	 */
    150 	pcb->pcb_un.un_32.pcb32_sp = (u_int)l2->l_addr + USPACE_SVC_STACK_TOP;
    151 
    152 #ifdef STACKCHECKS
    153 	/* Fill the kernel stack with a known pattern */
    154 	memset(((u_char *)l2->l_addr) + USPACE_SVC_STACK_BOTTOM, 0xdd,
    155 	    (USPACE_SVC_STACK_TOP - USPACE_SVC_STACK_BOTTOM));
    156 #endif	/* STACKCHECKS */
    157 
    158 #ifdef PMAP_DEBUG
    159 	if (pmap_debug_level >= 0) {
    160 		printf("l1->procaddr=%p l1->procaddr->u_pcb=%p pid=%d pmap=%p\n",
    161 		    l1->l_addr, &l1->l_addr->u_pcb, l1->l_lid,
    162 		    l1->l_proc->p_vmspace->vm_map.pmap);
    163 		printf("l2->procaddr=%p l2->procaddr->u_pcb=%p pid=%d pmap=%p\n",
    164 		    l2->l_addr, &l2->l_addr->u_pcb, l2->l_lid,
    165 		    l2->l_proc->p_vmspace->vm_map.pmap);
    166 	}
    167 #endif	/* PMAP_DEBUG */
    168 
    169 #ifdef ARMFPE
    170 	/* Initialise a new FP context for p2 and copy the context from p1 */
    171 	arm_fpe_core_initcontext(FP_CONTEXT(l2));
    172 	arm_fpe_copycontext(FP_CONTEXT(l1), FP_CONTEXT(l2));
    173 #endif	/* ARMFPE */
    174 
    175 	l2->l_addr->u_pcb.pcb_tf = tf =
    176 	    (struct trapframe *)pcb->pcb_un.un_32.pcb32_sp - 1;
    177 	*tf = *l1->l_addr->u_pcb.pcb_tf;
    178 
    179 	/*
    180 	 * If specified, give the child a different stack.
    181 	 */
    182 	if (stack != NULL)
    183 		tf->tf_usr_sp = (u_int)stack + stacksize;
    184 
    185 	sf = (struct switchframe *)tf - 1;
    186 	sf->sf_r4 = (u_int)func;
    187 	sf->sf_r5 = (u_int)arg;
    188 	sf->sf_sp = (u_int)tf;
    189 	sf->sf_pc = (u_int)lwp_trampoline;
    190 	pcb->pcb_un.un_32.pcb32_sp = (u_int)sf;
    191 }
    192 
    193 /*
    194  * cpu_exit is called as the last action during exit.
    195  *
    196  * We clean up a little and then call switch_exit() with the old proc as an
    197  * argument.  switch_exit() first switches to proc0's context, and finally
    198  * jumps into switch() to wait for another process to wake up.
    199  */
    200 
    201 void
    202 cpu_lwp_free(struct lwp *l, int proc)
    203 {
    204 #ifdef ARMFPE
    205 	/* Abort any active FP operation and deactivate the context */
    206 	arm_fpe_core_abort(FP_CONTEXT(l), NULL, NULL);
    207 	arm_fpe_core_changecontext(0);
    208 #endif	/* ARMFPE */
    209 
    210 #ifdef STACKCHECKS
    211 	/* Report how much stack has been used - debugging */
    212 	if (l) {
    213 		u_char *ptr;
    214 		int loop;
    215 
    216 		ptr = ((u_char *)p2->p_addr) + USPACE_SVC_STACK_BOTTOM;
    217 		for (loop = 0; loop < (USPACE_SVC_STACK_TOP - USPACE_SVC_STACK_BOTTOM)
    218 		    && *ptr == 0xdd; ++loop, ++ptr) ;
    219 		log(LOG_INFO, "%d bytes of svc stack fill pattern\n", loop);
    220 	}
    221 #endif	/* STACKCHECKS */
    222 }
    223 
    224 void
    225 cpu_lwp_free2(struct lwp *l)
    226 {
    227 }
    228 
    229 void
    230 cpu_swapin(l)
    231 	struct lwp *l;
    232 {
    233 #if 0
    234 	struct proc *p = l->l_proc;
    235 
    236 	/* Don't do this.  See the comment in cpu_swapout().  */
    237 #ifdef PMAP_DEBUG
    238 	if (pmap_debug_level >= 0)
    239 		printf("cpu_swapin(%p, %d, %s, %p)\n", l, l->l_lid,
    240 		    p->p_comm, p->p_vmspace->vm_map.pmap);
    241 #endif	/* PMAP_DEBUG */
    242 
    243 	if (vector_page < KERNEL_BASE) {
    244 		/* Map the vector page */
    245 		pmap_enter(p->p_vmspace->vm_map.pmap, vector_page,
    246 		    systempage.pv_pa, VM_PROT_READ, VM_PROT_READ|PMAP_WIRED);
    247 		pmap_update(p->p_vmspace->vm_map.pmap);
    248 	}
    249 #endif
    250 }
    251 
    252 
    253 void
    254 cpu_swapout(l)
    255 	struct lwp *l;
    256 {
    257 #if 0
    258 	struct proc *p = l->l_proc;
    259 
    260 	/*
    261 	 * Don't do this!  If the pmap is shared with another process,
    262 	 * it will loose it's page0 entry.  That's bad news indeed.
    263 	 */
    264 #ifdef PMAP_DEBUG
    265 	if (pmap_debug_level >= 0)
    266 		printf("cpu_swapout(%p, %d, %s, %p)\n", l, l->l_lid,
    267 		    p->p_comm, &p->p_vmspace->vm_map.pmap);
    268 #endif	/* PMAP_DEBUG */
    269 
    270 	if (vector_page < KERNEL_BASE) {
    271 		/* Free the system page mapping */
    272 		pmap_remove(p->p_vmspace->vm_map.pmap, vector_page,
    273 		    vector_page + PAGE_SIZE);
    274 		pmap_update(p->p_vmspace->vm_map.pmap);
    275 	}
    276 #endif
    277 }
    278 
    279 /*
    280  * Map a user I/O request into kernel virtual address space.
    281  * Note: the pages are already locked by uvm_vslock(), so we
    282  * do not need to pass an access_type to pmap_enter().
    283  */
    284 void
    285 vmapbuf(bp, len)
    286 	struct buf *bp;
    287 	vsize_t len;
    288 {
    289 	vaddr_t faddr, taddr, off;
    290 	paddr_t fpa;
    291 
    292 
    293 #ifdef PMAP_DEBUG
    294 	if (pmap_debug_level >= 0)
    295 		printf("vmapbuf: bp=%08x buf=%08x len=%08x\n", (u_int)bp,
    296 		    (u_int)bp->b_data, (u_int)len);
    297 #endif	/* PMAP_DEBUG */
    298 
    299 	if ((bp->b_flags & B_PHYS) == 0)
    300 		panic("vmapbuf");
    301 
    302 	bp->b_saveaddr = bp->b_data;
    303 	faddr = trunc_page((vaddr_t)bp->b_data);
    304 	off = (vaddr_t)bp->b_data - faddr;
    305 	len = round_page(off + len);
    306 	taddr = uvm_km_alloc(phys_map, len, 0, UVM_KMF_VAONLY | UVM_KMF_WAITVA);
    307 	bp->b_data = (void *)(taddr + off);
    308 
    309 	/*
    310 	 * The region is locked, so we expect that pmap_pte() will return
    311 	 * non-NULL.
    312 	 */
    313 	while (len) {
    314 		(void) pmap_extract(vm_map_pmap(&bp->b_proc->p_vmspace->vm_map),
    315 		    faddr, &fpa);
    316 		pmap_enter(pmap_kernel(), taddr, fpa,
    317 			VM_PROT_READ|VM_PROT_WRITE, VM_PROT_READ|VM_PROT_WRITE|PMAP_WIRED);
    318 		faddr += PAGE_SIZE;
    319 		taddr += PAGE_SIZE;
    320 		len -= PAGE_SIZE;
    321 	}
    322 	pmap_update(pmap_kernel());
    323 }
    324 
    325 /*
    326  * Unmap a previously-mapped user I/O request.
    327  */
    328 void
    329 vunmapbuf(bp, len)
    330 	struct buf *bp;
    331 	vsize_t len;
    332 {
    333 	vaddr_t addr, off;
    334 
    335 #ifdef PMAP_DEBUG
    336 	if (pmap_debug_level >= 0)
    337 		printf("vunmapbuf: bp=%08x buf=%08x len=%08x\n",
    338 		    (u_int)bp, (u_int)bp->b_data, (u_int)len);
    339 #endif	/* PMAP_DEBUG */
    340 
    341 	if ((bp->b_flags & B_PHYS) == 0)
    342 		panic("vunmapbuf");
    343 
    344 	/*
    345 	 * Make sure the cache does not have dirty data for the
    346 	 * pages we had mapped.
    347 	 */
    348 	addr = trunc_page((vaddr_t)bp->b_data);
    349 	off = (vaddr_t)bp->b_data - addr;
    350 	len = round_page(off + len);
    351 
    352 	pmap_remove(pmap_kernel(), addr, addr + len);
    353 	pmap_update(pmap_kernel());
    354 	uvm_km_free(phys_map, addr, len, UVM_KMF_VAONLY);
    355 	bp->b_data = bp->b_saveaddr;
    356 	bp->b_saveaddr = 0;
    357 }
    358 
    359 /* End of vm_machdep.c */
    360