vm_machdep.c revision 1.38 1 /* $NetBSD: vm_machdep.c,v 1.38 2007/05/17 14:51:16 yamt 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.38 2007/05/17 14:51:16 yamt 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 undefined 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_und_sp = (u_int)l2->l_addr +
151 USPACE_UNDEF_STACK_TOP;
152 pcb->pcb_un.un_32.pcb32_sp = (u_int)l2->l_addr + USPACE_SVC_STACK_TOP;
153
154 #ifdef STACKCHECKS
155 /* Fill the undefined stack with a known pattern */
156 memset(((u_char *)l2->l_addr) + USPACE_UNDEF_STACK_BOTTOM, 0xdd,
157 (USPACE_UNDEF_STACK_TOP - USPACE_UNDEF_STACK_BOTTOM));
158 /* Fill the kernel stack with a known pattern */
159 memset(((u_char *)l2->l_addr) + USPACE_SVC_STACK_BOTTOM, 0xdd,
160 (USPACE_SVC_STACK_TOP - USPACE_SVC_STACK_BOTTOM));
161 #endif /* STACKCHECKS */
162
163 #ifdef PMAP_DEBUG
164 if (pmap_debug_level >= 0) {
165 printf("l1->procaddr=%p l1->procaddr->u_pcb=%p pid=%d pmap=%p\n",
166 l1->l_addr, &l1->l_addr->u_pcb, l1->l_lid,
167 l1->l_proc->p_vmspace->vm_map.pmap);
168 printf("l2->procaddr=%p l2->procaddr->u_pcb=%p pid=%d pmap=%p\n",
169 l2->l_addr, &l2->l_addr->u_pcb, l2->l_lid,
170 l2->l_proc->p_vmspace->vm_map.pmap);
171 }
172 #endif /* PMAP_DEBUG */
173
174 pmap_activate(l2);
175
176 #ifdef ARMFPE
177 /* Initialise a new FP context for p2 and copy the context from p1 */
178 arm_fpe_core_initcontext(FP_CONTEXT(l2));
179 arm_fpe_copycontext(FP_CONTEXT(l1), FP_CONTEXT(l2));
180 #endif /* ARMFPE */
181
182 l2->l_addr->u_pcb.pcb_tf = tf =
183 (struct trapframe *)pcb->pcb_un.un_32.pcb32_sp - 1;
184 *tf = *l1->l_addr->u_pcb.pcb_tf;
185
186 /*
187 * If specified, give the child a different stack.
188 */
189 if (stack != NULL)
190 tf->tf_usr_sp = (u_int)stack + stacksize;
191
192 sf = (struct switchframe *)tf - 1;
193 sf->sf_r4 = (u_int)func;
194 sf->sf_r5 = (u_int)arg;
195 sf->sf_pc = (u_int)lwp_trampoline;
196 pcb->pcb_un.un_32.pcb32_sp = (u_int)sf;
197 }
198
199 /*
200 * cpu_exit is called as the last action during exit.
201 *
202 * We clean up a little and then call switch_exit() with the old proc as an
203 * argument. switch_exit() first switches to proc0's context, and finally
204 * jumps into switch() to wait for another process to wake up.
205 */
206
207 void
208 cpu_lwp_free(struct lwp *l, int proc)
209 {
210 #ifdef ARMFPE
211 /* Abort any active FP operation and deactivate the context */
212 arm_fpe_core_abort(FP_CONTEXT(l), NULL, NULL);
213 arm_fpe_core_changecontext(0);
214 #endif /* ARMFPE */
215
216 #ifdef STACKCHECKS
217 /* Report how much stack has been used - debugging */
218 if (l) {
219 u_char *ptr;
220 int loop;
221
222 ptr = ((u_char *)p2->p_addr) + USPACE_UNDEF_STACK_BOTTOM;
223 for (loop = 0; loop < (USPACE_UNDEF_STACK_TOP - USPACE_UNDEF_STACK_BOTTOM)
224 && *ptr == 0xdd; ++loop, ++ptr) ;
225 log(LOG_INFO, "%d bytes of undefined stack fill pattern\n", loop);
226 ptr = ((u_char *)p2->p_addr) + USPACE_SVC_STACK_BOTTOM;
227 for (loop = 0; loop < (USPACE_SVC_STACK_TOP - USPACE_SVC_STACK_BOTTOM)
228 && *ptr == 0xdd; ++loop, ++ptr) ;
229 log(LOG_INFO, "%d bytes of svc stack fill pattern\n", loop);
230 }
231 #endif /* STACKCHECKS */
232 }
233
234 void
235 cpu_lwp_free2(struct lwp *l)
236 {
237 }
238
239 void
240 cpu_swapin(l)
241 struct lwp *l;
242 {
243 #if 0
244 struct proc *p = l->l_proc;
245
246 /* Don't do this. See the comment in cpu_swapout(). */
247 #ifdef PMAP_DEBUG
248 if (pmap_debug_level >= 0)
249 printf("cpu_swapin(%p, %d, %s, %p)\n", l, l->l_lid,
250 p->p_comm, p->p_vmspace->vm_map.pmap);
251 #endif /* PMAP_DEBUG */
252
253 if (vector_page < KERNEL_BASE) {
254 /* Map the vector page */
255 pmap_enter(p->p_vmspace->vm_map.pmap, vector_page,
256 systempage.pv_pa, VM_PROT_READ, VM_PROT_READ|PMAP_WIRED);
257 pmap_update(p->p_vmspace->vm_map.pmap);
258 }
259 #endif
260 }
261
262
263 void
264 cpu_swapout(l)
265 struct lwp *l;
266 {
267 #if 0
268 struct proc *p = l->l_proc;
269
270 /*
271 * Don't do this! If the pmap is shared with another process,
272 * it will loose it's page0 entry. That's bad news indeed.
273 */
274 #ifdef PMAP_DEBUG
275 if (pmap_debug_level >= 0)
276 printf("cpu_swapout(%p, %d, %s, %p)\n", l, l->l_lid,
277 p->p_comm, &p->p_vmspace->vm_map.pmap);
278 #endif /* PMAP_DEBUG */
279
280 if (vector_page < KERNEL_BASE) {
281 /* Free the system page mapping */
282 pmap_remove(p->p_vmspace->vm_map.pmap, vector_page,
283 vector_page + PAGE_SIZE);
284 pmap_update(p->p_vmspace->vm_map.pmap);
285 }
286 #endif
287 }
288
289 /*
290 * Map a user I/O request into kernel virtual address space.
291 * Note: the pages are already locked by uvm_vslock(), so we
292 * do not need to pass an access_type to pmap_enter().
293 */
294 void
295 vmapbuf(bp, len)
296 struct buf *bp;
297 vsize_t len;
298 {
299 vaddr_t faddr, taddr, off;
300 paddr_t fpa;
301
302
303 #ifdef PMAP_DEBUG
304 if (pmap_debug_level >= 0)
305 printf("vmapbuf: bp=%08x buf=%08x len=%08x\n", (u_int)bp,
306 (u_int)bp->b_data, (u_int)len);
307 #endif /* PMAP_DEBUG */
308
309 if ((bp->b_flags & B_PHYS) == 0)
310 panic("vmapbuf");
311
312 bp->b_saveaddr = bp->b_data;
313 faddr = trunc_page((vaddr_t)bp->b_data);
314 off = (vaddr_t)bp->b_data - faddr;
315 len = round_page(off + len);
316 taddr = uvm_km_alloc(phys_map, len, 0, UVM_KMF_VAONLY | UVM_KMF_WAITVA);
317 bp->b_data = (void *)(taddr + off);
318
319 /*
320 * The region is locked, so we expect that pmap_pte() will return
321 * non-NULL.
322 */
323 while (len) {
324 (void) pmap_extract(vm_map_pmap(&bp->b_proc->p_vmspace->vm_map),
325 faddr, &fpa);
326 pmap_enter(pmap_kernel(), taddr, fpa,
327 VM_PROT_READ|VM_PROT_WRITE, VM_PROT_READ|VM_PROT_WRITE|PMAP_WIRED);
328 faddr += PAGE_SIZE;
329 taddr += PAGE_SIZE;
330 len -= PAGE_SIZE;
331 }
332 pmap_update(pmap_kernel());
333 }
334
335 /*
336 * Unmap a previously-mapped user I/O request.
337 */
338 void
339 vunmapbuf(bp, len)
340 struct buf *bp;
341 vsize_t len;
342 {
343 vaddr_t addr, off;
344
345 #ifdef PMAP_DEBUG
346 if (pmap_debug_level >= 0)
347 printf("vunmapbuf: bp=%08x buf=%08x len=%08x\n",
348 (u_int)bp, (u_int)bp->b_data, (u_int)len);
349 #endif /* PMAP_DEBUG */
350
351 if ((bp->b_flags & B_PHYS) == 0)
352 panic("vunmapbuf");
353
354 /*
355 * Make sure the cache does not have dirty data for the
356 * pages we had mapped.
357 */
358 addr = trunc_page((vaddr_t)bp->b_data);
359 off = (vaddr_t)bp->b_data - addr;
360 len = round_page(off + len);
361
362 pmap_remove(pmap_kernel(), addr, addr + len);
363 pmap_update(pmap_kernel());
364 uvm_km_free(phys_map, addr, len, UVM_KMF_VAONLY);
365 bp->b_data = bp->b_saveaddr;
366 bp->b_saveaddr = 0;
367 }
368
369 /* End of vm_machdep.c */
370