2001-10-10 08:49:47 +00:00
|
|
|
/*
|
|
|
|
node.c -- node tree management
|
2011-05-08 19:22:20 +00:00
|
|
|
Copyright (C) 2001-2011 Guus Sliepen <guus@tinc-vpn.org>,
|
2006-04-26 13:52:58 +00:00
|
|
|
2001-2005 Ivo Timmermans
|
2001-10-10 08:49:47 +00:00
|
|
|
|
|
|
|
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
|
|
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
2009-09-24 22:01:00 +00:00
|
|
|
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.
|
2001-10-10 08:49:47 +00:00
|
|
|
*/
|
|
|
|
|
2003-07-17 15:06:27 +00:00
|
|
|
#include "system.h"
|
2001-10-27 12:13:17 +00:00
|
|
|
|
2009-11-07 22:43:25 +00:00
|
|
|
#include "control_common.h"
|
2007-05-18 10:05:26 +00:00
|
|
|
#include "splay_tree.h"
|
2003-07-06 22:11:37 +00:00
|
|
|
#include "logger.h"
|
2003-07-17 15:06:27 +00:00
|
|
|
#include "net.h"
|
|
|
|
#include "netutl.h"
|
|
|
|
#include "node.h"
|
|
|
|
#include "utils.h"
|
|
|
|
#include "xalloc.h"
|
2001-10-27 12:13:17 +00:00
|
|
|
|
2007-05-18 10:05:26 +00:00
|
|
|
splay_tree_t *node_tree; /* Known nodes, sorted by name */
|
|
|
|
splay_tree_t *node_udp_tree; /* Known nodes, sorted by address and port */
|
2001-10-10 08:49:47 +00:00
|
|
|
|
2001-10-27 13:13:35 +00:00
|
|
|
node_t *myself;
|
|
|
|
|
2007-05-18 10:00:00 +00:00
|
|
|
static int node_compare(const node_t *a, const node_t *b) {
|
2002-09-09 21:25:28 +00:00
|
|
|
return strcmp(a->name, b->name);
|
2001-10-10 08:49:47 +00:00
|
|
|
}
|
|
|
|
|
2007-05-18 10:00:00 +00:00
|
|
|
static int node_udp_compare(const node_t *a, const node_t *b) {
|
2002-09-09 21:25:28 +00:00
|
|
|
int result;
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
result = sockaddrcmp(&a->address, &b->address);
|
|
|
|
|
|
|
|
if(result)
|
|
|
|
return result;
|
|
|
|
|
|
|
|
return (a->name && b->name) ? strcmp(a->name, b->name) : 0;
|
2001-10-27 12:13:17 +00:00
|
|
|
}
|
|
|
|
|
2007-05-18 10:00:00 +00:00
|
|
|
void init_nodes(void) {
|
2007-05-18 10:05:26 +00:00
|
|
|
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);
|
2001-10-10 08:49:47 +00:00
|
|
|
}
|
|
|
|
|
2007-05-18 10:00:00 +00:00
|
|
|
void exit_nodes(void) {
|
2007-05-18 10:05:26 +00:00
|
|
|
splay_delete_tree(node_udp_tree);
|
|
|
|
splay_delete_tree(node_tree);
|
2001-10-10 08:49:47 +00:00
|
|
|
}
|
|
|
|
|
2007-05-18 10:00:00 +00:00
|
|
|
node_t *new_node(void) {
|
2008-12-11 15:56:18 +00:00
|
|
|
node_t *n = xmalloc_and_zero(sizeof *n);
|
2002-09-09 21:25:28 +00:00
|
|
|
|
2010-11-13 18:05:50 +00:00
|
|
|
if(replaywin) n->late = xmalloc_and_zero(replaywin);
|
2002-09-09 21:25:28 +00:00
|
|
|
n->subnet_tree = new_subnet_tree();
|
|
|
|
n->edge_tree = new_edge_tree();
|
2003-12-20 19:47:53 +00:00
|
|
|
n->mtu = MTU;
|
2003-12-22 11:04:17 +00:00
|
|
|
n->maxmtu = MTU;
|
2002-09-09 21:25:28 +00:00
|
|
|
|
|
|
|
return n;
|
2001-10-10 08:49:47 +00:00
|
|
|
}
|
|
|
|
|
2007-05-18 10:00:00 +00:00
|
|
|
void free_node(node_t *n) {
|
2002-09-09 21:25:28 +00:00
|
|
|
if(n->subnet_tree)
|
|
|
|
free_subnet_tree(n->subnet_tree);
|
|
|
|
|
|
|
|
if(n->edge_tree)
|
|
|
|
free_edge_tree(n->edge_tree);
|
|
|
|
|
2003-08-22 11:18:42 +00:00
|
|
|
sockaddrfree(&n->address);
|
|
|
|
|
2009-06-05 21:03:28 +00:00
|
|
|
cipher_close(&n->incipher);
|
|
|
|
digest_close(&n->indigest);
|
|
|
|
cipher_close(&n->outcipher);
|
|
|
|
digest_close(&n->outdigest);
|
2003-12-22 11:04:17 +00:00
|
|
|
|
2011-07-16 18:21:44 +00:00
|
|
|
ecdh_free(&n->ecdh);
|
|
|
|
ecdsa_free(&n->ecdsa);
|
|
|
|
|
2011-05-22 11:15:27 +00:00
|
|
|
if(timeout_initialized(&n->mtuevent))
|
|
|
|
event_del(&n->mtuevent);
|
2003-05-06 21:13:18 +00:00
|
|
|
|
2006-11-11 22:44:15 +00:00
|
|
|
if(n->hostname)
|
|
|
|
free(n->hostname);
|
|
|
|
|
|
|
|
if(n->name)
|
|
|
|
free(n->name);
|
|
|
|
|
2010-11-13 20:36:51 +00:00
|
|
|
if(n->late)
|
|
|
|
free(n->late);
|
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
free(n);
|
2001-10-10 08:49:47 +00:00
|
|
|
}
|
|
|
|
|
2007-05-18 10:00:00 +00:00
|
|
|
void node_add(node_t *n) {
|
2007-05-18 10:05:26 +00:00
|
|
|
splay_insert(node_tree, n);
|
2001-10-27 12:13:17 +00:00
|
|
|
}
|
|
|
|
|
2007-05-18 10:00:00 +00:00
|
|
|
void node_del(node_t *n) {
|
2007-05-18 10:05:26 +00:00
|
|
|
splay_node_t *node, *next;
|
2002-09-09 21:25:28 +00:00
|
|
|
edge_t *e;
|
|
|
|
subnet_t *s;
|
|
|
|
|
|
|
|
for(node = n->subnet_tree->head; node; node = next) {
|
|
|
|
next = node->next;
|
2003-08-28 21:05:11 +00:00
|
|
|
s = node->data;
|
2002-09-09 21:25:28 +00:00
|
|
|
subnet_del(n, s);
|
|
|
|
}
|
|
|
|
|
|
|
|
for(node = n->edge_tree->head; node; node = next) {
|
|
|
|
next = node->next;
|
2003-08-28 21:05:11 +00:00
|
|
|
e = node->data;
|
2002-09-09 21:25:28 +00:00
|
|
|
edge_del(e);
|
|
|
|
}
|
|
|
|
|
2009-06-05 21:03:28 +00:00
|
|
|
splay_delete(node_udp_tree, n);
|
2009-09-16 17:55:47 +00:00
|
|
|
splay_delete(node_tree, n);
|
2001-10-27 12:13:17 +00:00
|
|
|
}
|
|
|
|
|
2007-05-18 10:00:00 +00:00
|
|
|
node_t *lookup_node(char *name) {
|
2011-05-28 01:46:39 +00:00
|
|
|
node_t n = {NULL};
|
2003-07-24 12:08:16 +00:00
|
|
|
|
2003-07-30 11:50:45 +00:00
|
|
|
n.name = name;
|
|
|
|
|
2007-05-18 10:05:26 +00:00
|
|
|
return splay_search(node_tree, &n);
|
2001-10-10 08:49:47 +00:00
|
|
|
}
|
|
|
|
|
2007-05-18 10:00:00 +00:00
|
|
|
node_t *lookup_node_udp(const sockaddr_t *sa) {
|
2011-05-28 01:46:39 +00:00
|
|
|
node_t n = {NULL};
|
2003-07-24 12:08:16 +00:00
|
|
|
|
2003-07-30 11:50:45 +00:00
|
|
|
n.address = *sa;
|
|
|
|
n.name = NULL;
|
|
|
|
|
2007-05-18 10:05:26 +00:00
|
|
|
return splay_search(node_udp_tree, &n);
|
2001-10-10 08:49:47 +00:00
|
|
|
}
|
|
|
|
|
2009-09-24 22:14:03 +00:00
|
|
|
void update_node_udp(node_t *n, const sockaddr_t *sa) {
|
2011-02-18 22:11:43 +00:00
|
|
|
if(n == myself) {
|
2011-05-27 23:36:10 +00:00
|
|
|
logger(LOG_WARNING, "Trying to update UDP address of myself!");
|
2011-02-18 22:11:43 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-06-05 21:03:28 +00:00
|
|
|
splay_delete(node_udp_tree, n);
|
2009-04-02 23:05:23 +00:00
|
|
|
|
|
|
|
if(n->hostname)
|
|
|
|
free(n->hostname);
|
|
|
|
|
|
|
|
if(sa) {
|
|
|
|
n->address = *sa;
|
|
|
|
n->hostname = sockaddr2hostname(&n->address);
|
2009-06-05 21:03:28 +00:00
|
|
|
splay_insert(node_udp_tree, n);
|
2011-06-21 21:06:53 +00:00
|
|
|
ifdebug(PROTOCOL) logger(LOG_DEBUG, "UDP address of %s set to %s", n->name, n->hostname);
|
2009-04-02 23:05:23 +00:00
|
|
|
} else {
|
|
|
|
memset(&n->address, 0, sizeof n->address);
|
2011-05-28 01:46:39 +00:00
|
|
|
n->hostname = NULL;
|
2009-06-11 17:39:25 +00:00
|
|
|
ifdebug(PROTOCOL) logger(LOG_DEBUG, "UDP address of %s cleared", n->name);
|
2009-04-02 23:05:23 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-11-07 22:43:25 +00:00
|
|
|
bool dump_nodes(connection_t *c) {
|
2007-05-18 10:05:26 +00:00
|
|
|
splay_node_t *node;
|
2002-09-09 21:25:28 +00:00
|
|
|
node_t *n;
|
|
|
|
|
|
|
|
for(node = node_tree->head; node; node = node->next) {
|
2003-08-28 21:05:11 +00:00
|
|
|
n = node->data;
|
2011-06-02 22:46:56 +00:00
|
|
|
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,
|
2009-06-05 21:03:28 +00:00
|
|
|
n->name, n->hostname, cipher_get_nid(&n->outcipher),
|
2011-06-02 22:46:56 +00:00
|
|
|
digest_get_nid(&n->outdigest), (int)digest_length(&n->outdigest), n->outcompression,
|
2009-09-09 12:51:36 +00:00
|
|
|
n->options, bitfield_to_int(&n->status, sizeof n->status), n->nexthop ? n->nexthop->name : "-",
|
2011-06-02 22:46:56 +00:00
|
|
|
n->via ? n->via->name ?: "-" : "-", n->distance, n->mtu, n->minmtu, n->maxmtu);
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
2009-11-07 22:43:25 +00:00
|
|
|
return send_request(c, "%d %d", CONTROL, REQ_DUMP_NODES);
|
2001-10-10 08:49:47 +00:00
|
|
|
}
|
2011-05-15 09:59:13 +00:00
|
|
|
|
|
|
|
bool dump_traffic(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 %"PRIu64" %"PRIu64" %"PRIu64" %"PRIu64, CONTROL, REQ_DUMP_TRAFFIC,
|
|
|
|
n->name, n->in_packets, n->in_bytes, n->out_packets, n->out_bytes);
|
|
|
|
}
|
|
|
|
|
|
|
|
return send_request(c, "%d %d", CONTROL, REQ_DUMP_TRAFFIC);
|
|
|
|
}
|