1 /* $NetBSD: vmparam.h,v 1.37 2016/03/26 11:49:10 martin 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 4U and 4V UltraSPARC 45 */ 46 47 #ifndef VMPARAM_H 48 #define VMPARAM_H 49 50 #define __USE_TOPDOWN_VM 51 52 /* 53 * We use 8K VM pages on the Sun4U. Override the PAGE_* definitions 54 * to be compile-time constants. 55 */ 56 #define PAGE_SHIFT 13 57 #define PAGE_SIZE (1 << PAGE_SHIFT) 58 #define PAGE_MASK (PAGE_SIZE - 1) 59 60 /* 61 * The kernel itself is mapped by the boot loader with 4Mb locked VM pages, 62 * so let's keep 4Mb definitions here as well. 63 */ 64 #define PAGE_SHIFT_4M 22 65 #define PAGE_SIZE_4M (1UL<<PAGE_SHIFT_4M) 66 #define PAGE_MASK_4M (PAGE_SIZE_4M-1) 67 68 /* 69 * USRSTACK is the top (end) of the user stack. 70 */ 71 #define USRSTACK32 0xffffe000L 72 #ifdef __arch64__ 73 #define USRSTACK 0xffffffffffffe000L 74 #else 75 #define USRSTACK USRSTACK32 76 #endif 77 78 /* 79 * Virtual memory related constants, all in bytes 80 */ 81 #if __arch64__ 82 /* 83 * 64-bit limits: 84 * 85 * Since the compiler generates `call' instructions we can't 86 * have more than 4GB in a single text segment. 87 * 88 * And since we only have a 40-bit adderss space, allow half 89 * of that for data and the other half for stack. 90 */ 91 #ifndef MAXTSIZ 92 #define MAXTSIZ (4UL*1024*1024*1024) /* max text size */ 93 #endif 94 #ifndef DFLDSIZ 95 #define DFLDSIZ (128UL*1024*1024) /* initial data size limit */ 96 #endif 97 #ifndef MAXDSIZ 98 #define MAXDSIZ (1UL<<39) /* max data size */ 99 /* 100 * For processes not using topdown VA, we need to limit the data size - 101 * they probably have not been compiled with the proper compiler memory 102 * model. 103 */ 104 #define VM_DEFAULT_ADDRESS_BOTTOMUP(da, sz) \ 105 round_page((vaddr_t)(da) + (vsize_t)max(maxdmap,1UL*1024*1024*1024)) 106 #endif 107 #ifndef DFLSSIZ 108 #define DFLSSIZ (2*1024*1024) /* initial stack size limit */ 109 #endif 110 #ifndef MAXSSIZ 111 #define MAXSSIZ (128*1024*1024) /* max stack size */ 112 #endif 113 #else 114 /* 115 * 32-bit limits: 116 * 117 * We only have 4GB to play with. Limit data, and text 118 * each to half of that and set a reasonable stack limit. 119 * 120 */ 121 #ifndef MAXTSIZ 122 #define MAXTSIZ (2UL*1024*1024*1024) /* max text size */ 123 #endif 124 #ifndef DFLDSIZ 125 #define DFLDSIZ (128*1024*1024) /* initial data size limit */ 126 #endif 127 #ifndef MAXDSIZ 128 #define MAXDSIZ (2UL*1024*1024*1024) /* max data size */ 129 #endif 130 #ifndef DFLSSIZ 131 #define DFLSSIZ (2*1024*1024) /* initial stack size limit */ 132 #endif 133 #ifndef MAXSSIZ 134 #define MAXSSIZ (64*1024*1024) /* max stack size */ 135 #endif 136 #endif 137 138 /* 139 * 32-bit emulation limits (same as sparc - we could go bigger) 140 */ 141 #ifndef MAXTSIZ32 142 #define MAXTSIZ32 (64*1024*1024) /* max text size */ 143 #endif 144 #ifndef DFLDSIZ32 145 #define DFLDSIZ32 (64*1024*1024) /* initial data size limit */ 146 #endif 147 #ifndef MAXDSIZ32 148 #define MAXDSIZ32 (512*1024*1024) /* max data size */ 149 #endif 150 #ifndef DFLSSIZ32 151 #define DFLSSIZ32 (2*1024*1024) /* initial stack size limit */ 152 #endif 153 #ifndef MAXSSIZ32 154 #define MAXSSIZ32 (32*1024*1024) /* max stack size */ 155 #endif 156 157 /* 158 * Mach derived constants 159 */ 160 161 /* 162 * User/kernel map constants. 163 */ 164 #define VM_MIN_ADDRESS ((vaddr_t)0) 165 #define VM_MAX_ADDRESS ((vaddr_t)-1) 166 #define VM_MAXUSER_ADDRESS ((vaddr_t)-1) 167 #define VM_MAXUSER_ADDRESS32 ((vaddr_t)(0x00000000ffffffffL&~PGOFSET)) 168 169 #define VM_MIN_KERNEL_ADDRESS ((vaddr_t)KERNBASE) 170 #ifdef __arch64__ 171 #define VM_KERNEL_MEM_VA_START ((vaddr_t)0x100000000UL) 172 #define VM_MAX_KERNEL_ADDRESS ((vaddr_t)0x000007ffffffffffUL) 173 #else 174 #define VM_MAX_KERNEL_ADDRESS ((vaddr_t)KERNEND) 175 #endif 176 177 #define VM_PHYSSEG_MAX 32 /* up to 32 segments */ 178 #define VM_PHYSSEG_STRAT VM_PSTRAT_BSEARCH 179 180 #define VM_NFREELIST 1 181 #define VM_FREELIST_DEFAULT 0 182 183 #endif 184