-
Notifications
You must be signed in to change notification settings - Fork 61
/
eudoxus_subengine.c
602 lines (533 loc) · 16.7 KB
/
eudoxus_subengine.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
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
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
/*****************************************************************************
* Licensed to Qualys, Inc. (QUALYS) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* QUALYS licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
****************************************************************************/
/**
* @file
* @brief IronAutomata — Eudoxus DFA Engine Preprocessor Metacode
*
* @warning This code is preprocessor metaprogramming code that is effectively
* templated on IA_EUDOXUS_ID_T which defines a suitable numeric
* type for identifiers and IA_EUDOXUS_PREFIX which defines a
* prefix for all types and functions. This file can not be
* directly compiled. Compile eudoxus.c instead.
*
* The IA_EUDOXUS(x) macro prefixes IA_EUDOXUS_PREFIX and an underscore to
* @c x.
*
* @author Christopher Alfeld <calfeld@qualys.com>
*/
#ifndef IA_EUDOXUS
#error "IA_EUDOXUS not defined. Do not compile this file directly."
#endif
#ifndef IA_EUDOXUS_ID_T
#error "IA_EUDOXUS_ID_T not defined. Do not compile this file directly."
#endif
/**
* @addtogroup IronAutomataEudoxusAutomata
*
* @{
*/
/* Node Specific Implementation */
/* Low degree nodes. */
/**
* Next function for low degree nodes.
*
* @sa IA_EUDOXUS(next) for details.
*/
static
ia_eudoxus_result_t IA_EUDOXUS(next_low)(
ia_eudoxus_state_t *state
)
{
if (state == NULL) {
return IA_EUDOXUS_EINSANE;
}
assert(state->eudoxus != NULL);
assert(state->callback != NULL);
assert(state->node != NULL);
assert(state->input_location != NULL);
const uint8_t c = *(state->input_location);
bool has_output = IA_EUDOXUS_FLAG(state->node->header, 0);
bool has_nonadvancing = IA_EUDOXUS_FLAG(state->node->header, 1);
bool has_default = IA_EUDOXUS_FLAG(state->node->header, 2);
bool advance_on_default = IA_EUDOXUS_FLAG(state->node->header, 3);
bool has_edges = IA_EUDOXUS_FLAG(state->node->header, 4);
const IA_EUDOXUS(low_node_t) *node
= (const IA_EUDOXUS(low_node_t) *)(state->node);
if (has_nonadvancing & ! has_edges) {
return IA_EUDOXUS_EINVAL;
}
ia_vls_state_t vls;
IA_VLS_INIT(vls, node);
// Advance past first_output.
IA_VLS_ADVANCE_IF(vls, IA_EUDOXUS_ID_T, has_output);
uint8_t out_degree = IA_VLS_IF(vls, uint8_t, 0, has_edges);
IA_EUDOXUS_ID_T default_node = IA_VLS_IF(
vls,
IA_EUDOXUS_ID_T,
0,
has_default
);
const uint8_t *advance = IA_VLS_VARRAY_IF(
vls,
const uint8_t,
out_degree / 8,
has_nonadvancing & has_edges
);
const IA_EUDOXUS(low_edge_t) *edges = IA_VLS_FINAL(
vls,
const IA_EUDOXUS(low_edge_t)
);
IA_EUDOXUS_ID_T next_node = 0;
bool advance_on_next_node = true;
if (has_edges) {
int i = 0;
while (i < out_degree && edges[i].c != c) {
++i;
}
if (i != out_degree) {
next_node = edges[i].next_node;
if (has_nonadvancing) {
advance_on_next_node = ia_bitv(advance, i);
}
}
}
if (next_node == 0) {
if (has_default) {
next_node = default_node;
advance_on_next_node = advance_on_default;
}
else {
return IA_EUDOXUS_END;
}
}
if (advance_on_next_node) {
state->input_location += 1;
state->remaining_bytes -= 1;
}
state->node = (const ia_eudoxus_node_t *)(
(const char *)(state->eudoxus->automata) + next_node
);
state->byte_index = 0;
return IA_EUDOXUS_OK;
}
/* High Degree Node */
/**
* Next function for high degree nodes.
*
* @sa IA_EUDOXUS(next) for details.
*/
static
ia_eudoxus_result_t IA_EUDOXUS(next_high)(
ia_eudoxus_state_t *state
)
{
if (state == NULL) {
return IA_EUDOXUS_EINSANE;
}
assert(state->eudoxus != NULL);
assert(state->callback != NULL);
assert(state->node != NULL);
assert(state->input_location != NULL);
const uint8_t c = *(state->input_location);
bool has_output = IA_EUDOXUS_FLAG(state->node->header, 0);
bool has_nonadvancing = IA_EUDOXUS_FLAG(state->node->header, 1);
bool has_default = IA_EUDOXUS_FLAG(state->node->header, 2);
bool advance_on_default = IA_EUDOXUS_FLAG(state->node->header, 3);
bool has_target_bm = IA_EUDOXUS_FLAG(state->node->header, 4);
bool has_ali_bm = IA_EUDOXUS_FLAG(state->node->header, 5);
const IA_EUDOXUS(high_node_t) *node
= (const IA_EUDOXUS(high_node_t) *)(state->node);
ia_vls_state_t vls;
IA_VLS_INIT(vls, node);
// Advance past first_output.
IA_VLS_ADVANCE_IF(vls, IA_EUDOXUS_ID_T, has_output);
IA_EUDOXUS_ID_T default_node = IA_VLS_IF(
vls,
IA_EUDOXUS_ID_T,
0,
has_default
);
const ia_bitmap256_t *advance_bm = IA_VLS_IF_PTR(
vls,
ia_bitmap256_t,
has_nonadvancing
);
const ia_bitmap256_t *target_bm = IA_VLS_IF_PTR(
vls,
ia_bitmap256_t,
has_target_bm
);
const ia_bitmap256_t *ali_bm = IA_VLS_IF_PTR(
vls,
ia_bitmap256_t,
has_ali_bm
);
const IA_EUDOXUS_ID_T *targets = IA_VLS_FINAL(vls, const IA_EUDOXUS_ID_T);
bool advance_on_next_node = true;
IA_EUDOXUS_ID_T next_node = 0;
bool has_target = ! has_target_bm || ia_bitv64(target_bm->bits, c);
if (has_target) {
int target_index = -1;
if (has_ali_bm) {
target_index = ia_popcountv64(ali_bm->bits, c);
}
else if (has_target_bm) {
target_index = ia_popcountv64(target_bm->bits, c) - 1;
}
else {
target_index = c;
}
if (target_index < 0 || target_index > 255) {
return IA_EUDOXUS_EINVAL;
}
if (has_nonadvancing) {
advance_on_next_node = ia_bitv64(advance_bm->bits, c);
}
next_node = targets[target_index];
assert(next_node != 0);
}
else {
if (has_default) {
next_node = default_node;
advance_on_next_node = advance_on_default;
}
else {
return IA_EUDOXUS_END;
}
}
if (advance_on_next_node) {
state->input_location += 1;
state->remaining_bytes -= 1;
}
state->node = (const ia_eudoxus_node_t *)(
(const char *)(state->eudoxus->automata) + next_node
);
state->byte_index = 0;
return IA_EUDOXUS_OK;
}
/* Path Compression Node */
/**
* Next function for path compression nodes.
*
* @sa IA_EUDOXUS(next) for details.
*/
static
ia_eudoxus_result_t IA_EUDOXUS(next_pc)(
ia_eudoxus_state_t *state
)
{
if (state == NULL) {
return IA_EUDOXUS_EINSANE;
}
assert(state->eudoxus != NULL);
assert(state->callback != NULL);
assert(state->node != NULL);
assert(state->input_location != NULL);
bool has_output = IA_EUDOXUS_FLAG(state->node->header, 0);
bool has_default = IA_EUDOXUS_FLAG(state->node->header, 1);
bool advance_on_default = IA_EUDOXUS_FLAG(state->node->header, 2);
bool advance_on_final = IA_EUDOXUS_FLAG(state->node->header, 3);
uint8_t length =
2 +
IA_EUDOXUS_FLAG(state->node->header, 4) * 2 +
IA_EUDOXUS_FLAG(state->node->header, 5)
;
const IA_EUDOXUS(pc_node_t) *node
= (const IA_EUDOXUS(pc_node_t) *)(state->node);
ia_vls_state_t vls;
IA_VLS_INIT(vls, node);
// Advance past first_output.
IA_VLS_ADVANCE_IF(vls, IA_EUDOXUS_ID_T, has_output);
IA_EUDOXUS_ID_T default_node = IA_VLS_IF(
vls,
IA_EUDOXUS_ID_T,
0,
has_default
);
length = IA_VLS_IF(
vls,
uint8_t,
length,
length > 4
);
const uint8_t *bytes = IA_VLS_FINAL(vls, const uint8_t);
for (;state->byte_index < length; ++state->byte_index) {
const uint8_t c = *(state->input_location);
if (c == bytes[state->byte_index]) {
if (state->byte_index < length - 1) {
state->input_location += 1;
state->remaining_bytes -= 1;
if (state->remaining_bytes == 0) {
++state->byte_index;
return IA_EUDOXUS_OK;
}
}
}
else {
break;
}
}
IA_EUDOXUS_ID_T next_node = 0;
bool advance_on_next_node = true;
if (state->byte_index == length) {
assert(node->final_target != 0);
next_node = node->final_target;
advance_on_next_node = advance_on_final;
}
else if (has_default) {
next_node = default_node;
advance_on_next_node = advance_on_default;
}
else {
return IA_EUDOXUS_END;
}
if (advance_on_next_node) {
state->input_location += 1;
state->remaining_bytes -= 1;
}
state->node = (const ia_eudoxus_node_t *)(
(const char *)(state->eudoxus->automata) + next_node
);
state->byte_index = 0;
return IA_EUDOXUS_OK;
}
/* Node Generic Code */
/**
* Next function. Advance state by one step.
*
* This function is responsible for advancing the state by one. This is
* accomplished by calling the appropriate node specific next function and
* interpreting interpreting its return code.
*
* @param[in,out] state Current state.
* @return See ia_eudoxus_execute() for return codes meanings.
*/
static
ia_eudoxus_result_t IA_EUDOXUS(next)(
ia_eudoxus_state_t *state
)
{
if (state == NULL) {
return IA_EUDOXUS_EINVAL;
}
assert(state->eudoxus != NULL);
assert(state->node != NULL);
ia_eudoxus_result_t result = IA_EUDOXUS_OK;
switch (IA_EUDOXUS_TYPE(state->node->header)) {
case IA_EUDOXUS_LOW:
result = IA_EUDOXUS(next_low)(state);
break;
case IA_EUDOXUS_HIGH:
result = IA_EUDOXUS(next_high)(state);
break;
case IA_EUDOXUS_PC:
result = IA_EUDOXUS(next_pc)(state);
break;
default:
ia_eudoxus_set_error_printf(
state->eudoxus,
"Unknown node type: %d",
IA_EUDOXUS_TYPE(state->node->header)
);
return IA_EUDOXUS_EINVAL;
}
switch (result) {
case IA_EUDOXUS_OK:
case IA_EUDOXUS_END:
case IA_EUDOXUS_EINVAL:
case IA_EUDOXUS_EINSANE:
/* Nop */
break;
case IA_EUDOXUS_EXT_STOP:
case IA_EUDOXUS_EXT_ERROR:
ia_eudoxus_set_error_cstr(
state->eudoxus,
"Insanity! Nonsense from my next function."
" Please report as bug."
);
result = IA_EUDOXUS_EINSANE;
break;
default:
/* Insanity error. */
ia_eudoxus_set_error_printf(
state->eudoxus,
"Insanity! Unknown next result: %d."
" Please report as bug.",
result
);
result = IA_EUDOXUS_EINSANE;
}
return result;
}
/**
* Output function. Run any output callbacks for current state.
*
* This function should only be called if a callback is defined, i.e., if
* @c state->callback is not NULL.
*
* All node types use flag 0 to indicate the present of output and the first
* variable member to contain the id of the first output.
*
* @param[in,out] state Current state.
* @return See ia_eudoxus_execute() for return codes meanings.
*/
static
ia_eudoxus_result_t IA_EUDOXUS(output)(
ia_eudoxus_state_t *state
)
{
if (state == NULL) {
return IA_EUDOXUS_EINVAL;
}
/* Input may have run out inside a PC chain, in which case, no output. */
if (state->byte_index != 0) {
return IA_EUDOXUS_OK;
}
assert(state->eudoxus != NULL);
assert(state->node != NULL);
assert(state->callback != NULL);
bool has_output = IA_EUDOXUS_FLAG(state->node->header, 0);
if (! has_output) {
return IA_EUDOXUS_OK;
}
ia_vls_state_t vls;
switch (IA_EUDOXUS_TYPE(state->node->header)) {
case IA_EUDOXUS_LOW:
IA_VLS_INIT(vls, (IA_EUDOXUS(low_node_t) *)(state->node));
break;
case IA_EUDOXUS_HIGH:
IA_VLS_INIT(vls, (IA_EUDOXUS(high_node_t) *)(state->node));
break;
case IA_EUDOXUS_PC:
IA_VLS_INIT(vls, (IA_EUDOXUS(pc_node_t) *)(state->node));
break;
default: return IA_EUDOXUS_EINSANE;
}
IA_EUDOXUS_ID_T output_list = IA_VLS_IF(
vls,
IA_EUDOXUS_ID_T,
0,
has_output
);
if (output_list == 0) {
return IA_EUDOXUS_EINVAL;
}
while (output_list != 0) {
const ia_eudoxus_output_t *output_obj = 0;
if (output_list < state->eudoxus->automata->first_output_list) {
output_obj = (const ia_eudoxus_output_t *)(
(const char *)(state->eudoxus->automata) +
output_list
);
output_list = 0;
}
else {
const IA_EUDOXUS(output_list_t) *output_list_obj =
(const IA_EUDOXUS(output_list_t) *)(
(const char *)(state->eudoxus->automata) + output_list
);
if (output_list_obj->output == 0) {
return IA_EUDOXUS_EINVAL;
}
output_obj = (const ia_eudoxus_output_t *)(
(const char *)(state->eudoxus->automata) +
output_list_obj->output
);
output_list = output_list_obj->next_output;
}
ia_eudoxus_command_t command = state->callback(
state->eudoxus,
output_obj->data,
output_obj->length,
state->input_location,
state->callback_data
);
if (command != IA_EUDOXUS_CMD_CONTINUE) {
return (ia_eudoxus_result_t)command;
}
}
return IA_EUDOXUS_OK;
}
/**
* Execute function. Process a block of input.
*
* This is the subengine specific version of ia_eudoxus_execute() and has the
* same semantics. It loops through the input, calling the appropriate
* next and output functions. If either ever returns a code other than
* IA_EUDOXUS_OK, it will stop execution and return that code.
*
* @param[in, out] state State of automata.
* @param[in] input Input to execute on.
* @param[in] input_length Length of input.
* @param[in] with_output If true, generate output on transitions.
* @return See ia_eudoxus_execute() for return codes meanings.
*/
static
ia_eudoxus_result_t IA_EUDOXUS(execute)(
ia_eudoxus_state_t *state,
const uint8_t *input,
size_t input_length,
bool with_output
)
{
if (state == NULL) {
return IA_EUDOXUS_EINVAL;
}
assert(state->eudoxus != NULL);
assert(state->node != NULL);
ia_eudoxus_set_error(state->eudoxus, NULL);
if (input == NULL) {
/* Special case: Rerun output of current node and then resume based
* on state.
*/
ia_eudoxus_result_t result = IA_EUDOXUS(output)(state);
if (result != IA_EUDOXUS_OK) {
return result;
}
}
else {
state->input_location = input;
state->remaining_bytes = input_length;
}
if (state->input_location == NULL) {
/* Probably state was just created. */
return IA_EUDOXUS_OK;
}
while (state->remaining_bytes > 0) {
ia_eudoxus_result_t result = IA_EUDOXUS_OK;
/* Update state, including state->remaining_bytes */
const uint8_t* old_input_location = state->input_location;
result = IA_EUDOXUS(next)(state);
if (result != IA_EUDOXUS_OK) {
return result;
}
/* Call callback. */
if (
with_output &&
state->callback != NULL &&
( ! state->eudoxus->automata->no_advance_no_output ||
state->input_location != old_input_location )
) {
result = IA_EUDOXUS(output)(state);
if (result != IA_EUDOXUS_OK) {
return result;
}
}
}
return IA_EUDOXUS_OK;
}
/** @} IronAutomataEudoxusAutomata */