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