#include "script.h"
#include "subnet.h"
#include "xalloc.h"
+#include "address_cache.h"
/* Implementation of Kruskal's algorithm.
Running time: O(EN)
/* Clear visited status on nodes */
- for splay_each(node_t, n, node_tree) {
+ for splay_each(node_t, n, &node_tree) {
n->status.visited = false;
}
/* Starting point */
- for splay_each(edge_t, e, edge_weight_tree) {
+ for splay_each(edge_t, e, &edge_weight_tree) {
if(e->from->status.reachable) {
e->from->status.visited = true;
break;
bool skipped = false;
- for splay_each(edge_t, e, edge_weight_tree) {
+ for splay_each(edge_t, e, &edge_weight_tree) {
if(!e->reverse || (e->from->status.visited == e->to->status.visited)) {
skipped = true;
continue;
if(skipped) {
skipped = false;
- next = edge_weight_tree->head;
+ next = edge_weight_tree.head;
}
}
}
+// Not putting it into header, the outside world doesn't need to know about it.
+extern void sssp_bfs(void);
+
/* Implementation of a simple breadth-first search algorithm.
Running time: O(E)
*/
-
-static void sssp_bfs(void) {
+void sssp_bfs(void) {
list_t *todo_list = list_alloc(NULL);
/* Clear visited status on nodes */
- for splay_each(node_t, n, node_tree) {
+ for splay_each(node_t, n, &node_tree) {
n->status.visited = false;
n->status.indirect = true;
n->distance = -1;
abort();
}
- for splay_each(edge_t, e, n->edge_tree) { /* "e" is the edge connected to "from" */
+ for splay_each(edge_t, e, &n->edge_tree) { /* "e" is the edge connected to "from" */
if(!e->reverse || e->to == myself) {
continue;
}
// Only update nexthop if it doesn't increase the path length
- if(!e->to->status.visited || (e->to->distance == n->distance + 1 && e->weight >= e->to->prevedge->weight)) {
+ if(!e->to->status.visited || (e->to->distance == n->distance + 1 && e->weight < e->to->prevedge->weight)) {
e->to->nexthop = (n->nexthop == myself) ? e->to : n->nexthop;
}
int became_reachable_count = 0;
int became_unreachable_count = 0;
- for splay_each(node_t, n, node_tree) {
+ for splay_each(node_t, n, &node_tree) {
if(n->status.visited != n->status.reachable) {
n->status.reachable = !n->status.reachable;
n->last_state_change = now.tv_sec;
if(n != myself) {
became_reachable_count++;
+
+ if(n->connection && n->connection->outgoing) {
+ if(!n->address_cache) {
+ n->address_cache = open_address_cache(n);
+ }
+
+ add_recent_address(n->address_cache, &n->connection->address);
+ }
}
} else {
logger(DEBUG_TRAFFIC, LOG_DEBUG, "Node %s (%s) became unreachable",
}
void graph(void) {
- subnet_cache_flush();
+ subnet_cache_flush_tables();
sssp_bfs();
check_reachability();
mst_kruskal();