/*
graph.c -- graph algorithms
- Copyright (C) 2001-2011 Guus Sliepen <guus@tinc-vpn.org>,
+ Copyright (C) 2001-2012 Guus Sliepen <guus@tinc-vpn.org>,
2001-2005 Ivo Timmermans
This program is free software; you can redistribute it and/or modify
#include "system.h"
-#include "splay_tree.h"
#include "config.h"
#include "connection.h"
#include "device.h"
#include "edge.h"
+#include "graph.h"
+#include "list.h"
#include "logger.h"
#include "netutl.h"
#include "node.h"
Please note that sorting on weight is already done by add_edge().
*/
-void mst_kruskal(void) {
- splay_node_t *node, *next;
- edge_t *e;
- node_t *n;
- connection_t *c;
-
+static void mst_kruskal(void) {
/* Clear MST status on connections */
- for(node = connection_tree->head; node; node = node->next) {
- c = node->data;
+ for(list_node_t *node = connection_list->head; node; node = node->next) {
+ connection_t *c = node->data;
c->status.mst = false;
}
- ifdebug(SCARY_THINGS) logger(LOG_DEBUG, "Running Kruskal's algorithm:");
+ logger(DEBUG_SCARY_THINGS, LOG_DEBUG, "Running Kruskal's algorithm:");
/* Clear visited status on nodes */
- for(node = node_tree->head; node; node = node->next) {
- n = node->data;
+ for(splay_node_t *node = node_tree->head; node; node = node->next) {
+ node_t *n = node->data;
n->status.visited = false;
}
/* Add safe edges */
- for(node = edge_weight_tree->head; node; node = next) {
+ for(splay_node_t *node = edge_weight_tree->head, *next; node; node = next) {
next = node->next;
- e = node->data;
+ edge_t *e = node->data;
if(!e->reverse || (e->from->status.visited && e->to->status.visited))
continue;
if(e->reverse->connection)
e->reverse->connection->status.mst = true;
- ifdebug(SCARY_THINGS) logger(LOG_DEBUG, " Adding edge %s - %s weight %d", e->from->name,
+ logger(DEBUG_SCARY_THINGS, LOG_DEBUG, " Adding edge %s - %s weight %d", e->from->name,
e->to->name, e->weight);
}
}
-/* Implementation of Dijkstra's algorithm.
- Running time: O(N^2)
-*/
-
-static void sssp_dijkstra(void) {
- splay_node_t *node, *to;
- edge_t *e;
- node_t *n, *m;
- list_t *todo_list;
- list_node_t *lnode, *nnode;
- bool indirect;
-
- todo_list = list_alloc(NULL);
-
- ifdebug(SCARY_THINGS) logger(LOG_DEBUG, "Running Dijkstra's algorithm:");
-
- /* Clear visited status on nodes */
-
- for(node = node_tree->head; node; node = node->next) {
- n = node->data;
- n->status.visited = false;
- n->status.indirect = true;
- n->distance = -1;
- }
-
- /* Begin with myself */
-
- myself->status.indirect = false;
- myself->nexthop = myself;
- myself->via = myself;
- myself->distance = 0;
- list_insert_head(todo_list, myself);
-
- /* Loop while todo_list is filled */
-
- while(todo_list->head) {
- n = NULL;
- nnode = NULL;
-
- /* Select node from todo_list with smallest distance */
-
- for(lnode = todo_list->head; lnode; lnode = lnode->next) {
- m = lnode->data;
- if(!n || m->status.indirect < n->status.indirect || m->distance < n->distance) {
- n = m;
- nnode = lnode;
- }
- }
-
- /* Mark this node as visited and remove it from the todo_list */
-
- n->status.visited = true;
- list_unlink_node(todo_list, nnode);
-
- /* Update distance of neighbours and add them to the todo_list */
-
- for(to = n->edge_tree->head; to; to = to->next) { /* "to" is the edge connected to "from" */
- e = to->data;
-
- if(e->to->status.visited || !e->reverse)
- continue;
-
- /* Situation:
-
- /
- /
- ----->(n)---e-->(e->to)
- \
- \
-
- Where e is an edge, (n) and (e->to) are nodes.
- n->address is set to the e->address of the edge left of n to n.
- We are currently examining the edge e right of n from n:
-
- - If e->reverse->address != n->address, then e->to is probably
- not reachable for the nodes left of n. We do as if the indirectdata
- flag is set on edge e.
- - If edge e provides for better reachability of e->to, update e->to.
- */
-
- if(e->to->distance < 0)
- list_insert_tail(todo_list, e->to);
-
- indirect = n->status.indirect || e->options & OPTION_INDIRECT || ((n != myself) && sockaddrcmp(&n->address, &e->reverse->address));
-
- if(e->to->distance >= 0 && (!e->to->status.indirect || indirect) && e->to->distance <= n->distance + e->weight)
- continue;
-
- e->to->distance = n->distance + e->weight;
- e->to->status.indirect = indirect;
- e->to->nexthop = (n->nexthop == myself) ? e->to : n->nexthop;
- e->to->via = indirect ? n->via : e->to;
- e->to->options = e->options;
-
- if(sockaddrcmp(&e->to->address, &e->address)) {
- node = splay_unlink(node_udp_tree, e->to);
- sockaddrfree(&e->to->address);
- sockaddrcpy(&e->to->address, &e->address);
-
- if(e->to->hostname)
- free(e->to->hostname);
-
- e->to->hostname = sockaddr2hostname(&e->to->address);
-
- if(node)
- splay_insert_node(node_udp_tree, node);
-
- if(e->to->options & OPTION_PMTU_DISCOVERY) {
- e->to->mtuprobes = 0;
- e->to->minmtu = 0;
- e->to->maxmtu = MTU;
- if(e->to->status.validkey)
- send_mtu_probe(e->to);
- }
- }
-
- ifdebug(SCARY_THINGS) logger(LOG_DEBUG, " Updating edge %s - %s weight %d distance %d", e->from->name,
- e->to->name, e->weight, e->to->distance);
- }
- }
-
- list_free(todo_list);
-}
-
/* Implementation of a simple breadth-first search algorithm.
Running time: O(E)
*/
-void sssp_bfs(void) {
+static void sssp_bfs(void) {
splay_node_t *node, *to;
edge_t *e;
node_t *n;
n = node->data;
n->status.visited = false;
n->status.indirect = true;
+ n->distance = -1;
}
/* Begin with myself */
myself->status.visited = true;
myself->status.indirect = false;
myself->nexthop = myself;
+ myself->prevedge = NULL;
myself->via = myself;
+ myself->distance = 0;
list_insert_head(todo_list, myself);
/* Loop while todo_list is filled */
for(from = todo_list->head; from; from = todonext) { /* "from" is the node from which we start */
n = from->data;
+ if(n->distance < 0)
+ abort();
for(to = n->edge_tree->head; to; to = to->next) { /* "to" is the edge connected to "from" */
e = to->data;
indirect = n->status.indirect || e->options & OPTION_INDIRECT;
if(e->to->status.visited
- && (!e->to->status.indirect || indirect))
+ && (!e->to->status.indirect || indirect)
+ && (e->to->distance != n->distance + 1 || e->weight >= e->to->prevedge->weight))
continue;
e->to->status.visited = true;
e->to->status.indirect = indirect;
e->to->nexthop = (n->nexthop == myself) ? e->to : n->nexthop;
+ e->to->prevedge = e;
e->to->via = indirect ? n->via : e->to;
e->to->options = e->options;
+ e->to->distance = n->distance + 1;
- if(e->to->address.sa.sa_family == AF_UNSPEC && e->address.sa.sa_family != AF_UNKNOWN)
+ if(!e->to->status.reachable || (e->to->address.sa.sa_family == AF_UNSPEC && e->address.sa.sa_family != AF_UNKNOWN)
+)
update_node_udp(e->to, &e->address);
list_insert_tail(todo_list, e->to);
if(n->status.visited != n->status.reachable) {
n->status.reachable = !n->status.reachable;
+ n->last_state_change = time(NULL);
if(n->status.reachable) {
- ifdebug(TRAFFIC) logger(LOG_DEBUG, "Node %s (%s) became reachable",
+ logger(DEBUG_TRAFFIC, LOG_DEBUG, "Node %s (%s) became reachable",
n->name, n->hostname);
} else {
- ifdebug(TRAFFIC) logger(LOG_DEBUG, "Node %s (%s) became unreachable",
+ logger(DEBUG_TRAFFIC, LOG_DEBUG, "Node %s (%s) became unreachable",
n->name, n->hostname);
}
+ if(experimental && OPTION_VERSION(n->options) >= 2)
+ n->status.sptps = true;
+
/* TODO: only clear status.validkey if node is unreachable? */
n->status.validkey = false;
+ if(n->status.sptps) {
+ sptps_stop(&n->sptps);
+ n->status.waitingforkey = false;
+ }
n->last_req_key = 0;
n->maxmtu = MTU;
subnet_update(n, NULL, n->status.reachable);
- if(!n->status.reachable)
+ if(!n->status.reachable) {
update_node_udp(n, NULL);
- else if(n->connection)
- send_ans_key(n);
+ } else if(n->connection) {
+ if(n->status.sptps) {
+ if(n->connection->outgoing)
+ send_req_key(n);
+ } else {
+ send_ans_key(n);
+ }
+ }
}
}
}
void graph(void) {
subnet_cache_flush();
- sssp_dijkstra();
+ sssp_bfs();
check_reachability();
mst_kruskal();
}
projects / tinc / blobdiff