6 avl_strcmp(const void *k1, const void *k2, void *ptr)
12 vlist_init(struct vlist_tree *tree, avl_tree_comp cmp, vlist_update_cb update)
14 tree->update = update;
17 avl_init(&tree->avl, cmp, 0, tree);
21 vlist_delete(struct vlist_tree *tree, struct vlist_node *node)
24 avl_delete(&tree->avl, &node->avl);
25 tree->update(tree, NULL, node);
29 vlist_add(struct vlist_tree *tree, struct vlist_node *node, void *key)
31 struct vlist_node *old_node = NULL;
32 struct avl_node *anode;
35 node->version = tree->version;
37 anode = avl_find(&tree->avl, key);
39 old_node = container_of(anode, struct vlist_node, avl);
40 if (tree->keep_old || tree->no_delete) {
41 old_node->version = tree->version;
45 avl_delete(&tree->avl, anode);
48 avl_insert(&tree->avl, &node->avl);
51 tree->update(tree, node, old_node);
55 vlist_flush(struct vlist_tree *tree)
57 struct vlist_node *node, *tmp;
59 avl_for_each_element_safe(&tree->avl, node, avl, tmp) {
60 if ((node->version == tree->version || node->version == -1) &&
64 vlist_delete(tree, node);
69 vlist_flush_all(struct vlist_tree *tree)
77 __vlist_simple_init(struct vlist_simple_tree *tree, int offset)
79 INIT_LIST_HEAD(&tree->list);
81 tree->head_offset = offset;
85 vlist_simple_delete(struct vlist_simple_tree *tree, struct vlist_simple_node *node)
89 list_del(&node->list);
90 ptr = (char *) node - tree->head_offset;
95 vlist_simple_flush(struct vlist_simple_tree *tree)
97 struct vlist_simple_node *n, *tmp;
99 list_for_each_entry_safe(n, tmp, &tree->list, list) {
100 if ((n->version == tree->version || n->version == -1) &&
104 vlist_simple_delete(tree, n);
109 vlist_simple_flush_all(struct vlist_simple_tree *tree)
112 vlist_simple_flush(tree);