High level conclusions

Fuzzers reach 57.52% code coverage.

Fuzzers reach 79.08% of cyclomatic complexity.

Fuzzers reach 60.17% of all functions.

Fuzzer regex is blocked:

The runtime code coverage of regex covers 6.666% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Reachability and coverage overview

Functions statically reachable by fuzzers

68 / 113

Cyclomatic complexity statically reachable by fuzzers

397 / 502

Runtime code coverage of functions

65 / 113

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

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

Optimal target analysis

Remaining optimal interesting functions

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.

Func name	Functions filename	Arg count	Args	Function depth	hitcount	instr count	bb count	cyclomatic complexity	Reachable functions	Incoming references	total cyclomatic complexity	Unreached complexity

Implementing fuzzers that target the above functions will improve reachability such that it becomes:

Functions statically reachable by fuzzers

68 / 113

Cyclomatic complexity statically reachable by fuzzers

397 / 502

All functions overview

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.

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']

This section shows analysis of runtime coverage data.

For futher technical details on how this section is generated, please see the Glossary .

Complex functions with low coverage

Func name	Function total lines	Lines covered at runtime	percentage covered	Reached by fuzzers

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/