1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
|
/*
* 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 methods 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-2014 Markus Grüneis, Othmar Gsenger, Erwin Nindl,
* Christian Pointner <satp@wirdorange.org>
*
* This file is part of Anytun.
*
* Anytun is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* any later version.
*
* Anytun 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 Anytun. If not, see <http://www.gnu.org/licenses/>.
*
* In addition, as a special exception, the copyright holders give
* permission to link the code of portions of this program with the
* OpenSSL library under certain conditions as described in each
* individual source file, and distribute linked combinations
* including the two.
* You must obey the GNU General Public License in all respects
* for all of the code used other than OpenSSL. If you modify
* file(s) with this exception, you may extend this exception to your
* version of the file(s), but you are not obligated to do so. If you
* do not wish to do so, delete this exception statement from your
* version. If you delete this exception statement from all source
* files in the program, then also delete it here.
*/
#include "networkPrefix.h"
#include "threadUtils.hpp"
#include "datatypes.h"
#include "anytunError.h"
#include "routingTable.h"
#include "routingTree.hpp"
RoutingTable& gRoutingTable = RoutingTable::instance();
RoutingTable& RoutingTable::instance()
{
static RoutingTable instance;
return instance;
}
RoutingTable::RoutingTable()
{
}
RoutingTable::~RoutingTable()
{
}
void RoutingTable::updateRouteTreeUnlocked(const NetworkPrefix& pref)
{
//Lock lock(mutex_); //deadlock
uint8_t length=pref.getNetworkPrefixLength();
network_address_type_t type=pref.getNetworkAddressType();
uint16_t mux = routes_[pref.getNetworkAddressType()].find(pref)->second;
RoutingTreeNode* node = &(root_[type]);
if(type==ipv4) {
ipv4_bytes_type bytes(pref.to_bytes_v4());
if(length>32) {
length=32;
}
RoutingTree::walk(bytes, node, length, mux);
} else if(type==ipv6) {
ipv6_bytes_type bytes(pref.to_bytes_v6());
if(length>128) {
length=128;
}
RoutingTree::walk(bytes, node, length, mux);
} else if(type==ethernet) {
ethernet_bytes_type bytes(pref.to_bytes_ethernet());
if(length>48) {
length=48;
}
RoutingTree::walk(bytes, node, length, mux);
} else {
AnytunError::throwErr() << "illegal protocol type";
}
//root_[type].print(0);
}
void RoutingTable::addRoute(const NetworkPrefix& pref, uint16_t mux)
{
Lock lock(mutex_);
network_address_type_t type=pref.getNetworkAddressType();
if(type==ipv4 || type==ipv6) {
std::pair<RoutingMap::iterator, bool> ret = routes_[type].insert(RoutingMap::value_type(pref,mux));
if(!ret.second) {
routes_[pref.getNetworkAddressType()].erase(ret.first);
routes_[pref.getNetworkAddressType()].insert(RoutingMap::value_type(pref,mux));
}
root_[pref.getNetworkAddressType()]=RoutingTreeNode();
RoutingMap::iterator it = routes_[type].begin();
for(; it!=routes_[pref.getNetworkAddressType()].end(); ++it) {
updateRouteTreeUnlocked(it->first);
}
} else if(type==ethernet) {
return; // TODO: add support for ethernet
} else {
AnytunError::throwErr() << "illegal protocol type";
}
}
void RoutingTable::delRoute(const NetworkPrefix& pref)
{
Lock lock(mutex_);
routes_[pref.getNetworkAddressType()].erase(routes_[pref.getNetworkAddressType()].find(pref));
}
uint16_t RoutingTable::getRoute(const NetworkAddress& addr)
{
Lock lock(mutex_);
network_address_type_t type=addr.getNetworkAddressType();
if(routes_[type].empty()) {
AnytunError::throwErr() << "no route";
}
if(type==ipv4) {
ipv4_bytes_type bytes(addr.to_bytes_v4());
return RoutingTree::find(bytes, root_[type]);
} else if(type==ipv6) {
ipv6_bytes_type bytes(addr.to_bytes_v6());
return RoutingTree::find(bytes, root_[type]);
} else if(type==ethernet) {
//TODO Our model wont fit to ethernet addresses well.
// maybe use hashmap or something like that instead
ethernet_bytes_type bytes(addr.to_bytes_ethernet());
return RoutingTree::find(bytes, root_[type]);
} else {
AnytunError::throwErr() << "illegal protocol type";
}
return 0;
}
uint16_t* RoutingTable::getOrNewRoutingTEUnlocked(const NetworkPrefix& addr)
{
RoutingMap::iterator it = routes_[addr.getNetworkAddressType()].find(addr);
if(it!=routes_[addr.getNetworkAddressType()].end()) {
return &(it->second);
}
routes_[addr.getNetworkAddressType()].insert(RoutingMap::value_type(addr, 1));
it = routes_[addr.getNetworkAddressType()].find(addr);
return &(it->second);
}
uint16_t RoutingTable::getCountUnlocked(network_address_type_t type)
{
RoutingMap::iterator it = routes_[type].begin();
uint16_t routes=0;
for(; it!=routes_[type].end(); ++it) {
routes++;
}
return routes;
}
RoutingMap::iterator RoutingTable::getBeginUnlocked(network_address_type_t type)
{
return routes_[type].begin();
}
RoutingMap::iterator RoutingTable::getEndUnlocked(network_address_type_t type)
{
return routes_[type].end();
}
void RoutingTable::clear(network_address_type_t type)
{
Lock lock(mutex_);
routes_[type].clear();
}
bool RoutingTable::empty(network_address_type_t type)
{
Lock lock(mutex_);
return routes_[type].empty();
}
Mutex& RoutingTable::getMutex()
{
return mutex_;
}
|
