xref: /freebsd/sys/vm/vm_init.c (revision 2be1a816b9ff69588e55be0a84cbe2a31efc0f2f)
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/mutex.h>
72 #include <sys/proc.h>
73 #include <sys/sysctl.h>
74 #include <sys/systm.h>
75 #include <sys/selinfo.h>
76 #include <sys/pipe.h>
77 #include <sys/bio.h>
78 #include <sys/buf.h>
79 
80 #include <vm/vm.h>
81 #include <vm/vm_param.h>
82 #include <vm/vm_kern.h>
83 #include <vm/vm_object.h>
84 #include <vm/vm_page.h>
85 #include <vm/vm_map.h>
86 #include <vm/vm_pager.h>
87 #include <vm/vm_extern.h>
88 
89 long physmem;
90 
91 static int exec_map_entries = 16;
92 TUNABLE_INT("vm.exec_map_entries", &exec_map_entries);
93 SYSCTL_INT(_vm, OID_AUTO, exec_map_entries, CTLFLAG_RD, &exec_map_entries, 0,
94     "Maximum number of simultaneous execs");
95 
96 /*
97  * System initialization
98  */
99 static void vm_mem_init(void *);
100 SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL);
101 
102 /*
103  *	vm_init initializes the virtual memory system.
104  *	This is done only by the first cpu up.
105  *
106  *	The start and end address of physical memory is passed in.
107  */
108 /* ARGSUSED*/
109 static void
110 vm_mem_init(dummy)
111 	void *dummy;
112 {
113 	/*
114 	 * Initializes resident memory structures. From here on, all physical
115 	 * memory is accounted for, and we use only virtual addresses.
116 	 */
117 	vm_set_page_size();
118 	virtual_avail = vm_page_startup(virtual_avail);
119 
120 	/*
121 	 * Initialize other VM packages
122 	 */
123 	vm_object_init();
124 	vm_map_startup();
125 	kmem_init(virtual_avail, virtual_end);
126 	pmap_init();
127 	vm_pager_init();
128 }
129 
130 void
131 vm_ksubmap_init(struct kva_md_info *kmi)
132 {
133 	vm_offset_t firstaddr;
134 	caddr_t v;
135 	vm_size_t size = 0;
136 	long physmem_est;
137 	vm_offset_t minaddr;
138 	vm_offset_t maxaddr;
139 	vm_map_t clean_map;
140 
141 	/*
142 	 * Allocate space for system data structures.
143 	 * The first available kernel virtual address is in "v".
144 	 * As pages of kernel virtual memory are allocated, "v" is incremented.
145 	 * As pages of memory are allocated and cleared,
146 	 * "firstaddr" is incremented.
147 	 * An index into the kernel page table corresponding to the
148 	 * virtual memory address maintained in "v" is kept in "mapaddr".
149 	 */
150 
151 	/*
152 	 * Make two passes.  The first pass calculates how much memory is
153 	 * needed and allocates it.  The second pass assigns virtual
154 	 * addresses to the various data structures.
155 	 */
156 	firstaddr = 0;
157 again:
158 	v = (caddr_t)firstaddr;
159 
160 	v = kern_timeout_callwheel_alloc(v);
161 
162 	/*
163 	 * Discount the physical memory larger than the size of kernel_map
164 	 * to avoid eating up all of KVA space.
165 	 */
166 	physmem_est = lmin(physmem, btoc(kernel_map->max_offset -
167 	    kernel_map->min_offset));
168 
169 	v = kern_vfs_bio_buffer_alloc(v, physmem_est);
170 
171 	/*
172 	 * End of first pass, size has been calculated so allocate memory
173 	 */
174 	if (firstaddr == 0) {
175 		size = (vm_size_t)v;
176 		firstaddr = kmem_alloc(kernel_map, round_page(size));
177 		if (firstaddr == 0)
178 			panic("startup: no room for tables");
179 		goto again;
180 	}
181 
182 	/*
183 	 * End of second pass, addresses have been assigned
184 	 */
185 	if ((vm_size_t)((char *)v - firstaddr) != size)
186 		panic("startup: table size inconsistency");
187 
188 	clean_map = kmem_suballoc(kernel_map, &kmi->clean_sva, &kmi->clean_eva,
189 			(nbuf*BKVASIZE) + (nswbuf*MAXPHYS));
190 	buffer_map = kmem_suballoc(clean_map, &kmi->buffer_sva,
191 			&kmi->buffer_eva, (nbuf*BKVASIZE));
192 	buffer_map->system_map = 1;
193 	pager_map = kmem_suballoc(clean_map, &kmi->pager_sva, &kmi->pager_eva,
194 				(nswbuf*MAXPHYS));
195 	pager_map->system_map = 1;
196 	exec_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr,
197 				(exec_map_entries*(ARG_MAX+(PAGE_SIZE*3))));
198 	pipe_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr, maxpipekva);
199 
200 	/*
201 	 * XXX: Mbuf system machine-specific initializations should
202 	 *      go here, if anywhere.
203 	 */
204 
205 	/*
206 	 * Initialize the callouts we just allocated.
207 	 */
208 	kern_timeout_callwheel_init();
209 }
210 
211