xref: /freebsd/sys/vm/vm_init.c (revision d101cdd6edd782f6ec56eef63ed91abd77a8b317)
1 /*-
2  * SPDX-License-Identifier: (BSD-3-Clause AND MIT-CMU)
3  *
4  * Copyright (c) 1991, 1993
5  *	The Regents of the University of California.  All rights reserved.
6  *
7  * This code is derived from software contributed to Berkeley by
8  * The Mach Operating System project at Carnegie-Mellon University.
9  *
10  * Redistribution and use in source and binary forms, with or without
11  * modification, are permitted provided that the following conditions
12  * are met:
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.
21  *
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
32  * SUCH DAMAGE.
33  *
34  *	from: @(#)vm_init.c	8.1 (Berkeley) 6/11/93
35  *
36  *
37  * Copyright (c) 1987, 1990 Carnegie-Mellon University.
38  * All rights reserved.
39  *
40  * Authors: Avadis Tevanian, Jr., Michael Wayne Young
41  *
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.
47  *
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.
51  *
52  * Carnegie Mellon requests users of this software to return to
53  *
54  *  Software Distribution Coordinator  or  Software.Distribution@CS.CMU.EDU
55  *  School of Computer Science
56  *  Carnegie Mellon University
57  *  Pittsburgh PA 15213-3890
58  *
59  * any improvements or extensions that they make and grant Carnegie the
60  * rights to redistribute these changes.
61  */
62 
63 /*
64  *	Initialize the Virtual Memory subsystem.
65  */
66 
67 #include <sys/cdefs.h>
68 __FBSDID("$FreeBSD$");
69 
70 #include <sys/param.h>
71 #include <sys/domainset.h>
72 #include <sys/kernel.h>
73 #include <sys/lock.h>
74 #include <sys/proc.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>
80 #include <sys/smp.h>
81 #include <sys/pipe.h>
82 #include <sys/bio.h>
83 #include <sys/buf.h>
84 #include <sys/vmem.h>
85 #include <sys/vmmeter.h>
86 
87 #include <vm/vm.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>
97 
98 extern void	uma_startup1(vm_offset_t);
99 
100 long physmem;
101 
102 /*
103  * System initialization
104  */
105 static void vm_mem_init(void *);
106 SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL);
107 
108 /*
109  *	vm_init initializes the virtual memory system.
110  *	This is done only by the first cpu up.
111  */
112 static void
113 vm_mem_init(void *dummy)
114 {
115 
116 	/*
117 	 * Initialize static domainsets, used by various allocators.
118 	 */
119 	domainset_init();
120 
121 	/*
122 	 * Initialize resident memory structures.  From here on, all physical
123 	 * memory is accounted for, and we use only virtual addresses.
124 	 */
125 	vm_set_page_size();
126 	virtual_avail = vm_page_startup(virtual_avail);
127 
128 	/*
129 	 * Set an initial domain policy for thread0 so that allocations
130 	 * can work.
131 	 */
132 	domainset_zero();
133 
134 	/* Bootstrap the kernel memory allocator. */
135 	uma_startup1(virtual_avail);
136 
137 	/*
138 	 * Initialize other VM packages
139 	 */
140 	vmem_startup();
141 	vm_object_init();
142 	vm_map_startup();
143 	kmem_init(virtual_avail, virtual_end);
144 
145 	kmem_init_zero_region();
146 	pmap_init();
147 	vm_pager_init();
148 }
149 
150 void
151 vm_ksubmap_init(struct kva_md_info *kmi)
152 {
153 	caddr_t firstaddr, v;
154 	vm_size_t size = 0;
155 	long physmem_est;
156 	vm_offset_t minaddr;
157 	vm_offset_t maxaddr;
158 
159 	/*
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.
165 	 */
166 
167 	/*
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.
171 	 */
172 	firstaddr = NULL;
173 again:
174 	v = firstaddr;
175 
176 	/*
177 	 * Discount the physical memory larger than the size of kernel_map
178 	 * to avoid eating up all of KVA space.
179 	 */
180 	physmem_est = lmin(physmem, btoc(vm_map_max(kernel_map) -
181 	    vm_map_min(kernel_map)));
182 
183 	v = kern_vfs_bio_buffer_alloc(v, physmem_est);
184 
185 	/*
186 	 * End of first pass, size has been calculated so allocate memory
187 	 */
188 	if (firstaddr == NULL) {
189 		size = (vm_size_t)v;
190 #ifdef VM_FREELIST_DMA32
191 		/*
192 		 * Try to protect 32-bit DMAable memory from the largest
193 		 * early alloc of wired mem.
194 		 */
195 		firstaddr = kmem_alloc_attr(size, M_ZERO | M_NOWAIT,
196 		    (vm_paddr_t)1 << 32, ~(vm_paddr_t)0, VM_MEMATTR_DEFAULT);
197 		if (firstaddr == NULL)
198 #endif
199 			firstaddr = kmem_malloc(size, M_ZERO | M_WAITOK);
200 		if (firstaddr == NULL)
201 			panic("startup: no room for tables");
202 		goto again;
203 	}
204 
205 	/*
206 	 * End of second pass, addresses have been assigned
207 	 */
208 	if ((vm_size_t)(v - firstaddr) != size)
209 		panic("startup: table size inconsistency");
210 
211 	/*
212 	 * Allocate the clean map to hold all of I/O virtual memory.
213 	 */
214 	size = (long)nbuf * BKVASIZE + (long)bio_transient_maxcnt * maxphys;
215 	kmi->clean_sva = kva_alloc(size);
216 	kmi->clean_eva = kmi->clean_sva + size;
217 
218 	/*
219 	 * Allocate the buffer arena.
220 	 *
221 	 * Enable the quantum cache if we have more than 4 cpus.  This
222 	 * avoids lock contention at the expense of some fragmentation.
223 	 */
224 	size = (long)nbuf * BKVASIZE;
225 	kmi->buffer_sva = kmi->clean_sva;
226 	kmi->buffer_eva = kmi->buffer_sva + size;
227 	vmem_init(buffer_arena, "buffer arena", kmi->buffer_sva, size,
228 	    PAGE_SIZE, (mp_ncpus > 4) ? BKVASIZE * 8 : 0, M_WAITOK);
229 
230 	/*
231 	 * And optionally transient bio space.
232 	 */
233 	if (bio_transient_maxcnt != 0) {
234 		size = (long)bio_transient_maxcnt * maxphys;
235 		vmem_init(transient_arena, "transient arena",
236 		    kmi->buffer_eva, size, PAGE_SIZE, 0, M_WAITOK);
237 	}
238 
239 	/*
240 	 * Allocate the pageable submaps.  We may cache an exec map entry per
241 	 * CPU, so we therefore need to reserve space for at least ncpu+1
242 	 * entries to avoid deadlock.  The exec map is also used by some image
243 	 * activators, so we leave a fixed number of pages for their use.
244 	 */
245 #ifdef __LP64__
246 	exec_map_entries = 8 * mp_ncpus;
247 #else
248 	exec_map_entries = 2 * mp_ncpus + 4;
249 #endif
250 	exec_map_entry_size = round_page(PATH_MAX + ARG_MAX);
251 	kmem_subinit(exec_map, kernel_map, &minaddr, &maxaddr,
252 	    exec_map_entries * exec_map_entry_size + 64 * PAGE_SIZE, false);
253 	kmem_subinit(pipe_map, kernel_map, &minaddr, &maxaddr, maxpipekva,
254 	    false);
255 }
256