2001-10-10 08:49:47 +00:00
|
|
|
/*
|
|
|
|
node.c -- node tree management
|
2006-04-26 13:52:58 +00:00
|
|
|
Copyright (C) 2001-2006 Guus Sliepen <guus@tinc-vpn.org>,
|
|
|
|
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.
|
|
|
|
|
|
|
|
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.
|
|
|
|
|
2004-03-21 14:21:22 +00:00
|
|
|
$Id$
|
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
|
|
|
|
2003-07-17 15:06:27 +00:00
|
|
|
#include "avl_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
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
avl_tree_t *node_tree; /* Known nodes, sorted by name */
|
|
|
|
avl_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;
|
|
|
|
|
2003-07-24 12:08:16 +00:00
|
|
|
static int node_compare(const node_t *a, const node_t *b)
|
2001-10-10 08:49:47 +00:00
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
return strcmp(a->name, b->name);
|
2001-10-10 08:49:47 +00:00
|
|
|
}
|
|
|
|
|
2003-07-24 12:08:16 +00:00
|
|
|
static int node_udp_compare(const node_t *a, const node_t *b)
|
2001-10-27 12:13:17 +00:00
|
|
|
{
|
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
|
|
|
cp();
|
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
|
|
|
}
|
|
|
|
|
2001-10-10 08:49:47 +00:00
|
|
|
void init_nodes(void)
|
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
cp();
|
|
|
|
|
2003-08-22 11:18:42 +00:00
|
|
|
node_tree = avl_alloc_tree((avl_compare_t) node_compare, (avl_action_t) free_node);
|
2002-09-09 21:25:28 +00:00
|
|
|
node_udp_tree = avl_alloc_tree((avl_compare_t) node_udp_compare, NULL);
|
2001-10-10 08:49:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void exit_nodes(void)
|
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
cp();
|
|
|
|
|
|
|
|
avl_delete_tree(node_udp_tree);
|
2003-08-22 11:18:42 +00:00
|
|
|
avl_delete_tree(node_tree);
|
2001-10-10 08:49:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
node_t *new_node(void)
|
|
|
|
{
|
2003-08-28 21:05:11 +00:00
|
|
|
node_t *n = xmalloc_and_zero(sizeof(*n));
|
2002-09-09 21:25:28 +00:00
|
|
|
|
|
|
|
cp();
|
|
|
|
|
|
|
|
n->subnet_tree = new_subnet_tree();
|
|
|
|
n->edge_tree = new_edge_tree();
|
|
|
|
n->queue = list_alloc((list_action_t) free);
|
2003-05-06 21:13:18 +00:00
|
|
|
EVP_CIPHER_CTX_init(&n->packet_ctx);
|
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
|
|
|
}
|
|
|
|
|
2002-09-09 22:33:31 +00:00
|
|
|
void free_node(node_t *n)
|
2001-10-10 08:49:47 +00:00
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
cp();
|
|
|
|
|
|
|
|
if(n->queue)
|
|
|
|
list_delete_list(n->queue);
|
|
|
|
|
|
|
|
if(n->key)
|
|
|
|
free(n->key);
|
|
|
|
|
|
|
|
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);
|
|
|
|
|
2003-05-06 21:13:18 +00:00
|
|
|
EVP_CIPHER_CTX_cleanup(&n->packet_ctx);
|
2003-12-22 11:04:17 +00:00
|
|
|
|
2006-11-11 22:44:15 +00:00
|
|
|
if(n->mtuevent) {
|
2003-12-22 11:04:17 +00:00
|
|
|
event_del(n->mtuevent);
|
2006-11-11 22:44:15 +00:00
|
|
|
free_event(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);
|
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
free(n);
|
2001-10-10 08:49:47 +00:00
|
|
|
}
|
|
|
|
|
2002-09-09 22:33:31 +00:00
|
|
|
void node_add(node_t *n)
|
2001-10-27 12:13:17 +00:00
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
cp();
|
|
|
|
|
|
|
|
avl_insert(node_tree, n);
|
2001-10-27 12:13:17 +00:00
|
|
|
}
|
|
|
|
|
2002-09-09 22:33:31 +00:00
|
|
|
void node_del(node_t *n)
|
2001-10-27 12:13:17 +00:00
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
avl_node_t *node, *next;
|
|
|
|
edge_t *e;
|
|
|
|
subnet_t *s;
|
|
|
|
|
|
|
|
cp();
|
|
|
|
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
|
|
|
|
avl_delete(node_tree, n);
|
2001-10-27 12:13:17 +00:00
|
|
|
}
|
|
|
|
|
2003-07-29 10:50:15 +00:00
|
|
|
node_t *lookup_node(char *name)
|
2001-10-10 08:49:47 +00:00
|
|
|
{
|
2003-07-30 11:50:45 +00:00
|
|
|
node_t n = {0};
|
2003-07-24 12:08:16 +00:00
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
cp();
|
2003-07-24 12:08:16 +00:00
|
|
|
|
2003-07-30 11:50:45 +00:00
|
|
|
n.name = name;
|
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
return avl_search(node_tree, &n);
|
2001-10-10 08:49:47 +00:00
|
|
|
}
|
|
|
|
|
2003-07-24 12:08:16 +00:00
|
|
|
node_t *lookup_node_udp(const sockaddr_t *sa)
|
2001-10-10 08:49:47 +00:00
|
|
|
{
|
2003-07-30 11:50:45 +00:00
|
|
|
node_t n = {0};
|
2003-07-24 12:08:16 +00:00
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
cp();
|
2002-02-18 16:25:19 +00:00
|
|
|
|
2003-07-30 11:50:45 +00:00
|
|
|
n.address = *sa;
|
|
|
|
n.name = NULL;
|
|
|
|
|
2002-09-09 21:25:28 +00:00
|
|
|
return avl_search(node_udp_tree, &n);
|
2001-10-10 08:49:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void dump_nodes(void)
|
|
|
|
{
|
2002-09-09 21:25:28 +00:00
|
|
|
avl_node_t *node;
|
|
|
|
node_t *n;
|
|
|
|
|
|
|
|
cp();
|
|
|
|
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_DEBUG, _("Nodes:"));
|
2002-09-09 21:25:28 +00:00
|
|
|
|
|
|
|
for(node = node_tree->head; node; node = node->next) {
|
2003-08-28 21:05:11 +00:00
|
|
|
n = node->data;
|
2003-12-22 11:04:17 +00:00
|
|
|
logger(LOG_DEBUG, _(" %s at %s cipher %d digest %d maclength %d compression %d options %lx status %04x nexthop %s via %s pmtu %d (min %d max %d)"),
|
2002-09-09 21:25:28 +00:00
|
|
|
n->name, n->hostname, n->cipher ? n->cipher->nid : 0,
|
|
|
|
n->digest ? n->digest->type : 0, n->maclength, n->compression,
|
2003-07-29 10:50:15 +00:00
|
|
|
n->options, *(uint32_t *)&n->status, n->nexthop ? n->nexthop->name : "-",
|
2003-12-22 11:04:17 +00:00
|
|
|
n->via ? n->via->name : "-", n->mtu, n->minmtu, n->maxmtu);
|
2002-09-09 21:25:28 +00:00
|
|
|
}
|
|
|
|
|
2003-07-12 17:41:48 +00:00
|
|
|
logger(LOG_DEBUG, _("End of nodes."));
|
2001-10-10 08:49:47 +00:00
|
|
|
}
|