mirror of
https://github.com/VectorCamp/vectorscan.git
synced 2025-06-28 16:41:01 +03:00
9e9bb6a960
Eliminate the RoseRuntimeState structure in favour of a single status byte that is stored in scratch and copied to/from stream state.
94 lines
3.6 KiB
C
94 lines
3.6 KiB
C
/*
|
|
* 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.
|
|
*/
|
|
|
|
#include "init.h"
|
|
#include "match.h"
|
|
#include "runtime.h"
|
|
#include "scratch.h"
|
|
#include "rose.h"
|
|
#include "rose_common.h"
|
|
#include "rose_internal.h"
|
|
#include "ue2common.h"
|
|
#include "nfa/mcclellan.h"
|
|
#include "nfa/nfa_api_util.h"
|
|
#include "nfa/nfa_internal.h"
|
|
#include "util/multibit.h"
|
|
|
|
#include <string.h>
|
|
|
|
static really_inline
|
|
void init_rstate(const struct RoseEngine *t, char *state) {
|
|
// Set runtime state: we take our initial groups from the RoseEngine.
|
|
DEBUG_PRINTF("setting initial groups to 0x%016llx\n", t->initialGroups);
|
|
storeGroups(t, state, t->initialGroups);
|
|
}
|
|
|
|
static really_inline
|
|
void init_outfixes(const struct RoseEngine *t, char *state) {
|
|
/* The active leaf array has been init'ed by the scatter with outfix
|
|
* bits set on */
|
|
|
|
// Init the NFA state for each outfix.
|
|
for (u32 qi = t->outfixBeginQueue; qi < t->outfixEndQueue; qi++) {
|
|
const struct NfaInfo *info = getNfaInfoByQueue(t, qi);
|
|
const struct NFA *nfa = getNfaByInfo(t, info);
|
|
nfaInitCompressedState(nfa, 0, state + info->stateOffset,
|
|
0 /* assume NUL at start */);
|
|
}
|
|
|
|
if (t->initMpvNfa != MO_INVALID_IDX) {
|
|
const struct NfaInfo *info = getNfaInfoByQueue(t, t->initMpvNfa);
|
|
const struct NFA *nfa = getNfaByInfo(t, info);
|
|
nfaInitCompressedState(nfa, 0, state + info->stateOffset,
|
|
0 /* assume NUL at start */);
|
|
mmbit_set(getActiveLeafArray(t, state), t->activeArrayCount,
|
|
t->initMpvNfa);
|
|
}
|
|
}
|
|
|
|
void roseInitState(const struct RoseEngine *t, char *state) {
|
|
assert(t);
|
|
assert(state);
|
|
|
|
DEBUG_PRINTF("init for Rose %p with %u state indices)\n", t,
|
|
t->rolesWithStateCount);
|
|
|
|
// Rose is guaranteed 8-aligned state
|
|
assert(ISALIGNED_N(state, 8));
|
|
|
|
init_rstate(t, state);
|
|
|
|
init_state(t, state);
|
|
init_outfixes(t, state);
|
|
|
|
// Clear the floating matcher state, if any.
|
|
DEBUG_PRINTF("clearing %u bytes of floating matcher state\n",
|
|
t->floatingStreamState);
|
|
memset(getFloatingMatcherState(t, state), 0, t->floatingStreamState);
|
|
}
|