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"
31 typedef struct node_status_t {
32 int unused_active:1; /* 1 if active (not used for nodes) */
33 int validkey:1; /* 1 if we currently have a valid key for him */
34 int unused_waitingforkey:1; /* 1 if we already sent out a request */
35 int visited:1; /* 1 if this node has been visited by one of the graph algorithms */
36 int reachable:1; /* 1 if this node is reachable in the graph */
37 int indirect:1; /* 1 if this node is not directly reachable by us */
41 typedef struct node_t {
42 char *name; /* name of this node */
43 uint32_t options; /* options turned on for this node */
45 sockaddr_t address; /* his real (internet) ip to send UDP packets to */
46 char *hostname; /* the hostname of its real ip */
51 cipher_t incipher; /* Cipher for UDP packets */
52 digest_t indigest; /* Digest for UDP packets */
54 cipher_t outcipher; /* Cipher for UDP packets */
55 digest_t outdigest; /* Digest for UDP packets */
57 int incompression; /* Compressionlevel, 0 = no compression */
58 int outcompression; /* Compressionlevel, 0 = no compression */
61 struct node_t *nexthop; /* nearest node from us to him */
62 struct node_t *via; /* next hop for UDP packets */
64 splay_tree_t *subnet_tree; /* Pointer to a tree of subnets belonging to this node */
66 splay_tree_t *edge_tree; /* Edges with this node as one of the endpoints */
68 struct connection_t *connection; /* Connection associated with this node (if a direct connection exists) */
70 uint32_t sent_seqno; /* Sequence number last sent to this node */
71 uint32_t received_seqno; /* Sequence number last received from this node */
72 uint32_t farfuture; /* Packets in a row that have arrived from the far future */
73 unsigned char* late; /* Bitfield marking late packets */
75 length_t mtu; /* Maximum size of packets to send to this node */
76 length_t minmtu; /* Probed minimum MTU */
77 length_t maxmtu; /* Probed maximum MTU */
78 int mtuprobes; /* Number of probes */
79 struct event mtuevent; /* Probe event */
82 extern struct node_t *myself;
83 extern splay_tree_t *node_tree;
84 extern splay_tree_t *node_udp_tree;
86 extern void init_nodes(void);
87 extern void exit_nodes(void);
88 extern node_t *new_node(void) __attribute__ ((__malloc__));
89 extern void free_node(node_t *);
90 extern void node_add(node_t *);
91 extern void node_del(node_t *);
92 extern node_t *lookup_node(char *);
93 extern node_t *lookup_node_udp(const sockaddr_t *);
94 extern bool dump_nodes(struct connection_t *);
95 extern void update_node_udp(node_t *, const sockaddr_t *);
97 #endif /* __TINC_NODE_H__ */