Fuzz introspector
For issues and ideas: https://github.com/ossf/fuzz-introspector/issues

Fuzzers overview

Fuzzer Fuzzer filename Functions Reached Functions unreached Fuzzer depth Files reached Basic blocks reached Cyclomatic complexity Details
search libcxx/test/libcxx/fuzzing/search.pass.cpp 2 1 1 1 19 7 search.pass.cpp
unique libcxx/test/libcxx/fuzzing/unique.pass.cpp 1 12 0 1 36 3 unique.pass.cpp
partial_sort_copy libcxx/test/libcxx/fuzzing/partial_sort_copy.pass.cpp 1 13 0 1 28 28 partial_sort_copy.pass.cpp
unique_copy libcxx/test/libcxx/fuzzing/unique_copy.pass.cpp 1 12 0 1 36 3 unique_copy.pass.cpp
pop_heap libcxx/test/libcxx/fuzzing/pop_heap.pass.cpp 1 11 0 1 17 18 pop_heap.pass.cpp
stable_sort libcxx/test/libcxx/fuzzing/stable_sort.pass.cpp 5 14 1 2 46 35 stable_sort.pass.cpp
push_heap libcxx/test/libcxx/fuzzing/push_heap.pass.cpp 3 11 1 2 38 30 push_heap.pass.cpp
make_heap libcxx/test/libcxx/fuzzing/make_heap.pass.cpp 3 11 1 2 27 18 make_heap.pass.cpp
nth_element libcxx/test/libcxx/fuzzing/nth_element.pass.cpp 3 14 1 2 39 7 nth_element.pass.cpp
partial_sort libcxx/test/libcxx/fuzzing/partial_sort.pass.cpp 3 13 1 2 40 32 partial_sort.pass.cpp
partition_copy libcxx/test/libcxx/fuzzing/partition_copy.pass.cpp 1 12 0 1 30 25 partition_copy.pass.cpp
partition libcxx/test/libcxx/fuzzing/partition.pass.cpp 3 12 1 2 30 21 partition.pass.cpp
sort libcxx/test/libcxx/fuzzing/sort.pass.cpp 3 11 1 2 27 18 sort.pass.cpp
stable_partition libcxx/test/libcxx/fuzzing/stable_partition.pass.cpp 5 14 1 2 48 37 stable_partition.pass.cpp
random libcxx/test/libcxx/fuzzing/random.pass.cpp 120 23 4 2 469 287 random.pass.cpp
format_no_args libcxx/test/libcxx/fuzzing/format_no_args.pass.cpp 3 50 1 1 19 19 format_no_args.pass.cpp
regex libcxx/test/libcxx/fuzzing/regex.pass.cpp 15 16 2 1 140 131 regex.pass.cpp

Fuzzer details

Fuzzer: search

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 3 100.%
All colors 3 100

Runtime coverage analysis

Covered functions
1
Functions that are reachable but not covered
1
Reachable functions
2
Percentage of reachable functions covered
50.0%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/search.pass.cpp 1

Fuzzer: unique

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 1 100.%
All colors 1 100

Runtime coverage analysis

Covered functions
1
Functions that are reachable but not covered
0
Reachable functions
1
Percentage of reachable functions covered
100.0%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/unique.pass.cpp 1

Fuzzer: partial_sort_copy

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 1 100.%
All colors 1 100

Runtime coverage analysis

Covered functions
1
Functions that are reachable but not covered
0
Reachable functions
1
Percentage of reachable functions covered
100.0%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/partial_sort_copy.pass.cpp 1

Fuzzer: unique_copy

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 1 100.%
All colors 1 100

Runtime coverage analysis

Covered functions
1
Functions that are reachable but not covered
0
Reachable functions
1
Percentage of reachable functions covered
100.0%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/unique_copy.pass.cpp 1

Fuzzer: pop_heap

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 1 100.%
All colors 1 100

Runtime coverage analysis

