2 edge.c -- edge tree management
3 Copyright (C) 2000-2006 Guus Sliepen <guus@tinc-vpn.org>,
4 2000-2005 Ivo Timmermans
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 along
17 with this program; if not, write to the Free Software Foundation, Inc.,
18 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
31 avl_tree_t *edge_weight_tree; /* Tree with all edges, sorted on weight */
33 static int edge_compare(const edge_t *a, const edge_t *b) {
34 return strcmp(a->to->name, b->to->name);
37 static int edge_weight_compare(const edge_t *a, const edge_t *b) {
40 result = a->weight - b->weight;
46 result = strcmp(a->from->name, b->from->name);
52 return strcmp(a->to->name, b->to->name);
55 void init_edges(void) {
56 edge_weight_tree = avl_alloc_tree((avl_compare_t) edge_weight_compare, NULL);
59 avl_tree_t *new_edge_tree(void) {
60 return avl_alloc_tree((avl_compare_t) edge_compare, (avl_action_t) free_edge);
63 void free_edge_tree(avl_tree_t *edge_tree) {
64 avl_delete_tree(edge_tree);
67 void exit_edges(void) {
68 avl_delete_tree(edge_weight_tree);
71 /* Creation and deletion of connection elements */
73 edge_t *new_edge(void) {
74 return xmalloc_and_zero(sizeof(edge_t));
77 void free_edge(edge_t *e) {
78 sockaddrfree(&e->address);
83 void edge_add(edge_t *e) {
84 avl_insert(edge_weight_tree, e);
85 avl_insert(e->from->edge_tree, e);
87 e->reverse = lookup_edge(e->to, e->from);
90 e->reverse->reverse = e;
94 void edge_del(edge_t *e) {
96 e->reverse->reverse = NULL;
99 avl_delete(edge_weight_tree, e);
100 avl_delete(e->from->edge_tree, e);
103 edge_t *lookup_edge(node_t *from, node_t *to) {
109 return avl_search(from->edge_tree, &v);
112 void dump_edges(void) {
113 avl_node_t *node, *node2;
118 logger(LOG_DEBUG, "Edges:");
120 for(node = node_tree->head; node; node = node->next) {
123 for(node2 = n->edge_tree->head; node2; node2 = node2->next) {
125 address = sockaddr2hostname(&e->address);
126 logger(LOG_DEBUG, " %s to %s at %s options %x weight %d",
127 e->from->name, e->to->name, address, e->options, e->weight);
132 logger(LOG_DEBUG, "End of edges.");