src/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-2008 Othmar Gsenger, Erwin Nindl,
  15  *                          Christian Pointner <satp@wirdorange.org>
  16  *
  17  *  This file is part of Anytun.
  18  *
  19  *  Anytun is free software: you can redistribute it and/or modify
  20  *  it under the terms of the GNU General Public License version 3 as
  21  *  published by the Free Software Foundation.
  22  *
  23  *  Anytun is distributed in the hope that it will be useful,
  24  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  25  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  26  *  GNU General Public License for more details.
  27  *
  28  *  You should have received a copy of the GNU General Public License
  29  *  along with anytun.  If not, see <http://www.gnu.org/licenses/>.
  30  */
  31 #include "networkPrefix.h"
  32 #include "threadUtils.hpp"
  33 #include "datatypes.h"
  34
  35 #include "routingTable.h"
  36
  37 RoutingTable* RoutingTable::inst = NULL;
  38 Mutex RoutingTable::instMutex;
  39 RoutingTable& gRoutingTable = RoutingTable::instance();
  40
  41
  42 RoutingTable& RoutingTable::instance()
  43 {
  44   Lock lock(instMutex);
  45   static instanceCleaner c;
  46   if(!inst)
  47     inst = new RoutingTable();
  48
  49   return *inst;
  50 }
  51
  52 RoutingTable::RoutingTable()
  53 {
  54 }
  55
  56 RoutingTable::~RoutingTable()
  57 {
  58 }
  59
  60 void RoutingTable::addRoute(const NetworkPrefix & pref,u_int16_t mux )
  61 {
  62         if ( pref.getNetworkAddressType()!=ipv4 && pref.getNetworkAddressType() != ipv6)
  63                 return; //TODO add ETHERNET support
  64   Lock lock(mutex_);
  65
  66
  67   std::pair<RoutingMap::iterator, bool> ret = routes_[pref.getNetworkAddressType()].insert(RoutingMap::value_type(pref,mux));
  68   if(!ret.second)
  69   {
  70     routes_[pref.getNetworkAddressType()].erase(ret.first);
  71     routes_[pref.getNetworkAddressType()].insert(RoutingMap::value_type(pref,mux));
  72   }
  73 }
  74
  75
  76 void RoutingTable::delRoute(const NetworkPrefix & pref )
  77 {
  78   Lock lock(mutex_);
  79
  80   routes_[pref.getNetworkAddressType()].erase(routes_[pref.getNetworkAddressType()].find(pref));
  81 }
  82
  83 u_int16_t  RoutingTable::getRoute(const NetworkAddress & addr)
  84 {
  85         Lock lock(mutex_);
  86         if (routes_[addr.getNetworkAddressType()].empty())
  87         return 0;
  88         //TODO Routing algorithem isnt working!!!
  89         NetworkPrefix prefix(addr,128);
  90         RoutingMap::iterator it = routes_[addr.getNetworkAddressType()].lower_bound(prefix);
  91 //      it--;
  92         if (it!=routes_[addr.getNetworkAddressType()].end())
  93                 return it->second;
  94         it=routes_[addr.getNetworkAddressType()].begin();
  95         return it->second;
  96 }
  97
  98 u_int16_t* RoutingTable::getOrNewRoutingTEUnlocked(const NetworkPrefix & addr)
  99 {
 100   RoutingMap::iterator it = routes_[addr.getNetworkAddressType()].find(addr);
 101   if(it!=routes_[addr.getNetworkAddressType()].end())
 102     return &(it->second);
 103
 104   routes_[addr.getNetworkAddressType()].insert(RoutingMap::value_type(addr, 1));
 105   it = routes_[addr.getNetworkAddressType()].find(addr);
 106   return &(it->second);
 107 }
 108
 109 u_int16_t RoutingTable::getCountUnlocked(network_address_type_t type)
 110 {
 111         RoutingMap::iterator it = routes_[type].begin();
 112         u_int16_t routes=0;
 113         for (;it!=routes_[type].end();++it)
 114                 routes++;
 115         return routes;
 116 }
 117
 118 RoutingMap::iterator RoutingTable::getBeginUnlocked(network_address_type_t type)
 119 {
 120         return routes_[type].begin();
 121 }
 122
 123 RoutingMap::iterator RoutingTable::getEndUnlocked(network_address_type_t type)
 124 {
 125         return routes_[type].end();
 126 }
 127
 128 void RoutingTable::clear(network_address_type_t type)
 129 {
 130   Lock lock(mutex_);
 131         routes_[type].clear();
 132 }
 133
 134 bool RoutingTable::empty(network_address_type_t type)
 135 {
 136   Lock lock(mutex_);
 137         return routes_[type].empty();
 138 }
 139
 140 Mutex& RoutingTable::getMutex()
 141 {
 142   return mutex_;
 143 }