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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
|
/*
* Copyright (c) 2011, Collabora Ltd.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above
* copyright notice, this list of conditions and the
* following disclaimer.
* * Redistributions in binary form must reproduce the
* above copyright notice, this list of conditions and
* the following disclaimer in the documentation and/or
* other materials provided with the distribution.
* * The names of contributors to this software may not be
* used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
* THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
* DAMAGE.
*
* Author: Stef Walter <stefw@collabora.co.uk>
*/
#include "config.h"
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "array.h"
#include "test.h"
static void
test_create (void)
{
p11_array *array;
array = p11_array_new (NULL);
assert_ptr_not_null (array);
p11_array_free (array);
}
static void
test_free_null (void)
{
p11_array_free (NULL);
}
static void
destroy_value (void *data)
{
int *value = data;
*value = 2;
}
static void
test_free_destroys (void)
{
p11_array *array;
int value = 0;
array = p11_array_new (destroy_value);
assert_ptr_not_null (array);
if (!p11_array_push (array, &value))
assert_not_reached ();
p11_array_free (array);
assert_num_eq (2, value);
}
static void
test_add (void)
{
char *value = "VALUE";
p11_array *array;
array = p11_array_new (NULL);
if (!p11_array_push (array, value))
assert_not_reached ();
assert_num_eq (1, array->num);
assert_ptr_eq (array->elem[0], value);
p11_array_free (array);
}
static void
test_add_remove (void)
{
char *value = "VALUE";
p11_array *array;
array = p11_array_new (NULL);
if (!p11_array_push (array, value))
assert_not_reached ();
assert_num_eq (1, array->num);
assert_ptr_eq (array->elem[0], value);
p11_array_remove (array, 0);
assert_num_eq (0, array->num);
p11_array_free (array);
}
static void
test_remove_destroys (void)
{
p11_array *array;
int value = 0;
array = p11_array_new (destroy_value);
if (!p11_array_push (array, &value))
assert_not_reached ();
p11_array_remove (array, 0);
assert_num_eq (2, value);
/* should not be destroyed again */
value = 0;
p11_array_free (array);
assert_num_eq (0, value);
}
static void
test_remove_and_count (void)
{
p11_array *array;
int *value;
int i;
array = p11_array_new (free);
assert_num_eq (0, array->num);
for (i = 0; i < 20000; ++i) {
value = malloc (sizeof (int));
assert (value != NULL);
*value = i;
if (!p11_array_push (array, value))
assert_not_reached ();
assert_num_eq (i + 1, array->num);
}
for (i = 10; i < 20000; ++i) {
p11_array_remove (array, 10);
assert_num_eq (20010 - (i + 1), array->num);
}
assert_num_eq (10, array->num);
p11_array_free (array);
}
static void
test_clear_destroys (void)
{
p11_array *array;
int value = 0;
array = p11_array_new (destroy_value);
if (!p11_array_push (array, &value))
assert_not_reached ();
assert_num_eq (1, array->num);
p11_array_clear (array);
assert_num_eq (2, value);
assert_num_eq (0, array->num);
/* should not be destroyed again */
value = 0;
p11_array_free (array);
assert_num_eq (0, value);
}
int
main (int argc,
char *argv[])
{
p11_test (test_create, "/array/create");
p11_test (test_add, "/array/add");
p11_test (test_add_remove, "/array/add-remove");
p11_test (test_remove_destroys, "/array/remove-destroys");
p11_test (test_remove_and_count, "/array/remove-and-count");
p11_test (test_free_null, "/array/free-null");
p11_test (test_free_destroys, "/array/free-destroys");
p11_test (test_clear_destroys, "/array/clear-destroys");
return p11_test_run (argc, argv);
}
|
