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 splay_tree_t *node_tree;
34 static hash_t *node_udp_cache;
38 static int node_compare(const node_t *a, const node_t *b) {
39 return strcmp(a->name, b->name);
42 void init_nodes(void) {
43 node_tree = splay_alloc_tree((splay_compare_t) node_compare, (splay_action_t) free_node);
44 node_udp_cache = hash_alloc(0x100, sizeof(sockaddr_t));
47 void exit_nodes(void) {
48 hash_free(node_udp_cache);
49 splay_delete_tree(node_tree);
52 node_t *new_node(void) {
53 node_t *n = xzalloc(sizeof *n);
55 if(replaywin) n->late = xzalloc(replaywin);
56 n->subnet_tree = new_subnet_tree();
57 n->edge_tree = new_edge_tree();
64 void free_node(node_t *n) {
66 free_subnet_tree(n->subnet_tree);
69 free_edge_tree(n->edge_tree);
71 sockaddrfree(&n->address);
73 cipher_close(n->incipher);
74 digest_close(n->indigest);
75 cipher_close(n->outcipher);
76 digest_close(n->outdigest);
79 sptps_stop(&n->sptps);
81 timeout_del(&n->mtutimeout);
95 void node_add(node_t *n) {
96 splay_insert(node_tree, n);
99 void node_del(node_t *n) {
100 for splay_each(subnet_t, s, n->subnet_tree)
103 for splay_each(edge_t, e, n->edge_tree)
106 splay_delete(node_tree, n);
109 node_t *lookup_node(char *name) {
114 return splay_search(node_tree, &n);
117 node_t *lookup_node_udp(const sockaddr_t *sa) {
118 return hash_search(node_udp_cache, sa);
121 void update_node_udp(node_t *n, const sockaddr_t *sa) {
123 logger(DEBUG_ALWAYS, LOG_WARNING, "Trying to update UDP address of myself!");
127 hash_insert(node_udp_cache, &n->address, NULL);
132 for(int i = 0; i < listen_sockets; i++) {
133 if(listen_socket[i].sa.sa.sa_family == sa->sa.sa_family) {
138 hash_insert(node_udp_cache, sa, n);
140 n->hostname = sockaddr2hostname(&n->address);
141 logger(DEBUG_PROTOCOL, LOG_DEBUG, "UDP address of %s set to %s", n->name, n->hostname);
145 bool dump_nodes(connection_t *c) {
146 for splay_each(node_t, n, node_tree)
147 send_request(c, "%d %d %s %s %d %d %d %d %x %x %s %s %d %hd %hd %hd %ld", CONTROL, REQ_DUMP_NODES,
148 n->name, n->hostname ?: "unknown port unknown", cipher_get_nid(n->outcipher),
149 digest_get_nid(n->outdigest), (int)digest_length(n->outdigest), n->outcompression,
150 n->options, bitfield_to_int(&n->status, sizeof n->status), n->nexthop ? n->nexthop->name : "-",
151 n->via ? n->via->name ?: "-" : "-", n->distance, n->mtu, n->minmtu, n->maxmtu, (long)n->last_state_change);
153 return send_request(c, "%d %d", CONTROL, REQ_DUMP_NODES);
156 bool dump_traffic(connection_t *c) {
157 for splay_each(node_t, n, node_tree)
158 send_request(c, "%d %d %s %"PRIu64" %"PRIu64" %"PRIu64" %"PRIu64, CONTROL, REQ_DUMP_TRAFFIC,
159 n->name, n->in_packets, n->in_bytes, n->out_packets, n->out_bytes);
161 return send_request(c, "%d %d", CONTROL, REQ_DUMP_TRAFFIC);