X-Git-Url: https://www.tinc-vpn.org/git/browse?a=blobdiff_plain;f=src%2Fgraph.c;h=2c6ad22e445adb47e5750cd9aa2266c87807f8c7;hb=96ee04b678143defa1040f2defdd3424efedea11;hp=f0a93aee3a7800b36712839e11e1ed5ec13ee5b5;hpb=c08858baa91a00e38c0f5482dbb0817dbd0361f1;p=tinc

diff --git a/src/graph.c b/src/graph.c
index f0a93aee..2c6ad22e 100644
--- a/src/graph.c
+++ b/src/graph.c
@@ -1,7 +1,7 @@
 /*
     graph.c -- graph algorithms
-    Copyright (C) 2001-2002 Guus Sliepen <guus@sliepen.eu.org>,
-                  2001-2002 Ivo Timmermans <ivo@o2w.nl>
+    Copyright (C) 2001-2003 Guus Sliepen <guus@sliepen.eu.org>,
+                  2001-2003 Ivo Timmermans <ivo@o2w.nl>
 
     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.22 2003/01/17 00:37:17 guus Exp $
+    $Id: graph.c,v 1.1.2.25 2003/07/17 15:06:26 guus Exp $
 */
 
 /* We need to generate two trees from the graph:
@@ -44,27 +44,17 @@
    destination address and port of a node if possible.
 */
 
-#include "config.h"
-
-#include <stdio.h>
-#include <syslog.h>
-#include <string.h>
-#ifdef HAVE_SYS_PARAM_H
-#include <sys/param.h>
-#endif
-#include <netinet/in.h>
-
-#include <avl_tree.h>
-#include <utils.h>
+#include "system.h"
 
+#include "avl_tree.h"
+#include "connection.h"
+#include "device.h"
+#include "edge.h"
+#include "logger.h"
 #include "netutl.h"
 #include "node.h"
-#include "edge.h"
-#include "connection.h"
 #include "process.h"
-#include "device.h"
-
-#include "system.h"
+#include "utils.h"
 
 /* Implementation of Kruskal's algorithm.
    Running time: O(EN)
@@ -95,8 +85,7 @@ void mst_kruskal(void)
 	if(!edge_weight_tree->head)
 		return;
 
-	if(debug_lvl >= DEBUG_SCARY_THINGS)
-		syslog(LOG_DEBUG, "Running Kruskal's algorithm:");
+	ifdebug(SCARY_THINGS) logger(LOG_DEBUG, "Running Kruskal's algorithm:");
 
 	/* Clear visited status on nodes */
 
@@ -132,8 +121,7 @@ void mst_kruskal(void)
 
 		safe_edges++;
 
-		if(debug_lvl >= DEBUG_SCARY_THINGS)
-			syslog(LOG_DEBUG, " Adding edge %s - %s weight %d", e->from->name,
+		ifdebug(SCARY_THINGS) logger(LOG_DEBUG, " Adding edge %s - %s weight %d", e->from->name,
 				   e->to->name, e->weight);
 
 		if(skipped) {
@@ -143,8 +131,7 @@ void mst_kruskal(void)
 		}
 	}
 
-	if(debug_lvl >= DEBUG_SCARY_THINGS)
-		syslog(LOG_DEBUG, "Done, counted %d nodes and %d safe edges.", nodes,
+	ifdebug(SCARY_THINGS) logger(LOG_DEBUG, "Done, counted %d nodes and %d safe edges.", nodes,
 			   safe_edges);
 }
 
@@ -262,13 +249,12 @@ void sssp_bfs(void)
 		if(n->status.visited != n->status.reachable) {
 			n->status.reachable = !n->status.reachable;
 
-			if(debug_lvl >= DEBUG_TRAFFIC) {
-				if(n->status.reachable)
-					syslog(LOG_DEBUG, _("Node %s (%s) became reachable"),
-						   n->name, n->hostname);
-				else
-					syslog(LOG_DEBUG, _("Node %s (%s) became unreachable"),
-						   n->name, n->hostname);
+			if(n->status.reachable) {
+				ifdebug(TRAFFIC) logger(LOG_DEBUG, _("Node %s (%s) became reachable"),
+					   n->name, n->hostname);
+			} else {
+				ifdebug(TRAFFIC) logger(LOG_DEBUG, _("Node %s (%s) became unreachable"),
+					   n->name, n->hostname);
 			}
 
 			n->status.validkey = 0;