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
35 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
36 * All rights reserved.
38 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
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.
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.
50 * Carnegie Mellon requests users of this software to return to
52 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
53 * School of Computer Science
54 * Carnegie Mellon University
55 * Pittsburgh PA 15213-3890
57 * any improvements or extensions that they make and grant Carnegie the
58 * rights to redistribute these changes.
62 * Initialize the Virtual Memory subsystem.
65 #include <sys/param.h>
66 #include <sys/domainset.h>
67 #include <sys/kernel.h>
70 #include <sys/rwlock.h>
71 #include <sys/malloc.h>
72 #include <sys/sysctl.h>
73 #include <sys/systm.h>
74 #include <sys/selinfo.h>
80 #include <sys/vmmeter.h>
83 #include <vm/vm_param.h>
84 #include <vm/vm_kern.h>
85 #include <vm/vm_object.h>
86 #include <vm/vm_page.h>
87 #include <vm/vm_phys.h>
88 #include <vm/vm_pagequeue.h>
89 #include <vm/vm_map.h>
90 #include <vm/vm_pager.h>
91 #include <vm/vm_extern.h>
93 extern void uma_startup1(vm_offset_t);
98 * System initialization
100 static void vm_mem_init(void *);
101 SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL);
104 * vm_init initializes the virtual memory system.
105 * This is done only by the first cpu up.
108 vm_mem_init(void *dummy)
112 * Initialize static domainsets, used by various allocators.
117 * Initialize resident memory structures. From here on, all physical
118 * memory is accounted for, and we use only virtual addresses.
121 virtual_avail = vm_page_startup(virtual_avail);
124 * Set an initial domain policy for thread0 so that allocations
129 /* Bootstrap the kernel memory allocator. */
130 uma_startup1(virtual_avail);
133 * Initialize other VM packages
138 kmem_init(virtual_avail, virtual_end);
140 kmem_init_zero_region();
146 vm_ksubmap_init(struct kva_md_info *kmi)
148 caddr_t firstaddr, v;
156 * Allocate space for system data structures.
157 * The first available kernel virtual address is in "v".
158 * As pages of kernel virtual memory are allocated, "v" is incremented.
159 * As pages of memory are allocated and cleared,
160 * "firstaddr" is incremented.
164 * Make two passes. The first pass calculates how much memory is
165 * needed and allocates it. The second pass assigns virtual
166 * addresses to the various data structures.
173 * Discount the physical memory larger than the size of kernel_map
174 * to avoid eating up all of KVA space.
176 physmem_est = lmin(physmem, btoc(vm_map_max(kernel_map) -
177 vm_map_min(kernel_map)));
179 v = kern_vfs_bio_buffer_alloc(v, physmem_est);
182 * End of first pass, size has been calculated so allocate memory
184 if (firstaddr == NULL) {
186 #ifdef VM_FREELIST_DMA32
188 * Try to protect 32-bit DMAable memory from the largest
189 * early alloc of wired mem.
191 firstaddr = kmem_alloc_attr(size, M_ZERO | M_NOWAIT,
192 (vm_paddr_t)1 << 32, ~(vm_paddr_t)0, VM_MEMATTR_DEFAULT);
193 if (firstaddr == NULL)
195 firstaddr = kmem_malloc(size, M_ZERO | M_WAITOK);
196 if (firstaddr == NULL)
197 panic("startup: no room for tables");
202 * End of second pass, addresses have been assigned
204 if ((vm_size_t)(v - firstaddr) != size)
205 panic("startup: table size inconsistency");
208 * Allocate the clean map to hold all of I/O virtual memory.
210 size = (long)nbuf * BKVASIZE + (long)bio_transient_maxcnt * maxphys;
211 kmi->clean_sva = kva_alloc(size);
212 kmi->clean_eva = kmi->clean_sva + size;
215 * Allocate the buffer arena.
217 * Enable the quantum cache if we have more than 4 cpus. This
218 * avoids lock contention at the expense of some fragmentation.
220 size = (long)nbuf * BKVASIZE;
221 kmi->buffer_sva = kmi->clean_sva;
222 kmi->buffer_eva = kmi->buffer_sva + size;
223 vmem_init(buffer_arena, "buffer arena", kmi->buffer_sva, size,
224 PAGE_SIZE, (mp_ncpus > 4) ? BKVASIZE * 8 : 0, M_WAITOK);
227 * And optionally transient bio space.
229 if (bio_transient_maxcnt != 0) {
230 size = (long)bio_transient_maxcnt * maxphys;
231 vmem_init(transient_arena, "transient arena",
232 kmi->buffer_eva, size, PAGE_SIZE, 0, M_WAITOK);
236 * Allocate the pageable submaps. We may cache an exec map entry per
237 * CPU, so we therefore need to reserve space for at least ncpu+1
238 * entries to avoid deadlock. The exec map is also used by some image
239 * activators, so we leave a fixed number of pages for their use.
242 exec_map_entries = 8 * mp_ncpus;
244 exec_map_entries = 2 * mp_ncpus + 4;
246 exec_map_entry_size = round_page(PATH_MAX + ARG_MAX);
247 kmem_subinit(exec_map, kernel_map, &minaddr, &maxaddr,
248 exec_map_entries * exec_map_entry_size + 64 * PAGE_SIZE, false);
249 kmem_subinit(pipe_map, kernel_map, &minaddr, &maxaddr, maxpipekva,