2 node.c -- node tree management
3 Copyright (C) 2001-2011 Guus Sliepen <guus@tinc-vpn.org>,
4 2001-2005 Ivo Timmermans
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License along
17 with this program; if not, write to the Free Software Foundation, Inc.,
18 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
31 avl_tree_t *node_tree; /* Known nodes, sorted by name */
32 avl_tree_t *node_udp_tree; /* Known nodes, sorted by address and port */
36 static int node_compare(const node_t *a, const node_t *b) {
37 return strcmp(a->name, b->name);
40 static int node_udp_compare(const node_t *a, const node_t *b) {
41 return sockaddrcmp(&a->address, &b->address);
44 void init_nodes(void) {
45 node_tree = avl_alloc_tree((avl_compare_t) node_compare, (avl_action_t) free_node);
46 node_udp_tree = avl_alloc_tree((avl_compare_t) node_udp_compare, NULL);
49 void exit_nodes(void) {
50 avl_delete_tree(node_udp_tree);
51 avl_delete_tree(node_tree);
54 node_t *new_node(void) {
55 node_t *n = xmalloc_and_zero(sizeof(*n));
57 if(replaywin) n->late = xmalloc_and_zero(replaywin);
58 n->subnet_tree = new_subnet_tree();
59 n->edge_tree = new_edge_tree();
60 EVP_CIPHER_CTX_init(&n->inctx);
61 EVP_CIPHER_CTX_init(&n->outctx);
68 void free_node(node_t *n) {
76 free_subnet_tree(n->subnet_tree);
79 free_edge_tree(n->edge_tree);
81 sockaddrfree(&n->address);
83 EVP_CIPHER_CTX_cleanup(&n->inctx);
84 EVP_CIPHER_CTX_cleanup(&n->outctx);
87 event_del(n->mtuevent);
101 void node_add(node_t *n) {
102 avl_insert(node_tree, n);
105 void node_del(node_t *n) {
106 avl_node_t *node, *next;
110 for(node = n->subnet_tree->head; node; node = next) {
116 for(node = n->edge_tree->head; node; node = next) {
122 avl_delete(node_udp_tree, n);
123 avl_delete(node_tree, n);
126 node_t *lookup_node(char *name) {
131 return avl_search(node_tree, &n);
134 node_t *lookup_node_udp(const sockaddr_t *sa) {
140 return avl_search(node_udp_tree, &n);
143 void update_node_udp(node_t *n, const sockaddr_t *sa) {
145 logger(LOG_WARNING, "Trying to update UDP address of myself!");
149 avl_delete(node_udp_tree, n);
156 n->hostname = sockaddr2hostname(&n->address);
157 avl_insert(node_udp_tree, n);
158 ifdebug(PROTOCOL) logger(LOG_DEBUG, "UDP address of %s set to %s", n->name, n->hostname);
160 memset(&n->address, 0, sizeof n->address);
162 ifdebug(PROTOCOL) logger(LOG_DEBUG, "UDP address of %s cleared", n->name);
166 void dump_nodes(void) {
170 logger(LOG_DEBUG, "Nodes:");
172 for(node = node_tree->head; node; node = node->next) {
174 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)",
175 n->name, n->hostname, n->outcipher ? n->outcipher->nid : 0,
176 n->outdigest ? n->outdigest->type : 0, n->outmaclength, n->outcompression,
177 n->options, bitfield_to_int(&n->status, sizeof n->status), n->nexthop ? n->nexthop->name : "-",
178 n->via ? n->via->name : "-", n->mtu, n->minmtu, n->maxmtu);
181 logger(LOG_DEBUG, "End of nodes.");