X-Git-Url: https://tinc-vpn.org/git/browse?a=blobdiff_plain;f=src%2Fgraph.c;h=02650f7330238d53487a83debfd45173fe0fd880;hb=4d0621b1f39537699b0ec4655b0c6e6b84581c9a;hp=be6080e07ad97b8002f681b37cadae7537cd51ff;hpb=b834d67d7cc7d7f5d8b729b340ec0c809c7d54b6;p=tinc

diff --git a/src/graph.c b/src/graph.c
index be6080e0..02650f73 100644
--- a/src/graph.c
+++ b/src/graph.c
@@ -58,8 +58,6 @@
 #include "subnet.h"
 #include "utils.h"
 
-static bool graph_changed = true;
-
 /* Implementation of Kruskal's algorithm.
    Running time: O(EN)
    Please note that sorting on weight is already done by add_edge().
@@ -311,22 +309,13 @@ void sssp_bfs(void)
 	}
 }
 
-void graph(void)
-{
-	sssp_bfs();
-	mst_kruskal();
-	graph_changed = true;
-}
-
-
-
 /* Dump nodes and edges to a graphviz file.
 	   
    The file can be converted to an image with
    dot -Tpng graph_filename -o image_filename.png -Gconcentrate=true
 */
 
-void dump_graph(void)
+static void dump_graph(int fd, short events, void *data)
 {
 	avl_node_t *node;
 	node_t *n;
@@ -334,11 +323,9 @@ void dump_graph(void)
 	char *filename = NULL, *tmpname = NULL;
 	FILE *file;
 	
-	if(!graph_changed || !get_config_string(lookup_config(config_tree, "GraphDumpFile"), &filename))
+	if(!get_config_string(lookup_config(config_tree, "GraphDumpFile"), &filename))
 		return;
 
-	graph_changed = false;
-
 	ifdebug(PROTOCOL) logger(LOG_NOTICE, "Dumping graph");
 	
 	if(filename[0] == '|') {
@@ -374,7 +361,22 @@ void dump_graph(void)
 		pclose(file);
 	} else {
 		fclose(file);
+#ifdef HAVE_MINGW
+		unlink(filename);
+#endif
 		rename(tmpname, filename);
 		free(tmpname);
 	}
 }
+
+void graph(void)
+{
+	static struct event ev;
+
+	sssp_bfs();
+	mst_kruskal();
+
+	if(!ev.ev_callback)
+		timeout_set(&ev, dump_graph, NULL);
+	event_add(&ev, &(struct timeval){5, 0});
+}