vmparam.h revision 188455
1/*- 2 * Copyright (c) 1990 The Regents of the University of California. 3 * All rights reserved. 4 * Copyright (c) 1994 John S. Dyson 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 * from: @(#)vmparam.h 5.9 (Berkeley) 5/12/91 39 * from: FreeBSD: src/sys/i386/include/vmparam.h,v 1.33 2000/03/30 40 * $FreeBSD: head/sys/sparc64/include/vmparam.h 188455 2009-02-10 21:48:42Z marius $ 41 */ 42 43#ifndef _MACHINE_VMPARAM_H_ 44#define _MACHINE_VMPARAM_H_ 45 46/* 47 * Virtual memory related constants, all in bytes 48 */ 49#ifndef MAXTSIZ 50#define MAXTSIZ (1*1024*1024*1024) /* max text size */ 51#endif 52#ifndef DFLDSIZ 53#define DFLDSIZ (128*1024*1024) /* initial data size limit */ 54#endif 55#ifndef MAXDSIZ 56#define MAXDSIZ (1*1024*1024*1024) /* max data size */ 57#endif 58#ifndef DFLSSIZ 59#define DFLSSIZ (128*1024*1024) /* initial stack size limit */ 60#endif 61#ifndef MAXSSIZ 62#define MAXSSIZ (1*1024*1024*1024) /* max stack size */ 63#endif 64#ifndef SGROWSIZ 65#define SGROWSIZ (128*1024) /* amount to grow stack */ 66#endif 67 68/* 69 * The time for a process to be blocked before being very swappable. 70 * This is a number of seconds which the system takes as being a non-trivial 71 * amount of real time. You probably shouldn't change this; 72 * it is used in subtle ways (fractions and multiples of it are, that is, like 73 * half of a ``long time'', almost a long time, etc.) 74 * It is related to human patience and other factors which don't really 75 * change over time. 76 */ 77#define MAXSLP 20 78 79/* 80 * The physical address space is sparsely populated. 81 */ 82#define VM_PHYSSEG_SPARSE 83 84/* 85 * The number of PHYSSEG entries must be one greater than the number 86 * of phys_avail entries because the phys_avail entry that spans the 87 * largest physical address that is accessible by ISA DMA is split 88 * into two PHYSSEG entries. 89 */ 90#define VM_PHYSSEG_MAX 64 91 92/* 93 * Create three free page pools: VM_FREEPOOL_DEFAULT is the default pool 94 * from which physical pages are allocated and VM_FREEPOOL_DIRECT is 95 * the pool from which physical pages for small UMA objects are 96 * allocated. 97 */ 98#define VM_NFREEPOOL 3 99#define VM_FREEPOOL_CACHE 2 100#define VM_FREEPOOL_DEFAULT 0 101#define VM_FREEPOOL_DIRECT 1 102 103/* 104 * Create two free page lists: VM_FREELIST_DEFAULT is for physical 105 * pages that are above the largest physical address that is 106 * accessible by ISA DMA and VM_FREELIST_ISADMA is for physical pages 107 * that are below that address. 108 */ 109#define VM_NFREELIST 2 110#define VM_FREELIST_DEFAULT 0 111#define VM_FREELIST_ISADMA 1 112 113/* 114 * An allocation size of 16MB is supported in order to optimize the 115 * use of the direct map by UMA. Specifically, a cache line contains 116 * at most four TTEs, collectively mapping 16MB of physical memory. 117 * By reducing the number of distinct 16MB "pages" that are used by UMA, 118 * the physical memory allocator reduces the likelihood of both 4MB 119 * page TLB misses and cache misses caused by 4MB page TLB misses. 120 */ 121#define VM_NFREEORDER 12 122 123/* 124 * Disable superpage reservations. 125 */ 126#ifndef VM_NRESERVLEVEL 127#define VM_NRESERVLEVEL 0 128#endif 129 130/* 131 * Address space layout. 132 * 133 * UltraSPARC I and II implement a 44 bit virtual address space. The address 134 * space is split into 2 regions at each end of the 64 bit address space, with 135 * an out of range "hole" in the middle. UltraSPARC III implements the full 136 * 64 bit virtual address space, but we don't really have any use for it and 137 * 43 bits of user address space is considered to be "enough", so we ignore it. 138 * 139 * Upper region: 0xffffffffffffffff 140 * 0xfffff80000000000 141 * 142 * Hole: 0xfffff7ffffffffff 143 * 0x0000080000000000 144 * 145 * Lower region: 0x000007ffffffffff 146 * 0x0000000000000000 147 * 148 * In general we ignore the upper region, and use the lower region as mappable 149 * space. 150 * 151 * We define some interesting address constants: 152 * 153 * VM_MIN_ADDRESS and VM_MAX_ADDRESS define the start and of the entire 64 bit 154 * address space, mostly just for convenience. 155 * 156 * VM_MIN_DIRECT_ADDRESS and VM_MAX_DIRECT_ADDRESS define the start and end 157 * of the direct mapped region. This maps virtual addresses to physical 158 * addresses directly using 4mb tlb entries, with the physical address encoded 159 * in the lower 43 bits of virtual address. These mappings are convenient 160 * because they do not require page tables, and because they never change they 161 * do not require tlb flushes. However, since these mappings are cacheable, 162 * we must ensure that all pages accessed this way are either not double 163 * mapped, or that all other mappings have virtual color equal to physical 164 * color, in order to avoid creating illegal aliases in the data cache. 165 * 166 * VM_MIN_KERNEL_ADDRESS and VM_MAX_KERNEL_ADDRESS define the start and end of 167 * mappable kernel virtual address space. VM_MIN_KERNEL_ADDRESS is basically 168 * arbitrary, a convenient address is chosen which allows both the kernel text 169 * and data and the prom's address space to be mapped with 1 4mb tsb page. 170 * VM_MAX_KERNEL_ADDRESS is variable, computed at startup time based on the 171 * amount of physical memory available. Each 4mb tsb page provides 1g of 172 * virtual address space, with the only practical limit being available 173 * phsyical memory. 174 * 175 * VM_MIN_PROM_ADDRESS and VM_MAX_PROM_ADDRESS define the start and end of the 176 * prom address space. On startup the prom's mappings are duplicated in the 177 * kernel tsb, to allow prom memory to be accessed normally by the kernel. 178 * 179 * VM_MIN_USER_ADDRESS and VM_MAX_USER_ADDRESS define the start and end of the 180 * user address space. There are some hardware errata about using addresses 181 * at the boundary of the va hole, so we allow just under 43 bits of user 182 * address space. Note that the kernel and user address spaces overlap, but 183 * this doesn't matter because they use different tlb contexts, and because 184 * the kernel address space is not mapped into each process' address space. 185 */ 186#define VM_MIN_ADDRESS (0x0000000000000000UL) 187#define VM_MAX_ADDRESS (0xffffffffffffffffUL) 188 189#define VM_MIN_DIRECT_ADDRESS (0xfffff80000000000UL) 190#define VM_MAX_DIRECT_ADDRESS (VM_MAX_ADDRESS) 191 192#define VM_MIN_KERNEL_ADDRESS (0x00000000c0000000UL) 193#define VM_MAX_KERNEL_ADDRESS (vm_max_kernel_address) 194 195#define VM_MIN_PROM_ADDRESS (0x00000000f0000000UL) 196#define VM_MAX_PROM_ADDRESS (0x00000000ffffffffUL) 197 198#define VM_MIN_USER_ADDRESS (0x0000000000000000UL) 199#define VM_MAX_USER_ADDRESS (0x000007fe00000000UL) 200 201#define VM_MINUSER_ADDRESS (VM_MIN_USER_ADDRESS) 202#define VM_MAXUSER_ADDRESS (VM_MAX_USER_ADDRESS) 203 204#define KERNBASE (VM_MIN_KERNEL_ADDRESS) 205#define PROMBASE (VM_MIN_PROM_ADDRESS) 206#define USRSTACK (VM_MAX_USER_ADDRESS) 207 208/* 209 * Virtual size (bytes) for various kernel submaps. 210 */ 211#ifndef VM_KMEM_SIZE 212#define VM_KMEM_SIZE (16*1024*1024) 213#endif 214 215/* 216 * How many physical pages per KVA page allocated. 217 * min(max(max(VM_KMEM_SIZE, Physical memory/VM_KMEM_SIZE_SCALE), 218 * VM_KMEM_SIZE_MIN), VM_KMEM_SIZE_MAX) 219 * is the total KVA space allocated for kmem_map. 220 */ 221#ifndef VM_KMEM_SIZE_SCALE 222#define VM_KMEM_SIZE_SCALE (3) 223#endif 224 225/* 226 * Initial pagein size of beginning of executable file. 227 */ 228#ifndef VM_INITIAL_PAGEIN 229#define VM_INITIAL_PAGEIN 16 230#endif 231 232#define UMA_MD_SMALL_ALLOC 233 234extern vm_offset_t vm_max_kernel_address; 235 236#endif /* !_MACHINE_VMPARAM_H_ */ 237