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 #include "networkPrefix.h"
  31 #include "threadUtils.hpp"
  32 #include "datatypes.h"
  33
  34 #include "routingTable.h"
  35
  36 RoutingTable* RoutingTable::inst = NULL;
  37 Mutex RoutingTable::instMutex;
  38 RoutingTable& gRoutingTable = RoutingTable::instance();
  39
  40
  41 RoutingTable& RoutingTable::instance()
  42 {
  43   Lock lock(instMutex);
  44   static instanceCleaner c;
  45   if(!inst)
  46     inst = new RoutingTable();
  47
  48   return *inst;
  49 }
  50
  51 RoutingTable::RoutingTable()
  52 {
  53 }
  54
  55 RoutingTable::~RoutingTable()
  56 {
  57 }
  58
  59 void RoutingTable::addRoute(const NetworkPrefix & pref,u_int16_t mux )
  60 {
  61   Lock lock(mutex_);
  62
  63
  64   std::pair<RoutingMap::iterator, bool> ret = routes_.insert(RoutingMap::value_type(pref,mux));
  65   if(!ret.second)
  66   {
  67     routes_.erase(ret.first);
  68     routes_.insert(RoutingMap::value_type(pref,mux));
  69   }
  70 }
  71
  72
  73 void RoutingTable::delRoute(const NetworkPrefix & pref )
  74 {
  75   Lock lock(mutex_);
  76
  77   routes_.erase(routes_.find(pref));
  78 }
  79
  80 u_int16_t  RoutingTable::getRoute(const NetworkAddress & addr)
  81 {
  82         Lock lock(mutex_);
  83         if (routes_.empty())
  84         return 0;
  85         NetworkPrefix prefix(addr);
  86         prefix.setNetworkPrefixLength(32);
  87         RoutingMap::iterator it = routes_.lower_bound(prefix);
  88         it--;
  89         if (it!=routes_.end())
  90                 return it->second;
  91         return 0;
  92 }
  93
  94 u_int16_t& RoutingTable::getOrNewRoutingTEUnlocked(const NetworkAddress & addr)
  95 {
  96   RoutingMap::iterator it = routes_.find(addr);
  97   if(it!=routes_.end())
  98     return it->second;
  99
 100   routes_.insert(RoutingMap::value_type(addr, 0));
 101   it = routes_.find(addr);
 102   return it->second;
 103 }
 104
 105 uint16_t RoutingTable::getCountUnlocked()
 106 {
 107         RoutingMap::iterator it = routes_.begin();
 108         uint16_t routes=0;
 109         for (;it!=routes_.end();++it)
 110                 routes++;
 111         return routes;
 112 }
 113
 114 RoutingMap::iterator RoutingTable::getBeginUnlocked()
 115 {
 116         return routes_.begin();
 117 }
 118
 119 RoutingMap::iterator RoutingTable::getEndUnlocked()
 120 {
 121         return routes_.end();
 122 }
 123
 124 void RoutingTable::clear()
 125 {
 126   Lock lock(mutex_);
 127         routes_.clear();
 128 }
 129
 130 bool RoutingTable::empty()
 131 {
 132   Lock lock(mutex_);
 133         return routes_.empty();
 134 }
 135
 136 Mutex& RoutingTable::getMutex()
 137 {
 138   return mutex_;
 139 }