/*
node.c -- node tree management
- Copyright (C) 2001 Guus Sliepen <guus@sliepen.warande.net>,
- 2001 Ivo Timmermans <itimmermans@bigfoot.com>
+ Copyright (C) 2001-2006 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
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.1 2001/10/10 08:49:47 guus Exp $
+ $Id$
*/
-avl_tree_t *node_tree; /* Known nodes, sorted by name */
+#include "system.h"
-int node_compare(connection_t *a, connection_t *b)
-{
- return strcmp(a->name, b->name);
+#include "splay_tree.h"
+#include "logger.h"
+#include "net.h"
+#include "netutl.h"
+#include "node.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);
}
-void init_nodes(void)
-{
-cp
- node_tree = avl_alloc_tree((avl_compare_t)node_compare, NULL);
-cp
+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;
}
-void exit_nodes(void)
-{
-cp
- avl_delete_tree(node_tree);
-cp
+void init_nodes(void) {
+ cp();
+
+ 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);
}
-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 exit_nodes(void) {
+ cp();
+
+ splay_delete_tree(node_udp_tree);
+ splay_delete_tree(node_tree);
}
-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);
- if(n->config)
- clear_config(&n->config);
- free(n);
-cp
+node_t *new_node(void) {
+ node_t *n = xmalloc_and_zero(sizeof(*n));
+
+ cp();
+
+ n->subnet_tree = new_subnet_tree();
+ n->edge_tree = new_edge_tree();
+ n->queue = list_alloc((list_action_t) free);
+ n->mtu = MTU;
+ n->maxmtu = MTU;
+
+ return n;
}
-node_t *lookup_node(char *name)
-{
- node_t n;
-cp
- n.name = name;
- return avl_search(node_tree, &n);
+void free_node(node_t *n) {
+ cp();
+
+ if(n->queue)
+ list_delete_list(n->queue);
+
+ if(n->subnet_tree)
+ free_subnet_tree(n->subnet_tree);
+
+ if(n->edge_tree)
+ free_edge_tree(n->edge_tree);
+
+ sockaddrfree(&n->address);
+
+ cipher_close(&n->cipher);
+ digest_close(&n->digest);
+
+ event_del(&n->mtuevent);
+
+ if(n->hostname)
+ free(n->hostname);
+
+ if(n->name)
+ free(n->name);
+
+ free(n);
}
+void node_add(node_t *n) {
+ cp();
-int read_host_config(nodet *n)
-{
- char *fname;
- int x;
-cp
- asprintf(&fname, "%s/hosts/%s", confbase, n->name);
- x = read_config_file(&n->config, fname);
- free(fname);
-cp
- return x;
+ splay_insert(node_tree, n);
}
-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 = (connection_t *)node->data;
- syslog(LOG_DEBUG, _(" %s at %s port %hd options %ld sockets %d, %d status %04x"),
- n->name, n->hostname, n->port, n->options,
- n->socket, n->meta_socket, n->status);
- }
-
- syslog(LOG_DEBUG, _("End of nodes."));
-cp
+void node_del(node_t *n) {
+ splay_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;
+ subnet_del(n, s);
+ }
+
+ for(node = n->edge_tree->head; node; node = next) {
+ next = node->next;
+ e = node->data;
+ edge_del(e);
+ }
+
+ splay_delete(node_tree, n);
+}
+
+node_t *lookup_node(char *name) {
+ node_t n = {0};
+
+ cp();
+
+ n.name = name;
+
+ return splay_search(node_tree, &n);
+}
+
+node_t *lookup_node_udp(const sockaddr_t *sa) {
+ node_t n = {0};
+
+ cp();
+
+ n.address = *sa;
+ n.name = NULL;
+
+ return splay_search(node_udp_tree, &n);
+}
+
+void dump_nodes(void) {
+ splay_node_t *node;
+ node_t *n;
+
+ cp();
+
+ 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 pmtu %d (min %d max %d)"),
+ n->name, n->hostname, cipher_get_nid(&n->cipher),
+ digest_get_nid(&n->digest), n->maclength, n->compression,
+ n->options, *(uint32_t *)&n->status, n->nexthop ? n->nexthop->name : "-",
+ n->via ? n->via->name : "-", n->mtu, n->minmtu, n->maxmtu);
+ }
+
+ logger(LOG_DEBUG, _("End of nodes."));
}