add a simplified vlist type
authorFelix Fietkau <nbd@openwrt.org>
Sun, 15 Jan 2012 18:25:03 +0000 (19:25 +0100)
committerFelix Fietkau <nbd@openwrt.org>
Sun, 15 Jan 2012 18:25:03 +0000 (19:25 +0100)
utils.c
utils.h

diff --git a/utils.c b/utils.c
index ba31b64..0b80064 100644 (file)
--- a/utils.c
+++ b/utils.c
@@ -1,4 +1,5 @@
 #include <string.h>
 #include <string.h>
+#include <stdlib.h>
 #include "utils.h"
 
 int
 #include "utils.h"
 
 int
@@ -70,3 +71,42 @@ vlist_flush_all(struct vlist_tree *tree)
        tree->version++;
        vlist_flush(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);
+}
diff --git a/utils.h b/utils.h
index cbb5775..b5ae7e0 100644 (file)
--- a/utils.h
+++ b/utils.h
@@ -50,6 +50,43 @@ void vlist_flush_all(struct vlist_tree *tree);
 #define vlist_for_each_element(tree, element, node_member) \
        avl_for_each_element(&(tree)->avl, element, node_member.avl)
 
 #define vlist_for_each_element(tree, element, node_member) \
        avl_for_each_element(&(tree)->avl, element, node_member.avl)
 
+
+struct vlist_simple_tree {
+       struct list_head list;
+       int head_offset;
+       int version;
+};
+
+struct vlist_simple_node {
+       struct list_head list;
+       int version;
+};
+
+#define vlist_simple_init(tree, node, member) \
+       __vlist_simple_init(tree, offsetof(node, member))
+
+void __vlist_simple_init(struct vlist_simple_tree *tree, int offset);
+void vlist_simple_delete(struct vlist_simple_tree *tree, struct vlist_simple_node *node);
+void vlist_simple_flush(struct vlist_simple_tree *tree);
+void vlist_simple_flush_all(struct vlist_simple_tree *tree);
+
+static inline void vlist_simple_update(struct vlist_simple_tree *tree)
+{
+       tree->version++;
+}
+
+static inline void vlist_simple_add(struct vlist_simple_tree *tree, struct vlist_simple_node *node)
+{
+       list_add(&node->list, &tree->list);
+}
+
+#define vlist_simple_for_each_element(tree, element, node_member) \
+       list_for_each_entry(element, &(tree)->list, node_member.list)
+
+#define vlist_simple_empty(tree) \
+       list_empty(&(tree)->list)
+
+
 #ifdef __linux__
 static inline int fls(int x)
 {
 #ifdef __linux__
 static inline int fls(int x)
 {