Coverage Report

Created: 2025-11-20 06:48

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/ndpi/fuzz/fuzz_alg_bins.cpp
Line
Count
Source
1
#include "ndpi_api.h"
2
#include "fuzz_common_code.h"
3
4
#include <stdint.h>
5
#include <stdio.h>
6
#include "fuzzer/FuzzedDataProvider.h"
7
8
563
extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) {
9
563
  FuzzedDataProvider fuzzed_data(data, size);
10
563
  u_int16_t j, i, num_iteration;
11
563
  struct ndpi_bin *b, *b_cloned, *bins, b2;
12
563
  u_int16_t num_bins, num_cluster_ids, num_element, num_allocated_bins, rc;
13
563
  enum ndpi_bin_family family;
14
563
  u_int16_t *cluster_ids;
15
563
  char buf[128];
16
17
  /* Just to have some data */
18
563
  if(fuzzed_data.remaining_bytes() < 2048)
19
20
    return -1;
20
21
  /* To allow memory allocation failures */
22
543
  fuzz_set_alloc_callbacks_and_seed(size);
23
24
543
  b = (struct ndpi_bin *)ndpi_malloc(sizeof(struct ndpi_bin));
25
26
543
  num_bins = fuzzed_data.ConsumeIntegral<u_int16_t>();
27
543
  family = fuzzed_data.ConsumeEnum<enum ndpi_bin_family>();
28
29
543
  ndpi_init_bin(b, family, num_bins);
30
543
  ndpi_init_bin(&b2, family, num_bins * 2);
31
32
543
  num_iteration = fuzzed_data.ConsumeIntegral<u_int8_t>();
33
30.1k
  for (i = 0; i < num_iteration; i++) {
34
29.6k
    ndpi_inc_bin(b, fuzzed_data.ConsumeIntegral<u_int16_t>(),
35
29.6k
                 fuzzed_data.ConsumeIntegral<u_int64_t>());
36
29.6k
    ndpi_inc_bin(&b2, fuzzed_data.ConsumeIntegral<u_int16_t>(),
37
29.6k
                 fuzzed_data.ConsumeIntegral<u_int64_t>());
38
29.6k
  }
39
40
543
  ndpi_bin_similarity(b, &b2, fuzzed_data.ConsumeBool(),
41
543
                      fuzzed_data.ConsumeFloatingPointInRange<float>(0, 1));
42
43
543
  b_cloned = ndpi_clone_bin(b);
44
45
543
  ndpi_bin_similarity(b, b_cloned, fuzzed_data.ConsumeBool(),
46
543
                      fuzzed_data.ConsumeFloatingPointInRange<float>(0, 1));
47
48
30.1k
  for (i = 0; i < num_iteration; i++)
49
29.6k
    ndpi_get_bin_value(b, fuzzed_data.ConsumeIntegral<u_int16_t>());
50
51
543
  ndpi_reset_bin(b);
52
53
30.1k
  for (i = 0; i < num_iteration; i++)
54
29.6k
    ndpi_get_bin_value(b, fuzzed_data.ConsumeIntegral<u_int16_t>());
55
56
30.1k
  for (i = 0; i < num_iteration; i++)
57
29.6k
    ndpi_set_bin(b_cloned, fuzzed_data.ConsumeIntegral<u_int16_t>(),
58
29.6k
                 fuzzed_data.ConsumeIntegral<u_int64_t>());
59
60
543
  ndpi_bin_similarity(b, b_cloned, fuzzed_data.ConsumeBool(),
61
543
                      fuzzed_data.ConsumeFloatingPointInRange<float>(0, 1));
62
63
543
  ndpi_normalize_bin(b);
64
543
  ndpi_normalize_bin(b_cloned);
65
66
543
  ndpi_print_bin(b, fuzzed_data.ConsumeBool(), buf, sizeof(buf));
67
68
543
  ndpi_free_bin(b);
69
543
  ndpi_free(b);
70
543
  ndpi_free_bin(&b2);
71
543
  ndpi_free_bin(b_cloned);
72
543
  ndpi_free(b_cloned);
73
74
  /* Cluster */
75
76
543
  num_bins = fuzzed_data.ConsumeIntegral<u_int8_t>();
77
543
  num_element = fuzzed_data.ConsumeIntegral<u_int8_t>();
78
543
  num_cluster_ids = fuzzed_data.ConsumeIntegral<u_int16_t>();
79
543
  bins = (struct ndpi_bin *)ndpi_malloc(sizeof(struct ndpi_bin) * num_bins);
80
543
  cluster_ids = (u_int16_t *)ndpi_malloc(sizeof(u_int16_t) * num_bins);
81
82
543
  num_allocated_bins = 0;
83
543
  if (bins && cluster_ids) {
84
36.1k
    for (i = 0; i < num_bins; i++) {
85
35.6k
      rc = ndpi_init_bin(&bins[num_allocated_bins], ndpi_bin_family64 /* Use 64 bit to avoid overlaps */,
86
35.6k
                         num_element);
87
35.6k
      if (rc != 0) {
88
1.95k
        continue;
89
1.95k
      }
90
33.7k
      num_iteration = fuzzed_data.ConsumeIntegral<u_int8_t>();
91
817k
      for (j = 0; j < num_iteration; j++) {
92
783k
        ndpi_set_bin(&bins[num_allocated_bins],
93
783k
                     fuzzed_data.ConsumeIntegralInRange(0, num_element + 1),
94
783k
                     fuzzed_data.ConsumeIntegral<u_int64_t>());
95
783k
      }
96
33.7k
      num_allocated_bins++;
97
33.7k
    }
98
500
    ndpi_cluster_bins(bins, num_allocated_bins, num_cluster_ids, cluster_ids, NULL);
99
500
  }
100
101
543
  ndpi_free(cluster_ids);
102
543
  if (bins)
103
34.2k
    for (i = 0; i < num_allocated_bins; i++)
104
33.7k
      ndpi_free_bin(&bins[i]);
105
543
  ndpi_free(bins);
106
107
543
  return 0;
108
563
}