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

Fuzzer details

Fuzzer: fuzz_recompiler

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 358 70.3%
gold [1:9] 0 0.0%
yellow [10:29] 0 0.0%
greenyellow [30:49] 0 0.0%
lawngreen 50+ 151 29.6%
All colors 509 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
67 239 cffi.model.StructOrUnionOrEnum.force_the_name call site: 00239 cffi.api.FFI._get_cached_btype
48 148 cffi.cparser.Parser._parse call site: 00148 cffi.cparser.Parser._get_type_and_quals
38 462 cffi.recompiler.Recompiler._add_missing_struct_unions call site: 00462 cffi.recompiler.Recompiler._struct_ctx
35 381 cffi.cparser.Parser._internal_parse call site: 00381 cffi.cparser.Parser._parse_decl
20 34 cffi.model.ArrayType.build_backend_type call site: 00034 cffi.model.StructOrUnion.finish_backend_type
19 201 cffi.model.PointerType.__init__ call site: 00201 cffi.cparser.Parser._get_struct_union_enum_type
17 221 cffi.model.StructOrUnion.__init__ call site: 00221 cffi.cparser.Parser._build_enum_type
17 316 cffi.model.BaseTypeByIdentity.get_cached_btype call site: 00316 cffi.model.EnumType.build_baseinttype
15 419 cffi.model.unknown_type call site: 00419 cffi.cparser.Parser._get_type_and_quals
12 62 cffi.cparser._preprocess call site: 00062 cffi.cparser._workaround_for_old_pycparser
12 79 cffi.cparser._preprocess_extern_python call site: 00079 match.end
11 369 cffi.cparser.Parser._process_macros call site: 00369 cffi.cparser.Parser._add_integer_constant

Runtime coverage analysis

Covered functions
88
Functions that are reachable but not covered
184
Reachable functions
231
Percentage of reachable functions covered
20.35%
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
/ 1
...fuzz_recompiler 7
cffi.api 33
cffi.cparser 126
cffi.model 65
cffi.commontypes 4
cffi.recompiler 30

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
cffi.api.FFI.distutils_extension cffi.api 3 ['N/A', 'N/A', 'N/A'] 5 0 3 5 5 143 0 474 320
cffi.recompiler.Recompiler._generate_cpy_function_decl cffi.recompiler 3 ['N/A', 'N/A', 'N/A'] 3 0 51 14 9 40 0 141 75
cffi.verifier.Verifier.__init__ cffi.verifier 12 ['N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A', 'N/A'] 2 0 1 5 5 28 1 96 72
cffi.setuptools_ext.add_cffi_module cffi.setuptools_ext 2 ['N/A', 'N/A'] 2 0 10 8 6 26 1 85 55
cffi.vengine_cpy.VCPythonEngine._generate_cpy_function_decl cffi.vengine_cpy 3 ['N/A', 'N/A', 'N/A'] 2 0 32 7 6 29 0 101 46
cffi.vengine_gen.VGenericEngine._loaded_gen_function cffi.vengine_gen 5 ['N/A', 'N/A', 'N/A', 'N/A', 'N/A'] 11 0 6 5 5 178 0 605 44

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

Functions statically reachable by fuzzers
30.0%
160 / 539
Cyclomatic complexity statically reachable by fuzzers
34.0%
643 / 1890

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