2 edge.c -- edge tree management
3 Copyright (C) 2000-2002 Guus Sliepen <guus@sliepen.eu.org>,
4 2000-2002 Ivo Timmermans <ivo@o2w.nl>
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 $Id: edge.c,v 1.1.2.14 2002/09/06 12:19:16 guus Exp $
32 #include "net.h" /* Don't ask. */
44 avl_tree_t *edge_weight_tree; /* Tree with all edges, sorted on weight */
46 int edge_compare(edge_t *a, edge_t *b)
48 return strcmp(a->to->name, b->to->name);
51 int edge_weight_compare(edge_t *a, edge_t *b)
55 result = a->weight - b->weight;
60 result = strcmp(a->from->name, b->from->name);
65 return strcmp(a->to->name, b->to->name);
71 edge_weight_tree = avl_alloc_tree((avl_compare_t)edge_weight_compare, NULL);
75 avl_tree_t *new_edge_tree(void)
78 return avl_alloc_tree((avl_compare_t)edge_compare, NULL);
82 void free_edge_tree(avl_tree_t *edge_tree)
85 avl_delete_tree(edge_tree);
92 avl_delete_tree(edge_weight_tree);
96 /* Creation and deletion of connection elements */
98 edge_t *new_edge(void)
102 e = (edge_t *)xmalloc_and_zero(sizeof(*e));
107 void free_edge(edge_t *e)
114 void edge_add(edge_t *e)
117 avl_insert(edge_weight_tree, e);
118 avl_insert(e->from->edge_tree, e);
120 e->reverse = lookup_edge(e->to, e->from);
122 e->reverse->reverse = e;
126 void edge_del(edge_t *e)
130 e->reverse->reverse = NULL;
132 avl_delete(edge_weight_tree, e);
133 avl_delete(e->from->edge_tree, e);
137 edge_t *lookup_edge(node_t *from, node_t *to)
144 return avl_search(from->edge_tree, &v);
147 void dump_edges(void)
149 avl_node_t *node, *node2;
154 syslog(LOG_DEBUG, _("Edges:"));
156 for(node = node_tree->head; node; node = node->next)
158 n = (node_t *)node->data;
159 for(node2 = n->edge_tree->head; node2; node2 = node2->next)
161 e = (edge_t *)node2->data;
162 address = sockaddr2hostname(&e->address);
163 syslog(LOG_DEBUG, _(" %s to %s at %s options %lx weight %d"),
164 e->from->name, e->to->name, address,
165 e->options, e->weight);
170 syslog(LOG_DEBUG, _("End of edges."));