1 | /* |
2 | * Copyright (c) 2015-2016, Intel Corporation |
3 | * |
4 | * Redistribution and use in source and binary forms, with or without |
5 | * modification, are permitted provided that the following conditions are met: |
6 | * |
7 | * * Redistributions of source code must retain the above copyright notice, |
8 | * this list of conditions and the following disclaimer. |
9 | * * Redistributions in binary form must reproduce the above copyright |
10 | * notice, this list of conditions and the following disclaimer in the |
11 | * documentation and/or other materials provided with the distribution. |
12 | * * Neither the name of Intel Corporation nor the names of its contributors |
13 | * may be used to endorse or promote products derived from this software |
14 | * without specific prior written permission. |
15 | * |
16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
26 | * POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
28 | |
29 | #include "init.h" |
30 | #include "match.h" |
31 | #include "runtime.h" |
32 | #include "scratch.h" |
33 | #include "rose.h" |
34 | #include "rose_common.h" |
35 | #include "rose_internal.h" |
36 | #include "ue2common.h" |
37 | #include "nfa/mcclellan.h" |
38 | #include "nfa/nfa_api_util.h" |
39 | #include "nfa/nfa_internal.h" |
40 | #include "util/multibit.h" |
41 | |
42 | #include <string.h> |
43 | |
44 | static really_inline |
45 | void init_rstate(const struct RoseEngine *t, char *state) { |
46 | // Set runtime state: we take our initial groups from the RoseEngine. |
47 | DEBUG_PRINTF("setting initial groups to 0x%016llx\n" , t->initialGroups); |
48 | storeGroups(t, state, t->initialGroups); |
49 | } |
50 | |
51 | static really_inline |
52 | void init_outfixes(const struct RoseEngine *t, char *state) { |
53 | /* The active leaf array has been init'ed by the scatter with outfix |
54 | * bits set on */ |
55 | |
56 | // Init the NFA state for each outfix. |
57 | for (u32 qi = t->outfixBeginQueue; qi < t->outfixEndQueue; qi++) { |
58 | const struct NfaInfo *info = getNfaInfoByQueue(t, qi); |
59 | const struct NFA *nfa = getNfaByInfo(t, info); |
60 | nfaInitCompressedState(nfa, 0, state + info->stateOffset, |
61 | 0 /* assume NUL at start */); |
62 | } |
63 | |
64 | if (t->initMpvNfa != MO_INVALID_IDX) { |
65 | const struct NfaInfo *info = getNfaInfoByQueue(t, t->initMpvNfa); |
66 | const struct NFA *nfa = getNfaByInfo(t, info); |
67 | nfaInitCompressedState(nfa, 0, state + info->stateOffset, |
68 | 0 /* assume NUL at start */); |
69 | mmbit_set(getActiveLeafArray(t, state), t->activeArrayCount, |
70 | t->initMpvNfa); |
71 | } |
72 | } |
73 | |
74 | void roseInitState(const struct RoseEngine *t, char *state) { |
75 | assert(t); |
76 | assert(state); |
77 | |
78 | DEBUG_PRINTF("init for Rose %p with %u state indices)\n" , t, |
79 | t->rolesWithStateCount); |
80 | |
81 | // Rose is guaranteed 8-aligned state |
82 | assert(ISALIGNED_N(state, 8)); |
83 | |
84 | init_rstate(t, state); |
85 | |
86 | init_state(t, state); |
87 | init_outfixes(t, state); |
88 | } |
89 | |