xref: /freebsd/sys/vm/vm_init.c (revision cdc58367265a2bd6e8f913db2bdc591699ee229f)
1 /*-
2  * Copyright (c) 1991, 1993
3  *	The Regents of the University of California.  All rights reserved.
4  *
5  * This code is derived from software contributed to Berkeley by
6  * The Mach Operating System project at Carnegie-Mellon University.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
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.
19  *
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
30  * SUCH DAMAGE.
31  *
32  *	from: @(#)vm_init.c	8.1 (Berkeley) 6/11/93
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  Software.Distribution@CS.CMU.EDU
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/cdefs.h>
66 __FBSDID("$FreeBSD$");
67 
68 #include <sys/param.h>
69 #include <sys/kernel.h>
70 #include <sys/lock.h>
71 #include <sys/proc.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>
77 #include <sys/pipe.h>
78 #include <sys/bio.h>
79 #include <sys/buf.h>
80 #include <sys/vmem.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_map.h>
88 #include <vm/vm_pager.h>
89 #include <vm/vm_extern.h>
90 
91 long physmem;
92 
93 static int exec_map_entries = 16;
94 SYSCTL_INT(_vm, OID_AUTO, exec_map_entries, CTLFLAG_RDTUN, &exec_map_entries, 0,
95     "Maximum number of simultaneous execs");
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 /*
104  * Import kva into the kernel arena.
105  */
106 static int
107 kva_import(void *unused, vmem_size_t size, int flags, vmem_addr_t *addrp)
108 {
109 	vm_offset_t addr;
110 	int result;
111 
112 	addr = vm_map_min(kernel_map);
113 	result = vm_map_find(kernel_map, NULL, 0, &addr, size, 0,
114 	    VMFS_SUPER_SPACE, VM_PROT_ALL, VM_PROT_ALL, MAP_NOFAULT);
115 	if (result != KERN_SUCCESS)
116                 return (ENOMEM);
117 
118 	*addrp = addr;
119 
120 	return (0);
121 }
122 
123 /*
124  *	vm_init initializes the virtual memory system.
125  *	This is done only by the first cpu up.
126  *
127  *	The start and end address of physical memory is passed in.
128  */
129 /* ARGSUSED*/
130 static void
131 vm_mem_init(dummy)
132 	void *dummy;
133 {
134 
135 	/*
136 	 * Initializes resident memory structures. From here on, all physical
137 	 * memory is accounted for, and we use only virtual addresses.
138 	 */
139 	vm_set_page_size();
140 	virtual_avail = vm_page_startup(virtual_avail);
141 
142 	/*
143 	 * Initialize other VM packages
144 	 */
145 	vmem_startup();
146 	vm_object_init();
147 	vm_map_startup();
148 	kmem_init(virtual_avail, virtual_end);
149 
150 	/*
151 	 * Initialize the kernel_arena.  This can grow on demand.
152 	 */
153 	vmem_init(kernel_arena, "kernel arena", 0, 0, PAGE_SIZE, 0, 0);
154 	vmem_set_import(kernel_arena, kva_import, NULL, NULL,
155 #if VM_NRESERVLEVEL > 0
156 	    1 << (VM_LEVEL_0_ORDER + PAGE_SHIFT));
157 #else
158 	    /* On non-superpage architectures want large import sizes. */
159 	    PAGE_SIZE * 1024);
160 #endif
161 
162 	kmem_init_zero_region();
163 	pmap_init();
164 	vm_pager_init();
165 }
166 
167 void
168 vm_ksubmap_init(struct kva_md_info *kmi)
169 {
170 	vm_offset_t firstaddr;
171 	caddr_t v;
172 	vm_size_t size = 0;
173 	long physmem_est;
174 	vm_offset_t minaddr;
175 	vm_offset_t maxaddr;
176 
177 	/*
178 	 * Allocate space for system data structures.
179 	 * The first available kernel virtual address is in "v".
180 	 * As pages of kernel virtual memory are allocated, "v" is incremented.
181 	 * As pages of memory are allocated and cleared,
182 	 * "firstaddr" is incremented.
183 	 */
184 
185 	/*
186 	 * Make two passes.  The first pass calculates how much memory is
187 	 * needed and allocates it.  The second pass assigns virtual
188 	 * addresses to the various data structures.
189 	 */
190 	firstaddr = 0;
191 again:
192 	v = (caddr_t)firstaddr;
193 
194 	/*
195 	 * Discount the physical memory larger than the size of kernel_map
196 	 * to avoid eating up all of KVA space.
197 	 */
198 	physmem_est = lmin(physmem, btoc(kernel_map->max_offset -
199 	    kernel_map->min_offset));
200 
201 	v = kern_vfs_bio_buffer_alloc(v, physmem_est);
202 
203 	/*
204 	 * End of first pass, size has been calculated so allocate memory
205 	 */
206 	if (firstaddr == 0) {
207 		size = (vm_size_t)v;
208 		firstaddr = kmem_malloc(kernel_arena, round_page(size),
209 		    M_ZERO | M_WAITOK);
210 		if (firstaddr == 0)
211 			panic("startup: no room for tables");
212 		goto again;
213 	}
214 
215 	/*
216 	 * End of second pass, addresses have been assigned
217 	 */
218 	if ((vm_size_t)((char *)v - firstaddr) != size)
219 		panic("startup: table size inconsistency");
220 
221 	/*
222 	 * Allocate the clean map to hold all of the paging and I/O virtual
223 	 * memory.
224 	 */
225 	size = (long)nbuf * BKVASIZE + (long)nswbuf * MAXPHYS +
226 	    (long)bio_transient_maxcnt * MAXPHYS;
227 	kmi->clean_sva = firstaddr = kva_alloc(size);
228 	kmi->clean_eva = firstaddr + size;
229 
230 	/*
231 	 * Allocate the buffer arena.
232 	 */
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, 0, 0);
238 	firstaddr += size;
239 
240 	/*
241 	 * Now swap kva.
242 	 */
243 	swapbkva = firstaddr;
244 	size = (long)nswbuf * MAXPHYS;
245 	firstaddr += size;
246 
247 	/*
248 	 * And optionally transient bio space.
249 	 */
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);
254 		firstaddr += size;
255 	}
256 	if (firstaddr != kmi->clean_eva)
257 		panic("Clean map calculation incorrect");
258 
259 	/*
260  	 * Allocate the pageable submaps.
261 	 */
262 	exec_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr,
263 	    exec_map_entries * round_page(PATH_MAX + ARG_MAX), FALSE);
264 	pipe_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr, maxpipekva,
265 	    FALSE);
266 }
267