tinc/src/node.h

105 lines
3.9 KiB
C
Raw Normal View History

2019-08-26 11:44:36 +00:00
/*
node.h -- header for node.c
2019-08-26 11:44:39 +00:00
Copyright (C) 2001-2010 Guus Sliepen <guus@tinc-vpn.org>,
2019-08-26 11:44:37 +00:00
2001-2005 Ivo Timmermans
2019-08-26 11:44:36 +00:00
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
2019-08-26 11:44:38 +00:00
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
2019-08-26 11:44:36 +00:00
*/
#ifndef __TINC_NODE_H__
#define __TINC_NODE_H__
2019-08-26 11:44:36 +00:00
#include "avl_tree.h"
2019-08-26 11:44:36 +00:00
#include "connection.h"
2019-08-26 11:44:36 +00:00
#include "event.h"
#include "list.h"
#include "subnet.h"
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:38 +00:00
typedef struct node_status_t {
int unused_active:1; /* 1 if active (not used for nodes) */
int validkey:1; /* 1 if we currently have a valid key for him */
2019-08-26 11:44:39 +00:00
int unused_waitingforkey:1; /* 1 if we already sent out a request */
2019-08-26 11:44:38 +00:00
int visited:1; /* 1 if this node has been visited by one of the graph algorithms */
int reachable:1; /* 1 if this node is reachable in the graph */
int indirect:1; /* 1 if this node is not directly reachable by us */
int unused:26;
2019-08-26 11:44:36 +00:00
} node_status_t;
typedef struct node_t {
2019-08-26 11:44:36 +00:00
char *name; /* name of this node */
2019-08-26 11:44:38 +00:00
uint32_t options; /* options turned on for this node */
2019-08-26 11:44:36 +00:00
sockaddr_t address; /* his real (internet) ip to send UDP packets to */
char *hostname; /* the hostname of its real ip */
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
node_status_t status;
2019-08-26 11:44:39 +00:00
time_t last_req_key;
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:38 +00:00
const EVP_CIPHER *incipher; /* Cipher type for UDP packets received from him */
char *inkey; /* Cipher key and iv */
int inkeylength; /* Cipher key and iv length */
EVP_CIPHER_CTX inctx; /* Cipher context */
const EVP_CIPHER *outcipher; /* Cipher type for UDP packets sent to him*/
char *outkey; /* Cipher key and iv */
int outkeylength; /* Cipher key and iv length */
EVP_CIPHER_CTX outctx; /* Cipher context */
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:38 +00:00
const EVP_MD *indigest; /* Digest type for MAC of packets received from him */
int inmaclength; /* Length of MAC */
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:38 +00:00
const EVP_MD *outdigest; /* Digest type for MAC of packets sent to him*/
int outmaclength; /* Length of MAC */
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:38 +00:00
int incompression; /* Compressionlevel, 0 = no compression */
int outcompression; /* Compressionlevel, 0 = no compression */
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
struct node_t *nexthop; /* nearest node from us to him */
struct node_t *via; /* next hop for UDP packets */
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
avl_tree_t *subnet_tree; /* Pointer to a tree of subnets belonging to this node */
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
avl_tree_t *edge_tree; /* Edges with this node as one of the endpoints */
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
struct connection_t *connection; /* Connection associated with this node (if a direct connection exists) */
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
uint32_t sent_seqno; /* Sequence number last sent to this node */
uint32_t received_seqno; /* Sequence number last received from this node */
unsigned char late[16]; /* Bitfield marking late packets */
2019-08-26 11:44:36 +00:00
2019-08-26 11:44:36 +00:00
length_t mtu; /* Maximum size of packets to send to this node */
length_t minmtu; /* Probed minimum MTU */
length_t maxmtu; /* Probed maximum MTU */
int mtuprobes; /* Number of probes */
event_t *mtuevent; /* Probe event */
2019-08-26 11:44:36 +00:00
} node_t;
extern struct node_t *myself;
extern avl_tree_t *node_tree;
extern avl_tree_t *node_udp_tree;
extern void init_nodes(void);
extern void exit_nodes(void);
2019-08-26 11:44:36 +00:00
extern node_t *new_node(void) __attribute__ ((__malloc__));
2019-08-26 11:44:36 +00:00
extern void free_node(node_t *);
extern void node_add(node_t *);
extern void node_del(node_t *);
extern node_t *lookup_node(char *);
2019-08-26 11:44:36 +00:00
extern node_t *lookup_node_udp(const sockaddr_t *);
2019-08-26 11:44:38 +00:00
extern void update_node_udp(node_t *, const sockaddr_t *);
2019-08-26 11:44:36 +00:00
extern void dump_nodes(void);
2019-08-26 11:44:36 +00:00
#endif /* __TINC_NODE_H__ */