X-Git-Url: https://www.tinc-vpn.org/git/browse?p=tinc;a=blobdiff_plain;f=src%2Fedge.c;h=c30d6cc27a67dc4b016516bbedb4a902317fcc8c;hp=92abbb3c41047892c21f78921c9460182d97009f;hb=3fae14fae5a347823679ef694ab630b4991a201d;hpb=b6298e2c082035b8238ea08673ced15d0fb7b89a diff --git a/src/edge.c b/src/edge.c index 92abbb3c..c30d6cc2 100644 --- a/src/edge.c +++ b/src/edge.c @@ -1,7 +1,7 @@ /* edge.c -- edge tree management - Copyright (C) 2000,2001 Guus Sliepen , - 2000,2001 Ivo Timmermans + Copyright (C) 2000-2006 Guus Sliepen , + 2000-2005 Ivo Timmermans This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -13,192 +13,121 @@ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. - You should have received a copy of the GNU General Public License - along with this program; if not, write to the Free Software - Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. - - $Id: edge.c,v 1.1.2.3 2001/10/28 22:42:49 guus Exp $ + You should have received a copy of the GNU General Public License along + with this program; if not, write to the Free Software Foundation, Inc., + 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */ -#include "config.h" - -#include -#include -#include - -#include -#include +#include "system.h" -#include "net.h" /* Don't ask. */ +#include "avl_tree.h" +#include "edge.h" +#include "logger.h" #include "netutl.h" -#include "config.h" -#include "conf.h" -#include -#include "subnet.h" - +#include "node.h" +#include "utils.h" #include "xalloc.h" -#include "system.h" - -avl_tree_t *edge_tree; /* Tree with all known edges (replaces active_tree) */ -avl_tree_t *edge_weight_tree; /* Tree with all edges, sorted on weight */ -int edge_compare(edge_t *a, edge_t *b) -{ - int result; +avl_tree_t *edge_weight_tree; /* Tree with all edges, sorted on weight */ - result = strcmp(a->from->name, b->from->name); - - if(result) - return result; - else - return strcmp(a->to->name, b->to->name); +static int edge_compare(const edge_t *a, const edge_t *b) { + return strcmp(a->to->name, b->to->name); } -/* Evil edge_compare() from a parallel universe ;) +static int edge_weight_compare(const edge_t *a, const edge_t *b) { + int result; -int edge_compare(edge_t *a, edge_t *b) -{ - int result; + result = a->weight - b->weight; - return (result = strcmp(a->from->name, b->from->name)) || (result = strcmp(a->to->name, b->to->name)), result; -} + if(result) { + return result; + } -*/ + result = strcmp(a->from->name, b->from->name); -int edge_name_compare(edge_t *a, edge_t *b) -{ - int result; - char *name_a1, *name_a2, *name_b1, *name_b2; - - if(strcmp(a->from->name, a->to->name) < 0) - name_a1 = a->from->name, name_a2 = a->to->name; - else - name_a1 = a->to->name, name_a2 = a->from->name; - - if(strcmp(b->from->name, b->to->name) < 0) - name_b1 = b->from->name, name_b2 = b->to->name; - else - name_b1 = b->to->name, name_b2 = b->from->name; - - result = strcmp(name_a1, name_b1); - - if(result) - return result; - else - return strcmp(name_a2, name_b2); -} + if(result) { + return result; + } -int edge_weight_compare(edge_t *a, edge_t *b) -{ - int result; - - result = a->weight - b->weight; - - if(result) - return result; - else - return edge_name_compare(a, b); + return strcmp(a->to->name, b->to->name); } -void init_edges(void) -{ -cp - edge_tree = avl_alloc_tree((avl_compare_t)edge_compare, NULL); - edge_weight_tree = avl_alloc_tree((avl_compare_t)edge_weight_compare, NULL); -cp +void init_edges(void) { + edge_weight_tree = avl_alloc_tree((avl_compare_t) edge_weight_compare, NULL); } -avl_tree_t *new_edge_tree(void) -{ -cp - edge_tree = avl_alloc_tree((avl_compare_t)edge_name_compare, NULL); -cp +avl_tree_t *new_edge_tree(void) { + return avl_alloc_tree((avl_compare_t) edge_compare, (avl_action_t) free_edge); } -void free_edge_tree(avl_tree_t *edge_tree) -{ -cp - avl_delete_tree(edge_tree); -cp +void free_edge_tree(avl_tree_t *edge_tree) { + avl_delete_tree(edge_tree); } -void exit_edges(void) -{ -cp - avl_delete_tree(edge_tree); -cp +void exit_edges(void) { + avl_delete_tree(edge_weight_tree); } /* Creation and deletion of connection elements */ -edge_t *new_edge(void) -{ - edge_t *e; -cp - e = (edge_t *)xmalloc_and_zero(sizeof(*e)); -cp - return e; +edge_t *new_edge(void) { + return xmalloc_and_zero(sizeof(edge_t)); } -void free_edge(edge_t *e) -{ -cp - free(e); -cp -} +void free_edge(edge_t *e) { + sockaddrfree(&e->address); -void edge_add(edge_t *e) -{ -cp - avl_insert(edge_tree, e); - avl_insert(edge_weight_tree, e); - avl_insert(e->from->edge_tree, e); - avl_insert(e->to->edge_tree, e); -cp + free(e); } -void edge_del(edge_t *e) -{ -cp - avl_delete(edge_tree, e); - avl_delete(edge_weight_tree, e); - avl_delete(e->from->edge_tree, e); - avl_delete(e->to->edge_tree, e); -cp +void edge_add(edge_t *e) { + avl_insert(edge_weight_tree, e); + avl_insert(e->from->edge_tree, e); + + e->reverse = lookup_edge(e->to, e->from); + + if(e->reverse) { + e->reverse->reverse = e; + } } -edge_t *lookup_edge(node_t *from, node_t *to) -{ - edge_t v, *result; -cp - v.from = from; - v.to = to; +void edge_del(edge_t *e) { + if(e->reverse) { + e->reverse->reverse = NULL; + } + + avl_delete(edge_weight_tree, e); + avl_delete(e->from->edge_tree, e); +} - result = avl_search(edge_tree, &v); +edge_t *lookup_edge(node_t *from, node_t *to) { + edge_t v; - if(result) - return result; -cp - v.from = to; - v.to = from; + v.from = from; + v.to = to; - return avl_search(edge_tree, &v); + return avl_search(from->edge_tree, &v); } -void dump_edges(void) -{ - avl_node_t *node; - edge_t *e; -cp - syslog(LOG_DEBUG, _("Edges:")); - - for(node = edge_tree->head; node; node = node->next) - { - e = (edge_t *)node->data; - syslog(LOG_DEBUG, _(" %s - %s options %ld"), - e->from->name, e->to->name, e->options); - } - - syslog(LOG_DEBUG, _("End of edges.")); -cp +void dump_edges(void) { + avl_node_t *node, *node2; + node_t *n; + edge_t *e; + char *address; + + logger(LOG_DEBUG, "Edges:"); + + for(node = node_tree->head; node; node = node->next) { + n = node->data; + + for(node2 = n->edge_tree->head; node2; node2 = node2->next) { + e = node2->data; + address = sockaddr2hostname(&e->address); + logger(LOG_DEBUG, " %s to %s at %s options %x weight %d", + e->from->name, e->to->name, address, e->options, e->weight); + free(address); + } + } + + logger(LOG_DEBUG, "End of edges."); }