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 * Copyright (c) 2003 Peter Wemm 7 * All rights reserved. 8 * 9 * This code is derived from software contributed to Berkeley by 10 * William Jolitz. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. All advertising materials mentioning features or use of this software 21 * must display the following acknowledgement: 22 * This product includes software developed by the University of 23 * California, Berkeley and its contributors. 24 * 4. 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 * from: @(#)vmparam.h 5.9 (Berkeley) 5/12/91 41 * $FreeBSD$ 42 */ 43 44 45 #ifndef _MACHINE_VMPARAM_H_ 46 #define _MACHINE_VMPARAM_H_ 1 47 48 /* 49 * Machine dependent constants for AMD64. 50 */ 51 52 /* 53 * Virtual memory related constants, all in bytes 54 */ 55 #define MAXTSIZ (128UL*1024*1024) /* max text size */ 56 #ifndef DFLDSIZ 57 #define DFLDSIZ (128UL*1024*1024) /* initial data size limit */ 58 #endif 59 #ifndef MAXDSIZ 60 #define MAXDSIZ (32768UL*1024*1024) /* max data size */ 61 #endif 62 #ifndef DFLSSIZ 63 #define DFLSSIZ (8UL*1024*1024) /* initial stack size limit */ 64 #endif 65 #ifndef MAXSSIZ 66 #define MAXSSIZ (512UL*1024*1024) /* max stack size */ 67 #endif 68 #ifndef SGROWSIZ 69 #define SGROWSIZ (128UL*1024) /* amount to grow stack */ 70 #endif 71 72 /* 73 * The time for a process to be blocked before being very swappable. 74 * This is a number of seconds which the system takes as being a non-trivial 75 * amount of real time. You probably shouldn't change this; 76 * it is used in subtle ways (fractions and multiples of it are, that is, like 77 * half of a ``long time'', almost a long time, etc.) 78 * It is related to human patience and other factors which don't really 79 * change over time. 80 */ 81 #define MAXSLP 20 82 83 /* 84 * We provide a machine specific single page allocator through the use 85 * of the direct mapped segment. This uses 2MB pages for reduced 86 * TLB pressure. 87 */ 88 #define UMA_MD_SMALL_ALLOC 89 90 /* 91 * The physical address space is densely populated. 92 */ 93 #define VM_PHYSSEG_DENSE 94 95 /* 96 * The number of PHYSSEG entries must be one greater than the number 97 * of phys_avail entries because the phys_avail entry that spans the 98 * largest physical address that is accessible by ISA DMA is split 99 * into two PHYSSEG entries. 100 */ 101 #define VM_PHYSSEG_MAX 31 102 103 /* 104 * Create three free page pools: VM_FREEPOOL_DEFAULT is the default pool 105 * from which physical pages are allocated and VM_FREEPOOL_DIRECT is 106 * the pool from which physical pages for page tables and small UMA 107 * objects are allocated. 108 */ 109 #define VM_NFREEPOOL 3 110 #define VM_FREEPOOL_CACHE 2 111 #define VM_FREEPOOL_DEFAULT 0 112 #define VM_FREEPOOL_DIRECT 1 113 114 /* 115 * Create two free page lists: VM_FREELIST_DEFAULT is for physical 116 * pages that are above the largest physical address that is 117 * accessible by ISA DMA and VM_FREELIST_ISADMA is for physical pages 118 * that are below that address. 119 */ 120 #define VM_NFREELIST 2 121 #define VM_FREELIST_DEFAULT 0 122 #define VM_FREELIST_ISADMA 1 123 124 /* 125 * An allocation size of 16MB is supported in order to optimize the 126 * use of the direct map by UMA. Specifically, a cache line contains 127 * at most 8 PDEs, collectively mapping 16MB of physical memory. By 128 * reducing the number of distinct 16MB "pages" that are used by UMA, 129 * the physical memory allocator reduces the likelihood of both 2MB 130 * page TLB misses and cache misses caused by 2MB page TLB misses. 131 */ 132 #define VM_NFREEORDER 13 133 134 /* 135 * Only one memory domain. 136 */ 137 #ifndef VM_NDOMAIN 138 #define VM_NDOMAIN 1 139 #endif 140 141 /* 142 * Enable superpage reservations: 1 level. 143 */ 144 #ifndef VM_NRESERVLEVEL 145 #define VM_NRESERVLEVEL 1 146 #endif 147 148 /* 149 * Level 0 reservations consist of 512 pages. 150 */ 151 #ifndef VM_LEVEL_0_ORDER 152 #define VM_LEVEL_0_ORDER 9 153 #endif 154 155 #ifdef SMP 156 #define PA_LOCK_COUNT 256 157 #endif 158 159 /* 160 * Virtual addresses of things. Derived from the page directory and 161 * page table indexes from pmap.h for precision. 162 * 163 * 0x0000000000000000 - 0x00007fffffffffff user map 164 * 0x0000800000000000 - 0xffff7fffffffffff does not exist (hole) 165 * 0xffff800000000000 - 0xffff804020100fff recursive page table (512GB slot) 166 * 0xffff804020101000 - 0xfffffeffffffffff unused 167 * 0xffffff0000000000 - 0xffffff7fffffffff 512GB direct map mappings 168 * 0xffffff8000000000 - 0xffffffffffffffff 512GB kernel map 169 * 170 * Within the kernel map: 171 * 172 * 0xffffffff80000000 KERNBASE 173 */ 174 175 #define VM_MAX_KERNEL_ADDRESS KVADDR(KPML4I, NPDPEPG-1, NPDEPG-1, NPTEPG-1) 176 #define VM_MIN_KERNEL_ADDRESS KVADDR(KPML4I, NPDPEPG-512, 0, 0) 177 178 #define DMAP_MIN_ADDRESS KVADDR(DMPML4I, 0, 0, 0) 179 #define DMAP_MAX_ADDRESS KVADDR(DMPML4I+1, 0, 0, 0) 180 181 #define KERNBASE KVADDR(KPML4I, KPDPI, 0, 0) 182 183 #define UPT_MAX_ADDRESS KVADDR(PML4PML4I, PML4PML4I, PML4PML4I, PML4PML4I) 184 #define UPT_MIN_ADDRESS KVADDR(PML4PML4I, 0, 0, 0) 185 186 #define VM_MAXUSER_ADDRESS UVADDR(NUPML4E, 0, 0, 0) 187 188 #define USRSTACK VM_MAXUSER_ADDRESS 189 190 #define VM_MAX_ADDRESS UPT_MAX_ADDRESS 191 #define VM_MIN_ADDRESS (0) 192 193 #define PHYS_TO_DMAP(x) ((x) | DMAP_MIN_ADDRESS) 194 #define DMAP_TO_PHYS(x) ((x) & ~DMAP_MIN_ADDRESS) 195 196 /* virtual sizes (bytes) for various kernel submaps */ 197 #ifndef VM_KMEM_SIZE 198 #define VM_KMEM_SIZE (12 * 1024 * 1024) 199 #endif 200 201 /* 202 * How many physical pages per KVA page allocated. 203 * min(max(max(VM_KMEM_SIZE, Physical memory/VM_KMEM_SIZE_SCALE), 204 * VM_KMEM_SIZE_MIN), VM_KMEM_SIZE_MAX) 205 * is the total KVA space allocated for kmem_map. 206 */ 207 #ifndef VM_KMEM_SIZE_SCALE 208 #define VM_KMEM_SIZE_SCALE (1) 209 #endif 210 211 /* 212 * Ceiling on amount of kmem_map kva space. 213 */ 214 #ifndef VM_KMEM_SIZE_MAX 215 #define VM_KMEM_SIZE_MAX ((VM_MAX_KERNEL_ADDRESS - \ 216 VM_MIN_KERNEL_ADDRESS + 1) * 3 / 5) 217 #endif 218 219 /* initial pagein size of beginning of executable file */ 220 #ifndef VM_INITIAL_PAGEIN 221 #define VM_INITIAL_PAGEIN 16 222 #endif 223 224 #endif /* _MACHINE_VMPARAM_H_ */ 225