2 * SPDX-License-Identifier: (BSD-3-Clause AND MIT-CMU)
4 * Copyright (c) 1991, 1993
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
8 * The Mach Operating System project at Carnegie-Mellon University.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
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.
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
34 * from: @(#)vm_init.c 8.1 (Berkeley) 6/11/93
37 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
38 * All rights reserved.
40 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
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.
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.
52 * Carnegie Mellon requests users of this software to return to
54 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
55 * School of Computer Science
56 * Carnegie Mellon University
57 * Pittsburgh PA 15213-3890
59 * any improvements or extensions that they make and grant Carnegie the
60 * rights to redistribute these changes.
64 * Initialize the Virtual Memory subsystem.
67 #include <sys/cdefs.h>
68 __FBSDID("$FreeBSD$");
70 #include <sys/param.h>
71 #include <sys/kernel.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>
84 #include <sys/vmmeter.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>
97 extern void uma_startup1(void);
98 extern void uma_startup2(void);
99 extern void vm_radix_reserve_kva(void);
101 #if VM_NRESERVLEVEL > 0
102 #define KVA_QUANTUM (1 << (VM_LEVEL_0_ORDER + PAGE_SHIFT))
104 /* On non-superpage architectures want large import sizes. */
105 #define KVA_QUANTUM (PAGE_SIZE * 1024)
110 * System initialization
112 static void vm_mem_init(void *);
113 SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL);
116 * Import kva into the kernel arena.
119 kva_import(void *unused, vmem_size_t size, int flags, vmem_addr_t *addrp)
124 KASSERT((size % KVA_QUANTUM) == 0,
125 ("kva_import: Size %jd is not a multiple of %d",
126 (intmax_t)size, (int)KVA_QUANTUM));
127 addr = vm_map_min(kernel_map);
128 result = vm_map_find(kernel_map, NULL, 0, &addr, size, 0,
129 VMFS_SUPER_SPACE, VM_PROT_ALL, VM_PROT_ALL, MAP_NOFAULT);
130 if (result != KERN_SUCCESS)
139 * vm_init initializes the virtual memory system.
140 * This is done only by the first cpu up.
142 * The start and end address of physical memory is passed in.
152 * Initializes resident memory structures. From here on, all physical
153 * memory is accounted for, and we use only virtual addresses.
156 virtual_avail = vm_page_startup(virtual_avail);
158 #ifdef UMA_MD_SMALL_ALLOC
159 /* Announce page availability to UMA. */
163 * Initialize other VM packages
168 kmem_init(virtual_avail, virtual_end);
171 * Initialize the kernel_arena. This can grow on demand.
173 vmem_init(kernel_arena, "kernel arena", 0, 0, PAGE_SIZE, 0, 0);
174 vmem_set_import(kernel_arena, kva_import, NULL, NULL, KVA_QUANTUM);
176 for (domain = 0; domain < vm_ndomains; domain++) {
177 vm_dom[domain].vmd_kernel_arena = vmem_create(
178 "kernel arena domain", 0, 0, PAGE_SIZE, 0, M_WAITOK);
179 vmem_set_import(vm_dom[domain].vmd_kernel_arena,
180 (vmem_import_t *)vmem_alloc, NULL, kernel_arena,
184 #ifndef UMA_MD_SMALL_ALLOC
185 /* Set up radix zone to use noobj_alloc. */
186 vm_radix_reserve_kva();
188 /* Announce full page availability to UMA. */
190 kmem_init_zero_region();
196 vm_ksubmap_init(struct kva_md_info *kmi)
198 vm_offset_t firstaddr;
206 * Allocate space for system data structures.
207 * The first available kernel virtual address is in "v".
208 * As pages of kernel virtual memory are allocated, "v" is incremented.
209 * As pages of memory are allocated and cleared,
210 * "firstaddr" is incremented.
214 * Make two passes. The first pass calculates how much memory is
215 * needed and allocates it. The second pass assigns virtual
216 * addresses to the various data structures.
220 v = (caddr_t)firstaddr;
223 * Discount the physical memory larger than the size of kernel_map
224 * to avoid eating up all of KVA space.
226 physmem_est = lmin(physmem, btoc(kernel_map->max_offset -
227 kernel_map->min_offset));
229 v = kern_vfs_bio_buffer_alloc(v, physmem_est);
232 * End of first pass, size has been calculated so allocate memory
234 if (firstaddr == 0) {
236 #ifdef VM_FREELIST_DMA32
238 * Try to protect 32-bit DMAable memory from the largest
239 * early alloc of wired mem.
241 firstaddr = kmem_alloc_attr(kernel_arena, size,
242 M_ZERO | M_NOWAIT, (vm_paddr_t)1 << 32,
243 ~(vm_paddr_t)0, VM_MEMATTR_DEFAULT);
246 firstaddr = kmem_malloc(kernel_arena, size,
249 panic("startup: no room for tables");
254 * End of second pass, addresses have been assigned
256 if ((vm_size_t)((char *)v - firstaddr) != size)
257 panic("startup: table size inconsistency");
260 * Allocate the clean map to hold all of the paging and I/O virtual
263 size = (long)nbuf * BKVASIZE + (long)nswbuf * MAXPHYS +
264 (long)bio_transient_maxcnt * MAXPHYS;
265 kmi->clean_sva = firstaddr = kva_alloc(size);
266 kmi->clean_eva = firstaddr + size;
269 * Allocate the buffer arena.
271 * Enable the quantum cache if we have more than 4 cpus. This
272 * avoids lock contention at the expense of some fragmentation.
274 size = (long)nbuf * BKVASIZE;
275 kmi->buffer_sva = firstaddr;
276 kmi->buffer_eva = kmi->buffer_sva + size;
277 vmem_init(buffer_arena, "buffer arena", kmi->buffer_sva, size,
278 PAGE_SIZE, (mp_ncpus > 4) ? BKVASIZE * 8 : 0, 0);
284 swapbkva = firstaddr;
285 size = (long)nswbuf * MAXPHYS;
289 * And optionally transient bio space.
291 if (bio_transient_maxcnt != 0) {
292 size = (long)bio_transient_maxcnt * MAXPHYS;
293 vmem_init(transient_arena, "transient arena",
294 firstaddr, size, PAGE_SIZE, 0, 0);
297 if (firstaddr != kmi->clean_eva)
298 panic("Clean map calculation incorrect");
301 * Allocate the pageable submaps. We may cache an exec map entry per
302 * CPU, so we therefore need to reserve space for at least ncpu+1
303 * entries to avoid deadlock. The exec map is also used by some image
304 * activators, so we leave a fixed number of pages for their use.
307 exec_map_entries = 8 * mp_ncpus;
309 exec_map_entries = 2 * mp_ncpus + 4;
311 exec_map_entry_size = round_page(PATH_MAX + ARG_MAX);
312 exec_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr,
313 exec_map_entries * exec_map_entry_size + 64 * PAGE_SIZE, FALSE);
314 pipe_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr, maxpipekva,