blob: b699ee9d46efd256a4b7bf050eaed4897ab97ecc (
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
|
/*
* uAnytun
*
* uAnytun is a tiny implementation of SATP. Unlike Anytun which is a full
* featured implementation uAnytun has no support for multiple connections
* or synchronisation. It is a small single threaded implementation intended
* to act as a client on small platforms.
* 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-2010 Christian Pointner <equinox@anytun.org>
*
* This file is part of uAnytun.
*
* uAnytun is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* any later version.
*
* uAnytun 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 uAnytun. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef UANYTUN_seq_window_h_INCLUDED
#define UANYTUN_seq_window_h_INCLUDED
struct seq_win_element_struct {
sender_id_t sender_id_;
seq_nr_t max_;
window_size_t pos_;
u_int8_t* window_;
struct seq_win_element_struct* next_;
};
typedef struct seq_win_element_struct seq_win_element_t;
struct seq_win_struct {
window_size_t size_;
seq_win_element_t* first_;
};
typedef struct seq_win_struct seq_win_t;
int seq_win_init(seq_win_t* win, window_size_t size);
void seq_win_clear(seq_win_t* win);
seq_win_element_t* seq_win_new_element(sender_id_t sender_id, seq_nr_t max, window_size_t size);
int seq_win_check_and_add(seq_win_t* win, sender_id_t sender_id, seq_nr_t seq_nr);
void seq_win_print(seq_win_t* win);
#endif
|
