1*2946cd70SChandler Carruth // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
2*2946cd70SChandler Carruth // See https://llvm.org/LICENSE.txt for license information.
3*2946cd70SChandler Carruth // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
410ab2aceSGeorge Karpenkov 
510ab2aceSGeorge Karpenkov // This test computes a checksum of the data (all but the last 4 bytes),
610ab2aceSGeorge Karpenkov // and then compares the last 4 bytes with the computed value.
710ab2aceSGeorge Karpenkov // A fuzzer with cmp traces is expected to defeat this check.
810ab2aceSGeorge Karpenkov #include <cstdint>
910ab2aceSGeorge Karpenkov #include <cstdio>
1010ab2aceSGeorge Karpenkov #include <cstdlib>
1110ab2aceSGeorge Karpenkov #include <cstring>
1210ab2aceSGeorge Karpenkov 
1310ab2aceSGeorge Karpenkov // A modified jenkins_one_at_a_time_hash initialized by non-zero,
1410ab2aceSGeorge Karpenkov // so that simple_hash(0) != 0. See also
1510ab2aceSGeorge Karpenkov // https://en.wikipedia.org/wiki/Jenkins_hash_function
simple_hash(const uint8_t * Data,size_t Size)1610ab2aceSGeorge Karpenkov static uint32_t simple_hash(const uint8_t *Data, size_t Size) {
1710ab2aceSGeorge Karpenkov   uint32_t Hash = 0x12039854;
1810ab2aceSGeorge Karpenkov   for (uint32_t i = 0; i < Size; i++) {
1910ab2aceSGeorge Karpenkov     Hash += Data[i];
2010ab2aceSGeorge Karpenkov     Hash += (Hash << 10);
2110ab2aceSGeorge Karpenkov     Hash ^= (Hash >> 6);
2210ab2aceSGeorge Karpenkov   }
2310ab2aceSGeorge Karpenkov   Hash += (Hash << 3);
2410ab2aceSGeorge Karpenkov   Hash ^= (Hash >> 11);
2510ab2aceSGeorge Karpenkov   Hash += (Hash << 15);
2610ab2aceSGeorge Karpenkov   return Hash;
2710ab2aceSGeorge Karpenkov }
2810ab2aceSGeorge Karpenkov 
LLVMFuzzerTestOneInput(const uint8_t * Data,size_t Size)2910ab2aceSGeorge Karpenkov extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
3010ab2aceSGeorge Karpenkov   if (Size < 14)
3110ab2aceSGeorge Karpenkov     return 0;
3210ab2aceSGeorge Karpenkov 
3310ab2aceSGeorge Karpenkov   uint32_t Hash = simple_hash(&Data[0], Size - 4);
3410ab2aceSGeorge Karpenkov   uint32_t Want = reinterpret_cast<const uint32_t *>(&Data[Size - 4])[0];
3510ab2aceSGeorge Karpenkov   if (Hash != Want)
3610ab2aceSGeorge Karpenkov     return 0;
3710ab2aceSGeorge Karpenkov   fprintf(stderr, "BINGO; simple_hash defeated: %x == %x\n", (unsigned int)Hash,
3810ab2aceSGeorge Karpenkov           (unsigned int)Want);
3910ab2aceSGeorge Karpenkov   exit(1);
4010ab2aceSGeorge Karpenkov   return 0;
4110ab2aceSGeorge Karpenkov }
42