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
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
|
// SPDX-License-Identifier: GPL-2.0+
/*
* Copyright 2023 Google LLC
* Written by Simon Glass <sjg@chromium.org>
*/
#include <alist.h>
#include <string.h>
#include <test/lib.h>
#include <test/test.h>
#include <test/ut.h>
struct my_struct {
uint val;
uint other_val;
};
enum {
obj_size = sizeof(struct my_struct),
};
/* Test alist_init() */
static int lib_test_alist_init(struct unit_test_state *uts)
{
struct alist lst;
ulong start;
start = ut_check_free();
/* with a size of 0, the fields should be inited, with no memory used */
memset(&lst, '\xff', sizeof(lst));
ut_assert(alist_init_struct(&lst, struct my_struct));
ut_asserteq_ptr(NULL, lst.data);
ut_asserteq(0, lst.count);
ut_asserteq(0, lst.alloc);
ut_assertok(ut_check_delta(start));
alist_uninit(&lst);
ut_asserteq_ptr(NULL, lst.data);
ut_asserteq(0, lst.count);
ut_asserteq(0, lst.alloc);
/* use an impossible size */
ut_asserteq(false, alist_init(&lst, obj_size,
CONFIG_SYS_MALLOC_LEN));
ut_assertnull(lst.data);
ut_asserteq(0, lst.count);
ut_asserteq(0, lst.alloc);
/* use a small size */
ut_assert(alist_init(&lst, obj_size, 4));
ut_assertnonnull(lst.data);
ut_asserteq(0, lst.count);
ut_asserteq(4, lst.alloc);
/* free it */
alist_uninit(&lst);
ut_asserteq_ptr(NULL, lst.data);
ut_asserteq(0, lst.count);
ut_asserteq(0, lst.alloc);
ut_assertok(ut_check_delta(start));
/* Check for memory leaks */
ut_assertok(ut_check_delta(start));
return 0;
}
LIB_TEST(lib_test_alist_init, 0);
/* Test alist_get() and alist_getd() */
static int lib_test_alist_get(struct unit_test_state *uts)
{
struct alist lst;
ulong start;
void *ptr;
start = ut_check_free();
ut_assert(alist_init(&lst, obj_size, 3));
ut_asserteq(0, lst.count);
ut_asserteq(3, lst.alloc);
ut_assertnull(alist_get_ptr(&lst, 2));
ut_assertnull(alist_get_ptr(&lst, 3));
ptr = alist_ensure_ptr(&lst, 1);
ut_assertnonnull(ptr);
ut_asserteq(2, lst.count);
ptr = alist_ensure_ptr(&lst, 2);
ut_asserteq(3, lst.count);
ut_assertnonnull(ptr);
ptr = alist_ensure_ptr(&lst, 3);
ut_assertnonnull(ptr);
ut_asserteq(4, lst.count);
ut_asserteq(6, lst.alloc);
ut_assertnull(alist_get_ptr(&lst, 4));
alist_uninit(&lst);
/* Check for memory leaks */
ut_assertok(ut_check_delta(start));
return 0;
}
LIB_TEST(lib_test_alist_get, 0);
/* Test alist_has() */
static int lib_test_alist_has(struct unit_test_state *uts)
{
struct alist lst;
ulong start;
void *ptr;
start = ut_check_free();
ut_assert(alist_init(&lst, obj_size, 3));
ut_assert(!alist_has(&lst, 0));
ut_assert(!alist_has(&lst, 1));
ut_assert(!alist_has(&lst, 2));
ut_assert(!alist_has(&lst, 3));
/* create a new one to force expansion */
ptr = alist_ensure_ptr(&lst, 4);
ut_assertnonnull(ptr);
ut_assert(alist_has(&lst, 0));
ut_assert(alist_has(&lst, 1));
ut_assert(alist_has(&lst, 2));
ut_assert(alist_has(&lst, 3));
ut_assert(alist_has(&lst, 4));
ut_assert(!alist_has(&lst, 5));
alist_uninit(&lst);
/* Check for memory leaks */
ut_assertok(ut_check_delta(start));
return 0;
}
LIB_TEST(lib_test_alist_has, 0);
/* Test alist_ensure() */
static int lib_test_alist_ensure(struct unit_test_state *uts)
{
struct my_struct *ptr3, *ptr4;
struct alist lst;
ulong start;
start = ut_check_free();
ut_assert(alist_init_struct(&lst, struct my_struct));
ut_asserteq(obj_size, lst.obj_size);
ut_asserteq(0, lst.count);
ut_asserteq(0, lst.alloc);
ptr3 = alist_ensure_ptr(&lst, 3);
ut_asserteq(4, lst.count);
ut_asserteq(4, lst.alloc);
ut_assertnonnull(ptr3);
ptr3->val = 3;
ptr4 = alist_ensure_ptr(&lst, 4);
ut_asserteq(8, lst.alloc);
ut_asserteq(5, lst.count);
ut_assertnonnull(ptr4);
ptr4->val = 4;
ut_asserteq(4, alist_get(&lst, 4, struct my_struct)->val);
ut_asserteq_ptr(ptr4, alist_ensure(&lst, 4, struct my_struct));
alist_ensure(&lst, 4, struct my_struct)->val = 44;
ut_asserteq(44, alist_get(&lst, 4, struct my_struct)->val);
ut_asserteq(3, alist_get(&lst, 3, struct my_struct)->val);
ut_assertnull(alist_get(&lst, 7, struct my_struct));
ut_asserteq(8, lst.alloc);
ut_asserteq(5, lst.count);
/* add some more, checking handling of malloc() failure */
malloc_enable_testing(0);
ut_assertnonnull(alist_ensure(&lst, 7, struct my_struct));
ut_assertnull(alist_ensure(&lst, 8, struct my_struct));
malloc_disable_testing();
lst.flags &= ~ALISTF_FAIL;
ut_assertnonnull(alist_ensure(&lst, 8, struct my_struct));
ut_asserteq(16, lst.alloc);
ut_asserteq(9, lst.count);
alist_uninit(&lst);
/* Check for memory leaks */
ut_assertok(ut_check_delta(start));
return 0;
}
LIB_TEST(lib_test_alist_ensure, 0);
/* Test alist_add() bits not tested by lib_test_alist_ensure() */
static int lib_test_alist_add(struct unit_test_state *uts)
{
struct my_struct data, *ptr, *ptr2;
const struct my_struct *chk;
struct alist lst;
ulong start;
start = ut_check_free();
ut_assert(alist_init_struct(&lst, struct my_struct));
data.val = 123;
data.other_val = 456;
ptr = alist_add(&lst, data);
ut_assertnonnull(ptr);
ut_asserteq(4, lst.alloc);
ut_asserteq(1, lst.count);
ut_asserteq(123, ptr->val);
ut_asserteq(456, ptr->other_val);
ptr2 = alist_add_placeholder(&lst);
ut_assertnonnull(ptr2);
ptr2->val = 321;
ptr2->other_val = 654;
chk = alist_get(&lst, 1, struct my_struct);
ut_asserteq(321, chk->val);
ut_asserteq(654, chk->other_val);
ptr2 = alist_getw(&lst, 1, struct my_struct);
ut_asserteq(321, ptr2->val);
ut_asserteq(654, ptr2->other_val);
alist_uninit(&lst);
/* Check for memory leaks */
ut_assertok(ut_check_delta(start));
return 0;
}
LIB_TEST(lib_test_alist_add, 0);
|
