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
|
/*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/
/***
This file is part of systemd.
Copyright 2010 Lennart Poettering
Copyright 2013 Thomas H.P. Andersen
systemd is free software; you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version.
systemd 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with systemd; If not, see <http://www.gnu.org/licenses/>.
***/
#include <string.h>
#include "util.h"
#include "specifier.h"
#include "strv.h"
static void test_specifier_printf(void) {
char *w;
const Specifier table[] = {
{ 'a', specifier_string, (char*) "AAAA" },
{ 'b', specifier_string, (char*) "BBBB" },
{ 0, NULL, NULL }
};
w = specifier_printf("xxx a=%a b=%b yyy", table, NULL);
printf("<%s>\n", w);
free(w);
}
static void test_strv_find(void) {
const char * const input_table[] = {
"one",
"two",
"three",
NULL
};
assert_se(strv_find((char **)input_table, "three"));
assert_se(!strv_find((char **)input_table, "four"));
}
static void test_strv_find_prefix(void) {
const char * const input_table[] = {
"one",
"two",
"three",
NULL
};
assert_se(strv_find_prefix((char **)input_table, "o"));
assert_se(strv_find_prefix((char **)input_table, "one"));
assert_se(strv_find_prefix((char **)input_table, ""));
assert_se(!strv_find_prefix((char **)input_table, "xxx"));
assert_se(!strv_find_prefix((char **)input_table, "onee"));
}
static void test_strv_join(void) {
_cleanup_free_ char *p = NULL, *q = NULL, *r = NULL, *s = NULL, *t = NULL;
const char * const input_table_multiple[] = {
"one",
"two",
"three",
NULL
};
const char * const input_table_one[] = {
"one",
NULL
};
const char * const input_table_none[] = {
NULL
};
p = strv_join((char **)input_table_multiple, ", ");
assert_se(streq(p, "one, two, three"));
q = strv_join((char **)input_table_multiple, ";");
assert_se(streq(q, "one;two;three"));
r = strv_join((char **)input_table_multiple, NULL);
assert_se(streq(r, "one two three"));
s = strv_join((char **)input_table_one, ", ");
assert_se(streq(s, "one"));
t = strv_join((char **)input_table_none, ", ");
assert_se(streq(t, ""));
}
static void test_strv_split_nulstr(void) {
_cleanup_strv_free_ char **l = NULL;
const char nulstr[] = "str0\0str1\0str2\0str3\0";
l = strv_split_nulstr (nulstr);
assert_se(streq(l[0], "str0"));
assert_se(streq(l[1], "str1"));
assert_se(streq(l[2], "str2"));
assert_se(streq(l[3], "str3"));
}
static void test_strv_parse_nulstr(void) {
_cleanup_strv_free_ char **l = NULL;
const char nulstr[] = "fuck\0fuck2\0fuck3\0\0fuck5\0\0xxx";
l = strv_parse_nulstr(nulstr, sizeof(nulstr)-1);
puts("Parse nulstr:");
strv_print(l);
assert_se(streq(l[0], "fuck"));
assert_se(streq(l[1], "fuck2"));
assert_se(streq(l[2], "fuck3"));
assert_se(streq(l[3], ""));
assert_se(streq(l[4], "fuck5"));
assert_se(streq(l[5], ""));
assert_se(streq(l[6], "xxx"));
}
static void test_strv_overlap(void) {
const char * const input_table[] = {
"one",
"two",
"three",
NULL
};
const char * const input_table_overlap[] = {
"two",
NULL
};
const char * const input_table_unique[] = {
"four",
"five",
"six",
NULL
};
assert_se(strv_overlap((char **)input_table, (char**)input_table_overlap));
assert_se(!strv_overlap((char **)input_table, (char**)input_table_unique));
}
static void test_strv_sort(void) {
const char * const input_table[] = {
"durian",
"apple",
"citrus",
"CAPITAL LETTERS FIRST",
"banana",
NULL
};
strv_sort((char **)input_table);
assert_se(streq(input_table[0], "CAPITAL LETTERS FIRST"));
assert_se(streq(input_table[1], "apple"));
assert_se(streq(input_table[2], "banana"));
assert_se(streq(input_table[3], "citrus"));
assert_se(streq(input_table[4], "durian"));
}
static void test_strv_merge_concat(void) {
_cleanup_strv_free_ char **a = NULL, **b = NULL, **c = NULL;
a = strv_new("without", "suffix", NULL);
b = strv_new("with", "suffix", NULL);
c = strv_merge_concat(a, b, "_suffix");
assert_se(streq(c[0], "without"));
assert_se(streq(c[1], "suffix"));
assert_se(streq(c[2], "with_suffix"));
assert_se(streq(c[3], "suffix_suffix"));
}
static void test_strv_merge(void) {
_cleanup_strv_free_ char **a = NULL, **b = NULL, **c = NULL;
a = strv_new("abc", "def", "ghi", NULL);
b = strv_new("jkl", "mno", "pqr", NULL);
c = strv_merge(a, b);
assert_se(streq(c[0], "abc"));
assert_se(streq(c[1], "def"));
assert_se(streq(c[2], "ghi"));
assert_se(streq(c[3], "jkl"));
assert_se(streq(c[4], "mno"));
assert_se(streq(c[5], "pqr"));
assert_se(strv_length(c) == 6);
}
static void test_strv_append(void) {
_cleanup_strv_free_ char **a = NULL, **b = NULL, **c = NULL;
a = strv_new("test", "test1", NULL);
b = strv_append(a, "test2");
c = strv_append(NULL, "test3");
assert_se(streq(b[0], "test"));
assert_se(streq(b[1], "test1"));
assert_se(streq(b[2], "test2"));
assert_se(streq(c[0], "test3"));
}
int main(int argc, char *argv[]) {
test_specifier_printf();
test_strv_find();
test_strv_find_prefix();
test_strv_join();
test_strv_split_nulstr();
test_strv_parse_nulstr();
test_strv_overlap();
test_strv_sort();
test_strv_merge();
test_strv_merge_concat();
test_strv_append();
return 0;
}
|
