A reachable node is always more preferable to an unreachable one...

[tinc] / src / edge.c

diff --git a/src/edge.c b/src/edge.c
index 24c67c3..eb664d2 100644 (file)
--- a/src/edge.c
+++ b/src/edge.c
@@ -1,7 +1,7 @@
 /*
     edge.c -- edge tree management
-    Copyright (C) 2000,2001 Guus Sliepen <guus@sliepen.warande.net>,
-                  2000,2001 Ivo Timmermans <itimmermans@bigfoot.com>
+    Copyright (C) 2000-2002 Guus Sliepen <guus@sliepen.eu.org>,
+                  2000-2002 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
@@ -17,7 +17,7 @@
     along with this program; if not, write to the Free Software
     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 
-    $Id: edge.c,v 1.1.2.1 2001/10/28 08:41:19 guus Exp $
+    $Id: edge.c,v 1.1.2.11 2002/06/21 10:11:12 guus Exp $
 */
 
 #include "config.h"
@@ -39,18 +39,19 @@
 #include "xalloc.h"
 #include "system.h"
 
-avl_tree_t *edge_tree;        /* Tree with all known vertices (replaces active_tree) */
+avl_tree_t *edge_tree;        /* Tree with all known edges (replaces active_tree) */
+avl_tree_t *edge_weight_tree; /* Tree with all edges, sorted on weight */
 
 int edge_compare(edge_t *a, edge_t *b)
 {
   int result;
 
-  result = strcmp(a->from->name, b->from->name);
-  
+  result = strcmp(a->from.node->name, b->from.node->name);
+
   if(result)
     return result;
   else
-    return strcmp(a->to->name, b->to->name);
+    return strcmp(a->to.node->name, b->to.node->name);
 }
 
 /* Evil edge_compare() from a parallel universe ;)
@@ -59,19 +60,69 @@ int edge_compare(edge_t *a, edge_t *b)
 {
   int result;
 
-  return (result = strcmp(a->from->name, b->from->name)) || (result = strcmp(a->to->name, b->to->name)), result;
+  return (result = strcmp(a->from.node->name, b->from.node->name)) || (result = strcmp(a->to.node->name, b->to.node->name)), result;
 }
 
 */
 
-void init_vertices(void)
+int edge_name_compare(edge_t *a, edge_t *b)
+{
+  int result;
+  char *name_a1, *name_a2, *name_b1, *name_b2;
+
+  if(strcmp(a->from.node->name, a->to.node->name) < 0)
+    name_a1 = a->from.node->name, name_a2 = a->to.node->name;
+  else
+    name_a1 = a->to.node->name, name_a2 = a->from.node->name;
+
+  if(strcmp(b->from.node->name, b->to.node->name) < 0)
+    name_b1 = b->from.node->name, name_b2 = b->to.node->name;
+  else
+    name_b1 = b->to.node->name, name_b2 = b->from.node->name;
+
+  result = strcmp(name_a1, name_b1);
+
+  if(result)
+    return result;
+  else
+    return strcmp(name_a2, name_b2);
+}
+
+int edge_weight_compare(edge_t *a, edge_t *b)
+{
+  int result;
+
+  result = a->weight - b->weight;
+
+  if(result)
+    return result;
+  else
+    return edge_name_compare(a, b);
+}
+
+void init_edges(void)
 {
 cp
   edge_tree = avl_alloc_tree((avl_compare_t)edge_compare, NULL);
+  edge_weight_tree = avl_alloc_tree((avl_compare_t)edge_weight_compare, NULL);
 cp
 }
 
-void exit_vertices(void)
+avl_tree_t *new_edge_tree(void)
+{
+cp
+  return avl_alloc_tree((avl_compare_t)edge_name_compare, NULL);
+cp
+}
+
+void free_edge_tree(avl_tree_t *edge_tree)
+{
+cp
+  avl_delete_tree(edge_tree);
+cp
+}
+
+void exit_edges(void)
 {
 cp
   avl_delete_tree(edge_tree);
@@ -82,30 +133,37 @@ cp
 
 edge_t *new_edge(void)
 {
+  edge_t *e;
 cp
-  edge_t *v = (edge_t *)xmalloc_and_zero(sizeof(*v));
+  e = (edge_t *)xmalloc_and_zero(sizeof(*e));
 cp
-  return v;
+  return e;
 }
 
-void free_edge(edge_t *v)
+void free_edge(edge_t *e)
 {
 cp
-  free(v);
+  free(e);
 cp
 }
 
-void edge_add(edge_t *v)
+void edge_add(edge_t *e)
 {
 cp
-  avl_insert(edge_tree, v);
+  avl_insert(edge_tree, e);
+  avl_insert(edge_weight_tree, e);
+  avl_insert(e->from.node->edge_tree, e);
+  avl_insert(e->to.node->edge_tree, e);
 cp
 }
 
-void edge_del(edge_t *v)
+void edge_del(edge_t *e)
 {
 cp
-  avl_delete(edge_tree, v);
+  avl_delete(edge_tree, e);
+  avl_delete(edge_weight_tree, e);
+  avl_delete(e->from.node->edge_tree, e);
+  avl_delete(e->to.node->edge_tree, e);
 cp
 }
 
@@ -113,34 +171,41 @@ edge_t *lookup_edge(node_t *from, node_t *to)
 {
   edge_t v, *result;
 cp
-  v.from = from;
-  v.to = to;
+  v.from.node = from;
+  v.to.node = to;
 
   result = avl_search(edge_tree, &v);
 
   if(result)
     return result;
 cp
-  v.from = to;
-  v.to = from;
+  v.from.node = to;
+  v.to.node = from;
 
   return avl_search(edge_tree, &v);
 }
 
-void dump_vertices(void)
+void dump_edges(void)
 {
   avl_node_t *node;
-  edge_t *v;
+  edge_t *e;
+  char *from_udp, *to_udp;
 cp
-  syslog(LOG_DEBUG, _("Vertices:"));
+  syslog(LOG_DEBUG, _("Edges:"));
 
   for(node = edge_tree->head; node; node = node->next)
     {
-      v = (edge_t *)node->data;
-      syslog(LOG_DEBUG, _(" %s - %s options %ld"),
-             v->from->name, v->to->name, v->options);
+      e = (edge_t *)node->data;
+      from_udp = sockaddr2hostname(&e->from.udpaddress);
+      to_udp = sockaddr2hostname(&e->to.udpaddress);
+      syslog(LOG_DEBUG, _(" %s at %s - %s at %s options %lx weight %d"),
+             e->from.node->name, from_udp,
+            e->to.node->name, to_udp,
+            e->options, e->weight);
+      free(from_udp);
+      free(to_udp);    
     }
-    
-  syslog(LOG_DEBUG, _("End of vertices."));
+
+  syslog(LOG_DEBUG, _("End of edges."));
 cp
 }