439 	struct rb_node **parent)  in find_va_links()  argument
447 			*parent = NULL;  in find_va_links()
477 	*parent = &tmp_va->rb_node;  in find_va_links()
482 get_va_next_sibling(struct rb_node *parent, struct rb_node **link)  in get_va_next_sibling()  argument
486 	if (unlikely(!parent))  in get_va_next_sibling()
495 	list = &rb_entry(parent, struct vmap_area, rb_node)->list;  in get_va_next_sibling()
496 	return (&parent->rb_right == link ? list->next : list);  in get_va_next_sibling()
501 	struct rb_node *parent, struct rb_node **link, struct list_head *head)  in link_va()  argument
507 	if (likely(parent)) {  in link_va()
508 		head = &rb_entry(parent, struct vmap_area, rb_node)->list;  in link_va()
509 		if (&parent->rb_right != link)  in link_va()
514 	rb_link_node(&va->rb_node, parent, link);  in link_va()
656 	struct rb_node *parent;  in insert_vmap_area()  local
658 	link = find_va_links(va, root, NULL, &parent);  in insert_vmap_area()
659 	link_va(va, root, parent, link, head);  in insert_vmap_area()
668 	struct rb_node *parent;  in insert_vmap_area_augment()  local
671 		link = find_va_links(va, NULL, from, &parent);  in insert_vmap_area_augment()
673 		link = find_va_links(va, root, NULL, &parent);  in insert_vmap_area_augment()
675 	link_va(va, root, parent, link, head);  in insert_vmap_area_augment()
692 	struct rb_node *parent;  in merge_or_add_vmap_area()  local
699 	link = find_va_links(va, root, NULL, &parent);  in merge_or_add_vmap_area()
704 	next = get_va_next_sibling(parent, link);  in merge_or_add_vmap_area()
758 		link_va(va, root, parent, link, head);  in merge_or_add_vmap_area()