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.20 2003/07/06 23:16:28 guus Exp $
31 #include "net.h" /* Don't ask. */
43 avl_tree_t *edge_weight_tree; /* Tree with all edges, sorted on weight */
45 static int edge_compare(edge_t *a, edge_t *b)
47 return strcmp(a->to->name, b->to->name);
50 static int edge_weight_compare(edge_t *a, edge_t *b)
54 result = a->weight - b->weight;
59 result = strcmp(a->from->name, b->from->name);
64 return strcmp(a->to->name, b->to->name);
72 avl_alloc_tree((avl_compare_t) edge_weight_compare, NULL);
75 avl_tree_t *new_edge_tree(void)
79 return avl_alloc_tree((avl_compare_t) edge_compare, NULL);
82 void free_edge_tree(avl_tree_t *edge_tree)
86 avl_delete_tree(edge_tree);
93 avl_delete_tree(edge_weight_tree);
96 /* Creation and deletion of connection elements */
98 edge_t *new_edge(void)
102 return (edge_t *) xmalloc_and_zero(sizeof(edge_t));
105 void free_edge(edge_t *e)
112 void edge_add(edge_t *e)
116 avl_insert(edge_weight_tree, e);
117 avl_insert(e->from->edge_tree, e);
119 e->reverse = lookup_edge(e->to, e->from);
122 e->reverse->reverse = e;
125 void edge_del(edge_t *e)
130 e->reverse->reverse = NULL;
132 avl_delete(e->from->edge_tree, e);
133 avl_delete(edge_weight_tree, e);
136 edge_t *lookup_edge(node_t *from, node_t *to)
145 return avl_search(from->edge_tree, &v);
148 void dump_edges(void)
150 avl_node_t *node, *node2;
157 logger(DEBUG_ALWAYS, LOG_DEBUG, _("Edges:"));
159 for(node = node_tree->head; node; node = node->next) {
160 n = (node_t *) node->data;
161 for(node2 = n->edge_tree->head; node2; node2 = node2->next) {
162 e = (edge_t *) node2->data;
163 address = sockaddr2hostname(&e->address);
164 logger(DEBUG_ALWAYS, LOG_DEBUG, _(" %s to %s at %s options %lx weight %d"),
165 e->from->name, e->to->name, address, e->options, e->weight);
170 logger(DEBUG_ALWAYS, LOG_DEBUG, _("End of edges."));