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
|
/*
* 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 "networkPrefix.h"
#include "threadUtils.hpp"
#include "datatypes.h"
#include "routingTable.h"
RoutingTable* RoutingTable::inst = NULL;
Mutex RoutingTable::instMutex;
RoutingTable& gRoutingTable = RoutingTable::instance();
RoutingTable& RoutingTable::instance()
{
Lock lock(instMutex);
static instanceCleaner c;
if(!inst)
inst = new RoutingTable();
return *inst;
}
RoutingTable::RoutingTable()
{
}
RoutingTable::~RoutingTable()
{
}
void RoutingTable::addRoute(const NetworkPrefix & pref,u_int16_t mux )
{
Lock lock(mutex_);
std::pair<RoutingMap::iterator, bool> ret = routes_.insert(RoutingMap::value_type(pref,mux));
if(!ret.second)
{
routes_.erase(ret.first);
routes_.insert(RoutingMap::value_type(pref,mux));
}
}
void RoutingTable::delRoute(const NetworkPrefix & pref )
{
Lock lock(mutex_);
routes_.erase(routes_.find(pref));
}
u_int16_t RoutingTable::getRoute(const NetworkAddress & addr)
{
Lock lock(mutex_);
if (routes_.empty())
return 0;
NetworkPrefix prefix(addr);
prefix.setNetworkPrefixLength(32);
RoutingMap::iterator it = routes_.lower_bound(prefix);
it--;
if (it!=routes_.end())
return it->second;
return 0;
}
u_int16_t& RoutingTable::getOrNewRoutingTEUnlocked(const NetworkAddress & addr)
{
RoutingMap::iterator it = routes_.find(addr);
if(it!=routes_.end())
return it->second;
routes_.insert(RoutingMap::value_type(addr, 0));
it = routes_.find(addr);
return it->second;
}
void RoutingTable::clear()
{
Lock lock(mutex_);
routes_.clear();
}
bool RoutingTable::empty()
{
Lock lock(mutex_);
return routes_.empty();
}
Mutex& RoutingTable::getMutex()
{
return mutex_;
}
|
