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 methods 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-2014 Markus Grüneis, 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/>.
32 * In addition, as a special exception, the copyright holders give
33 * permission to link the code of portions of this program with the
34 * OpenSSL library under certain conditions as described in each
35 * individual source file, and distribute linked combinations
37 * You must obey the GNU General Public License in all respects
38 * for all of the code used other than OpenSSL. If you modify
39 * file(s) with this exception, you may extend this exception to your
40 * version of the file(s), but you are not obligated to do so. If you
41 * do not wish to do so, delete this exception statement from your
42 * version. If you delete this exception statement from all source
43 * files in the program, then also delete it here.
46 #include "threadUtils.hpp"
47 #include "datatypes.h"
49 #include "seqWindow.h"
51 SeqWindowElement::SeqWindowElement()
58 SeqWindowElement::~SeqWindowElement()
65 void SeqWindowElement::init(window_size_t w, seq_nr_t m)
70 window_ = new uint8_t[w];
71 memset(window_, 0, w);
77 SeqWindow::SeqWindow(window_size_t w) : window_size_(w)
81 SeqWindow::~SeqWindow()
85 bool SeqWindow::checkAndAdd(sender_id_t sender, seq_nr_t seq_nr)
92 SenderMap::iterator s = sender_.find(sender);
93 if(s == sender_.end()) {
94 sender_[sender].init(window_size_, seq_nr);
99 if(s->second.max_ < window_size_) {
100 s->second.max_ += SEQ_NR_MAX/2;
101 seq_nr += SEQ_NR_MAX/2;
103 } else if(s->second.max_ > (SEQ_NR_MAX - window_size_)) {
104 s->second.max_ -= SEQ_NR_MAX/2;
105 seq_nr -= SEQ_NR_MAX/2;
109 seq_nr_t min = s->second.max_ - window_size_ + 1;
110 if(seq_nr < min || seq_nr == s->second.max_) {
112 s->second.max_ -= SEQ_NR_MAX/2;
113 } else if(shifted == 2) {
114 s->second.max_ += SEQ_NR_MAX/2;
119 if(seq_nr > s->second.max_) {
120 seq_nr_t diff = seq_nr - s->second.max_;
121 if(diff >= window_size_) {
125 window_size_t new_pos = s->second.pos_ + diff;
127 if(new_pos >= window_size_) {
128 new_pos -= window_size_;
130 if(s->second.pos_ < window_size_ - 1) {
131 memset(&(s->second.window_[s->second.pos_ + 1]), 0, window_size_ - s->second.pos_ - 1);
134 memset(s->second.window_, 0, new_pos);
136 memset(&(s->second.window_[s->second.pos_ + 1]), 0, diff);
138 s->second.pos_ = new_pos;
139 s->second.window_[s->second.pos_] = 1;
140 s->second.max_ = seq_nr;
143 s->second.max_ -= SEQ_NR_MAX/2;
144 } else if(shifted == 2) {
145 s->second.max_ += SEQ_NR_MAX/2;
151 seq_nr_t diff = s->second.max_ - seq_nr;
152 window_size_t pos = diff > s->second.pos_ ? s->second.pos_ + window_size_ : s->second.pos_;
156 s->second.max_ -= SEQ_NR_MAX/2;
157 } else if(shifted == 2) {
158 s->second.max_ += SEQ_NR_MAX/2;
161 int ret = s->second.window_[pos];
162 s->second.window_[pos] = 1;
171 void SeqWindow::clear(sender_id_t sender)
174 sender_.erase(sender);
177 void SeqWindow::clear()