Lines Matching defs:map
32 first_free_is_valid_ll( vm_map_t map )
35 entry = vm_map_to_entry(map);
38 VM_MAP_PAGE_MASK(map)) ==
40 VM_MAP_PAGE_MASK(map)) ||
42 VM_MAP_PAGE_MASK(map)) ==
44 VM_MAP_PAGE_MASK(map)) &&
45 next != vm_map_to_entry(map))) {
48 if (entry == vm_map_to_entry(map))
51 if (map->first_free != entry) {
52 printf("Bad first_free for map %p: %p should be %p\n",
53 map, map->first_free, entry);
62 * Updates the map->first_free pointer to the
63 * entry immediately before the first hole in the map.
64 * The map should be locked.
66 #define UPDATE_FIRST_FREE_LL(map, new_first_free) \
68 if( map->disable_vmentry_reuse == FALSE){ \
72 UFF_map = (map); \
118 * Link a copy chain ("copy") into a map at the
125 #define _vm_map_copy_insert_ll(map, where, copy) \
130 VMCI_map = (map); \
151 * Use the linked list to find the map entry containing (or
153 * in the given map; the entry is returned
156 * actually contained in the map.
160 register vm_map_t map,
171 cur = map->hint;
173 if (cur == vm_map_to_entry(map))
188 last = vm_map_to_entry(map);
199 cur = vm_map_first_entry(map);
215 SAVE_HINT_MAP_READ(map, cur);
224 SAVE_HINT_MAP_READ(map, *entry);
242 vm_map_store_copy_insert_ll( vm_map_t map, vm_map_entry_t after_where, vm_map_copy_t copy)
244 _vm_map_copy_insert_ll( map, after_where, copy);
258 update_first_free_ll( vm_map_t map, vm_map_entry_t new_first_free)
260 UPDATE_FIRST_FREE_LL( map, new_first_free);