+/*
+ * netifd - network interface daemon
+ * Copyright (C) 2012 Felix Fietkau <nbd@openwrt.org>
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License version 2
+ * as published by the Free Software Foundation
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ */
#include <string.h>
+#include <stdlib.h>
#include "utils.h"
-int
-avl_strcmp(const void *k1, const void *k2, void *ptr)
-{
- return strcmp(k1, k2);
-}
-
-static int
-vlist_cmp(const void *k1, const void *k2, void *ptr)
-{
- struct vlist_tree *vl = ptr;
- return memcmp(k1, k2, vl->data_len);
-}
-
void
-__vlist_init(struct vlist_tree *tree, vlist_update_cb update, int offset, int len)
+__vlist_simple_init(struct vlist_simple_tree *tree, int offset)
{
- tree->data_offset = offset;
- tree->data_len = len;
- tree->update = update;
+ INIT_LIST_HEAD(&tree->list);
tree->version = 1;
-
- avl_init(&tree->avl, vlist_cmp, 0, tree);
+ tree->head_offset = offset;
}
void
-vlist_delete(struct vlist_tree *tree, struct vlist_node *node)
+vlist_simple_delete(struct vlist_simple_tree *tree, struct vlist_simple_node *node)
{
- avl_delete(&tree->avl, &node->avl);
- tree->update(tree, NULL, node);
+ char *ptr;
+
+ list_del(&node->list);
+ ptr = (char *) node - tree->head_offset;
+ free(ptr);
}
void
-vlist_add(struct vlist_tree *tree, struct vlist_node *node)
+vlist_simple_flush(struct vlist_simple_tree *tree)
{
- struct vlist_node *old_node = NULL;
- struct avl_node *anode;
+ struct vlist_simple_node *n, *tmp;
- node->avl.key = (char *) node + tree->data_offset;
- node->version = tree->version;
+ list_for_each_entry_safe(n, tmp, &tree->list, list) {
+ if ((n->version == tree->version || n->version == -1) &&
+ tree->version != -1)
+ continue;
- anode = avl_find(&tree->avl, (char *) node + tree->data_offset);
- if (anode) {
- old_node = container_of(anode, struct vlist_node, avl);
- avl_delete(&tree->avl, anode);
+ vlist_simple_delete(tree, n);
}
-
- avl_insert(&tree->avl, &node->avl);
- tree->update(tree, node, old_node);
}
void
-vlist_flush(struct vlist_tree *tree)
+vlist_simple_replace(struct vlist_simple_tree *dest, struct vlist_simple_tree *old)
{
- struct vlist_node *node, *tmp;
-
- avl_for_each_element_safe(&tree->avl, node, avl, tmp) {
- if (node->version == tree->version)
- continue;
+ struct vlist_simple_node *n, *tmp;
- vlist_delete(tree, node);
+ vlist_simple_update(dest);
+ list_for_each_entry_safe(n, tmp, &old->list, list) {
+ list_del(&n->list);
+ vlist_simple_add(dest, n);
}
+ vlist_simple_flush(dest);
}
void
-vlist_flush_all(struct vlist_tree *tree)
+vlist_simple_flush_all(struct vlist_simple_tree *tree)
{
- tree->version++;
- vlist_flush(tree);
+ tree->version = -1;
+ vlist_simple_flush(tree);
}