2 edge.c -- edge tree management
3 Copyright (C) 2000,2001 Guus Sliepen <guus@sliepen.warande.net>,
4 2000,2001 Ivo Timmermans <itimmermans@bigfoot.com>
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.2 2001/10/28 10:16:18 guus Exp $
32 #include "net.h" /* Don't ask. */
42 avl_tree_t *edge_tree; /* Tree with all known edges (replaces active_tree) */
43 avl_tree_t *edge_weight_tree; /* Tree with all edges, sorted on weight */
45 int edge_compare(edge_t *a, edge_t *b)
49 result = strcmp(a->from->name, b->from->name);
54 return strcmp(a->to->name, b->to->name);
57 /* Evil edge_compare() from a parallel universe ;)
59 int edge_compare(edge_t *a, edge_t *b)
63 return (result = strcmp(a->from->name, b->from->name)) || (result = strcmp(a->to->name, b->to->name)), result;
68 int edge_weight_compare(edge_t *a, edge_t *b)
71 char *name_a1, *name_a2, *name_b1, *name_b2;
74 result = a->weight - b->weight;
79 if(strcmp(a->from->name, a->to->name) < 0)
80 name_a1 = a->from->name, name_a2 = a->to->name;
82 name_a1 = a->to->name, name_a2 = a->from->name;
84 if(strcmp(b->from->name, b->to->name) < 0)
85 name_b1 = b->from->name, name_b2 = b->to->name;
87 name_b1 = b->to->name, name_b2 = b->from->name;
89 result = strcmp(name_a1, name_b1);
94 return strcmp(name_a2, name_b2);
100 edge_tree = avl_alloc_tree((avl_compare_t)edge_compare, NULL);
101 edge_weight_tree = avl_alloc_tree((avl_compare_t)edge_weight_compare, NULL);
105 void exit_edges(void)
108 avl_delete_tree(edge_tree);
112 /* Creation and deletion of connection elements */
114 edge_t *new_edge(void)
117 edge_t *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);
137 void edge_del(edge_t *e)
140 avl_delete(edge_tree, e);
141 avl_delete(edge_weight_tree, e);
145 edge_t *lookup_edge(node_t *from, node_t *to)
152 result = avl_search(edge_tree, &v);
160 return avl_search(edge_tree, &v);
163 void dump_edges(void)
168 syslog(LOG_DEBUG, _("Edges:"));
170 for(node = edge_tree->head; node; node = node->next)
172 e = (edge_t *)node->data;
173 syslog(LOG_DEBUG, _(" %s - %s options %ld"),
174 e->from->name, e->to->name, e->options);
177 syslog(LOG_DEBUG, _("End of edges."));