Branch Coverage

fft4g.c
Criterion Covered Total %
branch 157 188 83.5


line true false branch
286 3 5 if (n > (ip[0] << 2)) {
289 8 0 if (n > 4) {
290 4 4 if (isgn >= 0) {
297 0 0 } else if (n == 4) {
316 17 246 if (n > (nw << 2)) {
321 17 246 if (n > (nc << 2)) {
325 253 10 if (isgn >= 0) {
326 253 0 if (n > 4) {
330 0 0 } else if (n == 4) {
339 10 0 if (n > 4) {
343 0 0 } else if (n == 4) {
364 2 2 if (n > (nw << 2)) {
369 2 2 if (n > nc) {
373 2 2 if (isgn < 0) {
375 16390 2 for (j = n - 2; j >= 2; j -= 2) {
381 2 0 if (n > 4) {
385 0 0 } else if (n == 4) {
390 2 2 if (isgn >= 0) {
391 2 0 if (n > 4) {
395 0 0 } else if (n == 4) {
400 16390 2 for (j = 2; j < n; j += 2) {
423 2 2 if (n > (nw << 2)) {
428 2 2 if (n > nc) {
432 2 2 if (isgn < 0) {
434 16390 2 for (j = n - 2; j >= 2; j -= 2) {
440 2 0 if (n > 4) {
444 0 0 } else if (n == 4) {
449 2 2 if (isgn >= 0) {
450 2 0 if (n > 4) {
454 0 0 } else if (n == 4) {
459 16390 2 for (j = 2; j < n; j += 2) {
480 2 2 if (n > (nw << 3)) {
485 2 2 if (n > (nc << 1)) {
495 4 0 if (n > 2) {
497 16388 4 for (j = 1; j < mh; j++) {
511 4 0 if (m > 4) {
515 0 0 } else if (m == 4) {
520 16388 4 for (j = m - 2; j >= 2; j -= 2) {
526 30 4 while (m >= 2) {
528 22 8 if (m > 4) {
532 4 4 } else if (m == 4) {
538 16358 30 for (j = 2; j < m; j += 2) {
545 16388 30 for (j = 0; j < mh; j++) {
576 2 2 if (n > (nw << 3)) {
581 2 2 if (n > (nc << 1)) {
585 4 0 if (n > 2) {
588 16388 4 for (j = 1; j < mh; j++) {
603 4 0 if (m > 4) {
607 0 0 } else if (m == 4) {
612 16388 4 for (j = m - 2; j >= 2; j -= 2) {
618 30 4 while (m >= 2) {
620 22 8 if (m > 4) {
624 4 4 } else if (m == 4) {
630 16358 30 for (j = 2; j < m; j += 2) {
637 16358 30 for (j = 1; j < mh; j++) {
664 26 2 if (nw > 2) {
671 17 9 if (nwh > 2) {
672 12291 17 for (j = 2; j < nwh; j += 2) {
692 25 0 if (nc > 1) {
697 53299 25 for (j = 1; j < nch; j++) {
716 499 344 while ((m << 3) < l) {
718 1758 499 for (j = 0; j < m; j++) {
724 292 52 if ((m << 3) == l) {
725 1482 292 for (k = 0; k < m; k++) {
726 23468 1482 for (j = 0; j < k; j++) {
780 568 52 for (k = 1; k < m; k++) {
781 11686 568 for (j = 0; j < k; j++) {
816 19 4 while ((m << 3) < l) {
818 190 19 for (j = 0; j < m; j++) {
824 3 1 if ((m << 3) == l) {
825 192 3 for (k = 0; k < m; k++) {
826 6048 192 for (j = 0; j < k; j++) {
886 1 1 for (k = 1; k < m; k++) {
887 1 1 for (j = 0; j < k; j++) {
925 305 16 if (n > 8) {
928 130 305 while ((l << 2) < n) {
933 274 47 if ((l << 2) == n) {
934 31000 274 for (j = 0; j < l; j += 2) {
956 21908 47 for (j = 0; j < l; j += 2) {
977 18 0 if (n > 8) {
980 30 18 while ((l << 2) < n) {
985 6 12 if ((l << 2) == n) {
986 24576 6 for (j = 0; j < l; j += 2) {
1008 48 12 for (j = 0; j < l; j += 2) {
1065 32948 323 for (j = 16; j < n; j += 16) {
1133 25408 160 for (j = 0; j < l; j += 2) {
1155 25408 160 for (j = m; j < l + m; j += 2) {
1182 10732 160 for (k = m2; k < n; k += m2) {
1191 132976 10732 for (j = k; j < l + k; j += 2) {
1222 132976 10732 for (j = k + m; j < l + (k + m); j += 2) {
1261 59011 309 for (j = 2; j < m; j += 2) {
1287 24606 14 for (j = 2; j < m; j += 2) {
1313 65526 38 for (j = 1; j < m; j++) {
1334 65526 38 for (j = 1; j < m; j++) {