2 node.c -- node tree management
3 Copyright (C) 2001-2013 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.
23 #include "address_cache.h"
24 #include "control_common.h"
29 #include "splay_tree.h"
33 #include "ed25519/sha512.h"
35 splay_tree_t *node_tree;
36 static splay_tree_t *node_id_tree;
37 static splay_tree_t *node_udp_tree;
41 static int node_compare(const node_t *a, const node_t *b) {
42 return strcmp(a->name, b->name);
45 static int node_id_compare(const node_t *a, const node_t *b) {
46 return memcmp(&a->id, &b->id, sizeof(node_id_t));
49 static int node_udp_compare(const node_t *a, const node_t *b) {
50 int result = sockaddrcmp(&a->address, &b->address);
56 return (a->name && b->name) ? strcmp(a->name, b->name) : 0;
59 void init_nodes(void) {
60 node_tree = splay_alloc_tree((splay_compare_t) node_compare, (splay_action_t) free_node);
61 node_id_tree = splay_alloc_tree((splay_compare_t) node_id_compare, NULL);
62 node_udp_tree = splay_alloc_tree((splay_compare_t) node_udp_compare, NULL);
65 void exit_nodes(void) {
66 splay_delete_tree(node_udp_tree);
67 splay_delete_tree(node_id_tree);
68 splay_delete_tree(node_tree);
71 node_t *new_node(void) {
72 node_t *n = xzalloc(sizeof(*n));
75 n->late = xzalloc(replaywin);
78 n->subnet_tree = new_subnet_tree();
79 n->edge_tree = new_edge_tree();
87 void free_node(node_t *n) {
89 free_subnet_tree(n->subnet_tree);
93 free_edge_tree(n->edge_tree);
96 sockaddrfree(&n->address);
98 #ifndef DISABLE_LEGACY
99 cipher_close(n->incipher);
100 digest_close(n->indigest);
101 cipher_close(n->outcipher);
102 digest_close(n->outdigest);
105 ecdsa_free(n->ecdsa);
106 sptps_stop(&n->sptps);
108 timeout_del(&n->udp_ping_timeout);
114 if(n->address_cache) {
115 close_address_cache(n->address_cache);
121 void node_add(node_t *n) {
122 unsigned char buf[64];
123 sha512(n->name, strlen(n->name), buf);
124 memcpy(&n->id, buf, sizeof(n->id));
126 splay_insert(node_tree, n);
127 splay_insert(node_id_tree, n);
130 void node_del(node_t *n) {
131 splay_delete(node_udp_tree, n);
133 for splay_each(subnet_t, s, n->subnet_tree) {
137 for splay_each(edge_t, e, n->edge_tree) {
141 splay_delete(node_id_tree, n);
142 splay_delete(node_tree, n);
145 node_t *lookup_node(char *name) {
150 return splay_search(node_tree, &n);
153 node_t *lookup_node_id(const node_id_t *id) {
154 node_t n = {.id = *id};
155 return splay_search(node_id_tree, &n);
158 node_t *lookup_node_udp(const sockaddr_t *sa) {
159 node_t tmp = {.address = *sa};
160 return splay_search(node_udp_tree, &tmp);
163 void update_node_udp(node_t *n, const sockaddr_t *sa) {
165 logger(DEBUG_ALWAYS, LOG_WARNING, "Trying to update UDP address of myself!");
169 splay_delete(node_udp_tree, n);
175 for(int i = 0; i < listen_sockets; i++) {
176 if(listen_socket[i].sa.sa.sa_family == sa->sa.sa_family) {
182 splay_insert(node_udp_tree, n);
184 n->hostname = sockaddr2hostname(&n->address);
185 logger(DEBUG_PROTOCOL, LOG_DEBUG, "UDP address of %s set to %s", n->name, n->hostname);
188 /* invalidate UDP information - note that this is a security feature as well to make sure
189 we can't be tricked into flooding any random address with UDP packets */
190 n->status.udp_confirmed = false;
197 bool dump_nodes(connection_t *c) {
198 for splay_each(node_t, n, node_tree) {
199 char id[2 * sizeof(n->id) + 1];
201 for(size_t c = 0; c < sizeof(n->id); ++c) {
202 snprintf(id + 2 * c, 3, "%02x", n->id.x[c]);
205 id[sizeof(id) - 1] = 0;
206 send_request(c, "%d %d %s %s %s %d %d %d %d %x %x %s %s %d %d %d %d %ld %d %"PRIu64" %"PRIu64" %"PRIu64" %"PRIu64, CONTROL, REQ_DUMP_NODES,
207 n->name, id, n->hostname ? n->hostname : "unknown port unknown",
208 #ifdef DISABLE_LEGACY
211 cipher_get_nid(n->outcipher), digest_get_nid(n->outdigest), (int)digest_length(n->outdigest),
213 n->outcompression, n->options, bitfield_to_int(&n->status, sizeof(n->status)),
214 n->nexthop ? n->nexthop->name : "-", n->via && n->via->name ? n->via->name : "-", n->distance,
215 n->mtu, n->minmtu, n->maxmtu, (long)n->last_state_change, n->udp_ping_rtt,
216 n->in_packets, n->in_bytes, n->out_packets, n->out_bytes);
219 return send_request(c, "%d %d", CONTROL, REQ_DUMP_NODES);
222 bool dump_traffic(connection_t *c) {
223 for splay_each(node_t, n, node_tree)
224 send_request(c, "%d %d %s %"PRIu64" %"PRIu64" %"PRIu64" %"PRIu64, CONTROL, REQ_DUMP_TRAFFIC,
225 n->name, n->in_packets, n->in_bytes, n->out_packets, n->out_bytes);
227 return send_request(c, "%d %d", CONTROL, REQ_DUMP_TRAFFIC);