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/sysctl.h>
74 #include <sys/systm.h>
75 #include <sys/selinfo.h>
82 #include <vm/vm_param.h>
83 #include <vm/vm_kern.h>
84 #include <vm/vm_object.h>
85 #include <vm/vm_page.h>
86 #include <vm/vm_map.h>
87 #include <vm/vm_pager.h>
88 #include <vm/vm_extern.h>
92 static int exec_map_entries = 16;
93 TUNABLE_INT("vm.exec_map_entries", &exec_map_entries);
94 SYSCTL_INT(_vm, OID_AUTO, exec_map_entries, CTLFLAG_RD, &exec_map_entries, 0,
95 "Maximum number of simultaneous execs");
98 * System initialization
100 static void vm_mem_init(void *);
101 SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL);
104 * vm_init initializes the virtual memory system.
105 * This is done only by the first cpu up.
107 * The start and end address of physical memory is passed in.
115 * Initializes resident memory structures. From here on, all physical
116 * memory is accounted for, and we use only virtual addresses.
119 virtual_avail = vm_page_startup(virtual_avail);
122 * Initialize other VM packages
127 kmem_init(virtual_avail, virtual_end);
133 vm_ksubmap_init(struct kva_md_info *kmi)
135 vm_offset_t firstaddr;
144 * Allocate space for system data structures.
145 * The first available kernel virtual address is in "v".
146 * As pages of kernel virtual memory are allocated, "v" is incremented.
147 * As pages of memory are allocated and cleared,
148 * "firstaddr" is incremented.
149 * An index into the kernel page table corresponding to the
150 * virtual memory address maintained in "v" is kept in "mapaddr".
154 * Make two passes. The first pass calculates how much memory is
155 * needed and allocates it. The second pass assigns virtual
156 * addresses to the various data structures.
160 v = (caddr_t)firstaddr;
163 * Discount the physical memory larger than the size of kernel_map
164 * to avoid eating up all of KVA space.
166 physmem_est = lmin(physmem, btoc(kernel_map->max_offset -
167 kernel_map->min_offset));
169 v = kern_vfs_bio_buffer_alloc(v, physmem_est);
172 * End of first pass, size has been calculated so allocate memory
174 if (firstaddr == 0) {
176 firstaddr = kmem_alloc(kernel_map, round_page(size));
178 panic("startup: no room for tables");
183 * End of second pass, addresses have been assigned
185 if ((vm_size_t)((char *)v - firstaddr) != size)
186 panic("startup: table size inconsistency");
188 size = (long)nbuf * BKVASIZE + (long)nswbuf * MAXPHYS +
189 (long)bio_transient_maxcnt * MAXPHYS;
190 clean_map = kmem_suballoc(kernel_map, &kmi->clean_sva, &kmi->clean_eva,
193 size = (long)nbuf * BKVASIZE;
194 kmi->buffer_sva = kmem_alloc_nofault(clean_map, size);
195 kmi->buffer_eva = kmi->buffer_sva + size;
196 vmem_init(buffer_arena, "buffer arena", kmi->buffer_sva, size,
199 size = (long)nswbuf * MAXPHYS;
200 swapbkva = kmem_alloc_nofault(clean_map, size);
202 panic("Not enough clean_map VM space for pager buffers");
204 if (bio_transient_maxcnt != 0) {
205 size = (long)bio_transient_maxcnt * MAXPHYS;
206 vmem_init(transient_arena, "transient arena",
207 kmem_alloc_nofault(clean_map, size),
208 size, PAGE_SIZE, 0, 0);
210 exec_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr,
211 exec_map_entries * round_page(PATH_MAX + ARG_MAX), FALSE);
212 pipe_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr, maxpipekva,