2 node.h -- header for node.c
3 Copyright (C) 2001-2003 Guus Sliepen <guus@sliepen.eu.org>,
4 2001-2003 Ivo Timmermans <ivo@o2w.nl>
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.
20 $Id: node.h,v 1.1.2.31 2003/12/22 11:04:16 guus Exp $
23 #ifndef __TINC_NODE_H__
24 #define __TINC_NODE_H__
29 #include "connection.h"
34 typedef struct node_status_t {
35 int active:1; /* 1 if active.. */
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 */
44 typedef struct node_t {
45 char *name; /* name of this node */
46 long int options; /* options turned on for this node */
48 sockaddr_t address; /* his real (internet) ip to send UDP packets to */
49 char *hostname; /* the hostname of its real ip */
53 int cipher; /* Cipher type for UDP packets */
54 char *cipherkey; /* Cipher key */
55 int cipherkeylen; /* Cipher key length */
57 gcry_cipher_hd_t cipher_ctx; /* Cipher context */
59 int digest; /* Digest type for MAC */
62 int maclength; /* Length of MAC */
63 gcry_md_hd_t digest_ctx;
65 int compression; /* Compressionlevel, 0 = no compression */
67 list_t *queue; /* Queue for packets awaiting to be encrypted */
69 struct node_t *nexthop; /* nearest node from us to him */
70 struct node_t *via; /* next hop for UDP packets */
72 avl_tree_t *subnet_tree; /* Pointer to a tree of subnets belonging to this node */
74 avl_tree_t *edge_tree; /* Edges with this node as one of the endpoints */
76 struct connection_t *connection; /* Connection associated with this node (if a direct connection exists) */
78 uint32_t sent_seqno; /* Sequence number last sent to this node */
79 uint32_t received_seqno; /* Sequence number last received from this node */
80 unsigned char late[16]; /* Bitfield marking late packets */
82 length_t mtu; /* Maximum size of packets to send to this node */
83 length_t minmtu; /* Probed minimum MTU */
84 length_t maxmtu; /* Probed maximum MTU */
85 int mtuprobes; /* Number of probes */
86 event_t *mtuevent; /* Probe event */
89 extern struct node_t *myself;
90 extern avl_tree_t *node_tree;
91 extern avl_tree_t *node_udp_tree;
93 extern void init_nodes(void);
94 extern void exit_nodes(void);
95 extern node_t *new_node(void) __attribute__ ((__malloc__));
96 extern void free_node(node_t *);
97 extern void node_add(node_t *);
98 extern void node_del(node_t *);
99 extern node_t *lookup_node(char *);
100 extern node_t *lookup_node_udp(const sockaddr_t *);
101 extern void dump_nodes(void);
103 #endif /* __TINC_NODE_H__ */