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.12 2002/09/04 13:48:51 guus Exp $
32 #include "net.h" /* Don't ask. */
44 avl_tree_t *edge_tree; /* Tree with all known edges (replaces active_tree) */
45 avl_tree_t *edge_weight_tree; /* Tree with all edges, sorted on weight */
47 int edge_compare(edge_t *a, edge_t *b)
51 result = strcmp(a->from->name, b->from->name);
56 return strcmp(a->to->name, b->to->name);
59 /* Evil edge_compare() from a parallel universe ;)
61 int edge_compare(edge_t *a, edge_t *b)
65 return (result = strcmp(a->from->name, b->from->name)) || (result = strcmp(a->to->name, b->to->name)), result;
70 int edge_weight_compare(edge_t *a, edge_t *b)
74 result = a->weight - b->weight;
79 return edge_compare(a, b);
85 edge_tree = avl_alloc_tree((avl_compare_t)edge_compare, NULL);
86 edge_weight_tree = avl_alloc_tree((avl_compare_t)edge_weight_compare, NULL);
90 avl_tree_t *new_edge_tree(void)
93 return avl_alloc_tree((avl_compare_t)edge_compare, NULL);
97 void free_edge_tree(avl_tree_t *edge_tree)
100 avl_delete_tree(edge_tree);
104 void exit_edges(void)
107 avl_delete_tree(edge_tree);
111 /* Creation and deletion of connection elements */
113 edge_t *new_edge(void)
117 e = (edge_t *)xmalloc_and_zero(sizeof(*e));
122 void free_edge(edge_t *e)
129 void edge_add(edge_t *e)
132 avl_insert(edge_tree, e);
133 avl_insert(edge_weight_tree, e);
134 avl_insert(e->from->edge_tree, e);
136 e->reverse = lookup_edge(e->to, e->from);
138 e->reverse->reverse = e;
142 void edge_del(edge_t *e)
146 e->reverse->reverse = NULL;
148 avl_delete(edge_tree, e);
149 avl_delete(edge_weight_tree, e);
150 avl_delete(e->from->edge_tree, e);
154 edge_t *lookup_edge(node_t *from, node_t *to)
161 return avl_search(edge_tree, &v);
164 void dump_edges(void)
170 syslog(LOG_DEBUG, _("Edges:"));
172 for(node = edge_tree->head; node; node = node->next)
174 e = (edge_t *)node->data;
175 address = sockaddr2hostname(&e->address);
176 syslog(LOG_DEBUG, _(" %s to %s at %s options %lx weight %d"),
177 e->from->name, e->to->name, address,
178 e->options, e->weight);
182 syslog(LOG_DEBUG, _("End of edges."));