summaryrefslogtreecommitdiff
path: root/src/routingTable.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/routingTable.h')
-rw-r--r--src/routingTable.h78
1 files changed, 78 insertions, 0 deletions
diff --git a/src/routingTable.h b/src/routingTable.h
new file mode 100644
index 0000000..b027bd8
--- /dev/null
+++ b/src/routingTable.h
@@ -0,0 +1,78 @@
+/*
+ * anytun
+ *
+ * The secure anycast tunneling protocol (satp) defines a protocol used
+ * for communication between any combination of unicast and anycast
+ * tunnel endpoints. It has less protocol overhead than IPSec in Tunnel
+ * mode and allows tunneling of every ETHER TYPE protocol (e.g.
+ * ethernet, ip, arp ...). satp directly includes cryptography and
+ * message authentication based on the methodes used by SRTP. It is
+ * intended to deliver a generic, scaleable and secure solution for
+ * tunneling and relaying of packets of any protocol.
+ *
+ *
+ * Copyright (C) 2007 anytun.org <satp@wirdorange.org>
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License version 2
+ * as published by the Free Software Foundation.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program (see the file COPYING included with this
+ * distribution); if not, write to the Free Software Foundation, Inc.,
+ * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ */
+
+#ifndef _ROUTINGTABLE_H
+#define _ROUTINGTABLE_H
+
+#include <map>
+#include <deque>
+
+#include "threadUtils.hpp"
+#include "datatypes.h"
+//#include "routingTableEntry.h"
+#include "networkAddress.h"
+#include "networkPrefix.h"
+typedef std::map<NetworkPrefix,u_int16_t> RoutingMap;
+
+class RoutingTable
+{
+public:
+ static RoutingTable& instance();
+ RoutingTable();
+ ~RoutingTable();
+ void addRoute(const NetworkPrefix & ,u_int16_t);
+ void delRoute(const NetworkPrefix & );
+ u_int16_t getRoute(const NetworkAddress &);
+ bool empty();
+ void clear();
+ Mutex& getMutex();
+ u_int16_t* getOrNewRoutingTEUnlocked(const NetworkPrefix & addr);
+ uint16_t getCountUnlocked();
+ RoutingMap::iterator getBeginUnlocked();
+ RoutingMap::iterator getEndUnlocked();
+
+private:
+ static Mutex instMutex;
+ static RoutingTable* inst;
+ class instanceCleaner {
+ public: ~instanceCleaner() {
+ if(RoutingTable::inst != 0)
+ delete RoutingTable::inst;
+ }
+ };
+ RoutingTable(const RoutingTable &s);
+ void operator=(const RoutingTable &s);
+ RoutingMap routes_;
+ Mutex mutex_;
+};
+
+extern RoutingTable& gRoutingTable;
+
+#endif