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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
|
/*
This file is part of GNUnet.
Copyright (C) 2001, 2002, 2003, 2005, 2006, 2017 GNUnet e.V.
GNUnet is free software: you can redistribute it and/or modify it
under the terms of the GNU Affero General Public License as published
by the Free Software Foundation, either version 3 of the License,
or (at your option) any later version.
GNUnet 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
Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
SPDX-License-Identifier: AGPL3.0-or-later
*/
/**
* @file util/test_common_allocation.c
* @brief testcase for common_allocation.c
*/
#include "platform.h"
#include "gnunet_util_lib.h"
static int
check (void)
{
#define MAX_TESTVAL 1024
char *ptrs[MAX_TESTVAL];
char *tmp;
int i;
int j;
int k;
unsigned int ui;
/* GNUNET_malloc/GNUNET_free test */
k = 352; /* random start value */
for (i = 1; i < MAX_TESTVAL; i++)
{
ptrs[i] = GNUNET_malloc (i);
for (j = 0; j < i; j++)
ptrs[i][j] = k++;
}
for (i = MAX_TESTVAL - 1; i >= 1; i--)
{
for (j = i - 1; j >= 0; j--)
if (ptrs[i][j] != (char) --k)
return 1;
GNUNET_free (ptrs[i]);
}
/* GNUNET_free test */
tmp = GNUNET_malloc (4);
GNUNET_free (tmp);
/* GNUNET_strdup tests */
ptrs[0] = GNUNET_strdup ("bar");
if (0 != strcmp (ptrs[0], "bar"))
return 3;
/* now realloc */
ptrs[0] = GNUNET_realloc (ptrs[0], 12);
strcpy (ptrs[0], "Hello World");
GNUNET_free (ptrs[0]);
GNUNET_asprintf (&ptrs[0], "%s %s", "Hello", "World");
GNUNET_assert (strlen (ptrs[0]) == 11);
GNUNET_free (ptrs[0]);
/* GNUNET_array_grow tests */
ptrs[0] = NULL;
ui = 0;
GNUNET_array_grow (ptrs[0], ui, 42);
if (ui != 42)
return 4;
GNUNET_array_grow (ptrs[0], ui, 22);
if (ui != 22)
return 5;
for (j = 0; j < 22; j++)
ptrs[0][j] = j;
GNUNET_array_grow (ptrs[0], ui, 32);
for (j = 0; j < 22; j++)
if (ptrs[0][j] != j)
return 6;
for (j = 22; j < 32; j++)
if (ptrs[0][j] != 0)
return 7;
GNUNET_array_grow (ptrs[0], ui, 0);
if (i != 0)
return 8;
if (ptrs[0] != NULL)
return 9;
return 0;
}
static int
check2 (void)
{
char *a1 = NULL;
unsigned int a1_len = 0;
const char *a2 = "test";
GNUNET_array_append (a1,
a1_len,
'x');
GNUNET_array_concatenate (a1,
a1_len,
a2,
4);
GNUNET_assert (0 == strncmp ("xtest",
a1,
5));
GNUNET_assert (5 == a1_len);
GNUNET_free (a1);
return 0;
}
int
main (int argc, char *argv[])
{
int ret;
GNUNET_log_setup ("test-common-allocation",
"WARNING",
NULL);
ret = check () | check2 ();
if (ret != 0)
fprintf (stderr,
"ERROR %d.\n",
ret);
return ret;
}
/* end of test_common_allocation.c */
|