/*
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
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.4 2001/10/30 12:59:12 guus Exp $
+ $Id: edge.c,v 1.1.2.18 2002/09/10 22:12:33 guus Exp $
*/
#include "config.h"
#include <avl_tree.h>
#include <list.h>
-#include "net.h" /* Don't ask. */
+#include "net.h" /* Don't ask. */
#include "netutl.h"
-#include "config.h"
#include "conf.h"
#include <utils.h>
#include "subnet.h"
+#include "edge.h"
+#include "node.h"
#include "xalloc.h"
#include "system.h"
-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 */
+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);
-
- if(result)
- return result;
- else
- return strcmp(a->to->name, b->to->name);
+ return strcmp(a->to->name, b->to->name);
}
-/* Evil edge_compare() from a parallel universe ;)
-
-int edge_compare(edge_t *a, edge_t *b)
+int edge_weight_compare(edge_t *a, edge_t *b)
{
- int result;
+ int result;
- return (result = strcmp(a->from->name, b->from->name)) || (result = strcmp(a->to->name, b->to->name)), result;
-}
+ result = a->weight - b->weight;
-*/
+ if(result)
+ return result;
-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->name, a->to->name) < 0)
- name_a1 = a->from->name, name_a2 = a->to->name;
- else
- name_a1 = a->to->name, name_a2 = a->from->name;
-
- if(strcmp(b->from->name, b->to->name) < 0)
- name_b1 = b->from->name, name_b2 = b->to->name;
- else
- name_b1 = b->to->name, name_b2 = b->from->name;
-
- result = strcmp(name_a1, name_b1);
-
- if(result)
- return result;
- else
- return strcmp(name_a2, name_b2);
-}
+ result = strcmp(a->from->name, b->from->name);
-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);
+ if(result)
+ return result;
+
+ return strcmp(a->to->name, b->to->name);
}
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
+ cp();
+
+ edge_weight_tree =
+ avl_alloc_tree((avl_compare_t) edge_weight_compare, NULL);
}
avl_tree_t *new_edge_tree(void)
{
-cp
- return avl_alloc_tree((avl_compare_t)edge_name_compare, NULL);
-cp
+ cp();
+
+ return avl_alloc_tree((avl_compare_t) edge_compare, NULL);
}
void free_edge_tree(avl_tree_t *edge_tree)
{
-cp
- avl_delete_tree(edge_tree);
-cp
+ cp();
+
+ avl_delete_tree(edge_tree);
}
void exit_edges(void)
{
-cp
- avl_delete_tree(edge_tree);
-cp
+ cp();
+
+ avl_delete_tree(edge_weight_tree);
}
/* Creation and deletion of connection elements */
edge_t *new_edge(void)
{
- edge_t *e;
-cp
- e = (edge_t *)xmalloc_and_zero(sizeof(*e));
-cp
- return e;
+ cp();
+
+ return (edge_t *) xmalloc_and_zero(sizeof(edge_t));
}
void free_edge(edge_t *e)
{
-cp
- free(e);
-cp
+ cp();
+
+ free(e);
}
void edge_add(edge_t *e)
{
-cp
- avl_insert(edge_tree, e);
- avl_insert(edge_weight_tree, e);
- avl_insert(e->from->edge_tree, e);
- avl_insert(e->to->edge_tree, e);
-cp
+ cp();
+
+ avl_insert(edge_weight_tree, e);
+ avl_insert(e->from->edge_tree, e);
+
+ e->reverse = lookup_edge(e->to, e->from);
+
+ if(e->reverse)
+ e->reverse->reverse = e;
}
void edge_del(edge_t *e)
{
-cp
- avl_delete(edge_tree, e);
- avl_delete(edge_weight_tree, e);
- avl_delete(e->from->edge_tree, e);
- avl_delete(e->to->edge_tree, e);
-cp
+ cp();
+
+ if(e->reverse)
+ e->reverse->reverse = NULL;
+
+ avl_delete(e->from->edge_tree, e);
+ avl_delete(edge_weight_tree, e);
}
edge_t *lookup_edge(node_t *from, node_t *to)
{
- edge_t v, *result;
-cp
- v.from = from;
- v.to = to;
+ edge_t v;
- result = avl_search(edge_tree, &v);
+ cp();
- if(result)
- return result;
-cp
- v.from = to;
- v.to = from;
+ v.from = from;
+ v.to = to;
- return avl_search(edge_tree, &v);
+ return avl_search(from->edge_tree, &v);
}
void dump_edges(void)
{
- avl_node_t *node;
- edge_t *e;
-cp
- syslog(LOG_DEBUG, _("Edges:"));
-
- for(node = edge_tree->head; node; node = node->next)
- {
- e = (edge_t *)node->data;
- syslog(LOG_DEBUG, _(" %s - %s options %ld weight %d"),
- e->from->name, e->to->name, e->options, e->weight);
- }
-
- syslog(LOG_DEBUG, _("End of edges."));
-cp
+ avl_node_t *node, *node2;
+ node_t *n;
+ edge_t *e;
+ char *address;
+
+ cp();
+
+ syslog(LOG_DEBUG, _("Edges:"));
+
+ for(node = node_tree->head; node; node = node->next) {
+ n = (node_t *) node->data;
+ for(node2 = n->edge_tree->head; node2; node2 = node2->next) {
+ e = (edge_t *) node2->data;
+ address = sockaddr2hostname(&e->address);
+ syslog(LOG_DEBUG, _(" %s to %s at %s options %lx weight %d"),
+ e->from->name, e->to->name, address, e->options, e->weight);
+ free(address);
+ }
+ }
+
+ syslog(LOG_DEBUG, _("End of edges."));
}
projects / tinc / blobdiff