X-Git-Url: https://tinc-vpn.org/git/browse?a=blobdiff_plain;f=src%2Fedge.c;h=15d3150d7d3843642fac10a41f33118fe1565a0f;hb=3a149f7521dfff67e6a790c1a830afc649ae083e;hp=ad6ec02b69e05bfd95cf524d18378e49f1b432c8;hpb=bda16410075a63b147179c15aa75640decf17ec7;p=tinc diff --git a/src/edge.c b/src/edge.c index ad6ec02b..15d3150d 100644 --- a/src/edge.c +++ b/src/edge.c @@ -1,6 +1,6 @@ /* edge.c -- edge tree management - Copyright (C) 2000-2013 Guus Sliepen , + Copyright (C) 2000-2021 Guus Sliepen , 2000-2005 Ivo Timmermans This program is free software; you can redistribute it and/or modify @@ -26,15 +26,8 @@ #include "logger.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); -} - static int edge_weight_compare(const edge_t *a, const edge_t *b) { int result; @@ -53,8 +46,12 @@ static int edge_weight_compare(const edge_t *a, const edge_t *b) { return strcmp(a->to->name, b->to->name); } -void init_edges(void) { - edge_weight_tree = splay_alloc_tree((splay_compare_t) edge_weight_compare, NULL); +splay_tree_t edge_weight_tree = { + .compare = (splay_compare_t) edge_weight_compare, +}; + +static int edge_compare(const edge_t *a, const edge_t *b) { + return strcmp(a->to->name, b->to->name); } splay_tree_t *new_edge_tree(void) { @@ -66,7 +63,7 @@ void free_edge_tree(splay_tree_t *edge_tree) { } void exit_edges(void) { - splay_delete_tree(edge_weight_tree); + splay_empty_tree(&edge_weight_tree); } /* Creation and deletion of connection elements */ @@ -97,7 +94,7 @@ void edge_add(edge_t *e) { e->reverse->reverse = e; } - node = splay_insert(edge_weight_tree, e); + node = splay_insert(&edge_weight_tree, e); if(!node) { logger(DEBUG_ALWAYS, LOG_ERR, "Edge from %s to %s already exists in edge_weight_tree\n", e->from->name, e->to->name); @@ -110,7 +107,7 @@ void edge_del(edge_t *e) { e->reverse->reverse = NULL; } - splay_delete(edge_weight_tree, e); + splay_delete(&edge_weight_tree, e); splay_delete(e->from->edge_tree, e); } @@ -124,7 +121,7 @@ edge_t *lookup_edge(node_t *from, node_t *to) { } bool dump_edges(connection_t *c) { - for splay_each(node_t, n, node_tree) { + for splay_each(node_t, n, &node_tree) { for splay_each(edge_t, e, n->edge_tree) { char *address = sockaddr2hostname(&e->address); char *local_address = sockaddr2hostname(&e->local_address);