X-Git-Url: http://git.meshlink.io/?a=blobdiff_plain;f=src%2Fnode.c;h=164520aa302c0997b29a36e71f3424c1da48ab62;hb=refs%2Fheads%2Fouter-routing;hp=18a02a4ccf0c0355a60f35ec75b476097df04ccc;hpb=268c8545aaf83b7433f43402f5c77e39e20006ef;p=meshlink diff --git a/src/node.c b/src/node.c index 18a02a4c..164520aa 100644 --- a/src/node.c +++ b/src/node.c @@ -1,7 +1,6 @@ /* node.c -- node tree management - Copyright (C) 2001-2011 Guus Sliepen , - 2001-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 @@ -20,179 +19,184 @@ #include "system.h" -#include "control_common.h" -#include "splay_tree.h" +#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" -splay_tree_t *node_tree; /* Known nodes, sorted by name */ -splay_tree_t *node_udp_tree; /* Known nodes, sorted by address and port */ - -node_t *myself; - static int node_compare(const node_t *a, const node_t *b) { return strcmp(a->name, b->name); } -static int node_udp_compare(const node_t *a, const node_t *b) { - int result; - - result = sockaddrcmp(&a->address, &b->address); - - if(result) - return result; - - return (a->name && b->name) ? strcmp(a->name, b->name) : 0; +static int node_id_compare(const node_t *a, const node_t *b) { + if(a->id < b->id) { + return -1; + } else if(a->id == b->id) { + return 0; + } else { + return 1; + } } -void init_nodes(void) { - node_tree = splay_alloc_tree((splay_compare_t) node_compare, (splay_action_t) free_node); - node_udp_tree = splay_alloc_tree((splay_compare_t) node_udp_compare, NULL); +void init_nodes(meshlink_handle_t *mesh) { + mesh->nodes = splay_alloc_tree((splay_compare_t) node_compare, (splay_action_t) free_node); + mesh->node_ids = splay_alloc_tree((splay_compare_t) node_id_compare, NULL); } -void exit_nodes(void) { - splay_delete_tree(node_udp_tree); - splay_delete_tree(node_tree); +void exit_nodes(meshlink_handle_t *mesh) { + if(mesh->nodes) { + splay_delete_tree(mesh->nodes); + } + + if(mesh->node_ids) { + splay_delete_tree(mesh->node_ids); + } + + mesh->nodes = NULL; + mesh->node_ids = NULL; } node_t *new_node(void) { - node_t *n = xmalloc_and_zero(sizeof *n); + node_t *n = xzalloc(sizeof(*n)); - if(replaywin) n->late = xmalloc_and_zero(replaywin); - n->subnet_tree = new_subnet_tree(); n->edge_tree = new_edge_tree(); n->mtu = MTU; n->maxmtu = MTU; + n->devclass = _DEV_CLASS_MAX; return n; } void free_node(node_t *n) { - if(n->subnet_tree) - free_subnet_tree(n->subnet_tree); + n->status.destroyed = true; + + utcp_exit(n->utcp); - if(n->edge_tree) + if(n->edge_tree) { free_edge_tree(n->edge_tree); + } sockaddrfree(&n->address); - cipher_close(&n->incipher); - digest_close(&n->indigest); - cipher_close(&n->outcipher); - digest_close(&n->outdigest); - - ecdh_free(&n->ecdh); - ecdsa_free(&n->ecdsa); + ecdsa_free(n->ecdsa); + sptps_stop(&n->sptps); - if(timeout_initialized(&n->mtuevent)) - event_del(&n->mtuevent); - - if(n->hostname) - free(n->hostname); - - if(n->name) - free(n->name); + if(n->mtutimeout.cb) { + abort(); + } - if(n->late) - free(n->late); + free(n->name); free(n); } -void node_add(node_t *n) { - splay_insert(node_tree, n); +void node_add(meshlink_handle_t *mesh, node_t *n) { + n->mesh = mesh; + splay_insert(mesh->nodes, n); + update_node_id(mesh, n); } -void node_del(node_t *n) { - splay_node_t *node, *next; - edge_t *e; - subnet_t *s; +void node_del(meshlink_handle_t *mesh, node_t *n) { + timeout_del(&mesh->loop, &n->mtutimeout); - for(node = n->subnet_tree->head; node; node = next) { - next = node->next; - s = node->data; - subnet_del(n, s); + for splay_each(edge_t, e, n->edge_tree) { + edge_del(mesh, e); } - for(node = n->edge_tree->head; node; node = next) { - next = node->next; - e = node->data; - edge_del(e); - } + splay_delete(mesh->nodes, n); +} - splay_delete(node_udp_tree, n); - splay_delete(node_tree, n); +node_t *lookup_node(meshlink_handle_t *mesh, const char *name) { + const node_t n = {.name = (char *)name}; + return splay_search(mesh->nodes, &n); } -node_t *lookup_node(char *name) { - node_t n = {NULL}; +node_t *lookup_node_id(meshlink_handle_t *mesh, uint64_t id) { + const node_t n = {.id = id}; + return splay_search(mesh->node_ids, &n); +} - n.name = name; +void update_node_id(meshlink_handle_t *mesh, node_t *n) { + if(n->id) { + logger(mesh, LOG_WARNING, "Node %s already has id %"PRIu64"\n", n->name, n->id); + return; + } - return splay_search(node_tree, &n); -} + struct { + uint8_t public[32]; + uint32_t gen; + } input; -node_t *lookup_node_udp(const sockaddr_t *sa) { - node_t n = {NULL}; + uint8_t hash[64]; + uint64_t id; - n.address = *sa; - n.name = NULL; + memset(&input, 0, sizeof input); - return splay_search(node_udp_tree, &n); -} + strncpy(input.public, n->name, sizeof input.public); + input.gen = 0; -void update_node_udp(node_t *n, const sockaddr_t *sa) { - if(n == myself) { - logger(DEBUG_ALWAYS, LOG_WARNING, "Trying to update UDP address of myself!"); - return; - } + while(true) { + sha512(&input, sizeof input, hash); + memcpy(&id, hash, sizeof id); + input.gen++; - splay_delete(node_udp_tree, n); + // ID 0 is reserved + if(!id) { + continue; + } - if(n->hostname) - free(n->hostname); + // Check if there is a conflict with an existing node + node_t *other = lookup_node_id(mesh, id); + int cmp = other ? strcmp(n->name, other->name) : 0; - if(sa) { - n->address = *sa; - n->hostname = sockaddr2hostname(&n->address); - splay_insert(node_udp_tree, n); - logger(DEBUG_PROTOCOL, LOG_DEBUG, "UDP address of %s set to %s", n->name, n->hostname); - } else { - memset(&n->address, 0, sizeof n->address); - n->hostname = NULL; - logger(DEBUG_PROTOCOL, LOG_DEBUG, "UDP address of %s cleared", n->name); - } -} + // If yes and we sort after the other, try again + if(cmp > 0) { + continue; + } -bool dump_nodes(connection_t *c) { - splay_node_t *node; - node_t *n; - - for(node = node_tree->head; node; node = node->next) { - n = node->data; - send_request(c, "%d %d %s at %s cipher %d digest %d maclength %d compression %d options %x status %04x nexthop %s via %s distance %d pmtu %hd (min %hd max %hd)", CONTROL, REQ_DUMP_NODES, - n->name, n->hostname, cipher_get_nid(&n->outcipher), - digest_get_nid(&n->outdigest), (int)digest_length(&n->outdigest), n->outcompression, - n->options, bitfield_to_int(&n->status, sizeof n->status), n->nexthop ? n->nexthop->name : "-", - n->via ? n->via->name ?: "-" : "-", n->distance, n->mtu, n->minmtu, n->maxmtu); - } + if(other) { + splay_delete(mesh->node_ids, other); + } - return send_request(c, "%d %d", CONTROL, REQ_DUMP_NODES); -} + n->id = id; + splay_insert(mesh->node_ids, n); -bool dump_traffic(connection_t *c) { - splay_node_t *node; - node_t *n; + if(other) { + update_node_id(mesh, other); + } + + break; + } +} - for(node = node_tree->head; node; node = node->next) { - n = node->data; - send_request(c, "%d %d %s %"PRIu64" %"PRIu64" %"PRIu64" %"PRIu64, CONTROL, REQ_DUMP_TRAFFIC, - n->name, n->in_packets, n->in_bytes, n->out_packets, n->out_bytes); +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; } - return send_request(c, "%d %d", CONTROL, REQ_DUMP_TRAFFIC); + 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; + } + } + + meshlink_hint_address(mesh, (meshlink_node_t *)n, &sa->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); + } + } }