/*
graph.c -- graph algorithms
- Copyright (C) 2001-2002 Guus Sliepen <guus@sliepen.warande.net>,
- 2001-2002 Ivo Timmermans <itimmermans@bigfoot.com>
+ Copyright (C) 2001-2002 Guus Sliepen <guus@sliepen.eu.org>,
+ 2001-2002 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
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.13 2002/06/21 10:11:12 guus Exp $
*/
/* We need to generate two trees from the graph:
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>
#include "node.h"
#include "edge.h"
#include "connection.h"
+#include "process.h"
#include "system.h"
halfconnection_t to_hc, from_hc;
avl_tree_t *todo_tree;
int indirect;
+ char *name;
todo_tree = avl_alloc_tree(NULL, NULL);
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
n->status.validkey = 0;
n->status.waitingforkey = 0;
n->sent_seqno = 0;
+ asprintf(&name, "hosts/%s-down", n->name);
+ execute_script(name);
+ free(name);
}
}
}