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
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25 #include "splay_tree.h"
33 splay_tree_t *node_tree; /* Known nodes, sorted by name */
34 splay_tree_t *node_udp_tree; /* Known nodes, sorted by address and port */
38 static int node_compare(const node_t *a, const node_t *b) {
39 return strcmp(a->name, b->name);
42 static int node_udp_compare(const node_t *a, const node_t *b) {
47 result = sockaddrcmp(&a->address, &b->address);
52 return (a->name && b->name) ? strcmp(a->name, b->name) : 0;
55 void init_nodes(void) {
58 node_tree = splay_alloc_tree((splay_compare_t) node_compare, (splay_action_t) free_node);
59 node_udp_tree = splay_alloc_tree((splay_compare_t) node_udp_compare, NULL);
62 void exit_nodes(void) {
65 splay_delete_tree(node_udp_tree);
66 splay_delete_tree(node_tree);
69 node_t *new_node(void) {
70 node_t *n = xmalloc_and_zero(sizeof *n);
74 n->subnet_tree = new_subnet_tree();
75 n->edge_tree = new_edge_tree();
82 void free_node(node_t *n) {
86 free_subnet_tree(n->subnet_tree);
89 free_edge_tree(n->edge_tree);
91 sockaddrfree(&n->address);
93 cipher_close(&n->incipher);
94 digest_close(&n->indigest);
95 cipher_close(&n->outcipher);
96 digest_close(&n->outdigest);
98 event_del(&n->mtuevent);
109 void node_add(node_t *n) {
112 splay_insert(node_tree, n);
115 void node_del(node_t *n) {
116 splay_node_t *node, *next;
122 for(node = n->subnet_tree->head; node; node = next) {
128 for(node = n->edge_tree->head; node; node = next) {
134 splay_delete(node_udp_tree, n);
135 splay_delete(node_tree, n);
138 node_t *lookup_node(char *name) {
145 return splay_search(node_tree, &n);
148 node_t *lookup_node_udp(const sockaddr_t *sa) {
156 return splay_search(node_udp_tree, &n);
159 void update_node_udp(node_t *n, const sockaddr_t *sa)
161 splay_delete(node_udp_tree, n);
168 n->hostname = sockaddr2hostname(&n->address);
169 splay_insert(node_udp_tree, n);
170 logger(LOG_DEBUG, "UDP address of %s set to %s", n->name, n->hostname);
172 memset(&n->address, 0, sizeof n->address);
174 ifdebug(PROTOCOL) logger(LOG_DEBUG, "UDP address of %s cleared", n->name);
178 int dump_nodes(struct evbuffer *out) {
184 for(node = node_tree->head; node; node = node->next) {
186 if(evbuffer_add_printf(out, _(" %s at %s cipher %d digest %d maclength %d compression %d options %lx status %04x nexthop %s via %s distance %d pmtu %d (min %d max %d)\n"),
187 n->name, n->hostname, cipher_get_nid(&n->outcipher),
188 digest_get_nid(&n->outdigest), digest_length(&n->outdigest), n->outcompression,
189 n->options, bitfield_to_int(&n->status, sizeof n->status), n->nexthop ? n->nexthop->name : "-",
190 n->via ? n->via->name : "-", n->distance, n->mtu, n->minmtu, n->maxmtu) == -1)