git.meshlink.io Git - meshlink/blob - src/connection.c

   1 /*
   2     connection.c -- connection list management
   3     Copyright (C) 2000-2009 Guus Sliepen <guus@tinc-vpn.org>,
   4                   2000-2005 Ivo Timmermans
   5                   2008      Max Rijevski <maksuf@gmail.com>
   6
   7     This program is free software; you can redistribute it and/or modify
   8     it under the terms of the GNU General Public License as published by
   9     the Free Software Foundation; either version 2 of the License, or
  10     (at your option) any later version.
  11
  12     This program is distributed in the hope that it will be useful,
  13     but WITHOUT ANY WARRANTY; without even the implied warranty of
  14     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15     GNU General Public License for more details.
  16
  17     You should have received a copy of the GNU General Public License along
  18     with this program; if not, write to the Free Software Foundation, Inc.,
  19     51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  20 */
  21
  22 #include "system.h"
  23
  24 #include "splay_tree.h"
  25 #include "cipher.h"
  26 #include "conf.h"
  27 #include "control_common.h"
  28 #include "list.h"
  29 #include "logger.h"
  30 #include "subnet.h"
  31 #include "utils.h"
  32 #include "xalloc.h"
  33
  34 splay_tree_t *connection_tree;  /* Meta connections */
  35 connection_t *broadcast;
  36
  37 static int connection_compare(const connection_t *a, const connection_t *b) {
  38         return a < b ? -1 : a == b ? 0 : 1;
  39 }
  40
  41 void init_connections(void) {
  42         connection_tree = splay_alloc_tree((splay_compare_t) connection_compare, (splay_action_t) free_connection);
  43         broadcast = new_connection();
  44         broadcast->name = xstrdup("everyone");
  45         broadcast->hostname = xstrdup("BROADCAST");
  46 }
  47
  48 void exit_connections(void) {
  49         splay_delete_tree(connection_tree);
  50         free_connection(broadcast);
  51 }
  52
  53 connection_t *new_connection(void) {
  54         return xmalloc_and_zero(sizeof(connection_t));
  55 }
  56
  57 void free_connection(connection_t *c) {
  58         if(!c)
  59                 return;
  60
  61         if(c->name)
  62                 free(c->name);
  63
  64         if(c->hostname)
  65                 free(c->hostname);
  66
  67         cipher_close(&c->incipher);
  68         digest_close(&c->indigest);
  69         cipher_close(&c->outcipher);
  70         digest_close(&c->outdigest);
  71
  72         if(c->hischallenge)
  73                 free(c->hischallenge);
  74
  75         if(c->config_tree)
  76                 exit_configuration(&c->config_tree);
  77
  78         buffer_clear(&c->inbuf);
  79         buffer_clear(&c->outbuf);
  80
  81         if(event_initialized(&c->inevent))
  82                 event_del(&c->inevent);
  83
  84         if(event_initialized(&c->outevent))
  85                 event_del(&c->outevent);
  86
  87         free(c);
  88 }
  89
  90 void connection_add(connection_t *c) {
  91         splay_insert(connection_tree, c);
  92 }
  93
  94 void connection_del(connection_t *c) {
  95         splay_delete(connection_tree, c);
  96 }
  97
  98 bool dump_connections(connection_t *cdump) {
  99         splay_node_t *node;
 100         connection_t *c;
 101
 102         for(node = connection_tree->head; node; node = node->next) {
 103                 c = node->data;
 104                 send_request(cdump, "%d %d %s at %s options %x socket %d status %04x",
 105                                 CONTROL, REQ_DUMP_CONNECTIONS,
 106                                 c->name, c->hostname, c->options, c->socket,
 107                                 bitfield_to_int(&c->status, sizeof c->status));
 108         }
 109
 110         return send_request(cdump, "%d %d", CONTROL, REQ_DUMP_CONNECTIONS);
 111 }