vmparam.h revision 1.2
1/* $NetBSD: vmparam.h,v 1.2 2000/02/11 19:25:16 thorpej Exp $ */ 2 3/* 4 * Copyright (c) 1988 University of Utah. 5 * Copyright (c) 1982, 1986, 1990, 1993 6 * The Regents of the University of California. All rights reserved. 7 * 8 * This code is derived from software contributed to Berkeley by 9 * the Systems Programming Group of the University of Utah Computer 10 * Science Department. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. All advertising materials mentioning features or use of this software 21 * must display the following acknowledgement: 22 * This product includes software developed by the University of 23 * California, Berkeley and its contributors. 24 * 4. Neither the name of the University nor the names of its contributors 25 * may be used to endorse or promote products derived from this software 26 * without specific prior written permission. 27 * 28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 38 * SUCH DAMAGE. 39 * 40 * from: Utah $Hdr: vmparam.h 1.16 91/01/18$ 41 * 42 * @(#)vmparam.h 8.2 (Berkeley) 4/19/94 43 */ 44 45#ifndef _MACHINE_VMPARAM_H_ 46#define _MACHINE_VMPARAM_H_ 47 48/* 49 * USRTEXT is the start of the user text/data space, while USRSTACK 50 * is the top (end) of the user stack. 51 */ 52#define USRTEXT 8192 53#define USRSTACK VM_MAXUSER_ADDRESS 54 55/* 56 * Virtual memory related constants, all in bytes 57 */ 58#ifndef MAXTSIZ 59#define MAXTSIZ (8*1024*1024) /* max text size */ 60#endif 61#ifndef DFLDSIZ 62#define DFLDSIZ (16*1024*1024) /* initial data size limit */ 63#endif 64#ifndef MAXDSIZ 65#define MAXDSIZ (64*1024*1024) /* max data size */ 66#endif 67#ifndef DFLSSIZ 68#define DFLSSIZ (512*1024) /* initial stack size limit */ 69#endif 70#ifndef MAXSSIZ 71#define MAXSSIZ MAXDSIZ /* max stack size */ 72#endif 73 74/* 75 * Sizes of the system and user portions of the system page table. 76 */ 77/* SYSPTSIZE IS SILLY; IT SHOULD BE COMPUTED AT BOOT TIME */ 78#define SYSPTSIZE (2 * NPTEPG) /* 8mb */ 79#define USRPTSIZE (1 * NPTEPG) /* 4mb */ 80 81/* 82 * PTEs for mapping user space into the kernel for phyio operations. 83 * One page is enough to handle 4Mb of simultaneous raw IO operations. 84 */ 85#ifndef USRIOSIZE 86#define USRIOSIZE (1 * NPTEPG) /* 4mb */ 87#endif 88 89/* 90 * PTEs for system V style shared memory. 91 * This is basically slop for kmempt which we actually allocate (malloc) from. 92 */ 93#ifndef SHMMAXPGS 94#define SHMMAXPGS 1024 /* 8mb */ 95#endif 96 97/* 98 * The time for a process to be blocked before being very swappable. 99 * This is a number of seconds which the system takes as being a non-trivial 100 * amount of real time. You probably shouldn't change this; 101 * it is used in subtle ways (fractions and multiples of it are, that is, like 102 * half of a ``long time'', almost a long time, etc.) 103 * It is related to human patience and other factors which don't really 104 * change over time. 105 */ 106#define MAXSLP 20 107 108/* user/kernel map constants */ 109#define VM_MIN_ADDRESS ((vaddr_t)0) 110#define VM_MAXUSER_ADDRESS ((vaddr_t)0xFFFC0000) 111#define VM_MAX_ADDRESS ((vaddr_t)0xFFFC0000) 112#define VM_MIN_KERNEL_ADDRESS ((vaddr_t)0) 113#define VM_MAX_KERNEL_ADDRESS ((vaddr_t)(0-NBPG)) 114 115/* virtual sizes (bytes) for various kernel submaps */ 116#define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 117#define VM_PHYS_SIZE (USRIOSIZE*NBPG) 118 119/* # of kernel PT pages (initial only, can grow dynamically) */ 120#define VM_KERNEL_PT_PAGES ((vsize_t)2) /* XXX: SYSPTSIZE */ 121 122/* 123 * Constants which control the way the VM system deals with memory segments. 124 * Only one physical contigous memory segment. 125 */ 126#define VM_PHYSSEG_MAX 1 127#define VM_PHYSSEG_STRAT VM_PSTRAT_BSEARCH 128#define VM_PHYSSEG_NOADD 129 130#define VM_NFREELIST 1 131#define VM_FREELIST_DEFAULT 0 132 133/* 134 * pmap-specific data stored in the vm_physmem[] array. 135 */ 136struct pmap_physseg { 137 struct pv_entry *pvent; /* pv table for this seg */ 138 char *attrs; /* page attributes for this seg */ 139}; 140 141#endif /* _MACHINE_VMPARAM_H_ */ 142