2 node.h -- header for node.c
3 Copyright (C) 2001-2010 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.
21 #ifndef __TINC_NODE_H__
22 #define __TINC_NODE_H__
24 #include "splay_tree.h"
26 #include "connection.h"
30 typedef struct node_status_t {
31 unsigned int unused_active:1; /* 1 if active (not used for nodes) */
32 unsigned int validkey:1; /* 1 if we currently have a valid key for him */
33 unsigned int unused_waitingforkey:1; /* 1 if we already sent out a request */
34 unsigned int visited:1; /* 1 if this node has been visited by one of the graph algorithms */
35 unsigned int reachable:1; /* 1 if this node is reachable in the graph */
36 unsigned int indirect:1; /* 1 if this node is not directly reachable by us */
37 unsigned int unused:26;
40 typedef struct node_t {
41 char *name; /* name of this node */
42 uint32_t options; /* options turned on for this node */
44 sockaddr_t address; /* his real (internet) ip to send UDP packets to */
45 char *hostname; /* the hostname of its real ip */
50 cipher_t incipher; /* Cipher for UDP packets */
51 digest_t indigest; /* Digest for UDP packets */
53 cipher_t outcipher; /* Cipher for UDP packets */
54 digest_t outdigest; /* Digest for UDP packets */
56 int incompression; /* Compressionlevel, 0 = no compression */
57 int outcompression; /* Compressionlevel, 0 = no compression */
60 struct node_t *nexthop; /* nearest node from us to him */
61 struct node_t *via; /* next hop for UDP packets */
63 splay_tree_t *subnet_tree; /* Pointer to a tree of subnets belonging to this node */
65 splay_tree_t *edge_tree; /* Edges with this node as one of the endpoints */
67 struct connection_t *connection; /* Connection associated with this node (if a direct connection exists) */
69 uint32_t sent_seqno; /* Sequence number last sent to this node */
70 uint32_t received_seqno; /* Sequence number last received from this node */
71 uint32_t farfuture; /* Packets in a row that have arrived from the far future */
72 unsigned char* late; /* Bitfield marking late packets */
74 length_t mtu; /* Maximum size of packets to send to this node */
75 length_t minmtu; /* Probed minimum MTU */
76 length_t maxmtu; /* Probed maximum MTU */
77 int mtuprobes; /* Number of probes */
78 struct event mtuevent; /* Probe event */
86 extern struct node_t *myself;
87 extern splay_tree_t *node_tree;
88 extern splay_tree_t *node_udp_tree;
90 extern void init_nodes(void);
91 extern void exit_nodes(void);
92 extern node_t *new_node(void) __attribute__ ((__malloc__));
93 extern void free_node(node_t *);
94 extern void node_add(node_t *);
95 extern void node_del(node_t *);
96 extern node_t *lookup_node(char *);
97 extern node_t *lookup_node_udp(const sockaddr_t *);
98 extern bool dump_nodes(struct connection_t *);
99 extern bool dump_traffic(struct connection_t *);
100 extern void update_node_udp(node_t *, const sockaddr_t *);
102 #endif /* __TINC_NODE_H__ */