X-Git-Url: http://git.meshlink.io/?a=blobdiff_plain;f=src%2Fnode.c;h=b8caed6c7e06ca182f671fd046f8be4d44d76611;hb=529b8fab8c21e7ae5af91d742ff202eab38e51f3;hp=53e520e92f8d4980ac5d073f9601e409738fb2fc;hpb=82e383710980534d38bb9a8ef22f20677cd85861;p=meshlink diff --git a/src/node.c b/src/node.c index 53e520e9..b8caed6c 100644 --- a/src/node.c +++ b/src/node.c @@ -1,7 +1,6 @@ /* node.c -- node tree management - Copyright (C) 2001 Guus Sliepen , - 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,133 +12,164 @@ 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: node.c,v 1.1.2.2 2001/10/27 12:13:17 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 "node.h" -#include "net.h" -#include -#include - #include "system.h" -avl_tree_t *node_tree; /* Known nodes, sorted by name */ -avl_tree_t *node_udp_tree; /* Known nodes, sorted by address and port */ +#include "hash.h" +#include "logger.h" +#include "meshlink_internal.h" +#include "net.h" +#include "netutl.h" +#include "node.h" +#include "splay_tree.h" +#include "utils.h" +#include "xalloc.h" -int node_compare(node_t *a, node_t *b) -{ - return strcmp(a->name, b->name); +static int node_compare(const node_t *a, const node_t *b) { + return strcmp(a->name, b->name); } -int node_udp_compare(connection_t *a, connection_t *b) -{ - if(a->address < b->address) - return -1; - else if (a->address > b->address) - return 1; - else - return a->port - b->port; +void init_nodes(meshlink_handle_t *mesh) { + mesh->nodes = splay_alloc_tree((splay_compare_t) node_compare, (splay_action_t) free_node); + mesh->node_udp_cache = hash_alloc(0x100, sizeof(sockaddr_t)); } -void init_nodes(void) -{ -cp - node_tree = avl_alloc_tree((avl_compare_t)node_compare, NULL); - node_udp_tree = avl_alloc_tree((avl_compare_t)node_udp_compare, NULL); -cp +void exit_nodes(meshlink_handle_t *mesh) { + if(mesh->node_udp_cache) { + hash_free(mesh->node_udp_cache); + } + + if(mesh->nodes) { + splay_delete_tree(mesh->nodes); + } + + mesh->node_udp_cache = NULL; + mesh->nodes = NULL; } -void exit_nodes(void) -{ -cp - avl_delete_tree(node_tree); - avl_delete_tree(node_udp_tree); -cp +node_t *new_node(void) { + node_t *n = xzalloc(sizeof(*n)); + + n->edge_tree = new_edge_tree(); + n->mtu = MTU; + n->maxmtu = MTU; + n->devclass = DEV_CLASS_UNKNOWN; + + return n; } -node_t *new_node(void) -{ - node_t *n = (node_t *)xmalloc_and_zero(sizeof(*n)); -cp - n->subnet_tree = avl_alloc_tree((avl_compare_t)subnet_compare, NULL); - n->queue = list_alloc((list_action_t)free); -cp - return n; +void free_node(node_t *n) { + n->status.destroyed = true; + + utcp_exit(n->utcp); + + if(n->edge_tree) { + free_edge_tree(n->edge_tree); + } + + sockaddrfree(&n->address); + + ecdsa_free(n->ecdsa); + sptps_stop(&n->sptps); + + if(n->mtutimeout.cb) { + abort(); + } + + free(n->name); + free(n->canonical_address); + + free(n); } -void free_node(node_t *n) -{ -cp - if(n->queue) - list_delete_list(n->queue); - if(n->name) - free(n->name); - if(n->hostname) - free(n->hostname); - if(n->key) - free(n->key); - free(n); -cp +void node_add(meshlink_handle_t *mesh, node_t *n) { + n->mesh = mesh; + splay_insert(mesh->nodes, n); } -void node_add(node_t *n) -{ -cp - avl_insert(node_tree, n); - avl_insert(node_udp_tree, n); -cp +void node_del(meshlink_handle_t *mesh, node_t *n) { + timeout_del(&mesh->loop, &n->mtutimeout); + + for splay_each(edge_t, e, n->edge_tree) { + edge_del(mesh, e); + } + + splay_delete(mesh->nodes, n); } -void node_del(node_t *n) -{ -cp - avl_delete(node_tree, n); - avl_delete(node_udp_tree, n); -cp +node_t *lookup_node(meshlink_handle_t *mesh, const char *name) { + const node_t n = {.name = (char *)name}; + node_t *result; + + result = splay_search(mesh->nodes, &n); + + return result; } -node_t *lookup_node(char *name) -{ - node_t n; -cp - n.name = name; - return avl_search(node_tree, &n); +node_t *lookup_node_udp(meshlink_handle_t *mesh, const sockaddr_t *sa) { + return hash_search(mesh->node_udp_cache, sa); } -node_t *lookup_node_udp(ipv4_t address, port_t port) -{ - node_t n; -cp - n.address = address; - n.port = port; - return avl_search(node_udp_tree, &n); +void update_node_udp(meshlink_handle_t *mesh, node_t *n, const sockaddr_t *sa) { + if(n == mesh->self) { + logger(mesh, MESHLINK_WARNING, "Trying to update UDP address of mesh->self!"); + return; + } + + hash_insert(mesh->node_udp_cache, &n->address, NULL); + + if(sa) { + n->address = *sa; + n->sock = 0; + + for(int i = 0; i < mesh->listen_sockets; i++) { + if(mesh->listen_socket[i].sa.sa.sa_family == sa->sa.sa_family) { + n->sock = i; + break; + } + } + + hash_insert(mesh->node_udp_cache, sa, n); + + node_add_recent_address(mesh, n, sa); + + if(mesh->log_level <= MESHLINK_DEBUG) { + char *hostname = sockaddr2hostname(&n->address); + logger(mesh, MESHLINK_DEBUG, "UDP address of %s set to %s", n->name, hostname); + free(hostname); + } + } } -void dump_nodes(void) -{ - avl_node_t *node; - node_t *n; -cp - syslog(LOG_DEBUG, _("Nodes:")); - - for(node = node_tree->head; node; node = node->next) - { - n = (node_t *)node->data; - syslog(LOG_DEBUG, _(" %s at %s port %hd options %ld status %04x"), - n->name, n->hostname, n->port, n->options, - n->status); - } - - syslog(LOG_DEBUG, _("End of nodes.")); -cp +bool node_add_recent_address(meshlink_handle_t *mesh, node_t *n, const sockaddr_t *sa) { + (void)mesh; + bool found = false; + int i; + + /* Check if we already know this address */ + for(i = 0; i < MAX_RECENT && n->recent[i].sa.sa_family; i++) { + if(!sockaddrcmp(&n->recent[i], sa)) { + found = true; + break; + } + } + + if(found && i == 0) { + /* It's already the most recent address, nothing to do. */ + return false; + } + + if(i >= MAX_RECENT) { + i = MAX_RECENT - 1; + } + + memmove(n->recent + 1, n->recent, i * sizeof(*n->recent)); + memcpy(n->recent, sa, SALEN(sa->sa)); + + n->status.dirty = true; + return !found; }