/*
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.12 2002/09/04 13:48:51 guus Exp $
*/
#include "config.h"
#include "conf.h"
#include <utils.h>
#include "subnet.h"
+#include "edge.h"
+#include "node.h"
#include "xalloc.h"
#include "system.h"
int result;
result = strcmp(a->from->name, b->from->name);
-
+
if(result)
return result;
else
*/
-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);
-}
-
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);
+ return edge_compare(a, b);
}
void init_edges(void)
avl_tree_t *new_edge_tree(void)
{
cp
- return avl_alloc_tree((avl_compare_t)edge_name_compare, NULL);
+ return avl_alloc_tree((avl_compare_t)edge_compare, NULL);
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
+ e->reverse = lookup_edge(e->to, e->from);
+ if(e->reverse)
+ e->reverse->reverse = e;
cp
}
void edge_del(edge_t *e)
{
+cp
+ if(e->reverse)
+ e->reverse->reverse = NULL;
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
}
edge_t *lookup_edge(node_t *from, node_t *to)
{
- edge_t v, *result;
+ edge_t v;
cp
v.from = from;
v.to = to;
- result = avl_search(edge_tree, &v);
-
- if(result)
- return result;
-cp
- v.from = to;
- v.to = from;
-
return avl_search(edge_tree, &v);
}
{
avl_node_t *node;
edge_t *e;
+ char *address;
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);
+ 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."));
cp
}