mirror of
https://github.com/VectorCamp/vectorscan.git
synced 2025-06-28 16:41:01 +03:00
* supress knownConditionTrueFalse * cppcheck suppress redundantInitialization * cppcheck solve stlcstrStream * cppcheck suppress useStlAlgorithm * cppcheck-suppress derefInvalidIteratorRedundantCheck * cppcheck solvwe constParameterReference * const parameter reference cppcheck * removed wrong fix * cppcheck-suppress memsetClassFloat * cppcheck fix memsetClassFloat * cppcheck fix unsignedLessThanZero * supressing all errors on simde gitmodule * fix typo (unsignedLessThanZero) * fix cppcheck suppress simde gitmodule * cppcheck-suppress unsignedLessThanZero --------- Co-authored-by: gtsoul-tech <gtsoulkanakis@gmail.com>
620 lines
19 KiB
C++
620 lines
19 KiB
C++
/*
|
|
* Copyright (c) 2015-2017, 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 "config.h"
|
|
|
|
#include "gtest/gtest.h"
|
|
#include "nfa/truffle.h"
|
|
#include "nfa/trufflecompile.h"
|
|
#include "util/charreach.h"
|
|
#include "util/simd_utils.h"
|
|
|
|
using namespace ue2;
|
|
|
|
TEST(Truffle, CompileDot) {
|
|
m128 mask1, mask2;
|
|
memset(&mask1, 0, sizeof(mask1)); // cppcheck-suppress memsetClassFloat
|
|
memset(&mask2, 0, sizeof(mask2)); // cppcheck-suppress memsetClassFloat
|
|
|
|
CharReach chars;
|
|
|
|
chars.setall();
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
CharReach out = truffle2cr(reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
ASSERT_EQ(out, chars);
|
|
|
|
}
|
|
|
|
TEST(Truffle, CompileChars) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
|
|
// test one char at a time
|
|
for (u32 c = 0; c < 256; ++c) {
|
|
mask1 = zeroes128();
|
|
mask2 = zeroes128();
|
|
chars.clear();
|
|
chars.set((u8)c);
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
CharReach out = truffle2cr(reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
ASSERT_EQ(out, chars);
|
|
}
|
|
|
|
// set all chars up to dot
|
|
for (u32 c = 0; c < 256; ++c) {
|
|
mask1 = zeroes128();
|
|
mask2 = zeroes128();
|
|
chars.set((u8)c);
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
CharReach out = truffle2cr(reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
ASSERT_EQ(out, chars);
|
|
}
|
|
|
|
// unset all chars from dot
|
|
for (u32 c = 0; c < 256; ++c) {
|
|
mask1 = zeroes128();
|
|
mask2 = zeroes128();
|
|
chars.clear((u8)c);
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
CharReach out = truffle2cr(reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
ASSERT_EQ(out, chars);
|
|
}
|
|
|
|
}
|
|
|
|
TEST(Truffle, ExecNoMatch1) {
|
|
m128 mask1, mask2;
|
|
memset(&mask1, 0, sizeof(mask1)); // cppcheck-suppress memsetClassFloat
|
|
memset(&mask2, 0, sizeof(mask2)); // cppcheck-suppress memsetClassFloat
|
|
|
|
CharReach chars;
|
|
|
|
chars.set('a');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
char t1[] = "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\xff";
|
|
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = truffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1) + i, reinterpret_cast<u8 *>(t1) + strlen(t1));
|
|
|
|
ASSERT_EQ((size_t)t1 + strlen(t1), (size_t)rv);
|
|
}
|
|
}
|
|
|
|
TEST(Truffle, ExecNoMatch2) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
|
|
chars.set('a');
|
|
chars.set('B');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
char t1[] = "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb";
|
|
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = truffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1) + i, reinterpret_cast<u8 *>(t1) + strlen(t1));
|
|
|
|
ASSERT_EQ((size_t)t1 + strlen(t1), (size_t)rv);
|
|
}
|
|
}
|
|
|
|
TEST(Truffle, ExecNoMatch3) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
|
|
chars.set('V'); /* V = 0x56, e = 0x65 */
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
char t1[] = "eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee";
|
|
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = truffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1) + i, reinterpret_cast<u8 *>(t1) + strlen(t1));
|
|
|
|
ASSERT_EQ((size_t)t1 + strlen(t1), (size_t)rv);
|
|
}
|
|
}
|
|
|
|
TEST(Truffle, ExecMiniMatch0) {
|
|
m128 lo, hi;
|
|
|
|
CharReach chars;
|
|
chars.set('a');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&lo), reinterpret_cast<u8 *>(&hi));
|
|
|
|
char t1[] = "a";
|
|
|
|
const u8 *rv = truffleExec(lo, hi, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + strlen(t1));
|
|
|
|
ASSERT_EQ((size_t)t1, (size_t)rv);
|
|
}
|
|
|
|
TEST(Truffle, ExecMiniMatch1) {
|
|
m128 lo, hi;
|
|
|
|
CharReach chars;
|
|
chars.set('a');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&lo), reinterpret_cast<u8 *>(&hi));
|
|
|
|
char t1[] = "bbbbbbbabbb";
|
|
|
|
const u8 *rv = truffleExec(lo, hi, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + strlen(t1));
|
|
|
|
ASSERT_EQ((size_t)t1 + 7, (size_t)rv);
|
|
}
|
|
|
|
TEST(Truffle, ExecMiniMatch2) {
|
|
m128 lo, hi;
|
|
|
|
CharReach chars;
|
|
chars.set(0);
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&lo), reinterpret_cast<u8 *>(&hi));
|
|
|
|
char t1[] = "bbbbbbb\0bbb";
|
|
|
|
const u8 *rv = truffleExec(lo, hi, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + 11);
|
|
|
|
ASSERT_EQ((size_t)t1 + 7, (size_t)rv);
|
|
}
|
|
|
|
TEST(Truffle, ExecMiniMatch3) {
|
|
m128 lo, hi;
|
|
|
|
CharReach chars;
|
|
chars.set('a');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&lo), reinterpret_cast<u8 *>(&hi));
|
|
|
|
char t1[] = "\0\0\0\0\0\0\0a\0\0\0";
|
|
|
|
const u8 *rv = truffleExec(lo, hi, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + 11);
|
|
|
|
ASSERT_EQ((size_t)t1 + 7, (size_t)rv);
|
|
}
|
|
|
|
TEST(Truffle, ExecMatchBig) {
|
|
m128 lo, hi;
|
|
|
|
CharReach chars;
|
|
chars.set('a');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&lo), reinterpret_cast<u8 *>(&hi));
|
|
|
|
std::array<u8, 400> t1;
|
|
t1.fill('b');
|
|
t1[120] = 'a';
|
|
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = truffleExec(lo, hi, reinterpret_cast<u8 *>(t1.data()) + i, reinterpret_cast<u8 *>(t1.data()) + 399);
|
|
|
|
ASSERT_LE(((size_t)t1.data() + 120) & ~0xf, (size_t)rv);
|
|
}
|
|
}
|
|
|
|
TEST(Truffle, ExecMatch1) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
|
|
chars.set('a');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
/* 0123456789012345678901234567890 */
|
|
char t1[] = "bbbbbbbbbbbbbbbbbabbbbbbbbbbbbbbbbbbbbbbbbbbbbbbabbbbbbbbbbbb";
|
|
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = truffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1) + i, reinterpret_cast<u8 *>(t1) + strlen(t1));
|
|
|
|
ASSERT_EQ((size_t)t1 + 17, (size_t)rv);
|
|
}
|
|
}
|
|
|
|
TEST(Truffle, ExecMatch2) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
|
|
chars.set('a');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
/* 0123456789012345678901234567890 */
|
|
char t1[] = "bbbbbbbbbbbbbbbbbaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbabbbbbbbbbbbb";
|
|
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = truffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1) + i, reinterpret_cast<u8 *>(t1) + strlen(t1));
|
|
|
|
ASSERT_EQ((size_t)t1 + 17, (size_t)rv);
|
|
}
|
|
}
|
|
|
|
TEST(Truffle, ExecMatch3) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
|
|
chars.set('a');
|
|
chars.set('B');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
/* 0123456789012345678901234567890 */
|
|
char t1[] = "bbbbbbbbbbbbbbbbbBaaaaaaaaaaaaaaabbbbbbbbbbbbbbbabbbbbbbbbbbb";
|
|
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = truffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1) + i, reinterpret_cast<u8 *>(t1) + strlen(t1));
|
|
|
|
ASSERT_EQ((size_t)t1 + 17, (size_t)rv);
|
|
}
|
|
}
|
|
|
|
TEST(Truffle, ExecMatch4) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
|
|
chars.set('a');
|
|
chars.set('C');
|
|
chars.set('A');
|
|
chars.set('c');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
/* 0123456789012345678901234567890 */
|
|
char t1[] = "bbbbbbbbbbbbbbbbbAaaaaaaaaaaaaaaabbbbbbbbbbbbbbbabbbbbbbbbbbb";
|
|
char t2[] = "bbbbbbbbbbbbbbbbbCaaaaaaaaaaaaaaabbbbbbbbbbbbbbbabbbbbbbbbbbb";
|
|
char t3[] = "bbbbbbbbbbbbbbbbbcaaaaaaaaaaaaaaabbbbbbbbbbbbbbbabbbbbbbbbbbb";
|
|
char t4[] = "bbbbbbbbbbbbbbbbbaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbabbbbbbbbbbbb";
|
|
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = truffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1) + i, reinterpret_cast<u8 *>(t1) + strlen(t1));
|
|
|
|
ASSERT_EQ((size_t)t1 + 17, (size_t)rv);
|
|
|
|
rv = truffleExec(mask1, mask2, reinterpret_cast<u8 *>(t2) + i, reinterpret_cast<u8 *>(t2) + strlen(t1));
|
|
|
|
ASSERT_EQ((size_t)t2 + 17, (size_t)rv);
|
|
|
|
rv = truffleExec(mask1, mask2, reinterpret_cast<u8 *>(t3) + i, reinterpret_cast<u8 *>(t3) + strlen(t3));
|
|
|
|
ASSERT_EQ((size_t)t3 + 17, (size_t)rv);
|
|
|
|
rv = truffleExec(mask1, mask2, reinterpret_cast<u8 *>(t4) + i, reinterpret_cast<u8 *>(t4) + strlen(t4));
|
|
|
|
ASSERT_EQ((size_t)t4 + 17, (size_t)rv);
|
|
}
|
|
}
|
|
|
|
TEST(Truffle, ExecMatch5) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
|
|
chars.set('a');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
char t1[] = "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb";
|
|
|
|
for (size_t i = 0; i < 31; i++) {
|
|
t1[48 - i] = 'a';
|
|
const u8 *rv = truffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + strlen(t1));
|
|
|
|
ASSERT_EQ((size_t)&t1[48 - i], (size_t)rv);
|
|
}
|
|
}
|
|
|
|
TEST(Truffle, ExecMatch6) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
|
|
// [0-Z] - includes some graph chars
|
|
chars.setRange('0', 'Z');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
std::array<u8, 128> t1;
|
|
t1.fill('*'); // it's full of stars!
|
|
|
|
for (u8 c = '0'; c <= 'Z'; c++) {
|
|
t1[17] = c;
|
|
const u8 *rv = truffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1.data()), reinterpret_cast<u8 *>(t1.data()) + 128);
|
|
|
|
ASSERT_EQ((size_t)t1.data() + 17, (size_t)rv);
|
|
}
|
|
}
|
|
|
|
TEST(Truffle, ExecMatch7) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
|
|
// hi bits
|
|
chars.setRange(127, 255);
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
std::array<u8, 128> t1;
|
|
t1.fill('*'); // it's full of stars!
|
|
|
|
for (unsigned int c = 127; c <= 255; c++) {
|
|
t1[40] = (u8)c;
|
|
const u8 *rv = truffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1.data()), reinterpret_cast<u8 *>(t1.data()) + 128);
|
|
|
|
ASSERT_EQ((size_t)t1.data() + 40, (size_t)rv);
|
|
}
|
|
}
|
|
|
|
TEST(ReverseTruffle, ExecNoMatch1) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
chars.set('a');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
char t[] = " bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb";
|
|
char *t1 = t + 1;
|
|
size_t len = strlen(t1);
|
|
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = rtruffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + len - i);
|
|
ASSERT_EQ(reinterpret_cast<const u8 *>(t), rv);
|
|
}
|
|
}
|
|
|
|
TEST(ReverseTruffle, ExecNoMatch2) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
|
|
chars.set('a');
|
|
chars.set('B');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
char t[] = " bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb";
|
|
char *t1 = t + 1;
|
|
size_t len = strlen(t1);
|
|
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = rtruffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + len - i);
|
|
ASSERT_EQ(reinterpret_cast<const u8 *>(t), rv);
|
|
}
|
|
}
|
|
|
|
TEST(ReverseTruffle, ExecNoMatch3) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
chars.set('V'); /* V = 0x56, e = 0x65 */
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
char t[] = "eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee";
|
|
char *t1 = t + 1;
|
|
size_t len = strlen(t1);
|
|
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = rtruffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + len - i);
|
|
ASSERT_EQ(reinterpret_cast<const u8 *>(t), rv);
|
|
}
|
|
}
|
|
|
|
TEST(ReverseTruffle, ExecMiniMatch0) {
|
|
m128 lo, hi;
|
|
|
|
CharReach chars;
|
|
chars.set('a');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&lo), reinterpret_cast<u8 *>(&hi));
|
|
|
|
char t1[] = "a";
|
|
|
|
const u8 *rv = rtruffleExec(lo, hi, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + strlen(t1));
|
|
|
|
ASSERT_EQ((size_t)t1, (size_t)rv);
|
|
}
|
|
|
|
TEST(ReverseTruffle, ExecMiniMatch1) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
chars.set('a');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
/* 0123456789012345678901234567890 */
|
|
char t1[] = "bbbbbbbabbbb";
|
|
size_t len = strlen(t1);
|
|
|
|
const u8 *rv = rtruffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + len);
|
|
ASSERT_NE(reinterpret_cast<const u8 *>(t1) - 1, rv); // not found
|
|
EXPECT_EQ('a', (char)*rv);
|
|
ASSERT_EQ(reinterpret_cast<const u8 *>(t1) + 7, rv);
|
|
}
|
|
|
|
TEST(ReverseTruffle, ExecMiniMatch2) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
chars.set('a');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
/* 0123456789012345678901234567890 */
|
|
char t1[] = "babbbbbabbbb";
|
|
size_t len = strlen(t1);
|
|
|
|
const u8 *rv = rtruffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + len);
|
|
ASSERT_NE(reinterpret_cast<const u8 *>(t1) - 1, rv); // not found
|
|
EXPECT_EQ('a', (char)*rv);
|
|
ASSERT_EQ(reinterpret_cast<const u8 *>(t1) + 7, rv);
|
|
}
|
|
|
|
|
|
TEST(ReverseTruffle, ExecMatch1) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
chars.set('a');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
/* 0123456789012345678901234567890 */
|
|
char t1[] = "bbbbbbabbbbbbbbbbabbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb";
|
|
size_t len = strlen(t1);
|
|
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = rtruffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + len - i);
|
|
ASSERT_NE(reinterpret_cast<const u8 *>(t1) - 1, rv); // not found
|
|
EXPECT_EQ('a', (char)*rv);
|
|
ASSERT_EQ(reinterpret_cast<const u8 *>(t1) + 17, rv);
|
|
}
|
|
}
|
|
|
|
TEST(ReverseTruffle, ExecMatch2) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
chars.set('a');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
/* 0123456789012345678901234567890 */
|
|
char t1[] = "bbbbabbbbbbbbbbbbaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbbb";
|
|
size_t len = strlen(t1);
|
|
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = rtruffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + len - i);
|
|
ASSERT_NE(reinterpret_cast<const u8 *>(t1) - 1, rv); // not found
|
|
EXPECT_EQ('a', (char)*rv);
|
|
ASSERT_EQ(reinterpret_cast<const u8 *>(t1) + 32, rv);
|
|
}
|
|
}
|
|
|
|
TEST(ReverseTruffle, ExecMatch3) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
chars.set('a');
|
|
chars.set('B');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
/* 0123456789012345678901234567890 */
|
|
char t1[] = "bbbbbbbbbbbbbbbbbaaaaaaaaaaaaaaaBbbbbbbbbbbbbbbbbbbbbbbbbbbbb";
|
|
size_t len = strlen(t1);
|
|
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = rtruffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + len - i);
|
|
ASSERT_NE(reinterpret_cast<const u8 *>(t1) - 1, rv); // not found
|
|
EXPECT_EQ('B', (char)*rv);
|
|
ASSERT_EQ(reinterpret_cast<const u8 *>(t1) + 32, rv);
|
|
}
|
|
|
|
// check that we match the 'a' bytes as well.
|
|
ASSERT_EQ('B', t1[32]);
|
|
t1[32] = 'b';
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = rtruffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + len - i);
|
|
ASSERT_NE(reinterpret_cast<const u8 *>(t1) - 1, rv); // not found
|
|
EXPECT_EQ('a', (char)*rv);
|
|
ASSERT_EQ(reinterpret_cast<const u8 *>(t1) + 31, rv);
|
|
}
|
|
}
|
|
|
|
TEST(ReverseTruffle, ExecMatch4) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
chars.set('a');
|
|
chars.set('C');
|
|
chars.set('A');
|
|
chars.set('c');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
/* 0123456789012345678901234567890 */
|
|
char t1[] = "bbbbbbbbbbbbbbbbbaaaaaaaaaaaaaaaAbbbbbbbbbbbbbbbbbbbbbbbbbbbb";
|
|
char t2[] = "bbbbbbbbbbbbbbbbbaaaaaaaaaaaaaaaCbbbbbbbbbbbbbbbbbbbbbbbbbbbb";
|
|
char t3[] = "bbbbbbbbbbbbbbbbbaaaaaaaaaaaaaaacbbbbbbbbbbbbbbbbbbbbbbbbbbbb";
|
|
char t4[] = "bbbbbbbbbbbbbbbbbaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbbb";
|
|
size_t len = strlen(t1);
|
|
|
|
for (size_t i = 0; i < 16; i++) {
|
|
const u8 *rv = rtruffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + len - i);
|
|
EXPECT_EQ('A', (char)*rv);
|
|
ASSERT_EQ(reinterpret_cast<const u8 *>(t1) + 32, rv);
|
|
|
|
rv = rtruffleExec(mask1, mask2, reinterpret_cast<u8 *>(t2), reinterpret_cast<u8 *>(t2) + len - i);
|
|
EXPECT_EQ('C', (char)*rv);
|
|
ASSERT_EQ(reinterpret_cast<const u8 *>(t2) + 32, rv);
|
|
|
|
rv = rtruffleExec(mask1, mask2, reinterpret_cast<u8 *>(t3), reinterpret_cast<u8 *>(t3) + len - i);
|
|
EXPECT_EQ('c', (char)*rv);
|
|
ASSERT_EQ(reinterpret_cast<const u8 *>(t3) + 32, rv);
|
|
|
|
rv = rtruffleExec(mask1, mask2, reinterpret_cast<u8 *>(t4), reinterpret_cast<u8 *>(t4) + len - i);
|
|
EXPECT_EQ('a', (char)*rv);
|
|
ASSERT_EQ(reinterpret_cast<const u8 *>(t4) + 32, rv);
|
|
}
|
|
}
|
|
|
|
TEST(ReverseTruffle, ExecMatch5) {
|
|
m128 mask1, mask2;
|
|
|
|
CharReach chars;
|
|
chars.set('a');
|
|
|
|
truffleBuildMasks(chars, reinterpret_cast<u8 *>(&mask1), reinterpret_cast<u8 *>(&mask2));
|
|
|
|
char t1[] = "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb";
|
|
size_t len = strlen(t1);
|
|
|
|
for (size_t i = 0; i < len; i++) {
|
|
t1[i] = 'a';
|
|
const u8 *rv = rtruffleExec(mask1, mask2, reinterpret_cast<u8 *>(t1), reinterpret_cast<u8 *>(t1) + len);
|
|
|
|
ASSERT_EQ(reinterpret_cast<const u8 *>(t1) + i, rv);
|
|
}
|
|
}
|