xref: /freebsd/sys/vm/vm_init.c (revision 6990ffd8a95caaba6858ad44ff1b3157d1efba8f)
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  * 3. All advertising materials mentioning features or use of this software
17  *    must display the following acknowledgement:
18  *	This product includes software developed by the University of
19  *	California, Berkeley and its contributors.
20  * 4. Neither the name of the University nor the names of its contributors
21  *    may be used to endorse or promote products derived from this software
22  *    without specific prior written permission.
23  *
24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34  * SUCH DAMAGE.
35  *
36  *	from: @(#)vm_init.c	8.1 (Berkeley) 6/11/93
37  *
38  *
39  * Copyright (c) 1987, 1990 Carnegie-Mellon University.
40  * All rights reserved.
41  *
42  * Authors: Avadis Tevanian, Jr., Michael Wayne Young
43  *
44  * Permission to use, copy, modify and distribute this software and
45  * its documentation is hereby granted, provided that both the copyright
46  * notice and this permission notice appear in all copies of the
47  * software, derivative works or modified versions, and any portions
48  * thereof, and that both notices appear in supporting documentation.
49  *
50  * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
51  * CONDITION.  CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
52  * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
53  *
54  * Carnegie Mellon requests users of this software to return to
55  *
56  *  Software Distribution Coordinator  or  Software.Distribution@CS.CMU.EDU
57  *  School of Computer Science
58  *  Carnegie Mellon University
59  *  Pittsburgh PA 15213-3890
60  *
61  * any improvements or extensions that they make and grant Carnegie the
62  * rights to redistribute these changes.
63  *
64  * $FreeBSD$
65  */
66 
67 /*
68  *	Initialize the Virtual Memory subsystem.
69  */
70 
71 #include <sys/param.h>
72 #include <sys/kernel.h>
73 #include <sys/lock.h>
74 #include <sys/mutex.h>
75 #include <sys/proc.h>
76 #include <sys/systm.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 #include <vm/vm_zone.h>
89 
90 /*
91  * System initialization
92  */
93 
94 static void vm_mem_init __P((void *));
95 SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL)
96 
97 /*
98  *	vm_init initializes the virtual memory system.
99  *	This is done only by the first cpu up.
100  *
101  *	The start and end address of physical memory is passed in.
102  */
103 
104 /* ARGSUSED*/
105 static void
106 vm_mem_init(dummy)
107 	void *dummy;
108 {
109 	/*
110 	 * Initializes resident memory structures. From here on, all physical
111 	 * memory is accounted for, and we use only virtual addresses.
112 	 */
113 	vm_set_page_size();
114 	virtual_avail = vm_page_startup(avail_start, avail_end, virtual_avail);
115 
116 	/*
117 	 * Initialize other VM packages
118 	 */
119 	vm_zone_init();
120 	vm_object_init();
121 	vm_map_startup();
122 	kmem_init(virtual_avail, virtual_end);
123 	pmap_init(avail_start, avail_end);
124 	vm_pager_init();
125 }
126 
127 void
128 vm_ksubmap_init(struct kva_md_info *kmi)
129 {
130 	vm_offset_t firstaddr;
131 	caddr_t v;
132 	vm_size_t size = 0;
133 	int physmem_est;
134 	vm_offset_t minaddr;
135 	vm_offset_t maxaddr;
136 
137 	/*
138 	 * Allocate space for system data structures.
139 	 * The first available kernel virtual address is in "v".
140 	 * As pages of kernel virtual memory are allocated, "v" is incremented.
141 	 * As pages of memory are allocated and cleared,
142 	 * "firstaddr" is incremented.
143 	 * An index into the kernel page table corresponding to the
144 	 * virtual memory address maintained in "v" is kept in "mapaddr".
145 	 */
146 
147 	/*
148 	 * Make two passes.  The first pass calculates how much memory is
149 	 * needed and allocates it.  The second pass assigns virtual
150 	 * addresses to the various data structures.
151 	 */
152 	firstaddr = 0;
153 again:
154 	v = (caddr_t)firstaddr;
155 
156 	v = kern_timeout_callwheel_alloc(v);
157 
158 	/*
159 	 * Discount the physical memory larger than the size of kernel_map
160 	 * to avoid eating up all of KVA space.
161 	 */
162 	if (kernel_map->first_free == NULL) {
163 		printf("Warning: no free entries in kernel_map.\n");
164 		physmem_est = physmem;
165 	} else {
166 		physmem_est = min(physmem, btoc(kernel_map->max_offset -
167 		    kernel_map->min_offset));
168 	}
169 
170 	v = kern_vfs_bio_buffer_alloc(v, physmem_est);
171 
172 	/*
173 	 * End of first pass, size has been calculated so allocate memory
174 	 */
175 	if (firstaddr == 0) {
176 		size = (vm_size_t)((char *)v - firstaddr);
177 		firstaddr = kmem_alloc(kernel_map, round_page(size));
178 		if (firstaddr == 0)
179 			panic("startup: no room for tables");
180 		goto again;
181 	}
182 
183 	/*
184 	 * End of second pass, addresses have been assigned
185 	 */
186 	if ((vm_size_t)((char *)v - firstaddr) != size)
187 		panic("startup: table size inconsistency");
188 
189 	clean_map = kmem_suballoc(kernel_map, &kmi->clean_sva, &kmi->clean_eva,
190 			(nbuf*BKVASIZE) + (nswbuf*MAXPHYS) + pager_map_size);
191 	buffer_map = kmem_suballoc(clean_map, &kmi->buffer_sva,
192 			&kmi->buffer_eva, (nbuf*BKVASIZE));
193 	buffer_map->system_map = 1;
194 	pager_map = kmem_suballoc(clean_map, &kmi->pager_sva, &kmi->pager_eva,
195 				(nswbuf*MAXPHYS) + pager_map_size);
196 	pager_map->system_map = 1;
197 	exec_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr,
198 				(16*(ARG_MAX+(PAGE_SIZE*3))));
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