proto-shell: rework task statemachine
[project/netifd.git] / utils.c
diff --git a/utils.c b/utils.c
index a67a8c9..0b80064 100644 (file)
--- a/utils.c
+++ b/utils.c
@@ -1,4 +1,5 @@
 #include <string.h>
+#include <stdlib.h>
 #include "utils.h"
 
 int
@@ -11,7 +12,7 @@ void
 __vlist_init(struct vlist_tree *tree, avl_tree_comp cmp,
             vlist_update_cb update, int offset)
 {
-       tree->node_offset = offset;
+       tree->key_offset = offset;
        tree->update = update;
        tree->version = 1;
 
@@ -21,7 +22,8 @@ __vlist_init(struct vlist_tree *tree, avl_tree_comp cmp,
 void
 vlist_delete(struct vlist_tree *tree, struct vlist_node *node)
 {
-       avl_delete(&tree->avl, &node->avl);
+       if (!tree->no_delete)
+               avl_delete(&tree->avl, &node->avl);
        tree->update(tree, NULL, node);
 }
 
@@ -30,17 +32,17 @@ vlist_add(struct vlist_tree *tree, struct vlist_node *node)
 {
        struct vlist_node *old_node = NULL;
        struct avl_node *anode;
-       void *key = (char *) node - tree->node_offset;
+       void *key = (char *) node + tree->key_offset;
 
        node->avl.key = key;
        node->version = tree->version;
 
        anode = avl_find(&tree->avl, key);
        if (anode) {
-               if (tree->keep_old)
+               old_node = container_of(anode, struct vlist_node, avl);
+               if (tree->keep_old || tree->no_delete)
                        goto update_only;
 
-               old_node = container_of(anode, struct vlist_node, avl);
                avl_delete(&tree->avl, anode);
        }
 
@@ -69,3 +71,42 @@ vlist_flush_all(struct vlist_tree *tree)
        tree->version++;
        vlist_flush(tree);
 }
+
+
+void
+__vlist_simple_init(struct vlist_simple_tree *tree, int offset)
+{
+       INIT_LIST_HEAD(&tree->list);
+       tree->version = 1;
+       tree->head_offset = offset;
+}
+
+void
+vlist_simple_delete(struct vlist_simple_tree *tree, struct vlist_simple_node *node)
+{
+       char *ptr;
+
+       list_del(&node->list);
+       ptr = (char *) node - tree->head_offset;
+       free(ptr);
+}
+
+void
+vlist_simple_flush(struct vlist_simple_tree *tree)
+{
+       struct vlist_simple_node *n, *tmp;
+
+       list_for_each_entry_safe(n, tmp, &tree->list, list) {
+               if (n->version == tree->version)
+                       continue;
+
+               vlist_simple_delete(tree, n);
+       }
+}
+
+void
+vlist_simple_flush_all(struct vlist_simple_tree *tree)
+{
+       tree->version++;
+       vlist_simple_flush(tree);
+}