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/domainset.h>
72 #include <sys/kernel.h>
75 #include <sys/rwlock.h>
76 #include <sys/malloc.h>
77 #include <sys/sysctl.h>
78 #include <sys/systm.h>
79 #include <sys/selinfo.h>
85 #include <sys/vmmeter.h>
88 #include <vm/vm_param.h>
89 #include <vm/vm_kern.h>
90 #include <vm/vm_object.h>
91 #include <vm/vm_page.h>
92 #include <vm/vm_phys.h>
93 #include <vm/vm_pagequeue.h>
94 #include <vm/vm_map.h>
95 #include <vm/vm_pager.h>
96 #include <vm/vm_extern.h>
98 extern void uma_startup1(void);
99 extern void uma_startup2(void);
100 extern void vm_radix_reserve_kva(void);
105 * System initialization
107 static void vm_mem_init(void *);
108 SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL);
111 * vm_init initializes the virtual memory system.
112 * This is done only by the first cpu up.
114 * The start and end address of physical memory is passed in.
117 vm_mem_init(void *dummy)
121 * Initialize static domainsets, used by various allocators.
126 * Initialize resident memory structures. From here on, all physical
127 * memory is accounted for, and we use only virtual addresses.
130 virtual_avail = vm_page_startup(virtual_avail);
133 * Set an initial domain policy for thread0 so that allocations
138 #ifdef UMA_MD_SMALL_ALLOC
139 /* Announce page availability to UMA. */
143 * Initialize other VM packages
148 kmem_init(virtual_avail, virtual_end);
150 #ifndef UMA_MD_SMALL_ALLOC
151 /* Set up radix zone to use noobj_alloc. */
152 vm_radix_reserve_kva();
154 /* Announce full page availability to UMA. */
156 kmem_init_zero_region();
162 vm_ksubmap_init(struct kva_md_info *kmi)
164 vm_offset_t firstaddr;
172 * Allocate space for system data structures.
173 * The first available kernel virtual address is in "v".
174 * As pages of kernel virtual memory are allocated, "v" is incremented.
175 * As pages of memory are allocated and cleared,
176 * "firstaddr" is incremented.
180 * Make two passes. The first pass calculates how much memory is
181 * needed and allocates it. The second pass assigns virtual
182 * addresses to the various data structures.
186 v = (caddr_t)firstaddr;
189 * Discount the physical memory larger than the size of kernel_map
190 * to avoid eating up all of KVA space.
192 physmem_est = lmin(physmem, btoc(vm_map_max(kernel_map) -
193 vm_map_min(kernel_map)));
195 v = kern_vfs_bio_buffer_alloc(v, physmem_est);
198 * End of first pass, size has been calculated so allocate memory
200 if (firstaddr == 0) {
202 #ifdef VM_FREELIST_DMA32
204 * Try to protect 32-bit DMAable memory from the largest
205 * early alloc of wired mem.
207 firstaddr = kmem_alloc_attr(size, M_ZERO | M_NOWAIT,
208 (vm_paddr_t)1 << 32, ~(vm_paddr_t)0, VM_MEMATTR_DEFAULT);
211 firstaddr = kmem_malloc(size, M_ZERO | M_WAITOK);
213 panic("startup: no room for tables");
218 * End of second pass, addresses have been assigned
220 if ((vm_size_t)((char *)v - firstaddr) != size)
221 panic("startup: table size inconsistency");
224 * Allocate the clean map to hold all of I/O virtual memory.
226 size = (long)nbuf * BKVASIZE + (long)bio_transient_maxcnt * MAXPHYS;
227 kmi->clean_sva = firstaddr = kva_alloc(size);
228 kmi->clean_eva = firstaddr + size;
231 * Allocate the buffer arena.
233 * Enable the quantum cache if we have more than 4 cpus. This
234 * avoids lock contention at the expense of some fragmentation.
236 size = (long)nbuf * BKVASIZE;
237 kmi->buffer_sva = firstaddr;
238 kmi->buffer_eva = kmi->buffer_sva + size;
239 vmem_init(buffer_arena, "buffer arena", kmi->buffer_sva, size,
240 PAGE_SIZE, (mp_ncpus > 4) ? BKVASIZE * 8 : 0, 0);
244 * And optionally transient bio space.
246 if (bio_transient_maxcnt != 0) {
247 size = (long)bio_transient_maxcnt * MAXPHYS;
248 vmem_init(transient_arena, "transient arena",
249 firstaddr, size, PAGE_SIZE, 0, 0);
252 if (firstaddr != kmi->clean_eva)
253 panic("Clean map calculation incorrect");
256 * Allocate the pageable submaps. We may cache an exec map entry per
257 * CPU, so we therefore need to reserve space for at least ncpu+1
258 * entries to avoid deadlock. The exec map is also used by some image
259 * activators, so we leave a fixed number of pages for their use.
262 exec_map_entries = 8 * mp_ncpus;
264 exec_map_entries = 2 * mp_ncpus + 4;
266 exec_map_entry_size = round_page(PATH_MAX + ARG_MAX);
267 exec_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr,
268 exec_map_entries * exec_map_entry_size + 64 * PAGE_SIZE, FALSE);
269 pipe_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr, maxpipekva,