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   Lock lock(mutex_);
  63
  64
  65   std::pair<RoutingMap::iterator, bool> ret = routes_.insert(RoutingMap::value_type(pref,mux));
  66   if(!ret.second)
  67   {
  68     routes_.erase(ret.first);
  69     routes_.insert(RoutingMap::value_type(pref,mux));
  70   }
  71 }
  72
  73
  74 void RoutingTable::delRoute(const NetworkPrefix & pref )
  75 {
  76   Lock lock(mutex_);
  77
  78   routes_.erase(routes_.find(pref));
  79 }
  80
  81 u_int16_t  RoutingTable::getRoute(const NetworkAddress & addr)
  82 {
  83         Lock lock(mutex_);
  84         if (routes_.empty())
  85         return 0;
  86         NetworkPrefix prefix(addr,32);
  87         //TODO Routing algorithem isnt working!!!
  88         RoutingMap::iterator it = routes_.lower_bound(prefix);
  89 //      it--;
  90         if (it!=routes_.end())
  91                 return it->second;
  92         it=routes_.begin();
  93         return it->second;
  94 }
  95
  96 u_int16_t* RoutingTable::getOrNewRoutingTEUnlocked(const NetworkPrefix & addr)
  97 {
  98   RoutingMap::iterator it = routes_.find(addr);
  99   if(it!=routes_.end())
 100     return &(it->second);
 101
 102   routes_.insert(RoutingMap::value_type(addr, 1));
 103   it = routes_.find(addr);
 104   return &(it->second);
 105 }
 106
 107 uint16_t RoutingTable::getCountUnlocked()
 108 {
 109         RoutingMap::iterator it = routes_.begin();
 110         uint16_t routes=0;
 111         for (;it!=routes_.end();++it)
 112                 routes++;
 113         return routes;
 114 }
 115
 116 RoutingMap::iterator RoutingTable::getBeginUnlocked()
 117 {
 118         return routes_.begin();
 119 }
 120
 121 RoutingMap::iterator RoutingTable::getEndUnlocked()
 122 {
 123         return routes_.end();
 124 }
 125
 126 void RoutingTable::clear()
 127 {
 128   Lock lock(mutex_);
 129         routes_.clear();
 130 }
 131
 132 bool RoutingTable::empty()
 133 {
 134   Lock lock(mutex_);
 135         return routes_.empty();
 136 }
 137
 138 Mutex& RoutingTable::getMutex()
 139 {
 140   return mutex_;
 141 }