extend vlist code to allow keeping the old data structure instead of the new one...
[project/netifd.git] / utils.c
1 #include <string.h>
2 #include "utils.h"
3
4 int
5 avl_strcmp(const void *k1, const void *k2, void *ptr)
6 {
7 return strcmp(k1, k2);
8 }
9
10 void
11 __vlist_init(struct vlist_tree *tree, avl_tree_comp cmp,
12 vlist_update_cb update, int offset)
13 {
14 tree->node_offset = offset;
15 tree->update = update;
16 tree->version = 1;
17
18 avl_init(&tree->avl, cmp, 0, tree);
19 }
20
21 void
22 vlist_delete(struct vlist_tree *tree, struct vlist_node *node)
23 {
24 avl_delete(&tree->avl, &node->avl);
25 tree->update(tree, NULL, node);
26 }
27
28 void
29 vlist_add(struct vlist_tree *tree, struct vlist_node *node)
30 {
31 struct vlist_node *old_node = NULL;
32 struct avl_node *anode;
33 void *key = (char *) node - tree->node_offset;
34
35 node->avl.key = key;
36 node->version = tree->version;
37
38 anode = avl_find(&tree->avl, key);
39 if (anode) {
40 if (tree->keep_old)
41 goto update_only;
42
43 old_node = container_of(anode, struct vlist_node, avl);
44 avl_delete(&tree->avl, anode);
45 }
46
47 avl_insert(&tree->avl, &node->avl);
48
49 update_only:
50 tree->update(tree, node, old_node);
51 }
52
53 void
54 vlist_flush(struct vlist_tree *tree)
55 {
56 struct vlist_node *node, *tmp;
57
58 avl_for_each_element_safe(&tree->avl, node, avl, tmp) {
59 if (node->version == tree->version)
60 continue;
61
62 vlist_delete(tree, node);
63 }
64 }
65
66 void
67 vlist_flush_all(struct vlist_tree *tree)
68 {
69 tree->version++;
70 vlist_flush(tree);
71 }