X-Git-Url: https://www.tinc-vpn.org/git/browse?p=tinc;a=blobdiff_plain;f=src%2Fgraph.c;h=a267f052a196df31c1d797ca1e5cf0dc965d11d9;hp=2c6ad22e445adb47e5750cd9aa2266c87807f8c7;hb=73d77dd416b87b7c4e9b6aa450f64846235cd2b4;hpb=e449d94caef963809d417f16497f6f978e10d731

diff --git a/src/graph.c b/src/graph.c
index 2c6ad22e..a267f052 100644
--- a/src/graph.c
+++ b/src/graph.c
@@ -1,7 +1,7 @@
 /*
     graph.c -- graph algorithms
-    Copyright (C) 2001-2003 Guus Sliepen <guus@sliepen.eu.org>,
-                  2001-2003 Ivo Timmermans <ivo@o2w.nl>
+    Copyright (C) 2001-2009 Guus Sliepen <guus@tinc-vpn.org>,
+                  2001-2005 Ivo Timmermans
 
     This program is free software; you can redistribute it and/or modify
     it under the terms of the GNU General Public License as published by
@@ -17,7 +17,7 @@
     along with this program; if not, write to the Free Software
     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 
-    $Id: graph.c,v 1.1.2.25 2003/07/17 15:06:26 guus Exp $
+    $Id$
 */
 
 /* We need to generate two trees from the graph:
@@ -47,6 +47,7 @@
 #include "system.h"
 
 #include "avl_tree.h"
+#include "config.h"
 #include "connection.h"
 #include "device.h"
 #include "edge.h"
@@ -54,7 +55,11 @@
 #include "netutl.h"
 #include "node.h"
 #include "process.h"
+#include "subnet.h"
 #include "utils.h"
+#include "xalloc.h"
+
+static bool graph_changed = true;
 
 /* Implementation of Kruskal's algorithm.
    Running time: O(EN)
@@ -69,15 +74,15 @@ void mst_kruskal(void)
 	connection_t *c;
 	int nodes = 0;
 	int safe_edges = 0;
-	int skipped;
+	bool skipped;
 
 	cp();
 	
 	/* Clear MST status on connections */
 
 	for(node = connection_tree->head; node; node = node->next) {
-		c = (connection_t *) node->data;
-		c->status.mst = 0;
+		c = node->data;
+		c->status.mst = false;
 	}
 
 	/* Do we have something to do at all? */
@@ -90,34 +95,40 @@ void mst_kruskal(void)
 	/* Clear visited status on nodes */
 
 	for(node = node_tree->head; node; node = node->next) {
-		n = (node_t *) node->data;
-		n->status.visited = 0;
+		n = node->data;
+		n->status.visited = false;
 		nodes++;
 	}
 
 	/* Starting point */
 
-	((edge_t *) edge_weight_tree->head->data)->from->status.visited = 1;
+	for(node = edge_weight_tree->head; node; node = node->next) {
+		e = node->data;
+		if(e->from->status.reachable) {
+			e->from->status.visited = true;
+			break;
+		}
+	}
 
 	/* Add safe edges */
 
