src/routingTable.h

   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
  32 #ifndef _ROUTINGTABLE_H
  33 #define _ROUTINGTABLE_H
  34
  35 #include <map>
  36 #include <deque>
  37
  38 #include "threadUtils.hpp"
  39 #include "datatypes.h"
  40 #include "networkAddress.h"
  41 #include "networkPrefix.h"
  42 #include "routingTreeNode.h"
  43 #include "boost/array.hpp"
  44 typedef std::map<NetworkPrefix,u_int16_t> RoutingMap;
  45
  46 class RoutingTable
  47 {
  48 public:
  49         static RoutingTable& instance();
  50         RoutingTable();
  51         ~RoutingTable();
  52         void addRoute(const NetworkPrefix & ,u_int16_t);
  53         void updateRouteTreeUnlocked(const NetworkPrefix & pref);
  54         void delRoute(const NetworkPrefix & );
  55         u_int16_t getRoute(const NetworkAddress &);
  56         bool empty(network_address_type_t type);
  57         void clear(network_address_type_t type);
  58   Mutex& getMutex();
  59         u_int16_t* getOrNewRoutingTEUnlocked(const NetworkPrefix & addr);
  60         u_int16_t getCountUnlocked(network_address_type_t type);
  61         RoutingMap::iterator getBeginUnlocked(network_address_type_t type);
  62         RoutingMap::iterator getEndUnlocked(network_address_type_t type);
  63
  64 private:
  65   static Mutex instMutex;
  66         static RoutingTable* inst;
  67   class instanceCleaner {
  68     public: ~instanceCleaner() {
  69      if(RoutingTable::inst != 0)
  70        delete RoutingTable::inst;
  71    }
  72         };
  73         RoutingTable(const RoutingTable &s);
  74   void operator=(const RoutingTable &s);
  75         boost::array<RoutingMap,3> routes_;
  76         boost::array<RoutingTreeNode,3> root_;
  77   Mutex mutex_;
  78 };
  79
  80 extern RoutingTable& gRoutingTable;
  81
  82 #endif