vm_machdep.c revision 300694
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 */ 42 43#include "opt_compat.h" 44 45#include <sys/cdefs.h> 46__FBSDID("$FreeBSD: head/sys/arm/arm/vm_machdep.c 300694 2016-05-25 19:44:26Z ian $"); 47 48#include <sys/param.h> 49#include <sys/systm.h> 50#include <sys/kernel.h> 51#include <sys/malloc.h> 52#include <sys/mbuf.h> 53#include <sys/proc.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> 59 60#include <machine/cpu.h> 61#include <machine/frame.h> 62#include <machine/pcb.h> 63#include <machine/sysarch.h> 64#include <sys/lock.h> 65#include <sys/mutex.h> 66 67#include <vm/vm.h> 68#include <vm/pmap.h> 69#include <vm/vm_extern.h> 70#include <vm/vm_kern.h> 71#include <vm/vm_page.h> 72#include <vm/vm_map.h> 73#include <vm/vm_param.h> 74#include <vm/vm_pageout.h> 75#include <vm/uma.h> 76#include <vm/uma_int.h> 77 78#include <machine/md_var.h> 79#include <machine/vfp.h> 80 81/* 82 * struct switchframe and trapframe must both be a multiple of 8 83 * for correct stack alignment. 84 */ 85CTASSERT(sizeof(struct switchframe) == 48); 86CTASSERT(sizeof(struct trapframe) == 80); 87 88uint32_t initial_fpscr = VFPSCR_DN | VFPSCR_FZ; 89 90/* 91 * Finish a fork operation, with process p2 nearly set up. 92 * Copy and update the pcb, set up the stack so that the child 93 * ready to run and return to user mode. 94 */ 95void 96cpu_fork(register struct thread *td1, register struct proc *p2, 97 struct thread *td2, int flags) 98{ 99 struct pcb *pcb2; 100 struct trapframe *tf; 101 struct mdproc *mdp2; 102 103 if ((flags & RFPROC) == 0) 104 return; 105 106 /* Point the pcb to the top of the stack */ 107 pcb2 = (struct pcb *) 108 (td2->td_kstack + td2->td_kstack_pages * PAGE_SIZE) - 1; 109#ifdef __XSCALE__ 110#ifndef CPU_XSCALE_CORE3 111 pmap_use_minicache(td2->td_kstack, td2->td_kstack_pages * PAGE_SIZE); 112#endif 113#endif 114 td2->td_pcb = pcb2; 115 116 /* Clone td1's pcb */ 117 bcopy(td1->td_pcb, pcb2, sizeof(*pcb2)); 118 119 /* Point to mdproc and then copy over td1's contents */ 120 mdp2 = &p2->p_md; 121 bcopy(&td1->td_proc->p_md, mdp2, sizeof(*mdp2)); 122 123 /* Point the frame to the stack in front of pcb and copy td1's frame */ 124 td2->td_frame = (struct trapframe *)pcb2 - 1; 125 *td2->td_frame = *td1->td_frame; 126 127 /* 128 * Create a new fresh stack for the new process. 129 * Copy the trap frame for the return to user mode as if from a 130 * syscall. This copies most of the user mode register values. 131 */ 132 pmap_set_pcb_pagedir(vmspace_pmap(p2->p_vmspace), pcb2); 133 pcb2->pcb_regs.sf_r4 = (register_t)fork_return; 134 pcb2->pcb_regs.sf_r5 = (register_t)td2; 135 pcb2->pcb_regs.sf_lr = (register_t)fork_trampoline; 136 pcb2->pcb_regs.sf_sp = STACKALIGN(td2->td_frame); 137 138 pcb2->pcb_vfpcpu = -1; 139 pcb2->pcb_vfpstate.fpscr = initial_fpscr; 140 141 tf = td2->td_frame; 142 tf->tf_spsr &= ~PSR_C; 143 tf->tf_r0 = 0; 144 tf->tf_r1 = 0; 145 146 147 /* Setup to release spin count in fork_exit(). */ 148 td2->td_md.md_spinlock_count = 1; 149 td2->td_md.md_saved_cspr = PSR_SVC32_MODE; 150#if __ARM_ARCH >= 6 151 td2->td_md.md_tp = td1->td_md.md_tp; 152#else 153 td2->td_md.md_tp = *(register_t *)ARM_TP_ADDRESS; 154#endif 155} 156 157void 158cpu_thread_swapin(struct thread *td) 159{ 160} 161 162void 163cpu_thread_swapout(struct thread *td) 164{ 165} 166 167void 168cpu_set_syscall_retval(struct thread *td, int error) 169{ 170 struct trapframe *frame; 171 int fixup; 172#ifdef __ARMEB__ 173 u_int call; 174#endif 175 176 frame = td->td_frame; 177 fixup = 0; 178 179#ifdef __ARMEB__ 180 /* 181 * __syscall returns an off_t while most other syscalls return an 182 * int. As an off_t is 64-bits and an int is 32-bits we need to 183 * place the returned data into r1. As the lseek and freebsd6_lseek 184 * syscalls also return an off_t they do not need this fixup. 185 */ 186 call = frame->tf_r7; 187 if (call == SYS___syscall) { 188 register_t *ap = &frame->tf_r0; 189 register_t code = ap[_QUAD_LOWWORD]; 190 if (td->td_proc->p_sysent->sv_mask) 191 code &= td->td_proc->p_sysent->sv_mask; 192 fixup = (code != SYS_lseek); 193 } 194#endif 195 196 switch (error) { 197 case 0: 198 if (fixup) { 199 frame->tf_r0 = 0; 200 frame->tf_r1 = td->td_retval[0]; 201 } else { 202 frame->tf_r0 = td->td_retval[0]; 203 frame->tf_r1 = td->td_retval[1]; 204 } 205 frame->tf_spsr &= ~PSR_C; /* carry bit */ 206 break; 207 case ERESTART: 208 /* 209 * Reconstruct the pc to point at the swi. 210 */ 211#if __ARM_ARCH >= 7 212 if ((frame->tf_spsr & PSR_T) != 0) 213 frame->tf_pc -= THUMB_INSN_SIZE; 214 else 215#endif 216 frame->tf_pc -= INSN_SIZE; 217 break; 218 case EJUSTRETURN: 219 /* nothing to do */ 220 break; 221 default: 222 frame->tf_r0 = error; 223 frame->tf_spsr |= PSR_C; /* carry bit */ 224 break; 225 } 226} 227 228/* 229 * Initialize machine state (pcb and trap frame) for a new thread about to 230 * upcall. Put enough state in the new thread's PCB to get it to go back 231 * userret(), where we can intercept it again to set the return (upcall) 232 * Address and stack, along with those from upcals that are from other sources 233 * such as those generated in thread_userret() itself. 234 */ 235void 236cpu_set_upcall(struct thread *td, struct thread *td0) 237{ 238 239 bcopy(td0->td_frame, td->td_frame, sizeof(struct trapframe)); 240 bcopy(td0->td_pcb, td->td_pcb, sizeof(struct pcb)); 241 242 td->td_pcb->pcb_regs.sf_r4 = (register_t)fork_return; 243 td->td_pcb->pcb_regs.sf_r5 = (register_t)td; 244 td->td_pcb->pcb_regs.sf_lr = (register_t)fork_trampoline; 245 td->td_pcb->pcb_regs.sf_sp = STACKALIGN(td->td_frame); 246 247 td->td_frame->tf_spsr &= ~PSR_C; 248 td->td_frame->tf_r0 = 0; 249 250 /* Setup to release spin count in fork_exit(). */ 251 td->td_md.md_spinlock_count = 1; 252 td->td_md.md_saved_cspr = PSR_SVC32_MODE; 253} 254 255/* 256 * Set that machine state for performing an upcall that has to 257 * be done in thread_userret() so that those upcalls generated 258 * in thread_userret() itself can be done as well. 259 */ 260void 261cpu_set_upcall_kse(struct thread *td, void (*entry)(void *), void *arg, 262 stack_t *stack) 263{ 264 struct trapframe *tf = td->td_frame; 265 266 tf->tf_usr_sp = STACKALIGN((int)stack->ss_sp + stack->ss_size); 267 tf->tf_pc = (int)entry; 268 tf->tf_r0 = (int)arg; 269 tf->tf_spsr = PSR_USR32_MODE; 270} 271 272int 273cpu_set_user_tls(struct thread *td, void *tls_base) 274{ 275 276 td->td_md.md_tp = (register_t)tls_base; 277 if (td == curthread) { 278 critical_enter(); 279#if __ARM_ARCH >= 6 280 set_tls(tls_base); 281#else 282 *(register_t *)ARM_TP_ADDRESS = (register_t)tls_base; 283#endif 284 critical_exit(); 285 } 286 return (0); 287} 288 289void 290cpu_thread_exit(struct thread *td) 291{ 292} 293 294void 295cpu_thread_alloc(struct thread *td) 296{ 297 td->td_pcb = (struct pcb *)(td->td_kstack + td->td_kstack_pages * 298 PAGE_SIZE) - 1; 299 /* 300 * Ensure td_frame is aligned to an 8 byte boundary as it will be 301 * placed into the stack pointer which must be 8 byte aligned in 302 * the ARM EABI. 303 */ 304 td->td_frame = (struct trapframe *)((caddr_t)td->td_pcb) - 1; 305 306#ifdef __XSCALE__ 307#ifndef CPU_XSCALE_CORE3 308 pmap_use_minicache(td->td_kstack, td->td_kstack_pages * PAGE_SIZE); 309#endif 310#endif 311} 312 313void 314cpu_thread_free(struct thread *td) 315{ 316} 317 318void 319cpu_thread_clean(struct thread *td) 320{ 321} 322 323/* 324 * Intercept the return address from a freshly forked process that has NOT 325 * been scheduled yet. 326 * 327 * This is needed to make kernel threads stay in kernel mode. 328 */ 329void 330cpu_set_fork_handler(struct thread *td, void (*func)(void *), void *arg) 331{ 332 td->td_pcb->pcb_regs.sf_r4 = (register_t)func; /* function */ 333 td->td_pcb->pcb_regs.sf_r5 = (register_t)arg; /* first arg */ 334} 335 336/* 337 * Software interrupt handler for queued VM system processing. 338 */ 339void 340swi_vm(void *dummy) 341{ 342 343 if (busdma_swi_pending) 344 busdma_swi(); 345} 346 347void 348cpu_exit(struct thread *td) 349{ 350} 351 352