Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
freebsd
GitHub Repository: freebsd/freebsd-src
Path: blob/main/sys/vm/vm_init.c
101853 views
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
*
35
* Copyright (c) 1987, 1990 Carnegie-Mellon University.
36
* All rights reserved.
37
*
38
* Authors: Avadis Tevanian, Jr., Michael Wayne Young
39
*
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.
45
*
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.
49
*
50
* Carnegie Mellon requests users of this software to return to
51
*
52
* Software Distribution Coordinator or [email protected]
53
* School of Computer Science
54
* Carnegie Mellon University
55
* Pittsburgh PA 15213-3890
56
*
57
* any improvements or extensions that they make and grant Carnegie the
58
* rights to redistribute these changes.
59
*/
60
61
/*
62
* Initialize the Virtual Memory subsystem.
63
*/
64
65
#include <sys/param.h>
66
#include <sys/domainset.h>
67
#include <sys/kernel.h>
68
#include <sys/lock.h>
69
#include <sys/proc.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>
75
#include <sys/smp.h>
76
#include <sys/pipe.h>
77
#include <sys/bio.h>
78
#include <sys/buf.h>
79
#include <sys/vmem.h>
80
#include <sys/vmmeter.h>
81
82
#include <vm/vm.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>
92
93
extern void uma_startup1(vm_offset_t);
94
95
long physmem;
96
97
/*
98
* System initialization
99
*/
100
static void vm_mem_init(void *);
101
SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL);
102
103
#ifdef INVARIANTS
104
/*
105
* Ensure that pmap_init() correctly initialized pagesizes[].
106
*/
107
static void
108
vm_check_pagesizes(void)
109
{
110
int i;
111
112
KASSERT(pagesizes[0] == PAGE_SIZE, ("pagesizes[0] != PAGE_SIZE"));
113
for (i = 1; i < MAXPAGESIZES; i++) {
114
KASSERT((pagesizes[i - 1] != 0 &&
115
pagesizes[i - 1] < pagesizes[i]) || pagesizes[i] == 0,
116
("pagesizes[%d ... %d] are misconfigured", i - 1, i));
117
}
118
}
119
#endif
120
121
/*
122
* vm_mem_init() initializes the virtual memory system.
123
* This is done only by the first cpu up.
124
*/
125
static void
126
vm_mem_init(void *dummy)
127
{
128
129
/*
130
* Initialize static domainsets, used by various allocators.
131
*/
132
domainset_init();
133
134
/*
135
* Initialize resident memory structures. From here on, all physical
136
* memory is accounted for, and we use only virtual addresses.
137
*/
138
vm_set_page_size();
139
virtual_avail = vm_page_startup(virtual_avail);
140
141
/*
142
* Set an initial domain policy for thread0 so that allocations
143
* can work.
144
*/
145
domainset_zero();
146
147
/* Bootstrap the kernel memory allocator. */
148
uma_startup1(virtual_avail);
149
150
/*
151
* Initialize other VM packages
152
*/
153
vmem_startup();
154
vm_object_init();
155
vm_map_startup();
156
kmem_init(virtual_avail, virtual_end);
157
158
kmem_init_zero_region();
159
pmap_init();
160
vm_pager_init();
161
162
/*
163
* Now we can properly handle calls into vm_fault() from
164
* kernel page faults during initialization, typically to
165
* panic. Clear the nofaulting flag set for thread0 in the
166
* image, see kern/init_main.c
167
*/
168
curthread->td_pflags &= ~TDP_NOFAULTING;
169
170
#ifdef INVARIANTS
171
vm_check_pagesizes();
172
#endif
173
}
174
175
void
176
vm_ksubmap_init(struct kva_md_info *kmi)
177
{
178
caddr_t firstaddr, v;
179
vm_size_t size = 0;
180
long physmem_est;
181
vm_offset_t minaddr;
182
vm_offset_t maxaddr;
183
184
TSENTER();
185
/*
186
* Allocate space for system data structures.
187
* The first available kernel virtual address is in "v".
188
* As pages of kernel virtual memory are allocated, "v" is incremented.
189
* As pages of memory are allocated and cleared,
190
* "firstaddr" is incremented.
191
*/
192
193
/*
194
* Make two passes. The first pass calculates how much memory is
195
* needed and allocates it. The second pass assigns virtual
196
* addresses to the various data structures.
197
*/
198
firstaddr = NULL;
199
again:
200
v = firstaddr;
201
202
/*
203
* Discount the physical memory larger than the size of kernel_map
204
* to avoid eating up all of KVA space.
205
*/
206
physmem_est = lmin(physmem, btoc(vm_map_max(kernel_map) -
207
vm_map_min(kernel_map)));
208
209
v = kern_vfs_bio_buffer_alloc(v, physmem_est);
210
211
/*
212
* End of first pass, size has been calculated so allocate memory
213
*/
214
if (firstaddr == NULL) {
215
size = (vm_size_t)v;
216
#ifdef VM_FREELIST_DMA32
217
/*
218
* Try to protect 32-bit DMAable memory from the largest
219
* early alloc of wired mem.
220
*/
221
firstaddr = kmem_alloc_attr(size, M_ZERO | M_NOWAIT,
222
(vm_paddr_t)1 << 32, ~(vm_paddr_t)0, VM_MEMATTR_DEFAULT);
223
if (firstaddr == NULL)
224
#endif
225
firstaddr = kmem_malloc(size, M_ZERO | M_WAITOK);
226
if (firstaddr == NULL)
227
panic("startup: no room for tables");
228
goto again;
229
}
230
231
/*
232
* End of second pass, addresses have been assigned
233
*/
234
if ((vm_size_t)(v - firstaddr) != size)
235
panic("startup: table size inconsistency");
236
237
/*
238
* Allocate the clean map to hold all of I/O virtual memory.
239
*/
240
size = (long)nbuf * BKVASIZE + (long)bio_transient_maxcnt * maxphys;
241
kmi->clean_sva = kva_alloc(size);
242
kmi->clean_eva = kmi->clean_sva + size;
243
244
/*
245
* Allocate the buffer arena.
246
*
247
* Enable the quantum cache if we have more than 4 cpus. This
248
* avoids lock contention at the expense of some fragmentation.
249
*/
250
size = (long)nbuf * BKVASIZE;
251
kmi->buffer_sva = kmi->clean_sva;
252
kmi->buffer_eva = kmi->buffer_sva + size;
253
vmem_init(buffer_arena, "buffer arena", kmi->buffer_sva, size,
254
PAGE_SIZE, (mp_ncpus > 4) ? BKVASIZE * 8 : 0, M_WAITOK);
255
256
/*
257
* And optionally transient bio space.
258
*/
259
if (bio_transient_maxcnt != 0) {
260
size = (long)bio_transient_maxcnt * maxphys;
261
vmem_init(transient_arena, "transient arena",
262
kmi->buffer_eva, size, PAGE_SIZE, 0, M_WAITOK);
263
}
264
265
/*
266
* Allocate the pageable submaps. We may cache an exec map entry per
267
* CPU, so we therefore need to reserve space for at least ncpu+1
268
* entries to avoid deadlock. The exec map is also used by some image
269
* activators, so we leave a fixed number of pages for their use.
270
*/
271
#ifdef __LP64__
272
exec_map_entries = 8 * mp_ncpus;
273
#else
274
exec_map_entries = 2 * mp_ncpus + 4;
275
#endif
276
exec_map_entry_size = round_page(PATH_MAX + ARG_MAX);
277
kmem_subinit(exec_map, kernel_map, &minaddr, &maxaddr,
278
exec_map_entries * exec_map_entry_size + 64 * PAGE_SIZE, false);
279
kmem_subinit(pipe_map, kernel_map, &minaddr, &maxaddr, maxpipekva,
280
false);
281
TSEXIT();
282
}
283
284