2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * The Mach Operating System project at Carnegie-Mellon University.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 4. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * from: @(#)vm_init.c 8.1 (Berkeley) 6/11/93
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/cdefs.h>
66 __FBSDID("$FreeBSD$");
68 #include <sys/param.h>
69 #include <sys/kernel.h>
72 #include <sys/rwlock.h>
73 #include <sys/malloc.h>
74 #include <sys/sysctl.h>
75 #include <sys/systm.h>
76 #include <sys/selinfo.h>
84 #include <vm/vm_param.h>
85 #include <vm/vm_kern.h>
86 #include <vm/vm_object.h>
87 #include <vm/vm_page.h>
88 #include <vm/vm_map.h>
89 #include <vm/vm_pager.h>
90 #include <vm/vm_extern.h>
95 * System initialization
97 static void vm_mem_init(void *);
98 SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL);
101 * Import kva into the kernel arena.
104 kva_import(void *unused, vmem_size_t size, int flags, vmem_addr_t *addrp)
109 addr = vm_map_min(kernel_map);
110 result = vm_map_find(kernel_map, NULL, 0, &addr, size, 0,
111 VMFS_SUPER_SPACE, VM_PROT_ALL, VM_PROT_ALL, MAP_NOFAULT);
112 if (result != KERN_SUCCESS)
121 * vm_init initializes the virtual memory system.
122 * This is done only by the first cpu up.
124 * The start and end address of physical memory is passed in.
133 * Initializes resident memory structures. From here on, all physical
134 * memory is accounted for, and we use only virtual addresses.
137 virtual_avail = vm_page_startup(virtual_avail);
140 * Initialize other VM packages
145 kmem_init(virtual_avail, virtual_end);
148 * Initialize the kernel_arena. This can grow on demand.
150 vmem_init(kernel_arena, "kernel arena", 0, 0, PAGE_SIZE, 0, 0);
151 vmem_set_import(kernel_arena, kva_import, NULL, NULL,
152 #if VM_NRESERVLEVEL > 0
153 1 << (VM_LEVEL_0_ORDER + PAGE_SHIFT));
155 /* On non-superpage architectures want large import sizes. */
159 kmem_init_zero_region();
165 vm_ksubmap_init(struct kva_md_info *kmi)
167 vm_offset_t firstaddr;
175 * Allocate space for system data structures.
176 * The first available kernel virtual address is in "v".
177 * As pages of kernel virtual memory are allocated, "v" is incremented.
178 * As pages of memory are allocated and cleared,
179 * "firstaddr" is incremented.
183 * Make two passes. The first pass calculates how much memory is
184 * needed and allocates it. The second pass assigns virtual
185 * addresses to the various data structures.
189 v = (caddr_t)firstaddr;
192 * Discount the physical memory larger than the size of kernel_map
193 * to avoid eating up all of KVA space.
195 physmem_est = lmin(physmem, btoc(vm_map_max(kernel_map) -
196 vm_map_min(kernel_map)));
198 v = kern_vfs_bio_buffer_alloc(v, physmem_est);
201 * End of first pass, size has been calculated so allocate memory
203 if (firstaddr == 0) {
205 firstaddr = kmem_malloc(kernel_arena, round_page(size),
208 panic("startup: no room for tables");
213 * End of second pass, addresses have been assigned
215 if ((vm_size_t)((char *)v - firstaddr) != size)
216 panic("startup: table size inconsistency");
219 * Allocate the clean map to hold all of the paging and I/O virtual
222 size = (long)nbuf * BKVASIZE + (long)nswbuf * MAXPHYS +
223 (long)bio_transient_maxcnt * MAXPHYS;
224 kmi->clean_sva = firstaddr = kva_alloc(size);
225 kmi->clean_eva = firstaddr + size;
228 * Allocate the buffer arena.
230 * Enable the quantum cache if we have more than 4 cpus. This
231 * avoids lock contention at the expense of some fragmentation.
233 size = (long)nbuf * BKVASIZE;
234 kmi->buffer_sva = firstaddr;
235 kmi->buffer_eva = kmi->buffer_sva + size;
236 vmem_init(buffer_arena, "buffer arena", kmi->buffer_sva, size,
237 PAGE_SIZE, (mp_ncpus > 4) ? BKVASIZE * 8 : 0, 0);
243 swapbkva = firstaddr;
244 size = (long)nswbuf * MAXPHYS;
248 * And optionally transient bio space.
250 if (bio_transient_maxcnt != 0) {
251 size = (long)bio_transient_maxcnt * MAXPHYS;
252 vmem_init(transient_arena, "transient arena",
253 firstaddr, size, PAGE_SIZE, 0, 0);
256 if (firstaddr != kmi->clean_eva)
257 panic("Clean map calculation incorrect");
260 * Allocate the pageable submaps. We may cache an exec map entry per
261 * CPU, so we therefore need to reserve space for at least ncpu+1
262 * entries to avoid deadlock. The exec map is also used by some image
263 * activators, so we leave a fixed number of pages for their use.
266 exec_map_entries = 8 * mp_ncpus;
268 exec_map_entries = 2 * mp_ncpus + 4;
270 exec_map_entry_size = round_page(PATH_MAX + ARG_MAX);
271 exec_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr,
272 exec_map_entries * exec_map_entry_size + 64 * PAGE_SIZE, FALSE);
273 pipe_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr, maxpipekva,