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