Updated SSSP algorithm to automatically detect indirect links (if a node uses

[tinc] / src / node.h

diff --git a/src/node.h b/src/node.h
index b662ccd..98147d3 100644 (file)
--- a/src/node.h
+++ b/src/node.h
@@ -17,7 +17,7 @@
     along with this program; if not, write to the Free Software
     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 
-    $Id: node.h,v 1.1.2.11 2002/02/11 15:59:18 guus Exp $
+    $Id: node.h,v 1.1.2.13 2002/03/19 22:48:25 guus Exp $
 */
 
 #ifndef __TINC_NODE_H__
@@ -34,15 +34,15 @@ typedef struct node_status_t {
   int waitingforkey:1;             /* 1 if we already sent out a request */
   int visited:1;                   /* 1 if this node has been visited by one of the graph algorithms */
   int reachable:1;                 /* 1 if this node is reachable in the graph */
-  int unused:27;
+  int indirect:1;                  /* 1 if this node is not directly reachable by us */
+  int unused:26;
 } node_status_t;
 
 typedef struct node_t {
   char *name;                      /* name of this node */
   long int options;                /* options turned on for this node */
 
-  ipv4_t address;                  /* his real (internet) ip to send UDP packets to */
-  port_t port;                     /* port number of UDP connection */
+  sockaddr_t address;              /* his real (internet) ip to send UDP packets to */
   char *hostname;                  /* the hostname of its real ip */
 
   struct node_status_t status;
@@ -78,11 +78,11 @@ extern avl_tree_t *node_udp_tree;
 extern void init_nodes(void);
 extern void exit_nodes(void);
 extern node_t *new_node(void);
-extern void free_node(node_t *n);
-extern void node_add(node_t *n);
-extern void node_del(node_t *n);
+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(ipv4_t, port_t);
+extern node_t *lookup_node_udp(sockaddr_t *);
 extern void dump_nodes(void);
 
 #endif /* __TINC_NODE_H__ */