Math::decodeCompact() - Code Metrics - Bit-Wasp/bitcoin-php - Measure and Improve Code Quality continuously with Scrutinizer

Math::decodeCompact() B
last analyzed 2021-04-16 17:34 UTC

↳ Parent: Math

Complexity

Conditions	10
Paths	33

Size

Total Lines	28
Code Lines	18

Duplication

Lines	0
Ratio	0 %

Code Coverage

Tests	17
CRAP Score	10.017

Importance

Changes	1
Bugs	0	Features	0

Metric	Value
cc	10
eloc	18
c	1
b	0
f	0
nc	33
nop	3
dl	0
loc	28
ccs	17
cts	18
cp	0.9444
crap	10.017
rs	7.6666

How to fix Complexity

<?php

declare(strict_types=1);

namespace BitWasp\Bitcoin\Math;

use Mdanter\Ecc\Math\GmpMath;
use Mdanter\Ecc\Util\NumberSize;

class Math extends GmpMath
{

    /**
     * @param \GMP $integer
     * @return bool
     */
    public function isEven(\GMP $integer): bool
    {
        return $this->cmp($this->mod($integer, gmp_init(2)), gmp_init(0)) === 0;
        return $this->cmp($this->mod($integer, gmp_init(2)), /** @scrutinizer ignore-type */ gmp_init(0)) === 0;
    }

    /**
     * @param \GMP $int
     * @param \GMP $otherInt
     * @return \GMP
     */
    public function bitwiseOr(\GMP $int, \GMP $otherInt): \GMP
    {
        return gmp_or($int, $otherInt);

    }

    /**
     * Similar to gmp_div_qr, return a tuple containing the
     * result and the remainder
     *
     * @param \GMP $dividend
     * @param \GMP $divisor
     * @return array
     */
    public function divQr(\GMP $dividend, \GMP $divisor): array
    {
        // $div = n / q
        $div = $this->div($dividend, $divisor);
        // $remainder = n - (n / q) * q
        $remainder = $this->sub($dividend, $this->mul($div, $divisor));
        return [$div, $remainder];
    }

