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
|
// SPDX-License-Identifier: GPL-2.0+
/*
* Copyright 2024 Google LLC
* Written by Simon Glass <sjg@chromium.org>
*/
#include <membuf.h>
#include <os.h>
#include <rand.h>
#include <string.h>
#include <test/lib.h>
#include <test/test.h>
#include <test/ut.h>
#define TEST_SIZE 16
#define TEST_COUNT 10000
static void membuf_zero(struct membuf *mb)
{
memset(mb->start, '\0', mb->end - mb->start);
}
static int membuf_check(struct unit_test_state *uts, struct membuf *mb,
int value)
{
/* head is out of range */
ut_assert(!(mb->head < mb->start || mb->head >= mb->end));
/* tail is out of range */
ut_assert(!(mb->tail < mb->start || mb->tail >= mb->end));
return 0;
}
/* write from 1 to test_size bytes, and check they come back OK */
static int lib_test_membuf_one(struct unit_test_state *uts)
{
char in[TEST_SIZE * 2], out[TEST_SIZE * 2];
struct membuf mb;
int size, ret, test_size, i;
ut_assertok(membuf_new(&mb, TEST_SIZE));
/* setup in test */
for (i = 0; i < TEST_SIZE; i++) {
in[i] = (i & 63) + '0';
in[i + TEST_SIZE] = in[i];
}
test_size = TEST_SIZE;
for (i = 1; i < TEST_COUNT; i++) {
membuf_zero(&mb);
size = rand() % test_size;
// now write patterns and check they come back OK
ret = membuf_put(&mb, in, 0);
ret = membuf_put(&mb, in, size);
ut_asserteq(size, ret);
ret = membuf_put(&mb, in, 0);
ut_assertok(membuf_check(uts, &mb, i));
ret = membuf_get(&mb, out, 0);
ret = membuf_get(&mb, out, size);
ut_asserteq(size, ret);
ret = membuf_get(&mb, out, 0);
ut_assertok(membuf_check(uts, &mb, i));
ut_asserteq_mem(in, out, size);
}
return 0;
}
LIB_TEST(lib_test_membuf_one, 0);
/* write random number of bytes, and check they come back OK */
static int lib_test_membuf_random(struct unit_test_state *uts)
{
char in[TEST_SIZE * 2];
char buf[TEST_SIZE * 2];
struct membuf mb;
int size, ret, test_size, i;
char *inptr, *outptr;
int max_avail, min_free;
ut_assertok(membuf_new(&mb, TEST_SIZE));
for (i = 0; i < TEST_SIZE; i++) {
in[i] = (i & 63) + '0';
in[i + TEST_SIZE] = in[i];
}
test_size = TEST_SIZE;
inptr = in;
outptr = in;
min_free = TEST_COUNT;
max_avail = 0;
membuf_zero(&mb);
for (i = 0; i < TEST_COUNT; i++) {
size = rand() % test_size;
if (membuf_free(&mb) < min_free)
min_free = membuf_free(&mb);
ret = membuf_put(&mb, inptr, size);
ut_assertok(membuf_check(uts, &mb, i));
inptr += ret;
if (inptr >= in + TEST_SIZE)
inptr -= TEST_SIZE;
size = rand() % (test_size - 1);
if (membuf_avail(&mb) > max_avail)
max_avail = membuf_avail(&mb);
ret = membuf_get(&mb, buf, size);
ut_assertok(membuf_check(uts, &mb, i));
ut_asserteq_mem(buf, outptr, ret);
outptr += ret;
if (outptr >= in + TEST_SIZE)
outptr -= TEST_SIZE;
}
return 0;
}
LIB_TEST(lib_test_membuf_random, 0);
/* test membuf_extend() with split segments */
static int lib_test_membuf_extend(struct unit_test_state *uts)
{
char in[TEST_SIZE * 2];
char buf[TEST_SIZE * 2];
struct membuf mb;
int ret, test_size, i, cur;
char *data;
ut_assertok(membuf_new(&mb, TEST_SIZE));
for (i = 0; i < TEST_SIZE; i++) {
in[i] = (i & 63) + '0';
in[i + TEST_SIZE] = in[i];
}
test_size = TEST_SIZE - 1;
for (cur = 0; cur <= test_size; cur++) {
ut_assertok(membuf_new(&mb, TEST_SIZE));
membuf_zero(&mb);
/*
* add some bytes, then remove them - this will force the membuf
* to have data split into two segments when we fill it
*/
ret = membuf_putraw(&mb, TEST_SIZE / 2, true, &data);
membuf_getraw(&mb, ret, true, &data);
ut_asserteq(TEST_SIZE / 2, ret);
/* fill it */
ret = membuf_put(&mb, in, cur);
ut_assertok(membuf_check(uts, &mb, cur));
ut_asserteq(cur, ret);
/* extend the buffer */
ut_assertok(membuf_extend_by(&mb, TEST_SIZE, -1));
ut_assertok(membuf_check(uts, &mb, cur));
/* check our data is still there */
ret = membuf_get(&mb, buf, TEST_SIZE * 2);
ut_assertok(membuf_check(uts, &mb, cur));
ut_asserteq(cur, ret);
ut_asserteq_mem(in, buf, cur);
membuf_uninit(&mb);
}
return 0;
}
LIB_TEST(lib_test_membuf_extend, 0);
/* test membuf_readline() with generated data */
static int lib_test_membuf_readline(struct unit_test_state *uts)
{
char *buf;
int size, cur, i, ret, readptr, cmpptr;
struct membuf mb;
char *data;
char str[256];
char *s;
ut_assertok(membuf_new(&mb, 1024));
membuf_zero(&mb);
/* Use the README as test data */
ut_assertok(os_read_file("README", (void **)&buf, &size));
cur = 0;
readptr = 0;
cmpptr = 0;
for (i = 0; i < 100000; i++, cur += 1) {
/* fill the buffer with up to 'cur' bytes */
ret = membuf_putraw(&mb, cur, false, &data);
if (ret > 0) {
int can_read = min(ret, size - readptr);
memcpy(data, &buf[readptr], can_read);
readptr += can_read;
membuf_putraw(&mb, can_read, true, &data);
ut_assertok(membuf_check(uts, &mb, i));
}
/* read a line and compare */
ret = membuf_readline(&mb, str, 256, 0, true);
ut_assertok(membuf_check(uts, &mb, i));
if (ret) {
char *ptr;
s = &buf[cmpptr];
ptr = strchr(s, '\n');
*ptr = '\0';
ut_asserteq_str(s, str);
cmpptr += strlen(s) + 1;
*ptr = '\n';
} else {
ut_assert(membuf_free(&mb));
}
}
membuf_dispose(&mb);
os_free(buf);
return 0;
}
LIB_TEST(lib_test_membuf_readline, 0);
|
