vmparam.h revision 168920
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 168920 2007-04-21 01:14:48Z sepotvin $ 41 */ 42 43 44#ifndef _MACHINE_VMPARAM_H_ 45#define _MACHINE_VMPARAM_H_ 46 47/* 48 * Virtual memory related constants, all in bytes 49 */ 50#ifndef MAXTSIZ 51#define MAXTSIZ (1*1024*1024*1024) /* max text size */ 52#endif 53#ifndef DFLDSIZ 54#define DFLDSIZ (128*1024*1024) /* initial data size limit */ 55#endif 56#ifndef MAXDSIZ 57#define MAXDSIZ (1*1024*1024*1024) /* max data size */ 58#endif 59#ifndef DFLSSIZ 60#define DFLSSIZ (128*1024*1024) /* initial stack size limit */ 61#endif 62#ifndef MAXSSIZ 63#define MAXSSIZ (1*1024*1024*1024) /* max stack size */ 64#endif 65#ifndef SGROWSIZ 66#define SGROWSIZ (128*1024) /* amount to grow stack */ 67#endif 68 69/* 70 * The time for a process to be blocked before being very swappable. 71 * This is a number of seconds which the system takes as being a non-trivial 72 * amount of real time. You probably shouldn't change this; 73 * it is used in subtle ways (fractions and multiples of it are, that is, like 74 * half of a ``long time'', almost a long time, etc.) 75 * It is related to human patience and other factors which don't really 76 * change over time. 77 */ 78#define MAXSLP 20 79 80/* 81 * Address space layout. 82 * 83 * UltraSPARC I and II implement a 44 bit virtual address space. The address 84 * space is split into 2 regions at each end of the 64 bit address space, with 85 * an out of range "hole" in the middle. UltraSPARC III implements the full 86 * 64 bit virtual address space, but we don't really have any use for it and 87 * 43 bits of user address space is considered to be "enough", so we ignore it. 88 * 89 * Upper region: 0xffffffffffffffff 90 * 0xfffff80000000000 91 * 92 * Hole: 0xfffff7ffffffffff 93 * 0x0000080000000000 94 * 95 * Lower region: 0x000007ffffffffff 96 * 0x0000000000000000 97 * 98 * In general we ignore the upper region, and use the lower region as mappable 99 * space. 100 * 101 * We define some interesting address constants: 102 * 103 * VM_MIN_ADDRESS and VM_MAX_ADDRESS define the start and of the entire 64 bit 104 * address space, mostly just for convenience. 105 * 106 * VM_MIN_DIRECT_ADDRESS and VM_MAX_DIRECT_ADDRESS define the start and end 107 * of the direct mapped region. This maps virtual addresses to physical 108 * addresses directly using 4mb tlb entries, with the physical address encoded 109 * in the lower 43 bits of virtual address. These mappings are convenient 110 * because they do not require page tables, and because they never change they 111 * do not require tlb flushes. However, since these mappings are cacheable, 112 * we must ensure that all pages accessed this way are either not double 113 * mapped, or that all other mappings have virtual color equal to physical 114 * color, in order to avoid creating illegal aliases in the data cache. 115 * 116 * VM_MIN_KERNEL_ADDRESS and VM_MAX_KERNEL_ADDRESS define the start and end of 117 * mappable kernel virtual address space. VM_MIN_KERNEL_ADDRESS is basically 118 * arbitrary, a convenient address is chosen which allows both the kernel text 119 * and data and the prom's address space to be mapped with 1 4mb tsb page. 120 * VM_MAX_KERNEL_ADDRESS is variable, computed at startup time based on the 121 * amount of physical memory available. Each 4mb tsb page provides 1g of 122 * virtual address space, with the only practical limit being available 123 * phsyical memory. 124 * 125 * VM_MIN_PROM_ADDRESS and VM_MAX_PROM_ADDRESS define the start and end of the 126 * prom address space. On startup the prom's mappings are duplicated in the 127 * kernel tsb, to allow prom memory to be accessed normally by the kernel. 128 * 129 * VM_MIN_USER_ADDRESS and VM_MAX_USER_ADDRESS define the start and end of the 130 * user address space. There are some hardware errata about using addresses 131 * at the boundary of the va hole, so we allow just under 43 bits of user 132 * address space. Note that the kernel and user address spaces overlap, but 133 * this doesn't matter because they use different tlb contexts, and because 134 * the kernel address space is not mapped into each process' address space. 135 */ 136#define VM_MIN_ADDRESS (0x0000000000000000UL) 137#define VM_MAX_ADDRESS (0xffffffffffffffffUL) 138 139#define VM_MIN_DIRECT_ADDRESS (0xfffff80000000000UL) 140#define VM_MAX_DIRECT_ADDRESS (VM_MAX_ADDRESS) 141 142#define VM_MIN_KERNEL_ADDRESS (0x00000000c0000000UL) 143#define VM_MAX_KERNEL_ADDRESS (vm_max_kernel_address) 144 145#define VM_MIN_PROM_ADDRESS (0x00000000f0000000UL) 146#define VM_MAX_PROM_ADDRESS (0x00000000ffffe000UL) 147 148#define VM_MIN_USER_ADDRESS (0x0000000000000000UL) 149#define VM_MAX_USER_ADDRESS (0x000007fe00000000UL) 150 151#define VM_MINUSER_ADDRESS (VM_MIN_USER_ADDRESS) 152#define VM_MAXUSER_ADDRESS (VM_MAX_USER_ADDRESS) 153 154#define KERNBASE (VM_MIN_KERNEL_ADDRESS) 155#define USRSTACK (VM_MAX_USER_ADDRESS) 156 157/* 158 * Virtual size (bytes) for various kernel submaps. 159 */ 160#ifndef VM_KMEM_SIZE 161#define VM_KMEM_SIZE (16*1024*1024) 162#endif 163 164/* 165 * How many physical pages per KVA page allocated. 166 * min(max(max(VM_KMEM_SIZE, Physical memory/VM_KMEM_SIZE_SCALE), 167 * VM_KMEM_SIZE_MIN), VM_KMEM_SIZE_MAX) 168 * is the total KVA space allocated for kmem_map. 169 */ 170#ifndef VM_KMEM_SIZE_SCALE 171#define VM_KMEM_SIZE_SCALE (3) 172#endif 173 174/* 175 * Initial pagein size of beginning of executable file. 176 */ 177#ifndef VM_INITIAL_PAGEIN 178#define VM_INITIAL_PAGEIN 16 179#endif 180 181#define UMA_MD_SMALL_ALLOC 182 183extern vm_offset_t vm_max_kernel_address; 184 185#endif /* !_MACHINE_VMPARAM_H_ */ 186