Branch Coverage

n128.c
Criterion Covered Total %
branch 145 146 99.3


line true false branch
210 17116 4438 (n->nums[0] || n->nums[1] || n->nums[2] || (n->nums[3] > ui))
9743 7373 (n->nums[0] || n->nums[1] || n->nums[2] || (n->nums[3] > ui))
503 9240 (n->nums[0] || n->nums[1] || n->nums[2] || (n->nums[3] > ui))
212 21554 1685 : (n->nums[3] == ui)
214 502 1 : -1;
231 556 22698 if (diff >= 0) {
235 93016 23254 for (i = 0; i < 4; ++i) {
238 93016 23254 for (i = 0; i < 4; ++i) {
241 93016 23254 for (i = 0; i < 4; ++i) {
248 556 22698 if (diff >= 0) {
269 9 22307 if (diff >= 0) {
273 89264 22316 for (i = 0; i < 4; ++i) {
276 89264 22316 for (i = 0; i < 4; ++i) {
279 89264 22316 for (i = 0; i < 4; ++i) {
286 9 22307 if (diff >= 0) {
305 200 50 for (i = 0; i < 4; i++) {
324 76132 19033 for (i = 0; i < 4; i++) {
343 12 3 for (i = 0; i < 4; i++) {
364 156428 39107 for (i = 0; i < 4; i++) {
367 117321 39107 for (i = 1; i < 4; i++) {
369 33678 83643 if (n1->nums[i] < n2->nums[i]) {
371 44803 22729 while (n1->nums[j] == 0 && j--) {
33854 10949 while (n1->nums[j] == 0 && j--) {
391 45456 11364 for (i = 0; i < 4; i++) {
431 1 11395 if (res < 0) {
434 35 11360 if (res == 0) {
498 67293 2627 : (n1->nums[0] < n2->nums[0]) ? -1
499 34808 32485 : (n1->nums[1] > n2->nums[1]) ? 1
500 29571 5237 : (n1->nums[1] < n2->nums[1]) ? -1
501 27481 2090 : (n1->nums[2] > n2->nums[2]) ? 1
502 19344 8137 : (n1->nums[2] < n2->nums[2]) ? -1
503 15782 3562 : (n1->nums[3] > n2->nums[3]) ? 1
504 5629 10153 : (n1->nums[3] < n2->nums[3]) ? -1
505 5086 543 : 0;
528 24 1687 if (mylen < 128) {
529 2840 24 for (i = 0; i < (128 - mylen); i++) {
535 216168 1711 for (j = 0; i < 128; i++, j++) {
536 131837 84331 if (bitstr[j] != '0') {
552 401995 13044 for (i = buflen - 1, j = oplen - 1; i >= 0 && j >= 0; --i, --j) {
397515 4480 for (i = buflen - 1, j = oplen - 1; i >= 0 && j >= 0; --i, --j) {
554 201345 196170 if (diff >= 0) {
562 4480 13044 if (carry == 1) {
584 2 400 if (len > 39) {
593 13522 399 for (i = 0; i < len; i++) {
594 1 13521 if (!isdigit(str[i])) {
599 3 396 if (power_strings[127][0] > str[0]) {
603 38563 36 for (i = 127; i >= 0; i--) {
604 360 38203 if (!len) {
609 10663 27540 if (ps_len > len) {
612 23060 4480 if (ps_len == len) {
613 10016 13044 if (strcmp(bufp, ps) < 0) {
618 13514 17524 while (*bufp == '0') {
625 4 392 if (len) {
641 1348768 383 for (i = 0; i < 128; i++) {
642 15620 1333148 if (!n128_tstbit(n, i)) {
659 1333800 59 for (i = 0; i < 128; i++) {
660 16290 1317510 if (n128_tstbit(n, i)) {
677 79255 0 for (i = 127; i >= 0; i--) {
678 812 78443 if (n128_tstbit(n, i)) {
702 5 4 j = (ui_only) ? 0 : 3;
704 21 9 for (; j >= 0; j--) {
705 672 21 for (i = 31; i >= 0; i--) {
706 222 450 *buf = (n128_tstbit(n, (j * 32) + i) ? '1' : '0');
730 99 4 for (i = 0; i < 16; i++) {
732 3 96 if (byte) {
740 4 3 if (i == 16) {
743 16 3 for (; i < 16; i++) {
778 23 383 if (shift < 0) {
788 11386 11296 if (n128_cmp(tp, tenp) >= 0) {
793 383 22299 if (n128_cmp_ui(tenp, 10) == 0) {
826 8 23 if (n128_cmp_ui(qp, 0) == 0) {
832 406 23 while (n128_cmp_ui(qp, 0) != 0) {
839 406 23 for (i = nc; i >= 0; i--) {