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
|
// SPDX-License-Identifier: LGPL-2.1-or-later
/*
* Copyright (C) 2015 Intel Corporation. All rights reserved.
*/
#include <stdio.h>
#include <stdlib.h>
#include <libkmod/libkmod-internal.h>
/* FIXME: hack, change name so we don't clash */
#undef ERR
#include "testsuite.h"
static int len(struct kmod_list *list)
{
int count = 0;
struct kmod_list *l;
kmod_list_foreach(l, list)
count++;
return count;
}
static void kmod_list_remove_all(struct kmod_list *list)
{
while (list)
list = kmod_list_remove(list);
}
static int test_list_last(const struct test *t)
{
struct kmod_list *list = NULL, *last;
int i;
const char *v[] = { "v1", "v2", "v3", "v4", "v5" };
const int N = ARRAY_SIZE(v);
for (i = 0; i < N; i++)
list = kmod_list_append(list, v[i]);
assert_return(len(list) == N, EXIT_FAILURE);
last = kmod_list_last(list);
assert_return(last->data == v[N - 1], EXIT_FAILURE);
kmod_list_remove_all(list);
return 0;
}
DEFINE_TEST(test_list_last, .description = "test for the last element of a list");
static int test_list_prev(const struct test *t)
{
struct kmod_list *list = NULL, *l, *p;
int i;
const char *v[] = { "v1", "v2", "v3", "v4", "v5" };
const int N = ARRAY_SIZE(v);
l = kmod_list_prev(list, list);
assert_return(l == NULL, EXIT_FAILURE);
for (i = 0; i < N; i++)
list = kmod_list_append(list, v[i]);
l = kmod_list_prev(list, list);
assert_return(l == NULL, EXIT_FAILURE);
l = list;
for (i = 0; i < N - 1; i++) {
l = kmod_list_next(list, l);
p = kmod_list_prev(list, l);
assert_return(p->data == v[i], EXIT_FAILURE);
}
kmod_list_remove_all(list);
return 0;
}
DEFINE_TEST(test_list_prev, .description = "test list prev");
static int test_list_remove_data(const struct test *t)
{
struct kmod_list *list = NULL, *l;
int i;
const char *v[] = { "v1", "v2", "v3", "v4", "v5" }, *removed;
const int N = ARRAY_SIZE(v);
for (i = 0; i < N; i++)
list = kmod_list_append(list, v[i]);
removed = v[N / 2];
list = kmod_list_remove_data(list, removed);
assert_return(len(list) == N - 1, EXIT_FAILURE);
kmod_list_foreach(l, list)
assert_return(l->data != removed, EXIT_FAILURE);
kmod_list_remove_all(list);
return 0;
}
DEFINE_TEST(test_list_remove_data,
.description = "test list function to remove element by data");
static int test_list_append_list(const struct test *t)
{
struct kmod_list *a = NULL, *b = NULL, *c, *l;
int i;
const char *v[] = { "v1", "v2", "v3", "v4", "v5" };
const int N = ARRAY_SIZE(v), M = N / 2;
for (i = 0; i < M; i++)
a = kmod_list_append(a, v[i]);
assert_return(len(a) == M, EXIT_FAILURE);
for (i = M; i < N; i++)
b = kmod_list_append(b, v[i]);
assert_return(len(b) == N - M, EXIT_FAILURE);
a = kmod_list_append_list(a, NULL);
assert_return(len(a) == M, EXIT_FAILURE);
b = kmod_list_append_list(NULL, b);
assert_return(len(b) == N - M, EXIT_FAILURE);
c = kmod_list_append_list(a, b);
assert_return(len(c) == N, EXIT_FAILURE);
i = 0;
kmod_list_foreach(l, c) {
assert_return(l->data == v[i], EXIT_FAILURE);
i++;
}
kmod_list_remove_all(c);
return 0;
}
DEFINE_TEST(test_list_append_list,
.description = "test list function to append another list");
static int test_list_insert_before(const struct test *t)
{
struct kmod_list *list = NULL, *l;
const char *v1 = "v1", *v2 = "v2", *v3 = "v3", *vx = "vx";
list = kmod_list_insert_before(list, v3);
assert_return(len(list) == 1, EXIT_FAILURE);
list = kmod_list_insert_before(list, v2);
list = kmod_list_insert_before(list, v1);
assert_return(len(list) == 3, EXIT_FAILURE);
l = list;
assert_return(l->data == v1, EXIT_FAILURE);
l = kmod_list_next(list, l);
assert_return(l->data == v2, EXIT_FAILURE);
l = kmod_list_insert_before(l, vx);
assert_return(len(list) == 4, EXIT_FAILURE);
assert_return(l->data == vx, EXIT_FAILURE);
l = kmod_list_next(list, l);
assert_return(l->data == v2, EXIT_FAILURE);
l = kmod_list_next(list, l);
assert_return(l->data == v3, EXIT_FAILURE);
kmod_list_remove_all(list);
return 0;
}
DEFINE_TEST(test_list_insert_before,
.description = "test list function to insert before element");
static int test_list_insert_after(const struct test *t)
{
struct kmod_list *list = NULL, *l;
const char *v1 = "v1", *v2 = "v2", *v3 = "v3", *vx = "vx";
list = kmod_list_insert_after(list, v1);
assert_return(len(list) == 1, EXIT_FAILURE);
list = kmod_list_insert_after(list, v3);
list = kmod_list_insert_after(list, v2);
assert_return(len(list) == 3, EXIT_FAILURE);
l = list;
assert_return(l->data == v1, EXIT_FAILURE);
l = kmod_list_insert_after(l, vx);
assert_return(len(list) == 4, EXIT_FAILURE);
assert_return(l->data == v1, EXIT_FAILURE);
l = kmod_list_next(list, l);
assert_return(l->data == vx, EXIT_FAILURE);
l = kmod_list_next(list, l);
assert_return(l->data == v2, EXIT_FAILURE);
l = kmod_list_next(list, l);
assert_return(l->data == v3, EXIT_FAILURE);
kmod_list_remove_all(list);
return 0;
}
DEFINE_TEST(test_list_insert_after,
.description = "test list function to insert after element");
TESTSUITE_MAIN();
|
