1 /* $NetBSD: vmparam.h,v 1.21 2002/09/22 07:19:46 chs Exp $ */ 2 3 /* 4 * Copyright (c) 1992, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This software was developed by the Computer Systems Engineering group 8 * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and 9 * contributed to Berkeley. 10 * 11 * All advertising materials mentioning features or use of this software 12 * must display the following acknowledgement: 13 * This product includes software developed by the University of 14 * California, Lawrence Berkeley Laboratory. 15 * 16 * Redistribution and use in source and binary forms, with or without 17 * modification, are permitted provided that the following conditions 18 * are met: 19 * 1. Redistributions of source code must retain the above copyright 20 * notice, this list of conditions and the following disclaimer. 21 * 2. Redistributions in binary form must reproduce the above copyright 22 * notice, this list of conditions and the following disclaimer in the 23 * documentation and/or other materials provided with the distribution. 24 * 3. All advertising materials mentioning features or use of this software 25 * must display the following acknowledgement: 26 * This product includes software developed by the University of 27 * California, Berkeley and its contributors. 28 * 4. Neither the name of the University nor the names of its contributors 29 * may be used to endorse or promote products derived from this software 30 * without specific prior written permission. 31 * 32 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 33 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 34 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 35 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 36 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 37 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 38 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 39 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 40 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 41 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 42 * SUCH DAMAGE. 43 * 44 * @(#)vmparam.h 8.1 (Berkeley) 6/11/93 45 */ 46 47 /* 48 * Machine dependent constants for Sun-4c SPARC 49 */ 50 51 #ifndef VMPARAM_H 52 #define VMPARAM_H 53 54 /* 55 * USRTEXT is the start of the user text/data space, while USRSTACK 56 * is the top (end) of the user stack. 57 */ 58 #define USRTEXT 0x2000 /* Start of user text */ 59 #define USRSTACK32 0xffffe000L 60 #ifdef __arch64__ 61 #define USRSTACK 0xffffffffffffe000L 62 #else 63 #define USRSTACK USRSTACK32 64 #endif 65 66 /* 67 * Virtual memory related constants, all in bytes 68 */ 69 /* #ifdef __arch64__ */ 70 #if 0 71 /* 72 * 64-bit limits: 73 * 74 * Since the compiler generates `call' instructions we can't 75 * have more than 4GB in a single text segment. 76 * 77 * And since we only have a 40-bit adderss space, allow half 78 * of that for data and the other half for stack. 79 */ 80 #ifndef MAXTSIZ 81 #define MAXTSIZ (4L*1024*1024*1024) /* max text size */ 82 #endif 83 #ifndef DFLDSIZ 84 #define DFLDSIZ (128L*1024*1024) /* initial data size limit */ 85 #endif 86 #ifndef MAXDSIZ 87 #define MAXDSIZ (1L<<39) /* max data size */ 88 #endif 89 #ifndef DFLSSIZ 90 #define DFLSSIZ (2*1024*1024) /* initial stack size limit */ 91 #endif 92 #ifndef MAXSSIZ 93 #define MAXSSIZ MAXDSIZ /* max stack size */ 94 #endif 95 #else 96 /* 97 * 32-bit limits: 98 * 99 * We only have 4GB to play with. Limit stack, data, and text 100 * each to half of that. 101 * 102 * This is silly. Apparently if we go above these numbers 103 * integer overflows in other parts of the kernel cause hangs. 104 */ 105 #ifndef MAXTSIZ 106 #define MAXTSIZ (1*1024*1024*1024) /* max text size */ 107 #endif 108 #ifndef DFLDSIZ 109 #define DFLDSIZ (128*1024*1024) /* initial data size limit */ 110 #endif 111 #ifndef MAXDSIZ 112 #define MAXDSIZ (1*1024*1024*1024) /* max data size */ 113 #endif 114 #ifndef DFLSSIZ 115 #define DFLSSIZ (2*1024*1024) /* initial stack size limit */ 116 #endif 117 #ifndef MAXSSIZ 118 #define MAXSSIZ (8*1024*1024) /* max stack size */ 119 #endif 120 #endif 121 /* 122 * Size of shared memory map 123 */ 124 #ifndef SHMMAXPGS 125 #define SHMMAXPGS 1024 126 #endif 127 128 /* 129 * Mach derived constants 130 */ 131 132 /* 133 * User/kernel map constants. 134 */ 135 #define VM_MIN_ADDRESS ((vaddr_t)0) 136 #define VM_MAX_ADDRESS ((vaddr_t)-1) 137 #define VM_MAXUSER_ADDRESS ((vaddr_t)-1) 138 #define VM_MAXUSER_ADDRESS32 ((vaddr_t)(0x00000000ffffffffL&~PGOFSET)) 139 140 #define VM_MIN_KERNEL_ADDRESS ((vaddr_t)KERNBASE) 141 #define VM_MAX_KERNEL_ADDRESS ((vaddr_t)KERNEND) 142 143 #define VM_PHYSSEG_MAX 32 /* up to 32 segments */ 144 #define VM_PHYSSEG_STRAT VM_PSTRAT_BSEARCH 145 #define VM_PHYSSEG_NOADD /* can't add RAM after vm_mem_init */ 146 147 #define VM_NFREELIST 1 148 #define VM_FREELIST_DEFAULT 0 149 150 #ifdef _KERNEL 151 152 #define __HAVE_VM_PAGE_MD 153 154 /* 155 * For each struct vm_page, there is a list of all currently valid virtual 156 * mappings of that page. An entry is a pv_entry_t. 157 */ 158 struct pmap; 159 typedef struct pv_entry { 160 struct pv_entry *pv_next; /* next pv_entry */ 161 struct pmap *pv_pmap; /* pmap where mapping lies */ 162 vaddr_t pv_va; /* virtual address for mapping */ 163 } *pv_entry_t; 164 /* PV flags encoded in the low bits of the VA of the first pv_entry */ 165 166 struct vm_page_md { 167 struct pv_entry mdpg_pvh; 168 }; 169 #define VM_MDPAGE_INIT(pg) \ 170 do { \ 171 (pg)->mdpage.mdpg_pvh.pv_next = NULL; \ 172 (pg)->mdpage.mdpg_pvh.pv_pmap = NULL; \ 173 (pg)->mdpage.mdpg_pvh.pv_va = NULL; \ 174 } while (/*CONSTCOND*/0) 175 176 #endif /* _KERNEL */ 177 178 #if defined (_KERNEL) && !defined(_LOCORE) 179 struct vm_map; 180 vaddr_t dvma_mapin __P((struct vm_map *, vaddr_t, int, int)); 181 void dvma_mapout __P((vaddr_t, vaddr_t, int)); 182 #endif 183 #endif 184