diff options
Diffstat (limited to 'src/regex/test_regex_iterate_api.c')
-rw-r--r-- | src/regex/test_regex_iterate_api.c | 262 |
1 files changed, 0 insertions, 262 deletions
diff --git a/src/regex/test_regex_iterate_api.c b/src/regex/test_regex_iterate_api.c deleted file mode 100644 index e7ef72b58..000000000 --- a/src/regex/test_regex_iterate_api.c +++ /dev/null | |||
@@ -1,262 +0,0 @@ | |||
1 | /* | ||
2 | This file is part of GNUnet | ||
3 | Copyright (C) 2012 GNUnet e.V. | ||
4 | |||
5 | GNUnet is free software: you can redistribute it and/or modify it | ||
6 | under the terms of the GNU Affero General Public License as published | ||
7 | by the Free Software Foundation, either version 3 of the License, | ||
8 | or (at your option) any later version. | ||
9 | |||
10 | GNUnet is distributed in the hope that it will be useful, but | ||
11 | WITHOUT ANY WARRANTY; without even the implied warranty of | ||
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | ||
13 | Affero General Public License for more details. | ||
14 | |||
15 | You should have received a copy of the GNU Affero General Public License | ||
16 | along with this program. If not, see <http://www.gnu.org/licenses/>. | ||
17 | |||
18 | SPDX-License-Identifier: AGPL3.0-or-later | ||
19 | */ | ||
20 | /** | ||
21 | * @file regex/test_regex_iterate_api.c | ||
22 | * @brief test for regex.c | ||
23 | * @author Maximilian Szengel | ||
24 | */ | ||
25 | #include <regex.h> | ||
26 | #include <time.h> | ||
27 | #include "platform.h" | ||
28 | #include "regex_internal_lib.h" | ||
29 | #include "regex_block_lib.h" | ||
30 | #include "regex_internal.h" | ||
31 | |||
32 | /** | ||
33 | * Regex initial padding. | ||
34 | */ | ||
35 | #define INITIAL_PADDING "PADPADPADPADPADP" | ||
36 | |||
37 | /** | ||
38 | * Set to GNUNET_YES to save a debug graph. | ||
39 | */ | ||
40 | #define REGEX_INTERNAL_ITERATE_SAVE_DEBUG_GRAPH GNUNET_NO | ||
41 | |||
42 | static unsigned int transition_counter; | ||
43 | |||
44 | struct IteratorContext | ||
45 | { | ||
46 | int error; | ||
47 | int should_save_graph; | ||
48 | FILE *graph_filep; | ||
49 | unsigned int string_count; | ||
50 | char *const *strings; | ||
51 | unsigned int match_count; | ||
52 | }; | ||
53 | |||
54 | struct RegexStringPair | ||
55 | { | ||
56 | char *regex; | ||
57 | unsigned int string_count; | ||
58 | char *strings[20]; | ||
59 | }; | ||
60 | |||
61 | |||
62 | static void | ||
63 | key_iterator (void *cls, const struct GNUNET_HashCode *key, | ||
64 | const char *proof, | ||
65 | int accepting, unsigned int num_edges, | ||
66 | const struct REGEX_BLOCK_Edge *edges) | ||
67 | { | ||
68 | unsigned int i; | ||
69 | struct IteratorContext *ctx = cls; | ||
70 | char *out_str; | ||
71 | char *state_id = GNUNET_strdup (GNUNET_h2s (key)); | ||
72 | |||
73 | GNUNET_assert (NULL != proof); | ||
74 | if (GNUNET_YES == ctx->should_save_graph) | ||
75 | { | ||
76 | if (GNUNET_YES == accepting) | ||
77 | GNUNET_asprintf (&out_str, "\"%s\" [shape=doublecircle]\n", state_id); | ||
78 | else | ||
79 | GNUNET_asprintf (&out_str, "\"%s\" [shape=circle]\n", state_id); | ||
80 | fwrite (out_str, strlen (out_str), 1, ctx->graph_filep); | ||
81 | GNUNET_free (out_str); | ||
82 | |||
83 | for (i = 0; i < num_edges; i++) | ||
84 | { | ||
85 | transition_counter++; | ||
86 | GNUNET_asprintf (&out_str, "\"%s\" -> \"%s\" [label = \"%s (%s)\"]\n", | ||
87 | state_id, GNUNET_h2s (&edges[i].destination), | ||
88 | edges[i].label, proof); | ||
89 | fwrite (out_str, strlen (out_str), 1, ctx->graph_filep); | ||
90 | |||
91 | GNUNET_free (out_str); | ||
92 | } | ||
93 | } | ||
94 | else | ||
95 | { | ||
96 | for (i = 0; i < num_edges; i++) | ||
97 | transition_counter++; | ||
98 | } | ||
99 | |||
100 | for (i = 0; i < ctx->string_count; i++) | ||
101 | { | ||
102 | if (0 == strcmp (proof, ctx->strings[i])) | ||
103 | ctx->match_count++; | ||
104 | } | ||
105 | |||
106 | if (GNUNET_OK != REGEX_BLOCK_check_proof (proof, strlen (proof), key)) | ||
107 | { | ||
108 | ctx->error++; | ||
109 | GNUNET_log (GNUNET_ERROR_TYPE_ERROR, | ||
110 | "Proof check failed: proof: %s key: %s\n", proof, state_id); | ||
111 | } | ||
112 | GNUNET_free (state_id); | ||
113 | } | ||
114 | |||
115 | |||
116 | int | ||
117 | main (int argc, char *argv[]) | ||
118 | { | ||
119 | GNUNET_log_setup ("test-regex", "WARNING", NULL); | ||
120 | |||
121 | int error; | ||
122 | struct REGEX_INTERNAL_Automaton *dfa; | ||
123 | unsigned int i; | ||
124 | unsigned int num_transitions; | ||
125 | char *filename = NULL; | ||
126 | struct IteratorContext ctx = { 0, 0, NULL, 0, NULL, 0 }; | ||
127 | |||
128 | error = 0; | ||
129 | |||
130 | const struct RegexStringPair rxstr[13] = { | ||
131 | { INITIAL_PADDING "ab(c|d)+c*(a(b|c)+d)+(bla)+", 2, | ||
132 | { INITIAL_PADDING "abcdcdca", INITIAL_PADDING "abcabdbl" } }, | ||
133 | { INITIAL_PADDING | ||
134 | "abcdefghixxxxxxxxxxxxxjklmnop*qstoisdjfguisdfguihsdfgbdsuivggsd", 1, | ||
135 | { INITIAL_PADDING "abcdefgh" } }, | ||
136 | { INITIAL_PADDING "VPN-4-1(0|1)*", 2, | ||
137 | { INITIAL_PADDING "VPN-4-10", INITIAL_PADDING "VPN-4-11" } }, | ||
138 | { INITIAL_PADDING "(a+X*y+c|p|R|Z*K*y*R+w|Y*6+n+h*k*w+V*F|W*B*e*)", 2, | ||
139 | { INITIAL_PADDING "aaaaaaaa", INITIAL_PADDING "aaXXyyyc" } }, | ||
140 | { INITIAL_PADDING "a*", 1, { INITIAL_PADDING "aaaaaaaa" } }, | ||
141 | { INITIAL_PADDING "xzxzxzxzxz", 1, { INITIAL_PADDING "xzxzxzxz" } }, | ||
142 | { INITIAL_PADDING "xyz*", 1, { INITIAL_PADDING "xyzzzzzz" } }, | ||
143 | { INITIAL_PADDING | ||
144 | "abcd:(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1):(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)", | ||
145 | 2, { INITIAL_PADDING "abcd:000", INITIAL_PADDING "abcd:101" } }, | ||
146 | { INITIAL_PADDING "(x*|(0|1|2)(a|b|c|d)+)", 2, | ||
147 | { INITIAL_PADDING "xxxxxxxx", INITIAL_PADDING "0abcdbad" } }, | ||
148 | { INITIAL_PADDING "(0|1)(0|1)23456789ABC", 1, | ||
149 | { INITIAL_PADDING "11234567" } }, | ||
150 | { INITIAL_PADDING "0*123456789ABC*", 3, | ||
151 | { INITIAL_PADDING "00123456", INITIAL_PADDING "00000000", | ||
152 | INITIAL_PADDING "12345678" } }, | ||
153 | { INITIAL_PADDING "0123456789A*BC", 1, { INITIAL_PADDING "01234567" } }, | ||
154 | { "GNUNETVPN000100000IPEX6-fc5a:4e1:c2ba::1", 1, | ||
155 | { "GNUNETVPN000100000IPEX6-" } } | ||
156 | }; | ||
157 | |||
158 | const char *graph_start_str = "digraph G {\nrankdir=LR\n"; | ||
159 | const char *graph_end_str = "\n}\n"; | ||
160 | |||
161 | for (i = 0; i < 13; i++) | ||
162 | { | ||
163 | GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "Iterating DFA for regex %s\n", | ||
164 | rxstr[i].regex); | ||
165 | |||
166 | |||
167 | /* Create graph */ | ||
168 | if (GNUNET_YES == REGEX_INTERNAL_ITERATE_SAVE_DEBUG_GRAPH) | ||
169 | { | ||
170 | GNUNET_asprintf (&filename, "iteration_graph_%u.dot", i); | ||
171 | ctx.graph_filep = fopen (filename, "w"); | ||
172 | if (NULL == ctx.graph_filep) | ||
173 | { | ||
174 | GNUNET_log (GNUNET_ERROR_TYPE_WARNING, | ||
175 | "Could not open file %s for saving iteration graph.\n", | ||
176 | filename); | ||
177 | ctx.should_save_graph = GNUNET_NO; | ||
178 | } | ||
179 | else | ||
180 | { | ||
181 | ctx.should_save_graph = GNUNET_YES; | ||
182 | fwrite (graph_start_str, strlen (graph_start_str), 1, ctx.graph_filep); | ||
183 | } | ||
184 | GNUNET_free (filename); | ||
185 | } | ||
186 | else | ||
187 | { | ||
188 | ctx.should_save_graph = GNUNET_NO; | ||
189 | ctx.graph_filep = NULL; | ||
190 | } | ||
191 | |||
192 | /* Iterate over DFA edges */ | ||
193 | transition_counter = 0; | ||
194 | ctx.string_count = rxstr[i].string_count; | ||
195 | ctx.strings = rxstr[i].strings; | ||
196 | ctx.match_count = 0; | ||
197 | dfa = | ||
198 | REGEX_INTERNAL_construct_dfa (rxstr[i].regex, strlen (rxstr[i].regex), 0); | ||
199 | REGEX_INTERNAL_iterate_all_edges (dfa, key_iterator, &ctx); | ||
200 | num_transitions = | ||
201 | REGEX_INTERNAL_get_transition_count (dfa) - dfa->start->transition_count; | ||
202 | |||
203 | if (transition_counter < num_transitions) | ||
204 | { | ||
205 | GNUNET_log (GNUNET_ERROR_TYPE_ERROR, | ||
206 | "Automaton has %d transitions, iterated over %d transitions\n", | ||
207 | num_transitions, transition_counter); | ||
208 | error += 1; | ||
209 | } | ||
210 | |||
211 | if (ctx.match_count < ctx.string_count) | ||
212 | { | ||
213 | GNUNET_log (GNUNET_ERROR_TYPE_ERROR, | ||
214 | "Missing initial states for regex %s\n", rxstr[i].regex); | ||
215 | error += (ctx.string_count - ctx.match_count); | ||
216 | } | ||
217 | else if (ctx.match_count > ctx.string_count) | ||
218 | { | ||
219 | GNUNET_log (GNUNET_ERROR_TYPE_ERROR, | ||
220 | "Duplicate initial transitions for regex %s\n", | ||
221 | rxstr[i].regex); | ||
222 | error += (ctx.string_count - ctx.match_count); | ||
223 | } | ||
224 | |||
225 | REGEX_INTERNAL_automaton_destroy (dfa); | ||
226 | |||
227 | /* Finish graph */ | ||
228 | if (GNUNET_YES == ctx.should_save_graph) | ||
229 | { | ||
230 | fwrite (graph_end_str, strlen (graph_end_str), 1, ctx.graph_filep); | ||
231 | fclose (ctx.graph_filep); | ||
232 | ctx.graph_filep = NULL; | ||
233 | ctx.should_save_graph = GNUNET_NO; | ||
234 | } | ||
235 | } | ||
236 | |||
237 | |||
238 | for (i = 0; i < 13; i++) | ||
239 | { | ||
240 | ctx.string_count = rxstr[i].string_count; | ||
241 | ctx.strings = rxstr[i].strings; | ||
242 | ctx.match_count = 0; | ||
243 | |||
244 | dfa = | ||
245 | REGEX_INTERNAL_construct_dfa (rxstr[i].regex, strlen (rxstr[i].regex), 0); | ||
246 | REGEX_INTERNAL_dfa_add_multi_strides (NULL, dfa, 2); | ||
247 | REGEX_INTERNAL_iterate_all_edges (dfa, key_iterator, &ctx); | ||
248 | |||
249 | if (ctx.match_count < ctx.string_count) | ||
250 | { | ||
251 | GNUNET_log (GNUNET_ERROR_TYPE_ERROR, | ||
252 | "Missing initial states for regex %s\n", rxstr[i].regex); | ||
253 | error += (ctx.string_count - ctx.match_count); | ||
254 | } | ||
255 | |||
256 | REGEX_INTERNAL_automaton_destroy (dfa); | ||
257 | } | ||
258 | |||
259 | error += ctx.error; | ||
260 | |||
261 | return error; | ||
262 | } | ||