Lines Matching defs:entry
34 vm_map_entry_t entry, next;
35 entry = vm_map_to_entry(map);
36 next = entry->vme_next;
39 vm_map_trunc_page(entry->vme_end,
43 vm_map_trunc_page(entry->vme_start,
46 entry = next;
47 next = entry->vme_next;
48 if (entry == vm_map_to_entry(map))
51 if (map->first_free != entry) {
53 map, map->first_free, entry);
63 * entry immediately before the first hole in the map.
94 #define _vm_map_entry_link_ll(hdr, after_where, entry) \
96 if (entry->map_aligned) { \
97 assert(VM_MAP_PAGE_ALIGNED((entry->vme_start), \
99 assert(VM_MAP_PAGE_ALIGNED((entry->vme_end), \
103 (entry)->vme_prev = (after_where); \
104 (entry)->vme_next = (after_where)->vme_next; \
105 (entry)->vme_prev->vme_next = (entry)->vme_next->vme_prev = (entry); \
108 #define _vm_map_entry_unlink_ll(hdr, entry) \
111 (entry)->vme_next->vme_prev = (entry)->vme_prev; \
112 (entry)->vme_prev->vme_next = (entry)->vme_next; \
151 * Use the linked list to find the map entry containing (or
153 * in the given map; the entry is returned
154 * in the "entry" parameter. The boolean
162 vm_map_entry_t *entry) /* OUT */
181 * we are already looking at the entry we
190 *entry = cur;
214 *entry = cur;
223 *entry = cur->vme_prev;
224 SAVE_HINT_MAP_READ(map, *entry);
230 vm_map_store_entry_link_ll( struct vm_map_header *mapHdr, vm_map_entry_t after_where, vm_map_entry_t entry)
232 _vm_map_entry_link_ll( mapHdr, after_where, entry);
236 vm_map_store_entry_unlink_ll( struct vm_map_header *mapHdr, vm_map_entry_t entry)
238 _vm_map_entry_unlink_ll( mapHdr, entry);
248 vm_map_store_copy_reset_ll( vm_map_copy_t copy, __unused vm_map_entry_t entry, __unused int nentries)