a67a8c9d5d8dbec47e718260baba07d2008c63ad
5 avl_strcmp(const void *k1
, const void *k2
, void *ptr
)
11 __vlist_init(struct vlist_tree
*tree
, avl_tree_comp cmp
,
12 vlist_update_cb update
, int offset
)
14 tree
->node_offset
= offset
;
15 tree
->update
= update
;
18 avl_init(&tree
->avl
, cmp
, 0, tree
);
22 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
)
31 struct vlist_node
*old_node
= NULL
;
32 struct avl_node
*anode
;
33 void *key
= (char *) node
- tree
->node_offset
;
36 node
->version
= tree
->version
;
38 anode
= avl_find(&tree
->avl
, key
);
43 old_node
= container_of(anode
, struct vlist_node
, avl
);
44 avl_delete(&tree
->avl
, anode
);
47 avl_insert(&tree
->avl
, &node
->avl
);
50 tree
->update(tree
, node
, old_node
);
54 vlist_flush(struct vlist_tree
*tree
)
56 struct vlist_node
*node
, *tmp
;
58 avl_for_each_element_safe(&tree
->avl
, node
, avl
, tmp
) {
59 if (node
->version
== tree
->version
)
62 vlist_delete(tree
, node
);
67 vlist_flush_all(struct vlist_tree
*tree
)