+
+ /* 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;
+
+ if(!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 edge e provides for better reachability of e->to, update
+ e->to and (re)add it to the todo_list to (re)examine the reachability
+ of nodes behind it.
+ */
+
+ indirect = n->status.indirect || e->options & OPTION_INDIRECT;
+
+ if(e->to->status.visited
+ && (!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)
+ update_node_udp(e->to, &e->address);
+
+ list_insert_tail(todo_list, e->to);
+ }
+
+ todonext = from->next;
+ list_delete_node(todo_list, from);
+ }
+
+ list_free(todo_list);
+}
+
+static void check_reachability(void) {
+ splay_node_t *node, *next;
+ node_t *n;
+ char *name;
+ char *address, *port;
+ char *envp[7];
+ int i;
+
+ /* Check reachability status. */
+
+ for(node = node_tree->head; node; node = next) {
+ next = node->next;
+ n = node->data;
+
+ if(n->status.visited != n->status.reachable) {
+ n->status.reachable = !n->status.reachable;
+
+ if(n->status.reachable) {
+ logger(DEBUG_TRAFFIC, LOG_DEBUG, "Node %s (%s) became reachable",
+ n->name, n->hostname);
+ } else {
+ 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;
+ n->last_req_key = 0;
+
+ n->maxmtu = MTU;
+ n->minmtu = 0;
+ n->mtuprobes = 0;
+
+ if(timeout_initialized(&n->mtuevent))
+ event_del(&n->mtuevent);
+
+ xasprintf(&envp[0], "NETNAME=%s", netname ? : "");
+ xasprintf(&envp[1], "DEVICE=%s", device ? : "");
+ xasprintf(&envp[2], "INTERFACE=%s", iface ? : "");
+ xasprintf(&envp[3], "NODE=%s", n->name);
+ sockaddr2str(&n->address, &address, &port);
+ xasprintf(&envp[4], "REMOTEADDRESS=%s", address);
+ xasprintf(&envp[5], "REMOTEPORT=%s", port);
+ envp[6] = NULL;
+
+ execute_script(n->status.reachable ? "host-up" : "host-down", envp);
+
+ xasprintf(&name,
+ n->status.reachable ? "hosts/%s-up" : "hosts/%s-down",
+ n->name);
+ execute_script(name, envp);
+
+ free(name);
+ free(address);
+ free(port);
+
+ for(i = 0; i < 6; i++)
+ free(envp[i]);
+
+ subnet_update(n, NULL, n->status.reachable);
+
+ if(!n->status.reachable) {
+ update_node_udp(n, NULL);
+ } else if(n->connection) {
+ if(n->status.sptps) {
+ if(n->connection->outgoing)
+ send_req_key(n);
+ } else {
+ send_ans_key(n);
+ }
+ }
+ }