4 * The secure anycast tunneling protocol (satp) defines a protocol used
5 * for communication between any combination of unicast and anycast
6 * tunnel endpoints. It has less protocol overhead than IPSec in Tunnel
7 * mode and allows tunneling of every ETHER TYPE protocol (e.g.
8 * ethernet, ip, arp ...). satp directly includes cryptography and
9 * message authentication based on the methodes used by SRTP. It is
10 * intended to deliver a generic, scaleable and secure solution for
11 * tunneling and relaying of packets of any protocol.
14 * Copyright (C) 2007-2009 Othmar Gsenger, Erwin Nindl,
15 * Christian Pointner <satp@wirdorange.org>
17 * This file is part of Anytun.
19 * Anytun is free software: you can redistribute it and/or modify
20 * it under the terms of the GNU General Public License as published by
21 * the Free Software Foundation, either version 3 of the License, or
24 * Anytun is distributed in the hope that it will be useful,
25 * but WITHOUT ANY WARRANTY; without even the implied warranty of
26 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
27 * GNU General Public License for more details.
29 * You should have received a copy of the GNU General Public License
30 * along with anytun. If not, see <http://www.gnu.org/licenses/>.
33 #ifndef ANYTUN_routingTree_hpp_INCLUDED
34 #define ANYTUN_routingTree_hpp_INCLUDED
36 #include "anytunError.h"
41 template <class BinaryType>
42 static void walk(BinaryType bytes ,RoutingTreeNode * node,u_int8_t length,u_int16_t mux)
44 for (int i=0; i<(length/8); i++)
46 if (!node->nodes_[bytes[i]])
47 node->nodes_[bytes[i]] = new RoutingTreeNode;
48 node=node->nodes_[bytes[i]];
52 unsigned char idx=0xff;
54 idx &= bytes[length/8];
55 unsigned char maxidx=0xff;
58 for (unsigned char i=idx; i<=maxidx; i++)
61 node->nodes_[i] = new RoutingTreeNode;
62 node->nodes_[i]->valid_=true;
63 node->nodes_[i]->mux_=mux;
71 template <class BinaryType>
72 static u_int16_t find(BinaryType bytes ,RoutingTreeNode & root )
76 RoutingTreeNode * node = &root;
82 for (size_t level=0;level<bytes.size();level++)
84 if (node->nodes_[bytes[level]])
86 node=node->nodes_[bytes[level]];
97 AnytunError::throwErr() << "no route";