2 * Copyright (c) 2009 Apple 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@
29 #include <vm/vm_map_store.h>
33 first_free_is_valid_store( vm_map_t map
)
35 return(first_free_is_valid_ll( map
));
40 vm_map_store_init( struct vm_map_header
*hdr
)
42 vm_map_store_init_ll( hdr
);
43 #ifdef VM_MAP_STORE_USE_RB
44 vm_map_store_init_rb( hdr
);
49 vm_map_store_lookup_entry(
50 register vm_map_t map
,
51 register vm_map_offset_t address
,
52 vm_map_entry_t
*entry
) /* OUT */
54 #ifdef VM_MAP_STORE_USE_LL
55 return (vm_map_store_lookup_entry_ll( map
, address
, entry
));
56 #elif defined VM_MAP_STORE_USE_RB
57 return (vm_map_store_lookup_entry_rb( map
, address
, entry
));
62 vm_map_store_update( vm_map_t map
, vm_map_entry_t entry
, int update_type
)
64 switch (update_type
) {
65 case VM_MAP_ENTRY_CREATE
:
67 case VM_MAP_ENTRY_DELETE
:
68 if((entry
) == (map
)->first_free
) {
69 (map
)->first_free
= vm_map_to_entry(map
);
71 if((entry
) == (map
)->hint
) {
72 (map
)->hint
= vm_map_to_entry(map
);
80 void vm_map_store_copy_insert( vm_map_t map
, vm_map_entry_t after_where
, vm_map_copy_t copy
)
82 vm_map_store_copy_insert_ll(map
, after_where
, copy
);
83 #ifdef VM_MAP_STORE_USE_RB
84 vm_map_store_copy_insert_rb(map
, after_where
, copy
);
89 * vm_map_entry_{un,}link:
91 * Insert/remove entries from maps (or map copies).
92 * The _vm_map_store_entry_{un,}link variants are used at
93 * some places where updating first_free is not needed &
94 * copy maps are being modified. Also note the first argument
96 * Modifying the vm_map_store_entry_{un,}link functions to
97 * deal with these call sites made the interface confusing
102 _vm_map_store_entry_link( struct vm_map_header
* mapHdr
, vm_map_entry_t after_where
, vm_map_entry_t entry
)
104 assert(entry
->vme_start
< entry
->vme_end
);
105 vm_map_store_entry_link_ll(mapHdr
, after_where
, entry
);
106 #ifdef VM_MAP_STORE_USE_RB
107 vm_map_store_entry_link_rb(mapHdr
, after_where
, entry
);
109 #if MAP_ENTRY_INSERTION_DEBUG
110 fastbacktrace(&entry
->vme_insertion_bt
[0],
111 (sizeof (entry
->vme_insertion_bt
) / sizeof (uintptr_t)));
116 vm_map_store_entry_link( vm_map_t map
, vm_map_entry_t after_where
, vm_map_entry_t entry
)
119 vm_map_entry_t VMEL_entry
;
121 VMEL_entry
= (entry
);
123 _vm_map_store_entry_link(&VMEL_map
->hdr
, after_where
, VMEL_entry
);
124 if( VMEL_map
->disable_vmentry_reuse
== TRUE
) {
125 UPDATE_HIGHEST_ENTRY_END( VMEL_map
, VMEL_entry
);
127 update_first_free_ll(VMEL_map
, VMEL_map
->first_free
);
128 #ifdef VM_MAP_STORE_USE_RB
129 update_first_free_rb(VMEL_map
, VMEL_map
->first_free
);
135 _vm_map_store_entry_unlink( struct vm_map_header
* mapHdr
, vm_map_entry_t entry
)
137 vm_map_store_entry_unlink_ll(mapHdr
, entry
);
138 #ifdef VM_MAP_STORE_USE_RB
139 vm_map_store_entry_unlink_rb(mapHdr
, entry
);
144 vm_map_store_entry_unlink( vm_map_t map
, vm_map_entry_t entry
)
147 vm_map_entry_t VMEU_entry
;
148 vm_map_entry_t VMEU_first_free
;
150 VMEU_entry
= (entry
);
151 if (VMEU_entry
->vme_start
<= VMEU_map
->first_free
->vme_start
){
152 VMEU_first_free
= VMEU_entry
->vme_prev
;
154 VMEU_first_free
= VMEU_map
->first_free
;
157 _vm_map_store_entry_unlink(&VMEU_map
->hdr
, VMEU_entry
);
158 vm_map_store_update( map
, entry
, VM_MAP_ENTRY_DELETE
);
159 update_first_free_ll(VMEU_map
, VMEU_first_free
);
160 #ifdef VM_MAP_STORE_USE_RB
161 update_first_free_rb(VMEU_map
, VMEU_first_free
);
166 vm_map_store_copy_reset( vm_map_copy_t copy
,vm_map_entry_t entry
)
168 int nentries
= copy
->cpy_hdr
.nentries
;
169 vm_map_store_copy_reset_ll(copy
, entry
, nentries
);
170 #ifdef VM_MAP_STORE_USE_RB
171 vm_map_store_copy_reset_rb(copy
, entry
, nentries
);
176 vm_map_store_update_first_free( vm_map_t map
, vm_map_entry_t first_free
)
178 update_first_free_ll(map
, first_free
);
179 #ifdef VM_MAP_STORE_USE_RB
180 update_first_free_rb(map
, first_free
);