Warning:
The number of runtime covered functions are larger than the
number of reachable functions. This means that Fuzz Introspector found
there are more functions covered at runtime than what is considered
reachable based on the static analysis. This is a limitation in the
analysis as anything covered at runtime is by definition reachable by the
fuzzers.
This is likely due to a limitation in the static analysis. In this case, the
count of functions covered at runtime is the true value, which means this
is what should be considered "achieved" by the fuzzer.
Use the project functions table below to query all functions that were not covered at runtime.
The following table shows data about each function in the project. The functions included in this table correspond to all functions that exist in the executables of the fuzzers. As such, there may be functions that are from third-party libraries.
For further technical details on the meaning of columns in the below table, please see the Glossary .
Func name | Functions filename | Args | Function call depth | Reached by Fuzzers | Fuzzers runtime hit | Func lines hit % | I Count | BB Count | Cyclomatic complexity | Functions reached | Reached by functions | Accumulated cyclomatic complexity | Undiscovered complexity |
---|
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 64 | 49.6% |
gold | [1:9] | 0 | 0.0% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 65 | 50.3% |
All colors | 129 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/array.cpp | 8 |
/src/immer/immer/array.hpp | 13 |
/src/immer/immer/detail/arrays/with_capacity.hpp | 16 |
/src/immer/immer/detail/arrays/node.hpp | 8 |
/src/immer/immer/heap/debug_size_heap.hpp | 2 |
/src/immer/immer/heap/cpp_heap.hpp | 2 |
/src/immer/immer/detail/combine_standard_layout.hpp | 4 |
/src/immer/immer/refcount/refcount_policy.hpp | 3 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 7 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/detail/util.hpp | 2 |
/src/immer/immer/transience/no_transience_policy.hpp | 1 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 91 | 48.6% |
gold | [1:9] | 0 | 0.0% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 96 | 51.3% |
All colors | 187 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/array-gc.cpp | 10 |
/src/immer/extra/fuzzer/fuzzer_gc_guard.hpp | 2 |
/src/immer/immer/array.hpp | 8 |
/src/immer/immer/detail/arrays/no_capacity.hpp | 10 |
/src/immer/immer/detail/arrays/node.hpp | 8 |
/src/immer/immer/heap/gc_heap.hpp | 3 |
/src/immer/immer/detail/combine_standard_layout.hpp | 5 |
/src/immer/immer/refcount/no_refcount_policy.hpp | 4 |
/src/immer/immer/transience/gc_transience_policy.hpp | 7 |
/src/immer/immer/array_transient.hpp | 8 |
/src/immer/immer/detail/arrays/with_capacity.hpp | 15 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 10 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/detail/util.hpp | 2 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 146 | 36.1% |
gold | [1:9] | 1 | 0.24% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 257 | 63.6% |
All colors | 404 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/set-gc.cpp | 5 |
/src/immer/extra/fuzzer/fuzzer_gc_guard.hpp | 2 |
/src/immer/immer/set.hpp | 11 |
/src/immer/immer/detail/hamts/champ.hpp | 16 |
/src/immer/immer/detail/hamts/node.hpp | 48 |
/src/immer/immer/detail/combine_standard_layout.hpp | 7 |
/src/immer/immer/refcount/no_refcount_policy.hpp | 3 |
/src/immer/immer/transience/gc_transience_policy.hpp | 2 |
/src/immer/immer/detail/util.hpp | 3 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 6 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/heap/gc_heap.hpp | 2 |
/src/immer/immer/detail/hamts/bits.hpp | 1 |
/src/immer/immer/algorithm.hpp | 5 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 134 | 26.0% |
gold | [1:9] | 1 | 0.19% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 380 | 73.7% |
All colors | 515 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/set.cpp | 4 |
/src/immer/immer/set.hpp | 9 |
/src/immer/immer/detail/hamts/champ.hpp | 16 |
/src/immer/immer/detail/hamts/node.hpp | 57 |
/src/immer/immer/detail/combine_standard_layout.hpp | 10 |
/src/immer/immer/refcount/refcount_policy.hpp | 4 |
/src/immer/immer/detail/util.hpp | 4 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 7 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/heap/debug_size_heap.hpp | 2 |
/src/immer/immer/heap/cpp_heap.hpp | 2 |
/src/immer/immer/detail/hamts/bits.hpp | 1 |
/src/immer/immer/transience/no_transience_policy.hpp | 2 |
/src/immer/immer/detail/hamts/champ_iterator.hpp | 5 |
/src/immer/immer/detail/iterator_facade.hpp | 2 |
/src/immer/immer/algorithm.hpp | 2 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 165 | 24.7% |
gold | [1:9] | 1 | 0.15% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 500 | 75.0% |
All colors | 666 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/set-st.cpp | 4 |
/src/immer/immer/set.hpp | 11 |
/src/immer/immer/detail/hamts/champ.hpp | 22 |
/src/immer/immer/detail/hamts/node.hpp | 61 |
/src/immer/immer/detail/combine_standard_layout.hpp | 10 |
/src/immer/immer/refcount/unsafe_refcount_policy.hpp | 4 |
/src/immer/immer/detail/util.hpp | 5 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 7 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/heap/cpp_heap.hpp | 2 |
/src/immer/immer/detail/hamts/bits.hpp | 1 |
/src/immer/immer/transience/no_transience_policy.hpp | 2 |
/src/immer/immer/detail/hamts/champ_iterator.hpp | 5 |
/src/immer/immer/detail/iterator_facade.hpp | 2 |
/src/immer/immer/algorithm.hpp | 2 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 256 | 32.4% |
gold | [1:9] | 1 | 0.12% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 532 | 67.4% |
All colors | 789 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
48 | 80 |
7 :
['std::__1::basic_string
|
48 | 118 |
immer::detail::hamts::champ
|
call site: 00000 | /src/immer/immer/detail/hamts/champ.hpp:1452 |
48 | 56 |
4 :
['std::__1::basic_string
|
48 | 62 |
immer::detail::hamts::champ
|
call site: 00000 | /src/immer/immer/detail/hamts/champ.hpp:1265 |
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
0 | 15 |
1 :
['immer::detail::hamts::node
|
0 | 15 |
immer::detail::hamts::node
|
call site: 00000 | /src/immer/immer/detail/hamts/node.hpp:389 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/set-st-str-conflict.cpp | 4 |
/src/immer/immer/set.hpp | 12 |
/src/immer/immer/detail/hamts/champ.hpp | 24 |
/src/immer/immer/detail/hamts/node.hpp | 61 |
/src/immer/immer/detail/combine_standard_layout.hpp | 10 |
/src/immer/immer/refcount/unsafe_refcount_policy.hpp | 4 |
/src/immer/immer/detail/util.hpp | 6 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 7 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/heap/cpp_heap.hpp | 2 |
/src/immer/immer/detail/hamts/bits.hpp | 2 |
/src/immer/immer/transience/no_transience_policy.hpp | 2 |
/src/immer/immer/detail/hamts/champ_iterator.hpp | 5 |
/src/immer/immer/detail/iterator_facade.hpp | 2 |
/src/immer/immer/algorithm.hpp | 2 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 113 | 35.2% |
gold | [1:9] | 0 | 0.0% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 208 | 64.7% |
All colors | 321 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
0 | 29 |
1 :
['void immer::detail::rbts::regular_pos
|
16 | 63 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1010 |
0 | 29 |
1 :
['void immer::detail::rbts::regular_pos
|
16 | 57 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1033 |
0 | 17 |
1 :
['void immer::detail::rbts::full_pos
|
16 | 51 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1010 |
0 | 17 |
1 :
['void immer::detail::rbts::full_pos
|
16 | 51 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1010 |
0 | 17 |
1 :
['void immer::detail::rbts::full_pos
|
16 | 45 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1033 |
0 | 17 |
1 :
['void immer::detail::rbts::full_pos
|
16 | 45 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1033 |
0 | 8 |
2 :
['immer::detail::rbts::node
|
0 | 8 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1067 |
0 | 8 |
2 :
['immer::detail::rbts::node
|
0 | 8 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1067 |
0 | 8 |
2 :
['immer::detail::rbts::node
|
0 | 8 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1067 |
0 | 8 |
2 :
['immer::detail::rbts::node
|
0 | 8 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1067 |
0 | 0 |
2 :
['std::__1::tuple
|
16 | 95 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1021 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/vector-st.cpp | 7 |
/src/immer/immer/vector.hpp | 12 |
/src/immer/immer/detail/rbts/rbtree.hpp | 22 |
/src/immer/immer/detail/rbts/node.hpp | 30 |
/src/immer/immer/heap/cpp_heap.hpp | 2 |
/src/immer/immer/detail/combine_standard_layout.hpp | 8 |
/src/immer/immer/detail/util.hpp | 4 |
/src/immer/immer/refcount/unsafe_refcount_policy.hpp | 3 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 8 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/transience/no_transience_policy.hpp | 3 |
/src/immer/immer/detail/rbts/position.hpp | 21 |
/src/immer/immer/detail/rbts/operations.hpp | 5 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 251 | 45.2% |
gold | [1:9] | 1 | 0.18% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 303 | 54.5% |
All colors | 555 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/map-gc.cpp | 6 |
/src/immer/extra/fuzzer/fuzzer_gc_guard.hpp | 2 |
/src/immer/immer/map.hpp | 27 |
/src/immer/immer/detail/hamts/champ.hpp | 23 |
/src/immer/immer/detail/hamts/node.hpp | 46 |
/src/immer/immer/detail/combine_standard_layout.hpp | 7 |
/src/immer/immer/refcount/no_refcount_policy.hpp | 3 |
/src/immer/immer/transience/gc_transience_policy.hpp | 2 |
/src/immer/immer/detail/util.hpp | 6 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 6 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/heap/gc_heap.hpp | 2 |
/src/immer/immer/detail/hamts/bits.hpp | 1 |
/src/immer/immer/detail/hamts/champ_iterator.hpp | 5 |
/src/immer/immer/detail/iterator_facade.hpp | 2 |
/src/immer/immer/algorithm.hpp | 2 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 118 | 32.5% |
gold | [1:9] | 2 | 0.55% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 243 | 66.9% |
All colors | 363 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
0 | 29 |
1 :
['void immer::detail::rbts::regular_pos
|
16 | 63 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1010 |
0 | 29 |
1 :
['void immer::detail::rbts::regular_pos
|
16 | 57 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1033 |
0 | 17 |
1 :
['void immer::detail::rbts::full_pos
|
16 | 51 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1010 |
0 | 17 |
1 :
['void immer::detail::rbts::full_pos
|
16 | 51 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1010 |
0 | 17 |
1 :
['void immer::detail::rbts::full_pos
|
16 | 45 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1033 |
0 | 17 |
1 :
['void immer::detail::rbts::full_pos
|
16 | 45 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1033 |
0 | 8 |
2 :
['immer::detail::rbts::node
|
0 | 8 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1067 |
0 | 8 |
2 :
['immer::detail::rbts::node
|
0 | 8 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1067 |
0 | 8 |
2 :
['immer::detail::rbts::node
|
0 | 8 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1067 |
0 | 8 |
2 :
['immer::detail::rbts::node
|
0 | 8 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1067 |
0 | 6 |
1 :
['void immer::debug_size_heap
|
0 | 6 |
voidimmer::split_heap<56ul,immer::with_free_list_node
|
call site: 00000 | /src/immer/immer/heap/split_heap.hpp:34 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/vector.cpp | 7 |
/src/immer/immer/vector.hpp | 12 |
/src/immer/immer/detail/rbts/rbtree.hpp | 22 |
/src/immer/immer/detail/rbts/node.hpp | 30 |
/src/immer/immer/heap/split_heap.hpp | 2 |
/src/immer/immer/heap/with_data.hpp | 2 |
/src/immer/immer/heap/unsafe_free_list_heap.hpp | 3 |
/src/immer/immer/heap/thread_local_free_list_heap.hpp | 2 |
/src/immer/immer/heap/free_list_heap.hpp | 3 |
/src/immer/immer/heap/debug_size_heap.hpp | 2 |
/src/immer/immer/heap/cpp_heap.hpp | 2 |
/src/immer/immer/detail/combine_standard_layout.hpp | 8 |
/src/immer/immer/detail/util.hpp | 4 |
/src/immer/immer/refcount/refcount_policy.hpp | 3 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 7 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/transience/no_transience_policy.hpp | 3 |
/src/immer/immer/detail/rbts/position.hpp | 21 |
/src/immer/immer/detail/rbts/operations.hpp | 5 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 391 | 40.8% |
gold | [1:9] | 1 | 0.10% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 565 | 59.0% |
All colors | 957 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/map.cpp | 8 |
/src/immer/immer/map.hpp | 28 |
/src/immer/immer/detail/hamts/champ.hpp | 35 |
/src/immer/immer/detail/hamts/node.hpp | 65 |
/src/immer/immer/detail/combine_standard_layout.hpp | 10 |
/src/immer/immer/refcount/refcount_policy.hpp | 4 |
/src/immer/immer/detail/util.hpp | 8 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 7 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/heap/debug_size_heap.hpp | 2 |
/src/immer/immer/heap/cpp_heap.hpp | 2 |
/src/immer/immer/detail/hamts/bits.hpp | 1 |
/src/immer/immer/transience/no_transience_policy.hpp | 2 |
/src/immer/immer/detail/hamts/champ_iterator.hpp | 5 |
/src/immer/immer/detail/iterator_facade.hpp | 2 |
/src/immer/immer/algorithm.hpp | 2 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 348 | 44.1% |
gold | [1:9] | 1 | 0.12% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 439 | 55.7% |
All colors | 788 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
211 | 211 |
5 :
['immer::detail::hamts::node
|
211 | 269 |
immer::detail::hamts::champ
|
call site: 00000 | /src/immer/immer/detail/hamts/champ.hpp:648 |
153 | 153 |
5 :
['immer::detail::hamts::node
|
153 | 173 |
immer::detail::hamts::champ
|
call site: 00000 | /src/immer/immer/detail/hamts/champ.hpp:1354 |
153 | 153 |
4 :
['immer::detail::hamts::node
|
153 | 153 |
immer::detail::hamts::champ
|
call site: 00000 | /src/immer/immer/detail/hamts/champ.hpp:575 |
88 | 88 |
3 :
['immer::detail::hamts::node
|
88 | 94 |
immer::detail::hamts::champ
|
call site: 00000 | /src/immer/immer/detail/hamts/champ.hpp:1208 |
21 | 21 |
1 :
['immer::detail::hamts::node
|
21 | 21 |
immer::detail::hamts::node
|
call site: 00000 | /src/immer/immer/detail/hamts/node.hpp:1101 |
20 | 20 |
1 :
['immer::detail::hamts::node
|
20 | 32 |
immer::detail::hamts::node
|
call site: 00000 | /src/immer/immer/detail/hamts/node.hpp:1024 |
20 | 20 |
1 :
['immer::detail::hamts::node
|
20 | 20 |
immer::detail::hamts::node
|
call site: 00000 | /src/immer/immer/detail/hamts/node.hpp:995 |
12 | 12 |
2 :
['immer::detail::hamts::node
|
12 | 14 |
immer::detail::hamts::champ
|
call site: 00000 | /src/immer/immer/detail/hamts/champ.hpp:206 |
12 | 12 |
2 :
['immer::detail::hamts::node
|
12 | 12 |
immer::detail::hamts::champ_iterator
|
call site: 00000 | /src/immer/immer/detail/hamts/champ_iterator.hpp:91 |
12 | 12 |
2 :
['immer::detail::hamts::node
|
12 | 12 |
immer::detail::hamts::champ_iterator
|
call site: 00000 | /src/immer/immer/detail/hamts/champ_iterator.hpp:116 |
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
0 | 15 |
1 :
['immer::detail::hamts::node
|
0 | 15 |
immer::detail::hamts::node
|
call site: 00000 | /src/immer/immer/detail/hamts/node.hpp:389 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/set-st-str.cpp | 4 |
/src/immer/immer/set.hpp | 12 |
/src/immer/immer/detail/hamts/champ.hpp | 24 |
/src/immer/immer/detail/hamts/node.hpp | 61 |
/src/immer/immer/detail/combine_standard_layout.hpp | 10 |
/src/immer/immer/refcount/unsafe_refcount_policy.hpp | 4 |
/src/immer/immer/detail/util.hpp | 6 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 7 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/heap/cpp_heap.hpp | 2 |
/src/immer/immer/detail/hamts/bits.hpp | 1 |
/src/immer/immer/transience/no_transience_policy.hpp | 2 |
/src/immer/immer/detail/hamts/champ_iterator.hpp | 5 |
/src/immer/immer/detail/iterator_facade.hpp | 2 |
/src/immer/immer/algorithm.hpp | 2 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 147 | 40.3% |
gold | [1:9] | 0 | 0.0% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 217 | 59.6% |
All colors | 364 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
0 | 29 |
1 :
['void immer::detail::rbts::regular_pos
|
16 | 63 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1010 |
0 | 29 |
1 :
['void immer::detail::rbts::regular_pos
|
16 | 57 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1033 |
0 | 17 |
1 :
['void immer::detail::rbts::full_pos
|
16 | 51 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1010 |
0 | 17 |
1 :
['void immer::detail::rbts::full_pos
|
16 | 51 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1010 |
0 | 17 |
1 :
['void immer::detail::rbts::full_pos
|
16 | 45 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1033 |
0 | 17 |
1 :
['void immer::detail::rbts::full_pos
|
16 | 45 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1033 |
0 | 8 |
2 :
['std::__1::enable_if
|
0 | 8 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1067 |
0 | 8 |
2 :
['std::__1::enable_if
|
0 | 8 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1067 |
0 | 8 |
2 :
['std::__1::enable_if
|
0 | 8 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1067 |
0 | 8 |
2 :
['std::__1::enable_if
|
0 | 8 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1067 |
0 | 0 |
2 :
['std::__1::tuple
|
16 | 101 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1021 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/vector-gc.cpp | 9 |
/src/immer/extra/fuzzer/fuzzer_gc_guard.hpp | 2 |
/src/immer/immer/vector.hpp | 7 |
/src/immer/immer/detail/rbts/rbtree.hpp | 22 |
/src/immer/immer/detail/rbts/node.hpp | 32 |
/src/immer/immer/heap/gc_heap.hpp | 3 |
/src/immer/immer/detail/combine_standard_layout.hpp | 9 |
/src/immer/immer/detail/util.hpp | 4 |
/src/immer/immer/refcount/no_refcount_policy.hpp | 3 |
/src/immer/immer/vector_transient.hpp | 8 |
/src/immer/immer/transience/gc_transience_policy.hpp | 9 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 10 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/detail/rbts/position.hpp | 21 |
/src/immer/immer/detail/rbts/operations.hpp | 5 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 315 | 35.8% |
gold | [1:9] | 1 | 0.11% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 563 | 64.0% |
All colors | 879 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/map-st.cpp | 6 |
/src/immer/immer/map.hpp | 25 |
/src/immer/immer/detail/hamts/champ.hpp | 30 |
/src/immer/immer/detail/hamts/node.hpp | 65 |
/src/immer/immer/detail/combine_standard_layout.hpp | 10 |
/src/immer/immer/refcount/unsafe_refcount_policy.hpp | 4 |
/src/immer/immer/detail/util.hpp | 8 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 7 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/heap/cpp_heap.hpp | 2 |
/src/immer/immer/detail/hamts/bits.hpp | 1 |
/src/immer/immer/transience/no_transience_policy.hpp | 2 |
/src/immer/immer/detail/hamts/champ_iterator.hpp | 5 |
/src/immer/immer/detail/iterator_facade.hpp | 2 |
/src/immer/immer/algorithm.hpp | 2 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 451 | 42.2% |
gold | [1:9] | 1 | 0.09% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 616 | 57.6% |
All colors | 1068 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
56 | 88 |
7 :
['immer::detail::hamts::node
|
56 | 126 |
immer::detail::hamts::champ
|
call site: 00000 | /src/immer/immer/detail/hamts/champ.hpp:1452 |
56 | 64 |
4 :
['std::__1::pair
|
56 | 70 |
immer::detail::hamts::champ
|
call site: 00000 | /src/immer/immer/detail/hamts/champ.hpp:1265 |
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
0 | 15 |
1 :
['immer::detail::hamts::node
|
0 | 15 |
immer::detail::hamts::node
|
call site: 00000 | /src/immer/immer/detail/hamts/node.hpp:389 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/map-st-str-conflict.cpp | 6 |
/src/immer/immer/map.hpp | 25 |
/src/immer/immer/detail/hamts/champ.hpp | 32 |
/src/immer/immer/detail/hamts/node.hpp | 66 |
/src/immer/immer/detail/combine_standard_layout.hpp | 10 |
/src/immer/immer/refcount/unsafe_refcount_policy.hpp | 4 |
/src/immer/immer/detail/util.hpp | 10 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 7 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/box.hpp | 8 |
/src/immer/immer/heap/debug_size_heap.hpp | 2 |
/src/immer/immer/heap/cpp_heap.hpp | 2 |
/src/immer/immer/refcount/refcount_policy.hpp | 2 |
/src/immer/immer/detail/hamts/bits.hpp | 2 |
/src/immer/immer/transience/no_transience_policy.hpp | 2 |
/src/immer/immer/detail/hamts/champ_iterator.hpp | 5 |
/src/immer/immer/detail/iterator_facade.hpp | 2 |
/src/immer/immer/algorithm.hpp | 2 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 555 | 52.0% |
gold | [1:9] | 1 | 0.09% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 511 | 47.8% |
All colors | 1067 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
226 | 226 |
5 :
['immer::detail::hamts::node
|
226 | 286 |
immer::detail::hamts::champ
|
call site: 00000 | /src/immer/immer/detail/hamts/champ.hpp:648 |
190 | 190 |
5 :
['immer::detail::hamts::node
|
190 | 212 |
immer::detail::hamts::champ
|
call site: 00000 | /src/immer/immer/detail/hamts/champ.hpp:1354 |
155 | 155 |
4 :
['immer::detail::hamts::node
|
155 | 157 |
immer::detail::hamts::champ
|
call site: 00000 | /src/immer/immer/detail/hamts/champ.hpp:575 |
88 | 88 |
3 :
['immer::detail::hamts::node
|
88 | 96 |
immer::detail::hamts::champ
|
call site: 00000 | /src/immer/immer/detail/hamts/champ.hpp:1208 |
41 | 41 |
1 :
['immer::detail::hamts::node
|
41 | 53 |
immer::detail::hamts::node
|
call site: 00000 | /src/immer/immer/detail/hamts/node.hpp:1024 |
41 | 41 |
1 :
['immer::detail::hamts::node
|
41 | 41 |
immer::detail::hamts::node
|
call site: 00000 | /src/immer/immer/detail/hamts/node.hpp:995 |
21 | 21 |
1 :
['immer::detail::hamts::node
|
21 | 21 |
immer::detail::hamts::node
|
call site: 00000 | /src/immer/immer/detail/hamts/node.hpp:1101 |
12 | 12 |
2 :
['immer::detail::hamts::node
|
12 | 16 |
immer::detail::hamts::champ
|
call site: 00000 | /src/immer/immer/detail/hamts/champ.hpp:206 |
12 | 12 |
2 :
['immer::detail::hamts::node
|
12 | 12 |
immer::detail::hamts::champ_iterator
|
call site: 00000 | /src/immer/immer/detail/hamts/champ_iterator.hpp:91 |
12 | 12 |
2 :
['immer::detail::hamts::node
|
12 | 12 |
immer::detail::hamts::champ_iterator
|
call site: 00000 | /src/immer/immer/detail/hamts/champ_iterator.hpp:116 |
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
0 | 15 |
1 :
['immer::detail::hamts::node
|
0 | 15 |
immer::detail::hamts::node
|
call site: 00000 | /src/immer/immer/detail/hamts/node.hpp:389 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/map-st-str.cpp | 6 |
/src/immer/immer/map.hpp | 25 |
/src/immer/immer/detail/hamts/champ.hpp | 32 |
/src/immer/immer/detail/hamts/node.hpp | 66 |
/src/immer/immer/detail/combine_standard_layout.hpp | 10 |
/src/immer/immer/refcount/unsafe_refcount_policy.hpp | 4 |
/src/immer/immer/detail/util.hpp | 10 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 7 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/box.hpp | 8 |
/src/immer/immer/heap/debug_size_heap.hpp | 2 |
/src/immer/immer/heap/cpp_heap.hpp | 2 |
/src/immer/immer/refcount/refcount_policy.hpp | 2 |
/src/immer/immer/detail/hamts/bits.hpp | 1 |
/src/immer/immer/transience/no_transience_policy.hpp | 2 |
/src/immer/immer/detail/hamts/champ_iterator.hpp | 5 |
/src/immer/immer/detail/iterator_facade.hpp | 2 |
/src/immer/immer/algorithm.hpp | 2 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 203 | 29.2% |
gold | [1:9] | 2 | 0.28% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 488 | 70.4% |
All colors | 693 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
444 | 737 |
2 :
['immer::detail::rbts::concat_center_pos
|
444 | 737 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
303 | 526 |
2 :
['immer::detail::rbts::concat_center_pos
|
303 | 526 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
229 | 229 |
2 :
['decltype(auto) immer::detail::rbts::singleton_regular_sub_pos
|
229 | 229 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
229 | 229 |
2 :
['decltype(auto) immer::detail::rbts::singleton_regular_sub_pos
|
229 | 229 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
229 | 229 |
2 :
['decltype(auto) immer::detail::rbts::singleton_regular_sub_pos
|
229 | 229 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
171 | 175 |
2 :
['immer::detail::rbts::regular_sub_pos
|
171 | 175 |
decltype(auto)immer::detail::rbts::visit_maybe_relaxed_sub
|
call site: 00000 | /src/immer/immer/detail/rbts/position.hpp:1841 |
63 | 63 |
1 :
['decltype(auto) immer::detail::rbts::regular_sub_pos
|
63 | 63 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1318 |
25 | 25 |
1 :
['void immer::detail::rbts::regular_sub_pos
|
47 | 172 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1341 |
25 | 25 |
1 :
['void immer::detail::rbts::regular_sub_pos
|
47 | 172 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1341 |
25 | 25 |
1 :
['void immer::detail::rbts::regular_sub_pos
|
47 | 107 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1341 |
25 | 25 |
1 :
['void immer::detail::rbts::regular_sub_pos
|
47 | 107 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1341 |
17 | 17 |
1 :
['void immer::detail::rbts::full_pos
|
39 | 93 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1341 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/flex-vector-bo.cpp | 9 |
/src/immer/immer/flex_vector.hpp | 26 |
/src/immer/immer/detail/rbts/rrbtree.hpp | 35 |
/src/immer/immer/detail/rbts/node.hpp | 39 |
/src/immer/immer/detail/combine_standard_layout.hpp | 8 |
/src/immer/immer/refcount/unsafe_refcount_policy.hpp | 4 |
/src/immer/immer/detail/util.hpp | 10 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 9 |
/src/immer/immer/heap/cpp_heap.hpp | 2 |
/src/immer/immer/detail/rbts/position.hpp | 43 |
/src/immer/immer/detail/rbts/operations.hpp | 11 |
/src/immer/immer/transience/no_transience_policy.hpp | 3 |
/src/immer/immer/detail/rbts/visitor.hpp | 2 |
/src/immer/immer/detail/rbts/rrbtree_iterator.hpp | 1 |
/src/immer/immer/detail/iterator_facade.hpp | 4 |
/src/immer/immer/box.hpp | 2 |
/src/immer/immer/heap/debug_size_heap.hpp | 2 |
/src/immer/immer/refcount/refcount_policy.hpp | 1 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 305 | 36.7% |
gold | [1:9] | 2 | 0.24% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 523 | 63.0% |
All colors | 830 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
570 | 913 |
2 :
['decltype(auto) immer::detail::rbts::relaxed_pos
|
570 | 913 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:2337 |
500 | 849 |
2 :
['decltype(auto) immer::detail::rbts::relaxed_pos
|
500 | 849 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
361 | 598 |
2 :
['immer::detail::rbts::concat_center_pos
|
361 | 598 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:2337 |
359 | 638 |
2 :
['decltype(auto) immer::detail::rbts::regular_sub_pos
|
359 | 638 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
285 | 285 |
2 :
['immer::detail::rbts::concat_center_pos
|
285 | 285 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
285 | 285 |
2 :
['decltype(auto) immer::detail::rbts::singleton_regular_sub_pos
|
285 | 285 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
285 | 285 |
2 :
['decltype(auto) immer::detail::rbts::singleton_regular_sub_pos
|
285 | 285 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
239 | 239 |
2 :
['immer::detail::rbts::concat_center_pos
|
239 | 239 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:2337 |
239 | 239 |
2 :
['immer::detail::rbts::concat_center_pos
|
239 | 239 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:2337 |
239 | 239 |
2 :
['immer::detail::rbts::concat_center_pos
|
239 | 239 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:2337 |
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
4 | 10 |
2 :
['immer::detail::rbts::node
|
4 | 26 |
autoimmer::detail::rbts::node
|
call site: 00000 | /src/immer/immer/detail/rbts/node.hpp:934 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/flex-vector-gc.cpp | 11 |
/src/immer/extra/fuzzer/fuzzer_gc_guard.hpp | 2 |
/src/immer/immer/flex_vector.hpp | 11 |
/src/immer/immer/detail/rbts/rrbtree.hpp | 35 |
/src/immer/immer/detail/rbts/node.hpp | 44 |
/src/immer/immer/detail/combine_standard_layout.hpp | 12 |
/src/immer/immer/refcount/no_refcount_policy.hpp | 4 |
/src/immer/immer/transience/gc_transience_policy.hpp | 10 |
/src/immer/immer/detail/util.hpp | 9 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/immer/flex_vector_transient.hpp | 12 |
/src/immer/immer/heap/gc_heap.hpp | 3 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 11 |
/src/immer/immer/detail/rbts/position.hpp | 42 |
/src/immer/immer/detail/rbts/operations.hpp | 13 |
/src/immer/immer/detail/rbts/visitor.hpp | 2 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 212 | 29.4% |
gold | [1:9] | 2 | 0.27% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 506 | 70.2% |
All colors | 720 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
476 | 801 |
2 :
['decltype(auto) immer::detail::rbts::relaxed_pos
|
476 | 801 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
335 | 590 |
2 :
['immer::detail::rbts::concat_center_pos
|
335 | 590 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
261 | 261 |
2 :
['immer::detail::rbts::concat_center_pos
|
261 | 261 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
261 | 261 |
2 :
['immer::detail::rbts::concat_center_pos
|
261 | 261 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
261 | 261 |
2 :
['immer::detail::rbts::concat_center_pos
|
261 | 261 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
171 | 175 |
2 :
['immer::detail::rbts::regular_sub_pos
|
171 | 175 |
decltype(auto)immer::detail::rbts::visit_maybe_relaxed_sub
|
call site: 00000 | /src/immer/immer/detail/rbts/position.hpp:1841 |
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
6 | 8 |
2 :
['void* immer::cpp_heap::allocate
|
43 | 894 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1330 |
6 | 8 |
2 :
['void* immer::cpp_heap::allocate
|
43 | 894 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1330 |
6 | 8 |
2 :
['void* immer::cpp_heap::allocate
|
43 | 550 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1330 |
6 | 8 |
2 :
['void* immer::cpp_heap::allocate
|
43 | 550 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1330 |
0 | 192 |
2 :
['void immer::detail::rbts::relaxed_pos
|
10 | 357 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:932 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/flex-vector-st.cpp | 9 |
/src/immer/immer/flex_vector.hpp | 27 |
/src/immer/immer/detail/rbts/rrbtree.hpp | 35 |
/src/immer/immer/detail/rbts/node.hpp | 43 |
/src/immer/immer/detail/combine_standard_layout.hpp | 11 |
/src/immer/immer/refcount/unsafe_refcount_policy.hpp | 4 |
/src/immer/immer/detail/util.hpp | 10 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 9 |
/src/immer/immer/heap/cpp_heap.hpp | 3 |
/src/immer/immer/detail/rbts/position.hpp | 43 |
/src/immer/immer/detail/rbts/operations.hpp | 11 |
/src/immer/immer/transience/no_transience_policy.hpp | 3 |
/src/immer/immer/detail/rbts/visitor.hpp | 2 |
/src/immer/immer/detail/rbts/rrbtree_iterator.hpp | 1 |
/src/immer/immer/detail/iterator_facade.hpp | 4 |
/src/immer/immer/box.hpp | 2 |
/src/immer/immer/heap/debug_size_heap.hpp | 2 |
/src/immer/immer/refcount/refcount_policy.hpp | 1 |
The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview
Call tree overview bitmap:
The distribution of callsites in terms of coloring is
Color | Runtime hitcount | Callsite count | Percentage |
---|---|---|---|
red | 0 | 217 | 28.6% |
gold | [1:9] | 4 | 0.52% |
yellow | [10:29] | 0 | 0.0% |
greenyellow | [30:49] | 0 | 0.0% |
lawngreen | 50+ | 537 | 70.8% |
All colors | 758 | 100 |
The followings are the branches where fuzzer fails to bypass.
Unique non-covered Complexity | Unique Reachable Complexities | Unique Reachable Functions | All non-covered Complexity | All Reachable Complexity | Function Name | Function Callsite | Blocked Branch |
---|---|---|---|---|---|---|---|
529 | 907 |
2 :
['immer::detail::rbts::concat_center_pos
|
529 | 907 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
388 | 696 |
2 :
['decltype(auto) immer::detail::rbts::regular_sub_pos
|
388 | 696 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
314 | 314 |
2 :
['immer::detail::rbts::concat_center_pos
|
314 | 314 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
314 | 314 |
2 :
['immer::detail::rbts::concat_center_pos
|
314 | 314 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
314 | 314 |
2 :
['decltype(auto) immer::detail::rbts::singleton_regular_sub_pos
|
314 | 314 |
immer::detail::rbts::concat_center_pos
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1874 |
171 | 175 |
2 :
['decltype(auto) immer::detail::rbts::regular_sub_pos
|
171 | 175 |
decltype(auto)immer::detail::rbts::visit_maybe_relaxed_sub
|
call site: 00000 | /src/immer/immer/detail/rbts/position.hpp:1841 |
8 | 8 |
3 :
['__cxa_allocate_exception', '__cxa_throw', 'no_more_input::no_more_input()'] |
8 | 8 | fuzzer_input::next(unsignedlong) | call site: 00000 | /src/immer/extra/fuzzer/fuzzer_input.hpp:31 |
6 | 55 |
2 :
['void* immer::split_heap<56ul, immer::with_free_list_node
|
76 | 1115 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1330 |
6 | 55 |
2 :
['void* immer::split_heap<56ul, immer::with_free_list_node
|
76 | 1115 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1330 |
6 | 55 |
2 :
['void* immer::split_heap<56ul, immer::with_free_list_node
|
76 | 771 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1330 |
6 | 55 |
2 :
['void* immer::split_heap<56ul, immer::with_free_list_node
|
76 | 771 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:1330 |
0 | 272 |
2 :
['immer::detail::rbts::node
|
10 | 470 |
std::__1::tuple
|
call site: 00000 | /src/immer/immer/detail/rbts/operations.hpp:932 |
Function name | source code lines | source lines hit | percentage hit |
---|
filename | functions hit |
---|---|
/src/immer/extra/fuzzer/flex-vector.cpp | 9 |
/src/immer/immer/flex_vector.hpp | 26 |
/src/immer/immer/detail/rbts/rrbtree.hpp | 35 |
/src/immer/immer/detail/rbts/node.hpp | 43 |
/src/immer/immer/detail/combine_standard_layout.hpp | 11 |
/src/immer/immer/refcount/refcount_policy.hpp | 4 |
/src/immer/immer/detail/util.hpp | 10 |
/usr/local/bin/../include/c++/v1/exception | 1 |
/src/immer/extra/fuzzer/fuzzer_input.hpp | 9 |
/src/immer/immer/heap/split_heap.hpp | 3 |
/src/immer/immer/heap/with_data.hpp | 2 |
/src/immer/immer/heap/unsafe_free_list_heap.hpp | 3 |
/src/immer/immer/heap/thread_local_free_list_heap.hpp | 2 |
/src/immer/immer/heap/free_list_heap.hpp | 3 |
/src/immer/immer/heap/debug_size_heap.hpp | 2 |
/src/immer/immer/heap/cpp_heap.hpp | 2 |
/src/immer/immer/detail/rbts/position.hpp | 43 |
/src/immer/immer/detail/rbts/operations.hpp | 11 |
/src/immer/immer/transience/no_transience_policy.hpp | 3 |
/src/immer/immer/detail/rbts/visitor.hpp | 2 |
/src/immer/immer/detail/rbts/rrbtree_iterator.hpp | 1 |
/src/immer/immer/detail/iterator_facade.hpp | 4 |
/src/immer/immer/box.hpp | 2 |
The following table shows a list of functions that are optimal targets. Optimal targets are identified by finding the functions that in combination, yield a high code coverage.
Implementing fuzzers that target the above functions will improve reachability such that it becomes:
If you implement fuzzers for these functions, the status of all functions in the project will be:
Func name | Functions filename | Args | Function call depth | Reached by Fuzzers | Fuzzers runtime hit | Func lines hit % | I Count | BB Count | Cyclomatic complexity | Functions reached | Reached by functions | Accumulated cyclomatic complexity | Undiscovered complexity |
---|
This sections provides heuristics that can be used as input to a fuzz engine when running a given fuzz target. The current focus is on providing input that is usable by libFuzzer.
Use this with the libFuzzer -dict=DICT.file flag
Use one of these functions as input to libfuzzer with flag: -focus_function name
-focus_function=['immer::detail::arrays::with_capacity, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >::~with_capacity()', 'immer::detail::arrays::with_capacity, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >::data()', 'immer::detail::arrays::with_capacity, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >::push_back_mut(immer::no_transience_policy::apply >::type::edit, int)', 'fuzzer_input::next(unsigned long, unsigned long)', 'LLVMFuzzerTestOneInput', 'void immer::debug_size_heap::deallocate<>(unsigned long, void*)', 'immer::detail::arrays::with_capacity, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >::operator=(immer::detail::arrays::with_capacity, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >&&)', 'immer::array, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >::push_back(int) const &', 'immer::array, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >::take(unsigned long) const &', 'immer::detail::arrays::with_capacity, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >::take_mut(immer::no_transience_policy::apply >::type::edit, unsigned long)']
Use this with the libFuzzer -dict=DICT.file flag
Use one of these functions as input to libfuzzer with flag: -focus_function name
-focus_function=['immer::detail::arrays::with_capacity, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false> >::push_back_mut(immer::gc_transience_policy::apply >::type::edit, int)', 'immer::detail::arrays::no_capacity, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false> >::operator=(immer::detail::arrays::no_capacity, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false> >&&)', 'fuzzer_input::next(unsigned long, unsigned long)', 'immer::detail::arrays::with_capacity, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false> >::dec()', 'immer::detail::arrays::node, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false> >::make_n(unsigned long)', 'immer::array_transient, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false> >::persistent() &', 'LLVMFuzzerTestOneInput', 'immer::array, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false> >::transient() const &', 'immer::detail::arrays::no_capacity, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false> >::push_back(int) const', 'immer::array, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false> >::take(unsigned long) const &']
Use this with the libFuzzer -dict=DICT.file flag
Use one of these functions as input to libfuzzer with flag: -focus_function name
-focus_function=['immer::detail::hamts::champ, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::do_add(immer::detail::hamts::node, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>*, unsigned long, unsigned long, unsigned int) const', 'immer::detail::hamts::node, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::make_inner_n_into(void*, unsigned long, unsigned int)', 'immer::set, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::erase_move(std::__1::integral_constant, unsigned long const&)', 'immer::detail::hamts::node, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::dec() const', 'fuzzer_input::next(unsigned long, unsigned long)', 'immer::detail::hamts::node, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::copy_inner_replace_inline(immer::detail::hamts::node, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>*, unsigned int, unsigned int, unsigned long)', 'immer::detail::hamts::node, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::copy_inner_remove_value(immer::detail::hamts::node, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>*, unsigned int, unsigned int)', 'immer::detail::hamts::node, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::copy_inner_replace_inline(immer::detail::hamts::node, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>*, unsigned int, unsigned int, unsigned long)', 'immer::detail::hamts::node, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::values() const', 'immer::detail::hamts::node, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::collisions() const']
Use this with the libFuzzer -dict=DICT.file flag
Use one of these functions as input to libfuzzer with flag: -focus_function name
-focus_function=['immer::detail::hamts::node, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::copy_inner_replace_inline(immer::detail::hamts::node, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int, unsigned long)', 'immer::detail::hamts::node, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::copy_inner_remove_value(immer::detail::hamts::node, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int)', 'immer::detail::hamts::node, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::move_inner_replace_merged(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int, immer::detail::hamts::node, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>*)', 'immer::detail::hamts::node, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::make_inner_n_into(void*, unsigned long, unsigned int)', 'fuzzer_input::next(unsigned long, unsigned long)', 'immer::detail::hamts::node, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::copy_inner_replace_inline(immer::detail::hamts::node, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int, unsigned long)', 'decltype(auto) immer::detail::iterator_core_access::equal, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u> const&, immer::detail::hamts::champ_iterator, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u> const&>(immer::detail::hamts::champ_iterator, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u> const&, immer::detail::hamts::champ_iterator, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u> const&)', 'immer::detail::hamts::node, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::delete_deep(immer::detail::hamts::node, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int)', 'void immer::debug_size_heap::deallocate<>(unsigned long, void*)', 'LLVMFuzzerTestOneInput']
Use this with the libFuzzer -dict=DICT.file flag
Use one of these functions as input to libfuzzer with flag: -focus_function name
-focus_function=['fuzzer_input::next(unsigned long, unsigned long)', 'immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::copy_inner_replace_inline(immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int, unsigned long)', 'immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::copy_inner_remove_value(immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int)', 'immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::move_inner_replace_merged(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int, immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*)', 'immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::move_inner_replace_inline(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int, unsigned long)', 'immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::move_inner_remove_value(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int)', 'immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::make_inner_n_into(void*, unsigned long, unsigned int)', 'immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::copy_inner_replace_inline(immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int, unsigned long)', 'decltype(auto) immer::detail::iterator_core_access::equal, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u> const&, immer::detail::hamts::champ_iterator, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u> const&>(immer::detail::hamts::champ_iterator, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u> const&, immer::detail::hamts::champ_iterator, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u> const&)', 'immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::move_inner_replace_inline(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int, unsigned long)']
Use this with the libFuzzer -dict=DICT.file flag
Use one of these functions as input to libfuzzer with flag: -focus_function name
-focus_function=['immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::copy_inner_replace_value(immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>*, unsigned int, std::__1::basic_string, std::__1::allocator >)', 'immer::detail::hamts::champ, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::sub_result_mut immer::detail::hamts::champ, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::do_sub_mut, std::__1::allocator > >(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>*, std::__1::basic_string, std::__1::allocator > const&, unsigned long, unsigned int, void*) const', 'fuzzer_input::next(unsigned long, unsigned long)', 'immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::copy_inner_replace_inline(immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>*, unsigned char, unsigned int, std::__1::basic_string, std::__1::allocator >)', 'immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::copy_inner_remove_value(immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>*, unsigned char, unsigned int)', 'immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::move_inner_replace_merged(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>*, unsigned char, unsigned int, immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>*)', 'immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::move_inner_remove_value(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>*, unsigned char, unsigned int)', 'immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::make_inner_n_into(void*, unsigned long, unsigned int)', 'decltype(auto) immer::detail::iterator_core_access::equal, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u> const&, immer::detail::hamts::champ_iterator, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u> const&>(immer::detail::hamts::champ_iterator, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u> const&, immer::detail::hamts::champ_iterator, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u> const&)', 'immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::move_inner_replace_inline(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>*, unsigned char, unsigned int, std::__1::basic_string, std::__1::allocator >)']
Use this with the libFuzzer -dict=DICT.file flag
Use one of these functions as input to libfuzzer with flag: -focus_function name
-focus_function=['immer::detail::rbts::node, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u>::copy_leaf(immer::detail::rbts::node, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u>*, unsigned int)', 'immer::detail::rbts::rbtree, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u>::~rbtree()', 'immer::detail::rbts::rbtree, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u>::push_back_mut(immer::no_transience_policy::apply >::type::edit, int)', 'fuzzer_input::next(unsigned long, unsigned long)', 'void immer::detail::rbts::dec_empty_regular, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u> >(immer::detail::rbts::node, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u>*)', 'immer::detail::rbts::node, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u>::make_path(unsigned int, immer::detail::rbts::node, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u>*)', 'LLVMFuzzerTestOneInput', 'immer::detail::rbts::regular_sub_pos, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u> > immer::detail::rbts::make_regular_sub_pos, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u> >(immer::detail::rbts::node, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u>*, unsigned int, unsigned long)', 'immer::detail::rbts::node, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u>* immer::detail::rbts::push_tail_visitor, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u> >::visit_regular, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u> >&>(immer::detail::rbts::regular_pos, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u> >&, immer::detail::rbts::node, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u>*)', 'immer::detail::rbts::rbtree, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 2u, 2u>::take(unsigned long) const']
Use this with the libFuzzer -dict=DICT.file flag
Use one of these functions as input to libfuzzer with flag: -focus_function name
-focus_function=['immer::detail::hamts::champ, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::hash_key, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::equal_key, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::dec() const', 'decltype(auto) immer::detail::hamts::champ, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::hash_key, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::equal_key, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::get, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::project_value_ptr, immer::detail::constantly, unsigned long>(unsigned long const&) const', 'immer::detail::hamts::champ, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::hash_key, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::equal_key, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::do_add(immer::detail::hamts::node, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::hash_key, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::equal_key, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>*, std::__1::pair, unsigned long, unsigned int) const', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::hash_key, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::equal_key, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::make_inner_n_into(void*, unsigned long, unsigned int)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::hash_key, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::equal_key, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::dec() const', 'fuzzer_input::next(unsigned long, unsigned long)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::hash_key, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::equal_key, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::copy_inner_replace_inline(immer::detail::hamts::node, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::hash_key, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::equal_key, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>*, unsigned int, unsigned int, std::__1::pair)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::hash_key, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::equal_key, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::copy_inner_remove_value(immer::detail::hamts::node, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::hash_key, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::equal_key, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>*, unsigned int, unsigned int)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::hash_key, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::equal_key, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::copy_collision_replace(immer::detail::hamts::node, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::hash_key, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::equal_key, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>*, std::__1::pair*, std::__1::pair)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::hash_key, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::equal_key, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::copy_inner_replace_inline(immer::detail::hamts::node, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::hash_key, immer::map, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>::equal_key, immer::memory_policy, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 5u>*, unsigned int, unsigned int, std::__1::pair)']
Use this with the libFuzzer -dict=DICT.file flag
Use one of these functions as input to libfuzzer with flag: -focus_function name
-focus_function=['immer::detail::rbts::node, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u>::copy_leaf(immer::detail::rbts::node, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u>*, unsigned int)', 'immer::detail::rbts::rbtree, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u>::~rbtree()', 'immer::detail::rbts::rbtree, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u>::push_back_mut(immer::no_transience_policy::apply >::type::edit, int)', 'void immer::detail::rbts::dec_empty_regular, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u> >(immer::detail::rbts::node, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u>*)', 'fuzzer_input::next(unsigned long, unsigned long)', 'LLVMFuzzerTestOneInput', 'void immer::detail::unsafe_free_list_heap_impl > >::deallocate<>(unsigned long, void*)', 'immer::detail::rbts::regular_sub_pos, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u> > immer::detail::rbts::make_regular_sub_pos, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u> >(immer::detail::rbts::node, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u>*, unsigned int, unsigned long)', 'immer::detail::rbts::node, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u>* immer::detail::rbts::push_tail_visitor, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u> >::visit_regular, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u> >&>(immer::detail::rbts::regular_pos, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u> >&, immer::detail::rbts::node, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u>*)', 'immer::detail::rbts::rbtree, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 2u, 2u>::take(unsigned long) const']
Use this with the libFuzzer -dict=DICT.file flag
Use one of these functions as input to libfuzzer with flag: -focus_function name
-focus_function=['immer::detail::hamts::node, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::move_inner_insert_value(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, std::__1::pair)', 'decltype(auto) immer::detail::hamts::champ, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::get, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::project_value_ptr, immer::detail::constantly, unsigned long>(unsigned long const&) const', 'immer::detail::hamts::champ, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::dec() const', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::deallocate_values(immer::detail::csl::member_two, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::values_data_t, immer::detail::csl::member >::type::ownee, void>::type>::type>::type*, unsigned int)', 'fuzzer_input::next(unsigned long, unsigned long)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::copy_inner_replace_inline(immer::detail::hamts::node, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int, std::__1::pair)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::copy_inner_remove_value(immer::detail::hamts::node, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::move_inner_replace_merged(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int, immer::detail::hamts::node, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>*)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::move_inner_replace_inline(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int, std::__1::pair)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::move_inner_remove_value(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int)']
Use this with the libFuzzer -dict=DICT.file flag
Use one of these functions as input to libfuzzer with flag: -focus_function name
-focus_function=['std::__1::enable_if, std::__1::allocator >*, std::__1::basic_string, std::__1::allocator >*>), std::__1::basic_string, std::__1::allocator >*>::type immer::detail::uninitialized_copy, std::__1::allocator >*, std::__1::basic_string, std::__1::allocator >*, std::__1::basic_string, std::__1::allocator >*>(std::__1::basic_string, std::__1::allocator >*, std::__1::basic_string, std::__1::allocator >*, std::__1::basic_string, std::__1::allocator >*)', 'immer::detail::hamts::champ, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u> immer::detail::hamts::champ, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::sub, std::__1::allocator > >(std::__1::basic_string, std::__1::allocator > const&) const', 'immer::detail::hamts::champ, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::sub_result_mut immer::detail::hamts::champ, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::do_sub_mut, std::__1::allocator > >(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, std::__1::basic_string, std::__1::allocator > const&, unsigned long, unsigned int, void*) const', 'immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::owned(immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, immer::no_transience_policy::apply >::type::edit)', 'immer::detail::hamts::champ, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::do_add(immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, std::__1::basic_string, std::__1::allocator >, unsigned long, unsigned int) const', 'immer::detail::hamts::champ, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::do_check_champ(immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned long, unsigned long) const', 'immer::detail::hamts::champ, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::do_add(immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, std::__1::basic_string, std::__1::allocator >, unsigned long, unsigned int) const', 'immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::copy_inner_replace_value(immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, std::__1::basic_string, std::__1::allocator >)', 'fuzzer_input::next(unsigned long, unsigned long)', 'immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::copy_inner_replace_inline(immer::detail::hamts::node, std::__1::allocator >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int, std::__1::basic_string, std::__1::allocator >)']
Use this with the libFuzzer -dict=DICT.file flag
Use one of these functions as input to libfuzzer with flag: -focus_function name
-focus_function=['immer::detail::rbts::node, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>::copy_leaf(immer::detail::rbts::node, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>*, unsigned int)', 'immer::detail::rbts::rbtree, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>::operator=(immer::detail::rbts::rbtree, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>&&)', 'immer::detail::rbts::rbtree, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>::push_back(int) const', 'immer::detail::rbts::rbtree, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>::push_back(int) const', 'immer::detail::rbts::rbtree, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>::push_back_mut(immer::gc_transience_policy::apply >::type::edit, int)', 'fuzzer_input::next(unsigned long, unsigned long)', 'void immer::detail::rbts::dec_empty_regular, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u> >(immer::detail::rbts::node, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>*)', 'decltype(auto) immer::detail::csl::member_two, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>::impl_data_t, immer::detail::csl::inherit >::type::ownee, void>::type>::type>::type::get_ >::type::ownee>(immer::detail::csl::type_t >::type::ownee>)', 'immer::detail::rbts::node, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>::make_inner_e(immer::gc_transience_policy::apply >::type::edit)', 'immer::detail::rbts::node, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>::make_path(unsigned int, immer::detail::rbts::node, immer::no_refcount_policy, immer::spinlock_policy, immer::gc_transience_policy, false, false>, 2u, 2u>*)']
Use this with the libFuzzer -dict=DICT.file flag
Use one of these functions as input to libfuzzer with flag: -focus_function name
-focus_function=['decltype(auto) immer::detail::hamts::champ, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::get, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::project_value_ptr, immer::detail::constantly, unsigned long>(unsigned long const&) const', 'immer::detail::hamts::champ, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::dec() const', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::deallocate_values(immer::detail::csl::member_two, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::values_data_t, immer::detail::csl::member >::type::ownee, void>::type>::type>::type*, unsigned int)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::move_inner_insert_value(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, std::__1::pair)', 'fuzzer_input::next(unsigned long, unsigned long)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::copy_inner_replace_inline(immer::detail::hamts::node, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int, std::__1::pair)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::copy_inner_remove_value(immer::detail::hamts::node, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::move_inner_replace_merged(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int, immer::detail::hamts::node, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::move_inner_replace_inline(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int, std::__1::pair)', 'immer::detail::hamts::node, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::move_inner_remove_value(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::hash_key, immer::map, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 5u>*, unsigned int, unsigned int)']
Use this with the libFuzzer -dict=DICT.file flag
Use one of these functions as input to libfuzzer with flag: -focus_function name
-focus_function=['immer::detail::hamts::champ, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> > >, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::hash_key, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::dec() const', 'immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::default_value::operator()() const', 'immer::detail::hamts::node, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> > >, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::hash_key, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::delete_values(immer::detail::csl::member_two, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> > >, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::hash_key, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::values_data_t, immer::detail::csl::member >::type::ownee, void>::type>::type>::type*, unsigned int)', 'immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >::operator std::__1::basic_string, std::__1::allocator > const&() const', 'immer::detail::hamts::node, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> > >, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::hash_key, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::move_inner_insert_value(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> > >, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::hash_key, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>*, unsigned char, std::__1::pair, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> > >)', 'immer::detail::hamts::node, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> > >, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::hash_key, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::copy_inner_replace_value(immer::detail::hamts::node, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> > >, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::hash_key, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>*, unsigned int, std::__1::pair, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> > >)', 'immer::detail::hamts::champ, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> > >, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::hash_key, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::sub_result_mut immer::detail::hamts::champ, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> > >, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::hash_key, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::do_sub_mut, std::__1::allocator > >(immer::no_transience_policy::apply >::type::edit, immer::detail::hamts::node, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> > >, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::hash_key, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::equal_key, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>*, std::__1::basic_string, std::__1::allocator > const&, unsigned long, unsigned int, void*) const', 'fuzzer_input::next(unsigned long, unsigned long)', 'immer::detail::hamts::node, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> > >, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy, immer::unsafe_refcount_policy, immer::no_lock_policy, immer::no_transience_policy, false, true>, 3u>::hash_key, immer::map, std::__1::allocator >, immer::box, std::__1::allocator >, immer::memory_policy, immer::refcount_policy, immer::spinlock_policy, immer::no_transience_policy, false, true> >, colliding_hash_t, std::__1::equal_to, immer::memory_policy