tinc/src/edge.h

/*
    edge.h -- header for edge.c
    Copyright (C) 2001-2012 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
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License along
    with this program; if not, write to the Free Software Foundation, Inc.,
    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/

#ifndef __TINC_EDGE_H__
#define __TINC_EDGE_H__

#include "splay_tree.h"
#include "connection.h"
#include "net.h"
#include "node.h"

typedef struct edge_t {
	struct node_t *from;
	struct node_t *to;
	sockaddr_t address;
	sockaddr_t local_address;

	uint32_t options;                       /* options turned on for this edge */
	int weight;                             /* weight of this edge */

	struct connection_t *connection;        /* connection associated with this edge, if available */
	struct edge_t *reverse;                 /* edge in the opposite direction, if available */
} edge_t;

extern splay_tree_t *edge_weight_tree;          /* Tree with all known edges sorted on weight */

extern void init_edges(void);
extern void exit_edges(void);
extern edge_t *new_edge(void) __attribute__ ((__malloc__));
extern void free_edge(edge_t *);
extern splay_tree_t *new_edge_tree(void) __attribute__ ((__malloc__));
extern void free_edge_tree(splay_tree_t *);
extern void edge_add(edge_t *);
extern void edge_del(edge_t *);
extern edge_t *lookup_edge(struct node_t *, struct node_t *);
extern bool dump_edges(struct connection_t *);

#endif /* __TINC_EDGE_H__ */
Started implementing doc/CONNECTIVITY. 2001-10-09 19:30:30 +00:00			`/*`
What was I thinking? s/vertex/edge/g. 2001-10-28 08:41:19 +00:00			`edge.h -- header for edge.c`
Update copyright notices. 2012-10-14 15:42:49 +00:00			`Copyright (C) 2001-2012 Guus Sliepen <guus@tinc-vpn.org>,`
Update copyright notices, remove Ivo's email address. 2006-04-26 13:52:58 +00:00			`2001-2005 Ivo Timmermans`
Started implementing doc/CONNECTIVITY. 2001-10-09 19:30:30 +00:00
			`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`
			`the Free Software Foundation; either version 2 of the License, or`
			`(at your option) any later version.`

			`This program is distributed in the hope that it will be useful,`
			`but WITHOUT ANY WARRANTY; without even the implied warranty of`
			`MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the`
			`GNU General Public License for more details.`

Update the address of the Free Software Foundation in all copyright headers. 2009-09-24 22:01:00 +00:00			`You should have received a copy of the GNU General Public License along`
			`with this program; if not, write to the Free Software Foundation, Inc.,`
			`51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.`
Started implementing doc/CONNECTIVITY. 2001-10-09 19:30:30 +00:00			`*/`

What was I thinking? s/vertex/edge/g. 2001-10-28 08:41:19 +00:00			`#ifndef __TINC_EDGE_H__`
			`#define __TINC_EDGE_H__`
Further implementation of doc/CONNECTIVITY. connection.[ch] is now split into a node, vertex and connection part. 2001-10-10 08:49:47 +00:00
Use splay trees instead of AVL trees. 2007-05-18 10:05:26 +00:00			`#include "splay_tree.h"`
Big header file cleanup: everything that has to do with standard system libraries is moved to system.h. 2003-07-17 15:06:27 +00:00			`#include "connection.h"`
- Non-blocking connect()s. - Socket handling revamped to use sockaddr_t. - tinc can now tunnel over IPv6. - Handle all addresses and subnets in network byte order. Only convert them when they need to be printed. - IPv6 subnets bigger than /128 now work. - Use %s and strerror(errno) instead of %m. 2002-02-18 16:25:19 +00:00			`#include "net.h"`
Further implementation of doc/CONNECTIVITY. connection.[ch] is now split into a node, vertex and connection part. 2001-10-10 08:49:47 +00:00			`#include "node.h"`

What was I thinking? s/vertex/edge/g. 2001-10-28 08:41:19 +00:00			`typedef struct edge_t {`
Switch to K&R style indentation. 2002-09-09 21:25:28 +00:00			`struct node_t *from;`
			`struct node_t *to;`
			`sockaddr_t address;`
Add local address information to edges. In addition to the remote address, each edge now stores the local address from the point of view of the "from" node. This information is then made available to other nodes through a backwards-compatible extension to ADD_EDGE messages. This information can be used in future code to improve packet routing. 2014-06-22 15:29:30 +00:00			`sockaddr_t local_address;`
Switch to K&R style indentation. 2002-09-09 21:25:28 +00:00
Fix whitespace. 2012-10-10 15:17:49 +00:00			`uint32_t options; /* options turned on for this edge */`
			`int weight; /* weight of this edge */`
Switch to K&R style indentation. 2002-09-09 21:25:28 +00:00
Fix whitespace. 2012-10-10 15:17:49 +00:00			`struct connection_t connection; / connection associated with this edge, if available */`
			`struct edge_t reverse; / edge in the opposite direction, if available */`
What was I thinking? s/vertex/edge/g. 2001-10-28 08:41:19 +00:00			`} edge_t;`
Started implementing doc/CONNECTIVITY. 2001-10-09 19:30:30 +00:00
Fix whitespace. 2012-10-10 15:17:49 +00:00			`extern splay_tree_t edge_weight_tree; / Tree with all known edges sorted on weight */`
Further implementation of doc/CONNECTIVITY. connection.[ch] is now split into a node, vertex and connection part. 2001-10-10 08:49:47 +00:00
- More s/vertex/edge/g - Implementation of Kruskal's minimum spanning tree algorithm. 2001-10-28 10:16:18 +00:00			`extern void init_edges(void);`
			`extern void exit_edges(void);`
Prevent definitions from messing up attributes. 2003-07-30 21:52:41 +00:00			`extern edge_t *new_edge(void) __attribute__ ((__malloc__));`
What was I thinking? s/vertex/edge/g. 2001-10-28 08:41:19 +00:00			`extern void free_edge(edge_t *);`
Use splay trees instead of AVL trees. 2007-05-18 10:05:26 +00:00			`extern splay_tree_t *new_edge_tree(void) __attribute__ ((__malloc__));`
			`extern void free_edge_tree(splay_tree_t *);`
What was I thinking? s/vertex/edge/g. 2001-10-28 08:41:19 +00:00			`extern void edge_add(edge_t *);`
			`extern void edge_del(edge_t *);`
Fix compile errors and warnings. 2003-07-29 10:50:15 +00:00			`extern edge_t lookup_edge(struct node_t , struct node_t *);`
Use the TCP socket infrastructure for control sockets. The control socket code was completely different from how meta connections are handled, resulting in lots of extra code to handle requests. Also, not every operating system has UNIX sockets, so we have to resort to another type of sockets or pipes for those anyway. To reduce code duplication and make control sockets work the same on all platforms, we now just connect to the TCP port where tincd is already listening on. To authenticate, the program that wants to control a running tinc daemon must send the contents of a cookie file. The cookie is a random 256 bits number that is regenerated every time tincd starts. The cookie file should only be readable by the same user that can start a tincd. Instead of the binary-ish protocol previously used, we now use an ASCII protocol similar to that of the meta connections, but this can still change. 2009-11-07 22:43:25 +00:00			`extern bool dump_edges(struct connection_t *);`
Big bad commit: - Transition to new node/vertex/connection structures - Use new configuration handling everywhere - Linux tun/tap device handling cleanup - Start of IPv6 support in route.c It compiles, but it won't link. 2001-10-27 12:13:17 +00:00
Fix whitespace. 2012-10-10 15:17:49 +00:00			`#endif /* __TINC_EDGE_H__ */`