X-Git-Url: https://git.syn-net.org/debian/?a=blobdiff_plain;f=src%2FroutingTreeNode.cpp;h=880285b410ac41e309b9f06002867ab544a0affb;hb=8a36d5e03bd95d0d6429927f39d064f623960a69;hp=e50ff703cf96f68a37a56b3e9ec5cc48fe6d94ff;hpb=f9ad69dfae6bcec427652b0c4230603e465bd544;p=anytun.git diff --git a/src/routingTreeNode.cpp b/src/routingTreeNode.cpp index e50ff70..880285b 100644 --- a/src/routingTreeNode.cpp +++ b/src/routingTreeNode.cpp @@ -6,12 +6,12 @@ * 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 + * 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-2009 Othmar Gsenger, Erwin Nindl, + * Copyright (C) 2007-2014 Markus Grüneis, Othmar Gsenger, Erwin Nindl, * Christian Pointner * * This file is part of Anytun. @@ -27,39 +27,54 @@ * 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 . + * along with Anytun. If not, see . + * + * 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 + #include "routingTreeNode.h" RoutingTreeNode::RoutingTreeNode():mux_(0),valid_(false) { - for(int i=0; i<256; i++) - nodes_[i]=NULL; + for(int i=0; i<256; i++) { + nodes_[i]=NULL; + } } void RoutingTreeNode::print(int level) const { - if (valid_) - { - std::cout << " -> " <print(level+1); - } - } + if(valid_) { + std::cout << " -> " <print(level+1); + } + } } RoutingTreeNode::~RoutingTreeNode() { - for(int i=0; i<256; i++) - if(nodes_[i]) - delete nodes_[i]; -} + for(int i=0; i<256; i++) + if(nodes_[i]) { + delete nodes_[i]; + } +}