2 * Copyright (c) 2000-2005 Apple Computer, Inc. All rights reserved.
4 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. The rights granted to you under the License
10 * may not be used to create, or enable the creation or redistribution of,
11 * unlawful or unlicensed copies of an Apple operating system, or to
12 * circumvent, violate, or enable the circumvention or violation of, any
13 * terms of an Apple operating system software license agreement.
15 * Please obtain a copy of the License at
16 * http://www.opensource.apple.com/apsl/ and read it before using this file.
18 * The Original Code and all software distributed under the License are
19 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
20 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
21 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
22 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
23 * Please see the License for the specific language governing rights and
24 * limitations under the License.
26 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
32 * Mach Operating System
33 * Copyright (c) 1991,1990,1989,1988,1987 Carnegie Mellon University
34 * All Rights Reserved.
36 * Permission to use, copy, modify and distribute this software and its
37 * documentation is hereby granted, provided that both the copyright
38 * notice and this permission notice appear in all copies of the
39 * software, derivative works or modified versions, and any portions
40 * thereof, and that both notices appear in supporting documentation.
42 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
43 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
44 * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
46 * Carnegie Mellon requests users of this software to return to
48 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
49 * School of Computer Science
50 * Carnegie Mellon University
51 * Pittsburgh PA 15213-3890
53 * any improvements or extensions that they make and grant Carnegie Mellon
54 * the rights to redistribute these changes.
60 * Author: Avadis Tevanian, Jr., Michael Wayne Young
63 * Kernel memory management.
66 #include <mach/kern_return.h>
67 #include <mach/vm_param.h>
68 #include <kern/assert.h>
69 #include <kern/lock.h>
70 #include <kern/thread.h>
71 #include <vm/vm_kern.h>
72 #include <vm/vm_map.h>
73 #include <vm/vm_object.h>
74 #include <vm/vm_page.h>
75 #include <vm/vm_pageout.h>
76 #include <kern/misc_protos.h>
81 * Variables exported by this module.
85 vm_map_t kernel_pageable_map
;
88 * Forward declarations for internal functions.
90 extern kern_return_t
kmem_alloc_pages(
91 register vm_object_t object
,
92 register vm_object_offset_t offset
,
93 register vm_object_size_t size
);
95 extern void kmem_remap_pages(
96 register vm_object_t object
,
97 register vm_object_offset_t offset
,
98 register vm_offset_t start
,
99 register vm_offset_t end
,
100 vm_prot_t protection
);
111 vm_object_offset_t offset
;
112 vm_map_offset_t map_addr
;
113 vm_map_offset_t map_mask
;
114 vm_map_size_t map_size
, i
;
115 vm_map_entry_t entry
;
119 if (map
== VM_MAP_NULL
|| (flags
&& (flags
^ KMA_KOBJECT
)))
120 return KERN_INVALID_ARGUMENT
;
124 return KERN_INVALID_ARGUMENT
;
127 map_size
= vm_map_round_page(size
);
128 map_mask
= (vm_map_offset_t
)mask
;
131 * Allocate a new object (if necessary) and the reference we
132 * will be donating to the map entry. We must do this before
133 * locking the map, or risk deadlock with the default pager.
135 if ((flags
& KMA_KOBJECT
) != 0) {
136 object
= kernel_object
;
137 vm_object_reference(object
);
139 object
= vm_object_allocate(map_size
);
142 kr
= vm_map_find_space(map
, &map_addr
, map_size
, map_mask
, &entry
);
143 if (KERN_SUCCESS
!= kr
) {
144 vm_object_deallocate(object
);
148 entry
->object
.vm_object
= object
;
149 entry
->offset
= offset
= (object
== kernel_object
) ?
150 map_addr
- VM_MIN_KERNEL_ADDRESS
: 0;
152 /* Take an extra object ref in case the map entry gets deleted */
153 vm_object_reference(object
);
156 kr
= cpm_allocate(CAST_DOWN(vm_size_t
, map_size
), &pages
, FALSE
);
158 if (kr
!= KERN_SUCCESS
) {
159 vm_map_remove(map
, vm_map_trunc_page(map_addr
),
160 vm_map_round_page(map_addr
+ map_size
), 0);
161 vm_object_deallocate(object
);
166 vm_object_lock(object
);
167 for (i
= 0; i
< map_size
; i
+= PAGE_SIZE
) {
169 pages
= NEXT_PAGE(m
);
171 vm_page_insert(m
, object
, offset
+ i
);
173 vm_object_unlock(object
);
175 if ((kr
= vm_map_wire(map
, vm_map_trunc_page(map_addr
),
176 vm_map_round_page(map_addr
+ map_size
), VM_PROT_DEFAULT
, FALSE
))
178 if (object
== kernel_object
) {
179 vm_object_lock(object
);
180 vm_object_page_remove(object
, offset
, offset
+ map_size
);
181 vm_object_unlock(object
);
183 vm_map_remove(map
, vm_map_trunc_page(map_addr
),
184 vm_map_round_page(map_addr
+ map_size
), 0);
185 vm_object_deallocate(object
);
188 vm_object_deallocate(object
);
190 if (object
== kernel_object
)
191 vm_map_simplify(map
, map_addr
);
198 * Master entry point for allocating kernel memory.
199 * NOTE: this routine is _never_ interrupt safe.
201 * map : map to allocate into
202 * addrp : pointer to start address of new memory
203 * size : size of memory requested
205 * KMA_HERE *addrp is base address, else "anywhere"
206 * KMA_NOPAGEWAIT don't wait for pages if unavailable
207 * KMA_KOBJECT use kernel_object
211 kernel_memory_allocate(
212 register vm_map_t map
,
213 register vm_offset_t
*addrp
,
214 register vm_size_t size
,
215 register vm_offset_t mask
,
219 vm_object_offset_t offset
;
220 vm_map_entry_t entry
;
221 vm_map_offset_t map_addr
;
222 vm_map_offset_t map_mask
;
223 vm_map_size_t map_size
;
229 return KERN_INVALID_ARGUMENT
;
232 map_size
= vm_map_round_page(size
);
233 map_mask
= (vm_map_offset_t
) mask
;
236 * Allocate a new object (if necessary). We must do this before
237 * locking the map, or risk deadlock with the default pager.
239 if ((flags
& KMA_KOBJECT
) != 0) {
240 object
= kernel_object
;
241 vm_object_reference(object
);
243 object
= vm_object_allocate(map_size
);
246 kr
= vm_map_find_space(map
, &map_addr
, map_size
, map_mask
, &entry
);
247 if (KERN_SUCCESS
!= kr
) {
248 vm_object_deallocate(object
);
252 entry
->object
.vm_object
= object
;
253 entry
->offset
= offset
= (object
== kernel_object
) ?
254 map_addr
- VM_MIN_KERNEL_ADDRESS
: 0;
256 vm_object_reference(object
);
259 vm_object_lock(object
);
260 for (i
= 0; i
< map_size
; i
+= PAGE_SIZE
) {
263 while (VM_PAGE_NULL
==
264 (mem
= vm_page_alloc(object
, offset
+ i
))) {
265 if (flags
& KMA_NOPAGEWAIT
) {
266 if (object
== kernel_object
)
267 vm_object_page_remove(object
, offset
, offset
+ i
);
268 vm_object_unlock(object
);
269 vm_map_remove(map
, map_addr
, map_addr
+ map_size
, 0);
270 vm_object_deallocate(object
);
271 return KERN_RESOURCE_SHORTAGE
;
273 vm_object_unlock(object
);
275 vm_object_lock(object
);
279 vm_object_unlock(object
);
281 if ((kr
= vm_map_wire(map
, map_addr
, map_addr
+ map_size
, VM_PROT_DEFAULT
, FALSE
))
283 if (object
== kernel_object
) {
284 vm_object_lock(object
);
285 vm_object_page_remove(object
, offset
, offset
+ map_size
);
286 vm_object_unlock(object
);
288 vm_map_remove(map
, map_addr
, map_addr
+ map_size
, 0);
289 vm_object_deallocate(object
);
292 /* now that the page is wired, we no longer have to fear coalesce */
293 vm_object_deallocate(object
);
294 if (object
== kernel_object
)
295 vm_map_simplify(map
, map_addr
);
298 * Return the memory, not zeroed.
300 *addrp
= CAST_DOWN(vm_offset_t
, map_addr
);
307 * Allocate wired-down memory in the kernel's address map
308 * or a submap. The memory is not zero-filled.
317 return kernel_memory_allocate(map
, addrp
, size
, 0, 0);
323 * Reallocate wired-down memory in the kernel's address map
324 * or a submap. Newly allocated pages are not zeroed.
325 * This can only be used on regions allocated with kmem_alloc.
327 * If successful, the pages in the old region are mapped twice.
328 * The old region is unchanged. Use kmem_free to get rid of it.
335 vm_offset_t
*newaddrp
,
339 vm_object_offset_t offset
;
340 vm_map_offset_t oldmapmin
;
341 vm_map_offset_t oldmapmax
;
342 vm_map_offset_t newmapaddr
;
343 vm_map_size_t oldmapsize
;
344 vm_map_size_t newmapsize
;
345 vm_map_entry_t oldentry
;
346 vm_map_entry_t newentry
;
350 oldmapmin
= vm_map_trunc_page(oldaddr
);
351 oldmapmax
= vm_map_round_page(oldaddr
+ oldsize
);
352 oldmapsize
= oldmapmax
- oldmapmin
;
353 newmapsize
= vm_map_round_page(newsize
);
357 * Find the VM object backing the old region.
362 if (!vm_map_lookup_entry(map
, oldmapmin
, &oldentry
))
363 panic("kmem_realloc");
364 object
= oldentry
->object
.vm_object
;
367 * Increase the size of the object and
368 * fill in the new region.
371 vm_object_reference(object
);
372 /* by grabbing the object lock before unlocking the map */
373 /* we guarantee that we will panic if more than one */
374 /* attempt is made to realloc a kmem_alloc'd area */
375 vm_object_lock(object
);
377 if (object
->size
!= oldmapsize
)
378 panic("kmem_realloc");
379 object
->size
= newmapsize
;
380 vm_object_unlock(object
);
382 /* allocate the new pages while expanded portion of the */
383 /* object is still not mapped */
384 kmem_alloc_pages(object
, vm_object_round_page(oldmapsize
),
385 vm_object_round_page(newmapsize
-oldmapsize
));
388 * Find space for the new region.
391 kr
= vm_map_find_space(map
, &newmapaddr
, newmapsize
,
392 (vm_map_offset_t
) 0, &newentry
);
393 if (kr
!= KERN_SUCCESS
) {
394 vm_object_lock(object
);
395 for(offset
= oldmapsize
;
396 offset
< newmapsize
; offset
+= PAGE_SIZE
) {
397 if ((mem
= vm_page_lookup(object
, offset
)) != VM_PAGE_NULL
) {
398 vm_page_lock_queues();
400 vm_page_unlock_queues();
403 object
->size
= oldmapsize
;
404 vm_object_unlock(object
);
405 vm_object_deallocate(object
);
408 newentry
->object
.vm_object
= object
;
409 newentry
->offset
= 0;
410 assert (newentry
->wired_count
== 0);
413 /* add an extra reference in case we have someone doing an */
414 /* unexpected deallocate */
415 vm_object_reference(object
);
418 kr
= vm_map_wire(map
, newmapaddr
, newmapaddr
+ newmapsize
, VM_PROT_DEFAULT
, FALSE
);
419 if (KERN_SUCCESS
!= kr
) {
420 vm_map_remove(map
, newmapaddr
, newmapaddr
+ newmapsize
, 0);
421 vm_object_lock(object
);
422 for(offset
= oldsize
; offset
< newmapsize
; offset
+= PAGE_SIZE
) {
423 if ((mem
= vm_page_lookup(object
, offset
)) != VM_PAGE_NULL
) {
424 vm_page_lock_queues();
426 vm_page_unlock_queues();
429 object
->size
= oldmapsize
;
430 vm_object_unlock(object
);
431 vm_object_deallocate(object
);
434 vm_object_deallocate(object
);
436 *newaddrp
= CAST_DOWN(vm_offset_t
, newmapaddr
);
443 * Allocate wired-down memory in the kernel's address map
444 * or a submap. The memory is not zero-filled.
446 * The memory is allocated in the kernel_object.
447 * It may not be copied with vm_map_copy, and
448 * it may not be reallocated with kmem_realloc.
457 return kernel_memory_allocate(map
, addrp
, size
, 0, KMA_KOBJECT
);
461 * kmem_alloc_aligned:
463 * Like kmem_alloc_wired, except that the memory is aligned.
464 * The size should be a power-of-2.
473 if ((size
& (size
- 1)) != 0)
474 panic("kmem_alloc_aligned: size not aligned");
475 return kernel_memory_allocate(map
, addrp
, size
, size
- 1, KMA_KOBJECT
);
479 * kmem_alloc_pageable:
481 * Allocate pageable memory in the kernel's address map.
490 vm_map_offset_t map_addr
;
491 vm_map_size_t map_size
;
495 map_addr
= (vm_map_min(map
)) + 0x1000;
497 map_addr
= vm_map_min(map
);
499 map_size
= vm_map_round_page(size
);
501 kr
= vm_map_enter(map
, &map_addr
, map_size
,
502 (vm_map_offset_t
) 0, VM_FLAGS_ANYWHERE
,
503 VM_OBJECT_NULL
, (vm_object_offset_t
) 0, FALSE
,
504 VM_PROT_DEFAULT
, VM_PROT_ALL
, VM_INHERIT_DEFAULT
);
506 if (kr
!= KERN_SUCCESS
)
509 *addrp
= CAST_DOWN(vm_offset_t
, map_addr
);
516 * Release a region of kernel virtual memory allocated
517 * with kmem_alloc, kmem_alloc_wired, or kmem_alloc_pageable,
518 * and return the physical pages associated with that region.
529 kr
= vm_map_remove(map
, vm_map_trunc_page(addr
),
530 vm_map_round_page(addr
+ size
),
531 VM_MAP_REMOVE_KUNWIRE
);
532 if (kr
!= KERN_SUCCESS
)
537 * Allocate new pages in an object.
542 register vm_object_t object
,
543 register vm_object_offset_t offset
,
544 register vm_object_size_t size
)
546 vm_object_size_t alloc_size
;
548 alloc_size
= vm_object_round_page(size
);
549 vm_object_lock(object
);
551 register vm_page_t mem
;
557 while (VM_PAGE_NULL
==
558 (mem
= vm_page_alloc(object
, offset
))) {
559 vm_object_unlock(object
);
561 vm_object_lock(object
);
565 alloc_size
-= PAGE_SIZE
;
568 vm_object_unlock(object
);
573 * Remap wired pages in an object into a new region.
574 * The object is assumed to be mapped into the kernel map or
579 register vm_object_t object
,
580 register vm_object_offset_t offset
,
581 register vm_offset_t start
,
582 register vm_offset_t end
,
583 vm_prot_t protection
)
586 vm_map_offset_t map_start
;
587 vm_map_offset_t map_end
;
590 * Mark the pmap region as not pageable.
592 map_start
= vm_map_trunc_page(start
);
593 map_end
= vm_map_round_page(end
);
595 pmap_pageable(kernel_pmap
, map_start
, map_end
, FALSE
);
597 while (map_start
< map_end
) {
598 register vm_page_t mem
;
600 vm_object_lock(object
);
605 if ((mem
= vm_page_lookup(object
, offset
)) == VM_PAGE_NULL
)
606 panic("kmem_remap_pages");
609 * Wire it down (again)
611 vm_page_lock_queues();
613 vm_page_unlock_queues();
614 vm_object_unlock(object
);
618 * The page is supposed to be wired now, so it
619 * shouldn't be encrypted at this point. It can
620 * safely be entered in the page table.
622 ASSERT_PAGE_DECRYPTED(mem
);
625 * Enter it in the kernel pmap. The page isn't busy,
626 * but this shouldn't be a problem because it is wired.
628 PMAP_ENTER(kernel_pmap
, map_start
, mem
, protection
,
629 ((unsigned int)(mem
->object
->wimg_bits
))
633 map_start
+= PAGE_SIZE
;
641 * Allocates a map to manage a subrange
642 * of the kernel virtual address space.
644 * Arguments are as follows:
646 * parent Map to take range from
647 * addr Address of start of range (IN/OUT)
648 * size Size of range to find
649 * pageable Can region be paged
650 * anywhere Can region be located anywhere in map
651 * new_map Pointer to new submap
663 vm_map_offset_t map_addr
;
664 vm_map_size_t map_size
;
667 map_size
= vm_map_round_page(size
);
670 * Need reference on submap object because it is internal
671 * to the vm_system. vm_object_enter will never be called
672 * on it (usual source of reference for vm_map_enter).
674 vm_object_reference(vm_submap_object
);
676 map_addr
= (flags
& VM_FLAGS_ANYWHERE
) ?
677 vm_map_min(parent
) : vm_map_trunc_page(*addr
);
679 kr
= vm_map_enter(parent
, &map_addr
, map_size
,
680 (vm_map_offset_t
) 0, flags
,
681 vm_submap_object
, (vm_object_offset_t
) 0, FALSE
,
682 VM_PROT_DEFAULT
, VM_PROT_ALL
, VM_INHERIT_DEFAULT
);
683 if (kr
!= KERN_SUCCESS
) {
684 vm_object_deallocate(vm_submap_object
);
688 pmap_reference(vm_map_pmap(parent
));
689 map
= vm_map_create(vm_map_pmap(parent
), map_addr
, map_addr
+ map_size
, pageable
);
690 if (map
== VM_MAP_NULL
)
691 panic("kmem_suballoc: vm_map_create failed"); /* "can't happen" */
693 kr
= vm_map_submap(parent
, map_addr
, map_addr
+ map_size
, map
, map_addr
, FALSE
);
694 if (kr
!= KERN_SUCCESS
) {
696 * See comment preceding vm_map_submap().
698 vm_map_remove(parent
, map_addr
, map_addr
+ map_size
, VM_MAP_NO_FLAGS
);
699 vm_map_deallocate(map
); /* also removes ref to pmap */
700 vm_object_deallocate(vm_submap_object
);
703 *addr
= CAST_DOWN(vm_offset_t
, map_addr
);
705 return (KERN_SUCCESS
);
711 * Initialize the kernel's virtual memory map, taking
712 * into account all memory allocated up to this time.
719 vm_map_offset_t map_start
;
720 vm_map_offset_t map_end
;
722 map_start
= vm_map_trunc_page(start
);
723 map_end
= vm_map_round_page(end
);
725 kernel_map
= vm_map_create(pmap_kernel(),VM_MIN_KERNEL_ADDRESS
,
729 * Reserve virtual memory allocated up to this time.
732 if (start
!= VM_MIN_KERNEL_ADDRESS
) {
733 vm_map_offset_t map_addr
;
735 map_addr
= VM_MIN_KERNEL_ADDRESS
;
736 (void) vm_map_enter(kernel_map
,
738 (vm_map_size_t
)(map_start
- VM_MIN_KERNEL_ADDRESS
),
740 VM_FLAGS_ANYWHERE
| VM_FLAGS_NO_PMAP_CHECK
,
742 (vm_object_offset_t
) 0, FALSE
,
743 VM_PROT_DEFAULT
, VM_PROT_ALL
,
748 * Account for kernel memory (text, data, bss, vm shenanigans).
749 * This may include inaccessible "holes" as determined by what
750 * the machine-dependent init code includes in max_mem.
752 vm_page_wire_count
= (atop_64(max_mem
) - (vm_page_free_count
753 + vm_page_active_count
754 + vm_page_inactive_count
));
761 * Like copyin, except that fromaddr is an address
762 * in the specified VM map. This implementation
763 * is incomplete; it handles the current user map
764 * and the kernel map/submaps.
769 vm_map_offset_t fromaddr
,
773 kern_return_t kr
= KERN_SUCCESS
;
776 if (vm_map_pmap(map
) == pmap_kernel())
778 /* assume a correct copy */
779 memcpy(todata
, CAST_DOWN(void *, fromaddr
), length
);
781 else if (current_map() == map
)
783 if (copyin(fromaddr
, todata
, length
) != 0)
784 kr
= KERN_INVALID_ADDRESS
;
788 vm_map_reference(map
);
789 oldmap
= vm_map_switch(map
);
790 if (copyin(fromaddr
, todata
, length
) != 0)
791 kr
= KERN_INVALID_ADDRESS
;
792 vm_map_switch(oldmap
);
793 vm_map_deallocate(map
);
799 * Routine: copyoutmap
801 * Like copyout, except that toaddr is an address
802 * in the specified VM map. This implementation
803 * is incomplete; it handles the current user map
804 * and the kernel map/submaps.
810 vm_map_address_t toaddr
,
813 if (vm_map_pmap(map
) == pmap_kernel()) {
814 /* assume a correct copy */
815 memcpy(CAST_DOWN(void *, toaddr
), fromdata
, length
);
819 if (current_map() != map
)
820 return KERN_NOT_SUPPORTED
;
822 if (copyout(fromdata
, toaddr
, length
) != 0)
823 return KERN_INVALID_ADDRESS
;
834 memory_object_t pager
,
835 vm_object_offset_t file_off
)
837 vm_map_entry_t entry
;
839 vm_object_offset_t obj_off
;
841 vm_map_offset_t base_offset
;
842 vm_map_offset_t original_offset
;
844 vm_map_size_t local_len
;
848 original_offset
= off
;
851 while(vm_map_lookup_entry(map
, off
, &entry
)) {
854 if (entry
->object
.vm_object
== VM_OBJECT_NULL
) {
858 if (entry
->is_sub_map
) {
862 vm_map_lock(entry
->object
.sub_map
);
863 map
= entry
->object
.sub_map
;
864 off
= entry
->offset
+ (off
- entry
->vme_start
);
865 vm_map_unlock(old_map
);
868 obj
= entry
->object
.vm_object
;
869 obj_off
= (off
- entry
->vme_start
) + entry
->offset
;
871 obj_off
+= obj
->shadow_offset
;
874 if((obj
->pager_created
) && (obj
->pager
== pager
)) {
875 if(((obj
->paging_offset
) + obj_off
) == file_off
) {
876 if(off
!= base_offset
) {
880 kr
= KERN_ALREADY_WAITING
;
882 vm_object_offset_t obj_off_aligned
;
883 vm_object_offset_t file_off_aligned
;
885 obj_off_aligned
= obj_off
& ~PAGE_MASK
;
886 file_off_aligned
= file_off
& ~PAGE_MASK
;
888 if (file_off_aligned
== (obj
->paging_offset
+ obj_off_aligned
)) {
890 * the target map and the file offset start in the same page
891 * but are not identical...
896 if ((file_off
< (obj
->paging_offset
+ obj_off_aligned
)) &&
897 ((file_off
+ len
) > (obj
->paging_offset
+ obj_off_aligned
))) {
899 * some portion of the tail of the I/O will fall
900 * within the encompass of the target map
905 if ((file_off_aligned
> (obj
->paging_offset
+ obj_off
)) &&
906 (file_off_aligned
< (obj
->paging_offset
+ obj_off
) + len
)) {
908 * the beginning page of the file offset falls within
909 * the target map's encompass
915 } else if(kr
!= KERN_SUCCESS
) {
920 if(len
<= ((entry
->vme_end
- entry
->vme_start
) -
921 (off
- entry
->vme_start
))) {
925 len
-= (entry
->vme_end
- entry
->vme_start
) -
926 (off
- entry
->vme_start
);
928 base_offset
= base_offset
+ (local_len
- len
);
929 file_off
= file_off
+ (local_len
- len
);
931 if(map
!= base_map
) {
933 vm_map_lock(base_map
);