Covered functions
1
Functions that are reachable but not covered
0
Reachable functions
1
Percentage of reachable functions covered
100.0%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/pop_heap.pass.cpp 1

Fuzzer: stable_sort

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 3 100.%
All colors 3 100

Fuzz blockers

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
0 0 None 0 0 boolfast_is_permutation ,std::__1::__wrap_iter ,void>(std::__1::__wrap_iter ,std::__1::__wrap_iter ,std::__1::__wrap_iter ) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/fuzz.h:83
0 0 None 0 0 boolfast_is_permutation ,std::__1::__wrap_iter ,void>(std::__1::__wrap_iter ,std::__1::__wrap_iter ,std::__1::__wrap_iter ) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/fuzz.h:85

Runtime coverage analysis

Covered functions
6
Functions that are reachable but not covered
0
Reachable functions
5
Percentage of reachable functions covered
100.0%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Warning: The number of covered functions are larger than the number of reachable functions. This means that there are more functions covered at runtime than are extracted using static analysis. This is likely a result of the static analysis component failing to extract the right call graph or the coverage runtime being compiled with sanitizers in code that the static analysis has not analysed. This can happen if lto/gold is not used in all places that coverage instrumentation is used.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/stable_sort.pass.cpp 1
libcxx/test/libcxx/fuzzing/fuzz.h 2

Fuzzer: push_heap

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 2 100.%
All colors 2 100

Runtime coverage analysis

Covered functions
2
Functions that are reachable but not covered
0
Reachable functions
3
Percentage of reachable functions covered
100.0%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/push_heap.pass.cpp 1
libcxx/test/libcxx/fuzzing/fuzz.h 1

Fuzzer: make_heap

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 2 100.%
All colors 2 100

Runtime coverage analysis

Covered functions
2
Functions that are reachable but not covered
0
Reachable functions
3
Percentage of reachable functions covered
100.0%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/make_heap.pass.cpp 1
libcxx/test/libcxx/fuzzing/fuzz.h 1

Fuzzer: nth_element

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 2 100.%
All colors 2 100

Runtime coverage analysis

Covered functions
4
Functions that are reachable but not covered
0
Reachable functions
3
Percentage of reachable functions covered
100.0%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Warning: The number of covered functions are larger than the number of reachable functions. This means that there are more functions covered at runtime than are extracted using static analysis. This is likely a result of the static analysis component failing to extract the right call graph or the coverage runtime being compiled with sanitizers in code that the static analysis has not analysed. This can happen if lto/gold is not used in all places that coverage instrumentation is used.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/nth_element.pass.cpp 1
libcxx/test/libcxx/fuzzing/fuzz.h 1

Fuzzer: partial_sort

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 2 100.%
All colors 2 100

Runtime coverage analysis

Covered functions
4
Functions that are reachable but not covered
0
Reachable functions
3
Percentage of reachable functions covered
100.0%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Warning: The number of covered functions are larger than the number of reachable functions. This means that there are more functions covered at runtime than are extracted using static analysis. This is likely a result of the static analysis component failing to extract the right call graph or the coverage runtime being compiled with sanitizers in code that the static analysis has not analysed. This can happen if lto/gold is not used in all places that coverage instrumentation is used.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/partial_sort.pass.cpp 1
libcxx/test/libcxx/fuzzing/fuzz.h 1

Fuzzer: partition_copy

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 1 100.%
All colors 1 100

Runtime coverage analysis

Covered functions
2
Functions that are reachable but not covered
0
Reachable functions
1
Percentage of reachable functions covered
100.0%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Warning: The number of covered functions are larger than the number of reachable functions. This means that there are more functions covered at runtime than are extracted using static analysis. This is likely a result of the static analysis component failing to extract the right call graph or the coverage runtime being compiled with sanitizers in code that the static analysis has not analysed. This can happen if lto/gold is not used in all places that coverage instrumentation is used.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/partition_copy.pass.cpp 1

Fuzzer: partition

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 1 50.0%
lawngreen 50+ 1 50.0%
All colors 2 100

