2 * SPDX-License-Identifier: BSD-4-Clause
4 * Copyright (c) 1982, 1986 The Regents of the University of California.
5 * Copyright (c) 1989, 1990 William Jolitz
6 * Copyright (c) 1994 John Dyson
9 * This code is derived from software contributed to Berkeley by
10 * the Systems Programming Group of the University of Utah Computer
11 * Science Department, and William Jolitz.
13 * Redistribution and use in source and binary :forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. All advertising materials mentioning features or use of this software
22 * must display the following acknowledgement:
23 * This product includes software developed by the University of
24 * California, Berkeley and its contributors.
25 * 4. Neither the name of the University nor the names of its contributors
26 * may be used to endorse or promote products derived from this software
27 * without specific prior written permission.
29 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
30 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
31 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
33 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
34 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
35 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
36 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
37 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
38 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
41 * from: @(#)vm_machdep.c 7.3 (Berkeley) 5/13/91
42 * Utah $Hdr: vm_machdep.c 1.16.1.1 89/06/23$
45 #include "opt_compat.h"
47 #include <sys/cdefs.h>
48 __FBSDID("$FreeBSD$");
50 #include <sys/param.h>
51 #include <sys/systm.h>
52 #include <sys/kernel.h>
53 #include <sys/malloc.h>
56 #include <sys/socketvar.h>
57 #include <sys/syscall.h>
58 #include <sys/sysctl.h>
59 #include <sys/sysent.h>
60 #include <sys/unistd.h>
62 #include <machine/cpu.h>
63 #include <machine/frame.h>
64 #include <machine/pcb.h>
65 #include <machine/sysarch.h>
67 #include <sys/mutex.h>
71 #include <vm/vm_extern.h>
72 #include <vm/vm_kern.h>
73 #include <vm/vm_page.h>
74 #include <vm/vm_map.h>
75 #include <vm/vm_param.h>
76 #include <vm/vm_pageout.h>
78 #include <vm/uma_int.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 _Static_assert((sizeof(struct switchframe) % 8) == 0, "Bad alignment");
88 _Static_assert((sizeof(struct trapframe) % 8) == 0, "Bad alignment");
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(struct thread *td1, struct proc *p2, struct thread *td2, int flags)
101 struct trapframe *tf;
104 if ((flags & RFPROC) == 0)
107 /* Point the pcb to the top of the stack */
108 pcb2 = (struct pcb *)
109 (td2->td_kstack + td2->td_kstack_pages * PAGE_SIZE) - 1;
111 #ifndef CPU_XSCALE_CORE3
112 pmap_use_minicache(td2->td_kstack, td2->td_kstack_pages * PAGE_SIZE);
116 /* Store actual state of VFP */
117 if (curthread == td1) {
119 vfp_store(&td1->td_pcb->pcb_vfpstate, false);
125 /* Clone td1's pcb */
126 bcopy(td1->td_pcb, pcb2, sizeof(*pcb2));
128 /* Point to mdproc and then copy over td1's contents */
130 bcopy(&td1->td_proc->p_md, mdp2, sizeof(*mdp2));
132 /* Point the frame to the stack in front of pcb and copy td1's frame */
133 td2->td_frame = (struct trapframe *)pcb2 - 1;
134 *td2->td_frame = *td1->td_frame;
137 * Create a new fresh stack for the new process.
138 * Copy the trap frame for the return to user mode as if from a
139 * syscall. This copies most of the user mode register values.
141 pmap_set_pcb_pagedir(vmspace_pmap(p2->p_vmspace), pcb2);
142 pcb2->pcb_regs.sf_r4 = (register_t)fork_return;
143 pcb2->pcb_regs.sf_r5 = (register_t)td2;
144 pcb2->pcb_regs.sf_lr = (register_t)fork_trampoline;
145 pcb2->pcb_regs.sf_sp = STACKALIGN(td2->td_frame);
147 pcb2->pcb_regs.sf_tpidrurw = (register_t)get_tls();
150 pcb2->pcb_vfpcpu = -1;
151 pcb2->pcb_vfpstate.fpscr = initial_fpscr;
154 tf->tf_spsr &= ~PSR_C;
159 /* Setup to release spin count in fork_exit(). */
160 td2->td_md.md_spinlock_count = 1;
161 td2->td_md.md_saved_cspr = PSR_SVC32_MODE;
163 td2->td_md.md_tp = *(register_t *)ARM_TP_ADDRESS;
168 cpu_thread_swapin(struct thread *td)
173 cpu_thread_swapout(struct thread *td)
178 cpu_set_syscall_retval(struct thread *td, int error)
180 struct trapframe *frame;
186 frame = td->td_frame;
191 * __syscall returns an off_t while most other syscalls return an
192 * int. As an off_t is 64-bits and an int is 32-bits we need to
193 * place the returned data into r1. As the lseek and freebsd6_lseek
194 * syscalls also return an off_t they do not need this fixup.
197 if (call == SYS___syscall) {
198 register_t *ap = &frame->tf_r0;
199 register_t code = ap[_QUAD_LOWWORD];
200 if (td->td_proc->p_sysent->sv_mask)
201 code &= td->td_proc->p_sysent->sv_mask;
202 fixup = (code != SYS_lseek);
210 frame->tf_r1 = td->td_retval[0];
212 frame->tf_r0 = td->td_retval[0];
213 frame->tf_r1 = td->td_retval[1];
215 frame->tf_spsr &= ~PSR_C; /* carry bit */
219 * Reconstruct the pc to point at the swi.
222 if ((frame->tf_spsr & PSR_T) != 0)
223 frame->tf_pc -= THUMB_INSN_SIZE;
226 frame->tf_pc -= INSN_SIZE;
232 frame->tf_r0 = SV_ABI_ERRNO(td->td_proc, error);
233 frame->tf_spsr |= PSR_C; /* carry bit */
239 * Initialize machine state, mostly pcb and trap frame for a new
240 * thread, about to return to userspace. Put enough state in the new
241 * thread's PCB to get it to go back to the fork_return(), which
242 * finalizes the thread state and handles peculiarities of the first
243 * return to userspace for the new thread.
246 cpu_copy_thread(struct thread *td, struct thread *td0)
249 bcopy(td0->td_frame, td->td_frame, sizeof(struct trapframe));
250 bcopy(td0->td_pcb, td->td_pcb, sizeof(struct pcb));
252 td->td_pcb->pcb_regs.sf_r4 = (register_t)fork_return;
253 td->td_pcb->pcb_regs.sf_r5 = (register_t)td;
254 td->td_pcb->pcb_regs.sf_lr = (register_t)fork_trampoline;
255 td->td_pcb->pcb_regs.sf_sp = STACKALIGN(td->td_frame);
257 td->td_frame->tf_spsr &= ~PSR_C;
258 td->td_frame->tf_r0 = 0;
260 /* Setup to release spin count in fork_exit(). */
261 td->td_md.md_spinlock_count = 1;
262 td->td_md.md_saved_cspr = PSR_SVC32_MODE;
266 * Set that machine state for performing an upcall that starts
267 * the entry function with the given argument.
270 cpu_set_upcall(struct thread *td, void (*entry)(void *), void *arg,
273 struct trapframe *tf = td->td_frame;
275 tf->tf_usr_sp = STACKALIGN((int)stack->ss_sp + stack->ss_size);
276 tf->tf_pc = (int)entry;
277 tf->tf_r0 = (int)arg;
278 tf->tf_spsr = PSR_USR32_MODE;
282 cpu_set_user_tls(struct thread *td, void *tls_base)
286 td->td_pcb->pcb_regs.sf_tpidrurw = (register_t)tls_base;
290 td->td_md.md_tp = (register_t)tls_base;
291 if (td == curthread) {
293 *(register_t *)ARM_TP_ADDRESS = (register_t)tls_base;
301 cpu_thread_exit(struct thread *td)
306 cpu_thread_alloc(struct thread *td)
308 td->td_pcb = (struct pcb *)(td->td_kstack + td->td_kstack_pages *
311 * Ensure td_frame is aligned to an 8 byte boundary as it will be
312 * placed into the stack pointer which must be 8 byte aligned in
315 td->td_frame = (struct trapframe *)((caddr_t)td->td_pcb) - 1;
318 #ifndef CPU_XSCALE_CORE3
319 pmap_use_minicache(td->td_kstack, td->td_kstack_pages * PAGE_SIZE);
325 cpu_thread_free(struct thread *td)
330 cpu_thread_clean(struct thread *td)
335 * Intercept the return address from a freshly forked process that has NOT
336 * been scheduled yet.
338 * This is needed to make kernel threads stay in kernel mode.
341 cpu_fork_kthread_handler(struct thread *td, void (*func)(void *), void *arg)
343 td->td_pcb->pcb_regs.sf_r4 = (register_t)func; /* function */
344 td->td_pcb->pcb_regs.sf_r5 = (register_t)arg; /* first arg */
348 * Software interrupt handler for queued VM system processing.
354 if (busdma_swi_pending)
359 cpu_exit(struct thread *td)