    /**
     * @param int $compact
     * @param bool|false $isNegative
     * @param bool|false $isOverflow
     * @return \GMP
     */
    public function decodeCompact($compact, &$isNegative, &$isOverflow): \GMP
    {
        if ($compact < 0 || $compact > pow(2, 32) - 1) {
            throw new \RuntimeException('Compact integer must be 32bit');
        }

        $compact = gmp_init($compact, 10);
        $size = $this->rightShift($compact, 24);
        $size = $this->rightShift(/** @scrutinizer ignore-type */ $compact, 24);
        $word = $this->bitwiseAnd($compact, gmp_init(0x007fffff, 10));
        $word = $this->bitwiseAnd($compact, /** @scrutinizer ignore-type */ gmp_init(0x007fffff, 10));
        if ($this->cmp($size, gmp_init(3)) <= 0) {
        if ($this->cmp($size, /** @scrutinizer ignore-type */ gmp_init(3)) <= 0) {
            $positions = (int) $this->toString($this->mul(gmp_init(8, 10), $this->sub(gmp_init(3, 10), $size)));
            $positions = (int) $this->toString($this->mul(gmp_init(8, 10), $this->sub(/** @scrutinizer ignore-type */ gmp_init(3, 10), $size)));
            $word = $this->rightShift($word, $positions);
        } else {
            $positions = (int) $this->toString($this->mul(gmp_init(8, 10), $this->sub($size, gmp_init(3, 10))));
            $positions = (int) $this->toString($this->mul(gmp_init(8, 10), $this->sub($size, /** @scrutinizer ignore-type */ gmp_init(3, 10))));
            $word = $this->leftShift($word, $positions);
        }

        // isNegative: $word !== 0 && $uint32 & 0x00800000 !== 0
        // isOverflow: $word !== 0 && (($size > 34) || ($word > 0xff && $size > 33) || ($word > 0xffff && $size > 32))
        $zero = gmp_init(0);
        $isNegative = ($this->cmp($word, $zero) !== 0) && ($this->cmp($this->bitwiseAnd($compact, gmp_init(0x00800000)), $zero) === 1);
        $isOverflow = $this->cmp($word, $zero) !== 0 && (
                ($this->cmp($size, gmp_init(34, 10)) > 0)
                || ($this->cmp($word, gmp_init(0xff, 10)) > 0 && $this->cmp($size, gmp_init(33, 10)) > 0)
                || ($this->cmp($word, gmp_init(0xffff, 10)) > 0 && $this->cmp($size, gmp_init(32, 10)) > 0)
            );

        return $word;
    }

    /**
     * @param \GMP $integer
     * @return \GMP
     */
    public function getLow64(\GMP $integer): \GMP
    {
        $bits = gmp_strval($integer, 2);
        $bits = substr($bits, 0, 64);
        $bits = str_pad($bits, 64, '0', STR_PAD_LEFT);
        return gmp_init($bits, 2);

    }

    /**
     * @param \GMP $int
     * @param int $byteSize
     * @return string
     */
    public function fixedSizeInt(\GMP $int, int $byteSize): string
    {
        $two = gmp_init(2);
        $maskShift = gmp_pow($two, 8);
        $mask = gmp_mul(gmp_init(255), gmp_pow($two, 256));

        $x = '';
        for ($i = $byteSize - 1; $i >= 0; $i--) {
            $mask = gmp_div($mask, $maskShift);
            $x .= pack('C', gmp_strval(gmp_div(gmp_and($int, $mask), gmp_pow($two, $i * 8)), 10));
        }

        return $x;
    }

    /**
     * @param \GMP $integer
     * @param bool $fNegative
     * @return \GMP
     */
    public function encodeCompact(\GMP $integer, bool $fNegative): \GMP
    {
        if (!is_bool($fNegative)) {

            throw new \InvalidArgumentException('CompactInteger::read() - flag must be boolean!');
        }

        $size = (int) NumberSize::bnNumBytes($this, $integer);
        if ($size <= 3) {
            $compact = $this->leftShift($this->getLow64($integer), (8 * (3 - $size)));
        } else {
            $compact = $this->rightShift($integer, 8 * ($size - 3));
            $compact = $this->getLow64($compact);
        }

        if ($this->cmp($this->bitwiseAnd($compact, gmp_init(0x00800000, 10)), gmp_init(0, 10)) > 0) {
        if ($this->cmp($this->bitwiseAnd($compact, /** @scrutinizer ignore-type */ gmp_init(0x00800000, 10)), gmp_init(0, 10)) > 0) {
            $compact = $this->rightShift($compact, 8);
            $size = $size + 1;
        }

        $compact = $this->bitwiseOr($compact, $this->leftShift(gmp_init($size, 10), 24));
        $compact = $this->bitwiseOr($compact, $this->leftShift(/** @scrutinizer ignore-type */ gmp_init($size, 10), 24));
        if ($fNegative && $this->cmp($this->bitwiseAnd($compact, gmp_init(0x007fffff, 10)), gmp_init(0, 10)) > 0) { /// ?
            $compact = $this->bitwiseOr($compact, gmp_init(0x00800000, 10));
            $compact = $this->bitwiseOr($compact, /** @scrutinizer ignore-type */ gmp_init(0x00800000, 10));
        }

        return $compact;
    }
}


Bit-Wasp / bitcoin-php

Math::decodeCompact() B last analyzed 2021-04-16 17:34 UTC

Complexity

Size

Duplication

Code Coverage

Importance

How to fix Complexity

Long Method

Duplication Side-by-Side

Filter issues like

Math::decodeCompact() B
last analyzed 2021-04-16 17:34 UTC