1 #ifndef MESHLINK_NODE_H
2 #define MESHLINK_NODE_H
5 node.h -- header for node.c
6 Copyright (C) 2014, 2017 Guus Sliepen <guus@meshlink.io>
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License along
19 with this program; if not, write to the Free Software Foundation, Inc.,
20 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
29 typedef struct node_status_t {
30 uint16_t validkey: 1; /* 1 if we currently have a valid key for him */
31 uint16_t waitingforkey: 1; /* 1 if we already sent out a request */
32 uint16_t visited: 1; /* 1 if this node has been visited by one of the graph algorithms */
33 uint16_t reachable: 1; /* 1 if this node is reachable in the graph */
34 uint16_t udp_confirmed: 1; /* 1 if the address is one that we received UDP traffic on */
35 uint16_t broadcast: 1; /* 1 if the next UDP packet should be broadcast to the local network */
36 uint16_t blacklisted: 1; /* 1 if the node is blacklist so we never want to speak with him anymore */
37 uint16_t destroyed: 1; /* 1 if the node is being destroyed, deallocate channels when any callback is triggered */
38 uint16_t duplicate: 1; /* 1 if the node is duplicate, ie. multiple nodes using the same Name are online */
39 uint16_t dirty: 1; /* 1 if the configuration of the node is dirty and needs to be written out */
40 uint16_t want_udp: 1; /* 1 if we want working UDP because we have data to send */
41 uint16_t tiny: 1; /* 1 if this is a tiny node */
46 typedef struct node_t {
47 // Public member variables
48 char *name; /* name of this node */
51 // Private member variables
53 uint16_t minmtu; /* Probed minimum MTU */
56 // Used for packet I/O
57 int sock; /* Socket to use for outgoing UDP packets */
58 uint32_t session_id; /* Unique ID for this node's currently running process */
60 sockaddr_t address; /* his real (internet) ip to send UDP packets to */
65 uint64_t in_data; /* Bytes received from channels */
66 uint64_t out_data; /* Bytes sent via channels */
67 uint64_t in_forward; /* Bytes received for channels that need to be forwarded to other nodes */
68 uint64_t out_forward; /* Bytes forwarded from channel from other nodes */
69 uint64_t in_meta; /* Bytes received from meta-connections, heartbeat packets etc. */
70 uint64_t out_meta; /* Bytes sent on meta-connections, heartbeat packets etc. */
73 timeout_t udp_ping_timeout; /* UDP probe event */
74 struct timespec last_mtu_probe_sent; /* Time that the last MTU probe was sent */
75 struct timespec last_udp_probe_sent; /* Time that the last UDP probe was sent */
76 int8_t mtuprobes; /* MTU probes counter */
77 int8_t udpprobes; /* UDP probes counter */
78 uint16_t last_mtu_len; /* Size of the last sent probe */
79 uint16_t mtu; /* Maximum size of packets to send to this node */
80 uint16_t maxmtu; /* Probed maximum MTU */
82 // Used for meta-connection I/O, timeouts
83 struct meshlink_handle *mesh; /* The mesh this node belongs to */
84 struct submesh_t *submesh; /* Nodes Sub-Mesh Handle*/
88 struct ecdsa *ecdsa; /* His public ECDSA key */
90 struct connection_t *connection; /* Connection associated with this node (if a direct connection exists) */
91 time_t last_connect_try;
92 time_t last_successfull_connection;
94 char *canonical_address; /* The canonical address of this node, if known */
95 sockaddr_t recent[MAX_RECENT]; /* Recently seen addresses */
96 sockaddr_t catta_address; /* Latest address seen by Catta */
98 // Graph-related member variables
99 time_t last_reachable;
100 time_t last_unreachable;
103 struct node_t *nexthop; /* nearest node from us to him */
104 struct edge_t *prevedge; /* nearest node from him to us */
106 struct splay_tree_t *edge_tree; /* Edges with this node as one of the endpoints */
109 void init_nodes(struct meshlink_handle *mesh);
110 void exit_nodes(struct meshlink_handle *mesh);
111 node_t *new_node(void) __attribute__((__malloc__));
112 void free_node(node_t *n);
113 void node_add(struct meshlink_handle *mesh, node_t *n);
114 void node_del(struct meshlink_handle *mesh, node_t *n);
115 node_t *lookup_node(struct meshlink_handle *mesh, const char *name) __attribute__((__warn_unused_result__));
116 node_t *lookup_node_udp(struct meshlink_handle *mesh, const sockaddr_t *sa) __attribute__((__warn_unused_result__));
117 void update_node_udp(struct meshlink_handle *mesh, node_t *n, const sockaddr_t *sa);
118 bool node_add_recent_address(struct meshlink_handle *mesh, node_t *n, const sockaddr_t *addr);