diff options
| author | Kostya Serebryany <kcc@google.com> | 2019-02-08 00:41:29 +0000 |
|---|---|---|
| committer | Kostya Serebryany <kcc@google.com> | 2019-02-08 00:41:29 +0000 |
| commit | 28e967aaa1ecc6ff9b22f64c6057f56abe5503b8 (patch) | |
| tree | e90308c081ed971f003d47e9f9daad8211d56d54 /compiler-rt | |
| parent | 3c247076cce9e9e3774c049ce268f81ff219dc00 (diff) | |
| download | bcm5719-llvm-28e967aaa1ecc6ff9b22f64c6057f56abe5503b8.tar.gz bcm5719-llvm-28e967aaa1ecc6ff9b22f64c6057f56abe5503b8.zip | |
[libFuzzer] add a test for built-in CrossOver (there are unit tests for this, but it's worth having a full integration test like this)
llvm-svn: 353488
Diffstat (limited to 'compiler-rt')
| -rw-r--r-- | compiler-rt/test/fuzzer/CrossOverTest.cpp | 54 | ||||
| -rw-r--r-- | compiler-rt/test/fuzzer/cross_over.test | 14 |
2 files changed, 68 insertions, 0 deletions
diff --git a/compiler-rt/test/fuzzer/CrossOverTest.cpp b/compiler-rt/test/fuzzer/CrossOverTest.cpp new file mode 100644 index 00000000000..a7643570a92 --- /dev/null +++ b/compiler-rt/test/fuzzer/CrossOverTest.cpp @@ -0,0 +1,54 @@ +// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. +// See https://llvm.org/LICENSE.txt for license information. +// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception + +// Test for a fuzzer. The fuzzer must find the string +// ABCDEFGHIJ +// We use it as a test for CrossOver functionality +// by passing two inputs to it: +// ABCDE00000 +// ZZZZZFGHIJ +// +#include <assert.h> +#include <cstddef> +#include <cstdint> +#include <cstdlib> +#include <iostream> +#include <ostream> + +static volatile int Sink; +static volatile int *NullPtr; + +// A modified jenkins_one_at_a_time_hash initialized by non-zero, +// so that simple_hash(0) != 0. See also +// https://en.wikipedia.org/wiki/Jenkins_hash_function +static uint32_t simple_hash(const uint8_t *Data, size_t Size) { + uint32_t Hash = 0x12039854; + for (uint32_t i = 0; i < Size; i++) { + Hash += Data[i]; + Hash += (Hash << 10); + Hash ^= (Hash >> 6); + } + Hash += (Hash << 3); + Hash ^= (Hash >> 11); + Hash += (Hash << 15); + return Hash; +} + +// Don't leave the string in the binary, so that fuzzer don't cheat; +// const char *ABC = "ABCDEFGHIJ"; +// static uint32_t ExpectedHash = simple_hash((const uint8_t *)ABC, 10); +static const uint32_t ExpectedHash = 0xe1677acb; + +extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) { + // fprintf(stderr, "ExpectedHash: %x\n", ExpectedHash); + if (Size != 10) return 0; + if (*Data == 'A') + Sink++; + if (*Data == 'Z') + Sink--; + if (ExpectedHash == simple_hash(Data, Size)) + *NullPtr = 0; + return 0; +} + diff --git a/compiler-rt/test/fuzzer/cross_over.test b/compiler-rt/test/fuzzer/cross_over.test new file mode 100644 index 00000000000..4641cd428b9 --- /dev/null +++ b/compiler-rt/test/fuzzer/cross_over.test @@ -0,0 +1,14 @@ +# Tests CrossOverTest. +# We want to make sure that the test can find the input +# ABCDEFGHIJ when given two other inputs in the seed corpus: +# ABCDE00000 and +# ZZZZZFGHIJ +# +RUN: %cpp_compiler %S/CrossOverTest.cpp -o %t-CrossOverTest + +RUN: rm -rf %t-corpus +RUN: mkdir %t-corpus +RUN: echo -n ABCDE00000 > %t-corpus/A +RUN: echo -n ZZZZZFGHIJ > %t-corpus/B + +RUN: not %run %t-CrossOverTest -max_len=10 -seed=1 -runs=10000000 %t-corpus |

