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
|
/*
* Copyright (c) 2015-2016, Intel Corporation
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of Intel Corporation nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
/** \file
\brief Limex Execution Engine Or:
How I Learned To Stop Worrying And Love The Preprocessor
This file includes utility functions which do not depend on the size of the
state or shift masks directly.
*/
#ifndef LIMEX_RUNTIME_H
#define LIMEX_RUNTIME_H
#include "limex_accel.h"
#include "limex_context.h"
#include "limex_internal.h"
#include "nfa_api_util.h"
#include "nfa_internal.h"
#include "util/uniform_ops.h"
////////////////////////////////////////////////////////////////////////////
// LimEx NFA implementation code - common macros
////////////////////////////////////////////////////////////////////////////
#ifdef DEBUG_INPUT
#include <ctype.h>
#define DUMP_INPUT(index) DEBUG_PRINTF("input %p i=%zu: %02hhx (%c)\n", \
&input[index], index, input[index], \
isprint(input[index]) ? input[index] : ' ')
#else
#define DUMP_INPUT(index) do { } while(0)
#endif
#define NO_OUTPUT 0
#define CALLBACK_OUTPUT 1
#define FIRST_BYTE 16
enum CacheResult {
DO_NOT_CACHE_RESULT,
CACHE_RESULT,
DO_NOT_CACHE_RESULT_AND_FLUSH_BR_ENTRIES
};
struct proto_cache {
char br;
const ReportID *reports;
};
#define PE_RV_HALT 1
#ifdef STATE_ON_STACK
#define pass_state s
#else
#define pass_state &s
#endif
#ifdef ESTATE_ON_STACK
#define pass_estate estate
#else
#define pass_estate &estate
#endif
static really_inline
int limexRunReports(const ReportID *reports, NfaCallback callback,
void *context, u64a offset) {
assert(reports);
assert(callback);
for (; *reports != MO_INVALID_IDX; ++reports) {
DEBUG_PRINTF("firing report for id %u at offset %llu\n",
*reports, offset);
int rv = callback(0, offset, *reports, context);
if (rv == MO_HALT_MATCHING) {
return MO_HALT_MATCHING;
}
}
return MO_CONTINUE_MATCHING; // continue
}
static really_inline
int limexRunAccept(const char *limex_base, const struct NFAAccept *accept,
NfaCallback callback, void *context, u64a offset) {
if (accept->single_report) {
const ReportID report = accept->reports;
DEBUG_PRINTF("firing single report for id %u at offset %llu\n", report,
offset);
return callback(0, offset, report, context);
}
const ReportID *reports = (const ReportID *)(limex_base + accept->reports);
return limexRunReports(reports, callback, context, offset);
}
static really_inline
int limexAcceptHasReport(const char *limex_base, const struct NFAAccept *accept,
ReportID report) {
if (accept->single_report) {
return accept->reports == report;
}
const ReportID *reports = (const ReportID *)(limex_base + accept->reports);
assert(*reports != MO_INVALID_IDX);
do {
if (*reports == report) {
return 1;
}
reports++;
} while (*reports != MO_INVALID_IDX);
return 0;
}
/** \brief Return a (correctly typed) pointer to the exception table. */
#define getExceptionTable(exc_type, lim) \
((const exc_type *)((const char *)(lim) + (lim)->exceptionOffset))
/** \brief Return a pointer to the ordinary accepts table. */
#define getAcceptTable(lim) \
((const struct NFAAccept *)((const char *)(lim) + (lim)->acceptOffset))
/** \brief Return a pointer to the EOD accepts table. */
#define getAcceptEodTable(lim) \
((const struct NFAAccept *)((const char *)(lim) + (lim)->acceptEodOffset))
#define MAKE_GET_NFA_REPEAT_INFO(size) \
static really_inline const struct NFARepeatInfo *getNfaRepeatInfo##size( \
const struct LimExNFA##size *limex, unsigned num) { \
assert(num < limex->repeatCount); \
\
const char *base = (const char *)limex; \
const u32 *repeatOffset = (const u32 *)(base + limex->repeatOffset); \
assert(ISALIGNED(repeatOffset)); \
\
const struct NFARepeatInfo *info = \
(const struct NFARepeatInfo *)(base + repeatOffset[num]); \
assert(ISALIGNED(info)); \
return info; \
}
MAKE_GET_NFA_REPEAT_INFO(32)
MAKE_GET_NFA_REPEAT_INFO(64)
MAKE_GET_NFA_REPEAT_INFO(128)
MAKE_GET_NFA_REPEAT_INFO(256)
MAKE_GET_NFA_REPEAT_INFO(384)
MAKE_GET_NFA_REPEAT_INFO(512)
static really_inline
const struct RepeatInfo *getRepeatInfo(const struct NFARepeatInfo *info) {
const struct RepeatInfo *repeat =
(const struct RepeatInfo *)((const char *)info + sizeof(*info));
assert(ISALIGNED(repeat));
return repeat;
}
static really_inline
union RepeatControl *getRepeatControlBase(char *state, size_t nfa_state_size) {
union RepeatControl *ctrl_base =
(union RepeatControl *)(state +
ROUNDUP_N(nfa_state_size,
alignof(union RepeatControl)));
assert(ISALIGNED(ctrl_base));
return ctrl_base;
}
static really_inline
const union RepeatControl *getRepeatControlBaseConst(const char *state,
size_t nfa_state_size) {
const union RepeatControl *ctrl_base =
(const union RepeatControl *)(state +
ROUNDUP_N(nfa_state_size,
alignof(union RepeatControl)));
assert(ISALIGNED(ctrl_base));
return ctrl_base;
}
#endif
|
