1 /* $NetBSD: vmparam.h,v 1.37 2000/06/18 18:29:04 castor Exp $ */ 2 3 /*- 4 * Copyright (c) 1990 The Regents of the University of California. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * William Jolitz. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * @(#)vmparam.h 5.9 (Berkeley) 5/12/91 39 */ 40 41 #ifndef _VMPARAM_H_ 42 #define _VMPARAM_H_ 43 44 /* 45 * Machine dependent constants for 386. 46 */ 47 48 /* 49 * Virtual address space arrangement. On 386, both user and kernel 50 * share the address space, not unlike the vax. 51 * USRTEXT is the start of the user text/data space, while USRSTACK 52 * is the top (end) of the user stack. Immediately above the user stack 53 * resides the user structure, which is UPAGES long and contains the 54 * kernel stack. 55 * 56 * Immediately after the user structure is the page table map, and then 57 * kernal address space. 58 */ 59 #define USRTEXT NBPG 60 #define USRSTACK VM_MAXUSER_ADDRESS 61 62 /* 63 * Virtual memory related constants, all in bytes 64 */ 65 #define MAXTSIZ (64*1024*1024) /* max text size */ 66 #ifndef DFLDSIZ 67 #define DFLDSIZ (128*1024*1024) /* initial data size limit */ 68 #endif 69 #ifndef MAXDSIZ 70 #define MAXDSIZ (1*1024*1024*1024) /* max data size */ 71 #endif 72 #ifndef DFLSSIZ 73 #define DFLSSIZ (2*1024*1024) /* initial stack size limit */ 74 #endif 75 #ifndef MAXSSIZ 76 #define MAXSSIZ (32*1024*1024) /* max stack size */ 77 #endif 78 79 /* 80 * Size of shared memory map 81 */ 82 #ifndef SHMMAXPGS 83 #define SHMMAXPGS 1024 84 #endif 85 86 /* 87 * Size of User Raw I/O map 88 */ 89 #define USRIOSIZE 300 90 91 /* 92 * The time for a process to be blocked before being very swappable. 93 * This is a number of seconds which the system takes as being a non-trivial 94 * amount of real time. You probably shouldn't change this; 95 * it is used in subtle ways (fractions and multiples of it are, that is, like 96 * half of a ``long time'', almost a long time, etc.) 97 * It is related to human patience and other factors which don't really 98 * change over time. 99 */ 100 #define MAXSLP 20 101 102 /* 103 * Mach derived constants 104 */ 105 106 /* user/kernel map constants */ 107 #define VM_MIN_ADDRESS ((vaddr_t)0) 108 /* (PDSLOT_PTE << PDSHIFT) - UPAGES*NBPG */ 109 #define VM_MAXUSER_ADDRESS ((vaddr_t)0xbfbfe000) 110 /* (PDSLOT_PTE << PDSHIFT) + (PDSLOT_PTE << PGSHIFT) */ 111 #define VM_MAX_ADDRESS ((vaddr_t)0xbfeff000) 112 /* PDSLOT_KERN << PDSHIFT */ 113 #define VM_MIN_KERNEL_ADDRESS ((vaddr_t)0xc0000000) 114 /* PDSLOT_APTE << PDSHIFT */ 115 #define VM_MAX_KERNEL_ADDRESS ((vaddr_t)0xffc00000) 116 117 /* XXX max. amount of KVM to be used by buffers. */ 118 #ifndef VM_MAX_KERNEL_BUF 119 #define VM_MAX_KERNEL_BUF \ 120 ((VM_MAX_KERNEL_ADDRESS - VM_MIN_KERNEL_ADDRESS) / 1024 * 7 / 10 * 1024) 121 #endif 122 123 /* virtual sizes (bytes) for various kernel submaps */ 124 #define VM_PHYS_SIZE (USRIOSIZE*NBPG) 125 126 #define VM_PHYSSEG_MAX 3 /* 1 "hole" + 2 free lists */ 127 #define VM_PHYSSEG_STRAT VM_PSTRAT_BIGFIRST 128 #define VM_PHYSSEG_NOADD /* can't add RAM after vm_mem_init */ 129 130 #define VM_NFREELIST 2 131 #define VM_FREELIST_DEFAULT 0 132 #define VM_FREELIST_FIRST16 1 133 134 /* 135 * pmap specific data stored in the vm_physmem[] array 136 */ 137 struct pmap_physseg { 138 struct pv_head *pvhead; /* pv_head array */ 139 char *attrs; /* attrs array */ 140 }; 141 142 #endif /* _VMPARAM_H_ */ 143