blob: b027bd868c9c99fbee12a713c4598e0a2cf582ed (
plain) (
blame)
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
|
/*
* 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
|
