vm_machdep.c revision 110190
1/*-
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 * All rights reserved.
6 *
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.
10 *
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
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.
26 *
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
37 * SUCH DAMAGE.
38 *
39 *	from: @(#)vm_machdep.c	7.3 (Berkeley) 5/13/91
40 *	Utah $Hdr: vm_machdep.c 1.16.1.1 89/06/23$
41 * $FreeBSD: head/sys/powerpc/aim/vm_machdep.c 110190 2003-02-01 12:17:09Z julian $
42 */
43/*
44 * Copyright (c) 1994, 1995, 1996 Carnegie-Mellon University.
45 * All rights reserved.
46 *
47 * Author: Chris G. Demetriou
48 *
49 * Permission to use, copy, modify and distribute this software and
50 * its documentation is hereby granted, provided that both the copyright
51 * notice and this permission notice appear in all copies of the
52 * software, derivative works or modified versions, and any portions
53 * thereof, and that both notices appear in supporting documentation.
54 *
55 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
56 * CONDITION.  CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
57 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
58 *
59 * Carnegie Mellon requests users of this software to return to
60 *
61 *  Software Distribution Coordinator  or  Software.Distribution@CS.CMU.EDU
62 *  School of Computer Science
63 *  Carnegie Mellon University
64 *  Pittsburgh PA 15213-3890
65 *
66 * any improvements or extensions that they make and grant Carnegie the
67 * rights to redistribute these changes.
68 */
69
70#include <sys/param.h>
71#include <sys/systm.h>
72#include <sys/proc.h>
73#include <sys/malloc.h>
74#include <sys/bio.h>
75#include <sys/buf.h>
76#include <sys/ktr.h>
77#include <sys/lock.h>
78#include <sys/mutex.h>
79#include <sys/vnode.h>
80#include <sys/vmmeter.h>
81#include <sys/kernel.h>
82#include <sys/sysctl.h>
83#include <sys/unistd.h>
84
85#include <machine/clock.h>
86#include <machine/cpu.h>
87#include <machine/fpu.h>
88#include <machine/frame.h>
89#include <machine/md_var.h>
90
91#include <dev/ofw/openfirm.h>
92
93#include <vm/vm.h>
94#include <vm/vm_param.h>
95#include <vm/vm_kern.h>
96#include <vm/vm_page.h>
97#include <vm/vm_map.h>
98#include <vm/vm_extern.h>
99
100#include <sys/user.h>
101
102/*
103 * Finish a fork operation, with process p2 nearly set up.
104 * Copy and update the pcb, set up the stack so that the child
105 * ready to run and return to user mode.
106 */
107void
108cpu_fork(struct thread *td1, struct proc *p2, struct thread *td2, int flags)
109{
110	struct	proc *p1;
111	struct	trapframe *tf;
112	struct	callframe *cf;
113	struct	pcb *pcb;
114
115	KASSERT(td1 == curthread || td1 == &thread0,
116	    ("cpu_fork: p1 not curproc and not proc0"));
117	CTR3(KTR_PROC, "cpu_fork: called td1=%08x p2=%08x flags=%x", (u_int)td1, (u_int)p2, flags);
118
119	if ((flags & RFPROC) == 0)
120		return;
121
122	p1 = td1->td_proc;
123
124	pcb = (struct pcb *)((td2->td_kstack + KSTACK_PAGES * PAGE_SIZE -
125	    sizeof(struct pcb)) & ~0x2fU);
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	cf->cf_func = (register_t)fork_return;
148	cf->cf_arg0 = (register_t)td2;
149	cf->cf_arg1 = (register_t)tf;
150
151	pcb->pcb_sp = (register_t)cf;
152	pcb->pcb_lr = (register_t)fork_trampoline;
153	pcb->pcb_usr = kernel_pmap->pm_sr[USER_SR];
154
155	/*
156 	 * Now cpu_switch() can schedule the new process.
157	 */
158}
159
160/*
161 * Intercept the return address from a freshly forked process that has NOT
162 * been scheduled yet.
163 *
164 * This is needed to make kernel threads stay in kernel mode.
165 */
166void
167cpu_set_fork_handler(td, func, arg)
168	struct thread *td;
169	void (*func)(void *);
170	void *arg;
171{
172	struct	callframe *cf;
173
174	CTR3(KTR_PROC, "cpu_set_fork_handler: called with td=%08x func=%08x arg=%08x",
175	    (u_int)td, (u_int)func, (u_int)arg);
176
177	cf = (struct callframe *)td->td_pcb->pcb_sp;
178
179	cf->cf_func = (register_t)func;
180	cf->cf_arg0 = (register_t)arg;
181}
182
183/*
184 * cpu_exit is called as the last action during exit.
185 * We release the address space of the process, block interrupts,
186 * and call switch_exit.  switch_exit switches to proc0's PCB and stack,
187 * then jumps into the middle of cpu_switch, as if it were switching
188 * from proc0.
189 */
190void
191cpu_exit(td)
192	register struct thread *td;
193{
194}
195
196void
197cpu_sched_exit(td)
198	register struct thread *td;
199{
200}
201
202void
203cpu_wait(td)
204	struct proc *td;
205{
206}
207
208/* Temporary helper */
209void
210cpu_throw(void)
211{
212
213	cpu_switch();
214	panic("cpu_throw() didn't");
215}
216
217/*
218 * Reset back to firmware.
219 */
220void
221cpu_reset()
222{
223	OF_exit();
224}
225
226/*
227 * Software interrupt handler for queued VM system processing.
228 */
229void
230swi_vm(void *dummy)
231{
232#if 0 /* XXX: Don't have busdma stuff yet */
233	if (busdma_swi_pending != 0)
234		busdma_swi();
235#endif
236}
237
238/*
239 * Tell whether this address is in some physical memory region.
240 * Currently used by the kernel coredump code in order to avoid
241 * dumping the ``ISA memory hole'' which could cause indefinite hangs,
242 * or other unpredictable behaviour.
243 */
244
245
246int
247is_physical_memory(addr)
248	vm_offset_t addr;
249{
250	/*
251	 * stuff other tests for known memory-mapped devices (PCI?)
252	 * here
253	 */
254
255	return 1;
256}
257
258/*
259 * KSE functions
260 */
261void
262cpu_thread_exit(struct thread *td)
263{
264
265	return;
266}
267
268void
269cpu_thread_clean(struct thread *td)
270{
271}
272
273void
274cpu_thread_setup(struct thread *td)
275{
276
277	return;
278}
279
280void
281cpu_set_upcall(struct thread *td, void *pcb)
282{
283
284	return;
285}
286
287void
288cpu_set_upcall_kse(struct thread *td, struct kse *ke)
289{
290
291	return;
292}
293