Coverage Report

Created: 2026-09-14 06:58

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/immer/extra/fuzzer/fuzzer_input.hpp
Line
Count
Source
1
//
2
// immer: immutable data structures for C++
3
// Copyright (C) 2016, 2017, 2018 Juan Pedro Bolivar Puente
4
//
5
// This software is distributed under the Boost Software License, Version 1.0.
6
// See accompanying file LICENSE or copy at http://boost.org/LICENSE_1_0.txt
7
//
8
9
#pragma once
10
11
#include <cstdint>
12
#include <memory>
13
#include <stdexcept>
14
15
#if defined(__GNUC__) && (__GNUC__ == 9 || __GNUC__ == 8 || __GNUC__ == 10)
16
#define IMMER_DISABLE_FUZZER_DUE_TO_GCC_BUG 1
17
#endif
18
19
struct no_more_input : std::exception
20
{};
21
22
constexpr auto fuzzer_input_max_size = 1 << 16;
23
24
struct fuzzer_input
25
{
26
    const std::uint8_t* data_;
27
    std::size_t size_;
28
29
    const std::uint8_t* next(std::size_t size)
30
8.18M
    {
31
8.18M
        if (size_ < size)
32
0
            throw no_more_input{};
33
8.18M
        auto r = data_;
34
8.18M
        data_ += size;
35
8.18M
        size_ -= size;
36
8.18M
        return r;
37
8.18M
    }
38
39
    const std::uint8_t* next(std::size_t size, std::size_t align)
40
8.19M
    {
41
8.19M
        auto& p = const_cast<void*&>(reinterpret_cast<const void*&>(data_));
42
8.19M
        auto r  = std::align(align, size, p, size_);
43
8.19M
        if (r == nullptr)
44
8.99k
            throw no_more_input{};
45
8.18M
        return next(size);
46
8.19M
    }
47
48
    template <typename Fn>
49
    int run(Fn step)
50
8.99k
    {
51
8.99k
        if (size_ > fuzzer_input_max_size)
52
8
            return 0;
53
8.99k
        try {
54
2.05M
            while (step(*this))
55
2.04M
                continue;
56
8.99k
        } catch (const no_more_input&) {
57
8.99k
        };
58
8.99k
        return 0;
59
8.99k
    }
60
};
61
62
template <typename T>
63
const T& read(fuzzer_input& fz)
64
8.19M
{
65
8.19M
    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
66
8.19M
}
char const& read<char>(fuzzer_input&)
Line
Count
Source
64
7.80M
{
65
7.80M
    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
66
7.80M
}
unsigned char const& read<unsigned char>(fuzzer_input&)
Line
Count
Source
64
390k
{
65
390k
    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
66
390k
}
67
68
template <typename T, typename Cond>
69
T read(fuzzer_input& fz, Cond cond)
70
5.64M
{
71
5.64M
    auto x = read<T>(fz);
72
6.14M
    while (!cond(x))
73
501k
        x = read<T>(fz);
74
5.64M
    return x;
75
5.64M
}
flex-vector.cpp:char read<char, LLVMFuzzerTestOneInput::$_0>(fuzzer_input&, LLVMFuzzerTestOneInput::$_0)
Line
Count
Source
70
5.06M
{
71
5.06M
    auto x = read<T>(fz);
72
5.42M
    while (!cond(x))
73
354k
        x = read<T>(fz);
74
5.06M
    return x;
75
5.06M
}
flex-vector.cpp:unsigned char read<unsigned char, LLVMFuzzerTestOneInput::$_2::operator()<immer::flex_vector<int, immer::memory_policy<immer::free_list_heap_policy<immer::cpp_heap, 1024ul>, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u> >(immer::flex_vector<int, immer::memory_policy<immer::free_list_heap_policy<immer::cpp_heap, 1024ul>, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u>&) const::{lambda(auto:1)#1}>(fuzzer_input&, LLVMFuzzerTestOneInput::$_2::operator()<immer::flex_vector<int, immer::memory_policy<immer::free_list_heap_policy<immer::cpp_heap, 1024ul>, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u> >(immer::flex_vector<int, immer::memory_policy<immer::free_list_heap_policy<immer::cpp_heap, 1024ul>, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u>&) const::{lambda(auto:1)#1})
Line
Count
Source
70
182k
{
71
182k
    auto x = read<T>(fz);
72
273k
    while (!cond(x))
73
91.4k
        x = read<T>(fz);
74
182k
    return x;
75
182k
}
flex-vector.cpp:unsigned char read<unsigned char, LLVMFuzzerTestOneInput::$_3::operator()<immer::flex_vector<int, immer::memory_policy<immer::free_list_heap_policy<immer::cpp_heap, 1024ul>, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u> >(immer::flex_vector<int, immer::memory_policy<immer::free_list_heap_policy<immer::cpp_heap, 1024ul>, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u>&) const::{lambda(auto:1)#1}>(fuzzer_input&, LLVMFuzzerTestOneInput::$_3::operator()<immer::flex_vector<int, immer::memory_policy<immer::free_list_heap_policy<immer::cpp_heap, 1024ul>, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u> >(immer::flex_vector<int, immer::memory_policy<immer::free_list_heap_policy<immer::cpp_heap, 1024ul>, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u>&) const::{lambda(auto:1)#1})
Line
Count
Source
70
106k
{
71
106k
    auto x = read<T>(fz);
72
117k
    while (!cond(x))
73
10.5k
        x = read<T>(fz);
74
106k
    return x;
75
106k
}
flex-vector.cpp:char read<char, LLVMFuzzerTestOneInput::$_1::operator()<char>(char) const::{lambda(auto:1)#1}>(fuzzer_input&, LLVMFuzzerTestOneInput::$_1::operator()<char>(char) const::{lambda(auto:1)#1})
Line
Count
Source
70
286k
{
71
286k
    auto x = read<T>(fz);
72
331k
    while (!cond(x))
73
44.8k
        x = read<T>(fz);
74
286k
    return x;
75
286k
}