/*
node.c -- node tree management
- Copyright (C) 2001-2003 Guus Sliepen <guus@sliepen.eu.org>,
- 2001-2003 Ivo Timmermans <ivo@o2w.nl>
+ Copyright (C) 2001-2016 Guus Sliepen <guus@tinc-vpn.org>,
+ 2001-2005 Ivo Timmermans
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
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.28 2003/08/28 21:05:10 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 "system.h"
#include "utils.h"
#include "xalloc.h"
-avl_tree_t *node_tree; /* Known nodes, sorted by name */
-avl_tree_t *node_udp_tree; /* Known nodes, sorted by address and port */
+avl_tree_t *node_tree; /* Known nodes, sorted by name */
+avl_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)
-{
+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;
-
- cp();
-
- result = sockaddrcmp(&a->address, &b->address);
-
- if(result)
- return result;
-
- return (a->name && b->name) ? strcmp(a->name, b->name) : 0;
+static int node_udp_compare(const node_t *a, const node_t *b) {
+ return sockaddrcmp(&a->address, &b->address);
}
-void init_nodes(void)
-{
- cp();
-
+void init_nodes(void) {
node_tree = avl_alloc_tree((avl_compare_t) node_compare, (avl_action_t) free_node);
node_udp_tree = avl_alloc_tree((avl_compare_t) node_udp_compare, NULL);
}
-void exit_nodes(void)
-{
- cp();
-
+void exit_nodes(void) {
avl_delete_tree(node_udp_tree);
avl_delete_tree(node_tree);
}
-node_t *new_node(void)
-{
+node_t *new_node(void) {
node_t *n = xmalloc_and_zero(sizeof(*n));
- cp();
+ if(replaywin) {
+ n->late = xmalloc_and_zero(replaywin);
+ }
n->subnet_tree = new_subnet_tree();
n->edge_tree = new_edge_tree();
- n->queue = list_alloc((list_action_t) free);
- EVP_CIPHER_CTX_init(&n->packet_ctx);
-
- return n;
-}
+ n->inctx = EVP_CIPHER_CTX_new();
+ n->outctx = EVP_CIPHER_CTX_new();
-void free_node(node_t *n)
-{
- cp();
+ if(!n->inctx || !n->outctx) {
+ abort();
+ }
- if(n->queue)
- list_delete_list(n->queue);
+ n->mtu = MTU;
+ n->maxmtu = MTU;
- if(n->name)
- free(n->name);
+ return n;
+}
- if(n->hostname)
- free(n->hostname);
+void free_node(node_t *n) {
+ if(n->inkey) {
+ free(n->inkey);
+ }
- if(n->key)
- free(n->key);
+ if(n->outkey) {
+ free(n->outkey);
+ }
- if(n->subnet_tree)
+ if(n->subnet_tree) {
free_subnet_tree(n->subnet_tree);
+ }
- if(n->edge_tree)
+ if(n->edge_tree) {
free_edge_tree(n->edge_tree);
+ }
sockaddrfree(&n->address);
- EVP_CIPHER_CTX_cleanup(&n->packet_ctx);
-
+ EVP_CIPHER_CTX_free(n->outctx);
+ EVP_CIPHER_CTX_free(n->inctx);
+
+ if(n->mtuevent) {
+ event_del(n->mtuevent);
+ }
+
+ if(n->hostname) {
+ free(n->hostname);
+ }
+
+ if(n->name) {
+ free(n->name);
+ }
+
+ if(n->late) {
+ free(n->late);
+ }
+
free(n);
}
-void node_add(node_t *n)
-{
- cp();
-
+void node_add(node_t *n) {
avl_insert(node_tree, n);
- avl_insert(node_udp_tree, n);
}
-void node_del(node_t *n)
-{
+void node_del(node_t *n) {
avl_node_t *node, *next;
edge_t *e;
subnet_t *s;
- cp();
-
for(node = n->subnet_tree->head; node; node = next) {
next = node->next;
s = node->data;
edge_del(e);
}
- avl_delete(node_tree, n);
avl_delete(node_udp_tree, n);
+ avl_delete(node_tree, n);
}
-node_t *lookup_node(char *name)
-{
- node_t n = {0};
+node_t *lookup_node(char *name) {
+ node_t n = {NULL};
- cp();
-
n.name = name;
return avl_search(node_tree, &n);
}
-node_t *lookup_node_udp(const sockaddr_t *sa)
-{
- node_t n = {0};
-
- cp();
+node_t *lookup_node_udp(const sockaddr_t *sa) {
+ node_t n = {NULL};
n.address = *sa;
n.name = NULL;
return avl_search(node_udp_tree, &n);
}
-void dump_nodes(void)
-{
+void update_node_udp(node_t *n, const sockaddr_t *sa) {
+ if(n == myself) {
+ logger(LOG_WARNING, "Trying to update UDP address of myself!");
+ return;
+ }
+
+ avl_delete(node_udp_tree, n);
+
+ if(n->hostname) {
+ free(n->hostname);
+ }
+
+ if(sa) {
+ n->address = *sa;
+ n->hostname = sockaddr2hostname(&n->address);
+ avl_insert(node_udp_tree, n);
+ ifdebug(PROTOCOL) logger(LOG_DEBUG, "UDP address of %s set to %s", n->name, n->hostname);
+ } else {
+ memset(&n->address, 0, sizeof(n->address));
+ n->hostname = NULL;
+ ifdebug(PROTOCOL) logger(LOG_DEBUG, "UDP address of %s cleared", n->name);
+ }
+}
+
+void dump_nodes(void) {
avl_node_t *node;
node_t *n;
- cp();
-
- logger(LOG_DEBUG, _("Nodes:"));
+ logger(LOG_DEBUG, "Nodes:");
for(node = node_tree->head; node; node = node->next) {
n = node->data;
- logger(LOG_DEBUG, _(" %s at %s cipher %d digest %d maclength %d compression %d options %lx status %04x nexthop %s via %s"),
- n->name, n->hostname, n->cipher ? n->cipher->nid : 0,
- n->digest ? n->digest->type : 0, n->maclength, n->compression,
- n->options, *(uint32_t *)&n->status, n->nexthop ? n->nexthop->name : "-",
- n->via ? n->via->name : "-");
+ logger(LOG_DEBUG, " %s at %s cipher %d digest %d maclength %d compression %d options %x status %04x nexthop %s via %s pmtu %d (min %d max %d)",
+ n->name, n->hostname, n->outcipher ? EVP_CIPHER_nid(n->outcipher) : 0,
+ n->outdigest ? EVP_MD_type(n->outdigest) : 0, n->outmaclength, n->outcompression,
+ n->options, bitfield_to_int(&n->status, sizeof(n->status)), n->nexthop ? n->nexthop->name : "-",
+ n->via ? n->via->name : "-", n->mtu, n->minmtu, n->maxmtu);
}
- logger(LOG_DEBUG, _("End of nodes."));
+ logger(LOG_DEBUG, "End of nodes.");
}
projects / tinc / blobdiff