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