Home | History | Annotate | Line # | Download | only in uvm
uvm_init.c revision 1.27 
      1 /*	$NetBSD: uvm_init.c,v 1.27 2007/07/09 21:11:36 ad Exp $	*/
      2 
      3 /*
      4  *
      5  * Copyright (c) 1997 Charles D. Cranor and Washington University.
      6  * All rights reserved.
      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 Charles D. Cranor and
     19  *      Washington University.
     20  * 4. The name of the author may not be used to endorse or promote products
     21  *    derived from this software without specific prior written permission.
     22  *
     23  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     24  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     25  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     26  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     27  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     28  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     29  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     30  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     31  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     32  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     33  *
     34  * from: Id: uvm_init.c,v 1.1.2.3 1998/02/06 05:15:27 chs Exp
     35  */
     36 
     37 /*
     38  * uvm_init.c: init the vm system.
     39  */
     40 
     41 #include <sys/cdefs.h>
     42 __KERNEL_RCSID(0, "$NetBSD: uvm_init.c,v 1.27 2007/07/09 21:11:36 ad Exp $");
     43 
     44 #include <sys/param.h>
     45 #include <sys/systm.h>
     46 #include <sys/file.h>
     47 #include <sys/filedesc.h>
     48 #include <sys/resourcevar.h>
     49 #include <sys/mman.h>
     50 #include <sys/proc.h>
     51 #include <sys/malloc.h>
     52 #include <sys/vnode.h>
     53 
     54 #include <uvm/uvm.h>
     55 #include <uvm/uvm_pdpolicy.h>
     56 
     57 /*
     58  * struct uvm: we store all global vars in this structure to make them
     59  * easier to spot...
     60  */
     61 
     62 struct uvm uvm;		/* decl */
     63 struct uvmexp uvmexp;	/* decl */
     64 kmutex_t uvm_scheduler_mutex;
     65 
     66 /*
     67  * local prototypes
     68  */
     69 
     70 extern kmutex_t uvm_uareas_lock;
     71 
     72 /*
     73  * uvm_init: init the VM system.   called from kern/init_main.c.
     74  */
     75 
     76 void
     77 uvm_init(void)
     78 {
     79 	vaddr_t kvm_start, kvm_end;
     80 
     81 	/*
     82 	 * step 0: ensure that the hardware set the page size
     83 	 */
     84 
     85 	if (uvmexp.pagesize == 0) {
     86 		panic("uvm_init: page size not set");
     87 	}
     88 
     89 	/*
     90 	 * step 1: zero the uvm structure
     91 	 */
     92 
     93 	memset(&uvm, 0, sizeof(uvm));
     94 	averunnable.fscale = FSCALE;
     95 	mutex_init(&uvm_uareas_lock, MUTEX_DEFAULT, IPL_NONE);
     96 
     97 	/*
     98 	 * step 2: init the page sub-system.  this includes allocating the
     99 	 * vm_page structures, and setting up all the page queues (and
    100 	 * locks).  available memory will be put in the "free" queue.
    101 	 * kvm_start and kvm_end will be set to the area of kernel virtual
    102 	 * memory which is available for general use.
    103 	 */
    104 
    105 	uvm_page_init(&kvm_start, &kvm_end);
    106 
    107 	/*
    108 	 * step 3: init the map sub-system.  allocates the static pool of
    109 	 * vm_map_entry structures that are used for "special" kernel maps
    110 	 * (e.g. kernel_map, kmem_map, etc...).
    111 	 */
    112 
    113 	uvm_map_init();
    114 
    115 	/*
    116 	 * step 4: setup the kernel's virtual memory data structures.  this
    117 	 * includes setting up the kernel_map/kernel_object.
    118 	 */
    119 
    120 	uvm_km_init(kvm_start, kvm_end);
    121 
    122 	/*
    123 	 * step 5: init the pmap module.   the pmap module is free to allocate
    124 	 * memory for its private use (e.g. pvlists).
    125 	 */
    126 
    127 	pmap_init();
    128 
    129 	/*
    130 	 * step 6: init the kernel memory allocator.   after this call the
    131 	 * kernel memory allocator (malloc) can be used. this includes
    132 	 * setting up the kmem_map.
    133 	 */
    134 
    135 	kmeminit();
    136 
    137 	/*
    138 	 * step 7: init all pagers and the pager_map.
    139 	 */
    140 
    141 	uvm_pager_init();
    142 
    143 	/*
    144 	 * step 8: init the uvm_loan() facility.
    145 	 */
    146 
    147 	uvm_loan_init();
    148 
    149 	/*
    150 	 * the VM system is now up!  now that malloc is up we can resize the
    151 	 * <obj,off> => <page> hash table for general use and enable paging
    152 	 * of kernel objects.
    153 	 */
    154 
    155 	uvm_page_rehash();
    156 	uao_create(VM_MAX_KERNEL_ADDRESS - VM_MIN_KERNEL_ADDRESS,
    157 	    UAO_FLAG_KERNSWAP);
    158 
    159 	uvmpdpol_reinit();
    160 
    161 	/*
    162 	 * Initialize pools.  This must be done before anyone manipulates
    163 	 * any vm_maps because we use a pool for some map entry structures.
    164 	 */
    165 
    166 	pool_subsystem_init();
    167 
    168 	/*
    169 	 * init anonymous memory systems
    170 	 */
    171 
    172 	uvm_anon_init();
    173 }
    174