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);
104 * System initialization
106 static void vm_mem_init(void *);
107 SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL);
110 * vm_init initializes the virtual memory system.
111 * This is done only by the first cpu up.
113 * The start and end address of physical memory is passed in.
116 vm_mem_init(void *dummy)
120 * Initializes resident memory structures. From here on, all physical
121 * memory is accounted for, and we use only virtual addresses.
124 virtual_avail = vm_page_startup(virtual_avail);
126 #ifdef UMA_MD_SMALL_ALLOC
127 /* Announce page availability to UMA. */
131 * Initialize other VM packages
136 kmem_init(virtual_avail, virtual_end);
138 #ifndef UMA_MD_SMALL_ALLOC
139 /* Set up radix zone to use noobj_alloc. */
140 vm_radix_reserve_kva();
142 /* Announce full page availability to UMA. */
144 kmem_init_zero_region();
150 vm_ksubmap_init(struct kva_md_info *kmi)
152 vm_offset_t firstaddr;
160 * Allocate space for system data structures.
161 * The first available kernel virtual address is in "v".
162 * As pages of kernel virtual memory are allocated, "v" is incremented.
163 * As pages of memory are allocated and cleared,
164 * "firstaddr" is incremented.
168 * Make two passes. The first pass calculates how much memory is
169 * needed and allocates it. The second pass assigns virtual
170 * addresses to the various data structures.
174 v = (caddr_t)firstaddr;
177 * Discount the physical memory larger than the size of kernel_map
178 * to avoid eating up all of KVA space.
180 physmem_est = lmin(physmem, btoc(vm_map_max(kernel_map) -
181 vm_map_min(kernel_map)));
183 v = kern_vfs_bio_buffer_alloc(v, physmem_est);
186 * End of first pass, size has been calculated so allocate memory
188 if (firstaddr == 0) {
190 #ifdef VM_FREELIST_DMA32
192 * Try to protect 32-bit DMAable memory from the largest
193 * early alloc of wired mem.
195 firstaddr = kmem_alloc_attr(size, M_ZERO | M_NOWAIT,
196 (vm_paddr_t)1 << 32, ~(vm_paddr_t)0, VM_MEMATTR_DEFAULT);
199 firstaddr = kmem_malloc(size, M_ZERO | M_WAITOK);
201 panic("startup: no room for tables");
206 * End of second pass, addresses have been assigned
208 if ((vm_size_t)((char *)v - firstaddr) != size)
209 panic("startup: table size inconsistency");
212 * Allocate the clean map to hold all of the paging and I/O virtual
215 size = (long)nbuf * BKVASIZE + (long)nswbuf * MAXPHYS +
216 (long)bio_transient_maxcnt * MAXPHYS;
217 kmi->clean_sva = firstaddr = kva_alloc(size);
218 kmi->clean_eva = firstaddr + size;
221 * Allocate the buffer arena.
223 * Enable the quantum cache if we have more than 4 cpus. This
224 * avoids lock contention at the expense of some fragmentation.
226 size = (long)nbuf * BKVASIZE;
227 kmi->buffer_sva = firstaddr;
228 kmi->buffer_eva = kmi->buffer_sva + size;
229 vmem_init(buffer_arena, "buffer arena", kmi->buffer_sva, size,
230 PAGE_SIZE, (mp_ncpus > 4) ? BKVASIZE * 8 : 0, 0);
236 swapbkva = firstaddr;
237 size = (long)nswbuf * MAXPHYS;
241 * And optionally transient bio space.
243 if (bio_transient_maxcnt != 0) {
244 size = (long)bio_transient_maxcnt * MAXPHYS;
245 vmem_init(transient_arena, "transient arena",
246 firstaddr, size, PAGE_SIZE, 0, 0);
249 if (firstaddr != kmi->clean_eva)
250 panic("Clean map calculation incorrect");
253 * Allocate the pageable submaps. We may cache an exec map entry per
254 * CPU, so we therefore need to reserve space for at least ncpu+1
255 * entries to avoid deadlock. The exec map is also used by some image
256 * activators, so we leave a fixed number of pages for their use.
259 exec_map_entries = 8 * mp_ncpus;
261 exec_map_entries = 2 * mp_ncpus + 4;
263 exec_map_entry_size = round_page(PATH_MAX + ARG_MAX);
264 exec_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr,
265 exec_map_entries * exec_map_entry_size + 64 * PAGE_SIZE, FALSE);
266 pipe_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr, maxpipekva,