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 avl_strcmp(const void *k1, const void *k2, void *ptr)
21 return strcmp(k1, k2);
25 vlist_init(struct vlist_tree *tree, avl_tree_comp cmp, vlist_update_cb update)
27 tree->update = update;
30 avl_init(&tree->avl, cmp, 0, tree);
34 vlist_delete(struct vlist_tree *tree, struct vlist_node *node)
37 avl_delete(&tree->avl, &node->avl);
38 tree->update(tree, NULL, node);
42 vlist_add(struct vlist_tree *tree, struct vlist_node *node, void *key)
44 struct vlist_node *old_node = NULL;
45 struct avl_node *anode;
48 node->version = tree->version;
50 anode = avl_find(&tree->avl, key);
52 old_node = container_of(anode, struct vlist_node, avl);
53 if (tree->keep_old || tree->no_delete) {
54 old_node->version = tree->version;
58 avl_delete(&tree->avl, anode);
61 avl_insert(&tree->avl, &node->avl);
64 tree->update(tree, node, old_node);
68 vlist_flush(struct vlist_tree *tree)
70 struct vlist_node *node, *tmp;
72 avl_for_each_element_safe(&tree->avl, node, avl, tmp) {
73 if ((node->version == tree->version || node->version == -1) &&
77 vlist_delete(tree, node);
82 vlist_flush_all(struct vlist_tree *tree)
90 __vlist_simple_init(struct vlist_simple_tree *tree, int offset)
92 INIT_LIST_HEAD(&tree->list);
94 tree->head_offset = offset;
98 vlist_simple_delete(struct vlist_simple_tree *tree, struct vlist_simple_node *node)
102 list_del(&node->list);
103 ptr = (char *) node - tree->head_offset;
108 vlist_simple_flush(struct vlist_simple_tree *tree)
110 struct vlist_simple_node *n, *tmp;
112 list_for_each_entry_safe(n, tmp, &tree->list, list) {
113 if ((n->version == tree->version || n->version == -1) &&
117 vlist_simple_delete(tree, n);
122 vlist_simple_flush_all(struct vlist_simple_tree *tree)
125 vlist_simple_flush(tree);