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
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.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
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.
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
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: src/sys/i386/i386/vm_machdep.c,v 1.132.2.9 2003/01/25 19:02:23 dillon Exp $
42 * $DragonFly: src/sys/platform/vkernel/i386/vm_machdep.c,v 1.10 2008/08/02 05:22:21 dillon Exp $
48 #include <sys/param.h>
49 #include <sys/systm.h>
50 #include <sys/malloc.h>
53 #include <sys/interrupt.h>
54 #include <sys/vnode.h>
55 #include <sys/vmmeter.h>
56 #include <sys/kernel.h>
57 #include <sys/sysctl.h>
58 #include <sys/unistd.h>
60 #include <machine/clock.h>
61 #include <machine/cpu.h>
62 #include <machine/md_var.h>
63 #include <machine/smp.h>
64 #include <machine/pcb.h>
65 #include <machine/pcb_ext.h>
66 #include <machine/vm86.h>
67 #include <machine/segments.h>
68 #include <machine/globaldata.h> /* npxthread */
71 #include <vm/vm_param.h>
73 #include <vm/vm_kern.h>
74 #include <vm/vm_page.h>
75 #include <vm/vm_map.h>
76 #include <vm/vm_extern.h>
80 #include <sys/thread2.h>
81 #include <sys/mplock2.h>
83 #include <bus/isa/isa.h>
88 char machine
[] = MACHINE
;
89 SYSCTL_STRING(_hw
, HW_MACHINE
, machine
, CTLFLAG_RD
,
90 machine
, 0, "Machine class");
92 char cpu_vendor
[] = "DragonFly"; /* XXX */
93 u_int cpu_id
= 0x80000000; /* XXX */
96 * Finish a fork operation, with lwp lp2 nearly set up.
97 * Copy and update the pcb, set up the stack so that the child
98 * ready to run and return to user mode.
101 cpu_fork(struct lwp
*lp1
, struct lwp
*lp2
, int flags
)
105 if ((flags
& RFPROC
) == 0) {
106 if ((flags
& RFMEM
) == 0) {
107 /* unshare user LDT */
108 struct pcb
*pcb1
= lp1
->lwp_thread
->td_pcb
;
109 struct pcb_ldt
*pcb_ldt
= pcb1
->pcb_ldt
;
110 if (pcb_ldt
&& pcb_ldt
->ldt_refcnt
> 1) {
111 pcb_ldt
= user_ldt_alloc(pcb1
,pcb_ldt
->ldt_len
);
113 pcb1
->pcb_ldt
= pcb_ldt
;
121 /* Ensure that lp1's pcb is up to date. */
122 if (mdcpu
->gd_npxthread
== lp1
->lwp_thread
)
123 npxsave(lp1
->lwp_thread
->td_savefpu
);
127 * Copy lp1's PCB. This really only applies to the
128 * debug registers and FP state, but its faster to just copy the
129 * whole thing. Because we only save the PCB at switchout time,
130 * the register state may not be current.
132 pcb2
= lp2
->lwp_thread
->td_pcb
;
133 *pcb2
= *lp1
->lwp_thread
->td_pcb
;
136 * Create a new fresh stack for the new process.
137 * Copy the trap frame for the return to user mode as if from a
138 * syscall. This copies the user mode register values. The
139 * 16 byte offset saves space for vm86, and must match
140 * common_tss.esp0 (kernel stack pointer on entry from user mode)
142 * pcb_esp must allocate an additional call-return pointer below
143 * the trap frame which will be restored by cpu_restore from
144 * PCB_EIP, and the thread's td_sp pointer must allocate an
145 * additonal two worsd below the pcb_esp call-return pointer to
146 * hold the LWKT restore function pointer and eflags.
148 * The LWKT restore function pointer must be set to cpu_restore,
149 * which is our standard heavy weight process switch-in function.
150 * YYY eventually we should shortcut fork_return and fork_trampoline
151 * to use the LWKT restore function directly so we can get rid of
152 * all the extra crap we are setting up.
154 lp2
->lwp_md
.md_regs
= (struct trapframe
*)((char *)pcb2
- 16) - 1;
155 bcopy(lp1
->lwp_md
.md_regs
, lp2
->lwp_md
.md_regs
, sizeof(*lp2
->lwp_md
.md_regs
));
158 * Set registers for trampoline to user mode. Leave space for the
159 * return address on stack. These are the kernel mode register values.
161 pcb2
->pcb_unused01
= 0;
163 pcb2
->pcb_esi
= (int)fork_return
; /* fork_trampoline argument */
165 pcb2
->pcb_esp
= (int)lp2
->lwp_md
.md_regs
- sizeof(void *);
166 pcb2
->pcb_ebx
= (int)lp2
; /* fork_trampoline argument */
167 pcb2
->pcb_eip
= (int)fork_trampoline
;
168 lp2
->lwp_thread
->td_sp
= (char *)(pcb2
->pcb_esp
- sizeof(void *));
169 *(u_int32_t
*)lp2
->lwp_thread
->td_sp
= PSL_USER
;
170 lp2
->lwp_thread
->td_sp
-= sizeof(void *);
171 *(void **)lp2
->lwp_thread
->td_sp
= (void *)cpu_heavy_restore
;
174 * pcb2->pcb_ldt: duplicated below, if necessary.
175 * pcb2->pcb_savefpu: cloned above.
176 * pcb2->pcb_flags: cloned above (always 0 here?).
177 * pcb2->pcb_onfault: cloned above (always NULL here?).
181 * XXX don't copy the i/o pages. this should probably be fixed.
185 /* Copy the LDT, if necessary. */
186 if (pcb2
->pcb_ldt
!= 0) {
188 pcb2
->pcb_ldt
->ldt_refcnt
++;
190 pcb2
->pcb_ldt
= user_ldt_alloc(pcb2
,
191 pcb2
->pcb_ldt
->ldt_len
);
194 bcopy(&lp1
->lwp_thread
->td_tls
, &lp2
->lwp_thread
->td_tls
,
195 sizeof(lp2
->lwp_thread
->td_tls
));
197 * Now, cpu_switch() can schedule the new process.
198 * pcb_esp is loaded pointing to the cpu_switch() stack frame
199 * containing the return address when exiting cpu_switch.
200 * This will normally be to fork_trampoline(), which will have
201 * %ebx loaded with the new proc's pointer. fork_trampoline()
202 * will set up a stack to call fork_return(p, frame); to complete
203 * the return to user-mode.
208 * Prepare new lwp to return to the address specified in params.
211 cpu_prepare_lwp(struct lwp
*lp
, struct lwp_params
*params
)
213 struct trapframe
*regs
= lp
->lwp_md
.md_regs
;
214 void *bad_return
= NULL
;
217 regs
->tf_eip
= (int)params
->func
;
218 regs
->tf_esp
= (int)params
->stack
;
219 /* Set up argument for function call */
220 regs
->tf_esp
-= sizeof(params
->arg
);
221 error
= copyout(¶ms
->arg
, (void *)regs
->tf_esp
,
222 sizeof(params
->arg
));
226 * Set up fake return address. As the lwp function may never return,
227 * we simply copy out a NULL pointer and force the lwp to receive
228 * a SIGSEGV if it returns anyways.
230 regs
->tf_esp
-= sizeof(void *);
231 error
= copyout(&bad_return
, (void *)regs
->tf_esp
,
236 cpu_set_fork_handler(lp
,
237 (void (*)(void *, struct trapframe
*))generic_lwp_return
, lp
);
242 * Intercept the return address from a freshly forked process that has NOT
243 * been scheduled yet.
245 * This is needed to make kernel threads stay in kernel mode.
248 cpu_set_fork_handler(struct lwp
*lp
, void (*func
)(void *, struct trapframe
*),
252 * Note that the trap frame follows the args, so the function
253 * is really called like this: func(arg, frame);
255 lp
->lwp_thread
->td_pcb
->pcb_esi
= (int) func
; /* function */
256 lp
->lwp_thread
->td_pcb
->pcb_ebx
= (int) arg
; /* first arg */
260 cpu_set_thread_handler(thread_t td
, void (*rfunc
)(void), void *func
, void *arg
)
262 td
->td_pcb
->pcb_esi
= (int)func
;
263 td
->td_pcb
->pcb_ebx
= (int) arg
;
264 td
->td_switch
= cpu_lwkt_switch
;
265 td
->td_sp
-= sizeof(void *);
266 *(void **)td
->td_sp
= rfunc
; /* exit function on return */
267 td
->td_sp
-= sizeof(void *);
268 *(void **)td
->td_sp
= cpu_kthread_restore
;
274 struct thread
*td
= curthread
;
283 * If we were using a private TSS do a forced-switch to ourselves
284 * to switch back to the common TSS before freeing it.
287 if ((ext
= pcb
->pcb_ext
) != NULL
) {
292 kmem_free(&kernel_map
, (vm_offset_t
)ext
, ctob(IOPAGES
+ 1));
295 if (pcb
->pcb_flags
& PCB_DBREGS
) {
297 * disable all hardware breakpoints
300 pcb
->pcb_flags
&= ~PCB_DBREGS
;
302 td
->td_gd
->gd_cnt
.v_swtch
++;
304 crit_enter_quick(td
);
305 if (td
->td_flags
& TDF_TSLEEPQ
)
307 lwkt_deschedule_self(td
);
308 lwkt_remove_tdallq(td
);
313 * Terminate the current thread. The caller must have already acquired
314 * the thread's rwlock and placed it on a reap list or otherwise notified
315 * a reaper of its existance. We set a special assembly switch function which
316 * releases td_rwlock after it has cleaned up the MMU state and switched
319 * Must be caller from a critical section and with the thread descheduled.
322 cpu_thread_exit(void)
324 curthread
->td_switch
= cpu_exit_switch
;
325 curthread
->td_flags
|= TDF_EXITING
;
331 * Process Reaper. Called after the caller has acquired the thread's
332 * rwlock and removed it from the reap list.
335 cpu_proc_wait(struct proc
*p
)
337 /* drop per-process resources */
338 pmap_dispose_proc(p
);
343 setredzone(u_short
*pte
, caddr_t vaddr
)
345 /* eventually do this by setting up an expand-down stack segment
346 for ss0: selector, allowing stack access down to top of u.
347 this means though that protection violations need to be handled
348 thru a double fault exception that must do an integral task
349 switch to a known good context, within which a dump can be
350 taken. a sensible scheme might be to save the initial context
351 used by sched (that has physical memory mapped 1:1 at bottom)
352 and take the dump while still in mapped mode */
357 * Convert kernel VA to physical address
364 pa
= pmap_kextract((vm_offset_t
)addr
);
366 panic("kvtop: zero page frame");
370 SYSCTL_DECL(_vm_stats_misc
);
373 * Tell whether this address is in some physical memory region.
374 * Currently used by the kernel coredump code in order to avoid
375 * dumping the ``ISA memory hole'' which could cause indefinite hangs,
376 * or other unpredictable behaviour.
380 is_physical_memory(vm_offset_t addr
)
386 * Used by /dev/kmem to determine if we can safely read or write
387 * the requested KVA range. Some portions of kernel memory are
388 * not governed by our virtual page table.
391 extern void _start(void);
394 kvm_access_check(vm_offset_t saddr
, vm_offset_t eaddr
, int prot
)
398 if (saddr
>= trunc_page((vm_offset_t
)&_start
) && eaddr
<= round_page((vm_offset_t
)&_end
))
400 if (saddr
< KvaStart
)
404 for (addr
= saddr
; addr
< eaddr
; addr
+= PAGE_SIZE
) {
405 if (pmap_extract(&kernel_pmap
, addr
) == 0)
408 if (!kernacc((caddr_t
)saddr
, eaddr
- saddr
, prot
))