tlsfuzzer/tlslite-ng

View on GitHub
tlslite/utils/brotlidecpy/decode.py

Summary

Maintainability
F
6 days
Test Coverage
F
52%

Function brotli_decompress_buffer has a Cognitive Complexity of 100 (exceeds 5 allowed). Consider refactoring.
Open

def brotli_decompress_buffer(input_buffer, buffer_limit=None):
    br = BrotliBitReader(input_buffer)
    output_buffer = bytearray([])
    pos = 0
    input_end = 0
Severity: Minor
Found in tlslite/utils/brotlidecpy/decode.py - About 2 days 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"

Further reading

File decode.py has 525 lines of code (exceeds 250 allowed). Consider refactoring.
Open

# Copyright 2021 Sidney Markowitz All Rights Reserved.
# Distributed under MIT license.
# See file LICENSE for detail or copy at https://opensource.org/licenses/MIT

from .huffman import HuffmanCode, brotli_build_huffman_table
Severity: Major
Found in tlslite/utils/brotlidecpy/decode.py - About 1 day to fix

    Cyclomatic complexity is too high in function brotli_decompress_buffer. (37)
    Open

    def brotli_decompress_buffer(input_buffer, buffer_limit=None):
        br = BrotliBitReader(input_buffer)
        output_buffer = bytearray([])
        pos = 0
        input_end = 0
    Severity: Minor
    Found in tlslite/utils/brotlidecpy/decode.py by radon

    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.

    Source: http://radon.readthedocs.org/en/latest/intro.html

    Function read_huffman_code has a Cognitive Complexity of 37 (exceeds 5 allowed). Consider refactoring.
    Open

    def read_huffman_code(alphabet_size, tables, table, br):
        code_lengths = bytearray([0] * alphabet_size)
    
        # simple_code_or_skip is used as follows:
        # 1 for simple code
    Severity: Minor
    Found in tlslite/utils/brotlidecpy/decode.py - About 5 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"

    Further reading

    Function read_huffman_code_lengths has a Cognitive Complexity of 28 (exceeds 5 allowed). Consider refactoring.
    Open

    def read_huffman_code_lengths(code_length_code_lengths, num_symbols,
                                  code_lengths, br):
        symbol = 0
        prev_code_len = kDefaultCodeLength
        repeat = 0
    Severity: Minor
    Found in tlslite/utils/brotlidecpy/decode.py - About 4 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"

    Further reading

    Cyclomatic complexity is too high in function read_huffman_code. (24)
    Open

    def read_huffman_code(alphabet_size, tables, table, br):
        code_lengths = bytearray([0] * alphabet_size)
    
        # simple_code_or_skip is used as follows:
        # 1 for simple code
    Severity: Minor
    Found in tlslite/utils/brotlidecpy/decode.py by radon

    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.

    Source: http://radon.readthedocs.org/en/latest/intro.html

    Function decode_meta_block_length has a Cognitive Complexity of 21 (exceeds 5 allowed). Consider refactoring.
    Open

    def decode_meta_block_length(br):
        out = MetaBlockLength()
        out.input_end = br.read_bits(1)
        if out.input_end and br.read_bits(1):
            return out
    Severity: Minor
    Found in tlslite/utils/brotlidecpy/decode.py - About 2 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"

    Further reading

    Cyclomatic complexity is too high in function decode_meta_block_length. (16)
    Open

    def decode_meta_block_length(br):
        out = MetaBlockLength()
        out.input_end = br.read_bits(1)
        if out.input_end and br.read_bits(1):
            return out
    Severity: Minor
    Found in tlslite/utils/brotlidecpy/decode.py by radon

    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.

    Source: http://radon.readthedocs.org/en/latest/intro.html

    Cyclomatic complexity is too high in function read_huffman_code_lengths. (14)
    Open

    def read_huffman_code_lengths(code_length_code_lengths, num_symbols,
                                  code_lengths, br):
        symbol = 0
        prev_code_len = kDefaultCodeLength
        repeat = 0
    Severity: Minor
    Found in tlslite/utils/brotlidecpy/decode.py by radon

    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.

    Source: http://radon.readthedocs.org/en/latest/intro.html

    Function __init__ has a Cognitive Complexity of 15 (exceeds 5 allowed). Consider refactoring.
    Open

        def __init__(self, context_map_size, br):
            max_run_length_prefix = 0
            self.num_huff_trees = decode_var_len_uint8(br) + 1
            self.context_map = bytearray([0] * context_map_size)
    
    
    Severity: Minor
    Found in tlslite/utils/brotlidecpy/decode.py - About 1 hr 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"

    Further reading

    Function decode_block_type has 7 arguments (exceeds 4 allowed). Consider refactoring.
    Open

    def decode_block_type(max_block_type, trees, tree_type, block_types,
    Severity: Major
    Found in tlslite/utils/brotlidecpy/decode.py - About 50 mins to fix

      Avoid deeply nested control flow statements.
      Open

                          if transform_idx < kNumTransforms:
                              length = Transform.transformDictionaryWord(
                                  output_buffer, copy_dst, offset, copy_length,
                                  transform_idx)
                              copy_dst += length
      Severity: Major
      Found in tlslite/utils/brotlidecpy/decode.py - About 45 mins to fix

        Consider simplifying this complex logical expression.
        Open

                    if (
                        symbols[0] == symbols[1] or symbols[0] == symbols[2] or
                        symbols[0] == symbols[3] or symbols[1] == symbols[2] or
                        symbols[1] == symbols[3] or symbols[2] == symbols[3]
                    ):
        Severity: Major
        Found in tlslite/utils/brotlidecpy/decode.py - About 40 mins to fix

          Similar blocks of code found in 2 locations. Consider refactoring.
          Open

                  for i in range(0, size_bytes):
                      next_byte = br.read_bits(8)
                      if i + 1 == size_bytes and size_bytes > 1 and next_byte == 0:
                          raise Exception('Invalid size byte')
          
          
          Severity: Major
          Found in tlslite/utils/brotlidecpy/decode.py and 1 other location - About 4 hrs to fix
          tlslite/utils/brotlidecpy/decode.py on lines 82..104

          Duplicated Code

          Duplicated code can lead to software that is hard to understand and difficult to change. The Don't Repeat Yourself (DRY) principle states:

          Every piece of knowledge must have a single, unambiguous, authoritative representation within a system.

          When you violate DRY, bugs and maintenance problems are sure to follow. Duplicated code has a tendency to both continue to replicate and also to diverge (leaving bugs as two similar implementations differ in subtle ways).

          Tuning

          This issue has a mass of 84.

          We set useful threshold defaults for the languages we support but you may want to adjust these settings based on your project guidelines.

          The threshold configuration represents the minimum mass a code block must have to be analyzed for duplication. The lower the threshold, the more fine-grained the comparison.

          If the engine is too easily reporting duplication, try raising the threshold. If you suspect that the engine isn't catching enough duplication, try lowering the threshold. The best setting tends to differ from language to language.

          See codeclimate-duplication's documentation for more information about tuning the mass threshold in your .codeclimate.yml.

          Refactorings

          Further Reading

          Similar blocks of code found in 2 locations. Consider refactoring.
          Open

              if size_nibbles == 7:
                  out.is_metadata = True
          
                  if br.read_bits(1) != 0:
                      raise Exception('Invalid reserved bit')
          Severity: Major
          Found in tlslite/utils/brotlidecpy/decode.py and 1 other location - About 4 hrs to fix
          tlslite/utils/brotlidecpy/decode.py on lines 92..97

          Duplicated Code

          Duplicated code can lead to software that is hard to understand and difficult to change. The Don't Repeat Yourself (DRY) principle states:

          Every piece of knowledge must have a single, unambiguous, authoritative representation within a system.

          When you violate DRY, bugs and maintenance problems are sure to follow. Duplicated code has a tendency to both continue to replicate and also to diverge (leaving bugs as two similar implementations differ in subtle ways).

          Tuning

          This issue has a mass of 84.

          We set useful threshold defaults for the languages we support but you may want to adjust these settings based on your project guidelines.

          The threshold configuration represents the minimum mass a code block must have to be analyzed for duplication. The lower the threshold, the more fine-grained the comparison.

          If the engine is too easily reporting duplication, try raising the threshold. If you suspect that the engine isn't catching enough duplication, try lowering the threshold. The best setting tends to differ from language to language.

          See codeclimate-duplication's documentation for more information about tuning the mass threshold in your .codeclimate.yml.

          Refactorings

          Further Reading

          There are no issues that match your filters.

          Category
          Status