line |
true |
false |
branch |
637
|
0 |
0 |
unless ($BGCD_CHECK) |
651
|
0 |
0 |
if ($ki <= 31) |
667
|
0 |
0 |
if $p >= $sqrt |
670
|
0 |
0 |
unless ($n % $p) |
693
|
0 |
0 |
if ($ki > 2 * $MI) { } |
697
|
0 |
0 |
if $ki * (1 - $r) > $MI |
710
|
0 |
0 |
ref $q ? : |
727
|
0 |
0 |
unless $n->bgcd($BGCD_CHECK)->is_one |
737
|
0 |
0 |
unless _millerrabin($n, 1, 1) |
742
|
0 |
0 |
if ($a->copy->bmodpow($n->copy->bdec, $n)->is_one) |
745
|
0 |
0 |
if ($a->bdec->bgcd($n)->is_one) |
756
|
0 |
0 |
if $t < 1 |
757
|
0 |
0 |
if $kn < 0 or $kn > 1 |
761
|
0 |
0 |
$is_bigint ? : |
|
0 |
0 |
$is_bigint ? : |
|
0 |
0 |
if ($is_bigint ? $n->ble($_MBI_3) : $n <= 3) { } |
|
0 |
0 |
elsif ($is_bigint ? $n->is_even : !($n & 1)) { } |
762
|
0 |
0 |
if $n > 1 |
769
|
0 |
0 |
$is_bigint ? : |
773
|
0 |
0 |
$is_bigint ? : |
775
|
0 |
0 |
$is_bigint ? : |
783
|
0 |
0 |
if ($i == 0 and $kn == 1) { } |
787
|
0 |
0 |
$is_bigint ? : |
791
|
0 |
0 |
unless $is_bigint |
794
|
0 |
0 |
if (not $a->is_one and $a->bne($n1)) |
800
|
0 |
0 |
if $a->is_one |
805
|
0 |
0 |
if $a->bne($n1) |