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

Project functions overview

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 Runtime reached by Fuzzers Combined 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 details

Fuzzer: fuzz_parse

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

Fuzz blockers

The following nodes represent call sites where fuzz blockers occur.

Amount of callsites blocked Calltree index Parent function Callsite Largest blocked function
15 27 ...fuzz_parse.dict_parse_generator call site: 00027 pyparsing.core.token_map.pa
7 5 ...fuzz_parse.dict_parse_generator call site: 00005 pyparsing.util._flatten
7 13 ...fuzz_parse.dict_parse_generator call site: 00013 pyparsing.util.col
2 21 ...fuzz_parse.dict_parse_generator call site: 00021 pyparsing.util.col
2 104 pyparsing.util._collapse_string_to_ranges call site: 00104 pyparsing.util._collapse_string_to_ranges.no_escape_re_range_char
2 127 pyparsing.core.NoMatch.__init__ call site: 00127 pyparsing.core._PendingSkip.__init__
1 81 pyparsing.core.Word.__init__ call site: 00081 .set
1 125 ...fuzz_parse.dict_parse_generator call site: 00125 pyparsing.core.NoMatch.__init__

Runtime coverage analysis

Covered functions
225
Functions that are reachable but not covered
44
Reachable functions
57
Percentage of reachable functions covered
22.81%
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
/ 1
...fuzz_parse 26
pyparsing.helpers 7
pyparsing.util 18
pyparsing.core 21

Analyses and suggestions

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
pyparsing.core.ParserElement.parse_string pyparsing.core 4 ['N/A', 'N/A', 'N/A', 'N/A'] 4 0 5 4 5 82 1 263 193
pyparsing.core.ParserElement.run_tests pyparsing.core 15 ['N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A'] 5 0 17 13 8 75 1 239 138
pyparsing.diagram.to_railroad pyparsing.diagram 6 ['N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A'] 6 0 5 5 5 44 1 159 123
pyparsing.helpers._makeTags pyparsing.helpers 4 ['N/A', 'N/A', 'N/A', 'N/A'] 6 0 3 2 4 87 4 278 110
pyparsing.core.IndentedBlock.parseImpl pyparsing.core 4 ['N/A', 'N/A', 'N/A', 'N/A'] 5 0 3 2 4 56 0 175 81
pyparsing.helpers.one_of pyparsing.helpers 6 ['N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A'] 2 0 6 11 7 31 1 102 60
pyparsing.results.ParseResults.dump pyparsing.results 5 ['N/A', 'N/A', 'N/A', 'N/A', 'N/A'] 3 0 9 7 6 19 1 66 45
pyparsing.core.Each.parseImpl pyparsing.core 4 ['N/A', 'N/A', 'N/A', 'N/A'] 3 0 10 8 6 18 0 63 42
pyparsing.helpers.infix_notation pyparsing.helpers 4 ['N/A', 'N/A', 'N/A', 'N/A'] 6 0 4 21 11 54 1 177 40
pyparsing.core._MultipleMatch.parseImpl pyparsing.core 4 ['N/A', 'N/A', 'N/A', 'N/A'] 4 0 2 4 5 49 0 162 39

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

Functions statically reachable by fuzzers
17.0%
79 / 469
Cyclomatic complexity statically reachable by fuzzers
20.0%
327 / 1656

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 Runtime reached by Fuzzers Combined 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