X-Git-Url: http://git.meshlink.io/?p=meshlink;a=blobdiff_plain;f=src%2Fedge.c;h=afe9cfe325ad19bc82d33fe7f9e796fb794285a7;hp=c35af07cfcbc92884ed56e8efaf025c9dfaf7345;hb=963c5055505f2fc117cd5efa06eaa02c9b2bf85d;hpb=c6d2f6c620beae387e8f9fc995ed7c8e8a5bc3dc diff --git a/src/edge.c b/src/edge.c index c35af07c..afe9cfe3 100644 --- a/src/edge.c +++ b/src/edge.c @@ -1,7 +1,6 @@ /* edge.c -- edge tree management - Copyright (C) 2000-2002 Guus Sliepen , - 2000-2002 Ivo Timmermans + Copyright (C) 2014 Guus Sliepen 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,199 +12,104 @@ 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.10 2002/03/27 15:26:43 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 "splay_tree.h" +#include "edge.h" +#include "logger.h" +#include "meshlink_internal.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; - - result = strcmp(a->from.node->name, b->from.node->name); - - if(result) - return result; - else - return strcmp(a->to.node->name, b->to.node->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.node->name, b->from.node->name)) || (result = strcmp(a->to.node->name, b->to.node->name)), result; -} - -*/ + if(result) { + return result; + } -int edge_name_compare(edge_t *a, edge_t *b) -{ - int result; - char *name_a1, *name_a2, *name_b1, *name_b2; + result = strcmp(a->from->name, b->from->name); - if(strcmp(a->from.node->name, a->to.node->name) < 0) - name_a1 = a->from.node->name, name_a2 = a->to.node->name; - else - name_a1 = a->to.node->name, name_a2 = a->from.node->name; + if(result) { + return result; + } - if(strcmp(b->from.node->name, b->to.node->name) < 0) - name_b1 = b->from.node->name, name_b2 = b->to.node->name; - else - name_b1 = b->to.node->name, name_b2 = b->from.node->name; - - result = strcmp(name_a1, name_b1); - - if(result) - return result; - else - return strcmp(name_a2, name_b2); + return strcmp(a->to->name, b->to->name); } -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); +void init_edges(meshlink_handle_t *mesh) { + mesh->edges = splay_alloc_tree((splay_compare_t) edge_weight_compare, NULL); } -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 +splay_tree_t *new_edge_tree(void) { + return splay_alloc_tree((splay_compare_t) edge_compare, (splay_action_t) free_edge); } -avl_tree_t *new_edge_tree(void) -{ -cp - return avl_alloc_tree((avl_compare_t)edge_name_compare, NULL); -cp +void free_edge_tree(splay_tree_t *edge_tree) { + splay_delete_tree(edge_tree); } -void free_edge_tree(avl_tree_t *edge_tree) -{ -cp - avl_delete_tree(edge_tree); -cp -} +void exit_edges(meshlink_handle_t *mesh) { + if(mesh->edges) { + splay_delete_tree(mesh->edges); + } -void exit_edges(void) -{ -cp - avl_delete_tree(edge_tree); -cp + mesh->edges = NULL; } /* 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 xzalloc(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.node->edge_tree, e); - avl_insert(e->to.node->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.node->edge_tree, e); - avl_delete(e->to.node->edge_tree, e); -cp -} +void edge_add(meshlink_handle_t *mesh, edge_t *e) { + splay_insert(mesh->edges, e); + splay_insert(e->from->edge_tree, e); -edge_t *lookup_edge(node_t *from, node_t *to) -{ - edge_t v, *result; -cp - v.from.node = from; - v.to.node = to; + e->reverse = lookup_edge(e->to, e->from); - result = avl_search(edge_tree, &v); + if(e->reverse) { + e->reverse->reverse = e; + } +} - if(result) - return result; -cp - v.from.node = to; - v.to.node = from; +void edge_del(meshlink_handle_t *mesh, edge_t *e) { + if(e->reverse) { + e->reverse->reverse = NULL; + } - return avl_search(edge_tree, &v); + splay_delete(mesh->edges, e); + splay_delete(e->from->edge_tree, e); } -void dump_edges(void) -{ - avl_node_t *node; - edge_t *e; - char *from_udp, *to_udp; -cp - syslog(LOG_DEBUG, _("Edges:")); - - for(node = edge_tree->head; node; node = node->next) - { - e = (edge_t *)node->data; - from_udp = sockaddr2hostname(&e->from.udpaddress); - to_udp = sockaddr2hostname(&e->to.udpaddress); - syslog(LOG_DEBUG, _(" %s at %s - %s at %s options %lx weight %d"), - e->from.node->name, from_udp, - e->to.node->name, to_udp, - e->options, e->weight); - free(from_udp); - free(to_udp); - } - - syslog(LOG_DEBUG, _("End of edges.")); -cp +edge_t *lookup_edge(node_t *from, node_t *to) { + assert(from); + assert(to); + + edge_t v; + + v.from = from; + v.to = to; + + return splay_search(from->edge_tree, &v); }