X-Git-Url: https://git.librecmc.org/?p=oweals%2Ftinc.git;a=blobdiff_plain;f=src%2Fnode.h;h=4b3224e3cab4da7822f5441c729598a03a50a8de;hp=92a33b242f4264aec0b5cbc54333257d7dd92106;hb=1728d5b2c43b33700a9997f97fe8503ad1cf3585;hpb=31db57bb4a00f5ca3743b89f8bb2fbd39919bf28

diff --git a/src/node.h b/src/node.h
index 92a33b2..4b3224e 100644
--- a/src/node.h
+++ b/src/node.h
@@ -1,7 +1,7 @@
 /*
     node.h -- header for node.c
-    Copyright (C) 2001 Guus Sliepen <guus@sliepen.warande.net>,
-                  2001 Ivo Timmermans <itimmermans@bigfoot.com>
+    Copyright (C) 2001-2006 Guus Sliepen <guus@tinc-vpn.org>,
+                  2001-2005 Ivo Timmermans
 
     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,62 +17,84 @@
     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.8 2001/11/16 12:12:56 zarq Exp $
+    $Id$
 */
 
 #ifndef __TINC_NODE_H__
 #define __TINC_NODE_H__
 
-#include <avl_tree.h>
-
-#include "subnet.h"
+#include "avl_tree.h"
 #include "connection.h"
+#include "event.h"
+#include "list.h"
+#include "subnet.h"
 
-typedef struct node_status_t {
-  int active:1;                    /* 1 if active.. */
-  int validkey:1;                  /* 1 if we currently have a valid key for him */
-  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 unused:28;
+typedef union node_status_t {
+	struct {
+		int unused_active:1;			/* 1 if active (not used for nodes) */
+		int validkey:1;				/* 1 if we currently have a valid key for him */
+		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 indirect:1;				/* 1 if this node is not directly reachable by us */
+		int unused:26;
+	};
+	uint32_t value;
 } node_status_t;
 
 typedef struct node_t {
-  char *name;                      /* name of this node */
-  long int options;                /* options turned on for this node */
+	char *name;				/* name of this node */
+	long int options;			/* options turned on for this node */
+
+	sockaddr_t address;			/* his real (internet) ip to send UDP packets to */
+	char *hostname;				/* the hostname of its real ip */
 
-  struct addrinfo *address;        /* his real (internet) ip to send UDP packets to */
-  char *hostname;                  /* the hostname of its real ip */
+	node_status_t status;
 
-  struct node_status_t status;
+	const EVP_CIPHER *cipher;		/* Cipher type for UDP packets */
+	char *key;				/* Cipher key and iv */
+	int keylength;				/* Cipher key and iv length */
+	EVP_CIPHER_CTX packet_ctx;		/* Cipher context */
+	
+	const EVP_MD *digest;			/* Digest type for MAC */
+	int maclength;				/* Length of MAC */
 
-  EVP_CIPHER *cipher;              /* Cipher type for UDP packets */ 
-  char *key;                       /* Cipher key and iv */
-  int keylength;                   /* Cipher key and iv length*/
+	int compression;			/* Compressionlevel, 0 = no compression */
 
-  list_t *queue;                   /* Queue for packets awaiting to be encrypted */
+	list_t *queue;				/* Queue for packets awaiting to be encrypted */
 
-  struct node_t *nexthop;          /* nearest node from us to him */
-  struct node_t *via;              /* next hop for UDP packets */
-  
-  avl_tree_t *subnet_tree;         /* Pointer to a tree of subnets belonging to this node */
+	struct node_t *nexthop;			/* nearest node from us to him */
+	struct node_t *via;			/* next hop for UDP packets */
 
-  avl_tree_t *edge_tree;           /* Edges with this node as one of the endpoints */
+	avl_tree_t *subnet_tree;		/* Pointer to a tree of subnets belonging to this node */
 
-  struct connection_t *connection; /* Connection associated with this node (if a direct connection exists) */
+	avl_tree_t *edge_tree;			/* Edges with this node as one of the endpoints */
+
+	struct connection_t *connection;	/* Connection associated with this node (if a direct connection exists) */
+
+	uint32_t sent_seqno;			/* Sequence number last sent to this node */
+	uint32_t received_seqno;		/* Sequence number last received from this node */
+	unsigned char late[16];			/* Bitfield marking late packets */
+
+	length_t mtu;				/* Maximum size of packets to send to this node */
+	length_t minmtu;			/* Probed minimum MTU */
+	length_t maxmtu;			/* Probed maximum MTU */
+	int mtuprobes;				/* Number of probes */
+	event_t *mtuevent;			/* Probe event */
 } node_t;
 
 extern struct node_t *myself;
 extern avl_tree_t *node_tree;
+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 node_t *new_node(void) __attribute__ ((__malloc__));
+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(struct addrinfo *);
+extern node_t *lookup_node_udp(const sockaddr_t *);
 extern void dump_nodes(void);
 
-
-#endif /* __TINC_NODE_H__ */
+#endif							/* __TINC_NODE_H__ */