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  * 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$");
   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/malloc.h>
   74 #include <sys/sysctl.h>
   75 #include <sys/systm.h>
   76 #include <sys/selinfo.h>
   77 #include <sys/pipe.h>
   78 #include <sys/bio.h>
   79 #include <sys/buf.h>
   80 #include <sys/vmem.h>
   81 
   82 #include <vm/vm.h>
   83 #include <vm/vm_param.h>
   84 #include <vm/vm_kern.h>
   85 #include <vm/vm_object.h>
   86 #include <vm/vm_page.h>
   87 #include <vm/vm_map.h>
   88 #include <vm/vm_pager.h>
   89 #include <vm/vm_extern.h>
   90 
   91 long physmem;
   92 
   93 static int exec_map_entries = 16;
   94 TUNABLE_INT("vm.exec_map_entries", &exec_map_entries);
   95 SYSCTL_INT(_vm, OID_AUTO, exec_map_entries, CTLFLAG_RD, &exec_map_entries, 0,
   96     "Maximum number of simultaneous execs");
   97 
   98 /*
   99  * System initialization
  100  */
  101 static void vm_mem_init(void *);
  102 SYSINIT(vm_mem, SI_SUB_VM, SI_ORDER_FIRST, vm_mem_init, NULL);
  103 
  104 /*
  105  * Import kva into the kernel arena.
  106  */
  107 static int
  108 kva_import(void *unused, vmem_size_t size, int flags, vmem_addr_t *addrp)
  109 {
  110         vm_offset_t addr;
  111         int result;
  112  
  113         addr = vm_map_min(kernel_map);
  114         result = vm_map_find(kernel_map, NULL, 0, &addr, size, 0,
  115             VMFS_SUPER_SPACE, VM_PROT_ALL, VM_PROT_ALL, MAP_NOFAULT);
  116         if (result != KERN_SUCCESS)
  117                 return (ENOMEM);
  118 
  119         *addrp = addr;
  120 
  121         return (0);
  122 }
  123 
  124 /*
  125  *      vm_init initializes the virtual memory system.
  126  *      This is done only by the first cpu up.
  127  *
  128  *      The start and end address of physical memory is passed in.
  129  */
  130 /* ARGSUSED*/
  131 static void
  132 vm_mem_init(dummy)
  133         void *dummy;
  134 {
  135 
  136         /*
  137          * Initializes resident memory structures. From here on, all physical
  138          * memory is accounted for, and we use only virtual addresses.
  139          */
  140         vm_set_page_size();
  141         virtual_avail = vm_page_startup(virtual_avail);
  142         
  143         /*
  144          * Initialize other VM packages
  145          */
  146         vmem_startup();
  147         vm_object_init();
  148         vm_map_startup();
  149         kmem_init(virtual_avail, virtual_end);
  150 
  151         /*
  152          * Initialize the kernel_arena.  This can grow on demand.
  153          */
  154         vmem_init(kernel_arena, "kernel arena", 0, 0, PAGE_SIZE, 0, 0);
  155         vmem_set_import(kernel_arena, kva_import, NULL, NULL,
  156 #if VM_NRESERVLEVEL > 0
  157             1 << (VM_LEVEL_0_ORDER + PAGE_SHIFT));
  158 #else
  159             /* On non-superpage architectures want large import sizes. */
  160             PAGE_SIZE * 1024);
  161 #endif
  162 
  163         kmem_init_zero_region();
  164         pmap_init();
  165         vm_pager_init();
  166 }
  167 
  168 void
  169 vm_ksubmap_init(struct kva_md_info *kmi)
  170 {
  171         vm_offset_t firstaddr;
  172         caddr_t v;
  173         vm_size_t size = 0;
  174         long physmem_est;
  175         vm_offset_t minaddr;
  176         vm_offset_t maxaddr;
  177 
  178         /*
  179          * Allocate space for system data structures.
  180          * The first available kernel virtual address is in "v".
  181          * As pages of kernel virtual memory are allocated, "v" is incremented.
  182          * As pages of memory are allocated and cleared,
  183          * "firstaddr" is incremented.
  184          */
  185 
  186         /*
  187          * Make two passes.  The first pass calculates how much memory is
  188          * needed and allocates it.  The second pass assigns virtual
  189          * addresses to the various data structures.
  190          */
  191         firstaddr = 0;
  192 again:
  193         v = (caddr_t)firstaddr;
  194 
  195         /*
  196          * Discount the physical memory larger than the size of kernel_map
  197          * to avoid eating up all of KVA space.
  198          */
  199         physmem_est = lmin(physmem, btoc(kernel_map->max_offset -
  200             kernel_map->min_offset));
  201 
  202         v = kern_vfs_bio_buffer_alloc(v, physmem_est);
  203 
  204         /*
  205          * End of first pass, size has been calculated so allocate memory
  206          */
  207         if (firstaddr == 0) {
  208                 size = (vm_size_t)v;
  209                 firstaddr = kmem_malloc(kernel_arena, round_page(size),
  210                     M_ZERO | M_WAITOK);
  211                 if (firstaddr == 0)
  212                         panic("startup: no room for tables");
  213                 goto again;
  214         }
  215 
  216         /*
  217          * End of second pass, addresses have been assigned
  218          */
  219         if ((vm_size_t)((char *)v - firstaddr) != size)
  220                 panic("startup: table size inconsistency");
  221 
  222         /*
  223          * Allocate the clean map to hold all of the paging and I/O virtual
  224          * memory.
  225          */
  226         size = (long)nbuf * BKVASIZE + (long)nswbuf * MAXPHYS +
  227             (long)bio_transient_maxcnt * MAXPHYS;
  228         kmi->clean_sva = firstaddr = kva_alloc(size);
  229         kmi->clean_eva = firstaddr + size;
  230 
  231         /*
  232          * Allocate the buffer arena.
  233          */
  234         size = (long)nbuf * BKVASIZE;
  235         kmi->buffer_sva = firstaddr;
  236         kmi->buffer_eva = kmi->buffer_sva + size;
  237         vmem_init(buffer_arena, "buffer arena", kmi->buffer_sva, size,
  238             PAGE_SIZE, 0, 0);
  239         firstaddr += size;
  240 
  241         /*
  242          * Now swap kva.
  243          */
  244         swapbkva = firstaddr;
  245         size = (long)nswbuf * MAXPHYS;
  246         firstaddr += size;
  247 
  248         /*
  249          * And optionally transient bio space.
  250          */
  251         if (bio_transient_maxcnt != 0) {
  252                 size = (long)bio_transient_maxcnt * MAXPHYS;
  253                 vmem_init(transient_arena, "transient arena",
  254                     firstaddr, size, PAGE_SIZE, 0, 0);
  255                 firstaddr += size;
  256         }
  257         if (firstaddr != kmi->clean_eva)
  258                 panic("Clean map calculation incorrect");
  259 
  260         /*
  261          * Allocate the pageable submaps.
  262          */
  263         exec_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr,
  264             exec_map_entries * round_page(PATH_MAX + ARG_MAX), FALSE);
  265         pipe_map = kmem_suballoc(kernel_map, &minaddr, &maxaddr, maxpipekva,
  266             FALSE);
  267 }

Cache object: 5ce39b4cd01e7d54576823949a57272d


[ 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.