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
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
|
/*
SSSD
util-tests.c
Authors:
Stephen Gallagher <sgallagh@redhat.com>
Copyright (C) 2010 Red Hat
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <popt.h>
#include <talloc.h>
#include <check.h>
#include "util/util.h"
#include "tests/common.h"
START_TEST(test_parse_args)
{
struct pa_testcase {
const char *argstr;
const char **parsed;
};
TALLOC_CTX *test_ctx;
int i, ii;
int ret;
char **parsed;
char **only_ret;
char **only_exp;
char **both;
test_ctx = talloc_new(NULL);
/* Positive tests */
const char *parsed1[] = { "foo", NULL };
const char *parsed2[] = { "foo", "a", NULL };
const char *parsed3[] = { "foo", "b", NULL };
const char *parsed4[] = { "foo", "a c", NULL };
const char *parsed5[] = { "foo", "a", "d", NULL };
const char *parsed6[] = { "foo", "a", "e", NULL };
const char *parsed7[] = { "foo", "a", "f", NULL };
const char *parsed8[] = { "foo", "a\tg", NULL };
struct pa_testcase tc[] = {
{ "foo", parsed1 },
{ "foo a", parsed2 },
{ "foo b", parsed3 },
{ "foo a\\ c", parsed4 },
{ "foo a d ", parsed5 },
{ "foo a e ", parsed6 },
{ "foo a f ", parsed7 },
{ "foo a\\\tg", parsed8 },
{ NULL, NULL }
};
for (i=0; tc[i].argstr != NULL; i++) {
parsed = parse_args(tc[i].argstr);
fail_if(parsed == NULL && tc[i].parsed != NULL,
"Could not parse correct argument string '%s'\n");
ret = diff_string_lists(test_ctx, parsed, discard_const(tc[i].parsed),
&only_ret, &only_exp, &both);
fail_unless(ret == EOK, "diff_string_lists returned error [%d]", ret);
fail_unless(only_ret[0] == NULL, "The parser returned more data than expected\n");
fail_unless(only_exp[0] == NULL, "The parser returned less data than expected\n");
for (ii = 0; parsed[ii]; ii++) free(parsed[ii]);
free(parsed);
}
talloc_free(test_ctx);
}
END_TEST
START_TEST(test_diff_string_lists)
{
TALLOC_CTX *test_ctx;
char **l1;
char **l2;
char **l3;
char **only_l1;
char **only_l2;
char **both;
int ret;
test_ctx = talloc_new(NULL);
/* Test with all values returned */
l1 = talloc_array(test_ctx, char *, 4);
l1[0] = talloc_strdup(l1, "a");
l1[1] = talloc_strdup(l1, "b");
l1[2] = talloc_strdup(l1, "c");
l1[3] = NULL;
l2 = talloc_array(test_ctx, char *, 4);
l2[0] = talloc_strdup(l1, "d");
l2[1] = talloc_strdup(l1, "c");
l2[2] = talloc_strdup(l1, "b");
l2[3] = NULL;
ret = diff_string_lists(test_ctx,
l1, l2,
&only_l1, &only_l2, &both);
fail_unless(ret == EOK, "diff_string_lists returned error [%d]", ret);
fail_unless(strcmp(only_l1[0], "a") == 0, "Missing \"a\" from only_l1");
fail_unless(only_l1[1] == NULL, "only_l1 not NULL-terminated");
fail_unless(strcmp(only_l2[0], "d") == 0, "Missing \"d\" from only_l2");
fail_unless(only_l2[1] == NULL, "only_l2 not NULL-terminated");
fail_unless(strcmp(both[0], "c") == 0, "Missing \"c\" from both");
fail_unless(strcmp(both[1], "b") == 0, "Missing \"b\" from both");
fail_unless(both[2] == NULL, "both not NULL-terminated");
talloc_zfree(only_l1);
talloc_zfree(only_l2);
talloc_zfree(both);
/* Test with restricted return values */
ret = diff_string_lists(test_ctx,
l1, l2,
&only_l1, &only_l2, NULL);
fail_unless(ret == EOK, "diff_string_lists returned error [%d]", ret);
fail_unless(strcmp(only_l1[0], "a") == 0, "Missing \"a\" from only_l1");
fail_unless(only_l1[1] == NULL, "only_l1 not NULL-terminated");
fail_unless(strcmp(only_l2[0], "d") == 0, "Missing \"d\" from only_l2");
fail_unless(only_l2[1] == NULL, "only_l2 not NULL-terminated");
fail_unless(both == NULL, "Nothing returned to both");
talloc_zfree(only_l1);
talloc_zfree(only_l2);
talloc_zfree(both);
ret = diff_string_lists(test_ctx,
l1, l2,
&only_l1, NULL, NULL);
fail_unless(ret == EOK, "diff_string_lists returned error [%d]", ret);
fail_unless(strcmp(only_l1[0], "a") == 0, "Missing \"a\" from only_l1");
fail_unless(only_l1[1] == NULL, "only_l1 not NULL-terminated");
fail_unless(only_l2 == NULL, "Nothing returned to only_l2");
fail_unless(both == NULL, "Nothing returned to both");
talloc_zfree(only_l1);
talloc_zfree(only_l2);
talloc_zfree(both);
ret = diff_string_lists(test_ctx,
l1, l2,
NULL, &only_l2, NULL);
fail_unless(ret == EOK, "diff_string_lists returned error [%d]", ret);
fail_unless(strcmp(only_l2[0], "d") == 0, "Missing \"d\" from only_l2");
fail_unless(only_l2[1] == NULL, "only_l2 not NULL-terminated");
fail_unless(only_l1 == NULL, "Nothing returned to only_l1");
fail_unless(both == NULL, "Nothing returned to both");
talloc_zfree(only_l1);
talloc_zfree(only_l2);
talloc_zfree(both);
/* Test with no overlap */
l3 = talloc_array(test_ctx, char *, 4);
l3[0] = talloc_strdup(l1, "d");
l3[1] = talloc_strdup(l1, "e");
l3[2] = talloc_strdup(l1, "f");
l3[3] = NULL;
ret = diff_string_lists(test_ctx,
l1, l3,
&only_l1, &only_l2, &both);
fail_unless(ret == EOK, "diff_string_lists returned error [%d]", ret);
fail_unless(strcmp(only_l1[0], "a") == 0, "Missing \"a\" from only_l1");
fail_unless(strcmp(only_l1[1], "b") == 0, "Missing \"b\" from only_l1");
fail_unless(strcmp(only_l1[2], "c") == 0, "Missing \"c\" from only_l1");
fail_unless(only_l1[3] == NULL, "only_l1 not NULL-terminated");
fail_unless(strcmp(only_l2[0], "d") == 0, "Missing \"f\" from only_l2");
fail_unless(strcmp(only_l2[1], "e") == 0, "Missing \"e\" from only_l2");
fail_unless(strcmp(only_l2[2], "f") == 0, "Missing \"d\" from only_l2");
fail_unless(only_l2[3] == NULL, "only_l2 not NULL-terminated");
fail_unless(both[0] == NULL, "both should have zero entries");
talloc_zfree(only_l1);
talloc_zfree(only_l2);
talloc_zfree(both);
/* Test with 100% overlap */
ret = diff_string_lists(test_ctx,
l1, l1,
&only_l1, &only_l2, &both);
fail_unless(ret == EOK, "diff_string_lists returned error [%d]", ret);
fail_unless(only_l1[0] == NULL, "only_l1 should have zero entries");
fail_unless(only_l2[0] == NULL, "only_l2 should have zero entries");
fail_unless(strcmp(both[0], "a") == 0, "Missing \"a\" from both");
fail_unless(strcmp(both[1], "b") == 0, "Missing \"b\" from both");
fail_unless(strcmp(both[2], "c") == 0, "Missing \"c\" from both");
fail_unless(both[3] == NULL, "both is not NULL-terminated");
talloc_zfree(only_l1);
talloc_zfree(only_l2);
talloc_zfree(both);
/* Test with no second list */
ret = diff_string_lists(test_ctx,
l1, NULL,
&only_l1, &only_l2, &both);
fail_unless(ret == EOK, "diff_string_lists returned error [%d]", ret);
fail_unless(strcmp(only_l1[0], "a") == 0, "Missing \"a\" from only_l1");
fail_unless(strcmp(only_l1[1], "b") == 0, "Missing \"b\" from only_l1");
fail_unless(strcmp(only_l1[2], "c") == 0, "Missing \"c\" from only_l1");
fail_unless(only_l1[3] == NULL, "only_l1 not NULL-terminated");
fail_unless(only_l2[0] == NULL, "only_l2 should have zero entries");
fail_unless(both[0] == NULL, "both should have zero entries");
talloc_free(test_ctx);
}
END_TEST
START_TEST(test_sss_filter_sanitize)
{
errno_t ret;
char *sanitized = NULL;
TALLOC_CTX *test_ctx = talloc_new(NULL);
fail_if (test_ctx == NULL, "Out of memory");
const char no_specials[] = "username";
ret = sss_filter_sanitize(test_ctx, no_specials, &sanitized);
fail_unless(ret == EOK, "no_specials error [%d][%s]",
ret, strerror(ret));
fail_unless(strcmp(no_specials, sanitized)==0,
"Expected [%s], got [%s]",
no_specials, sanitized);
const char has_asterisk[] = "*username";
const char has_asterisk_expected[] = "\\2ausername";
ret = sss_filter_sanitize(test_ctx, has_asterisk, &sanitized);
fail_unless(ret == EOK, "has_asterisk error [%d][%s]",
ret, strerror(ret));
fail_unless(strcmp(has_asterisk_expected, sanitized)==0,
"Expected [%s], got [%s]",
has_asterisk_expected, sanitized);
const char has_lparen[] = "user(name";
const char has_lparen_expected[] = "user\\28name";
ret = sss_filter_sanitize(test_ctx, has_lparen, &sanitized);
fail_unless(ret == EOK, "has_lparen error [%d][%s]",
ret, strerror(ret));
fail_unless(strcmp(has_lparen_expected, sanitized)==0,
"Expected [%s], got [%s]",
has_lparen_expected, sanitized);
const char has_rparen[] = "user)name";
const char has_rparen_expected[] = "user\\29name";
ret = sss_filter_sanitize(test_ctx, has_rparen, &sanitized);
fail_unless(ret == EOK, "has_rparen error [%d][%s]",
ret, strerror(ret));
fail_unless(strcmp(has_rparen_expected, sanitized)==0,
"Expected [%s], got [%s]",
has_rparen_expected, sanitized);
const char has_backslash[] = "username\\";
const char has_backslash_expected[] = "username\\5c";
ret = sss_filter_sanitize(test_ctx, has_backslash, &sanitized);
fail_unless(ret == EOK, "has_backslash error [%d][%s]",
ret, strerror(ret));
fail_unless(strcmp(has_backslash_expected, sanitized)==0,
"Expected [%s], got [%s]",
has_backslash_expected, sanitized);
const char has_all[] = "\\(user)*name";
const char has_all_expected[] = "\\5c\\28user\\29\\2aname";
ret = sss_filter_sanitize(test_ctx, has_all, &sanitized);
fail_unless(ret == EOK, "has_all error [%d][%s]",
ret, strerror(ret));
fail_unless(strcmp(has_all_expected, sanitized)==0,
"Expected [%s], got [%s]",
has_all_expected, sanitized);
talloc_free(test_ctx);
}
END_TEST
START_TEST(test_size_t_overflow)
{
fail_unless(!SIZE_T_OVERFLOW(1, 1), "unexpected overflow");
fail_unless(!SIZE_T_OVERFLOW(SIZE_T_MAX, 0), "unexpected overflow");
fail_unless(!SIZE_T_OVERFLOW(SIZE_T_MAX-10, 10), "unexpected overflow");
fail_unless(SIZE_T_OVERFLOW(SIZE_T_MAX, 1), "overflow not detected");
fail_unless(SIZE_T_OVERFLOW(SIZE_T_MAX, SIZE_T_MAX),
"overflow not detected");
fail_unless(SIZE_T_OVERFLOW(SIZE_T_MAX, ULLONG_MAX),
"overflow not detected");
fail_unless(SIZE_T_OVERFLOW(SIZE_T_MAX, -10), "overflow not detected");
}
END_TEST
Suite *util_suite(void)
{
Suite *s = suite_create("util");
TCase *tc_util = tcase_create("util");
tcase_add_test (tc_util, test_diff_string_lists);
tcase_add_test (tc_util, test_sss_filter_sanitize);
tcase_add_test (tc_util, test_size_t_overflow);
tcase_add_test (tc_util, test_parse_args);
tcase_set_timeout(tc_util, 60);
suite_add_tcase (s, tc_util);
return s;
}
int main(int argc, const char *argv[])
{
int opt;
int failure_count;
poptContext pc;
Suite *s = util_suite();
SRunner *sr = srunner_create (s);
struct poptOption long_options[] = {
POPT_AUTOHELP
SSSD_MAIN_OPTS
POPT_TABLEEND
};
pc = poptGetContext(argv[0], argc, argv, long_options, 0);
while((opt = poptGetNextOpt(pc)) != -1) {
switch(opt) {
default:
fprintf(stderr, "\nInvalid option %s: %s\n\n",
poptBadOption(pc, 0), poptStrerror(opt));
poptPrintUsage(pc, stderr, 0);
return 1;
}
}
poptFreeContext(pc);
debug_level = debug_convert_old_level(debug_level);
tests_set_cwd();
srunner_run_all(sr, CK_ENV);
failure_count = srunner_ntests_failed (sr);
srunner_free (sr);
if (failure_count == 0) {
return EXIT_SUCCESS;
}
return EXIT_FAILURE;
}
|