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.
26 #include "utcp/utcp.h"
28 typedef struct node_status_t {
29 unsigned int unused_active: 1; /* 1 if active (not used for nodes) */
30 unsigned int validkey: 1; /* 1 if we currently have a valid key for him */
31 unsigned int waitingforkey: 1; /* 1 if we already sent out a request */
32 unsigned int visited: 1; /* 1 if this node has been visited by one of the graph algorithms */
33 unsigned int reachable: 1; /* 1 if this node is reachable in the graph */
34 unsigned int indirect: 1; /* 1 if this node is not directly reachable by us */
35 unsigned int unused_sptps: 1; /* 1 if this node supports SPTPS */
36 unsigned int udp_confirmed: 1; /* 1 if the address is one that we received UDP traffic on */
37 unsigned int broadcast: 1; /* 1 if the next UDP packet should be broadcast to the local network */
38 unsigned int blacklisted: 1; /* 1 if the node is blacklist so we never want to speak with him anymore */
39 unsigned int destroyed: 1; /* 1 if the node is being destroyed, deallocate channels when any callback is triggered */
40 unsigned int duplicate: 1; /* 1 if the node is duplicate, ie. multiple nodes using the same Name are online */
41 unsigned int dirty: 1; /* 1 if the configuration of the node is dirty and needs to be written out */
42 unsigned int unused: 19;
45 typedef struct node_t {
46 char *name; /* name of this node */
49 uint32_t options; /* options turned on for this node */
52 struct meshlink_handle *mesh; /* The mesh this node belongs to */
54 int sock; /* Socket to use for outgoing UDP packets */
55 sockaddr_t address; /* his real (internet) ip to send UDP packets to */
58 time_t last_state_change;
61 struct ecdsa *ecdsa; /* His public ECDSA key */
64 int incompression; /* Compressionlevel, 0 = no compression */
65 int outcompression; /* Compressionlevel, 0 = no compression */
68 struct node_t *nexthop; /* nearest node from us to him */
69 struct edge_t *prevedge; /* nearest node from him to us */
70 struct node_t *via; /* next hop for UDP packets */
72 struct splay_tree_t *edge_tree; /* Edges with this node as one of the endpoints */
74 struct connection_t *connection; /* Connection associated with this node (if a direct connection exists) */
75 time_t last_connect_try;
76 time_t last_successfull_connection;
78 uint16_t mtu; /* Maximum size of packets to send to this node */
79 uint16_t minmtu; /* Probed minimum MTU */
80 uint16_t maxmtu; /* Probed maximum MTU */
81 int mtuprobes; /* Number of probes */
82 timeout_t mtutimeout; /* Probe event */
91 char *canonical_address; /* The canonical address of this node, if known */
92 sockaddr_t recent[5]; /* Recently seen addresses */
95 extern void init_nodes(struct meshlink_handle *mesh);
96 extern void exit_nodes(struct meshlink_handle *mesh);
97 extern node_t *new_node(void) __attribute__((__malloc__));
98 extern void free_node(node_t *n);
99 extern void node_add(struct meshlink_handle *mesh, node_t *n);
100 extern void node_del(struct meshlink_handle *mesh, node_t *n);
101 extern node_t *lookup_node(struct meshlink_handle *mesh, const char *name);
102 extern node_t *lookup_node_udp(struct meshlink_handle *mesh, const sockaddr_t *sa);
103 extern void update_node_udp(struct meshlink_handle *mesh, node_t *n, const sockaddr_t *sa);