X-Git-Url: http://git.meshlink.io/?a=blobdiff_plain;f=src%2Fedge.c;h=afe9cfe325ad19bc82d33fe7f9e796fb794285a7;hb=be83b0af60449c7b35d17d97f2e6dc12f611e831;hp=aee1be0fd7a5fa78c919446f9ce4630baf08b84f;hpb=66067cc9c1347fb2de35660d531fdd4be8aede6a;p=meshlink diff --git a/src/edge.c b/src/edge.c index aee1be0f..afe9cfe3 100644 --- a/src/edge.c +++ b/src/edge.c @@ -1,7 +1,6 @@ /* edge.c -- edge tree management - Copyright (C) 2000,2001 Guus Sliepen , - 2000,2001 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,167 +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.2 2001/10/28 10:16:18 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 */ +static int edge_compare(const edge_t *a, const edge_t *b) { + return strcmp(a->to->name, b->to->name); +} + +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; - result = strcmp(a->from->name, b->from->name); - - if(result) - return result; - else - return strcmp(a->to->name, b->to->name); -} + if(result) { + return result; + } -/* Evil edge_compare() from a parallel universe ;) + result = strcmp(a->from->name, b->from->name); -int edge_compare(edge_t *a, edge_t *b) -{ - int result; + if(result) { + return result; + } - return (result = strcmp(a->from->name, b->from->name)) || (result = strcmp(a->to->name, b->to->name)), result; + return strcmp(a->to->name, b->to->name); } -*/ +void init_edges(meshlink_handle_t *mesh) { + mesh->edges = splay_alloc_tree((splay_compare_t) edge_weight_compare, NULL); +} -int edge_weight_compare(edge_t *a, edge_t *b) -{ - int result; - char *name_a1, *name_a2, *name_b1, *name_b2; - - - result = a->weight - b->weight; - - if(result) - return result; - - 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); +splay_tree_t *new_edge_tree(void) { + return splay_alloc_tree((splay_compare_t) edge_compare, (splay_action_t) free_edge); } -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 free_edge_tree(splay_tree_t *edge_tree) { + splay_delete_tree(edge_tree); } -void exit_edges(void) -{ -cp - avl_delete_tree(edge_tree); -cp +void exit_edges(meshlink_handle_t *mesh) { + if(mesh->edges) { + splay_delete_tree(mesh->edges); + } + + mesh->edges = NULL; } /* Creation and deletion of connection elements */ -edge_t *new_edge(void) -{ -cp - edge_t *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); -cp + free(e); } -void edge_del(edge_t *e) -{ -cp - avl_delete(edge_tree, e); - avl_delete(edge_weight_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 = from; - v.to = 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 = to; - v.to = 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; -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 +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); }