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 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 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 */
struct meshlink_handle *mesh; /* The mesh this node belongs to */
struct submesh_t *submesh; /* Nodes Sub-Mesh Handle*/
struct meshlink_handle *mesh; /* The mesh this node belongs to */
struct submesh_t *submesh; /* Nodes Sub-Mesh Handle*/
time_t last_successfull_connection;
char *canonical_address; /* The canonical address of this node, if known */
time_t last_successfull_connection;
char *canonical_address; /* The canonical address of this node, if known */
int distance;
struct node_t *nexthop; /* nearest node from us to him */
struct edge_t *prevedge; /* nearest node from him to us */
int distance;
struct node_t *nexthop; /* nearest node from us to him */
struct edge_t *prevedge; /* nearest node from him to us */
extern void free_node(node_t *n);
extern void node_add(struct meshlink_handle *mesh, node_t *n);
extern void node_del(struct meshlink_handle *mesh, node_t *n);
extern void free_node(node_t *n);
extern void node_add(struct meshlink_handle *mesh, node_t *n);
extern void node_del(struct meshlink_handle *mesh, node_t *n);
-extern node_t *lookup_node(struct meshlink_handle *mesh, const char *name);
-extern node_t *lookup_node_udp(struct meshlink_handle *mesh, const sockaddr_t *sa);
+extern node_t *lookup_node(struct meshlink_handle *mesh, const char *name) __attribute__((__warn_unused_result__));
+extern node_t *lookup_node_udp(struct meshlink_handle *mesh, const sockaddr_t *sa) __attribute__((__warn_unused_result__));