Runtime coverage analysis

Covered functions
3
Functions that are reachable but not covered
0
Reachable functions
3
Percentage of reachable functions covered
100.0%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/partition.pass.cpp 1
libcxx/test/libcxx/fuzzing/fuzz.h 1

Fuzzer: sort

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 1 50.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 1 50.0%
All colors 2 100

Runtime coverage analysis

Covered functions
2
Functions that are reachable but not covered
0
Reachable functions
3
Percentage of reachable functions covered
100.0%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/sort.pass.cpp 1
libcxx/test/libcxx/fuzzing/fuzz.h 1

Fuzzer: stable_partition

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 3 100.%
All colors 3 100

Fuzz blockers

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
0 0 None 0 0 boolfast_is_permutation ,std::__1::__wrap_iter ,void>(std::__1::__wrap_iter ,std::__1::__wrap_iter ,std::__1::__wrap_iter ) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/fuzz.h:83
0 0 None 0 0 boolfast_is_permutation ,std::__1::__wrap_iter ,void>(std::__1::__wrap_iter ,std::__1::__wrap_iter ,std::__1::__wrap_iter ) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/fuzz.h:85

Runtime coverage analysis

Covered functions
6
Functions that are reachable but not covered
0
Reachable functions
5
Percentage of reachable functions covered
100.0%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Warning: The number of covered functions are larger than the number of reachable functions. This means that there are more functions covered at runtime than are extracted using static analysis. This is likely a result of the static analysis component failing to extract the right call graph or the coverage runtime being compiled with sanitizers in code that the static analysis has not analysed. This can happen if lto/gold is not used in all places that coverage instrumentation is used.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/stable_partition.pass.cpp 1
libcxx/test/libcxx/fuzzing/fuzz.h 2

Fuzzer: random

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 65 100.%
All colors 65 100