-	for(skipped = 0, node = edge_weight_tree->head; node; node = next) {
+	for(skipped = false, node = edge_weight_tree->head; node; node = next) {
 		next = node->next;
-		e = (edge_t *) node->data;
+		e = node->data;
 
 		if(!e->reverse || e->from->status.visited == e->to->status.visited) {
-			skipped = 1;
+			skipped = true;
 			continue;
 		}
 
-		e->from->status.visited = 1;
-		e->to->status.visited = 1;
+		e->from->status.visited = true;
+		e->to->status.visited = true;
 
 		if(e->connection)
-			e->connection->status.mst = 1;
+			e->connection->status.mst = true;
 
 		if(e->reverse->connection)
-			e->reverse->connection->status.mst = 1;
+			e->reverse->connection->status.mst = true;
 
 		safe_edges++;
 
@@ -125,7 +136,7 @@ void mst_kruskal(void)
 				   e->to->name, e->weight);
 
 		if(skipped) {
-			skipped = 0;
+			skipped = false;
 			next = edge_weight_tree->head;
 			continue;
 		}
@@ -141,11 +152,12 @@ void mst_kruskal(void)
 
 void sssp_bfs(void)
 {
-	avl_node_t *node, *from, *next, *to;
+	avl_node_t *node, *next, *to;
 	edge_t *e;
 	node_t *n;
-	avl_tree_t *todo_tree;
-	int indirect;
+	list_t *todo_list;
+	list_node_t *from, *todonext;
+	bool indirect;
 	char *name;
 	char *address, *port;
 	char *envp[7];
@@ -153,98 +165,85 @@ void sssp_bfs(void)
 
 	cp();
 
-	todo_tree = avl_alloc_tree(NULL, NULL);
+	todo_list = list_alloc(NULL);
 
 	/* Clear visited status on nodes */
 
 	for(node = node_tree->head; node; node = node->next) {
-		n = (node_t *) node->data;
-		n->status.visited = 0;
-		n->status.indirect = 1;
+		n = node->data;
+		n->status.visited = false;
+		n->status.indirect = true;
 	}
 
 	/* Begin with myself */
 
-	myself->status.visited = 1;
-	myself->status.indirect = 0;
+	myself->status.visited = true;
+	myself->status.indirect = false;
 	myself->nexthop = myself;
 	myself->via = myself;
-	node = avl_alloc_node();
-	node->data = myself;
-	avl_insert_top(todo_tree, node);
+	list_insert_head(todo_list, myself);
 
-	/* Loop while todo_tree is filled */
+	/* Loop while todo_list is filled */
 
-	while(todo_tree->head) {
-		for(from = todo_tree->head; from; from = next) {	/* "from" is the node from which we start */
-			next = from->next;
-			n = (node_t *) from->data;
+	for(from = todo_list->head; from; from = todonext) {	/* "from" is the node from which we start */
+		n = from->data;
 
-			for(to = n->edge_tree->head; to; to = to->next) {	/* "to" is the edge connected to "from" */
-				e = (edge_t *) to->data;
+		for(to = n->edge_tree->head; to; to = to->next) {	/* "to" is the edge connected to "from" */
+			e = to->data;
 
-				if(!e->reverse)
-					continue;
+			if(!e->reverse)
+				continue;
 
-				/* Situation:
+			/* Situation:
 
-				    /
 				   /
-				   ------(n)-----(e->to)
+				  /
+			   ----->(n)---e-->(e->to)
+				  \
 				   \
-				    \
-
-				   n->address is set to the e->address of the edge left of n to n.
-				   We are currently examining the edge e right of n from n:
-
-				   - If e->reverse->address != n->address, then e->to is probably
-				     not reachable for the nodes left of n. We do as if the indirectdata
-				     flag is set on edge e.
-				   - If edge e provides for better reachability of e->to, update
-				     e->to and (re)add it to the todo_tree to (re)examine the reachability
-				     of nodes behind it.
-				 */
-
-				indirect = n->status.indirect || e->options & OPTION_INDIRECT
-					|| ((n != myself) && sockaddrcmp(&n->address, &e->reverse->address));
-
-				if(e->to->status.visited
-				   && (!e->to->status.indirect || indirect))
-					continue;
-
-				e->to->status.visited = 1;
-				e->to->status.indirect = indirect;
-				e->to->nexthop = (n->nexthop == myself) ? e->to : n->nexthop;
-				e->to->via = indirect ? n->via : e->to;
-				e->to->options = e->options;
-
-				if(sockaddrcmp(&e->to->address, &e->address)) {
-					node = avl_unlink(node_udp_tree, e->to);
-					e->to->address = e->address;
-
-					if(e->to->hostname)
-						free(e->to->hostname);
-
-					e->to->hostname = sockaddr2hostname(&e->to->address);
-					avl_insert_node(node_udp_tree, node);
-				}
-
-				node = avl_alloc_node();
-				node->data = e->to;
-				avl_insert_before(todo_tree, from, node);
-			}
 
-			avl_delete_node(todo_tree, from);
+			   Where e is an edge, (n) and (e->to) are nodes.
+			   n->address is set to the e->address of the edge left of n to n.
+			   We are currently examining the edge e right of n from n:
+
+			   - If e->reverse->address != n->address, then e->to is probably
+			     not reachable for the nodes left of n. We do as if the indirectdata
+			     flag is set on edge e.
+			   - If edge e provides for better reachability of e->to, update
+			     e->to and (re)add it to the todo_list to (re)examine the reachability
+			     of nodes behind it.
+			 */
+
+			indirect = n->status.indirect || e->options & OPTION_INDIRECT
+				|| ((n != myself) && sockaddrcmp(&n->address, &e->reverse->address));
+
+			if(e->to->status.visited
+			   && (!e->to->status.indirect || indirect))
+				continue;
+
+			e->to->status.visited = true;
+			e->to->status.indirect = indirect;
+			e->to->nexthop = (n->nexthop == myself) ? e->to : n->nexthop;
+			e->to->via = indirect ? n->via : e->to;
+			e->to->options = e->options;
+
+			if(e->to->address.sa.sa_family == AF_UNSPEC && e->address.sa.sa_family != AF_UNKNOWN)
+				update_node_udp(e->to, &e->address);
+
+			list_insert_tail(todo_list, e->to);
 		}
+
+		todonext = from->next;
+		list_delete_node(todo_list, from);
 	}
 
-	avl_free_tree(todo_tree);
+	list_free(todo_list);
 
 	/* Check reachability status. */
 
 	for(node = node_tree->head; node; node = next) {
 		next = node->next;
-		n = (node_t *) node->data;
+		n = node->data;
 
 		if(n->status.visited != n->status.reachable) {
 			n->status.reachable = !n->status.reachable;
@@ -257,19 +256,32 @@ void sssp_bfs(void)
 					   n->name, n->hostname);
 			}
 
-			n->status.validkey = 0;
-			n->status.waitingforkey = 0;
+			/* TODO: only clear status.validkey if node is unreachable? */
+
+			n->status.validkey = false;
+			n->status.waitingforkey = false;
 
-			asprintf(&envp[0], "NETNAME=%s", netname ? : "");
-			asprintf(&envp[1], "DEVICE=%s", device ? : "");
-			asprintf(&envp[2], "INTERFACE=%s", interface ? : "");
-			asprintf(&envp[3], "NODE=%s", n->name);
+			n->maxmtu = MTU;
+			n->minmtu = 0;
+			n->mtuprobes = 0;
+
+			if(n->mtuevent) {
+				event_del(n->mtuevent);
+				n->mtuevent = NULL;
+			}
+
+			xasprintf(&envp[0], "NETNAME=%s", netname ? : "");
+			xasprintf(&envp[1], "DEVICE=%s", device ? : "");
+			xasprintf(&envp[2], "INTERFACE=%s", iface ? : "");
+			xasprintf(&envp[3], "NODE=%s", n->name);
 			sockaddr2str(&n->address, &address, &port);
-			asprintf(&envp[4], "REMOTEADDRESS=%s", address);
-			asprintf(&envp[5], "REMOTEPORT=%s", port);
+			xasprintf(&envp[4], "REMOTEADDRESS=%s", address);
+			xasprintf(&envp[5], "REMOTEPORT=%s", port);
 			envp[6] = NULL;
 
-			asprintf(&name,
+			execute_script(n->status.reachable ? "host-up" : "host-down", envp);
+
+			xasprintf(&name,
 					 n->status.reachable ? "hosts/%s-up" : "hosts/%s-down",
 					 n->name);
 			execute_script(name, envp);
@@ -278,14 +290,82 @@ void sssp_bfs(void)
 			free(address);
 			free(port);
 
-			for(i = 0; i < 7; i++)
+			for(i = 0; i < 6; i++)
 				free(envp[i]);
+
+			subnet_update(n, NULL, n->status.reachable);
 		}
 	}
 }
 
 void graph(void)
 {
-	mst_kruskal();
+	subnet_cache_flush();
 	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)
+{
+	avl_node_t *node;
+	node_t *n;
+	edge_t *e;
+	char *filename = NULL, *tmpname = NULL;
+	FILE *file;
+	
+	if(!graph_changed || !get_config_string(lookup_config(config_tree, "GraphDumpFile"), &filename))
+		return;
+
+	graph_changed = false;
+
+	ifdebug(PROTOCOL) logger(LOG_NOTICE, "Dumping graph");
+	
+	if(filename[0] == '|') {
+		file = popen(filename + 1, "w");
+	} else {
+		xasprintf(&tmpname, "%s.new", filename);
+		file = fopen(tmpname, "w");
+	}
+
+	if(!file) {
+		logger(LOG_ERR, "Unable to open graph dump file %s: %s", filename, strerror(errno));
+		free(tmpname);
+		return;
+	}
+
+	fprintf(file, "digraph {\n");
+	
+	/* dump all nodes first */
+	for(node = node_tree->head; node; node = node->next) {
+		n = node->data;
+		fprintf(file, "	%s [label = \"%s\"];\n", n->name, n->name);
+	}
+
+	/* now dump all edges */
+	for(node = edge_weight_tree->head; node; node = node->next) {
+		e = node->data;
+		fprintf(file, "	%s -> %s;\n", e->from->name, e->to->name);
+	}
+
+	fprintf(file, "}\n");	
+	
+	if(filename[0] == '|') {
+		pclose(file);
+	} else {
+		fclose(file);
+#ifdef HAVE_MINGW
+		unlink(filename);
+#endif
+		rename(tmpname, filename);
+		free(tmpname);
+	}
 }