vmap_area
struct vmap_area *find_vmap_area(unsigned long addr);
struct vmap_area *area = find_vmap_area(addr);
va_size(struct vmap_area *va)
struct vmap_area *va;
va = rb_entry_safe(node, struct vmap_area, rb_node);
struct vmap_area, rb_node, unsigned long, subtree_max_size, va_size)
static struct vmap_area *__find_vmap_area(unsigned long addr, struct rb_root *root)
struct vmap_area *va;
va = rb_entry(n, struct vmap_area, rb_node);
static struct vmap_area *
struct vmap_area *va = NULL;
struct vmap_area *tmp;
tmp = rb_entry(n, struct vmap_area, rb_node);
find_vmap_area_exceed_addr_lock(unsigned long addr, struct vmap_area **va)
find_va_links(struct vmap_area *va,
struct vmap_area *tmp_va;
tmp_va = rb_entry(*link, struct vmap_area, rb_node);
list = &rb_entry(parent, struct vmap_area, rb_node)->list;
__link_va(struct vmap_area *va, struct rb_root *root,
head = &rb_entry(parent, struct vmap_area, rb_node)->list;
link_va(struct vmap_area *va, struct rb_root *root,
link_va_augment(struct vmap_area *va, struct rb_root *root,
__unlink_va(struct vmap_area *va, struct rb_root *root, bool augment)
unlink_va(struct vmap_area *va, struct rb_root *root)
unlink_va_augment(struct vmap_area *va, struct rb_root *root)
compute_subtree_max_size(struct vmap_area *va)
struct vmap_area *va;
augment_tree_propagate_from(struct vmap_area *va)
insert_vmap_area(struct vmap_area *va,
insert_vmap_area_augment(struct vmap_area *va,
static __always_inline struct vmap_area *
__merge_or_add_vmap_area(struct vmap_area *va,
struct vmap_area *sibling;
sibling = list_entry(next, struct vmap_area, list);
sibling = list_entry(next->prev, struct vmap_area, list);
static __always_inline struct vmap_area *
merge_or_add_vmap_area(struct vmap_area *va,
static __always_inline struct vmap_area *
merge_or_add_vmap_area_augment(struct vmap_area *va,
is_within_this_va(struct vmap_area *va, unsigned long size,
static __always_inline struct vmap_area *
struct vmap_area *va;
va = rb_entry(node, struct vmap_area, rb_node);
va = rb_entry(node, struct vmap_area, rb_node);
static struct vmap_area *
struct vmap_area *va;
struct vmap_area *va_1, *va_2;
classify_va_fit_type(struct vmap_area *va,
struct vmap_area *va, unsigned long nva_start_addr,
struct vmap_area *lva = NULL;
va_alloc(struct vmap_area *va,
struct vmap_area *va;
static void free_vmap_area(struct vmap_area *va)
struct vmap_area *va = NULL, *tmp;
node_pool_add_va(struct vmap_node *n, struct vmap_area *va)
static struct vmap_area *
struct vmap_area *va = NULL;
va = list_first_entry(&vp->head, struct vmap_area, list);
static struct vmap_area *
struct vmap_area *va;
struct vmap_area *va, unsigned long flags, const void *caller)
static struct vmap_area *alloc_vmap_area(unsigned long size,
struct vmap_area *va;
struct vmap_area *va, *n;
struct vmap_area *va, *nva;
struct vmap_area *va;
start = list_first_entry(&vn->purge_list, struct vmap_area, list)->va_start;
end = list_last_entry(&vn->purge_list, struct vmap_area, list)->va_end;
struct vmap_area *va, *n_va;
struct vmap_area, list)->va_start);
struct vmap_area, list)->va_end);
static void free_vmap_area_noflush(struct vmap_area *va)
static void free_unmap_vmap_area(struct vmap_area *va)
struct vmap_area *find_vmap_area(unsigned long addr)
struct vmap_area *va;
static struct vmap_area *find_unlink_vmap_area(unsigned long addr)
struct vmap_area *va;
struct vmap_area *va;
struct vmap_area *va;
struct vmap_area *va;
struct vmap_area *va;
struct vmap_area *va;
struct vmap_area *va;
struct vmap_area *va;
struct vmap_area *va;
static struct vmap_area *node_to_va(struct rb_node *n)
return rb_entry_safe(n, struct vmap_area, rb_node);
static struct vmap_area *
struct vmap_area *va, *tmp;
tmp = rb_entry(n, struct vmap_area, rb_node);
pvm_determine_end_from_reverse(struct vmap_area **va, unsigned long align)
struct vmap_area **vas, *va;
struct vmap_area *va;
struct vmap_area *va;
struct vmap_area *va;
struct vmap_area *free;
struct vmap_area *va;
vmap_area_cachep = KMEM_CACHE(vmap_area, SLAB_PANIC);
static DEFINE_PER_CPU(struct vmap_area *, ne_fit_preload_node);