93 |
#define vm_map_entry_first(map) \ |
#define vm_map_entry_first(map) \ |
94 |
(queue_empty (&(map)->entries) \ |
(queue_empty (&(map)->entries) \ |
95 |
? 0 \ |
? 0 \ |
96 |
: (struct vm_map_entry *) queue_first (&(map)->entries)); |
: (struct vm_map_entry *) queue_first (&(map)->entries)) |
97 |
#define vm_map_entry_next(map, ent) \ |
#define vm_map_entry_next(map, ent) \ |
98 |
(queue_end (&(map)->entries, queue_next (&(ent)->link)) \ |
(queue_end (&(map)->entries, queue_next (&(ent)->link)) \ |
99 |
? 0 \ |
? 0 \ |
424 |
new_entry->max_protection = max_protection; |
new_entry->max_protection = max_protection; |
425 |
new_entry->protection = protection; |
new_entry->protection = protection; |
426 |
new_entry->inherit = inherit; |
new_entry->inherit = inherit; |
427 |
|
new_entry->submap_p = false; |
428 |
|
|
429 |
/* Insert entry in list. */ |
/* Insert entry in list. */ |
430 |
new_entry->link.prev = (struct queue_entry *) search_entry; |
new_entry->link.prev = (struct queue_entry *) search_entry; |
512 |
new_entry->max_protection = max_protection; |
new_entry->max_protection = max_protection; |
513 |
new_entry->protection = protection; |
new_entry->protection = protection; |
514 |
new_entry->inherit = inherit; |
new_entry->inherit = inherit; |
515 |
|
new_entry->submap_p = false; |
516 |
|
|
517 |
if (! search_entry) |
if (! search_entry) |
518 |
search_entry = (struct vm_map_entry *) &map->entries; |
search_entry = (struct vm_map_entry *) &map->entries; |