-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathline_tokens_match_test.c
76 lines (72 loc) · 2.06 KB
/
line_tokens_match_test.c
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
/*
* Copyright © 2021 - 2023 Eero Häkkinen <Eero+pam-ssh-auth-info@Häkkinen.fi>
*
* 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/>.
*/
#undef NDEBUG
#include <assert.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include "line_tokens_match.h"
#include "line_tokens_match_test.h"
int
main() {
unsigned const recursion_limit = 6u;
for (int i = 0; test_data[i].lines; ++i) {
char const *const lines = test_data[i].lines;
size_t const m = strcspn(lines, "\n");
size_t const n = strspn(lines + m, "\n");
assert(n <= 1u);
assert(!lines[m+n]);
for (int j = 0; test_data[i].pattern_data[j].pattern; ++j) {
char const *const pattern =
test_data[i].pattern_data[j].pattern;
for (int k = 0; k < 2; ++k) {
bool const allow_prefix_match = (bool)k;
bool const expected =
(
allow_prefix_match ||
!test_data[i].pattern_data[j].allow_prefix_match
) &&
test_data[i].pattern_data[j].expected;
bool const actual = first_line_tokens_match(
lines,
pattern,
allow_prefix_match,
recursion_limit
);
fprintf(
stderr,
"first_line_tokens_match"
"(\"%.*s%.*s\", \"%s\", %s, %u)"
" %s %s\n",
(int)m,
lines,
2 * (int)n,
"\\n",
pattern,
allow_prefix_match ? "true" : "false",
recursion_limit,
actual == expected ? "==" : "!=",
expected ? "true" : "false"
);
if (actual != expected)
return 1;
}
}
}
fprintf(stderr, "OK\n");
return 0;
}