vm_machdep.c revision 129750
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 129750 2004-05-26 12:09:39Z tmm $ 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/mbuf.h> 83#include <sys/sf_buf.h> 84#include <sys/sysctl.h> 85#include <sys/unistd.h> 86 87#include <machine/clock.h> 88#include <machine/cpu.h> 89#include <machine/fpu.h> 90#include <machine/frame.h> 91#include <machine/md_var.h> 92 93#include <dev/ofw/openfirm.h> 94 95#include <vm/vm.h> 96#include <vm/vm_param.h> 97#include <vm/vm_kern.h> 98#include <vm/vm_page.h> 99#include <vm/vm_map.h> 100#include <vm/vm_extern.h> 101 102#include <sys/user.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 */ 109void 110cpu_fork(struct thread *td1, struct proc *p2, struct thread *td2, int flags) 111{ 112 struct proc *p1; 113 struct trapframe *tf; 114 struct callframe *cf; 115 struct pcb *pcb; 116 117 KASSERT(td1 == curthread || td1 == &thread0, 118 ("cpu_fork: p1 not curproc and not proc0")); 119 CTR3(KTR_PROC, "cpu_fork: called td1=%08x p2=%08x flags=%x", (u_int)td1, (u_int)p2, flags); 120 121 if ((flags & RFPROC) == 0) 122 return; 123 124 p1 = td1->td_proc; 125 126 pcb = (struct pcb *)((td2->td_kstack + 127 td2->td_kstack_pages * PAGE_SIZE - sizeof(struct pcb)) & ~0x2fU); 128 td2->td_pcb = pcb; 129 130 /* Copy the pcb */ 131 bcopy(td1->td_pcb, pcb, sizeof(struct pcb)); 132 133 /* 134 * Create a fresh stack for the new process. 135 * Copy the trap frame for the return to user mode as if from a 136 * syscall. This copies most of the user mode register values. 137 */ 138 tf = (struct trapframe *)pcb - 1; 139 bcopy(td1->td_frame, tf, sizeof(*tf)); 140 141 /* Set up trap frame. */ 142 tf->fixreg[FIRSTARG] = 0; 143 tf->fixreg[FIRSTARG + 1] = 0; 144 tf->cr &= ~0x10000000; 145 146 td2->td_frame = tf; 147 148 cf = (struct callframe *)tf - 1; 149 cf->cf_func = (register_t)fork_return; 150 cf->cf_arg0 = (register_t)td2; 151 cf->cf_arg1 = (register_t)tf; 152 153 pcb->pcb_sp = (register_t)cf; 154 pcb->pcb_lr = (register_t)fork_trampoline; 155 pcb->pcb_usr = kernel_pmap->pm_sr[USER_SR]; 156 157 /* 158 * Now cpu_switch() can schedule the new process. 159 */ 160} 161 162/* 163 * Intercept the return address from a freshly forked process that has NOT 164 * been scheduled yet. 165 * 166 * This is needed to make kernel threads stay in kernel mode. 167 */ 168void 169cpu_set_fork_handler(td, func, arg) 170 struct thread *td; 171 void (*func)(void *); 172 void *arg; 173{ 174 struct callframe *cf; 175 176 CTR3(KTR_PROC, "cpu_set_fork_handler: called with td=%08x func=%08x arg=%08x", 177 (u_int)td, (u_int)func, (u_int)arg); 178 179 cf = (struct callframe *)td->td_pcb->pcb_sp; 180 181 cf->cf_func = (register_t)func; 182 cf->cf_arg0 = (register_t)arg; 183} 184 185/* 186 * cpu_exit is called as the last action during exit. 187 * We release the address space of the process, block interrupts, 188 * and call switch_exit. switch_exit switches to proc0's PCB and stack, 189 * then jumps into the middle of cpu_switch, as if it were switching 190 * from proc0. 191 */ 192void 193cpu_exit(td) 194 register struct thread *td; 195{ 196} 197 198/* Temporary helper */ 199void 200cpu_throw(struct thread *old, struct thread *new) 201{ 202 203 cpu_switch(old, new); 204 panic("cpu_throw() didn't"); 205} 206 207/* 208 * Reset back to firmware. 209 */ 210void 211cpu_reset() 212{ 213 OF_exit(); 214} 215 216/* 217 * Allocate an sf_buf for the given vm_page. On this machine, however, there 218 * is no sf_buf object. Instead, an opaque pointer to the given vm_page is 219 * returned. 220 */ 221struct sf_buf * 222sf_buf_alloc(struct vm_page *m, int pri) 223{ 224 225 return ((struct sf_buf *)m); 226} 227 228/* 229 * Free the sf_buf. In fact, do nothing because there are no resources 230 * associated with the sf_buf. 231 */ 232void 233sf_buf_free(struct sf_buf *sf) 234{ 235} 236 237/* 238 * Software interrupt handler for queued VM system processing. 239 */ 240void 241swi_vm(void *dummy) 242{ 243#if 0 /* XXX: Don't have busdma stuff yet */ 244 if (busdma_swi_pending != 0) 245 busdma_swi(); 246#endif 247} 248 249/* 250 * Tell whether this address is in some physical memory region. 251 * Currently used by the kernel coredump code in order to avoid 252 * dumping the ``ISA memory hole'' which could cause indefinite hangs, 253 * or other unpredictable behaviour. 254 */ 255 256 257int 258is_physical_memory(addr) 259 vm_offset_t addr; 260{ 261 /* 262 * stuff other tests for known memory-mapped devices (PCI?) 263 * here 264 */ 265 266 return 1; 267} 268 269/* 270 * KSE functions 271 */ 272void 273cpu_thread_exit(struct thread *td) 274{ 275} 276 277void 278cpu_thread_clean(struct thread *td) 279{ 280} 281 282void 283cpu_thread_setup(struct thread *td) 284{ 285 struct pcb *pcb; 286 287 pcb = (struct pcb *)((td->td_kstack + td->td_kstack_pages * PAGE_SIZE - 288 sizeof(struct pcb)) & ~0x2fU); 289 td->td_pcb = pcb; 290 td->td_frame = (struct trapframe *)pcb - 1; 291} 292 293void 294cpu_thread_swapin(struct thread *td) 295{ 296} 297 298void 299cpu_thread_swapout(struct thread *td) 300{ 301} 302 303void 304cpu_set_upcall(struct thread *td, struct thread *td0) 305{ 306 struct pcb *pcb2; 307 struct trapframe *tf; 308 struct callframe *cf; 309 310 pcb2 = td->td_pcb; 311 312 /* Copy the upcall pcb */ 313 bcopy(td0->td_pcb, pcb2, sizeof(*pcb2)); 314 315 /* Create a stack for the new thread */ 316 tf = td->td_frame; 317 bcopy(td0->td_frame, tf, sizeof(struct trapframe)); 318 tf->fixreg[FIRSTARG] = 0; 319 tf->fixreg[FIRSTARG + 1] = 0; 320 tf->cr &= ~0x10000000; 321 322 /* Set registers for trampoline to user mode. */ 323 cf = (struct callframe *)tf - 1; 324 cf->cf_func = (register_t)fork_return; 325 cf->cf_arg0 = (register_t)td; 326 cf->cf_arg1 = (register_t)tf; 327 328 pcb2->pcb_sp = (register_t)cf; 329 pcb2->pcb_lr = (register_t)fork_trampoline; 330 pcb2->pcb_usr = kernel_pmap->pm_sr[USER_SR]; 331} 332 333void 334cpu_set_upcall_kse(struct thread *td, struct kse_upcall *ku) 335{ 336 struct trapframe *tf; 337 uint32_t sp; 338 339 tf = td->td_frame; 340 /* align stack and alloc space for frame ptr and saved LR */ 341 sp = ((uint32_t)ku->ku_stack.ss_sp + ku->ku_stack.ss_size 342 - 2*sizeof(u_int32_t)) & ~0x1f; 343 bzero(tf, sizeof(struct trapframe)); 344 345 tf->fixreg[1] = (register_t)sp; 346 tf->fixreg[3] = (register_t)ku->ku_mailbox; 347 tf->srr0 = (register_t)ku->ku_func; 348 tf->srr1 = PSL_MBO | PSL_USERSET | PSL_FE_DFLT; 349 td->td_pcb->pcb_flags = 0; 350 351 td->td_retval[0] = (register_t)ku->ku_func; 352 td->td_retval[1] = 0; 353} 354