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
65
66
67
68
69
70
|
/*
* Ouroboros - Copyright (C) 2016
*
* Test of the du_buff
*
* Dimitri Staessens <dimitri.staessens@intec.ugent.be>
*
* This program 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 2 of the License, or
* (at your option) any later version.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include <ouroboros/du_buff.h>
#include "du_buff.c"
#define TEST_BUFF_SIZE 16 * DU_BLOCK_DATA_SIZE
#define MAX(a,b) (a > b ? a : b)
#define MIN(a,b) (a < b ? a : b)
int du_buff_test(int argc, char ** argv)
{
int i, j, k;
int i_inc, j_inc, k_inc;
uint8_t bits[TEST_BUFF_SIZE];
for (i = 0; i < TEST_BUFF_SIZE; i++)
bits[i] = 170;
i_inc = MAX(1, DU_BLOCK_DATA_SIZE / 4);
j_inc = MAX(1, DU_BLOCK_DATA_SIZE / 8);
k_inc = MAX(1, DU_BLOCK_DATA_SIZE / 16);
for (i = DU_BUFF_BLOCK_SIZE / 4; i <= TEST_BUFF_SIZE; i += i_inc) {
for (j = 0; j < i; j += j_inc) {
for (k = 0; k < i - j; k += k_inc) {
du_buff_t * dub = du_buff_create(i);
if (dub == NULL)
return -1;
if (k > DU_BLOCK_DATA_SIZE) {
du_buff_destroy (dub);
continue;
}
if (i - (j + k) > DU_BLOCK_DATA_SIZE) {
du_buff_destroy (dub);
continue;
}
if (du_buff_init(dub, k, bits, j) < 0) {
du_buff_destroy (dub);
return -1;
}
du_buff_destroy (dub);
}
}
}
return 0; /* tests succeeded */
}
|
