-void sssp_bfs(void)
-{
- avl_node_t *node, *from, *next, *to;
- edge_t *e;
- node_t *n;
- halfconnection_t to_hc, from_hc;
- avl_tree_t *todo_tree;
- int indirect;
- char *name;
-
- todo_tree = avl_alloc_tree(NULL, NULL);
-
- /* 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.indirect = 1;
- }
-
- /* Begin with myself */
-
- myself->status.visited = 1;
- myself->status.indirect = 0;
- myself->nexthop = myself;
- myself->via = myself;
- node = avl_alloc_node();
- node->data = myself;
- avl_insert_top(todo_tree, node);
-
- /* Loop while todo_tree is filled */
-
- while(todo_tree->head)
- {
- for(from = todo_tree->head; from; from = next) /* "from" is the node from which we start */
- {
- next = from->next;
- n = (node_t *)from->data;
-
- for(to = n->edge_tree->head; to; to = to->next) /* "to" is the edge connected to "from" */
- {
- e = (edge_t *)to->data;
-
- if(e->from.node == n) /* "from_hc" is the halfconnection with .node == from */
- to_hc = e->to, from_hc = e->from;
- else
- to_hc = e->from, from_hc = e->to;
-
- /* Situation:
-
- /
- /
- ------(n)from_hc-----to_hc
- \
- \
-
- n->address is set to the to_hc.udpaddress of the edge left of n.
- We are currently examining the edge right of n:
-
- - If from_hc.udpaddress != n->address, then to_hc.node 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 to_hc.node, update
- to_hc.node and (re)add it to the todo_tree to (re)examine the reachability
- of nodes behind it.
- */
-
- indirect = n->status.indirect || e->options & OPTION_INDIRECT || ((n != myself) && sockaddrcmp(&n->address, &from_hc.udpaddress));
-
- if(to_hc.node->status.visited && (!to_hc.node->status.indirect || indirect))
- continue;
-
- to_hc.node->status.visited = 1;
- to_hc.node->status.indirect = indirect;
- to_hc.node->nexthop = (n->nexthop == myself) ? to_hc.node : n->nexthop;
- to_hc.node->via = indirect ? n->via : to_hc.node;
- to_hc.node->options = e->options;
- if(sockaddrcmp(&to_hc.node->address, &to_hc.udpaddress))
- {
- node = avl_unlink(node_udp_tree, to_hc.node);
- to_hc.node->address = to_hc.udpaddress;
- if(to_hc.node->hostname)
- free(to_hc.node->hostname);
- to_hc.node->hostname = sockaddr2hostname(&to_hc.udpaddress);
- avl_insert_node(node_udp_tree, node);
- }
- node = avl_alloc_node();
- node->data = to_hc.node;
- avl_insert_before(todo_tree, from, node);
- }
-
- avl_delete_node(todo_tree, from);
- }
- }
-
- avl_free_tree(todo_tree);
-
- /* Check reachability status. */
-
- for(node = node_tree->head; node; node = next)
- {
- next = node->next;
- n = (node_t *)node->data;
-
- if(n->status.visited)
- {
- if(!n->status.reachable)
- {
- 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);
+static void sssp_bfs(void) {
+ avl_node_t *node, *next, *to;
+ edge_t *e;
+ node_t *n;
+ list_t *todo_list;
+ list_node_t *from, *todonext;
+ bool indirect;
+ char *name;
+ char *address, *port;
+ char *envp[8] = {NULL};
+ int i;
+
+ todo_list = list_alloc(NULL);
+
+ /* 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;
+ }
+
+ /* Begin with myself */
+
+ myself->status.visited = true;
+ myself->status.indirect = false;
+ myself->nexthop = myself;
+ myself->prevedge = NULL;
+ myself->via = myself;
+ 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;
+
+ 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)) {
+ continue;
+ }
+
+ // Only update nexthop the first time we visit this node.
+
+ if(!e->to->status.visited) {
+ e->to->nexthop = (n->nexthop == myself) ? e->to : n->nexthop;
+ }
+
+ e->to->status.visited = true;
+ e->to->status.indirect = indirect;
+ e->to->prevedge = e;
+ e->to->via = indirect ? n->via : e->to;
+ e->to->options = e->options;
+
+ 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);