vm_kern.c revision 9507
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_kern.c 8.3 (Berkeley) 1/12/94 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 * $Id: vm_kern.c,v 1.13 1995/05/30 08:16:04 rgrimes Exp $ 65 */ 66 67/* 68 * Kernel memory management. 69 */ 70 71#include <sys/param.h> 72#include <sys/systm.h> 73#include <sys/kernel.h> 74#include <sys/proc.h> 75#include <sys/malloc.h> 76#include <sys/syslog.h> 77 78#include <vm/vm.h> 79#include <vm/vm_page.h> 80#include <vm/vm_pageout.h> 81#include <vm/vm_kern.h> 82 83vm_map_t buffer_map; 84vm_map_t kernel_map; 85vm_map_t kmem_map; 86vm_map_t mb_map; 87vm_map_t io_map; 88vm_map_t clean_map; 89vm_map_t pager_map; 90vm_map_t phys_map; 91vm_map_t exec_map; 92vm_map_t u_map; 93extern int mb_map_full; 94 95/* 96 * kmem_alloc_pageable: 97 * 98 * Allocate pageable memory to the kernel's address map. 99 * map must be "kernel_map" below. 100 */ 101 102vm_offset_t 103kmem_alloc_pageable(map, size) 104 vm_map_t map; 105 register vm_size_t size; 106{ 107 vm_offset_t addr; 108 register int result; 109 110#if 0 111 if (map != kernel_map) 112 panic("kmem_alloc_pageable: not called with kernel_map"); 113#endif 114 115 size = round_page(size); 116 117 addr = vm_map_min(map); 118 result = vm_map_find(map, NULL, (vm_offset_t) 0, 119 &addr, size, TRUE); 120 if (result != KERN_SUCCESS) { 121 return (0); 122 } 123 return (addr); 124} 125 126/* 127 * Allocate wired-down memory in the kernel's address map 128 * or a submap. 129 */ 130vm_offset_t 131kmem_alloc(map, size) 132 register vm_map_t map; 133 register vm_size_t size; 134{ 135 vm_offset_t addr; 136 register vm_offset_t offset; 137 vm_offset_t i; 138 139 size = round_page(size); 140 141 /* 142 * Use the kernel object for wired-down kernel pages. Assume that no 143 * region of the kernel object is referenced more than once. 144 */ 145 146 /* 147 * Locate sufficient space in the map. This will give us the final 148 * virtual address for the new memory, and thus will tell us the 149 * offset within the kernel map. 150 */ 151 vm_map_lock(map); 152 if (vm_map_findspace(map, 0, size, &addr)) { 153 vm_map_unlock(map); 154 return (0); 155 } 156 offset = addr - VM_MIN_KERNEL_ADDRESS; 157 vm_object_reference(kernel_object); 158 vm_map_insert(map, kernel_object, offset, addr, addr + size); 159 vm_map_unlock(map); 160 161 /* 162 * Guarantee that there are pages already in this object before 163 * calling vm_map_pageable. This is to prevent the following 164 * scenario: 165 * 166 * 1) Threads have swapped out, so that there is a pager for the 167 * kernel_object. 2) The kmsg zone is empty, and so we are 168 * kmem_allocing a new page for it. 3) vm_map_pageable calls vm_fault; 169 * there is no page, but there is a pager, so we call 170 * pager_data_request. But the kmsg zone is empty, so we must 171 * kmem_alloc. 4) goto 1 5) Even if the kmsg zone is not empty: when 172 * we get the data back from the pager, it will be (very stale) 173 * non-zero data. kmem_alloc is defined to return zero-filled memory. 174 * 175 * We're intentionally not activating the pages we allocate to prevent a 176 * race with page-out. vm_map_pageable will wire the pages. 177 */ 178 179 for (i = 0; i < size; i += PAGE_SIZE) { 180 vm_page_t mem; 181 182 while ((mem = vm_page_alloc(kernel_object, offset + i, VM_ALLOC_NORMAL)) == NULL) { 183 VM_WAIT; 184 } 185 vm_page_zero_fill(mem); 186 mem->flags &= ~PG_BUSY; 187 mem->valid = VM_PAGE_BITS_ALL; 188 } 189 190 /* 191 * And finally, mark the data as non-pageable. 192 */ 193 194 (void) vm_map_pageable(map, (vm_offset_t) addr, addr + size, FALSE); 195 196 /* 197 * Try to coalesce the map 198 */ 199 vm_map_simplify(map, addr); 200 201 return (addr); 202} 203 204/* 205 * kmem_free: 206 * 207 * Release a region of kernel virtual memory allocated 208 * with kmem_alloc, and return the physical pages 209 * associated with that region. 210 */ 211void 212kmem_free(map, addr, size) 213 vm_map_t map; 214 register vm_offset_t addr; 215 vm_size_t size; 216{ 217 (void) vm_map_remove(map, trunc_page(addr), round_page(addr + size)); 218} 219 220/* 221 * kmem_suballoc: 222 * 223 * Allocates a map to manage a subrange 224 * of the kernel virtual address space. 225 * 226 * Arguments are as follows: 227 * 228 * parent Map to take range from 229 * size Size of range to find 230 * min, max Returned endpoints of map 231 * pageable Can the region be paged 232 */ 233vm_map_t 234kmem_suballoc(parent, min, max, size, pageable) 235 register vm_map_t parent; 236 vm_offset_t *min, *max; 237 register vm_size_t size; 238 boolean_t pageable; 239{ 240 register int ret; 241 vm_map_t result; 242 243 size = round_page(size); 244 245 *min = (vm_offset_t) vm_map_min(parent); 246 ret = vm_map_find(parent, NULL, (vm_offset_t) 0, 247 min, size, TRUE); 248 if (ret != KERN_SUCCESS) { 249 printf("kmem_suballoc: bad status return of %d.\n", ret); 250 panic("kmem_suballoc"); 251 } 252 *max = *min + size; 253 pmap_reference(vm_map_pmap(parent)); 254 result = vm_map_create(vm_map_pmap(parent), *min, *max, pageable); 255 if (result == NULL) 256 panic("kmem_suballoc: cannot create submap"); 257 if ((ret = vm_map_submap(parent, *min, *max, result)) != KERN_SUCCESS) 258 panic("kmem_suballoc: unable to change range to submap"); 259 return (result); 260} 261 262/* 263 * Allocate wired-down memory in the kernel's address map for the higher 264 * level kernel memory allocator (kern/kern_malloc.c). We cannot use 265 * kmem_alloc() because we may need to allocate memory at interrupt 266 * level where we cannot block (canwait == FALSE). 267 * 268 * This routine has its own private kernel submap (kmem_map) and object 269 * (kmem_object). This, combined with the fact that only malloc uses 270 * this routine, ensures that we will never block in map or object waits. 271 * 272 * Note that this still only works in a uni-processor environment and 273 * when called at splhigh(). 274 * 275 * We don't worry about expanding the map (adding entries) since entries 276 * for wired maps are statically allocated. 277 */ 278vm_offset_t 279kmem_malloc(map, size, waitflag) 280 register vm_map_t map; 281 register vm_size_t size; 282 boolean_t waitflag; 283{ 284 register vm_offset_t offset, i; 285 vm_map_entry_t entry; 286 vm_offset_t addr; 287 vm_page_t m; 288 289 if (map != kmem_map && map != mb_map) 290 panic("kmem_malloc: map != {kmem,mb}_map"); 291 292 size = round_page(size); 293 addr = vm_map_min(map); 294 295 /* 296 * Locate sufficient space in the map. This will give us the final 297 * virtual address for the new memory, and thus will tell us the 298 * offset within the kernel map. 299 */ 300 vm_map_lock(map); 301 if (vm_map_findspace(map, 0, size, &addr)) { 302 vm_map_unlock(map); 303 if (map == mb_map) { 304 mb_map_full = TRUE; 305 log(LOG_ERR, "mb_map full\n"); 306 return (0); 307 } 308 if (waitflag == M_WAITOK) 309 panic("kmem_malloc: kmem_map too small"); 310 return (0); 311 } 312 offset = addr - vm_map_min(kmem_map); 313 vm_object_reference(kmem_object); 314 vm_map_insert(map, kmem_object, offset, addr, addr + size); 315 316 /* 317 * If we can wait, just mark the range as wired (will fault pages as 318 * necessary). 319 */ 320 if (waitflag == M_WAITOK) { 321 vm_map_unlock(map); 322 (void) vm_map_pageable(map, (vm_offset_t) addr, addr + size, 323 FALSE); 324 vm_map_simplify(map, addr); 325 return (addr); 326 } 327 /* 328 * If we cannot wait then we must allocate all memory up front, 329 * pulling it off the active queue to prevent pageout. 330 */ 331 for (i = 0; i < size; i += PAGE_SIZE) { 332 m = vm_page_alloc(kmem_object, offset + i, 333 (waitflag == M_NOWAIT) ? VM_ALLOC_INTERRUPT : VM_ALLOC_SYSTEM); 334 335 /* 336 * Ran out of space, free everything up and return. Don't need 337 * to lock page queues here as we know that the pages we got 338 * aren't on any queues. 339 */ 340 if (m == NULL) { 341 while (i != 0) { 342 i -= PAGE_SIZE; 343 m = vm_page_lookup(kmem_object, offset + i); 344 vm_page_free(m); 345 } 346 vm_map_delete(map, addr, addr + size); 347 vm_map_unlock(map); 348 return (0); 349 } 350#if 0 351 vm_page_zero_fill(m); 352#endif 353 m->flags &= ~PG_BUSY; 354 m->valid = VM_PAGE_BITS_ALL; 355 } 356 357 /* 358 * Mark map entry as non-pageable. Assert: vm_map_insert() will never 359 * be able to extend the previous entry so there will be a new entry 360 * exactly corresponding to this address range and it will have 361 * wired_count == 0. 362 */ 363 if (!vm_map_lookup_entry(map, addr, &entry) || 364 entry->start != addr || entry->end != addr + size || 365 entry->wired_count) 366 panic("kmem_malloc: entry not found or misaligned"); 367 entry->wired_count++; 368 369 /* 370 * Loop thru pages, entering them in the pmap. (We cannot add them to 371 * the wired count without wrapping the vm_page_queue_lock in 372 * splimp...) 373 */ 374 for (i = 0; i < size; i += PAGE_SIZE) { 375 m = vm_page_lookup(kmem_object, offset + i); 376 pmap_kenter(addr + i, VM_PAGE_TO_PHYS(m)); 377 } 378 vm_map_unlock(map); 379 380 vm_map_simplify(map, addr); 381 return (addr); 382} 383 384/* 385 * kmem_alloc_wait 386 * 387 * Allocates pageable memory from a sub-map of the kernel. If the submap 388 * has no room, the caller sleeps waiting for more memory in the submap. 389 * 390 */ 391vm_offset_t 392kmem_alloc_wait(map, size) 393 vm_map_t map; 394 vm_size_t size; 395{ 396 vm_offset_t addr; 397 398 size = round_page(size); 399 400 for (;;) { 401 /* 402 * To make this work for more than one map, use the map's lock 403 * to lock out sleepers/wakers. 404 */ 405 vm_map_lock(map); 406 if (vm_map_findspace(map, 0, size, &addr) == 0) 407 break; 408 /* no space now; see if we can ever get space */ 409 if (vm_map_max(map) - vm_map_min(map) < size) { 410 vm_map_unlock(map); 411 return (0); 412 } 413 vm_map_unlock(map); 414 tsleep(map, PVM, "kmaw", 0); 415 } 416 vm_map_insert(map, NULL, (vm_offset_t) 0, addr, addr + size); 417 vm_map_unlock(map); 418 return (addr); 419} 420 421/* 422 * kmem_free_wakeup 423 * 424 * Returns memory to a submap of the kernel, and wakes up any processes 425 * waiting for memory in that map. 426 */ 427void 428kmem_free_wakeup(map, addr, size) 429 vm_map_t map; 430 vm_offset_t addr; 431 vm_size_t size; 432{ 433 vm_map_lock(map); 434 (void) vm_map_delete(map, trunc_page(addr), round_page(addr + size)); 435 wakeup(map); 436 vm_map_unlock(map); 437} 438 439/* 440 * Create the kernel map; insert a mapping covering kernel text, data, bss, 441 * and all space allocated thus far (`boostrap' data). The new map will thus 442 * map the range between VM_MIN_KERNEL_ADDRESS and `start' as allocated, and 443 * the range between `start' and `end' as free. 444 */ 445void 446kmem_init(start, end) 447 vm_offset_t start, end; 448{ 449 register vm_map_t m; 450 451 m = vm_map_create(kernel_pmap, VM_MIN_KERNEL_ADDRESS, end, FALSE); 452 vm_map_lock(m); 453 /* N.B.: cannot use kgdb to debug, starting with this assignment ... */ 454 kernel_map = m; 455 (void) vm_map_insert(m, NULL, (vm_offset_t) 0, 456 VM_MIN_KERNEL_ADDRESS, start); 457 /* ... and ending with the completion of the above `insert' */ 458 vm_map_unlock(m); 459} 460