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 * 35 * Copyright (c) 1987, 1990 Carnegie-Mellon University. 36 * All rights reserved. 37 * 38 * Authors: Avadis Tevanian, Jr., Michael Wayne Young 39 * 40 * Permission to use, copy, modify and distribute this software and 41 * its documentation is hereby granted, provided that both the copyright 42 * notice and this permission notice appear in all copies of the 43 * software, derivative works or modified versions, and any portions 44 * thereof, and that both notices appear in supporting documentation. 45 * 46 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" 47 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND 48 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. 49 * 50 * Carnegie Mellon requests users of this software to return to 51 * 52 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU 53 * School of Computer Science 54 * Carnegie Mellon University 55 * Pittsburgh PA 15213-3890 56 * 57 * any improvements or extensions that they make and grant Carnegie the 58 * rights to redistribute these changes. 59 */ 60 61 /* 62 * Initialize the Virtual Memory subsystem. 63 */ 64 65 #include <sys/cdefs.h> 66 #include <sys/param.h> 67 #include <sys/domainset.h> 68 #include <sys/kernel.h> 69 #include <sys/lock.h> 70 #include <sys/proc.h> 71 #include <sys/rwlock.h> 72 #include <sys/malloc.h> 73 #include <sys/sysctl.h> 74 #include <sys/systm.h> 75 #include <sys/selinfo.h> 76 #include <sys/smp.h> 77 #include <sys/pipe.h> 78 #include <sys/bio.h> 79 #include <sys/buf.h> 80 #include <sys/vmem.h> 81 #include <sys/vmmeter.h> 82 83 #include <vm/vm.h> 84 #include <vm/vm_param.h> 85 #include <vm/vm_kern.h> 86 #include <vm/vm_object.h> 87 #include <vm/vm_page.h> 88 #include <vm/vm_phys.h> 89 #include <vm/vm_pagequeue.h> 90 #include <vm/vm_map.h> 91 #include <vm/vm_pager.h> 92 #include <vm/vm_extern.h> 93 94 extern void uma_startup1(vm_offset_t); 95 96 long physmem; 97 98 /* 99 * System initialization 100 */ 101 static void vm_mem_init(void *); 102 SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL); 103 104 /* 105 * vm_init initializes the virtual memory system. 106 * This is done only by the first cpu up. 107 */ 108 static void 109 vm_mem_init(void *dummy) 110 { 111 112 /* 113 * Initialize static domainsets, used by various allocators. 114 */ 115 domainset_init(); 116 117 /* 118 * Initialize resident memory structures. From here on, all physical 119 * memory is accounted for, and we use only virtual addresses. 120 */ 121 vm_set_page_size(); 122 virtual_avail = vm_page_startup(virtual_avail); 123 124 /* 125 * Set an initial domain policy for thread0 so that allocations 126 * can work. 127 */ 128 domainset_zero(); 129 130 /* Bootstrap the kernel memory allocator. */ 131 uma_startup1(virtual_avail); 132 133 /* 134 * Initialize other VM packages 135 */ 136 vmem_startup(); 137 vm_object_init(); 138 vm_map_startup(); 139 kmem_init(virtual_avail, virtual_end); 140 141 kmem_init_zero_region(); 142 pmap_init(); 143 vm_pager_init(); 144 } 145 146 void 147 vm_ksubmap_init(struct kva_md_info *kmi) 148 { 149 caddr_t firstaddr, v; 150 vm_size_t size = 0; 151 long physmem_est; 152 vm_offset_t minaddr; 153 vm_offset_t maxaddr; 154 155 TSENTER(); 156 /* 157 * Allocate space for system data structures. 158 * The first available kernel virtual address is in "v". 159 * As pages of kernel virtual memory are allocated, "v" is incremented. 160 * As pages of memory are allocated and cleared, 161 * "firstaddr" is incremented. 162 */ 163 164 /* 165 * Make two passes. The first pass calculates how much memory is 166 * needed and allocates it. The second pass assigns virtual 167 * addresses to the various data structures. 168 */ 169 firstaddr = NULL; 170 again: 171 v = firstaddr; 172 173 /* 174 * Discount the physical memory larger than the size of kernel_map 175 * to avoid eating up all of KVA space. 176 */ 177 physmem_est = lmin(physmem, btoc(vm_map_max(kernel_map) - 178 vm_map_min(kernel_map))); 179 180 v = kern_vfs_bio_buffer_alloc(v, physmem_est); 181 182 /* 183 * End of first pass, size has been calculated so allocate memory 184 */ 185 if (firstaddr == NULL) { 186 size = (vm_size_t)v; 187 #ifdef VM_FREELIST_DMA32 188 /* 189 * Try to protect 32-bit DMAable memory from the largest 190 * early alloc of wired mem. 191 */ 192 firstaddr = kmem_alloc_attr(size, M_ZERO | M_NOWAIT, 193 (vm_paddr_t)1 << 32, ~(vm_paddr_t)0, VM_MEMATTR_DEFAULT); 194 if (firstaddr == NULL) 195 #endif 196 firstaddr = kmem_malloc(size, M_ZERO | M_WAITOK); 197 if (firstaddr == NULL) 198 panic("startup: no room for tables"); 199 goto again; 200 } 201 202 /* 203 * End of second pass, addresses have been assigned 204 */ 205 if ((vm_size_t)(v - firstaddr) != size) 206 panic("startup: table size inconsistency"); 207 208 /* 209 * Allocate the clean map to hold all of I/O virtual memory. 210 */ 211 size = (long)nbuf * BKVASIZE + (long)bio_transient_maxcnt * maxphys; 212 kmi->clean_sva = kva_alloc(size); 213 kmi->clean_eva = kmi->clean_sva + size; 214 215 /* 216 * Allocate the buffer arena. 217 * 218 * Enable the quantum cache if we have more than 4 cpus. This 219 * avoids lock contention at the expense of some fragmentation. 220 */ 221 size = (long)nbuf * BKVASIZE; 222 kmi->buffer_sva = kmi->clean_sva; 223 kmi->buffer_eva = kmi->buffer_sva + size; 224 vmem_init(buffer_arena, "buffer arena", kmi->buffer_sva, size, 225 PAGE_SIZE, (mp_ncpus > 4) ? BKVASIZE * 8 : 0, M_WAITOK); 226 227 /* 228 * And optionally transient bio space. 229 */ 230 if (bio_transient_maxcnt != 0) { 231 size = (long)bio_transient_maxcnt * maxphys; 232 vmem_init(transient_arena, "transient arena", 233 kmi->buffer_eva, size, PAGE_SIZE, 0, M_WAITOK); 234 } 235 236 /* 237 * Allocate the pageable submaps. We may cache an exec map entry per 238 * CPU, so we therefore need to reserve space for at least ncpu+1 239 * entries to avoid deadlock. The exec map is also used by some image 240 * activators, so we leave a fixed number of pages for their use. 241 */ 242 #ifdef __LP64__ 243 exec_map_entries = 8 * mp_ncpus; 244 #else 245 exec_map_entries = 2 * mp_ncpus + 4; 246 #endif 247 exec_map_entry_size = round_page(PATH_MAX + ARG_MAX); 248 kmem_subinit(exec_map, kernel_map, &minaddr, &maxaddr, 249 exec_map_entries * exec_map_entry_size + 64 * PAGE_SIZE, false); 250 kmem_subinit(pipe_map, kernel_map, &minaddr, &maxaddr, maxpipekva, 251 false); 252 TSEXIT(); 253 } 254