+#ifndef MESHLINK_NODE_H
+#define MESHLINK_NODE_H
+
/*
node.h -- header for node.c
- Copyright (C) 2001-2010 Guus Sliepen <guus@tinc-vpn.org>,
- 2001-2005 Ivo Timmermans
+ Copyright (C) 2014, 2017 Guus Sliepen <guus@meshlink.io>
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
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
-#ifndef __TINC_NODE_H__
-#define __TINC_NODE_H__
-
-#include "splay_tree.h"
-#include "cipher.h"
-#include "connection.h"
-#include "digest.h"
-#include "ecdh.h"
-#include "subnet.h"
+#include "event.h"
+#include "sockaddr.h"
+#include "sptps.h"
+#include "utcp.h"
+#include "submesh.h"
typedef struct node_status_t {
- unsigned int unused_active:1; /* 1 if active (not used for nodes) */
- unsigned int validkey:1; /* 1 if we currently have a valid key for him */
- unsigned int unused_waitingforkey:1; /* 1 if we already sent out a request */
- unsigned int visited:1; /* 1 if this node has been visited by one of the graph algorithms */
- unsigned int reachable:1; /* 1 if this node is reachable in the graph */
- unsigned int indirect:1; /* 1 if this node is not directly reachable by us */
- unsigned int ecdh:1; /* 1 if this node supports ECDH key exchange */
- unsigned int unused:25;
+ uint16_t validkey: 1; /* 1 if we currently have a valid key for him */
+ uint16_t waitingforkey: 1; /* 1 if we already sent out a request */
+ uint16_t visited: 1; /* 1 if this node has been visited by one of the graph algorithms */
+ uint16_t reachable: 1; /* 1 if this node is reachable in the graph */
+ uint16_t udp_confirmed: 1; /* 1 if the address is one that we received UDP traffic on */
+ uint16_t broadcast: 1; /* 1 if the next UDP packet should be broadcast to the local network */
+ uint16_t blacklisted: 1; /* 1 if the node is blacklist so we never want to speak with him anymore */
+ uint16_t destroyed: 1; /* 1 if the node is being destroyed, deallocate channels when any callback is triggered */
+ uint16_t duplicate: 1; /* 1 if the node is duplicate, ie. multiple nodes using the same Name are online */
+ uint16_t dirty: 1; /* 1 if the configuration of the node is dirty and needs to be written out */
+ uint16_t want_udp: 1; /* 1 if we want working UDP because we have data to send */
} node_status_t;
-typedef struct node_t {
- char *name; /* name of this node */
- uint32_t options; /* options turned on for this node */
+#define MAX_RECENT 5
- int sock; /* Socket to use for outgoing UDP packets */
- sockaddr_t address; /* his real (internet) ip to send UDP packets to */
- char *hostname; /* the hostname of its real ip */
+typedef struct node_t {
+ // Public member variables
+ char *name; /* name of this node */
+ void *priv;
+ // Private member variables
node_status_t status;
- time_t last_req_key;
+ uint16_t minmtu; /* Probed minimum MTU */
+ dev_class_t devclass;
- ecdsa_t ecdsa; /* His public ECDSA key */
- ecdh_t ecdh; /* State for ECDH key exchange */
+ // Used for packet I/O
+ int sock; /* Socket to use for outgoing UDP packets */
+ uint32_t session_id; /* Unique ID for this node's currently running process */
+ sptps_t sptps;
+ sockaddr_t address; /* his real (internet) ip to send UDP packets to */
- cipher_t incipher; /* Cipher for UDP packets */
- digest_t indigest; /* Digest for UDP packets */
+ struct utcp *utcp;
- cipher_t outcipher; /* Cipher for UDP packets */
- digest_t outdigest; /* Digest for UDP packets */
+ // Traffic counters
+ uint64_t in_packets;
+ uint64_t in_bytes;
+ uint64_t out_packets;
+ uint64_t out_bytes;
- int incompression; /* Compressionlevel, 0 = no compression */
- int outcompression; /* Compressionlevel, 0 = no compression */
+ // MTU probes
+ timeout_t mtutimeout; /* Probe event */
+ int mtuprobes; /* Number of probes */
+ uint16_t mtu; /* Maximum size of packets to send to this node */
+ uint16_t maxmtu; /* Probed maximum MTU */
- int distance;
- struct node_t *nexthop; /* nearest node from us to him */
- struct edge_t *prevedge; /* nearest node from him to us */
- struct node_t *via; /* next hop for UDP packets */
+ // Used for meta-connection I/O, timeouts
+ struct meshlink_handle *mesh; /* The mesh this node belongs to */
+ struct submesh_t *submesh; /* Nodes Sub-Mesh Handle*/
- splay_tree_t *subnet_tree; /* Pointer to a tree of subnets belonging to this node */
+ time_t last_req_key;
- splay_tree_t *edge_tree; /* Edges with this node as one of the endpoints */
+ struct ecdsa *ecdsa; /* His public ECDSA key */
- struct connection_t *connection; /* Connection associated with this node (if a direct connection exists) */
+ struct connection_t *connection; /* Connection associated with this node (if a direct connection exists) */
+ time_t last_connect_try;
+ time_t last_successfull_connection;
- uint32_t sent_seqno; /* Sequence number last sent to this node */
- uint32_t received_seqno; /* Sequence number last received from this node */
- uint32_t farfuture; /* Packets in a row that have arrived from the far future */
- unsigned char* late; /* Bitfield marking late packets */
+ char *canonical_address; /* The canonical address of this node, if known */
+ sockaddr_t recent[MAX_RECENT]; /* Recently seen addresses */
+ sockaddr_t catta_address; /* Latest address seen by Catta */
- 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 */
- struct event mtuevent; /* Probe event */
+ // Graph-related member variables
+ time_t last_reachable;
+ time_t last_unreachable;
- uint64_t in_packets;
- uint64_t in_bytes;
- uint64_t out_packets;
- uint64_t out_bytes;
+ int distance;
+ struct node_t *nexthop; /* nearest node from us to him */
+ struct edge_t *prevedge; /* nearest node from him to us */
+
+ struct splay_tree_t *edge_tree; /* Edges with this node as one of the endpoints */
} node_t;
-extern struct node_t *myself;
-extern splay_tree_t *node_tree;
-extern splay_tree_t *node_udp_tree;
-
-extern void init_nodes(void);
-extern void exit_nodes(void);
-extern node_t *new_node(void) __attribute__ ((__malloc__));
-extern void free_node(node_t *);
-extern void node_add(node_t *);
-extern void node_del(node_t *);
-extern node_t *lookup_node(char *);
-extern node_t *lookup_node_udp(const sockaddr_t *);
-extern bool dump_nodes(struct connection_t *);
-extern bool dump_traffic(struct connection_t *);
-extern void update_node_udp(node_t *, const sockaddr_t *);
-
-#endif /* __TINC_NODE_H__ */
+void init_nodes(struct meshlink_handle *mesh);
+void exit_nodes(struct meshlink_handle *mesh);
+node_t *new_node(void) __attribute__((__malloc__));
+void free_node(node_t *n);
+void node_add(struct meshlink_handle *mesh, node_t *n);
+void node_del(struct meshlink_handle *mesh, node_t *n);
+node_t *lookup_node(struct meshlink_handle *mesh, const char *name) __attribute__((__warn_unused_result__));
+node_t *lookup_node_udp(struct meshlink_handle *mesh, const sockaddr_t *sa) __attribute__((__warn_unused_result__));
+void update_node_udp(struct meshlink_handle *mesh, node_t *n, const sockaddr_t *sa);
+bool node_add_recent_address(struct meshlink_handle *mesh, node_t *n, const sockaddr_t *addr);
+
+#endif