1 /*- 2 * Copyright (c) 1991, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * The Mach Operating System project at Carnegie-Mellon University. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 3. Neither the name of the University nor the names of its contributors 17 * may be used to endorse or promote products derived from this software 18 * without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 * 32 * from: @(#)vm_init.c 8.1 (Berkeley) 6/11/93 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 __FBSDID("$FreeBSD$"); 67 68 #include <sys/param.h> 69 #include <sys/kernel.h> 70 #include <sys/lock.h> 71 #include <sys/proc.h> 72 #include <sys/rwlock.h> 73 #include <sys/malloc.h> 74 #include <sys/sysctl.h> 75 #include <sys/systm.h> 76 #include <sys/selinfo.h> 77 #include <sys/smp.h> 78 #include <sys/pipe.h> 79 #include <sys/bio.h> 80 #include <sys/buf.h> 81 #include <sys/vmem.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_map.h> 89 #include <vm/vm_pager.h> 90 #include <vm/vm_extern.h> 91 92 long physmem; 93 94 /* 95 * System initialization 96 */ 97 static void vm_mem_init(void *); 98 SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL); 99 100 /* 101 * Import kva into the kernel arena. 102 */ 103 static int 104 kva_import(void *unused, vmem_size_t size, int flags, vmem_addr_t *addrp) 105 { 106 vm_offset_t addr; 107 int result; 108 109 addr = vm_map_min(kernel_map); 110 result = vm_map_find(kernel_map, NULL, 0, &addr, size, 0, 111 VMFS_SUPER_SPACE, VM_PROT_ALL, VM_PROT_ALL, MAP_NOFAULT); 112 if (result != KERN_SUCCESS) 113 return (ENOMEM); 114 115 *addrp = addr; 116 117 return (0); 118 } 119 120 /* 121 * vm_init initializes the virtual memory system. 122 * This is done only by the first cpu up. 123 * 124 * The start and end address of physical memory is passed in. 125 */ 126 /* ARGSUSED*/ 127 static void 128 vm_mem_init(dummy) 129 void *dummy; 130 { 131 132 /* 133 * Initializes resident memory structures. From here on, all physical 134 * memory is accounted for, and we use only virtual addresses. 135 */ 136 vm_set_page_size(); 137 virtual_avail = vm_page_startup(virtual_avail); 138 139 /* 140 * Initialize other VM packages 141 */ 142 vmem_startup(); 143 vm_object_init(); 144 vm_map_startup(); 145 kmem_init(virtual_avail, virtual_end); 146 147 /* 148 * Initialize the kernel_arena. This can grow on demand. 149 */ 150 vmem_init(kernel_arena, "kernel arena", 0, 0, PAGE_SIZE, 0, 0); 151 vmem_set_import(kernel_arena, kva_import, NULL, NULL, 152 #if VM_NRESERVLEVEL > 0 153 1 << (VM_LEVEL_0_ORDER + PAGE_SHIFT)); 154 #else 155 /* On non-superpage architectures want large import sizes. */ 156 PAGE_SIZE * 1024); 157 #endif 158 159 kmem_init_zero_region(); 160 pmap_init(); 161 vm_pager_init(); 162 } 163 164 void 165 vm_ksubmap_init(struct kva_md_info *kmi) 166 { 167 vm_offset_t firstaddr; 168 caddr_t v; 169 vm_size_t size = 0; 170 long physmem_est; 171 vm_offset_t minaddr; 172 vm_offset_t maxaddr; 173 174 /* 175 * Allocate space for system data structures. 176 * The first available kernel virtual address is in "v". 177 * As pages of kernel virtual memory are allocated, "v" is incremented. 178 * As pages of memory are allocated and cleared, 179 * "firstaddr" is incremented. 180 */ 181 182 /* 183 * Make two passes. The first pass calculates how much memory is 184 * needed and allocates it. The second pass assigns virtual 185 * addresses to the various data structures. 186 */ 187 firstaddr = 0; 188 again: 189 v = (caddr_t)firstaddr; 190 191 /* 192 * Discount the physical memory larger than the size of kernel_map 193 * to avoid eating up all of KVA space. 194 */ 195 physmem_est = lmin(physmem, btoc(kernel_map->max_offset - 196 kernel_map->min_offset)); 197 198 v = kern_vfs_bio_buffer_alloc(v, physmem_est); 199 200 /* 201 * End of first pass, size has been calculated so allocate memory 202 */ 203 if (firstaddr == 0) { 204 size = (vm_size_t)v; 205 #ifdef VM_FREELIST_DMA32 206 /* 207 * Try to protect 32-bit DMAable memory from the largest 208 * early alloc of wired mem. 209 */ 210 firstaddr = kmem_alloc_attr(kernel_arena, size, 211 M_ZERO | M_NOWAIT, (vm_paddr_t)1 << 32, 212 ~(vm_paddr_t)0, VM_MEMATTR_DEFAULT); 213 if (firstaddr == 0) 214 #endif 215 firstaddr = kmem_malloc(kernel_arena, size, 216 M_ZERO | M_WAITOK); 217 if (firstaddr == 0) 218 panic("startup: no room for tables"); 219 goto again; 220 } 221 222 /* 223 * End of second pass, addresses have been assigned 224 */ 225 if ((vm_size_t)((char *)v - firstaddr) != size) 226 panic("startup: table size inconsistency"); 227 228 /* 229 * Allocate the clean map to hold all of the paging and I/O virtual 230 * memory. 231 */ 232 size = (long)nbuf * BKVASIZE + (long)nswbuf * MAXPHYS + 233 (long)bio_transient_maxcnt * MAXPHYS; 234 kmi->clean_sva = firstaddr = kva_alloc(size); 235 kmi->clean_eva = firstaddr + size; 236 237 /* 238 * Allocate the buffer arena. 239 * 240 * Enable the quantum cache if we have more than 4 cpus. This 241 * avoids lock contention at the expense of some fragmentation. 242 */ 243 size = (long)nbuf * BKVASIZE; 244 kmi->buffer_sva = firstaddr; 245 kmi->buffer_eva = kmi->buffer_sva + size; 246 vmem_init(buffer_arena, "buffer arena", kmi->buffer_sva, size, 247 PAGE_SIZE, (mp_ncpus > 4) ? BKVASIZE * 8 : 0, 0); 248 firstaddr += size; 249 250 /* 251 * Now swap kva. 252 */ 253 swapbkva = firstaddr; 254 size = (long)nswbuf * MAXPHYS; 255 firstaddr += size; 256 257 /* 258 * And optionally transient bio space. 259 */ 260 if (bio_transient_maxcnt != 0) { 261 size = (long)bio_transient_maxcnt * MAXPHYS; 262 vmem_init(transient_arena, "transient arena", 263 firstaddr, size, PAGE_SIZE, 0, 0); 264 firstaddr += size; 265 } 266 if (firstaddr != kmi->clean_eva) 267 panic("Clean map calculation incorrect"); 268 269 /* 270 * Allocate the pageable submaps. We may cache an exec map entry per 271 * CPU, so we therefore need to reserve space for at least ncpu+1 272 * entries to avoid deadlock. The exec map is also used by some image 273 * activators, so we leave a fixed number of pages for their use. 274 */ 275 #ifdef __LP64__ 276 exec_map_entries = 8 * mp_ncpus; 277 #else 278 exec_map_entries = 2 * mp_ncpus + 4; 279 #endif 280 exec_map_entry_size = round_page(PATH_MAX + ARG_MAX); 281 exec_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr, 282 exec_map_entries * exec_map_entry_size + 64 * PAGE_SIZE, FALSE); 283 pipe_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr, maxpipekva, 284 FALSE); 285 } 286