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