/*
    node.h -- header for node.c
    Copyright (C) 2001 Guus Sliepen <guus@sliepen.warande.net>,
                  2001 Ivo Timmermans <itimmermans@bigfoot.com>

    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., 675 Mass Ave, Cambridge, MA 02139, USA.

    $Id: node.h,v 1.1.2.9 2001/11/16 15:56:44 zarq Exp $
*/

#ifndef __TINC_NODE_H__
#define __TINC_NODE_H__

#include <avl_tree.h>

#include "subnet.h"
#include "connection.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;
} node_status_t;

typedef struct node_t {
  char *name;                      /* name of this node */
  long int options;                /* options turned on for this node */

  struct addrinfo *address;        /* his real (internet) ip to send UDP packets to */
  char *port;                      /* string representation of the port number */
  char *hostname;                  /* the hostname of its real ip */

  struct node_status_t status;

  EVP_CIPHER *cipher;              /* Cipher type for UDP packets */ 
  char *key;                       /* Cipher key and iv */
  int keylength;                   /* Cipher key and iv length*/

  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 */

  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) */
} node_t;

extern struct node_t *myself;
extern avl_tree_t *node_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 *lookup_node(char *);
extern node_t *lookup_node_udp(struct addrinfo *);
extern void dump_nodes(void);


#endif /* __TINC_NODE_H__ */