routingTable.cpp

   1 /*
   2  *  anytun
   3  *
   4  *  The secure anycast tunneling protocol (satp) defines a protocol used
   5  *  for communication between any combination of unicast and anycast
   6  *  tunnel endpoints.  It has less protocol overhead than IPSec in Tunnel
   7  *  mode and allows tunneling of every ETHER TYPE protocol (e.g.
   8  *  ethernet, ip, arp ...). satp directly includes cryptography and
   9  *  message authentication based on the methodes used by SRTP.  It is
  10  *  intended to deliver a generic, scaleable and secure solution for
  11  *  tunneling and relaying of packets of any protocol.
  12  *
  13  *
  14  *  Copyright (C) 2007 anytun.org <satp@wirdorange.org>
  15  *
  16  *  This program is free software; you can redistribute it and/or modify
  17  *  it under the terms of the GNU General Public License version 2
  18  *  as published by the Free Software Foundation.
  19  *
  20  *  This program is distributed in the hope that it will be useful,
  21  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  22  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  23  *  GNU General Public License for more details.
  24  *
  25  *  You should have received a copy of the GNU General Public License
  26  *  along with this program (see the file COPYING included with this
  27  *  distribution); if not, write to the Free Software Foundation, Inc.,
  28  *  59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
  29  */
  30
  31 #include "threadUtils.hpp"
  32 #include "datatypes.h"
  33
  34 #include "routingTable.h"
  35
  36 RoutingTable::RoutingTable()
  37 {
  38 }
  39
  40 RoutingTable::~RoutingTable()
  41 {
  42 }
  43
  44 void RoutingTable::addRoute(const RoutingTableEntry &route )
  45 {
  46   Lock lock(mutex_);
  47
  48 //  std::pair<ConnectionMap::iterator, bool> ret = connections_.insert(ConnectionMap::value_type(mux, conn));
  49 //  if(!ret.second)
  50 //  {
  51 //    connections_.erase(ret.first);
  52 //    connections_.insert(ConnectionMap::value_type(mux, conn));
  53 //  }
  54 }
  55
  56 const RoutingMap::iterator RoutingTable::getEnd()
  57 {
  58         return routes_.end();
  59 }
  60
  61 const RoutingMap::iterator  RoutingTable::getRoute()
  62 {
  63         Lock lock(mutex_);
  64         RoutingMap::iterator it = routes_.begin();
  65         return it;
  66 }
  67
  68 void RoutingTable::clear()
  69 {
  70   Lock lock(mutex_);
  71         routes_.clear();
  72 }
  73
  74 bool RoutingTable::empty()
  75 {
  76   Lock lock(mutex_);
  77         return routes_.empty();
  78 }
  79
  80 Mutex& RoutingTable::getMutex()
  81 {
  82   return mutex_;
  83 }