5 node.h -- header for node.c
6 Copyright (C) 2001-2013 Guus Sliepen <guus@tinc-vpn.org>,
7 2001-2005 Ivo Timmermans
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2 of the License, or
12 (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License along
20 with this program; if not, write to the Free Software Foundation, Inc.,
21 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
24 #include "splay_tree.h"
26 #include "connection.h"
30 #include "compression.h"
32 typedef union node_status_t {
34 bool unused_active: 1; /* 1 if active (not used for nodes) */
35 bool validkey: 1; /* 1 if we currently have a valid key for him */
36 bool waitingforkey: 1; /* 1 if we already sent out a request */
37 bool visited: 1; /* 1 if this node has been visited by one of the graph algorithms */
38 bool reachable: 1; /* 1 if this node is reachable in the graph */
39 bool indirect: 1; /* 1 if this node is not directly reachable by us */
40 bool sptps: 1; /* 1 if this node supports SPTPS */
41 bool udp_confirmed: 1; /* 1 if the address is one that we received UDP traffic on */
42 bool send_locally: 1; /* 1 if the next UDP packet should be sent on the local network */
43 bool udppacket: 1; /* 1 if the most recently received packet was UDP */
44 bool validkey_in: 1; /* 1 if we have sent a valid key to him */
45 bool has_address: 1; /* 1 if we know an external address for this node */
46 bool ping_sent: 1; /* 1 if we sent a UDP probe but haven't received the reply yet */
51 typedef struct node_t {
52 char *name; /* name of this node */
53 char *hostname; /* the hostname of its real ip */
54 node_id_t id; /* unique node ID (name hash) */
55 uint32_t options; /* options turned on for this node */
57 size_t sock; /* Socket to use for outgoing UDP packets */
58 sockaddr_t address; /* his real (internet) ip to send UDP packets to */
61 time_t last_state_change;
64 ecdsa_t *ecdsa; /* His public ECDSA key */
67 #ifndef DISABLE_LEGACY
68 cipher_t *incipher; /* Cipher for UDP packets */
69 digest_t *indigest; /* Digest for UDP packets */
71 cipher_t *outcipher; /* Cipher for UDP packets */
72 digest_t *outdigest; /* Digest for UDP packets */
75 compression_level_t incompression; /* Compression level, 0 = no compression */
76 compression_level_t outcompression; /* Compression level, 0 = no compression */
79 struct node_t *nexthop; /* nearest node from us to him */
80 struct edge_t *prevedge; /* nearest node from him to us */
81 struct node_t *via; /* next hop for UDP packets */
83 splay_tree_t subnet_tree; /* Pointer to a tree of subnets belonging to this node */
85 splay_tree_t edge_tree; /* Edges with this node as one of the endpoints */
87 struct connection_t *connection; /* Connection associated with this node (if a direct connection exists) */
89 uint32_t sent_seqno; /* Sequence number last sent to this node */
90 uint32_t received_seqno; /* Sequence number last received from this node */
91 uint32_t received; /* Total valid packets received from this node */
92 uint32_t farfuture; /* Packets in a row that have arrived from the far future */
93 uint8_t *late; /* Bitfield marking late packets */
95 struct timeval udp_reply_sent; /* Last time a (gratuitous) UDP probe reply was sent */
96 struct timeval udp_ping_sent; /* Last time a UDP probe was sent */
97 int udp_ping_rtt; /* Round trip time of UDP ping (in microseconds; or -1 if !status.udp_confirmed) */
98 timeout_t udp_ping_timeout; /* Ping timeout event */
100 struct timeval mtu_ping_sent; /* Last time a MTU probe was sent */
102 struct timeval mtu_info_sent; /* Last time a MTU_INFO message was sent */
103 struct timeval udp_info_sent; /* Last time a UDP_INFO message was sent */
105 length_t maxrecentlen; /* Maximum size of recently received packets */
107 length_t mtu; /* Maximum size of packets to send to this node */
108 length_t minmtu; /* Probed minimum MTU */
109 length_t maxmtu; /* Probed maximum MTU */
110 int mtuprobes; /* Number of probes */
114 uint64_t out_packets;
117 struct address_cache_t *address_cache;
120 extern struct node_t *myself;
121 extern splay_tree_t node_tree;
123 extern void exit_nodes(void);
124 extern void free_node(node_t *n);
125 extern node_t *new_node(const char *name) ATTR_MALLOC ATTR_DEALLOCATOR(free_node);
126 extern void node_add(node_t *n);
127 extern void node_del(node_t *n);
128 extern node_t *lookup_node(char *name);
129 extern node_t *lookup_node_id(const node_id_t *id);
130 extern node_t *lookup_node_udp(const sockaddr_t *sa);
131 extern bool dump_nodes(struct connection_t *c);
132 extern bool dump_traffic(struct connection_t *c);
133 extern void update_node_udp(node_t *n, const sockaddr_t *sa);