1 /*- 2 * SPDX-License-Identifier: (BSD-3-Clause AND MIT-CMU) 3 * 4 * Copyright (c) 1991, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * The Mach Operating System project at Carnegie-Mellon University. 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: @(#)vm_init.c 8.1 (Berkeley) 6/11/93 35 * 36 * 37 * Copyright (c) 1987, 1990 Carnegie-Mellon University. 38 * All rights reserved. 39 * 40 * Authors: Avadis Tevanian, Jr., Michael Wayne Young 41 * 42 * Permission to use, copy, modify and distribute this software and 43 * its documentation is hereby granted, provided that both the copyright 44 * notice and this permission notice appear in all copies of the 45 * software, derivative works or modified versions, and any portions 46 * thereof, and that both notices appear in supporting documentation. 47 * 48 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" 49 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND 50 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. 51 * 52 * Carnegie Mellon requests users of this software to return to 53 * 54 * Software Distribution Coordinator or [email protected] 55 * School of Computer Science 56 * Carnegie Mellon University 57 * Pittsburgh PA 15213-3890 58 * 59 * any improvements or extensions that they make and grant Carnegie the 60 * rights to redistribute these changes. 61 */ 62 63 /* 64 * Initialize the Virtual Memory subsystem. 65 */ 66 67 #include <sys/cdefs.h> 68 __FBSDID("$FreeBSD$"); 69 70 #include <sys/param.h> 71 #include <sys/kernel.h> 72 #include <sys/lock.h> 73 #include <sys/proc.h> 74 #include <sys/rwlock.h> 75 #include <sys/malloc.h> 76 #include <sys/sysctl.h> 77 #include <sys/systm.h> 78 #include <sys/selinfo.h> 79 #include <sys/smp.h> 80 #include <sys/pipe.h> 81 #include <sys/bio.h> 82 #include <sys/buf.h> 83 #include <sys/vmem.h> 84 #include <sys/vmmeter.h> 85 86 #include <vm/vm.h> 87 #include <vm/vm_param.h> 88 #include <vm/vm_kern.h> 89 #include <vm/vm_object.h> 90 #include <vm/vm_page.h> 91 #include <vm/vm_phys.h> 92 #include <vm/vm_pagequeue.h> 93 #include <vm/vm_map.h> 94 #include <vm/vm_pager.h> 95 #include <vm/vm_extern.h> 96 97 extern void uma_startup1(void); 98 extern void vm_radix_reserve_kva(void); 99 100 #if VM_NRESERVLEVEL > 0 101 #define KVA_QUANTUM (1 << (VM_LEVEL_0_ORDER + PAGE_SHIFT)) 102 #else 103 /* On non-superpage architectures want large import sizes. */ 104 #define KVA_QUANTUM (PAGE_SIZE * 1024) 105 #endif 106 long physmem; 107 108 /* 109 * System initialization 110 */ 111 static void vm_mem_init(void *); 112 SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL); 113 114 /* 115 * Import kva into the kernel arena. 116 */ 117 static int 118 kva_import(void *unused, vmem_size_t size, int flags, vmem_addr_t *addrp) 119 { 120 vm_offset_t addr; 121 int result; 122 123 KASSERT((size % KVA_QUANTUM) == 0, 124 ("kva_import: Size %jd is not a multiple of %d", 125 (intmax_t)size, (int)KVA_QUANTUM)); 126 addr = vm_map_min(kernel_map); 127 result = vm_map_find(kernel_map, NULL, 0, &addr, size, 0, 128 VMFS_SUPER_SPACE, VM_PROT_ALL, VM_PROT_ALL, MAP_NOFAULT); 129 if (result != KERN_SUCCESS) 130 return (ENOMEM); 131 132 *addrp = addr; 133 134 return (0); 135 } 136 137 /* 138 * vm_init initializes the virtual memory system. 139 * This is done only by the first cpu up. 140 * 141 * The start and end address of physical memory is passed in. 142 */ 143 /* ARGSUSED*/ 144 static void 145 vm_mem_init(dummy) 146 void *dummy; 147 { 148 int domain; 149 150 /* 151 * Initializes resident memory structures. From here on, all physical 152 * memory is accounted for, and we use only virtual addresses. 153 */ 154 vm_set_page_size(); 155 virtual_avail = vm_page_startup(virtual_avail); 156 157 #ifdef UMA_MD_SMALL_ALLOC 158 /* Announce page availability to UMA. */ 159 uma_startup1(); 160 #endif 161 /* 162 * Initialize other VM packages 163 */ 164 vmem_startup(); 165 vm_object_init(); 166 vm_map_startup(); 167 kmem_init(virtual_avail, virtual_end); 168 169 /* 170 * Initialize the kernel_arena. This can grow on demand. 171 */ 172 vmem_init(kernel_arena, "kernel arena", 0, 0, PAGE_SIZE, 0, 0); 173 vmem_set_import(kernel_arena, kva_import, NULL, NULL, KVA_QUANTUM); 174 175 for (domain = 0; domain < vm_ndomains; domain++) { 176 vm_dom[domain].vmd_kernel_arena = vmem_create( 177 "kernel arena domain", 0, 0, PAGE_SIZE, 0, M_WAITOK); 178 vmem_set_import(vm_dom[domain].vmd_kernel_arena, 179 (vmem_import_t *)vmem_alloc, NULL, kernel_arena, 180 KVA_QUANTUM); 181 } 182 183 #ifndef UMA_MD_SMALL_ALLOC 184 /* Set up radix zone to use noobj_alloc. */ 185 vm_radix_reserve_kva(); 186 /* Announce page availability to UMA. */ 187 uma_startup1(); 188 #endif 189 kmem_init_zero_region(); 190 pmap_init(); 191 vm_pager_init(); 192 } 193 194 void 195 vm_ksubmap_init(struct kva_md_info *kmi) 196 { 197 vm_offset_t firstaddr; 198 caddr_t v; 199 vm_size_t size = 0; 200 long physmem_est; 201 vm_offset_t minaddr; 202 vm_offset_t maxaddr; 203 204 /* 205 * Allocate space for system data structures. 206 * The first available kernel virtual address is in "v". 207 * As pages of kernel virtual memory are allocated, "v" is incremented. 208 * As pages of memory are allocated and cleared, 209 * "firstaddr" is incremented. 210 */ 211 212 /* 213 * Make two passes. The first pass calculates how much memory is 214 * needed and allocates it. The second pass assigns virtual 215 * addresses to the various data structures. 216 */ 217 firstaddr = 0; 218 again: 219 v = (caddr_t)firstaddr; 220 221 /* 222 * Discount the physical memory larger than the size of kernel_map 223 * to avoid eating up all of KVA space. 224 */ 225 physmem_est = lmin(physmem, btoc(kernel_map->max_offset - 226 kernel_map->min_offset)); 227 228 v = kern_vfs_bio_buffer_alloc(v, physmem_est); 229 230 /* 231 * End of first pass, size has been calculated so allocate memory 232 */ 233 if (firstaddr == 0) { 234 size = (vm_size_t)v; 235 #ifdef VM_FREELIST_DMA32 236 /* 237 * Try to protect 32-bit DMAable memory from the largest 238 * early alloc of wired mem. 239 */ 240 firstaddr = kmem_alloc_attr(kernel_arena, size, 241 M_ZERO | M_NOWAIT, (vm_paddr_t)1 << 32, 242 ~(vm_paddr_t)0, VM_MEMATTR_DEFAULT); 243 if (firstaddr == 0) 244 #endif 245 firstaddr = kmem_malloc(kernel_arena, size, 246 M_ZERO | M_WAITOK); 247 if (firstaddr == 0) 248 panic("startup: no room for tables"); 249 goto again; 250 } 251 252 /* 253 * End of second pass, addresses have been assigned 254 */ 255 if ((vm_size_t)((char *)v - firstaddr) != size) 256 panic("startup: table size inconsistency"); 257 258 /* 259 * Allocate the clean map to hold all of the paging and I/O virtual 260 * memory. 261 */ 262 size = (long)nbuf * BKVASIZE + (long)nswbuf * MAXPHYS + 263 (long)bio_transient_maxcnt * MAXPHYS; 264 kmi->clean_sva = firstaddr = kva_alloc(size); 265 kmi->clean_eva = firstaddr + size; 266 267 /* 268 * Allocate the buffer arena. 269 * 270 * Enable the quantum cache if we have more than 4 cpus. This 271 * avoids lock contention at the expense of some fragmentation. 272 */ 273 size = (long)nbuf * BKVASIZE; 274 kmi->buffer_sva = firstaddr; 275 kmi->buffer_eva = kmi->buffer_sva + size; 276 vmem_init(buffer_arena, "buffer arena", kmi->buffer_sva, size, 277 PAGE_SIZE, (mp_ncpus > 4) ? BKVASIZE * 8 : 0, 0); 278 firstaddr += size; 279 280 /* 281 * Now swap kva. 282 */ 283 swapbkva = firstaddr; 284 size = (long)nswbuf * MAXPHYS; 285 firstaddr += size; 286 287 /* 288 * And optionally transient bio space. 289 */ 290 if (bio_transient_maxcnt != 0) { 291 size = (long)bio_transient_maxcnt * MAXPHYS; 292 vmem_init(transient_arena, "transient arena", 293 firstaddr, size, PAGE_SIZE, 0, 0); 294 firstaddr += size; 295 } 296 if (firstaddr != kmi->clean_eva) 297 panic("Clean map calculation incorrect"); 298 299 /* 300 * Allocate the pageable submaps. We may cache an exec map entry per 301 * CPU, so we therefore need to reserve space for at least ncpu+1 302 * entries to avoid deadlock. The exec map is also used by some image 303 * activators, so we leave a fixed number of pages for their use. 304 */ 305 #ifdef __LP64__ 306 exec_map_entries = 8 * mp_ncpus; 307 #else 308 exec_map_entries = 2 * mp_ncpus + 4; 309 #endif 310 exec_map_entry_size = round_page(PATH_MAX + ARG_MAX); 311 exec_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr, 312 exec_map_entries * exec_map_entry_size + 64 * PAGE_SIZE, FALSE); 313 pipe_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr, maxpipekva, 314 FALSE); 315 } 316