The Design and Implementation of the FreeBSD Operating System, Second Edition
Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]

FreeBSD/Linux Kernel Cross Reference
sys/vm/vm_init.c

Version: -  FREEBSD  -  FREEBSD-13-STABLE  -  FREEBSD-13-0  -  FREEBSD-12-STABLE  -  FREEBSD-12-0  -  FREEBSD-11-STABLE  -  FREEBSD-11-0  -  FREEBSD-10-STABLE  -  FREEBSD-10-0  -  FREEBSD-9-STABLE  -  FREEBSD-9-0  -  FREEBSD-8-STABLE  -  FREEBSD-8-0  -  FREEBSD-7-STABLE  -  FREEBSD-7-0  -  FREEBSD-6-STABLE  -  FREEBSD-6-0  -  FREEBSD-5-STABLE  -  FREEBSD-5-0  -  FREEBSD-4-STABLE  -  FREEBSD-3-STABLE  -  FREEBSD22  -  l41  -  OPENBSD  -  linux-2.6  -  MK84  -  PLAN9  -  xnu-8792 
SearchContext: -  none  -  3  -  10 

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

Cache object: 9028a378b889e2c19b5f634088a319a0


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]


This page is part of the FreeBSD/Linux Linux Kernel Cross-Reference, and was automatically generated using a modified version of the LXR engine.