X-Git-Url: http://git.meshlink.io/?a=blobdiff_plain;f=src%2Fedge.c;h=d3dbf78e90200c9c5994dfccf0adf9ab65f4701a;hb=1073af306d1b5e6ba20d243350c7afcc6f7d68e4;hp=4fc36e40d4aa7b270e8513c9b213f5084cadc6ac;hpb=d917c8cb6b69475d568ccbe82389b9f2b3eb5e80;p=meshlink diff --git a/src/edge.c b/src/edge.c index 4fc36e40..d3dbf78e 100644 --- a/src/edge.c +++ b/src/edge.c @@ -1,7 +1,6 @@ /* edge.c -- edge tree management - Copyright (C) 2000-2006 Guus Sliepen , - 2000-2005 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 @@ -21,16 +20,14 @@ #include "system.h" #include "splay_tree.h" -#include "control_common.h" #include "edge.h" #include "logger.h" +#include "meshlink_internal.h" #include "netutl.h" #include "node.h" #include "utils.h" #include "xalloc.h" -splay_tree_t *edge_weight_tree; - static int edge_compare(const edge_t *a, const edge_t *b) { return strcmp(a->to->name, b->to->name); } @@ -52,7 +49,7 @@ static int edge_weight_compare(const edge_t *a, const edge_t *b) { } void init_edges(void) { - edge_weight_tree = splay_alloc_tree((splay_compare_t) edge_weight_compare, NULL); + mesh->edges = splay_alloc_tree((splay_compare_t) edge_weight_compare, NULL); } splay_tree_t *new_edge_tree(void) { @@ -64,13 +61,13 @@ void free_edge_tree(splay_tree_t *edge_tree) { } void exit_edges(void) { - splay_delete_tree(edge_weight_tree); + splay_delete_tree(mesh->edges); } /* Creation and deletion of connection elements */ edge_t *new_edge(void) { - return xmalloc_and_zero(sizeof(edge_t)); + return xzalloc(sizeof(edge_t)); } void free_edge(edge_t *e) { @@ -80,7 +77,7 @@ void free_edge(edge_t *e) { } void edge_add(edge_t *e) { - splay_insert(edge_weight_tree, e); + splay_insert(mesh->edges, e); splay_insert(e->from->edge_tree, e); e->reverse = lookup_edge(e->to, e->from); @@ -93,7 +90,7 @@ void edge_del(edge_t *e) { if(e->reverse) e->reverse->reverse = NULL; - splay_delete(edge_weight_tree, e); + splay_delete(mesh->edges, e); splay_delete(e->from->edge_tree, e); } @@ -105,18 +102,3 @@ edge_t *lookup_edge(node_t *from, node_t *to) { return splay_search(from->edge_tree, &v); } - -bool dump_edges(connection_t *c) { - for splay_each(node_t, n, node_tree) { - for splay_each(edge_t, e, n->edge_tree) { - char *address = sockaddr2hostname(&e->address); - send_request(c, "%d %d %s %s %s %x %d", - CONTROL, REQ_DUMP_EDGES, - e->from->name, e->to->name, address, - e->options, e->weight); - free(address); - } - } - - return send_request(c, "%d %d", CONTROL, REQ_DUMP_EDGES); -}