# trailofbits/protofuzz

### Showing 17 of 17 total issues

#### Function `_fuzzdb_get_strings` has a Cognitive Complexity of 23 (exceeds 5 allowed). Consider refactoring. Open

``````def _fuzzdb_get_strings(max_len=0):
"""Return strings from fuzzdb."""
ignored = ["integer-overflow"]

for subdir in pkg_resources.resource_listdir("protofuzz", BASE_PATH):``````
Found in protofuzz/values.py - About 3 hrs to fix

# Cognitive Complexity

Cognitive Complexity is a measure of how difficult a unit of code is to intuitively understand. Unlike Cyclomatic Complexity, which determines how difficult your code will be to test, Cognitive Complexity tells you how difficult your code will be to read and comprehend.

### A method's cognitive complexity is based on a few simple rules:

• Code is not considered more complex when it uses shorthand that the language provides for collapsing multiple statements into one
• Code is considered more complex for each "break in the linear flow of the code"
• Code is considered more complex when "flow breaking structures are nested"

#### Cyclomatic complexity is too high in function _fuzzdb_get_strings. (11) Open

``````def _fuzzdb_get_strings(max_len=0):
"""Return strings from fuzzdb."""
ignored = ["integer-overflow"]

for subdir in pkg_resources.resource_listdir("protofuzz", BASE_PATH):``````

## Cyclomatic Complexity

Cyclomatic Complexity corresponds to the number of decisions a block of code contains plus 1. This number (also called McCabe number) is equal to the number of linearly independent paths through the code. This number can be used as a guide when testing conditional logic in blocks.

Radon analyzes the AST tree of a Python program to compute Cyclomatic Complexity. Statements have the following effects on Cyclomatic Complexity:

Construct Effect on CC Reasoning
if +1 An if statement is a single decision.
elif +1 The elif statement adds another decision.
else +0 The else statement does not cause a new decision. The decision is at the if.
for +1 There is a decision at the start of the loop.
while +1 There is a decision at the while statement.
except +1 Each except branch adds a new conditional path of execution.
finally +0 The finally block is unconditionally executed.
with +1 The with statement roughly corresponds to a try/except block (see PEP 343 for details).
assert +1 The assert statement internally roughly equals a conditional statement.
Comprehension +1 A list/set/dict comprehension of generator expression is equivalent to a for loop.
Boolean Operator +1 Every boolean operator (and, or) adds a decision point.

#### Cyclomatic complexity is too high in function _prototype_to_generator. (9) Open

``````def _prototype_to_generator(descriptor, cls):
"""Return map of descriptor to a protofuzz generator."""
_fd = D.FieldDescriptor
generator = None

``````

## Cyclomatic Complexity

Cyclomatic Complexity corresponds to the number of decisions a block of code contains plus 1. This number (also called McCabe number) is equal to the number of linearly independent paths through the code. This number can be used as a guide when testing conditional logic in blocks.

Radon analyzes the AST tree of a Python program to compute Cyclomatic Complexity. Statements have the following effects on Cyclomatic Complexity:

Construct Effect on CC Reasoning
if +1 An if statement is a single decision.
elif +1 The elif statement adds another decision.
else +0 The else statement does not cause a new decision. The decision is at the if.
for +1 There is a decision at the start of the loop.
while +1 There is a decision at the while statement.
except +1 Each except branch adds a new conditional path of execution.
finally +0 The finally block is unconditionally executed.
with +1 The with statement roughly corresponds to a try/except block (see PEP 343 for details).
assert +1 The assert statement internally roughly equals a conditional statement.
Comprehension +1 A list/set/dict comprehension of generator expression is equivalent to a for loop.
Boolean Operator +1 Every boolean operator (and, or) adds a decision point.

#### Cyclomatic complexity is too high in method _resolve_child. (6) Open

``````    def _resolve_child(self, path):
"""Return a member generator by a dot-delimited path."""
obj = self

for component in path.split("."):``````

## Cyclomatic Complexity

Cyclomatic Complexity corresponds to the number of decisions a block of code contains plus 1. This number (also called McCabe number) is equal to the number of linearly independent paths through the code. This number can be used as a guide when testing conditional logic in blocks.

