2 node.c -- node tree management
3 Copyright (C) 2001-2009 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) {
47 node_tree = avl_alloc_tree((avl_compare_t) node_compare, (avl_action_t) free_node);
48 node_udp_tree = avl_alloc_tree((avl_compare_t) node_udp_compare, NULL);
51 void exit_nodes(void) {
54 avl_delete_tree(node_udp_tree);
55 avl_delete_tree(node_tree);
58 node_t *new_node(void) {
59 node_t *n = xmalloc_and_zero(sizeof(*n));
63 n->subnet_tree = new_subnet_tree();
64 n->edge_tree = new_edge_tree();
65 EVP_CIPHER_CTX_init(&n->inctx);
66 EVP_CIPHER_CTX_init(&n->outctx);
73 void free_node(node_t *n) {
83 free_subnet_tree(n->subnet_tree);
86 free_edge_tree(n->edge_tree);
88 sockaddrfree(&n->address);
90 EVP_CIPHER_CTX_cleanup(&n->inctx);
91 EVP_CIPHER_CTX_cleanup(&n->outctx);
94 event_del(n->mtuevent);
105 void node_add(node_t *n) {
108 avl_insert(node_tree, n);
111 void node_del(node_t *n) {
112 avl_node_t *node, *next;
118 for(node = n->subnet_tree->head; node; node = next) {
124 for(node = n->edge_tree->head; node; node = next) {
130 avl_delete(node_udp_tree, n);
131 avl_delete(node_tree, n);
134 node_t *lookup_node(char *name) {
141 return avl_search(node_tree, &n);
144 node_t *lookup_node_udp(const sockaddr_t *sa) {
152 return avl_search(node_udp_tree, &n);
155 void update_node_udp(node_t *n, const sockaddr_t *sa) {
156 avl_delete(node_udp_tree, n);
163 n->hostname = sockaddr2hostname(&n->address);
164 avl_insert(node_udp_tree, n);
165 ifdebug(PROTOCOL) logger(LOG_DEBUG, "UDP address of %s set to %s", n->name, n->hostname);
167 memset(&n->address, 0, sizeof n->address);
169 ifdebug(PROTOCOL) logger(LOG_DEBUG, "UDP address of %s cleared", n->name);
173 void dump_nodes(void) {
179 logger(LOG_DEBUG, _("Nodes:"));
181 for(node = node_tree->head; node; node = node->next) {
183 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)"),
184 n->name, n->hostname, n->outcipher ? n->outcipher->nid : 0,
185 n->outdigest ? n->outdigest->type : 0, n->outmaclength, n->outcompression,
186 n->options, bitfield_to_int(&n->status, sizeof n->status), n->nexthop ? n->nexthop->name : "-",
187 n->via ? n->via->name : "-", n->mtu, n->minmtu, n->maxmtu);
190 logger(LOG_DEBUG, _("End of nodes."));