j3d1/tinc
1
0
Fork 0
Code Issues 1 Pull requests Releases Wiki Activity

Execute hosts/name-up when a node becomes reachable, and hosts/name-down

Browse source 
when it becomes unreachable.
This commit is contained in:
Guus Sliepen 2002-03-24 16:28:27 +00:00
parent 6ad5dd1a9a
commit d699f3079c
2 changed files with 16 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

13
src/graph.c
View file

@ -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.11 2002/03/24 16:28:27 guus Exp $
*/
/* We need to generate two trees from the graph:
@ -44,6 +44,9 @@
destination address and port of a node if possible.
*/
#include "config.h"
#include <stdio.h>
#include <syslog.h>
#include "config.h"
#include <string.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);
}
}
}