void
avl_init(struct avl_tree *tree, avl_tree_comp comp, bool allow_dups, void *ptr)
{
- list_init_head(&tree->list_head);
+ INIT_LIST_HEAD(&tree->list_head);
tree->root = NULL;
tree->count = 0;
tree->comp = comp;
#define avl_remove_all_elements(tree, element, node_member, ptr) \
for (element = avl_first_element(tree, element, node_member), \
ptr = avl_next_element(element, node_member), \
- list_init_head(&(tree)->list_head), \
+ INIT_LIST_HEAD(&(tree)->list_head), \
(tree)->root = NULL; \
(tree)->count > 0; \
element = ptr, ptr = avl_next_element(ptr, node_member), (tree)->count--)
#ifndef __LIST_COMPAT_H
#define __LIST_COMPAT_H
-#define list_init_head(_list) INIT_LIST_HEAD(_list)
#define list_add_head(_head, _list) list_add(_list, _head)
#define list_add_after(_after, _list) list_add(_list, _after)
#define list_add_before(_before, _list) list_add_tail(_list, _before)