vm_machdep.c revision 1.51 1 1.51 rmind /* $NetBSD: vm_machdep.c,v 1.51 2009/11/21 20:32:25 rmind 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.51 rmind __KERNEL_RCSID(0, "$NetBSD: vm_machdep.c,v 1.51 2009/11/21 20:32:25 rmind 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/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.47 dsl int process_read_regs(struct proc *p, struct reg *regs);
78 1.47 dsl int process_read_fpregs(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.49 dsl cpu_proc_fork(struct proc *p1, struct proc *p2)
92 1.24 thorpej {
93 1.24 thorpej
94 1.24 thorpej #if defined(PERFCTRS)
95 1.24 thorpej if (PMC_ENABLED(p1))
96 1.24 thorpej pmc_md_fork(p1, p2);
97 1.24 thorpej else {
98 1.24 thorpej p2->p_md.pmc_enabled = 0;
99 1.24 thorpej p2->p_md.pmc_state = NULL;
100 1.24 thorpej }
101 1.24 thorpej #endif
102 1.24 thorpej }
103 1.24 thorpej
104 1.46 matt void
105 1.46 matt cpu_setfunc(struct lwp *l, void (*func)(void *), void *arg)
106 1.46 matt {
107 1.51 rmind struct pcb *pcb = lwp_getpcb(l);
108 1.46 matt struct trapframe *tf = pcb->pcb_tf;
109 1.46 matt struct switchframe *sf = (struct switchframe *)tf - 1;
110 1.46 matt
111 1.46 matt sf->sf_r4 = (u_int)func;
112 1.46 matt sf->sf_r5 = (u_int)arg;
113 1.46 matt sf->sf_sp = (u_int)tf;
114 1.46 matt sf->sf_pc = (u_int)lwp_trampoline;
115 1.46 matt pcb->pcb_un.un_32.pcb32_sp = (u_int)sf;
116 1.46 matt }
117 1.46 matt
118 1.1 chris /*
119 1.44 skrll * Finish a fork operation, with LWP l2 nearly set up.
120 1.44 skrll *
121 1.44 skrll * Copy and update the pcb and trapframe, making the child ready to run.
122 1.1 chris *
123 1.1 chris * Rig the child's kernel stack so that it will start out in
124 1.44 skrll * lwp_trampoline() which will call the specified func with the argument arg.
125 1.1 chris *
126 1.1 chris * If an alternate user-level stack is requested (with non-zero values
127 1.1 chris * in both the stack and stacksize args), set up the user stack pointer
128 1.1 chris * accordingly.
129 1.1 chris */
130 1.1 chris void
131 1.38 yamt cpu_lwp_fork(struct lwp *l1, struct lwp *l2, void *stack, size_t stacksize,
132 1.38 yamt void (*func)(void *), void *arg)
133 1.1 chris {
134 1.51 rmind struct pcb *pcb1, *pcb2;
135 1.1 chris struct trapframe *tf;
136 1.1 chris
137 1.51 rmind pcb1 = lwp_getpcb(l1);
138 1.51 rmind pcb2 = lwp_getpcb(l2);
139 1.51 rmind
140 1.1 chris #ifdef PMAP_DEBUG
141 1.1 chris if (pmap_debug_level >= 0)
142 1.24 thorpej printf("cpu_lwp_fork: %p %p %p %p\n", l1, l2, curlwp, &lwp0);
143 1.1 chris #endif /* PMAP_DEBUG */
144 1.1 chris
145 1.1 chris #if 0 /* XXX */
146 1.24 thorpej if (l1 == curlwp) {
147 1.1 chris /* Sync the PCB before we copy it. */
148 1.1 chris savectx(curpcb);
149 1.1 chris }
150 1.18 briggs #endif
151 1.18 briggs
152 1.43 rearnsha l2->l_md.md_flags = l1->l_md.md_flags & MDP_VFPUSED;
153 1.43 rearnsha
154 1.43 rearnsha #ifdef FPU_VFP
155 1.43 rearnsha /*
156 1.43 rearnsha * Copy the floating point state from the VFP to the PCB
157 1.43 rearnsha * if this process has state stored there.
158 1.43 rearnsha */
159 1.51 rmind if (pcb1->pcb_vfpcpu != NULL)
160 1.43 rearnsha vfp_saveregs_lwp(l1, 1);
161 1.43 rearnsha #endif
162 1.43 rearnsha
163 1.1 chris /* Copy the pcb */
164 1.51 rmind *pcb2 = *pcb1;
165 1.1 chris
166 1.1 chris /*
167 1.42 chris * Set up the stack for the process.
168 1.1 chris * Note: this stack is not in use if we are forking from p1
169 1.1 chris */
170 1.51 rmind pcb2->pcb_un.un_32.pcb32_sp = (u_int)l2->l_addr + USPACE_SVC_STACK_TOP;
171 1.1 chris
172 1.1 chris #ifdef STACKCHECKS
173 1.1 chris /* Fill the kernel stack with a known pattern */
174 1.24 thorpej memset(((u_char *)l2->l_addr) + USPACE_SVC_STACK_BOTTOM, 0xdd,
175 1.1 chris (USPACE_SVC_STACK_TOP - USPACE_SVC_STACK_BOTTOM));
176 1.1 chris #endif /* STACKCHECKS */
177 1.1 chris
178 1.1 chris #ifdef PMAP_DEBUG
179 1.1 chris if (pmap_debug_level >= 0) {
180 1.51 rmind printf("l1: pcb=%p pid=%d pmap=%p\n",
181 1.51 rmind pcb1, l1->l_lid, l1->l_proc->p_vmspace->vm_map.pmap);
182 1.51 rmind printf("l2: pcb=%p pid=%d pmap=%p\n",
183 1.51 rmind pcb2, l2->l_lid, l2->l_proc->p_vmspace->vm_map.pmap);
184 1.1 chris }
185 1.1 chris #endif /* PMAP_DEBUG */
186 1.1 chris
187 1.1 chris #ifdef ARMFPE
188 1.1 chris /* Initialise a new FP context for p2 and copy the context from p1 */
189 1.24 thorpej arm_fpe_core_initcontext(FP_CONTEXT(l2));
190 1.24 thorpej arm_fpe_copycontext(FP_CONTEXT(l1), FP_CONTEXT(l2));
191 1.1 chris #endif /* ARMFPE */
192 1.1 chris
193 1.51 rmind tf = (struct trapframe *)pcb2->pcb_un.un_32.pcb32_sp - 1;
194 1.51 rmind pcb2->pcb_tf = tf;
195 1.51 rmind *tf = *pcb1->pcb_tf;
196 1.1 chris
197 1.1 chris /*
198 1.1 chris * If specified, give the child a different stack.
199 1.1 chris */
200 1.1 chris if (stack != NULL)
201 1.1 chris tf->tf_usr_sp = (u_int)stack + stacksize;
202 1.1 chris
203 1.46 matt cpu_setfunc(l2, func, arg);
204 1.24 thorpej }
205 1.24 thorpej
206 1.1 chris /*
207 1.1 chris * cpu_exit is called as the last action during exit.
208 1.1 chris *
209 1.1 chris * We clean up a little and then call switch_exit() with the old proc as an
210 1.1 chris * argument. switch_exit() first switches to proc0's context, and finally
211 1.1 chris * jumps into switch() to wait for another process to wake up.
212 1.1 chris */
213 1.1 chris
214 1.1 chris void
215 1.31 jdolecek cpu_lwp_free(struct lwp *l, int proc)
216 1.1 chris {
217 1.51 rmind #ifdef FPU_VFP
218 1.51 rmind struct pcb *pcb;
219 1.51 rmind #endif
220 1.51 rmind
221 1.1 chris #ifdef ARMFPE
222 1.1 chris /* Abort any active FP operation and deactivate the context */
223 1.24 thorpej arm_fpe_core_abort(FP_CONTEXT(l), NULL, NULL);
224 1.1 chris arm_fpe_core_changecontext(0);
225 1.1 chris #endif /* ARMFPE */
226 1.1 chris
227 1.43 rearnsha #ifdef FPU_VFP
228 1.51 rmind pcb = lwp_getpcb(l);
229 1.51 rmind if (pcb->pcb_vfpcpu != NULL)
230 1.43 rearnsha vfp_saveregs_lwp(l, 0);
231 1.43 rearnsha #endif
232 1.43 rearnsha
233 1.1 chris #ifdef STACKCHECKS
234 1.1 chris /* Report how much stack has been used - debugging */
235 1.24 thorpej if (l) {
236 1.1 chris u_char *ptr;
237 1.1 chris int loop;
238 1.1 chris
239 1.1 chris ptr = ((u_char *)p2->p_addr) + USPACE_SVC_STACK_BOTTOM;
240 1.1 chris for (loop = 0; loop < (USPACE_SVC_STACK_TOP - USPACE_SVC_STACK_BOTTOM)
241 1.1 chris && *ptr == 0xdd; ++loop, ++ptr) ;
242 1.1 chris log(LOG_INFO, "%d bytes of svc stack fill pattern\n", loop);
243 1.1 chris }
244 1.1 chris #endif /* STACKCHECKS */
245 1.1 chris }
246 1.1 chris
247 1.31 jdolecek void
248 1.36 matt cpu_lwp_free2(struct lwp *l)
249 1.36 matt {
250 1.36 matt }
251 1.36 matt
252 1.1 chris /*
253 1.1 chris * Map a user I/O request into kernel virtual address space.
254 1.1 chris * Note: the pages are already locked by uvm_vslock(), so we
255 1.1 chris * do not need to pass an access_type to pmap_enter().
256 1.1 chris */
257 1.1 chris void
258 1.48 dsl vmapbuf(struct buf *bp, vsize_t len)
259 1.1 chris {
260 1.1 chris vaddr_t faddr, taddr, off;
261 1.3 chris paddr_t fpa;
262 1.3 chris
263 1.1 chris
264 1.1 chris #ifdef PMAP_DEBUG
265 1.1 chris if (pmap_debug_level >= 0)
266 1.1 chris printf("vmapbuf: bp=%08x buf=%08x len=%08x\n", (u_int)bp,
267 1.1 chris (u_int)bp->b_data, (u_int)len);
268 1.1 chris #endif /* PMAP_DEBUG */
269 1.1 chris
270 1.1 chris if ((bp->b_flags & B_PHYS) == 0)
271 1.1 chris panic("vmapbuf");
272 1.1 chris
273 1.35 skrll bp->b_saveaddr = bp->b_data;
274 1.35 skrll faddr = trunc_page((vaddr_t)bp->b_data);
275 1.1 chris off = (vaddr_t)bp->b_data - faddr;
276 1.1 chris len = round_page(off + len);
277 1.33 yamt taddr = uvm_km_alloc(phys_map, len, 0, UVM_KMF_VAONLY | UVM_KMF_WAITVA);
278 1.37 christos bp->b_data = (void *)(taddr + off);
279 1.1 chris
280 1.1 chris /*
281 1.1 chris * The region is locked, so we expect that pmap_pte() will return
282 1.1 chris * non-NULL.
283 1.1 chris */
284 1.3 chris while (len) {
285 1.3 chris (void) pmap_extract(vm_map_pmap(&bp->b_proc->p_vmspace->vm_map),
286 1.3 chris faddr, &fpa);
287 1.4 chris pmap_enter(pmap_kernel(), taddr, fpa,
288 1.23 chris VM_PROT_READ|VM_PROT_WRITE, VM_PROT_READ|VM_PROT_WRITE|PMAP_WIRED);
289 1.3 chris faddr += PAGE_SIZE;
290 1.3 chris taddr += PAGE_SIZE;
291 1.3 chris len -= PAGE_SIZE;
292 1.3 chris }
293 1.6 chris pmap_update(pmap_kernel());
294 1.1 chris }
295 1.1 chris
296 1.1 chris /*
297 1.1 chris * Unmap a previously-mapped user I/O request.
298 1.1 chris */
299 1.1 chris void
300 1.48 dsl vunmapbuf(struct buf *bp, vsize_t len)
301 1.1 chris {
302 1.1 chris vaddr_t addr, off;
303 1.1 chris
304 1.1 chris #ifdef PMAP_DEBUG
305 1.1 chris if (pmap_debug_level >= 0)
306 1.1 chris printf("vunmapbuf: bp=%08x buf=%08x len=%08x\n",
307 1.1 chris (u_int)bp, (u_int)bp->b_data, (u_int)len);
308 1.1 chris #endif /* PMAP_DEBUG */
309 1.1 chris
310 1.1 chris if ((bp->b_flags & B_PHYS) == 0)
311 1.1 chris panic("vunmapbuf");
312 1.1 chris
313 1.1 chris /*
314 1.1 chris * Make sure the cache does not have dirty data for the
315 1.1 chris * pages we had mapped.
316 1.1 chris */
317 1.1 chris addr = trunc_page((vaddr_t)bp->b_data);
318 1.1 chris off = (vaddr_t)bp->b_data - addr;
319 1.1 chris len = round_page(off + len);
320 1.4 chris
321 1.4 chris pmap_remove(pmap_kernel(), addr, addr + len);
322 1.6 chris pmap_update(pmap_kernel());
323 1.33 yamt uvm_km_free(phys_map, addr, len, UVM_KMF_VAONLY);
324 1.1 chris bp->b_data = bp->b_saveaddr;
325 1.1 chris bp->b_saveaddr = 0;
326 1.1 chris }
327 1.1 chris
328 1.1 chris /* End of vm_machdep.c */
329