X-Git-Url: http://git.archive.openwrt.org/?p=project%2Fnetifd.git;a=blobdiff_plain;f=utils.c;h=f1143c500585a7a76dc6e35c0ef9ceceb9c3d631;hp=629cdb2bf228fdc4cf66b38e58d81d0c05b775aa;hb=b0b11b2295fbb8399949139d82156e123e005902;hpb=c6e1778d4429032087b36fb0dde2ae2fecf53b4a

diff --git a/utils.c b/utils.c
index 629cdb2..f1143c5 100644
--- a/utils.c
+++ b/utils.c
@@ -1,3 +1,16 @@
+/*
+ * 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"
@@ -57,7 +70,8 @@ vlist_flush(struct vlist_tree *tree)
 	struct vlist_node *node, *tmp;
 
 	avl_for_each_element_safe(&tree->avl, node, avl, tmp) {
-		if (node->version == tree->version)
+		if ((node->version == tree->version || node->version == -1) &&
+		    tree->version != -1)
 			continue;
 
 		vlist_delete(tree, node);
@@ -67,7 +81,7 @@ vlist_flush(struct vlist_tree *tree)
 void
 vlist_flush_all(struct vlist_tree *tree)
 {
-	tree->version++;
+	tree->version = -1;
 	vlist_flush(tree);
 }
 
@@ -96,7 +110,8 @@ 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)
+		if ((n->version == tree->version || n->version == -1) &&
+		    tree->version != -1)
 			continue;
 
 		vlist_simple_delete(tree, n);
@@ -104,8 +119,19 @@ vlist_simple_flush(struct vlist_simple_tree *tree)
 }
 
 void
+vlist_simple_replace(struct vlist_simple_tree *dest, struct vlist_simple_tree *old)
+{
+	struct vlist_simple_node *n, *tmp;
+
+	list_for_each_entry_safe(n, tmp, &old->list, list) {
+		list_del(&n->list);
+		vlist_simple_add(dest, n);
+	}
+}
+
+void
 vlist_simple_flush_all(struct vlist_simple_tree *tree)
 {
-	tree->version++;
+	tree->version = -1;
 	vlist_simple_flush(tree);
 }