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
7 * This code is derived from software contributed to Berkeley by
8 * the Systems Programming Group of the University of Utah Computer
9 * Science Department, and William Jolitz.
11 * Redistribution and use in source and binary :forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. All advertising materials mentioning features or use of this software
20 * must display the following acknowledgement:
21 * This product includes software developed by the University of
22 * California, Berkeley and its contributors.
23 * 4. Neither the name of the University nor the names of its contributors
24 * may be used to endorse or promote products derived from this software
25 * without specific prior written permission.
27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 * from: @(#)vm_machdep.c 7.3 (Berkeley) 5/13/91
40 * Utah $Hdr: vm_machdep.c 1.16.1.1 89/06/23$
43 #include "opt_compat.h"
45 #include <sys/cdefs.h>
46 __FBSDID("$FreeBSD$");
48 #include <sys/param.h>
49 #include <sys/systm.h>
50 #include <sys/kernel.h>
51 #include <sys/malloc.h>
54 #include <sys/socketvar.h>
55 #include <sys/syscall.h>
56 #include <sys/sysctl.h>
57 #include <sys/sysent.h>
58 #include <sys/unistd.h>
60 #include <machine/acle-compat.h>
61 #include <machine/cpu.h>
62 #include <machine/frame.h>
63 #include <machine/pcb.h>
64 #include <machine/sysarch.h>
66 #include <sys/mutex.h>
70 #include <vm/vm_extern.h>
71 #include <vm/vm_kern.h>
72 #include <vm/vm_page.h>
73 #include <vm/vm_map.h>
74 #include <vm/vm_param.h>
75 #include <vm/vm_pageout.h>
77 #include <vm/uma_int.h>
79 #include <machine/acle-compat.h>
80 #include <machine/md_var.h>
81 #include <machine/vfp.h>
84 * struct switchframe and trapframe must both be a multiple of 8
85 * for correct stack alignment.
87 CTASSERT(sizeof(struct switchframe) == 48);
88 CTASSERT(sizeof(struct trapframe) == 80);
90 uint32_t initial_fpscr = VFPSCR_DN | VFPSCR_FZ;
93 * Finish a fork operation, with process p2 nearly set up.
94 * Copy and update the pcb, set up the stack so that the child
95 * ready to run and return to user mode.
98 cpu_fork(register struct thread *td1, register struct proc *p2,
99 struct thread *td2, int flags)
102 struct trapframe *tf;
105 if ((flags & RFPROC) == 0)
108 /* Point the pcb to the top of the stack */
109 pcb2 = (struct pcb *)
110 (td2->td_kstack + td2->td_kstack_pages * PAGE_SIZE) - 1;
112 #ifndef CPU_XSCALE_CORE3
113 pmap_use_minicache(td2->td_kstack, td2->td_kstack_pages * PAGE_SIZE);
118 /* Clone td1's pcb */
119 bcopy(td1->td_pcb, pcb2, sizeof(*pcb2));
121 /* Point to mdproc and then copy over td1's contents */
123 bcopy(&td1->td_proc->p_md, mdp2, sizeof(*mdp2));
125 /* Point the frame to the stack in front of pcb and copy td1's frame */
126 td2->td_frame = (struct trapframe *)pcb2 - 1;
127 *td2->td_frame = *td1->td_frame;
130 * Create a new fresh stack for the new process.
131 * Copy the trap frame for the return to user mode as if from a
132 * syscall. This copies most of the user mode register values.
134 pmap_set_pcb_pagedir(vmspace_pmap(p2->p_vmspace), pcb2);
135 pcb2->pcb_regs.sf_r4 = (register_t)fork_return;
136 pcb2->pcb_regs.sf_r5 = (register_t)td2;
137 pcb2->pcb_regs.sf_lr = (register_t)fork_trampoline;
138 pcb2->pcb_regs.sf_sp = STACKALIGN(td2->td_frame);
140 pcb2->pcb_vfpcpu = -1;
141 pcb2->pcb_vfpstate.fpscr = initial_fpscr;
144 tf->tf_spsr &= ~PSR_C;
149 /* Setup to release spin count in fork_exit(). */
150 td2->td_md.md_spinlock_count = 1;
151 td2->td_md.md_saved_cspr = PSR_SVC32_MODE;
153 td2->td_md.md_tp = td1->td_md.md_tp;
155 td2->td_md.md_tp = *(register_t *)ARM_TP_ADDRESS;
160 cpu_thread_swapin(struct thread *td)
165 cpu_thread_swapout(struct thread *td)
170 cpu_set_syscall_retval(struct thread *td, int error)
172 struct trapframe *frame;
178 frame = td->td_frame;
183 * __syscall returns an off_t while most other syscalls return an
184 * int. As an off_t is 64-bits and an int is 32-bits we need to
185 * place the returned data into r1. As the lseek and freebsd6_lseek
186 * syscalls also return an off_t they do not need this fixup.
189 if (call == SYS___syscall) {
190 register_t *ap = &frame->tf_r0;
191 register_t code = ap[_QUAD_LOWWORD];
192 if (td->td_proc->p_sysent->sv_mask)
193 code &= td->td_proc->p_sysent->sv_mask;
194 fixup = (code != SYS_lseek);
202 frame->tf_r1 = td->td_retval[0];
204 frame->tf_r0 = td->td_retval[0];
205 frame->tf_r1 = td->td_retval[1];
207 frame->tf_spsr &= ~PSR_C; /* carry bit */
211 * Reconstruct the pc to point at the swi.
214 if ((frame->tf_spsr & PSR_T) != 0)
215 frame->tf_pc -= THUMB_INSN_SIZE;
218 frame->tf_pc -= INSN_SIZE;
224 frame->tf_r0 = error;
225 frame->tf_spsr |= PSR_C; /* carry bit */
231 * Initialize machine state (pcb and trap frame) for a new thread about to
232 * upcall. Put enough state in the new thread's PCB to get it to go back
233 * userret(), where we can intercept it again to set the return (upcall)
234 * Address and stack, along with those from upcals that are from other sources
235 * such as those generated in thread_userret() itself.
238 cpu_set_upcall(struct thread *td, struct thread *td0)
241 bcopy(td0->td_frame, td->td_frame, sizeof(struct trapframe));
242 bcopy(td0->td_pcb, td->td_pcb, sizeof(struct pcb));
244 td->td_pcb->pcb_regs.sf_r4 = (register_t)fork_return;
245 td->td_pcb->pcb_regs.sf_r5 = (register_t)td;
246 td->td_pcb->pcb_regs.sf_lr = (register_t)fork_trampoline;
247 td->td_pcb->pcb_regs.sf_sp = STACKALIGN(td->td_frame);
249 td->td_frame->tf_spsr &= ~PSR_C;
250 td->td_frame->tf_r0 = 0;
252 /* Setup to release spin count in fork_exit(). */
253 td->td_md.md_spinlock_count = 1;
254 td->td_md.md_saved_cspr = PSR_SVC32_MODE;
258 * Set that machine state for performing an upcall that has to
259 * be done in thread_userret() so that those upcalls generated
260 * in thread_userret() itself can be done as well.
263 cpu_set_upcall_kse(struct thread *td, void (*entry)(void *), void *arg,
266 struct trapframe *tf = td->td_frame;
268 tf->tf_usr_sp = STACKALIGN((int)stack->ss_sp + stack->ss_size);
269 tf->tf_pc = (int)entry;
270 tf->tf_r0 = (int)arg;
271 tf->tf_spsr = PSR_USR32_MODE;
275 cpu_set_user_tls(struct thread *td, void *tls_base)
278 td->td_md.md_tp = (register_t)tls_base;
279 if (td == curthread) {
284 *(register_t *)ARM_TP_ADDRESS = (register_t)tls_base;
292 cpu_thread_exit(struct thread *td)
297 cpu_thread_alloc(struct thread *td)
299 td->td_pcb = (struct pcb *)(td->td_kstack + td->td_kstack_pages *
302 * Ensure td_frame is aligned to an 8 byte boundary as it will be
303 * placed into the stack pointer which must be 8 byte aligned in
306 td->td_frame = (struct trapframe *)((caddr_t)td->td_pcb) - 1;
309 #ifndef CPU_XSCALE_CORE3
310 pmap_use_minicache(td->td_kstack, td->td_kstack_pages * PAGE_SIZE);
316 cpu_thread_free(struct thread *td)
321 cpu_thread_clean(struct thread *td)
326 * Intercept the return address from a freshly forked process that has NOT
327 * been scheduled yet.
329 * This is needed to make kernel threads stay in kernel mode.
332 cpu_set_fork_handler(struct thread *td, void (*func)(void *), void *arg)
334 td->td_pcb->pcb_regs.sf_r4 = (register_t)func; /* function */
335 td->td_pcb->pcb_regs.sf_r5 = (register_t)arg; /* first arg */
339 * Software interrupt handler for queued VM system processing.
345 if (busdma_swi_pending)
350 cpu_exit(struct thread *td)