Branch Coverage

inc/CryptX_BigInt_LTM.xs.inc
Criterion Covered Total %
branch 94 134 70.1


line true false branch
16 0 32718 if (SvUOK(x)) {
19 17357 15361 else if (SvIOK(x)) {
50 64 0 start = (strlen(str)>2 && str[0] == '0' && str[1] == 'b') ? str+2 : str;
64 0 start = (strlen(str)>2 && str[0] == '0' && str[1] == 'b') ? str+2 : str;
64 0 start = (strlen(str)>2 && str[0] == '0' && str[1] == 'b') ? str+2 : str;
68 276 0 start = (strlen(str)>2 && str[0] == '0' && str[1] == 'x') ? str+2 : str;
276 0 start = (strlen(str)>2 && str[0] == '0' && str[1] == 'x') ? str+2 : str;
276 0 start = (strlen(str)>2 && str[0] == '0' && str[1] == 'x') ? str+2 : str;
131 0 3 if (SvUOK(x)) {
134 3 0 else if (SvIOK(x)) {
233 65036 0 if (n) {
248 1344 16960 if (mp_iszero(n) == MP_YES) {
272 9 31793 if (mp_iszero(n) == MP_YES) {
297 28 8 RETVAL = (bits < 5) ? 1 : (int)(bits * 0.301029995663 + 0.499999999999);
35 1 RETVAL = (bits < 5) ? 1 : (int)(bits * 0.301029995663 + 0.499999999999);
315 450 22829 if (mp_iszero(n) == MP_YES) {
324 242145 0 while (len > 0) {
325 22829 219316 if (buf[len-1] != '0') break;
345 59 13 len = mp_iszero(n) ? 2 : mp_ubin_size(n) * 2 + 1; /* incl. NUL-byte */
350 15 119 for (i=0; i0; i++) buf[i] = toLOWER(buf[i]);
206 0 for (i=0; i0; i++) buf[i] = toLOWER(buf[i]);
134 72 for (i=0; i0; i++) buf[i] = toLOWER(buf[i]);
366 27 4 len = mp_iszero(n) ? 2 : mp_ubin_size(n) * 8 + 1; /* incl. NUL-byte */
386 7 3 len = mp_iszero(n) ? 2 : mp_ubin_size(n) * 3 + 1; /* incl. NUL-byte */
406 0 0 len = mp_iszero(n) ? 2 : mp_ubin_size(n) * 8 + 1; /* the worst case for base == 2 */
431 0 0 if (len > 0) {
459 50 94 if (mp_cmp_d(mod, 1) == MP_EQ) {
483 0 42 EXTEND(SP, 2); /* we return two values */
484 7 35 if (rc != MP_OKAY) {
509 0 15548 XPUSHs(ST(1)); /* x */
521 0 1425 XPUSHs(ST(1)); /* x */
533 0 558 XPUSHs(ST(1)); /* x */
544 6358 9404 if ( items == 4 && SvTRUE(ST(3)) ) {
1563 4795 if ( items == 4 && SvTRUE(ST(3)) ) {
547 0 1563 XPUSHs(ST(2)); /* y */
552 0 14199 XPUSHs(ST(1)); /* x */
573 0 9465 XPUSHs(ST(1)); /* x */
592 0 6039 XPUSHs(ST(1)); /* x */
604 0 6924 XPUSHs(ST(1)); /* x */
615 146 2734 if (GIMME_V == G_ARRAY) {
619 0 146 EXTEND(SP, 2);
625 0 2734 XPUSHs(ST(1)); /* x */
639 0 252 XPUSHs(ST(1)); /* x */
648 1880 18325 if ( RETVAL < 0) RETVAL = -1;
649 15640 4565 if ( RETVAL > 0) RETVAL = 1;
659 74017 107 RETVAL = (mp_iszero(x) == MP_YES) ? 1 : 0;
669 899 37 RETVAL = (mp_cmp_d(x, 1) == MP_EQ) ? 1 : 0;
679 37 8 RETVAL = (mp_cmp_d(x, 2) == MP_EQ) ? 1 : 0;
689 0 2 RETVAL = (mp_cmp_d(x, 10) == MP_EQ) ? 1 : 0;
703 0 200 XPUSHs(ST(1)); /* x */
730 0 26 XPUSHs(ST(1)); /* x */
742 0 39 XPUSHs(ST(1)); /* x */
754 0 41 XPUSHs(ST(1)); /* x */
777 146 25 RETVAL = (mp_isodd(n) == MP_YES) ? 1 : 0;
74 72 RETVAL = (mp_isodd(n) == MP_YES) ? 1 : 0;
163 8 RETVAL = (mp_isodd(n) == MP_YES) ? 1 : 0;
787 20 3 RETVAL = (mp_iseven(n) == MP_YES || mp_iszero(n) == MP_YES) ? 1 : 0;
8 12 RETVAL = (mp_iseven(n) == MP_YES || mp_iszero(n) == MP_YES) ? 1 : 0;
12 11 RETVAL = (mp_iseven(n) == MP_YES || mp_iszero(n) == MP_YES) ? 1 : 0;
0 12 RETVAL = (mp_iseven(n) == MP_YES || mp_iszero(n) == MP_YES) ? 1 : 0;
19 4 RETVAL = (mp_iseven(n) == MP_YES || mp_iszero(n) == MP_YES) ? 1 : 0;
801 0 119 XPUSHs(ST(1)); /* x */
813 0 50 XPUSHs(ST(1)); /* x */
824 0 2 XPUSHs(ST(1)); /* x */
840 1 0 if (SvROK(blank_obj) && sv_isa(blank_obj, "Math::BigInt::LTM")) {
1 0 if (SvROK(blank_obj) && sv_isa(blank_obj, "Math::BigInt::LTM")) {
864 0 1 if (mp_iszero(self) == MP_YES) {