Revert to edge and graph stuff. This time, use a directed graph.

[tinc] / src / node.h

diff --git a/src/node.h b/src/node.h
index 6493852..8f6b30f 100644 (file)
--- a/src/node.h
+++ b/src/node.h
@@ -1,7 +1,7 @@
 /*
     node.h -- header for node.c
 /*
     node.h -- header for node.c

-    Copyright (C) 2001-2002 Guus Sliepen <guus@sliepen.warande.net>,
-                  2001-2002 Ivo Timmermans <itimmermans@bigfoot.com>
+    Copyright (C) 2001-2002 Guus Sliepen <guus@sliepen.eu.org>,
+                  2001-2002 Ivo Timmermans <ivo@o2w.nl>

 
     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
 
     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,12 +17,16 @@
     along with this program; if not, write to the Free Software
     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 
     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.12 2002/02/18 16:25:16 guus Exp $
+    $Id: node.h,v 1.1.2.19 2002/09/04 13:48:52 guus Exp $

 */
 
 #ifndef __TINC_NODE_H__
 #define __TINC_NODE_H__
 
 */
 
 #ifndef __TINC_NODE_H__
 #define __TINC_NODE_H__
 

+#ifdef HAVE_INTTYPES_H
+ #include <inttypes.h>
+#endif
+

 #include <avl_tree.h>
 
 #include "subnet.h"
 #include <avl_tree.h>
 
 #include "subnet.h"


@@ -34,7 +38,8 @@ 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 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 {
 } node_status_t;
 
 typedef struct node_t {


@@ -66,8 +71,8 @@ typedef struct node_t {
 
   struct connection_t *connection; /* Connection associated with this node (if a direct connection exists) */
 
 
   struct connection_t *connection; /* Connection associated with this node (if a direct connection exists) */
 

-  unsigned int sent_seqno;         /* Sequence number last sent to this node */
-  unsigned int received_seqno;     /* Sequence number last received from this node */
+  uint32_t sent_seqno;         /* Sequence number last sent to this node */
+  uint32_t received_seqno;     /* Sequence number last received from this node */

 } node_t;
 
 extern struct node_t *myself;
 } node_t;
 
 extern struct node_t *myself;