Radon analyzes the AST tree of a Python program to compute Cyclomatic Complexity. Statements have the following effects on Cyclomatic Complexity:

Construct Effect on CC Reasoning
if +1 An if statement is a single decision.
elif +1 The elif statement adds another decision.
else +0 The else statement does not cause a new decision. The decision is at the if.
for +1 There is a decision at the start of the loop.
while +1 There is a decision at the while statement.
except +1 Each except branch adds a new conditional path of execution.
finally +0 The finally block is unconditionally executed.
with +1 The with statement roughly corresponds to a try/except block (see PEP 343 for details).
assert +1 The assert statement internally roughly equals a conditional statement.
Comprehension +1 A list/set/dict comprehension of generator expression is equivalent to a for loop.
Boolean Operator +1 Every boolean operator (and, or) adds a decision point.

#### Cyclomatic complexity is too high in function find_protoc. (6) Open

``````def find_protoc(path=os.environ["PATH"]):
"""Traverse a path (\$PATH by default) to find the protoc compiler."""
protoc_filenames = ["protoc", "protoc.exe"]

bin_search_paths = path.split(os.pathsep) or []``````

## Cyclomatic Complexity

Cyclomatic Complexity corresponds to the number of decisions a block of code contains plus 1. This number (also called McCabe number) is equal to the number of linearly independent paths through the code. This number can be used as a guide when testing conditional logic in blocks.

Radon analyzes the AST tree of a Python program to compute Cyclomatic Complexity. Statements have the following effects on Cyclomatic Complexity:

Construct Effect on CC Reasoning
if +1 An if statement is a single decision.
elif +1 The elif statement adds another decision.
else +0 The else statement does not cause a new decision. The decision is at the if.
for +1 There is a decision at the start of the loop.
while +1 There is a decision at the while statement.
except +1 Each except branch adds a new conditional path of execution.
finally +0 The finally block is unconditionally executed.
with +1 The with statement roughly corresponds to a try/except block (see PEP 343 for details).
assert +1 The assert statement internally roughly equals a conditional statement.
Comprehension +1 A list/set/dict comprehension of generator expression is equivalent to a for loop.
Boolean Operator +1 Every boolean operator (and, or) adds a decision point.

#### Function `_prototype_to_generator` has a Cognitive Complexity of 9 (exceeds 5 allowed). Consider refactoring. Open

``````def _prototype_to_generator(descriptor, cls):
"""Return map of descriptor to a protofuzz generator."""
_fd = D.FieldDescriptor
generator = None

``````
Found in protofuzz/protofuzz.py - About 55 mins to fix

# Cognitive Complexity

Cognitive Complexity is a measure of how difficult a unit of code is to intuitively understand. Unlike Cyclomatic Complexity, which determines how difficult your code will be to test, Cognitive Complexity tells you how difficult your code will be to read and comprehend.

### A method's cognitive complexity is based on a few simple rules:

• Code is not considered more complex when it uses shorthand that the language provides for collapsing multiple statements into one
• Code is considered more complex for each "break in the linear flow of the code"
• Code is considered more complex when "flow breaking structures are nested"

#### Function `find_protoc` has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring. Open

``````def find_protoc(path=os.environ["PATH"]):
"""Traverse a path (\$PATH by default) to find the protoc compiler."""
protoc_filenames = ["protoc", "protoc.exe"]

bin_search_paths = path.split(os.pathsep) or []``````
Found in protofuzz/pbimport.py - About 45 mins to fix

# Cognitive Complexity

Cognitive Complexity is a measure of how difficult a unit of code is to intuitively understand. Unlike Cyclomatic Complexity, which determines how difficult your code will be to test, Cognitive Complexity tells you how difficult your code will be to read and comprehend.

### A method's cognitive complexity is based on a few simple rules:

• Code is not considered more complex when it uses shorthand that the language provides for collapsing multiple statements into one
• Code is considered more complex for each "break in the linear flow of the code"
• Code is considered more complex when "flow breaking structures are nested"

