vm_machdep.c revision 1.46 1 1.46 matt /* $NetBSD: vm_machdep.c,v 1.46 2008/10/21 19:01:00 matt Exp $ */
2 1.1 chris
3 1.1 chris /*
4 1.1 chris * Copyright (c) 1994-1998 Mark Brinicombe.
5 1.1 chris * Copyright (c) 1994 Brini.
6 1.1 chris * All rights reserved.
7 1.1 chris *
8 1.1 chris * This code is derived from software written for Brini by Mark Brinicombe
9 1.1 chris *
10 1.1 chris * Redistribution and use in source and binary forms, with or without
11 1.1 chris * modification, are permitted provided that the following conditions
12 1.1 chris * are met:
13 1.1 chris * 1. Redistributions of source code must retain the above copyright
14 1.1 chris * notice, this list of conditions and the following disclaimer.
15 1.1 chris * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 chris * notice, this list of conditions and the following disclaimer in the
17 1.1 chris * documentation and/or other materials provided with the distribution.
18 1.1 chris * 3. All advertising materials mentioning features or use of this software
19 1.1 chris * must display the following acknowledgement:
20 1.1 chris * This product includes software developed by Brini.
21 1.1 chris * 4. The name of the company nor the name of the author may be used to
22 1.1 chris * endorse or promote products derived from this software without specific
23 1.1 chris * prior written permission.
24 1.1 chris *
25 1.1 chris * THIS SOFTWARE IS PROVIDED BY BRINI ``AS IS'' AND ANY EXPRESS OR IMPLIED
26 1.1 chris * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
27 1.1 chris * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
28 1.1 chris * IN NO EVENT SHALL BRINI OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
29 1.1 chris * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
30 1.1 chris * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
31 1.1 chris * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 1.1 chris * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 1.1 chris * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 1.1 chris * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 1.1 chris * SUCH DAMAGE.
36 1.1 chris *
37 1.1 chris * RiscBSD kernel project
38 1.1 chris *
39 1.1 chris * vm_machdep.h
40 1.1 chris *
41 1.1 chris * vm machine specific bits
42 1.1 chris *
43 1.1 chris * Created : 08/10/94
44 1.1 chris */
45 1.29 lukem
46 1.29 lukem #include <sys/cdefs.h>
47 1.46 matt __KERNEL_RCSID(0, "$NetBSD: vm_machdep.c,v 1.46 2008/10/21 19:01:00 matt Exp $");
48 1.1 chris
49 1.1 chris #include "opt_armfpe.h"
50 1.1 chris #include "opt_pmap_debug.h"
51 1.18 briggs #include "opt_perfctrs.h"
52 1.43 rearnsha #include "opt_cputypes.h"
53 1.1 chris
54 1.1 chris #include <sys/param.h>
55 1.1 chris #include <sys/systm.h>
56 1.1 chris #include <sys/proc.h>
57 1.1 chris #include <sys/malloc.h>
58 1.1 chris #include <sys/vnode.h>
59 1.1 chris #include <sys/buf.h>
60 1.18 briggs #include <sys/pmc.h>
61 1.1 chris #include <sys/user.h>
62 1.1 chris #include <sys/exec.h>
63 1.1 chris #include <sys/syslog.h>
64 1.1 chris
65 1.1 chris #include <uvm/uvm_extern.h>
66 1.1 chris
67 1.1 chris #include <machine/cpu.h>
68 1.1 chris #include <machine/pmap.h>
69 1.1 chris #include <machine/reg.h>
70 1.1 chris #include <machine/vmparam.h>
71 1.1 chris
72 1.1 chris #ifdef ARMFPE
73 1.10 thorpej #include <arm/fpe-arm/armfpe.h>
74 1.1 chris #endif
75 1.1 chris
76 1.1 chris extern pv_addr_t systempage;
77 1.1 chris
78 1.1 chris int process_read_regs __P((struct proc *p, struct reg *regs));
79 1.1 chris int process_read_fpregs __P((struct proc *p, struct fpreg *regs));
80 1.1 chris
81 1.38 yamt void lwp_trampoline(void);
82 1.1 chris
83 1.1 chris /*
84 1.1 chris * Special compilation symbols:
85 1.1 chris *
86 1.1 chris * STACKCHECKS - Fill undefined and supervisor stacks with a known pattern
87 1.1 chris * on forking and check the pattern on exit, reporting
88 1.1 chris * the amount of stack used.
89 1.1 chris */
90 1.1 chris
91 1.24 thorpej void
92 1.24 thorpej cpu_proc_fork(p1, p2)
93 1.24 thorpej struct proc *p1, *p2;
94 1.24 thorpej {
95 1.24 thorpej
96 1.24 thorpej #if defined(PERFCTRS)
97 1.24 thorpej if (PMC_ENABLED(p1))
98 1.24 thorpej pmc_md_fork(p1, p2);
99 1.24 thorpej else {
100 1.24 thorpej p2->p_md.pmc_enabled = 0;
101 1.24 thorpej p2->p_md.pmc_state = NULL;
102 1.24 thorpej }
103 1.24 thorpej #endif
104 1.24 thorpej }
105 1.24 thorpej
106 1.46 matt void
107 1.46 matt cpu_setfunc(struct lwp *l, void (*func)(void *), void *arg)
108 1.46 matt {
109 1.46 matt struct pcb *pcb = &l->l_addr->u_pcb;
110 1.46 matt struct trapframe *tf = pcb->pcb_tf;
111 1.46 matt struct switchframe *sf = (struct switchframe *)tf - 1;
112 1.46 matt
113 1.46 matt sf->sf_r4 = (u_int)func;
114 1.46 matt sf->sf_r5 = (u_int)arg;
115 1.46 matt sf->sf_sp = (u_int)tf;
116 1.46 matt sf->sf_pc = (u_int)lwp_trampoline;
117 1.46 matt pcb->pcb_un.un_32.pcb32_sp = (u_int)sf;
118 1.46 matt }
119 1.46 matt
120 1.1 chris /*
121 1.44 skrll * Finish a fork operation, with LWP l2 nearly set up.
122 1.44 skrll *
123 1.44 skrll * Copy and update the pcb and trapframe, making the child ready to run.
124 1.1 chris *
125 1.1 chris * Rig the child's kernel stack so that it will start out in
126 1.44 skrll * lwp_trampoline() which will call the specified func with the argument arg.
127 1.1 chris *
128 1.1 chris * If an alternate user-level stack is requested (with non-zero values
129 1.1 chris * in both the stack and stacksize args), set up the user stack pointer
130 1.1 chris * accordingly.
131 1.1 chris */
132 1.1 chris void
133 1.38 yamt cpu_lwp_fork(struct lwp *l1, struct lwp *l2, void *stack, size_t stacksize,
134 1.38 yamt void (*func)(void *), void *arg)
135 1.1 chris {
136 1.45 matt struct pcb *pcb = &l2->l_addr->u_pcb;
137 1.1 chris struct trapframe *tf;
138 1.1 chris
139 1.1 chris #ifdef PMAP_DEBUG
140 1.1 chris if (pmap_debug_level >= 0)
141 1.24 thorpej printf("cpu_lwp_fork: %p %p %p %p\n", l1, l2, curlwp, &lwp0);
142 1.1 chris #endif /* PMAP_DEBUG */
143 1.1 chris
144 1.1 chris #if 0 /* XXX */
145 1.24 thorpej if (l1 == curlwp) {
146 1.1 chris /* Sync the PCB before we copy it. */
147 1.1 chris savectx(curpcb);
148 1.1 chris }
149 1.18 briggs #endif
150 1.18 briggs
151 1.43 rearnsha l2->l_md.md_flags = l1->l_md.md_flags & MDP_VFPUSED;
152 1.43 rearnsha
153 1.43 rearnsha #ifdef FPU_VFP
154 1.43 rearnsha /*
155 1.43 rearnsha * Copy the floating point state from the VFP to the PCB
156 1.43 rearnsha * if this process has state stored there.
157 1.43 rearnsha */
158 1.43 rearnsha if (l1->l_addr->u_pcb.pcb_vfpcpu != NULL)
159 1.43 rearnsha vfp_saveregs_lwp(l1, 1);
160 1.43 rearnsha #endif
161 1.43 rearnsha
162 1.1 chris /* Copy the pcb */
163 1.24 thorpej *pcb = l1->l_addr->u_pcb;
164 1.1 chris
165 1.1 chris /*
166 1.42 chris * Set up the stack for the process.
167 1.1 chris * Note: this stack is not in use if we are forking from p1
168 1.1 chris */
169 1.24 thorpej pcb->pcb_un.un_32.pcb32_sp = (u_int)l2->l_addr + USPACE_SVC_STACK_TOP;
170 1.1 chris
171 1.1 chris #ifdef STACKCHECKS
172 1.1 chris /* Fill the kernel stack with a known pattern */
173 1.24 thorpej memset(((u_char *)l2->l_addr) + USPACE_SVC_STACK_BOTTOM, 0xdd,
174 1.1 chris (USPACE_SVC_STACK_TOP - USPACE_SVC_STACK_BOTTOM));
175 1.1 chris #endif /* STACKCHECKS */
176 1.1 chris
177 1.1 chris #ifdef PMAP_DEBUG
178 1.1 chris if (pmap_debug_level >= 0) {
179 1.24 thorpej printf("l1->procaddr=%p l1->procaddr->u_pcb=%p pid=%d pmap=%p\n",
180 1.24 thorpej l1->l_addr, &l1->l_addr->u_pcb, l1->l_lid,
181 1.24 thorpej l1->l_proc->p_vmspace->vm_map.pmap);
182 1.24 thorpej printf("l2->procaddr=%p l2->procaddr->u_pcb=%p pid=%d pmap=%p\n",
183 1.24 thorpej l2->l_addr, &l2->l_addr->u_pcb, l2->l_lid,
184 1.24 thorpej l2->l_proc->p_vmspace->vm_map.pmap);
185 1.1 chris }
186 1.1 chris #endif /* PMAP_DEBUG */
187 1.1 chris
188 1.1 chris #ifdef ARMFPE
189 1.1 chris /* Initialise a new FP context for p2 and copy the context from p1 */
190 1.24 thorpej arm_fpe_core_initcontext(FP_CONTEXT(l2));
191 1.24 thorpej arm_fpe_copycontext(FP_CONTEXT(l1), FP_CONTEXT(l2));
192 1.1 chris #endif /* ARMFPE */
193 1.1 chris
194 1.24 thorpej l2->l_addr->u_pcb.pcb_tf = tf =
195 1.5 toshii (struct trapframe *)pcb->pcb_un.un_32.pcb32_sp - 1;
196 1.24 thorpej *tf = *l1->l_addr->u_pcb.pcb_tf;
197 1.1 chris
198 1.1 chris /*
199 1.1 chris * If specified, give the child a different stack.
200 1.1 chris */
201 1.1 chris if (stack != NULL)
202 1.1 chris tf->tf_usr_sp = (u_int)stack + stacksize;
203 1.1 chris
204 1.46 matt cpu_setfunc(l2, func, arg);
205 1.24 thorpej }
206 1.24 thorpej
207 1.1 chris /*
208 1.1 chris * cpu_exit is called as the last action during exit.
209 1.1 chris *
210 1.1 chris * We clean up a little and then call switch_exit() with the old proc as an
211 1.1 chris * argument. switch_exit() first switches to proc0's context, and finally
212 1.1 chris * jumps into switch() to wait for another process to wake up.
213 1.1 chris */
214 1.1 chris
215 1.1 chris void
216 1.31 jdolecek cpu_lwp_free(struct lwp *l, int proc)
217 1.1 chris {
218 1.1 chris #ifdef ARMFPE
219 1.1 chris /* Abort any active FP operation and deactivate the context */
220 1.24 thorpej arm_fpe_core_abort(FP_CONTEXT(l), NULL, NULL);
221 1.1 chris arm_fpe_core_changecontext(0);
222 1.1 chris #endif /* ARMFPE */
223 1.1 chris
224 1.43 rearnsha #ifdef FPU_VFP
225 1.43 rearnsha if (l->l_addr->u_pcb.pcb_vfpcpu != NULL)
226 1.43 rearnsha vfp_saveregs_lwp(l, 0);
227 1.43 rearnsha #endif
228 1.43 rearnsha
229 1.1 chris #ifdef STACKCHECKS
230 1.1 chris /* Report how much stack has been used - debugging */
231 1.24 thorpej if (l) {
232 1.1 chris u_char *ptr;
233 1.1 chris int loop;
234 1.1 chris
235 1.1 chris ptr = ((u_char *)p2->p_addr) + USPACE_SVC_STACK_BOTTOM;
236 1.1 chris for (loop = 0; loop < (USPACE_SVC_STACK_TOP - USPACE_SVC_STACK_BOTTOM)
237 1.1 chris && *ptr == 0xdd; ++loop, ++ptr) ;
238 1.1 chris log(LOG_INFO, "%d bytes of svc stack fill pattern\n", loop);
239 1.1 chris }
240 1.1 chris #endif /* STACKCHECKS */
241 1.1 chris }
242 1.1 chris
243 1.31 jdolecek void
244 1.36 matt cpu_lwp_free2(struct lwp *l)
245 1.36 matt {
246 1.36 matt }
247 1.36 matt
248 1.36 matt void
249 1.24 thorpej cpu_swapin(l)
250 1.24 thorpej struct lwp *l;
251 1.1 chris {
252 1.8 rearnsha #if 0
253 1.24 thorpej struct proc *p = l->l_proc;
254 1.24 thorpej
255 1.8 rearnsha /* Don't do this. See the comment in cpu_swapout(). */
256 1.1 chris #ifdef PMAP_DEBUG
257 1.1 chris if (pmap_debug_level >= 0)
258 1.24 thorpej printf("cpu_swapin(%p, %d, %s, %p)\n", l, l->l_lid,
259 1.1 chris p->p_comm, p->p_vmspace->vm_map.pmap);
260 1.1 chris #endif /* PMAP_DEBUG */
261 1.1 chris
262 1.16 thorpej if (vector_page < KERNEL_BASE) {
263 1.16 thorpej /* Map the vector page */
264 1.16 thorpej pmap_enter(p->p_vmspace->vm_map.pmap, vector_page,
265 1.16 thorpej systempage.pv_pa, VM_PROT_READ, VM_PROT_READ|PMAP_WIRED);
266 1.16 thorpej pmap_update(p->p_vmspace->vm_map.pmap);
267 1.16 thorpej }
268 1.8 rearnsha #endif
269 1.1 chris }
270 1.1 chris
271 1.1 chris
272 1.1 chris void
273 1.24 thorpej cpu_swapout(l)
274 1.24 thorpej struct lwp *l;
275 1.1 chris {
276 1.43 rearnsha #ifdef FPU_VFP
277 1.43 rearnsha if (l->l_addr->u_pcb.pcb_vfpcpu != NULL)
278 1.43 rearnsha vfp_saveregs_lwp(l, 1);
279 1.43 rearnsha #endif
280 1.43 rearnsha
281 1.8 rearnsha #if 0
282 1.24 thorpej struct proc *p = l->l_proc;
283 1.24 thorpej
284 1.8 rearnsha /*
285 1.8 rearnsha * Don't do this! If the pmap is shared with another process,
286 1.8 rearnsha * it will loose it's page0 entry. That's bad news indeed.
287 1.8 rearnsha */
288 1.1 chris #ifdef PMAP_DEBUG
289 1.1 chris if (pmap_debug_level >= 0)
290 1.24 thorpej printf("cpu_swapout(%p, %d, %s, %p)\n", l, l->l_lid,
291 1.1 chris p->p_comm, &p->p_vmspace->vm_map.pmap);
292 1.1 chris #endif /* PMAP_DEBUG */
293 1.1 chris
294 1.16 thorpej if (vector_page < KERNEL_BASE) {
295 1.16 thorpej /* Free the system page mapping */
296 1.16 thorpej pmap_remove(p->p_vmspace->vm_map.pmap, vector_page,
297 1.25 thorpej vector_page + PAGE_SIZE);
298 1.16 thorpej pmap_update(p->p_vmspace->vm_map.pmap);
299 1.16 thorpej }
300 1.8 rearnsha #endif
301 1.1 chris }
302 1.1 chris
303 1.1 chris /*
304 1.1 chris * Map a user I/O request into kernel virtual address space.
305 1.1 chris * Note: the pages are already locked by uvm_vslock(), so we
306 1.1 chris * do not need to pass an access_type to pmap_enter().
307 1.1 chris */
308 1.1 chris void
309 1.1 chris vmapbuf(bp, len)
310 1.1 chris struct buf *bp;
311 1.1 chris vsize_t len;
312 1.1 chris {
313 1.1 chris vaddr_t faddr, taddr, off;
314 1.3 chris paddr_t fpa;
315 1.3 chris
316 1.1 chris
317 1.1 chris #ifdef PMAP_DEBUG
318 1.1 chris if (pmap_debug_level >= 0)
319 1.1 chris printf("vmapbuf: bp=%08x buf=%08x len=%08x\n", (u_int)bp,
320 1.1 chris (u_int)bp->b_data, (u_int)len);
321 1.1 chris #endif /* PMAP_DEBUG */
322 1.1 chris
323 1.1 chris if ((bp->b_flags & B_PHYS) == 0)
324 1.1 chris panic("vmapbuf");
325 1.1 chris
326 1.35 skrll bp->b_saveaddr = bp->b_data;
327 1.35 skrll faddr = trunc_page((vaddr_t)bp->b_data);
328 1.1 chris off = (vaddr_t)bp->b_data - faddr;
329 1.1 chris len = round_page(off + len);
330 1.33 yamt taddr = uvm_km_alloc(phys_map, len, 0, UVM_KMF_VAONLY | UVM_KMF_WAITVA);
331 1.37 christos bp->b_data = (void *)(taddr + off);
332 1.1 chris
333 1.1 chris /*
334 1.1 chris * The region is locked, so we expect that pmap_pte() will return
335 1.1 chris * non-NULL.
336 1.1 chris */
337 1.3 chris while (len) {
338 1.3 chris (void) pmap_extract(vm_map_pmap(&bp->b_proc->p_vmspace->vm_map),
339 1.3 chris faddr, &fpa);
340 1.4 chris pmap_enter(pmap_kernel(), taddr, fpa,
341 1.23 chris VM_PROT_READ|VM_PROT_WRITE, VM_PROT_READ|VM_PROT_WRITE|PMAP_WIRED);
342 1.3 chris faddr += PAGE_SIZE;
343 1.3 chris taddr += PAGE_SIZE;
344 1.3 chris len -= PAGE_SIZE;
345 1.3 chris }
346 1.6 chris pmap_update(pmap_kernel());
347 1.1 chris }
348 1.1 chris
349 1.1 chris /*
350 1.1 chris * Unmap a previously-mapped user I/O request.
351 1.1 chris */
352 1.1 chris void
353 1.1 chris vunmapbuf(bp, len)
354 1.1 chris struct buf *bp;
355 1.1 chris vsize_t len;
356 1.1 chris {
357 1.1 chris vaddr_t addr, off;
358 1.1 chris
359 1.1 chris #ifdef PMAP_DEBUG
360 1.1 chris if (pmap_debug_level >= 0)
361 1.1 chris printf("vunmapbuf: bp=%08x buf=%08x len=%08x\n",
362 1.1 chris (u_int)bp, (u_int)bp->b_data, (u_int)len);
363 1.1 chris #endif /* PMAP_DEBUG */
364 1.1 chris
365 1.1 chris if ((bp->b_flags & B_PHYS) == 0)
366 1.1 chris panic("vunmapbuf");
367 1.1 chris
368 1.1 chris /*
369 1.1 chris * Make sure the cache does not have dirty data for the
370 1.1 chris * pages we had mapped.
371 1.1 chris */
372 1.1 chris addr = trunc_page((vaddr_t)bp->b_data);
373 1.1 chris off = (vaddr_t)bp->b_data - addr;
374 1.1 chris len = round_page(off + len);
375 1.4 chris
376 1.4 chris pmap_remove(pmap_kernel(), addr, addr + len);
377 1.6 chris pmap_update(pmap_kernel());
378 1.33 yamt uvm_km_free(phys_map, addr, len, UVM_KMF_VAONLY);
379 1.1 chris bp->b_data = bp->b_saveaddr;
380 1.1 chris bp->b_saveaddr = 0;
381 1.1 chris }
382 1.1 chris
383 1.1 chris /* End of vm_machdep.c */
384