vmparam.h revision 1.22
1 /* $NetBSD: vmparam.h,v 1.22 2002/12/10 05:14:34 thorpej 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 * USRSTACK is the top (end) of the user stack. 56 */ 57 #define USRSTACK32 0xffffe000L 58 #ifdef __arch64__ 59 #define USRSTACK 0xffffffffffffe000L 60 #else 61 #define USRSTACK USRSTACK32 62 #endif 63 64 /* 65 * Virtual memory related constants, all in bytes 66 */ 67 /* #ifdef __arch64__ */ 68 #if 0 69 /* 70 * 64-bit limits: 71 * 72 * Since the compiler generates `call' instructions we can't 73 * have more than 4GB in a single text segment. 74 * 75 * And since we only have a 40-bit adderss space, allow half 76 * of that for data and the other half for stack. 77 */ 78 #ifndef MAXTSIZ 79 #define MAXTSIZ (4L*1024*1024*1024) /* max text size */ 80 #endif 81 #ifndef DFLDSIZ 82 #define DFLDSIZ (128L*1024*1024) /* initial data size limit */ 83 #endif 84 #ifndef MAXDSIZ 85 #define MAXDSIZ (1L<<39) /* max data size */ 86 #endif 87 #ifndef DFLSSIZ 88 #define DFLSSIZ (2*1024*1024) /* initial stack size limit */ 89 #endif 90 #ifndef MAXSSIZ 91 #define MAXSSIZ MAXDSIZ /* max stack size */ 92 #endif 93 #else 94 /* 95 * 32-bit limits: 96 * 97 * We only have 4GB to play with. Limit stack, data, and text 98 * each to half of that. 99 * 100 * This is silly. Apparently if we go above these numbers 101 * integer overflows in other parts of the kernel cause hangs. 102 */ 103 #ifndef MAXTSIZ 104 #define MAXTSIZ (1*1024*1024*1024) /* max text size */ 105 #endif 106 #ifndef DFLDSIZ 107 #define DFLDSIZ (128*1024*1024) /* initial data size limit */ 108 #endif 109 #ifndef MAXDSIZ 110 #define MAXDSIZ (1*1024*1024*1024) /* max data size */ 111 #endif 112 #ifndef DFLSSIZ 113 #define DFLSSIZ (2*1024*1024) /* initial stack size limit */ 114 #endif 115 #ifndef MAXSSIZ 116 #define MAXSSIZ (8*1024*1024) /* max stack size */ 117 #endif 118 #endif 119 /* 120 * Size of shared memory map 121 */ 122 #ifndef SHMMAXPGS 123 #define SHMMAXPGS 1024 124 #endif 125 126 /* 127 * Mach derived constants 128 */ 129 130 /* 131 * User/kernel map constants. 132 */ 133 #define VM_MIN_ADDRESS ((vaddr_t)0) 134 #define VM_MAX_ADDRESS ((vaddr_t)-1) 135 #define VM_MAXUSER_ADDRESS ((vaddr_t)-1) 136 #define VM_MAXUSER_ADDRESS32 ((vaddr_t)(0x00000000ffffffffL&~PGOFSET)) 137 138 #define VM_MIN_KERNEL_ADDRESS ((vaddr_t)KERNBASE) 139 #define VM_MAX_KERNEL_ADDRESS ((vaddr_t)KERNEND) 140 141 #define VM_PHYSSEG_MAX 32 /* up to 32 segments */ 142 #define VM_PHYSSEG_STRAT VM_PSTRAT_BSEARCH 143 #define VM_PHYSSEG_NOADD /* can't add RAM after vm_mem_init */ 144 145 #define VM_NFREELIST 1 146 #define VM_FREELIST_DEFAULT 0 147 148 #ifdef _KERNEL 149 150 #define __HAVE_VM_PAGE_MD 151 152 /* 153 * For each struct vm_page, there is a list of all currently valid virtual 154 * mappings of that page. An entry is a pv_entry_t. 155 */ 156 struct pmap; 157 typedef struct pv_entry { 158 struct pv_entry *pv_next; /* next pv_entry */ 159 struct pmap *pv_pmap; /* pmap where mapping lies */ 160 vaddr_t pv_va; /* virtual address for mapping */ 161 } *pv_entry_t; 162 /* PV flags encoded in the low bits of the VA of the first pv_entry */ 163 164 struct vm_page_md { 165 struct pv_entry mdpg_pvh; 166 }; 167 #define VM_MDPAGE_INIT(pg) \ 168 do { \ 169 (pg)->mdpage.mdpg_pvh.pv_next = NULL; \ 170 (pg)->mdpage.mdpg_pvh.pv_pmap = NULL; \ 171 (pg)->mdpage.mdpg_pvh.pv_va = NULL; \ 172 } while (/*CONSTCOND*/0) 173 174 #endif /* _KERNEL */ 175 176 #if defined (_KERNEL) && !defined(_LOCORE) 177 struct vm_map; 178 vaddr_t dvma_mapin __P((struct vm_map *, vaddr_t, int, int)); 179 void dvma_mapout __P((vaddr_t, vaddr_t, int)); 180 #endif 181 #endif 182
Indexes created Tue Sep 30 11:09:46 GMT 2025