summaryrefslogtreecommitdiff
path: root/routingTable.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'routingTable.cpp')
-rw-r--r--routingTable.cpp83
1 files changed, 83 insertions, 0 deletions
diff --git a/routingTable.cpp b/routingTable.cpp
new file mode 100644
index 0000000..24ac106
--- /dev/null
+++ b/routingTable.cpp
@@ -0,0 +1,83 @@
+/*
+ * 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
+ */
+
+#include "threadUtils.hpp"
+#include "datatypes.h"
+
+#include "routingTable.h"
+
+RoutingTable::RoutingTable()
+{
+}
+
+RoutingTable::~RoutingTable()
+{
+}
+
+void RoutingTable::addRoute(const RoutingTableEntry &route )
+{
+ Lock lock(mutex_);
+
+// std::pair<ConnectionMap::iterator, bool> ret = connections_.insert(ConnectionMap::value_type(mux, conn));
+// if(!ret.second)
+// {
+// connections_.erase(ret.first);
+// connections_.insert(ConnectionMap::value_type(mux, conn));
+// }
+}
+
+const RoutingMap::iterator RoutingTable::getEnd()
+{
+ return routes_.end();
+}
+
+const RoutingMap::iterator RoutingTable::getRoute()
+{
+ Lock lock(mutex_);
+ RoutingMap::iterator it = routes_.begin();
+ return it;
+}
+
+void RoutingTable::clear()
+{
+ Lock lock(mutex_);
+ routes_.clear();
+}
+
+bool RoutingTable::empty()
+{
+ Lock lock(mutex_);
+ return routes_.empty();
+}
+
+Mutex& RoutingTable::getMutex()
+{
+ return mutex_;
+}