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 "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();
86 void free_node(node_t *n) {
88 free_subnet_tree(n->subnet_tree);
92 free_edge_tree(n->edge_tree);
95 sockaddrfree(&n->address);
97 #ifndef DISABLE_LEGACY
98 cipher_close(n->incipher);
99 digest_close(n->indigest);
100 cipher_close(n->outcipher);
101 digest_close(n->outdigest);
104 ecdsa_free(n->ecdsa);
105 sptps_stop(&n->sptps);
107 timeout_del(&n->udp_ping_timeout);
124 void node_add(node_t *n) {
125 unsigned char buf[64];
126 sha512(n->name, strlen(n->name), buf);
127 memcpy(&n->id, buf, sizeof(n->id));
129 splay_insert(node_tree, n);
130 splay_insert(node_id_tree, n);
133 void node_del(node_t *n) {
134 splay_delete(node_udp_tree, n);
136 for splay_each(subnet_t, s, n->subnet_tree) {
140 for splay_each(edge_t, e, n->edge_tree) {
144 splay_delete(node_id_tree, n);
145 splay_delete(node_tree, n);
148 node_t *lookup_node(char *name) {
153 return splay_search(node_tree, &n);
156 node_t *lookup_node_id(const node_id_t *id) {
157 node_t n = {.id = *id};
158 return splay_search(node_id_tree, &n);
161 node_t *lookup_node_udp(const sockaddr_t *sa) {
162 node_t tmp = {.address = *sa};
163 return splay_search(node_udp_tree, &tmp);
166 void update_node_udp(node_t *n, const sockaddr_t *sa) {
168 logger(DEBUG_ALWAYS, LOG_WARNING, "Trying to update UDP address of myself!");
172 splay_delete(node_udp_tree, n);
178 for(int i = 0; i < listen_sockets; i++) {
179 if(listen_socket[i].sa.sa.sa_family == sa->sa.sa_family) {
185 splay_insert(node_udp_tree, n);
187 n->hostname = sockaddr2hostname(&n->address);
188 logger(DEBUG_PROTOCOL, LOG_DEBUG, "UDP address of %s set to %s", n->name, n->hostname);
191 /* invalidate UDP information - note that this is a security feature as well to make sure
192 we can't be tricked into flooding any random address with UDP packets */
193 n->status.udp_confirmed = false;
200 bool dump_nodes(connection_t *c) {
201 for splay_each(node_t, n, node_tree) {
202 char id[2 * sizeof(n->id) + 1];
204 for(size_t c = 0; c < sizeof(n->id); ++c) {
205 snprintf(id + 2 * c, 3, "%02x", n->id.x[c]);
208 id[sizeof(id) - 1] = 0;
209 send_request(c, "%d %d %s %s %s %d %d %d %d %x %x %s %s %d %d %d %d %ld", CONTROL, REQ_DUMP_NODES,
210 n->name, id, n->hostname ? : "unknown port unknown",
211 #ifdef DISABLE_LEGACY
214 cipher_get_nid(n->outcipher), digest_get_nid(n->outdigest), (int)digest_length(n->outdigest),
216 n->outcompression, n->options, bitfield_to_int(&n->status, sizeof(n->status)),
217 n->nexthop ? n->nexthop->name : "-", n->via ? n->via->name ? : "-" : "-", n->distance,
218 n->mtu, n->minmtu, n->maxmtu, (long)n->last_state_change);
221 return send_request(c, "%d %d", CONTROL, REQ_DUMP_NODES);
224 bool dump_traffic(connection_t *c) {
225 for splay_each(node_t, n, node_tree)
226 send_request(c, "%d %d %s %"PRIu64" %"PRIu64" %"PRIu64" %"PRIu64, CONTROL, REQ_DUMP_TRAFFIC,
227 n->name, n->in_packets, n->in_bytes, n->out_packets, n->out_bytes);
229 return send_request(c, "%d %d", CONTROL, REQ_DUMP_TRAFFIC);