Coverage Report

Created: 2026-01-22 06:46

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
1.44M
    {
31
1.44M
        if (size_ < size)
32
0
            throw no_more_input{};
33
1.44M
        auto r = data_;
34
1.44M
        data_ += size;
35
1.44M
        size_ -= size;
36
1.44M
        return r;
37
1.44M
    }
38
39
    const std::uint8_t* next(std::size_t size, std::size_t align)
40
1.44M
    {
41
1.44M
        auto& p = const_cast<void*&>(reinterpret_cast<const void*&>(data_));
42
1.44M
        auto r  = std::align(align, size, p, size_);
43
1.44M
        if (r == nullptr)
44
617
            throw no_more_input{};
45
1.44M
        return next(size);
46
1.44M
    }
47
48
    template <typename Fn>
49
    int run(Fn step)
50
623
    {
51
623
        if (size_ > fuzzer_input_max_size)
52
6
            return 0;
53
617
        try {
54
348k
            while (step(*this))
55
347k
                continue;
56
617
        } catch (const no_more_input&) {
57
617
        };
58
617
        return 0;
59
617
    }
60
};
61
62
template <typename T>
63
const T& read(fuzzer_input& fz)
64
1.44M
{
65
1.44M
    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
66
1.44M
}
char const& read<char>(fuzzer_input&)
Line
Count
Source
64
1.25M
{
65
1.25M
    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
66
1.25M
}
unsigned char const& read<unsigned char>(fuzzer_input&)
Line
Count
Source
64
183k
{
65
183k
    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
66
183k
}
67
68
template <typename T, typename Cond>
69
T read(fuzzer_input& fz, Cond cond)
70
713k
{
71
713k
    auto x = read<T>(fz);
72
1.09M
    while (!cond(x))
73
381k
        x = read<T>(fz);
74
713k
    return x;
75
713k
}
array.cpp:char read<char, LLVMFuzzerTestOneInput::$_0>(fuzzer_input&, LLVMFuzzerTestOneInput::$_0)
Line
Count
Source
70
695k
{
71
695k
    auto x = read<T>(fz);
72
911k
    while (!cond(x))
73
215k
        x = read<T>(fz);
74
695k
    return x;
75
695k
}
array.cpp:unsigned char read<unsigned char, LLVMFuzzerTestOneInput::$_1::operator()<immer::array<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> > >(immer::array<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> >&) const::{lambda(auto:1)#1}>(fuzzer_input&, LLVMFuzzerTestOneInput::$_1::operator()<immer::array<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> > >(immer::array<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> >&) const::{lambda(auto:1)#1})
Line
Count
Source
70
9.45k
{
71
9.45k
    auto x = read<T>(fz);
72
168k
    while (!cond(x))
73
158k
        x = read<T>(fz);
74
9.45k
    return x;
75
9.45k
}
array.cpp:unsigned char read<unsigned char, LLVMFuzzerTestOneInput::$_2::operator()<immer::array<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> > >(immer::array<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> >&) const::{lambda(auto:1)#1}>(fuzzer_input&, LLVMFuzzerTestOneInput::$_2::operator()<immer::array<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> > >(immer::array<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> >&) const::{lambda(auto:1)#1})
Line
Count
Source
70
8.14k
{
71
8.14k
    auto x = read<T>(fz);
72
14.9k
    while (!cond(x))
73
6.78k
        x = read<T>(fz);
74
8.14k
    return x;
75
8.14k
}