X-Git-Url: http://git.meshlink.io/?a=blobdiff_plain;f=src%2Fnode.h;h=eaba79d0b01ae8bb959c773947d046688540cf81;hb=f712fdc0b3de22566cdf06954256c62f46f25542;hp=de33da3b89a3809518b0d5bef1cd4b3b95b552d9;hpb=5d9f6c8f2b855cd03a491988c1d4487ffbbc9dd4;p=meshlink diff --git a/src/node.h b/src/node.h index de33da3b..eaba79d0 100644 --- a/src/node.h +++ b/src/node.h @@ -1,6 +1,9 @@ +#ifndef MESHLINK_NODE_H +#define MESHLINK_NODE_H + /* node.h -- header for node.c - Copyright (C) 2014 Guus Sliepen + Copyright (C) 2014, 2017 Guus Sliepen 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 @@ -17,26 +20,25 @@ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */ -#ifndef __MESHLINK_NODE_H__ -#define __MESHLINK_NODE_H__ - #include "event.h" #include "sockaddr.h" #include "sptps.h" #include "utcp/utcp.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 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 unused_sptps:1; /* 1 if this node supports SPTPS */ - unsigned int udp_confirmed:1; /* 1 if the address is one that we received UDP traffic on */ - unsigned int broadcast:1; /* 1 if the next UDP packet should be broadcast to the local network */ - unsigned int blacklisted:1; /* 1 if the node is blacklist so we never want to speak with him anymore*/ - unsigned int unused:22; + 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 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 unused_sptps: 1; /* 1 if this node supports SPTPS */ + unsigned int udp_confirmed: 1; /* 1 if the address is one that we received UDP traffic on */ + unsigned int broadcast: 1; /* 1 if the next UDP packet should be broadcast to the local network */ + unsigned int blacklisted: 1; /* 1 if the node is blacklist so we never want to speak with him anymore */ + unsigned int destroyed: 1; /* 1 if the node is being destroyed, deallocate channels when any callback is triggered */ + unsigned int duplicate: 1; /* 1 if the node is duplicate, ie. multiple nodes using the same Name are online */ + unsigned int unused: 20; } node_status_t; typedef struct node_t { @@ -50,7 +52,6 @@ typedef struct node_t { 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 */ node_status_t status; time_t last_state_change; @@ -89,7 +90,7 @@ typedef struct node_t { extern void init_nodes(struct meshlink_handle *mesh); extern void exit_nodes(struct meshlink_handle *mesh); -extern node_t *new_node(void) __attribute__ ((__malloc__)); +extern node_t *new_node(void) __attribute__((__malloc__)); extern void free_node(node_t *); extern void node_add(struct meshlink_handle *mesh, node_t *); extern void node_del(struct meshlink_handle *mesh, node_t *); @@ -97,4 +98,4 @@ extern node_t *lookup_node(struct meshlink_handle *mesh, const char *); extern node_t *lookup_node_udp(struct meshlink_handle *mesh, const sockaddr_t *); extern void update_node_udp(struct meshlink_handle *mesh, node_t *, const sockaddr_t *); -#endif /* __MESHLINK_NODE_H__ */ +#endif