2 node.h -- header for node.c
3 Copyright (C) 2001-2006 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
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
23 #ifndef __TINC_NODE_H__
24 #define __TINC_NODE_H__
26 #include "splay_tree.h"
28 #include "connection.h"
33 typedef union node_status_t {
35 int unused_active:1; /* 1 if active (not used for nodes) */
36 int validkey:1; /* 1 if we currently have a valid key for him */
37 int waitingforkey:1; /* 1 if we already sent out a request */
38 int visited:1; /* 1 if this node has been visited by one of the graph algorithms */
39 int reachable:1; /* 1 if this node is reachable in the graph */
40 int indirect:1; /* 1 if this node is not directly reachable by us */
46 typedef struct node_t {
47 char *name; /* name of this node */
48 long int options; /* options turned on for this node */
50 sockaddr_t address; /* his real (internet) ip to send UDP packets to */
51 char *hostname; /* the hostname of its real ip */
55 cipher_t cipher; /* Cipher for UDP packets */
56 digest_t digest; /* Digest for UDP packets */
57 int maclength; /* Portion of digest to use */
59 int compression; /* Compressionlevel, 0 = no compression */
61 list_t *queue; /* Queue for packets awaiting to be encrypted */
64 struct node_t *nexthop; /* nearest node from us to him */
65 struct node_t *via; /* next hop for UDP packets */
67 splay_tree_t *subnet_tree; /* Pointer to a tree of subnets belonging to this node */
69 splay_tree_t *edge_tree; /* Edges with this node as one of the endpoints */
71 struct connection_t *connection; /* Connection associated with this node (if a direct connection exists) */
73 uint32_t sent_seqno; /* Sequence number last sent to this node */
74 uint32_t received_seqno; /* Sequence number last received from this node */
75 unsigned char late[16]; /* Bitfield marking late packets */
77 length_t mtu; /* Maximum size of packets to send to this node */
78 length_t minmtu; /* Probed minimum MTU */
79 length_t maxmtu; /* Probed maximum MTU */
80 int mtuprobes; /* Number of probes */
81 struct event mtuevent; /* Probe event */
84 extern struct node_t *myself;
85 extern splay_tree_t *node_tree;
86 extern splay_tree_t *node_udp_tree;
88 extern void init_nodes(void);
89 extern void exit_nodes(void);
90 extern node_t *new_node(void) __attribute__ ((__malloc__));
91 extern void free_node(node_t *);
92 extern void node_add(node_t *);
93 extern void node_del(node_t *);
94 extern node_t *lookup_node(char *);
95 extern node_t *lookup_node_udp(const sockaddr_t *);
96 extern int dump_nodes(struct evbuffer *);
98 #endif /* __TINC_NODE_H__ */