Cleanup:

[tinc] / src / graph.c

diff --git a/src/graph.c b/src/graph.c
index 29e25db..9d9bc1f 100644 (file)
--- a/src/graph.c
+++ b/src/graph.c
@@ -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.10 2002/03/19 22:48:25 guus Exp $
+    $Id: graph.c,v 1.1.2.12 2002/06/08 12:57:09 guus Exp $
 */
 
 /* We need to generate two trees from the graph:
@@ -44,10 +44,13 @@
    destination address and port of a node if possible.
 */
 
+#include "config.h"
+
+#include <stdio.h>
 #include <syslog.h>
 #include "config.h"
 #include <string.h>
-#if defined(HAVE_FREEBSD) || defined(HAVE_OPENBSD)
+#ifdef HAVE_SYS_PARAM_H
  #include <sys/param.h>
 #endif
 #include <netinet/in.h>
@@ -59,6 +62,7 @@
 #include "node.h"
 #include "edge.h"
 #include "connection.h"
+#include "process.h"
 
 #include "system.h"
 
@@ -152,6 +156,7 @@ void sssp_bfs(void)
   halfconnection_t to_hc, from_hc;
   avl_tree_t *todo_tree;
   int indirect;
+  char *name;
 
   todo_tree = avl_alloc_tree(NULL, NULL);
 
@@ -255,6 +260,9 @@ void sssp_bfs(void)
           if(debug_lvl >= DEBUG_TRAFFIC)
             syslog(LOG_DEBUG, _("Node %s (%s) became reachable"), n->name, n->hostname);
           n->status.reachable = 1;
+         asprintf(&name, "hosts/%s-up", n->name);
+         execute_script(name);
+         free(name);
        }
       }
       else
@@ -267,6 +275,9 @@ void sssp_bfs(void)
          n->status.validkey = 0;
          n->status.waitingforkey = 0;
          n->sent_seqno = 0;
+         asprintf(&name, "hosts/%s-down", n->name);
+         execute_script(name);
+         free(name);
        }
       }
     }