2 * netifd - network interface daemon
3 * Copyright (C) 2012 Felix Fietkau <nbd@openwrt.org>
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License version 2
7 * as published by the Free Software Foundation
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
19 vlist_init(struct vlist_tree *tree, avl_tree_comp cmp, vlist_update_cb update)
21 tree->update = update;
24 avl_init(&tree->avl, cmp, 0, tree);
28 vlist_delete(struct vlist_tree *tree, struct vlist_node *node)
31 avl_delete(&tree->avl, &node->avl);
32 tree->update(tree, NULL, node);
36 vlist_add(struct vlist_tree *tree, struct vlist_node *node, void *key)
38 struct vlist_node *old_node = NULL;
39 struct avl_node *anode;
42 node->version = tree->version;
44 anode = avl_find(&tree->avl, key);
46 old_node = container_of(anode, struct vlist_node, avl);
47 if (tree->keep_old || tree->no_delete) {
48 old_node->version = tree->version;
52 avl_delete(&tree->avl, anode);
55 avl_insert(&tree->avl, &node->avl);
58 tree->update(tree, node, old_node);
62 vlist_flush(struct vlist_tree *tree)
64 struct vlist_node *node, *tmp;
66 avl_for_each_element_safe(&tree->avl, node, avl, tmp) {
67 if ((node->version == tree->version || node->version == -1) &&
71 vlist_delete(tree, node);
76 vlist_flush_all(struct vlist_tree *tree)
84 __vlist_simple_init(struct vlist_simple_tree *tree, int offset)
86 INIT_LIST_HEAD(&tree->list);
88 tree->head_offset = offset;
92 vlist_simple_delete(struct vlist_simple_tree *tree, struct vlist_simple_node *node)
96 list_del(&node->list);
97 ptr = (char *) node - tree->head_offset;
102 vlist_simple_flush(struct vlist_simple_tree *tree)
104 struct vlist_simple_node *n, *tmp;
106 list_for_each_entry_safe(n, tmp, &tree->list, list) {
107 if ((n->version == tree->version || n->version == -1) &&
111 vlist_simple_delete(tree, n);
116 vlist_simple_replace(struct vlist_simple_tree *dest, struct vlist_simple_tree *old)
118 struct vlist_simple_node *n, *tmp;
120 vlist_simple_update(dest);
121 list_for_each_entry_safe(n, tmp, &old->list, list) {
123 vlist_simple_add(dest, n);
125 vlist_simple_flush(dest);
129 vlist_simple_flush_all(struct vlist_simple_tree *tree)
132 vlist_simple_flush(tree);