vm_map_entry
struct vm_map_entry vme;
struct vm_map_entry *ent;
struct vm_map_entry *entry = ufi->entry;
struct vm_map_entry *entry;
struct vm_map_entry *entry;
struct vm_map_entry *entry;
amap_cow_now(struct vm_map *map, struct vm_map_entry *entry)
amap_extend(struct vm_map_entry *entry, vsize_t addsize, int flags)
amap_share_protect(struct vm_map_entry *entry, vm_prot_t prot)
amap_copy(struct vm_map *map, struct vm_map_entry *entry, int flags,
(struct vm_map *, struct vm_map_entry *, int,
(struct vm_map *, struct vm_map_entry *);
(struct vm_map_entry *, vsize_t, int);
(struct vm_map_entry *, vm_prot_t);
struct vm_map_entry *entry;
struct vm_map_entry *entry = ufi->entry;
struct vm_map_entry;
struct vm_map_entry *entry, *oentry;
struct vm_map_entry *entry; /* map entry (from 'map') */
struct vm_map_entry *dead_entries;
static struct vm_map_entry kernel_image_mapent_store;
static struct vm_map_entry kernel_kmem_mapent_store;
uvm_map_clip_end(struct vm_map *map, struct vm_map_entry *entry, vaddr_t end)
struct vm_map_entry *new_entry;
struct vm_map_entry *new_entry;
struct vm_map_entry *prev_entry;
struct vm_map_entry *new_entry)
struct vm_map_entry *prev_entry = args->uma_prev;
struct vm_map_entry *dead = NULL, *dead_entries = NULL;
struct vm_map_entry *tmp_entry __diagused;
struct vm_map_entry **entry /* OUT */)
struct vm_map_entry *prev = &map->header;
struct vm_map_entry *cur = ROOT_ENTRY(map);
struct vm_map_entry **entry /* OUT */)
struct vm_map_entry *cur;
vsize_t align, int flags, int topdown, struct vm_map_entry *entry)
vaddr_t hint, struct vm_map_entry *entry, int line)
struct vm_map_entry *
struct vm_map_entry *entry = NULL;
struct vm_map_entry *child, *prev, *tmp;
struct vm_map_entry **entry_list /* OUT */, int flags)
struct vm_map_entry *entry, *first_entry, *next;
uvm_unmap_detach(struct vm_map_entry *first_entry, int flags)
struct vm_map_entry *next_entry;
clear_hints(struct vm_map *map, struct vm_map_entry *ent)
struct vm_map_entry *newents, int nnewents, vsize_t nsize,
struct vm_map_entry **oldentryp)
struct vm_map_entry *oldent, *last;
struct vm_map_entry *tmpent = newents;
struct vm_map_entry *tmp;
struct vm_map_entry *chain, *endchain, *entry, *orig_entry, *newentry,
struct vm_map_entry *resentry = NULL; /* a dummy reservation entry */
static struct vm_map_entry *
static void uvm_mapent_copy(struct vm_map_entry *, struct vm_map_entry *);
static void uvm_mapent_free(struct vm_map_entry *);
static void _uvm_mapent_check(const struct vm_map_entry *, int);
static void uvm_map_entry_unwire(struct vm_map *, struct vm_map_entry *);
static void uvm_map_reference_amap(struct vm_map_entry *, int);
int, struct vm_map_entry *);
static void uvm_map_unreference_amap(struct vm_map_entry *, int);
static vsize_t uvm_rb_maxgap(const struct vm_map_entry *);
struct vm_map_entry *entry;
__CTASSERT(offsetof(struct vm_map_entry, rb_node) == 0);
((struct vm_map_entry *)(map)->rb_tree.rbt_root)
struct vm_map_entry *current, *entry;
((struct vm_map_entry *)(entry)->rb_node.rb_left)
((struct vm_map_entry *)(entry)->rb_node.rb_right)
? NULL : (struct vm_map_entry *)RB_FATHER(&(entry)->rb_node))
struct vm_map_entry *entry, *temp_entry;
struct vm_map_entry *entry, *temp_entry;
const struct vm_map_entry *eparent = nparent;
const struct vm_map_entry *ekey = nkey;
struct vm_map_entry *entry;
struct vm_map_entry *entry, *start_entry, *failed_entry;
const struct vm_map_entry *eparent = nparent;
.rbto_node_offset = offsetof(struct vm_map_entry, rb_node),
struct vm_map_entry *entry, *failed_entry;
uvm_rb_gap(const struct vm_map_entry *entry)
uvm_rb_maxgap(const struct vm_map_entry *entry)
struct vm_map_entry *child;
struct vm_map_entry *current, *entry;
uvm_rb_fixup(struct vm_map *map, struct vm_map_entry *entry)
struct vm_map_entry *parent;
struct vm_map_entry *brother;
struct vm_map_entry *entry;
struct vm_map_entry *tmp_entry;
brother = (struct vm_map_entry *)parent->rb_node.rb_nodes[which];
struct vm_map_entry *dead_entries;
uvm_rb_insert(struct vm_map *map, struct vm_map_entry *entry)
struct vm_map_entry *ret __diagused;
static struct vm_map_entry *
uvm_mapent_clone(struct vm_map *new_map, struct vm_map_entry *old_entry,
struct vm_map_entry *new_entry;
struct vm_map_entry *old_entry)
struct vm_map_entry *old_entry)
struct vm_map_entry *new_entry;
struct vm_map_entry *old_entry)
struct vm_map_entry *new_entry;
uvm_rb_remove(struct vm_map *map, struct vm_map_entry *entry)
struct vm_map_entry *old_entry;
struct vm_map_entry *prev_parent = NULL, *next_parent = NULL;
uvm_mapent_trymerge(struct vm_map *map, struct vm_map_entry *entry, int flags)
struct vm_map_entry *next;
struct vm_map_entry *prev;
struct vm_map_entry *dead_entries;
uvm_map_lock_entry(struct vm_map_entry *entry, krw_t op)
uvm_map_unlock_entry(struct vm_map_entry *entry)
struct vm_map_entry *entry;
struct vm_map_entry *entry;
struct vm_map_entry *entry;
struct vm_map *m, struct vm_map_entry *e)
const struct vm_map_entry *e;
struct vm_map_entry *hint = map->hint;
struct vm_map_entry *entry;
struct vm_map_entry *tmp, *trtmp;
static struct vm_map_entry *
struct vm_map_entry *me;
uvm_mapent_free(struct vm_map_entry *me)
uvm_mapent_copy(struct vm_map_entry *src, struct vm_map_entry *dst)
_uvm_mapent_check(const struct vm_map_entry *entry, int line)
uvm_map_entry_unwire(struct vm_map *map, struct vm_map_entry *entry)
uvm_map_reference_amap(struct vm_map_entry *entry, int flags)
uvm_map_unreference_amap(struct vm_map_entry *entry, int flags)
pool_cache_bootstrap(&uvm_map_entry_cache, sizeof(struct vm_map_entry),
uvm_mapent_splitadj(struct vm_map_entry *entry1, struct vm_map_entry *entry2,
uvm_map_clip_start(struct vm_map *map, struct vm_map_entry *entry,
struct vm_map_entry *new_entry;
struct vm_map_entry *prev; /* previous entry */
struct vm_map_entry *next; /* next entry */
struct vm_map_entry header; /* List of entries */
struct vm_map_entry * hint; /* hint for quick lookups */
struct vm_map_entry * first_free; /* First free space hint */
struct vm_map_entry *uma_prev;
void uvm_map_clip_start(struct vm_map *, struct vm_map_entry *,
void uvm_map_clip_end(struct vm_map *, struct vm_map_entry *,
struct vm_map_entry *
struct vm_map_entry **);
void uvm_unmap_detach(struct vm_map_entry *,int);
struct vm_map_entry **, int);
struct vm_map_entry *);
struct vm_map_entry *, int);
void uvm_map_lock_entry(struct vm_map_entry *, krw_t);
void uvm_map_unlock_entry(struct vm_map_entry *);
struct vm_map_entry * entry;
struct vm_map_entry *entry;
struct vm_map_entry *entry;
struct vm_map_entry *dead_entries;
struct vm_map_entry *entry;
struct vm_map_entry *reserved_entry;
struct vm_map_entry *entries;
vm_map_entry = &kbit[1];
A(vm_map_entry) = 0;
S(header) = sizeof(struct vm_map_entry);
memcpy(D(header, vm_map_entry), &D(vm_map, vm_map)->header, S(header));
vm_map, vm_map_entry);
header, vm_map_entry);
struct kbit *vmspace, struct kbit *vm_map_entry,
struct vm_map_entry *node)
struct vm_map_entry *left, *right;
A(vm_map_entry) = addr;
S(vm_map_entry) = sizeof(struct vm_map_entry);
KDEREF(kd, vm_map_entry);
left = (struct vm_map_entry *)D(vm_map_entry, vm_map_entry)->rb_node.rb_left;
right = (struct vm_map_entry *)D(vm_map_entry, vm_map_entry)->rb_node.rb_right;
total += dump_vm_map_entry(kd, proc, vmspace, vm_map_entry, 0);
total += dump_vm_map_node(kd, lvl+1, proc, vmspace, vm_map_entry, left);
total += dump_vm_map_node(kd, lvl+1, proc, vmspace, vm_map_entry, right);
struct kbit *vmspace, struct kbit *vm_map, struct kbit *vm_map_entry)
struct vm_map_entry *root;
root = (struct vm_map_entry *)D(vm_map, vm_map)->rb_tree.rbt_root;
A(vm_map_entry) = addr;
S(vm_map_entry) = sizeof(struct vm_map_entry);
KDEREF(kd, vm_map_entry);
return dump_vm_map_node(kd, 0, proc, vmspace, vm_map_entry, root);
struct kbit *vmspace, struct kbit *header, struct kbit *vm_map_entry)
struct vm_map_entry *last, *next;
next = D(header, vm_map_entry)->next;
A(vm_map_entry) = addr;
S(vm_map_entry) = sizeof(struct vm_map_entry);
KDEREF(kd, vm_map_entry);
next = D(vm_map_entry, vm_map_entry)->next;
end = D(vm_map_entry, vm_map_entry)->start;
end != D(vm_map_entry, vm_map_entry)->start)
(D(vm_map_entry, vm_map_entry)->start - end) /
(D(vm_map_entry, vm_map_entry)->start - end) /
total += dump_vm_map_entry(kd, proc, vmspace, vm_map_entry, 0);
end = D(vm_map_entry, vm_map_entry)->end;
struct kbit *vm_map_entry, int ishead)
struct vm_map_entry *vme;
if (S(vm_map_entry) == (size_t)-1) {
S(vm_map_entry) = sizeof(struct vm_map_entry);
KDEREF(kd, vm_map_entry);
vme = D(vm_map_entry, vm_map_entry);
P(vm_map_entry));
name = findname(kd, vmspace, vm_map_entry, vp, vfs, uvm_obj);
P(vm_map_entry), vme->start, vme->end,
struct kbit *vm_map_entry, struct kbit *vp,
struct vm_map_entry *vme;
vme = D(vm_map_entry, vm_map_entry);
struct kbit kbit[2], *header, *vm_map_entry;
struct vm_map_entry vm_map_entry;
struct kbit *, struct kbit *, struct vm_map_entry *);