More fuzzing infastructre - regex
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@315582 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
37
test/libcxx/fuzzing/regex_ECMAScript.cpp
Normal file
37
test/libcxx/fuzzing/regex_ECMAScript.cpp
Normal file
@@ -0,0 +1,37 @@
|
||||
// -*- C++ -*-
|
||||
//===--------------------- regex_ECMAScript.cpp ---------------------------===//
|
||||
//
|
||||
// The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is dual licensed under the MIT and the University of Illinois Open
|
||||
// Source Licenses. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// XFAIL
|
||||
|
||||
#include "fuzzing.h"
|
||||
#include <cassert>
|
||||
#include <cstring> // for strlen
|
||||
|
||||
const char * test_cases[] = {
|
||||
"",
|
||||
"s",
|
||||
"b*c",
|
||||
"ba?sf"
|
||||
"lka*ea",
|
||||
"adsf*kas;lnc441[0-9]1r34525234"
|
||||
};
|
||||
|
||||
const size_t k_num_tests = sizeof(test_cases)/sizeof(test_cases[0]);
|
||||
|
||||
int main ()
|
||||
{
|
||||
for (size_t i = 0; i < k_num_tests; ++i)
|
||||
{
|
||||
const size_t size = std::strlen(test_cases[i]);
|
||||
const uint8_t *data = (const uint8_t *) test_cases[i];
|
||||
assert(0 == fuzzing::regex_ECMAScript(data, size));
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
37
test/libcxx/fuzzing/regex_POSIX.cpp
Normal file
37
test/libcxx/fuzzing/regex_POSIX.cpp
Normal file
@@ -0,0 +1,37 @@
|
||||
// -*- C++ -*-
|
||||
//===----------------------- regex_POSIX.cpp ------------------------------===//
|
||||
//
|
||||
// The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is dual licensed under the MIT and the University of Illinois Open
|
||||
// Source Licenses. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// XFAIL
|
||||
|
||||
#include "fuzzing.h"
|
||||
#include <cassert>
|
||||
#include <cstring> // for strlen
|
||||
|
||||
const char * test_cases[] = {
|
||||
"",
|
||||
"s",
|
||||
"b*c",
|
||||
"ba?sf"
|
||||
"lka*ea",
|
||||
"adsf*kas;lnc441[0-9]1r34525234"
|
||||
};
|
||||
|
||||
const size_t k_num_tests = sizeof(test_cases)/sizeof(test_cases[0]);
|
||||
|
||||
int main ()
|
||||
{
|
||||
for (size_t i = 0; i < k_num_tests; ++i)
|
||||
{
|
||||
const size_t size = std::strlen(test_cases[i]);
|
||||
const uint8_t *data = (const uint8_t *) test_cases[i];
|
||||
assert(0 == fuzzing::regex_POSIX(data, size));
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
37
test/libcxx/fuzzing/regex_awk.cpp
Normal file
37
test/libcxx/fuzzing/regex_awk.cpp
Normal file
@@ -0,0 +1,37 @@
|
||||
// -*- C++ -*-
|
||||
//===--------------------- regex_ECMAScript.cpp ---------------------------===//
|
||||
//
|
||||
// The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is dual licensed under the MIT and the University of Illinois Open
|
||||
// Source Licenses. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// XFAIL
|
||||
|
||||
#include "fuzzing.h"
|
||||
#include <cassert>
|
||||
#include <cstring> // for strlen
|
||||
|
||||
const char * test_cases[] = {
|
||||
"",
|
||||
"s",
|
||||
"b*c",
|
||||
"ba?sf"
|
||||
"lka*ea",
|
||||
"adsf*kas;lnc441[0-9]1r34525234"
|
||||
};
|
||||
|
||||
const size_t k_num_tests = sizeof(test_cases)/sizeof(test_cases[0]);
|
||||
|
||||
int main ()
|
||||
{
|
||||
for (size_t i = 0; i < k_num_tests; ++i)
|
||||
{
|
||||
const size_t size = std::strlen(test_cases[i]);
|
||||
const uint8_t *data = (const uint8_t *) test_cases[i];
|
||||
assert(0 == fuzzing::regex_ECMAScript(data, size));
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
37
test/libcxx/fuzzing/regex_egrep.cpp
Normal file
37
test/libcxx/fuzzing/regex_egrep.cpp
Normal file
@@ -0,0 +1,37 @@
|
||||
// -*- C++ -*-
|
||||
//===------------------------ regex_egrep.cpp -----------------------------===//
|
||||
//
|
||||
// The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is dual licensed under the MIT and the University of Illinois Open
|
||||
// Source Licenses. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// XFAIL
|
||||
|
||||
#include "fuzzing.h"
|
||||
#include <cassert>
|
||||
#include <cstring> // for strlen
|
||||
|
||||
const char * test_cases[] = {
|
||||
"",
|
||||
"s",
|
||||
"b*c",
|
||||
"ba?sf"
|
||||
"lka*ea",
|
||||
"adsf*kas;lnc441[0-9]1r34525234"
|
||||
};
|
||||
|
||||
const size_t k_num_tests = sizeof(test_cases)/sizeof(test_cases[0]);
|
||||
|
||||
int main ()
|
||||
{
|
||||
for (size_t i = 0; i < k_num_tests; ++i)
|
||||
{
|
||||
const size_t size = std::strlen(test_cases[i]);
|
||||
const uint8_t *data = (const uint8_t *) test_cases[i];
|
||||
assert(0 == fuzzing::regex_egrep(data, size));
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
37
test/libcxx/fuzzing/regex_extended.cpp
Normal file
37
test/libcxx/fuzzing/regex_extended.cpp
Normal file
@@ -0,0 +1,37 @@
|
||||
// -*- C++ -*-
|
||||
//===---------------------- regex_extended.cpp ----------------------------===//
|
||||
//
|
||||
// The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is dual licensed under the MIT and the University of Illinois Open
|
||||
// Source Licenses. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// XFAIL
|
||||
|
||||
#include "fuzzing.h"
|
||||
#include <cassert>
|
||||
#include <cstring> // for strlen
|
||||
|
||||
const char * test_cases[] = {
|
||||
"",
|
||||
"s",
|
||||
"b*c",
|
||||
"ba?sf"
|
||||
"lka*ea",
|
||||
"adsf*kas;lnc441[0-9]1r34525234"
|
||||
};
|
||||
|
||||
const size_t k_num_tests = sizeof(test_cases)/sizeof(test_cases[0]);
|
||||
|
||||
int main ()
|
||||
{
|
||||
for (size_t i = 0; i < k_num_tests; ++i)
|
||||
{
|
||||
const size_t size = std::strlen(test_cases[i]);
|
||||
const uint8_t *data = (const uint8_t *) test_cases[i];
|
||||
assert(0 == fuzzing::regex_extended(data, size));
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
37
test/libcxx/fuzzing/regex_grep.cpp
Normal file
37
test/libcxx/fuzzing/regex_grep.cpp
Normal file
@@ -0,0 +1,37 @@
|
||||
// -*- C++ -*-
|
||||
//===------------------------ regex_grep.cpp ------------------------------===//
|
||||
//
|
||||
// The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is dual licensed under the MIT and the University of Illinois Open
|
||||
// Source Licenses. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// XFAIL
|
||||
|
||||
#include "fuzzing.h"
|
||||
#include <cassert>
|
||||
#include <cstring> // for strlen
|
||||
|
||||
const char * test_cases[] = {
|
||||
"",
|
||||
"s",
|
||||
"b*c",
|
||||
"ba?sf"
|
||||
"lka*ea",
|
||||
"adsf*kas;lnc441[0-9]1r34525234"
|
||||
};
|
||||
|
||||
const size_t k_num_tests = sizeof(test_cases)/sizeof(test_cases[0]);
|
||||
|
||||
int main ()
|
||||
{
|
||||
for (size_t i = 0; i < k_num_tests; ++i)
|
||||
{
|
||||
const size_t size = std::strlen(test_cases[i]);
|
||||
const uint8_t *data = (const uint8_t *) test_cases[i];
|
||||
assert(0 == fuzzing::regex_grep(data, size));
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
Reference in New Issue
Block a user