|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 2000 Apple Computer, Inc. All rights reserved. ! 3: * ! 4: * @APPLE_LICENSE_HEADER_START@ ! 5: * ! 6: * The contents of this file constitute Original Code as defined in and ! 7: * are subject to the Apple Public Source License Version 1.1 (the ! 8: * "License"). You may not use this file except in compliance with the ! 9: * License. Please obtain a copy of the License at ! 10: * http://www.apple.com/publicsource and read it before using this file. ! 11: * ! 12: * This Original Code and all software distributed under the License are ! 13: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER ! 14: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, ! 15: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, ! 16: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the ! 17: * License for the specific language governing rights and limitations ! 18: * under the License. ! 19: * ! 20: * @APPLE_LICENSE_HEADER_END@ ! 21: */ ! 22: /* ! 23: * @OSF_COPYRIGHT@ ! 24: */ ! 25: /* ! 26: * Mach Operating System ! 27: * Copyright (c) 1991,1990,1989,1988,1987 Carnegie Mellon University ! 28: * All Rights Reserved. ! 29: * ! 30: * Permission to use, copy, modify and distribute this software and its ! 31: * documentation is hereby granted, provided that both the copyright ! 32: * notice and this permission notice appear in all copies of the ! 33: * software, derivative works or modified versions, and any portions ! 34: * thereof, and that both notices appear in supporting documentation. ! 35: * ! 36: * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" ! 37: * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR ! 38: * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. ! 39: * ! 40: * Carnegie Mellon requests users of this software to return to ! 41: * ! 42: * Software Distribution Coordinator or [email protected] ! 43: * School of Computer Science ! 44: * Carnegie Mellon University ! 45: * Pittsburgh PA 15213-3890 ! 46: * ! 47: * any improvements or extensions that they make and grant Carnegie Mellon ! 48: * the rights to redistribute these changes. ! 49: */ ! 50: /* ! 51: */ ! 52: /* ! 53: * File: vm/vm_init.c ! 54: * Author: Avadis Tevanian, Jr., Michael Wayne Young ! 55: * Date: 1985 ! 56: * ! 57: * Initialize the Virtual Memory subsystem. ! 58: */ ! 59: ! 60: #include <mach/machine/vm_types.h> ! 61: #include <kern/zalloc.h> ! 62: #include <kern/kalloc.h> ! 63: #include <kern/rtmalloc.h> ! 64: #include <vm/vm_object.h> ! 65: #include <vm/vm_map.h> ! 66: #include <vm/vm_page.h> ! 67: #include <vm/vm_kern.h> ! 68: #include <vm/memory_object.h> ! 69: #include <vm/vm_fault.h> ! 70: #include <vm/vm_init.h> ! 71: ! 72: #define ZONE_MAP_MIN (12 * 1024 * 1024) ! 73: #define ZONE_MAP_MAX (128 * 1024 * 1024) ! 74: ! 75: /* ! 76: * vm_mem_bootstrap initializes the virtual memory system. ! 77: * This is done only by the first cpu up. ! 78: */ ! 79: ! 80: void ! 81: vm_mem_bootstrap(void) ! 82: { ! 83: vm_offset_t start, end; ! 84: vm_size_t zsize; ! 85: ! 86: /* ! 87: * Initializes resident memory structures. ! 88: * From here on, all physical memory is accounted for, ! 89: * and we use only virtual addresses. ! 90: */ ! 91: ! 92: vm_page_bootstrap(&start, &end); ! 93: ! 94: /* ! 95: * Initialize other VM packages ! 96: */ ! 97: ! 98: zone_bootstrap(); ! 99: vm_object_bootstrap(); ! 100: vm_map_init(); ! 101: kmem_init(start, end); ! 102: pmap_init(); ! 103: ! 104: zsize = mem_size >> 2; /* Get target zone size as 1/4 of physical memory */ ! 105: if(zsize < ZONE_MAP_MIN) zsize = ZONE_MAP_MIN; /* Clamp to min */ ! 106: if(zsize > ZONE_MAP_MAX) zsize = ZONE_MAP_MAX; /* Clamp to max */ ! 107: zone_init(zsize); /* Allocate address space for zones */ ! 108: ! 109: kalloc_init(); ! 110: rtmalloc_init(); ! 111: vm_fault_init(); ! 112: vm_page_module_init(); ! 113: memory_manager_default_init(); ! 114: } ! 115: ! 116: void ! 117: vm_mem_init(void) ! 118: { ! 119: vm_object_init(); ! 120: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.