1 // This test computes a checksum of the data (all but the last 4 bytes),
2 // and then compares the last 4 bytes with the computed value.
3 // A fuzzer with cmp traces is expected to defeat this check.
9 // A modified jenkins_one_at_a_time_hash initialized by non-zero,
10 // so that simple_hash(0) != 0. See also
11 // https://en.wikipedia.org/wiki/Jenkins_hash_function
12 static uint32_t simple_hash(const uint8_t *Data, size_t Size) {
13 uint32_t Hash = 0x12039854;
14 for (uint32_t i = 0; i < Size; i++) {
25 extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
29 uint32_t Hash = simple_hash(&Data[0], Size - 4);
30 uint32_t Want = reinterpret_cast<const uint32_t *>(&Data[Size - 4])[0];
33 fprintf(stderr, "BINGO; simple_hash defeated: %x == %x\n", (unsigned int)Hash,