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. Neither the name of the University nor the names of its contributors 19 * may be used to endorse or promote products derived from this software 20 * without specific prior written permission. 21 * 22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 * 34 * from: @(#)vmparam.h 5.9 (Berkeley) 5/12/91 35 * from: FreeBSD: src/sys/i386/include/vmparam.h,v 1.33 2000/03/30 36 * $FreeBSD$ 37 */ 38 39#ifndef _MACHINE_VMPARAM_H_ 40#define _MACHINE_VMPARAM_H_ 41 42/* 43 * Virtual memory related constants, all in bytes 44 */ 45#ifndef MAXTSIZ 46#define MAXTSIZ (1*1024*1024*1024) /* max text size */ 47#endif 48#ifndef DFLDSIZ 49#define DFLDSIZ (128*1024*1024) /* initial data size limit */ 50#endif 51#ifndef MAXDSIZ 52#define MAXDSIZ (1*1024*1024*1024) /* max data size */ 53#endif 54#ifndef DFLSSIZ 55#define DFLSSIZ (128*1024*1024) /* initial stack size limit */ 56#endif 57#ifndef MAXSSIZ 58#define MAXSSIZ (1*1024*1024*1024) /* max stack size */ 59#endif 60#ifndef SGROWSIZ 61#define SGROWSIZ (128*1024) /* amount to grow stack */ 62#endif 63 64/* 65 * The physical address space is sparsely populated. 66 */ 67#define VM_PHYSSEG_SPARSE 68 69/* 70 * The number of PHYSSEG entries must be one greater than the number 71 * of phys_avail entries because the phys_avail entry that spans the 72 * largest physical address that is accessible by ISA DMA is split 73 * into two PHYSSEG entries. 74 */ 75#define VM_PHYSSEG_MAX 64 76 77/* 78 * Create two free page pools: VM_FREEPOOL_DEFAULT is the default pool 79 * from which physical pages are allocated and VM_FREEPOOL_DIRECT is 80 * the pool from which physical pages for small UMA objects are 81 * allocated. 82 */ 83#define VM_NFREEPOOL 2 84#define VM_FREEPOOL_DEFAULT 0 85#define VM_FREEPOOL_DIRECT 1 86 87/* 88 * Create two free page lists: VM_FREELIST_DEFAULT is for physical 89 * pages that are above the largest physical address that is 90 * accessible by ISA DMA and VM_FREELIST_ISADMA is for physical pages 91 * that are below that address. 92 */ 93#define VM_NFREELIST 2 94#define VM_FREELIST_DEFAULT 0 95#define VM_FREELIST_ISADMA 1 96 97/* 98 * An allocation size of 16MB is supported in order to optimize the 99 * use of the direct map by UMA. Specifically, a cache line contains 100 * at most four TTEs, collectively mapping 16MB of physical memory. 101 * By reducing the number of distinct 16MB "pages" that are used by UMA, 102 * the physical memory allocator reduces the likelihood of both 4MB 103 * page TLB misses and cache misses caused by 4MB page TLB misses. 104 */ 105#define VM_NFREEORDER 12 106 107/* 108 * Enable superpage reservations: 1 level. 109 */ 110#ifndef VM_NRESERVLEVEL 111#define VM_NRESERVLEVEL 1 112#endif 113 114/* 115 * Level 0 reservations consist of 512 pages. 116 */ 117#ifndef VM_LEVEL_0_ORDER 118#define VM_LEVEL_0_ORDER 9 119#endif 120 121/** 122 * Address space layout. 123 * 124 * RISC-V implements up to a 48 bit virtual address space. The address space is 125 * split into 2 regions at each end of the 64 bit address space, with an 126 * out of range "hole" in the middle. 127 * 128 * We limit the size of the two spaces to 39 bits each. 129 * 130 * Upper region: 0xffffffffffffffff 131 * 0xffffff8000000000 132 * 133 * Hole: 0xffffff7fffffffff 134 * 0x0000008000000000 135 * 136 * Lower region: 0x0000007fffffffff 137 * 0x0000000000000000 138 * 139 * We use the upper region for the kernel, and the lower region for userland. 140 * 141 * We define some interesting address constants: 142 * 143 * VM_MIN_ADDRESS and VM_MAX_ADDRESS define the start and end of the entire 144 * 64 bit address space, mostly just for convenience. 145 * 146 * VM_MIN_KERNEL_ADDRESS and VM_MAX_KERNEL_ADDRESS define the start and end of 147 * mappable kernel virtual address space. 148 * 149 * VM_MIN_USER_ADDRESS and VM_MAX_USER_ADDRESS define the start and end of the 150 * user address space. 151 */ 152#define VM_MIN_ADDRESS (0x0000000000000000UL) 153#define VM_MAX_ADDRESS (0xffffffffffffffffUL) 154 155/* 32 GiB of kernel addresses */ 156#define VM_MIN_KERNEL_ADDRESS (0xffffffc000000000UL) 157#define VM_MAX_KERNEL_ADDRESS (0xffffffc800000000UL) 158 159/* Direct Map for 128 GiB of PA: 0x0 - 0x1fffffffff */ 160#define DMAP_MIN_ADDRESS (0xffffffd000000000UL) 161#define DMAP_MAX_ADDRESS (0xffffffefffffffffUL) 162 163#define DMAP_MIN_PHYSADDR (0x0000000000000000UL) 164#define DMAP_MAX_PHYSADDR (DMAP_MAX_ADDRESS - DMAP_MIN_ADDRESS) 165 166/* True if pa is in the dmap range */ 167#define PHYS_IN_DMAP(pa) ((pa) >= DMAP_MIN_PHYSADDR && \ 168 (pa) <= DMAP_MAX_PHYSADDR) 169/* True if va is in the dmap range */ 170#define VIRT_IN_DMAP(va) ((va) >= DMAP_MIN_ADDRESS && \ 171 (va) <= DMAP_MAX_ADDRESS) 172 173#define PHYS_TO_DMAP(pa) \ 174({ \ 175 KASSERT(PHYS_IN_DMAP(pa), \ 176 ("%s: PA out of range, PA: 0x%lx", __func__, \ 177 (vm_paddr_t)(pa))); \ 178 (pa) | DMAP_MIN_ADDRESS; \ 179}) 180 181#define DMAP_TO_PHYS(va) \ 182({ \ 183 KASSERT(VIRT_IN_DMAP(va), \ 184 ("%s: VA out of range, VA: 0x%lx", __func__, \ 185 (vm_offset_t)(va))); \ 186 (va) & ~DMAP_MIN_ADDRESS; \ 187}) 188 189#define VM_MIN_USER_ADDRESS (0x0000000000000000UL) 190#define VM_MAX_USER_ADDRESS (0x0000004000000000UL) 191 192#define VM_MINUSER_ADDRESS (VM_MIN_USER_ADDRESS) 193#define VM_MAXUSER_ADDRESS (VM_MAX_USER_ADDRESS) 194 195#define KERNBASE (VM_MIN_KERNEL_ADDRESS) 196#define SHAREDPAGE (VM_MAXUSER_ADDRESS - PAGE_SIZE) 197#define USRSTACK SHAREDPAGE 198 199#define KERNENTRY (0x200) 200 201/* 202 * How many physical pages per kmem arena virtual page. 203 */ 204#ifndef VM_KMEM_SIZE_SCALE 205#define VM_KMEM_SIZE_SCALE (3) 206#endif 207 208/* 209 * Optional floor (in bytes) on the size of the kmem arena. 210 */ 211#ifndef VM_KMEM_SIZE_MIN 212#define VM_KMEM_SIZE_MIN (16 * 1024 * 1024) 213#endif 214 215/* 216 * Optional ceiling (in bytes) on the size of the kmem arena: 60% of the 217 * kernel map. 218 */ 219#ifndef VM_KMEM_SIZE_MAX 220#define VM_KMEM_SIZE_MAX ((VM_MAX_KERNEL_ADDRESS - \ 221 VM_MIN_KERNEL_ADDRESS + 1) * 3 / 5) 222#endif 223 224/* 225 * Initial pagein size of beginning of executable file. 226 */ 227#ifndef VM_INITIAL_PAGEIN 228#define VM_INITIAL_PAGEIN 16 229#endif 230 231/* 232 * RISCVTODO 233 * #define UMA_MD_SMALL_ALLOC 234 */ 235 236extern u_int tsb_kernel_ldd_phys; 237extern vm_offset_t vm_max_kernel_address; 238extern vm_offset_t init_pt_va; 239 240#define ZERO_REGION_SIZE (64 * 1024) /* 64KB */ 241 242#define DEVMAP_MAX_VADDR VM_MAX_KERNEL_ADDRESS 243 244#endif /* !_MACHINE_VMPARAM_H_ */ 245