vm_init.c revision 252330
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: head/sys/vm/vm_init.c 252330 2013-06-28 03:51:20Z jeff $"); 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/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#include <sys/vmem.h> 80 81#include <vm/vm.h> 82#include <vm/vm_param.h> 83#include <vm/vm_kern.h> 84#include <vm/vm_object.h> 85#include <vm/vm_page.h> 86#include <vm/vm_map.h> 87#include <vm/vm_pager.h> 88#include <vm/vm_extern.h> 89 90long physmem; 91 92static int exec_map_entries = 16; 93TUNABLE_INT("vm.exec_map_entries", &exec_map_entries); 94SYSCTL_INT(_vm, OID_AUTO, exec_map_entries, CTLFLAG_RD, &exec_map_entries, 0, 95 "Maximum number of simultaneous execs"); 96 97/* 98 * System initialization 99 */ 100static void vm_mem_init(void *); 101SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL); 102 103/* 104 * vm_init initializes the virtual memory system. 105 * This is done only by the first cpu up. 106 * 107 * The start and end address of physical memory is passed in. 108 */ 109/* ARGSUSED*/ 110static void 111vm_mem_init(dummy) 112 void *dummy; 113{ 114 /* 115 * Initializes resident memory structures. From here on, all physical 116 * memory is accounted for, and we use only virtual addresses. 117 */ 118 vm_set_page_size(); 119 virtual_avail = vm_page_startup(virtual_avail); 120 121 /* 122 * Initialize other VM packages 123 */ 124 vmem_startup(); 125 vm_object_init(); 126 vm_map_startup(); 127 kmem_init(virtual_avail, virtual_end); 128 pmap_init(); 129 vm_pager_init(); 130} 131 132void 133vm_ksubmap_init(struct kva_md_info *kmi) 134{ 135 vm_offset_t firstaddr; 136 caddr_t v; 137 vm_size_t size = 0; 138 long physmem_est; 139 vm_offset_t minaddr; 140 vm_offset_t maxaddr; 141 vm_map_t clean_map; 142 143 /* 144 * Allocate space for system data structures. 145 * The first available kernel virtual address is in "v". 146 * As pages of kernel virtual memory are allocated, "v" is incremented. 147 * As pages of memory are allocated and cleared, 148 * "firstaddr" is incremented. 149 * An index into the kernel page table corresponding to the 150 * virtual memory address maintained in "v" is kept in "mapaddr". 151 */ 152 153 /* 154 * Make two passes. The first pass calculates how much memory is 155 * needed and allocates it. The second pass assigns virtual 156 * addresses to the various data structures. 157 */ 158 firstaddr = 0; 159again: 160 v = (caddr_t)firstaddr; 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 size = (long)nbuf * BKVASIZE + (long)nswbuf * MAXPHYS + 189 (long)bio_transient_maxcnt * MAXPHYS; 190 clean_map = kmem_suballoc(kernel_map, &kmi->clean_sva, &kmi->clean_eva, 191 size, TRUE); 192 193 size = (long)nbuf * BKVASIZE; 194 kmi->buffer_sva = kmem_alloc_nofault(clean_map, size); 195 kmi->buffer_eva = kmi->buffer_sva + size; 196 vmem_init(buffer_arena, "buffer arena", kmi->buffer_sva, size, 197 PAGE_SIZE, 0, 0); 198 199 size = (long)nswbuf * MAXPHYS; 200 swapbkva = kmem_alloc_nofault(clean_map, size); 201 if (!swapbkva) 202 panic("Not enough clean_map VM space for pager buffers"); 203 204 if (bio_transient_maxcnt != 0) { 205 size = (long)bio_transient_maxcnt * MAXPHYS; 206 vmem_init(transient_arena, "transient arena", 207 kmem_alloc_nofault(clean_map, size), 208 size, PAGE_SIZE, 0, 0); 209 } 210 exec_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr, 211 exec_map_entries * round_page(PATH_MAX + ARG_MAX), FALSE); 212 pipe_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr, maxpipekva, 213 FALSE); 214} 215 216