2 * Copyright (c) 1982, 1986 The Regents of the University of California.
3 * Copyright (c) 1989, 1990 William Jolitz
4 * Copyright (c) 1994 John Dyson
5 * Copyright (c) 2001 Jake Burkholder.
8 * This code is derived from software contributed to Berkeley by
9 * the Systems Programming Group of the University of Utah Computer
10 * Science Department, and William Jolitz.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. All advertising materials mentioning features or use of this software
21 * must display the following acknowledgement:
22 * This product includes software developed by the University of
23 * California, Berkeley and its contributors.
24 * 4. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 * from: @(#)vm_machdep.c 7.3 (Berkeley) 5/13/91
41 * Utah $Hdr: vm_machdep.c 1.16.1.1 89/06/23$
42 * from: FreeBSD: src/sys/i386/i386/vm_machdep.c,v 1.167 2001/07/12
48 #include <sys/param.h>
49 #include <sys/systm.h>
50 #include <sys/malloc.h>
54 #include <sys/kernel.h>
55 #include <sys/linker_set.h>
57 #include <sys/mutex.h>
58 #include <sys/sf_buf.h>
59 #include <sys/sysctl.h>
60 #include <sys/unistd.h>
61 #include <sys/vmmeter.h>
63 #include <dev/ofw/openfirm.h>
66 #include <vm/vm_extern.h>
68 #include <vm/vm_kern.h>
69 #include <vm/vm_map.h>
70 #include <vm/vm_page.h>
71 #include <vm/vm_pageout.h>
72 #include <vm/vm_param.h>
74 #include <vm/uma_int.h>
76 #include <machine/bus.h>
77 #include <machine/cpu.h>
78 #include <machine/fp.h>
79 #include <machine/fsr.h>
80 #include <machine/frame.h>
81 #include <machine/md_var.h>
82 #include <machine/ofw_machdep.h>
83 #include <machine/ofw_mem.h>
84 #include <machine/pcb.h>
85 #include <machine/tlb.h>
86 #include <machine/tstate.h>
87 #include <machine/wstate.h>
88 #include <machine/asm.h>
91 cpu_exit(struct thread *td)
96 p->p_md.md_sigtramp = NULL;
97 if (p->p_md.md_utrap != NULL) {
98 utrap_free(p->p_md.md_utrap);
99 p->p_md.md_utrap = NULL;
104 cpu_thread_exit(struct thread *td)
109 cpu_thread_clean(struct thread *td)
114 cpu_thread_setup(struct thread *td)
118 pcb = (struct pcb *)((td->td_kstack + td->td_kstack_pages * PAGE_SIZE -
119 sizeof(struct pcb)) & ~0x3fUL);
120 pcb->pcb_kstack = (uint64_t)(((char *)pcb) - (CCFSZ + SPOFF));
122 td->td_frame = (struct trapframe *)pcb - 1;
123 pcb = (struct pcb *)TLB_PHYS_TO_DIRECT(vtophys((vm_offset_t)pcb));
124 KASSERT(pcb > (struct pcb *)VM_MIN_DIRECT_ADDRESS,("pcb is NULL"));
130 cpu_thread_swapin(struct thread *td)
135 cpu_thread_swapout(struct thread *td)
140 cpu_set_upcall(struct thread *td, struct thread *td0)
142 struct trapframe *tf;
146 bcopy(td0->td_frame, td->td_frame, sizeof(struct trapframe));
151 fr = (struct frame *)tf - 1;
152 fr->fr_local[0] = (u_long)fork_return;
153 fr->fr_local[1] = (u_long)td;
154 fr->fr_local[2] = (u_long)tf;
155 pcb->pcb_pc = (u_long)fork_trampoline - 8;
156 pcb->pcb_sp = (u_long)fr - SPOFF;
158 /* Setup to release spin count in fork_exit(). */
159 td->td_md.md_spinlock_count = 1;
160 td->td_md.md_saved_pil = 0;
164 cpu_set_upcall_kse(struct thread *td, void (*entry)(void *), void *arg,
167 struct trapframe *tf;
173 sp = (uint64_t)stack->ss_sp + stack->ss_size;
174 tf->tf_out[0] = (uint64_t)arg;
175 tf->tf_out[6] = sp - SPOFF - sizeof(struct frame);
176 tf->tf_tpc = (uint64_t)entry;
177 tf->tf_tnpc = tf->tf_tpc + 4;
179 td->td_retval[0] = tf->tf_out[0];
180 td->td_retval[1] = tf->tf_out[1];
184 cpu_set_user_tls(struct thread *td, void *tls_base)
189 td->td_frame->tf_global[7] = (uint64_t) tls_base;
194 * Finish a fork operation, with process p2 nearly set up.
195 * Copy and update the pcb, set up the stack so that the child
196 * ready to run and return to user mode.
199 cpu_fork(struct thread *td1, struct proc *p2, struct thread *td2, int flags)
201 struct trapframe *tf;
204 struct pcb *pcb2, *pcb2orig;
209 KASSERT(td1 == curthread || td1 == &thread0,
210 ("cpu_fork: p1 not curproc and not proc0"));
212 if ((flags & RFPROC) == 0)
215 p2->p_md.md_sigtramp = td1->td_proc->p_md.md_sigtramp;
216 p2->p_md.md_utrap = utrap_hold(td1->td_proc->p_md.md_utrap);
218 /* The pcb must be aligned on a 64-byte boundary. */
221 pcb2orig = (struct pcb *)((td2->td_kstack + td2->td_kstack_pages *
222 PAGE_SIZE - sizeof(struct pcb)) & ~0x3fUL);
223 pcb2 = (struct pcb *)TLB_PHYS_TO_DIRECT(vtophys((vm_offset_t)pcb2orig));
228 * Ensure that p1's pcb is up to date.
231 if ((td1->td_frame->tf_fprs & FPRS_FEF) != 0)
232 savefpctx(pcb1->pcb_ufp);
234 /* Make sure the copied windows are spilled. */
236 /* Copy the pcb (this will copy the windows saved in the pcb, too). */
237 bcopy(pcb1, pcb2, sizeof(*pcb1));
240 * If we're creating a new user process and we're sharing the address
241 * space, the parent's top most frame must be saved in the pcb. The
242 * child will pop the frame when it returns to user mode, and may
243 * overwrite it with its own data causing much suffering for the
244 * parent. We check if its already in the pcb, and if not copy it
245 * in. Its unlikely that the copyin will fail, but if so there's not
246 * much we can do. The parent will likely crash soon anyway in that
249 if ((flags & RFMEM) != 0 && td1 != &thread0) {
250 sp = td1->td_frame->tf_sp;
251 for (i = 0; i < pcb1->pcb_nsaved; i++) {
252 if (pcb1->pcb_rwsp[i] == sp)
255 if (i == pcb1->pcb_nsaved) {
256 error = copyin((caddr_t)sp + SPOFF, &pcb1->pcb_rw[i],
257 sizeof(struct rwindow));
259 pcb1->pcb_rwsp[i] = sp;
266 * Create a new fresh stack for the new process.
267 * Copy the trap frame for the return to user mode as if from a
268 * syscall. This copies most of the user mode register values.
270 tf = (struct trapframe *)pcb2orig - 1;
271 bcopy(td1->td_frame, tf, sizeof(*tf));
273 tf->tf_out[0] = 0; /* Child returns zero */
275 tf->tf_tstate &= ~TSTATE_XCC_C; /* success */
277 tf->tf_wstate = WSTATE_U64;
281 fp = (struct frame *)tf - 1;
282 fp->fr_local[0] = (u_long)fork_return;
283 fp->fr_local[1] = (u_long)td2;
284 fp->fr_local[2] = (u_long)tf;
285 /* Terminate stack traces at this frame. */
286 fp->fr_pc = fp->fr_fp = 0;
287 pcb2->pcb_sp = (u_long)fp - SPOFF;
288 pcb2->pcb_pc = (u_long)fork_trampoline - 8;
289 pcb2->pcb_kstack = (uint64_t)(((char *)pcb2orig) - (CCFSZ + SPOFF));
291 /* Setup to release spin count in fork_exit(). */
292 td2->td_md.md_spinlock_count = 1;
293 td2->td_md.md_saved_pil = 0;
296 * Now, cpu_switch() can schedule the new process.
303 static char bspec[64] = "";
318 if ((chosen = OF_finddevice("/chosen")) != 0) {
319 if (OF_getprop(chosen, "bootpath", bspec, sizeof(bspec)) == -1)
321 bspec[sizeof(bspec) - 1] = '\0';
327 * Intercept the return address from a freshly forked process that has NOT
328 * been scheduled yet.
330 * This is needed to make kernel threads stay in kernel mode.
333 cpu_set_fork_handler(struct thread *td, void (*func)(void *), void *arg)
339 fp = (struct frame *)(pcb->pcb_sp + SPOFF);
340 fp->fr_local[0] = (u_long)func;
341 fp->fr_local[1] = (u_long)arg;
345 is_physical_memory(vm_paddr_t addr)
347 struct ofw_mem_region *mr;
349 for (mr = sparc64_memreg; mr < sparc64_memreg + sparc64_nmemreg; mr++)
350 if (addr >= mr->mr_start && addr < mr->mr_start + mr->mr_size)
356 * Get an sf_buf from the freelist. Will block if none are available.
359 sf_buf_alloc(struct vm_page *m, int flags)
361 return ((struct sf_buf *)m);
365 * Release resources back to the system.
368 sf_buf_free(struct sf_buf *sf)
377 * Nothing to do here yet - busdma bounce buffers are not yet
383 uma_small_alloc(uma_zone_t zone, int bytes, u_int8_t *flags, int wait)
385 static vm_pindex_t color;
392 *flags = UMA_SLAB_PRIV;
394 if ((wait & (M_NOWAIT|M_USE_RESERVE)) == M_NOWAIT)
395 pflags = VM_ALLOC_INTERRUPT;
397 pflags = VM_ALLOC_SYSTEM;
400 pflags |= VM_ALLOC_ZERO;
403 m = vm_page_alloc(NULL, color++, pflags | VM_ALLOC_NOOBJ);
413 pa = VM_PAGE_TO_PHYS(m);
414 va = (void *)TLB_PHYS_TO_DIRECT(pa);
415 if ((wait & M_ZERO) && ((m->flags & PG_ZERO) == 0))
416 hwblkclr((void *)TLB_PHYS_TO_DIRECT(pa), PAGE_SIZE);
421 uma_small_free(void *mem, int size, u_int8_t flags)
425 m = PHYS_TO_VM_PAGE(TLB_DIRECT_TO_PHYS((vm_offset_t)mem));
426 vm_page_lock_queues();
428 vm_page_unlock_queues();