blob: 47dc0fc9ad6092be90ff6be65a6cf56d4b1c0a94 (
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
|
/*
* 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-2008 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 version 3 as
* published by the Free Software Foundation.
*
* 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/>.
*/
#include "routingTreeNode.h"
RoutingTreeNode::RoutingTreeNode():mux_(0),valid_(false)
{
for(int i=0; i<256; i++)
nodes_[i]=NULL;
}
void RoutingTreeNode::print(int level) const
{
if (valid_)
{
std::cout << " -> " <<mux_ ;
}
std::cout << std::endl;
for(int i=0; i<256; i++)
{
if ( nodes_[i])
{
for(int l=0;l<level;l++)
std::cout << " ";
std::cout << (int) i;
nodes_[i]->print(level+1);
}
}
}
RoutingTreeNode::~RoutingTreeNode()
{
for(int i=0; i<256; i++)
if(nodes_[i])
delete nodes_[i];
}
|
