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: head/sys/vm/vm_init.c 92029 2002-03-10 21:52:48Z eivind $
|
| 64 * $FreeBSD: head/sys/vm/vm_init.c 92654 2002-03-19 09:11:49Z jeff $ |
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 */
93static void vm_mem_init __P((void *));
94SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL)
95
96/*
97 * vm_init initializes the virtual memory system.
98 * This is done only by the first cpu up.
99 *
100 * The start and end address of physical memory is passed in.
101 */
102/* ARGSUSED*/
103static void
104vm_mem_init(dummy)
105 void *dummy;
106{
107 /*
108 * Initializes resident memory structures. From here on, all physical
109 * memory is accounted for, and we use only virtual addresses.
110 */
111 vm_set_page_size();
112 virtual_avail = vm_page_startup(avail_start, avail_end, virtual_avail);
113
114 /*
115 * Initialize other VM packages
116 */
|
117 vm_zone_init();
|
117 vm_object_init();
118 vm_map_startup();
119 kmem_init(virtual_avail, virtual_end);
120 pmap_init(avail_start, avail_end);
121 vm_pager_init();
122}
123
124void
125vm_ksubmap_init(struct kva_md_info *kmi)
126{
127 vm_offset_t firstaddr;
128 caddr_t v;
129 vm_size_t size = 0;
130 int physmem_est;
131 vm_offset_t minaddr;
132 vm_offset_t maxaddr;
133
134 /*
135 * Allocate space for system data structures.
136 * The first available kernel virtual address is in "v".
137 * As pages of kernel virtual memory are allocated, "v" is incremented.
138 * As pages of memory are allocated and cleared,
139 * "firstaddr" is incremented.
140 * An index into the kernel page table corresponding to the
141 * virtual memory address maintained in "v" is kept in "mapaddr".
142 */
143
144 /*
145 * Make two passes. The first pass calculates how much memory is
146 * needed and allocates it. The second pass assigns virtual
147 * addresses to the various data structures.
148 */
149 firstaddr = 0;
150again:
151 v = (caddr_t)firstaddr;
152
153 v = kern_timeout_callwheel_alloc(v);
154
155 /*
156 * Discount the physical memory larger than the size of kernel_map
157 * to avoid eating up all of KVA space.
158 */
159 if (kernel_map->first_free == NULL) {
160 printf("Warning: no free entries in kernel_map.\n");
161 physmem_est = physmem;
162 } else {
163 physmem_est = min(physmem, btoc(kernel_map->max_offset -
164 kernel_map->min_offset));
165 }
166
167 v = kern_vfs_bio_buffer_alloc(v, physmem_est);
168
169 /*
170 * End of first pass, size has been calculated so allocate memory
171 */
172 if (firstaddr == 0) {
173 size = (vm_size_t)((char *)v - firstaddr);
174 firstaddr = kmem_alloc(kernel_map, round_page(size));
175 if (firstaddr == 0)
176 panic("startup: no room for tables");
177 goto again;
178 }
179
180 /*
181 * End of second pass, addresses have been assigned
182 */
183 if ((vm_size_t)((char *)v - firstaddr) != size)
184 panic("startup: table size inconsistency");
185
186 clean_map = kmem_suballoc(kernel_map, &kmi->clean_sva, &kmi->clean_eva,
187 (nbuf*BKVASIZE) + (nswbuf*MAXPHYS) + pager_map_size);
188 buffer_map = kmem_suballoc(clean_map, &kmi->buffer_sva,
189 &kmi->buffer_eva, (nbuf*BKVASIZE));
190 buffer_map->system_map = 1;
191 pager_map = kmem_suballoc(clean_map, &kmi->pager_sva, &kmi->pager_eva,
192 (nswbuf*MAXPHYS) + pager_map_size);
193 pager_map->system_map = 1;
194 exec_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr,
195 (16*(ARG_MAX+(PAGE_SIZE*3))));
196
197 /*
198 * XXX: Mbuf system machine-specific initializations should
199 * go here, if anywhere.
200 */
201
202 /*
203 * Initialize the callouts we just allocated.
204 */
205 kern_timeout_callwheel_init();
206}
207
|