2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * The Mach Operating System project at Carnegie-Mellon University.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
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.
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
32 * from: @(#)vm_kern.c 8.3 (Berkeley) 1/12/94
35 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
36 * All rights reserved.
38 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
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.
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.
50 * Carnegie Mellon requests users of this software to return to
52 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
53 * School of Computer Science
54 * Carnegie Mellon University
55 * Pittsburgh PA 15213-3890
57 * any improvements or extensions that they make and grant Carnegie the
58 * rights to redistribute these changes.
62 * Kernel memory management.
65 #include <sys/cdefs.h>
66 __FBSDID("$FreeBSD$");
68 #include <sys/param.h>
69 #include <sys/systm.h>
70 #include <sys/kernel.h> /* for ticks and hz */
71 #include <sys/eventhandler.h>
73 #include <sys/mutex.h>
75 #include <sys/malloc.h>
78 #include <vm/vm_param.h>
80 #include <vm/vm_map.h>
81 #include <vm/vm_object.h>
82 #include <vm/vm_page.h>
83 #include <vm/vm_pageout.h>
84 #include <vm/vm_extern.h>
87 vm_map_t kernel_map=0;
91 vm_map_t buffer_map=0;
96 * Allocate a virtual address range with no underlying object and
97 * no initial mapping to physical memory. Any mapping from this
98 * range to physical memory must be explicitly created prior to
99 * its use, typically with pmap_qenter(). Any attempt to create
100 * a mapping on demand through vm_fault() will result in a panic.
103 kmem_alloc_nofault(map, size)
110 size = round_page(size);
111 addr = vm_map_min(map);
112 result = vm_map_find(map, NULL, 0,
113 &addr, size, TRUE, VM_PROT_ALL, VM_PROT_ALL, MAP_NOFAULT);
114 if (result != KERN_SUCCESS) {
121 * Allocate wired-down memory in the kernel's address map
125 kmem_alloc(map, size)
133 size = round_page(size);
136 * Use the kernel object for wired-down kernel pages. Assume that no
137 * region of the kernel object is referenced more than once.
141 * Locate sufficient space in the map. This will give us the final
142 * virtual address for the new memory, and thus will tell us the
143 * offset within the kernel map.
146 if (vm_map_findspace(map, vm_map_min(map), size, &addr)) {
150 offset = addr - VM_MIN_KERNEL_ADDRESS;
151 vm_object_reference(kernel_object);
152 vm_map_insert(map, kernel_object, offset, addr, addr + size,
153 VM_PROT_ALL, VM_PROT_ALL, 0);
157 * Guarantee that there are pages already in this object before
158 * calling vm_map_wire. This is to prevent the following
161 * 1) Threads have swapped out, so that there is a pager for the
162 * kernel_object. 2) The kmsg zone is empty, and so we are
163 * kmem_allocing a new page for it. 3) vm_map_wire calls vm_fault;
164 * there is no page, but there is a pager, so we call
165 * pager_data_request. But the kmsg zone is empty, so we must
166 * kmem_alloc. 4) goto 1 5) Even if the kmsg zone is not empty: when
167 * we get the data back from the pager, it will be (very stale)
168 * non-zero data. kmem_alloc is defined to return zero-filled memory.
170 * We're intentionally not activating the pages we allocate to prevent a
171 * race with page-out. vm_map_wire will wire the pages.
173 VM_OBJECT_LOCK(kernel_object);
174 for (i = 0; i < size; i += PAGE_SIZE) {
177 mem = vm_page_grab(kernel_object, OFF_TO_IDX(offset + i),
178 VM_ALLOC_NOBUSY | VM_ALLOC_ZERO | VM_ALLOC_RETRY);
179 mem->valid = VM_PAGE_BITS_ALL;
180 KASSERT((mem->flags & PG_UNMANAGED) != 0,
181 ("kmem_alloc: page %p is managed", mem));
183 VM_OBJECT_UNLOCK(kernel_object);
186 * And finally, mark the data as non-pageable.
188 (void) vm_map_wire(map, addr, addr + size,
189 VM_MAP_WIRE_SYSTEM|VM_MAP_WIRE_NOHOLES);
197 * Release a region of kernel virtual memory allocated
198 * with kmem_alloc, and return the physical pages
199 * associated with that region.
201 * This routine may not block on kernel maps.
204 kmem_free(map, addr, size)
210 (void) vm_map_remove(map, trunc_page(addr), round_page(addr + size));
216 * Allocates a map to manage a subrange
217 * of the kernel virtual address space.
219 * Arguments are as follows:
221 * parent Map to take range from
222 * min, max Returned endpoints of map
223 * size Size of range to find
226 kmem_suballoc(parent, min, max, size)
228 vm_offset_t *min, *max;
234 size = round_page(size);
236 *min = (vm_offset_t) vm_map_min(parent);
237 ret = vm_map_find(parent, NULL, (vm_offset_t) 0,
238 min, size, TRUE, VM_PROT_ALL, VM_PROT_ALL, 0);
239 if (ret != KERN_SUCCESS) {
240 printf("kmem_suballoc: bad status return of %d.\n", ret);
241 panic("kmem_suballoc");
244 result = vm_map_create(vm_map_pmap(parent), *min, *max);
246 panic("kmem_suballoc: cannot create submap");
247 if (vm_map_submap(parent, *min, *max, result) != KERN_SUCCESS)
248 panic("kmem_suballoc: unable to change range to submap");
255 * Allocate wired-down memory in the kernel's address map for the higher
256 * level kernel memory allocator (kern/kern_malloc.c). We cannot use
257 * kmem_alloc() because we may need to allocate memory at interrupt
258 * level where we cannot block (canwait == FALSE).
260 * This routine has its own private kernel submap (kmem_map) and object
261 * (kmem_object). This, combined with the fact that only malloc uses
262 * this routine, ensures that we will never block in map or object waits.
264 * Note that this still only works in a uni-processor environment and
265 * when called at splhigh().
267 * We don't worry about expanding the map (adding entries) since entries
268 * for wired maps are statically allocated.
270 * NOTE: This routine is not supposed to block if M_NOWAIT is set, but
271 * I have not verified that it actually does not block.
273 * `map' is ONLY allowed to be kmem_map or one of the mbuf submaps to
274 * which we never free.
277 kmem_malloc(map, size, flags)
282 vm_offset_t offset, i;
283 vm_map_entry_t entry;
288 size = round_page(size);
289 addr = vm_map_min(map);
292 * Locate sufficient space in the map. This will give us the final
293 * virtual address for the new memory, and thus will tell us the
294 * offset within the kernel map.
297 if (vm_map_findspace(map, vm_map_min(map), size, &addr)) {
299 if ((flags & M_NOWAIT) == 0) {
300 EVENTHANDLER_INVOKE(vm_lowmem, 0);
303 if (vm_map_findspace(map, vm_map_min(map), size, &addr)) {
305 panic("kmem_malloc(%ld): kmem_map too small: %ld total allocated",
306 (long)size, (long)map->size);
312 offset = addr - VM_MIN_KERNEL_ADDRESS;
313 vm_object_reference(kmem_object);
314 vm_map_insert(map, kmem_object, offset, addr, addr + size,
315 VM_PROT_ALL, VM_PROT_ALL, 0);
318 * Note: if M_NOWAIT specified alone, allocate from
319 * interrupt-safe queues only (just the free list). If
320 * M_USE_RESERVE is also specified, we can also
321 * allocate from the cache. Neither of the latter two
322 * flags may be specified from an interrupt since interrupts
323 * are not allowed to mess with the cache queue.
326 if ((flags & (M_NOWAIT|M_USE_RESERVE)) == M_NOWAIT)
327 pflags = VM_ALLOC_INTERRUPT | VM_ALLOC_WIRED;
329 pflags = VM_ALLOC_SYSTEM | VM_ALLOC_WIRED;
332 pflags |= VM_ALLOC_ZERO;
334 VM_OBJECT_LOCK(kmem_object);
335 for (i = 0; i < size; i += PAGE_SIZE) {
337 m = vm_page_alloc(kmem_object, OFF_TO_IDX(offset + i), pflags);
340 * Ran out of space, free everything up and return. Don't need
341 * to lock page queues here as we know that the pages we got
342 * aren't on any queues.
345 if ((flags & M_NOWAIT) == 0) {
346 VM_OBJECT_UNLOCK(kmem_object);
350 VM_OBJECT_LOCK(kmem_object);
354 * Free the pages before removing the map entry.
355 * They are already marked busy. Calling
356 * vm_map_delete before the pages has been freed or
357 * unbusied will cause a deadlock.
361 m = vm_page_lookup(kmem_object,
362 OFF_TO_IDX(offset + i));
363 vm_page_lock_queues();
364 vm_page_unwire(m, 0);
366 vm_page_unlock_queues();
368 VM_OBJECT_UNLOCK(kmem_object);
369 vm_map_delete(map, addr, addr + size);
373 if (flags & M_ZERO && (m->flags & PG_ZERO) == 0)
375 m->valid = VM_PAGE_BITS_ALL;
376 KASSERT((m->flags & PG_UNMANAGED) != 0,
377 ("kmem_malloc: page %p is managed", m));
379 VM_OBJECT_UNLOCK(kmem_object);
382 * Mark map entry as non-pageable. Assert: vm_map_insert() will never
383 * be able to extend the previous entry so there will be a new entry
384 * exactly corresponding to this address range and it will have
387 if (!vm_map_lookup_entry(map, addr, &entry) ||
388 entry->start != addr || entry->end != addr + size ||
389 entry->wired_count != 0)
390 panic("kmem_malloc: entry not found or misaligned");
391 entry->wired_count = 1;
394 * At this point, the kmem_object must be unlocked because
395 * vm_map_simplify_entry() calls vm_object_deallocate(), which
396 * locks the kmem_object.
398 vm_map_simplify_entry(map, entry);
401 * Loop thru pages, entering them in the pmap.
403 VM_OBJECT_LOCK(kmem_object);
404 for (i = 0; i < size; i += PAGE_SIZE) {
405 m = vm_page_lookup(kmem_object, OFF_TO_IDX(offset + i));
407 * Because this is kernel_pmap, this call will not block.
409 pmap_enter(kernel_pmap, addr + i, m, VM_PROT_ALL, 1);
412 VM_OBJECT_UNLOCK(kmem_object);
421 * Allocates pageable memory from a sub-map of the kernel. If the submap
422 * has no room, the caller sleeps waiting for more memory in the submap.
424 * This routine may block.
427 kmem_alloc_wait(map, size)
433 size = round_page(size);
437 * To make this work for more than one map, use the map's lock
438 * to lock out sleepers/wakers.
441 if (vm_map_findspace(map, vm_map_min(map), size, &addr) == 0)
443 /* no space now; see if we can ever get space */
444 if (vm_map_max(map) - vm_map_min(map) < size) {
448 map->needs_wakeup = TRUE;
449 vm_map_unlock_and_wait(map, FALSE);
451 vm_map_insert(map, NULL, 0, addr, addr + size, VM_PROT_ALL, VM_PROT_ALL, 0);
459 * Returns memory to a submap of the kernel, and wakes up any processes
460 * waiting for memory in that map.
463 kmem_free_wakeup(map, addr, size)
470 (void) vm_map_delete(map, trunc_page(addr), round_page(addr + size));
471 if (map->needs_wakeup) {
472 map->needs_wakeup = FALSE;
481 * Create the kernel map; insert a mapping covering kernel text,
482 * data, bss, and all space allocated thus far (`boostrap' data). The
483 * new map will thus map the range between VM_MIN_KERNEL_ADDRESS and
484 * `start' as allocated, and the range between `start' and `end' as free.
487 kmem_init(start, end)
488 vm_offset_t start, end;
492 m = vm_map_create(kernel_pmap, VM_MIN_KERNEL_ADDRESS, end);
495 /* N.B.: cannot use kgdb to debug, starting with this assignment ... */
497 (void) vm_map_insert(m, NULL, (vm_ooffset_t) 0,
498 VM_MIN_KERNEL_ADDRESS, start, VM_PROT_ALL, VM_PROT_ALL,
500 /* ... and ending with the completion of the above `insert' */