Fuzz blockers

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
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper (unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166

Runtime coverage analysis

Covered functions
59
Functions that are reachable but not covered
3
Reachable functions
120
Percentage of reachable functions covered
97.5%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/random.pass.cpp 59
cxx_install_dir/include/c++/v1/stdlib.h 1

Fuzzer: format_no_args

Call tree

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 0 0.0%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 3 100.%
All colors 3 100

Runtime coverage analysis

Covered functions
1
Functions that are reachable but not covered
2
Reachable functions
3
Percentage of reachable functions covered
33.33%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/format_no_args.pass.cpp 1

Fuzzer: regex

Call tree

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 5 55.5%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 4 44.4%
All colors 9 100

Fuzz blockers

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
0 0 None 0 0 boolfast_is_permutation ,std::__1::__wrap_iter ,void>(std::__1::__wrap_iter ,std::__1::__wrap_iter ,std::__1::__wrap_iter ) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/fuzz.h:83
0 0 None 0 0 boolfast_is_permutation ,std::__1::__wrap_iter ,void>(std::__1::__wrap_iter ,std::__1::__wrap_iter ,std::__1::__wrap_iter ) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/fuzz.h:85
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper (unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166
0 0 None 0 0 inthelper >(unsignedcharconst*,unsignedlong) call site: 00000 /src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp:166

Runtime coverage analysis

Covered functions
70
Functions that are reachable but not covered
14
Reachable functions
15
Percentage of reachable functions covered
6.67%
NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.
Warning: The number of covered functions are larger than the number of reachable functions. This means that there are more functions covered at runtime than are extracted using static analysis. This is likely a result of the static analysis component failing to extract the right call graph or the coverage runtime being compiled with sanitizers in code that the static analysis has not analysed. This can happen if lto/gold is not used in all places that coverage instrumentation is used.
Function name source code lines source lines hit percentage hit

Files reached

filename functions hit
libcxx/test/libcxx/fuzzing/regex.pass.cpp 7

Fuzz engine guidance

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.

libcxx/test/libcxx/fuzzing/search.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/unique.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/partial_sort_copy.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/unique_copy.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/pop_heap.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/stable_sort.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/push_heap.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/make_heap.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/nth_element.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/partial_sort.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/partition_copy.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/partition.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/sort.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/stable_partition.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/random.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/format_no_args.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


libcxx/test/libcxx/fuzzing/regex.pass.cpp

Dictionary

Use this with the libFuzzer -dict=DICT.file flag


Fuzzer function priority

Use one of these functions as input to libfuzzer with flag: -focus_function name

-focus_function=['LLVMFuzzerTestOneInput']

Files and Directories in report

This section shows which files and directories are considered in this report. The main reason for showing this is fuzz introspector may include more code in the reasoning than is desired. This section helps identify if too many files/directories are included, e.g. third party code, which may be irrelevant for the threat model. In the event too much is included, fuzz introspector supports a configuration file that can exclude data from the report. See the following link for more information on how to create a config file: link

Files in report

Source file Reached by Covered by
[] []
/src/llvm-project/libcxx/test/libcxx/fuzzing/partial_sort_copy.pass.cpp ['partial_sort_copy'] ['partial_sort_copy']
/src/llvm-project/libcxx/test/libcxx/fuzzing/sort.pass.cpp ['sort'] ['sort']
/src/llvm-project/libcxx/test/libcxx/fuzzing/unique.pass.cpp ['unique'] ['unique']
/src/llvm-project/cxx_install_dir/include/c++/v1/optional [] []
/src/llvm-project/cxx_install_dir/include/c++/v1/__iterator/move_iterator.h [] []
/src/llvm-project/libcxx/test/libcxx/fuzzing/nth_element.pass.cpp ['nth_element'] ['nth_element']
/src/llvm-project/libcxx/test/libcxx/fuzzing/push_heap.pass.cpp ['push_heap'] ['push_heap']
/src/llvm-project/libcxx/test/libcxx/fuzzing/make_heap.pass.cpp ['make_heap'] ['make_heap']
/src/llvm-project/cxx_install_dir/include/c++/v1/__algorithm/ranges_upper_bound.h [] []
/src/llvm-project/cxx_install_dir/include/c++/v1/__format/parser_std_format_spec.h [] []
/src/llvm-project/libcxx/test/libcxx/fuzzing/fuzz.h ['stable_sort', 'push_heap', 'make_heap', 'nth_element', 'partial_sort', 'partition', 'sort', 'stable_partition'] ['stable_sort', 'push_heap', 'make_heap', 'nth_element', 'partial_sort', 'partition', 'sort', 'stable_partition']
/src/llvm-project/cxx_install_dir/include/c++/v1/stdexcept [] []
/src/llvm-project/libcxx/test/libcxx/fuzzing/regex.pass.cpp ['regex'] ['regex']
/src/llvm-project/libcxx/test/libcxx/fuzzing/pop_heap.pass.cpp ['pop_heap'] ['pop_heap']
/src/llvm-project/libcxx/test/libcxx/fuzzing/stable_partition.pass.cpp ['stable_partition'] ['stable_partition']
/src/llvm-project/cxx_install_dir/include/c++/v1/stdlib.h ['random'] []
/src/llvm-project/libcxx/test/libcxx/fuzzing/random.pass.cpp ['random'] ['random']
/src/llvm-project/libcxx/test/libcxx/fuzzing/partition.pass.cpp ['partition'] ['partition']
/src/llvm-project/libcxx/test/libcxx/fuzzing/stable_sort.pass.cpp ['stable_sort'] ['stable_sort']
/src/llvm-project/libcxx/test/libcxx/fuzzing/format_no_args.pass.cpp ['format_no_args'] ['format_no_args']
/src/llvm-project/cxx_install_dir/include/c++/v1/string [] []
/src/llvm-project/libcxx/test/libcxx/fuzzing/partial_sort.pass.cpp ['partial_sort'] ['partial_sort']
/src/llvm-project/libcxx/test/libcxx/fuzzing/unique_copy.pass.cpp ['unique_copy'] ['unique_copy']
/src/llvm-project/libcxx/test/libcxx/fuzzing/search.pass.cpp ['search'] ['search']
/src/llvm-project/libcxx/test/libcxx/fuzzing/partition_copy.pass.cpp ['partition_copy'] ['partition_copy']
/src/llvm-project/cxx_install_dir/include/c++/v1/__format/format_functions.h [] []

Directories in report

Directory
/src/llvm-project/cxx_install_dir/include/c++/v1/__format/
/src/llvm-project/cxx_install_dir/include/c++/v1/__algorithm/
/src/llvm-project/cxx_install_dir/include/c++/v1/__iterator/
/src/llvm-project/libcxx/test/libcxx/fuzzing/
/src/llvm-project/cxx_install_dir/include/c++/v1/

Metadata section

This sections shows the raw data that is used to produce this report. This is mainly used for further processing and developer debugging.

Fuzzer Calltree file Program data file Coverage file
search fuzzerLogFile-0-qy97ltrPww.data fuzzerLogFile-0-qy97ltrPww.data.yaml search.covreport
unique fuzzerLogFile-0-wzupFKMRcr.data fuzzerLogFile-0-wzupFKMRcr.data.yaml unique.covreport
partial_sort_copy fuzzerLogFile-0-FJgGCZyQvg.data fuzzerLogFile-0-FJgGCZyQvg.data.yaml partial_sort_copy.covreport
unique_copy fuzzerLogFile-0-8Oi8XJd0F3.data fuzzerLogFile-0-8Oi8XJd0F3.data.yaml unique_copy.covreport
pop_heap fuzzerLogFile-0-wup3iRaYEK.data fuzzerLogFile-0-wup3iRaYEK.data.yaml pop_heap.covreport
stable_sort fuzzerLogFile-0-zWeKhvM9Ld.data fuzzerLogFile-0-zWeKhvM9Ld.data.yaml stable_sort.covreport
push_heap fuzzerLogFile-0-ztiHBVYhox.data fuzzerLogFile-0-ztiHBVYhox.data.yaml push_heap.covreport
make_heap fuzzerLogFile-0-weKdQ5qiBh.data fuzzerLogFile-0-weKdQ5qiBh.data.yaml make_heap.covreport
nth_element fuzzerLogFile-0-cZP9kWYSP4.data fuzzerLogFile-0-cZP9kWYSP4.data.yaml nth_element.covreport
partial_sort fuzzerLogFile-0-QAOxSLIvfB.data fuzzerLogFile-0-QAOxSLIvfB.data.yaml partial_sort.covreport
partition_copy fuzzerLogFile-0-0oohXu6wIN.data fuzzerLogFile-0-0oohXu6wIN.data.yaml partition_copy.covreport
partition fuzzerLogFile-0-1KjhTahrya.data fuzzerLogFile-0-1KjhTahrya.data.yaml partition.covreport
sort fuzzerLogFile-0-vLcAw9xrmN.data fuzzerLogFile-0-vLcAw9xrmN.data.yaml sort.covreport
stable_partition fuzzerLogFile-0-dw0FTT7Dev.data fuzzerLogFile-0-dw0FTT7Dev.data.yaml stable_partition.covreport
random fuzzerLogFile-0-xt64KM3dif.data fuzzerLogFile-0-xt64KM3dif.data.yaml random.covreport
format_no_args fuzzerLogFile-0-ar6BJTNnlL.data fuzzerLogFile-0-ar6BJTNnlL.data.yaml format_no_args.covreport
regex fuzzerLogFile-0-VugZdFM7lP.data fuzzerLogFile-0-VugZdFM7lP.data.yaml unique.covreport , stable_partition.covreport , stable_sort.covreport , make_heap.covreport , partition.covreport , search.covreport , nth_element.covreport , format_no_args.covreport , pop_heap.covreport , partition_copy.covreport , partial_sort_copy.covreport , partial_sort.covreport , random.covreport , push_heap.covreport , sort.covreport , unique_copy.covreport