#include "ndpi_api.h"

#include "fuzz_common_code.h"

#include <stdint.h>

#include <stdio.h>

#include <assert.h>

#include "fuzzer/FuzzedDataProvider.h"

extern "C" void cleanup_func(ndpi_str_hash *h) {

  /* Nothing to do */

  return;

}

extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) {

  FuzzedDataProvider fuzzed_data(data, size);

  u_int16_t i, rc, num_iteration, data_len, is_added = 0;

  std::vector<char>value_added;

  void *value;

  ndpi_str_hash *h = NULL;

  /* Just to have some data */

  if (fuzzed_data.remaining_bytes() < 1024)

    return -1;

  /* To allow memory allocation failures */

  fuzz_set_alloc_callbacks_and_seed(size);

  if (fuzzed_data.ConsumeBool())

    ndpi_hash_init(&h);

  else

    ndpi_hash_init(NULL);

  num_iteration = fuzzed_data.ConsumeIntegral<u_int8_t>();

  for (i = 0; i < num_iteration; i++) {

    data_len = fuzzed_data.ConsumeIntegralInRange(0, 127);

    std::vector<char>data = fuzzed_data.ConsumeBytes<char>(data_len);

    rc = ndpi_hash_add_entry(&h, data.data(), data.size(), &i);

    /* Keep one random entry really added */

    if (rc == 0 && fuzzed_data.ConsumeBool()) {

      value_added = data;

      is_added = 1;

    }

  }

  /* "Random" search */

  num_iteration = fuzzed_data.ConsumeIntegral<u_int8_t>();

  for (i = 0; i < num_iteration; i++) {

    data_len = fuzzed_data.ConsumeIntegralInRange(0, 127);

    std::vector<char>data = fuzzed_data.ConsumeBytes<char>(data_len);

    ndpi_hash_find_entry(h, data.data(), data.size(), &value);

  }

  /* Search of an added entry */

  if (is_added) {

    ndpi_hash_find_entry(h, value_added.data(), value_added.size(), &value);

  }

  if (fuzzed_data.ConsumeBool())

    ndpi_hash_free(NULL, cleanup_func);

  ndpi_hash_free(&h, cleanup_func);

  return 0;

}