45 	struct llist_head list;  member
57 	llist_for_each_safe(llnode, t, llist_del_all(&p->list))  in free_work()
484 	struct list_head *list;  in get_va_next_sibling()  local
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()
508 		head = &rb_entry(parent, struct vmap_area, rb_node)->list;  in link_va()
535 	list_add(&va->list, head);  in link_va()
550 	list_del(&va->list);  in unlink_va()
716 		sibling = list_entry(next, struct vmap_area, list);  in merge_or_add_vmap_area()
740 		sibling = list_entry(next->prev, struct vmap_area, list);  in merge_or_add_vmap_area()
852 	list_for_each_entry(va, &free_vmap_area_list, list) {  in find_vmap_lowest_linear_match()
1871 	list_for_each_entry(busy, &vmap_area_list, list) {  in vmap_init_free_space()
1919 		init_llist_head(&p->list);  in vmalloc_init()
2278 	if (llist_add((struct llist_node *)addr, &p->list))  in __vfree_deferred()
2858 	list_for_each_entry(va, &vmap_area_list, list) {  in vread()
2938 	list_for_each_entry(va, &vmap_area_list, list) {  in vwrite()
3178 				&free_vmap_area_list, list) {  in pvm_determine_end_from_reverse()
3482 	va = list_entry(p, struct vmap_area, list);  in s_show()
3537 	if (list_is_last(&va->list, &vmap_area_list))  in s_show()