1 /*-
2 * SPDX-License-Identifier: (BSD-4-Clause AND MIT-CMU)
3 *
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
7 * All rights reserved.
8 *
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.
12 *
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
15 * are met:
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.
28 *
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
39 * SUCH DAMAGE.
40 *
41 * from: @(#)vm_machdep.c 7.3 (Berkeley) 5/13/91
42 * Utah $Hdr: vm_machdep.c 1.16.1.1 89/06/23$
43 * $FreeBSD$
44 */
45 /*-
46 * Copyright (c) 1994, 1995, 1996 Carnegie-Mellon University.
47 * All rights reserved.
48 *
49 * Author: Chris G. Demetriou
50 *
51 * Permission to use, copy, modify and distribute this software and
52 * its documentation is hereby granted, provided that both the copyright
53 * notice and this permission notice appear in all copies of the
54 * software, derivative works or modified versions, and any portions
55 * thereof, and that both notices appear in supporting documentation.
56 *
57 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
58 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
59 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
60 *
61 * Carnegie Mellon requests users of this software to return to
62 *
63 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
64 * School of Computer Science
65 * Carnegie Mellon University
66 * Pittsburgh PA 15213-3890
67 *
68 * any improvements or extensions that they make and grant Carnegie the
69 * rights to redistribute these changes.
70 */
71
72 #include <sys/param.h>
73 #include <sys/systm.h>
74 #include <sys/proc.h>
75 #include <sys/malloc.h>
76 #include <sys/bio.h>
77 #include <sys/buf.h>
78 #include <sys/ktr.h>
79 #include <sys/lock.h>
80 #include <sys/mutex.h>
81 #include <sys/vnode.h>
82 #include <sys/vmmeter.h>
83 #include <sys/kernel.h>
84 #include <sys/mbuf.h>
85 #include <sys/sysctl.h>
86 #include <sys/sysent.h>
87 #include <sys/unistd.h>
88
89 #include <machine/cpu.h>
90 #include <machine/fpu.h>
91 #include <machine/frame.h>
92 #include <machine/md_var.h>
93 #include <machine/pcb.h>
94
95 #include <dev/ofw/openfirm.h>
96
97 #include <vm/vm.h>
98 #include <vm/vm_param.h>
99 #include <vm/vm_kern.h>
100 #include <vm/vm_page.h>
101 #include <vm/vm_map.h>
102 #include <vm/vm_extern.h>
103
104 /*
105 * Finish a fork operation, with process p2 nearly set up.
106 * Copy and update the pcb, set up the stack so that the child
107 * ready to run and return to user mode.
108 */
109 void
110 cpu_fork(struct thread *td1, struct proc *p2, struct thread *td2, int flags)
111 {
112 struct trapframe *tf;
113 struct callframe *cf;
114 struct pcb *pcb;
115
116 KASSERT(td1 == curthread || td1 == &thread0,
117 ("cpu_fork: p1 not curproc and not proc0"));
118 CTR3(KTR_PROC, "cpu_fork: called td1=%p p2=%p flags=%x",
119 td1, p2, flags);
120
121 if ((flags & RFPROC) == 0)
122 return;
123
124 pcb = (struct pcb *)((td2->td_kstack +
125 td2->td_kstack_pages * PAGE_SIZE - sizeof(struct pcb)) & ~0x2fUL);
126 td2->td_pcb = pcb;
127
128 /* Copy the pcb */
129 bcopy(td1->td_pcb, pcb, sizeof(struct pcb));
130
131 /*
132 * Create a fresh stack for the new process.
133 * Copy the trap frame for the return to user mode as if from a
134 * syscall. This copies most of the user mode register values.
135 */
136 tf = (struct trapframe *)pcb - 1;
137 bcopy(td1->td_frame, tf, sizeof(*tf));
138
139 /* Set up trap frame. */
140 tf->fixreg[FIRSTARG] = 0;
141 tf->fixreg[FIRSTARG + 1] = 0;
142 tf->cr &= ~0x10000000;
143
144 td2->td_frame = tf;
145
146 cf = (struct callframe *)tf - 1;
147 memset(cf, 0, sizeof(struct callframe));
148 #if defined(__powerpc64__) && (!defined(_CALL_ELF) || _CALL_ELF == 1)
149 cf->cf_toc = ((register_t *)fork_return)[1];
150 #endif
151 cf->cf_func = (register_t)fork_return;
152 cf->cf_arg0 = (register_t)td2;
153 cf->cf_arg1 = (register_t)tf;
154
155 pcb->pcb_sp = (register_t)cf;
156 KASSERT(pcb->pcb_sp % 16 == 0, ("stack misaligned"));
157 #if defined(__powerpc64__) && (!defined(_CALL_ELF) || _CALL_ELF == 1)
158 pcb->pcb_lr = ((register_t *)fork_trampoline)[0];
159 pcb->pcb_toc = ((register_t *)fork_trampoline)[1];
160 #else
161 pcb->pcb_lr = (register_t)fork_trampoline;
162 pcb->pcb_context[0] = pcb->pcb_lr;
163 #endif
164 #ifdef AIM
165 pcb->pcb_cpu.aim.usr_vsid = 0;
166 #endif
167
168 /* Setup to release spin count in fork_exit(). */
169 td2->td_md.md_spinlock_count = 1;
170 td2->td_md.md_saved_msr = psl_kernset;
171
172 /*
173 * Now cpu_switch() can schedule the new process.
174 */
175 }
176
177 /*
178 * Intercept the return address from a freshly forked process that has NOT
179 * been scheduled yet.
180 *
181 * This is needed to make kernel threads stay in kernel mode.
182 */
183 void
184 cpu_fork_kthread_handler(struct thread *td, void (*func)(void *), void *arg)
185 {
186 struct callframe *cf;
187
188 CTR4(KTR_PROC, "%s called with td=%p func=%p arg=%p",
189 __func__, td, func, arg);
190
191 cf = (struct callframe *)td->td_pcb->pcb_sp;
192
193 #if defined(__powerpc64__) && (!defined(_CALL_ELF) || _CALL_ELF == 1)
194 cf->cf_toc = ((register_t *)func)[1];
195 #endif
196 cf->cf_func = (register_t)func;
197 cf->cf_arg0 = (register_t)arg;
198 }
199
200 void
201 cpu_exit(struct thread *td)
202 {
203
204 }
205
206 /*
207 * Software interrupt handler for queued VM system processing.
208 */
209 void
210 swi_vm(void *dummy)
211 {
212
213 if (busdma_swi_pending != 0)
214 busdma_swi();
215 }
216
217 /*
218 * Tell whether this address is in some physical memory region.
219 * Currently used by the kernel coredump code in order to avoid
220 * dumping the ``ISA memory hole'' which could cause indefinite hangs,
221 * or other unpredictable behaviour.
222 */
223 int
224 is_physical_memory(vm_offset_t addr)
225 {
226
227 /*
228 * stuff other tests for known memory-mapped devices (PCI?)
229 * here
230 */
231 return (1);
232 }
233
234 /*
235 * CPU threading functions related to the VM layer. These could be used
236 * to map the SLB bits required for the kernel stack instead of forcing a
237 * fixed-size KVA.
238 */
239
240 void
241 cpu_thread_swapin(struct thread *td)
242 {
243
244 }
245
246 void
247 cpu_thread_swapout(struct thread *td)
248 {
249
250 }
251
252 bool
253 cpu_exec_vmspace_reuse(struct proc *p __unused, vm_map_t map __unused)
254 {
255
256 return (true);
257 }
258
259 int
260 cpu_procctl(struct thread *td __unused, int idtype __unused, id_t id __unused,
261 int com __unused, void *data __unused)
262 {
263
264 return (EINVAL);
265 }
Cache object: 6ec788664c453dad0654aaf78999b142
|