/*
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
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.27 2003/07/22 20:55:19 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 <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)
connection_t *c;
int nodes = 0;
int safe_edges = 0;
- int skipped;
+ bool skipped;
cp();
for(node = connection_tree->head; node; node = node->next) {
c = (connection_t *) node->data;
- c->status.mst = 0;
+ c->status.mst = false;
}
/* Do we have something to do at all? */
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 */
for(node = node_tree->head; node; node = node->next) {
n = (node_t *) node->data;
- n->status.visited = 0;
+ n->status.visited = false;
nodes++;
}
/* Starting point */
- ((edge_t *) edge_weight_tree->head->data)->from->status.visited = 1;
+ ((edge_t *) edge_weight_tree->head->data)->from->status.visited = true;
/* 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;
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++;
- 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) {
- skipped = 0;
+ skipped = false;
next = edge_weight_tree->head;
continue;
}
}
- 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);
}
edge_t *e;
node_t *n;
avl_tree_t *todo_tree;
- int indirect;
+ bool indirect;
char *name;
char *address, *port;
char *envp[7];
for(node = node_tree->head; node; node = node->next) {
n = (node_t *) node->data;
- n->status.visited = 0;
- n->status.indirect = 1;
+ 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();
&& (!e->to->status.indirect || indirect))
continue;
- e->to->status.visited = 1;
+ 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;
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;
- n->status.waitingforkey = 0;
+ 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[2], "INTERFACE=%s", iface ? : "");
asprintf(&envp[3], "NODE=%s", n->name);
sockaddr2str(&n->address, &address, &port);
asprintf(&envp[4], "REMOTEADDRESS=%s", address);