320 lines
9.3 KiB
C
320 lines
9.3 KiB
C
/*
|
|
* Copyright (c) 1988 University of Utah.
|
|
* Copyright (c) 1982, 1990 The Regents of the University of California.
|
|
* All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* the Systems Programming Group of the University of Utah Computer
|
|
* Science Department.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
/*
|
|
* from: Utah $Hdr: vm_machdep.c 1.21 91/04/06$
|
|
*
|
|
* from: @(#)vm_machdep.c 7.10 (Berkeley) 5/7/91
|
|
* $Id: vm_machdep.c,v 1.8 1994/06/26 13:03:42 briggs Exp $
|
|
*/
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/malloc.h>
|
|
#include <sys/buf.h>
|
|
#include <sys/user.h>
|
|
#include <sys/vnode.h>
|
|
|
|
#include <machine/cpu.h>
|
|
|
|
#include <vm/vm.h>
|
|
#include <vm/vm_kern.h>
|
|
#include <machine/pte.h>
|
|
|
|
/*
|
|
* Finish a fork operation, with process p2 nearly set up.
|
|
* Copy and update the kernel stack and pcb, making the child
|
|
* ready to run, and marking it so that it can return differently
|
|
* than the parent. Returns 1 in the child process, 0 in the parent.
|
|
* We currently double-map the user area so that the stack is at the same
|
|
* address in each process; in the future we will probably relocate
|
|
* the frame pointers on the stack after copying.
|
|
*/
|
|
cpu_fork(p1, p2)
|
|
register struct proc *p1, *p2;
|
|
{
|
|
register struct user *up = p2->p_addr;
|
|
int offset;
|
|
extern caddr_t getsp();
|
|
extern char kstack[];
|
|
|
|
/* copy over machdep part of struct proc so we don't lose
|
|
any emulator properties of processes */
|
|
bcopy(&p1->p_md, &p2->p_md, sizeof(struct mdproc));
|
|
|
|
/* need to copy current frame pointer */
|
|
p2->p_md.md_regs = p1->p_md.md_regs;
|
|
|
|
/*
|
|
* Copy pcb and stack from proc p1 to p2.
|
|
* We do this as cheaply as possible, copying only the active
|
|
* part of the stack. The stack and pcb need to agree;
|
|
* this is tricky, as the final pcb is constructed by savectx,
|
|
* but its frame isn't yet on the stack when the stack is copied.
|
|
* swtch compensates for this when the child eventually runs.
|
|
* This should be done differently, with a single call
|
|
* that copies and updates the pcb+stack,
|
|
* replacing the bcopy and savectx.
|
|
*/
|
|
p2->p_addr->u_pcb = p1->p_addr->u_pcb;
|
|
offset = getsp() - kstack;
|
|
bcopy((caddr_t)kstack + offset, (caddr_t)p2->p_addr + offset,
|
|
(unsigned) ctob(UPAGES) - offset);
|
|
|
|
PMAP_ACTIVATE(&p2->p_vmspace->vm_pmap, &up->u_pcb, 0);
|
|
|
|
/*
|
|
* Arrange for a non-local goto when the new process
|
|
* is started, to resume here, returning nonzero from setjmp.
|
|
*/
|
|
if (savectx(up, 1)) {
|
|
/*
|
|
* Return 1 in child.
|
|
*/
|
|
return (1);
|
|
}
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* cpu_exit is called as the last action during exit.
|
|
* We release the address space and machine-dependent resources,
|
|
* including the memory for the user structure and kernel stack.
|
|
* Once finished, we call switch_exit, which switches to a temporary
|
|
* pcb and stack and never returns. We block memory allocation
|
|
* until switch_exit has made things safe again.
|
|
*/
|
|
|
|
volatile void
|
|
cpu_exit(p)
|
|
struct proc *p;
|
|
{
|
|
static struct pcb nullpcb; /* pcb to overwrite on last swtch */
|
|
int ii;
|
|
|
|
vmspace_free(p->p_vmspace);
|
|
|
|
(void) splimp();
|
|
kmem_free(kernel_map, (vm_offset_t)p->p_addr, ctob(UPAGES));
|
|
|
|
switch_exit();
|
|
for(;;); /* Get rid of a compile warning */
|
|
/* NOTREACHED */
|
|
}
|
|
|
|
/*
|
|
* Dump the machine specific header information at the start of a core dump.
|
|
* (Copied from i386/vm_machdep.c, 23May1994)
|
|
*/
|
|
cpu_coredump(p, vp, cred)
|
|
struct proc *p;
|
|
struct vnode *vp;
|
|
struct ucred *cred;
|
|
{
|
|
|
|
return (vn_rdwr(UIO_WRITE, vp, (caddr_t) p->p_addr, ctob(UPAGES),
|
|
(off_t)0, UIO_SYSSPACE, IO_NODELOCKED|IO_UNIT, cred, (int *)NULL,
|
|
p));
|
|
}
|
|
|
|
/*
|
|
* Move pages from one kernel virtual address to another.
|
|
* Both addresses are assumed to reside in the Sysmap,
|
|
* and size must be a multiple of CLSIZE.
|
|
*/
|
|
pagemove(from, to, size)
|
|
register caddr_t from, to;
|
|
int size;
|
|
{
|
|
register struct pte *fpte, *tpte;
|
|
|
|
if (size % CLBYTES)
|
|
panic("pagemove");
|
|
fpte = kvtopte(from);
|
|
tpte = kvtopte(to);
|
|
while (size > 0) {
|
|
*tpte++ = *fpte;
|
|
*(int *)fpte++ = PG_NV;
|
|
TBIS(from);
|
|
TBIS(to);
|
|
from += NBPG;
|
|
to += NBPG;
|
|
size -= NBPG;
|
|
}
|
|
DCIS();
|
|
}
|
|
|
|
/*
|
|
* Map `size' bytes of physical memory starting at `paddr' into
|
|
* kernel VA space at `vaddr'. Read/write and cache-inhibit status
|
|
* are specified by `prot'.
|
|
*/
|
|
physaccess(vaddr, paddr, size, prot)
|
|
caddr_t vaddr, paddr;
|
|
register int size, prot;
|
|
{
|
|
register struct pte *pte;
|
|
register u_int page;
|
|
extern u_int cache_copyback;
|
|
|
|
if (cpu040 && (prot & PG_CI) == 0) /* if cache not inhibited */
|
|
prot |= cache_copyback; /* set cacheable, copyback */
|
|
pte = kvtopte(vaddr);
|
|
page = (u_int)paddr & PG_FRAME;
|
|
for (size = btoc(size); size; size--) {
|
|
*(int *)pte++ = PG_V | prot | page;
|
|
page += NBPG;
|
|
}
|
|
TBIAS();
|
|
}
|
|
|
|
physunaccess(vaddr, size)
|
|
caddr_t vaddr;
|
|
register int size;
|
|
{
|
|
register struct pte *pte;
|
|
|
|
pte = kvtopte(vaddr);
|
|
for (size = btoc(size); size; size--)
|
|
*(int *)pte++ = PG_NV;
|
|
TBIAS();
|
|
}
|
|
|
|
/*
|
|
* Set a red zone in the kernel stack after the u. area.
|
|
* We don't support a redzone right now. It really isn't clear
|
|
* that it is a good idea since, if the kernel stack were to roll
|
|
* into a write protected page, the processor would lock up (since
|
|
* it cannot create an exception frame) and we would get no useful
|
|
* post-mortem info. Currently, under the DEBUG option, we just
|
|
* check at every clock interrupt to see if the current k-stack has
|
|
* gone too far (i.e. into the "redzone" page) and if so, panic.
|
|
* Look at _lev6intr in locore.s for more details.
|
|
*/
|
|
/*ARGSUSED*/
|
|
setredzone(pte, vaddr)
|
|
struct pte *pte;
|
|
caddr_t vaddr;
|
|
{
|
|
}
|
|
|
|
/*
|
|
* Convert kernel VA to physical address
|
|
*/
|
|
kvtop(addr)
|
|
register caddr_t addr;
|
|
{
|
|
vm_offset_t va;
|
|
|
|
va = pmap_extract(kernel_pmap, (vm_offset_t)addr);
|
|
if (va == 0)
|
|
panic("kvtop: zero page frame");
|
|
return((int)va);
|
|
}
|
|
|
|
extern vm_map_t phys_map;
|
|
|
|
/*
|
|
* Map an IO request into kernel virtual address space. Requests fall into
|
|
* one of five catagories:
|
|
*
|
|
* B_PHYS|B_UAREA: User u-area swap.
|
|
* Address is relative to start of u-area (p_addr).
|
|
* B_PHYS|B_PAGET: User page table swap.
|
|
* Address is a kernel VA in usrpt (Usrptmap).
|
|
* B_PHYS|B_DIRTY: Dirty page push.
|
|
* Address is a VA in proc2's address space.
|
|
* B_PHYS|B_PGIN: Kernel pagein of user pages.
|
|
* Address is VA in user's address space.
|
|
* B_PHYS: User "raw" IO request.
|
|
* Address is VA in user's address space.
|
|
*
|
|
* All requests are (re)mapped into kernel VA space via the useriomap
|
|
* (a name with only slightly more meaning than "kernelmap")
|
|
*/
|
|
vmapbuf(bp)
|
|
register struct buf *bp;
|
|
{
|
|
register int npf;
|
|
register caddr_t addr;
|
|
register long flags = bp->b_flags;
|
|
struct proc *p;
|
|
int off;
|
|
vm_offset_t kva;
|
|
register vm_offset_t pa;
|
|
|
|
if ((flags & B_PHYS) == 0)
|
|
panic("vmapbuf");
|
|
addr = bp->b_saveaddr = bp->b_un.b_addr;
|
|
off = (int)addr & PGOFSET;
|
|
p = bp->b_proc;
|
|
npf = btoc(round_page(bp->b_bcount + off));
|
|
kva = kmem_alloc_wait(phys_map, ctob(npf));
|
|
bp->b_un.b_addr = (caddr_t) (kva + off);
|
|
while (npf--) {
|
|
pa = pmap_extract(vm_map_pmap(&p->p_vmspace->vm_map),
|
|
(vm_offset_t)addr);
|
|
if (pa == 0)
|
|
panic("vmapbuf: null page frame");
|
|
pmap_enter(vm_map_pmap(phys_map), kva, trunc_page(pa),
|
|
VM_PROT_READ|VM_PROT_WRITE, TRUE);
|
|
addr += PAGE_SIZE;
|
|
kva += PAGE_SIZE;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Free the io map PTEs associated with this IO operation.
|
|
* We also invalidate the TLB entries and restore the original b_addr.
|
|
*/
|
|
vunmapbuf(bp)
|
|
register struct buf *bp;
|
|
{
|
|
register int npf;
|
|
register caddr_t addr = bp->b_un.b_addr;
|
|
vm_offset_t kva;
|
|
|
|
if ((bp->b_flags & B_PHYS) == 0)
|
|
panic("vunmapbuf");
|
|
npf = btoc(round_page(bp->b_bcount + ((int)addr & PGOFSET)));
|
|
kva = (vm_offset_t)((int)addr & ~PGOFSET);
|
|
kmem_free_wakeup(phys_map, kva, ctob(npf));
|
|
bp->b_un.b_addr = bp->b_saveaddr;
|
|
bp->b_saveaddr = NULL;
|
|
}
|