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