#### Function `step_generator` has a Cognitive Complexity of 7 (exceeds 5 allowed). Consider refactoring. Open

``````    def step_generator(self, generators):
if len(generators) < 1:
yield ()
else:
first, rest = generators, generators[1:]``````
Found in protofuzz/gen.py - About 35 mins to fix

# Cognitive Complexity

Cognitive Complexity is a measure of how difficult a unit of code is to intuitively understand. Unlike Cyclomatic Complexity, which determines how difficult your code will be to test, Cognitive Complexity tells you how difficult your code will be to read and comprehend.

### A method's cognitive complexity is based on a few simple rules:

• Code is not considered more complex when it uses shorthand that the language provides for collapsing multiple statements into one
• Code is considered more complex for each "break in the linear flow of the code"
• Code is considered more complex when "flow breaking structures are nested"

#### Function `get_integers` has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring. Open

``````def get_integers(bitwidth, unsigned, limit=0):
"""Return integers from fuzzdb database.

bitwidth - The bitwidth that has to contain the integer
unsigned - Whether the type is unsigned``````
Found in protofuzz/values.py - About 25 mins to fix

# Cognitive Complexity

Cognitive Complexity is a measure of how difficult a unit of code is to intuitively understand. Unlike Cyclomatic Complexity, which determines how difficult your code will be to test, Cognitive Complexity tells you how difficult your code will be to read and comprehend.

### A method's cognitive complexity is based on a few simple rules:

• Code is not considered more complex when it uses shorthand that the language provides for collapsing multiple statements into one
• Code is considered more complex for each "break in the linear flow of the code"
• Code is considered more complex when "flow breaking structures are nested"

#### Whitespace before ':' Open

``            entries = entries[-self._size :]``
Found in protofuzz/log.py by pep8

Avoid extraneous whitespace.

``````Avoid extraneous whitespace in these situations:
- Immediately inside parentheses, brackets or braces.
- Immediately before a comma, semicolon, or colon.

Okay: spam(ham, {eggs: 2})
E201: spam( ham, {eggs: 2})
E201: spam(ham[ 1], {eggs: 2})
E201: spam(ham, { eggs: 2})
E202: spam(ham, {eggs: 2} )
E202: spam(ham[1 ], {eggs: 2})
E202: spam(ham, {eggs: 2 })

E203: if x == 4: print x, y; x, y = y , x
E203: if x == 4: print x, y ; x, y = y, x
E203: if x == 4 : print x, y; x, y = y, x``````

#### Closing bracket does not match visual indentation Open

``)``
Found in setup.py by pep8

Continuation lines indentation.

``````Continuation lines should align wrapped elements either vertically
using Python's implicit line joining inside parentheses, brackets
and braces, or using a hanging indent.

When using a hanging indent these considerations should be applied:
- there should be no arguments on the first line, and
- further indentation should be used to clearly distinguish itself as a
continuation line.

Okay: a = (\n)
E123: a = (\n    )

Okay: a = (\n    42)
E121: a = (\n   42)
E122: a = (\n42)
E123: a = (\n    42\n    )
E124: a = (24,\n     42\n)
E125: if (\n    b):\n    pass
E126: a = (\n        42)
E127: a = (24,\n      42)
E128: a = (24,\n    42)
E129: if (a or\n    b):\n    pass
E131: a = (\n    42\n 24)``````

#### FIXME found Open

``# FIXME: Package containing module 'google' is not listed in project requirements``
Found in protofuzz/protofuzz.py by fixme

#### FIXME found Open

``        ):  # FIXME unresolved attribute reference 'peek' for BinaryIO``
Found in protofuzz/log.py by fixme

#### FIXME found Open

``        self._limit = self._limit - 1  # FIXME: refactor``
Found in protofuzz/gen.py by fixme

#### FIXME found Open

``        return ptr, obj  # FIXME: ptr might be referenced before assignment``
Found in protofuzz/gen.py by fixme

#### FIXME found Open

``    module = None  # FIXME: better if/else switch statement``
Found in protofuzz/pbimport.py by fixme

#### FIXME found Open

``            limit = limit - 1  # FIXME``
Found in protofuzz/values.py by fixme