Branch Coverage

AM.xs
Criterion Covered Total %
branch 129 140 92.1


line true false branch
237 768 192 for (i = 0; i < NUM_LATTICES; ++i) {
306 49944 6243 for (int j = 8; j; --j) {
313 0 6243 Copy(p, dividend, length, AM_LONG);
316 64348 6243 while (length && (*(dividend + length - 1) == 0)) {
49944 14404 while (length && (*(dividend + length - 1) == 0)) {
319 6243 14404 if (length == 0) {
326 14408 14404 while (dptr >= dividend) {
330 230528 14408 for (i = 16; i; ) {
332 17580 212948 if (tens[i] <= *dptr) {
364 220213 122772 while (*intersection_list_top > *subcontext_list_top) {
367 9227 113545 if (*intersection_list_top == 0) {
370 33962 79583 if (*intersection_list_top < *subcontext_list_top) {
398 506781 184301 while (*intersection_list_top > *subcontext_list_top) {
401 21261 163040 if (*intersection_list_top == 0) {
404 92778 70262 if (*intersection_list_top < *subcontext_list_top) {
415 29519 40743 if (class == 0) {
417 1431 28088 if (length > 1) {
425 11036 29707 if (class != subcontext_class[*intersection_list_top]) {
440 776 194 for (int i = 0; i < supras_length; i++)
442 2911 776 for (iter_supras(p, supra_list[i]))
460 160 10 for (i = 16; i; i--) {
507 768 192 for (int i = 0; i < NUM_LATTICES; ++i) {
546 776 194 for (int sublattice_index = 0; sublattice_index < NUM_LATTICES; ++sublattice_index) {
553 6272 776 for (int i = 1; i < 1 << (lattice_sizes[sublattice_index] + 1); ++i) {/* CHANGED (TODO: changed what?) */
573 0 194 AM_SHORT subcontextnumber = (AM_SHORT)HvUSEDKEYS(context_to_class);
591 8188 194 while ((context_to_class_entry = hv_iternext(context_to_class))) {
594 32752 8188 for (int sublattice_index = 0; sublattice_index < NUM_LATTICES; ++sublattice_index, ++contextptr) {
668 6364 26388 if (context == 0) {
670 22441 6364 for (iter_supras(p, supralist)) {
679 732 5632 if (lattice[context] == 0) {
696 2991 732 for (int i = 0; i < (1 << active); ++i) {
697 1682 1309 if (lattice[i] == 0) {
710 55397 26388 for (int i = 1 << (active - 1); i; i >>= 1) {
711 15490 39907 if (!(i & context)) {
719 25373 1015 if (pi) {
737 16929 26388 while (--t) {
741 1439 16929 for (i = 0, tt = ~t & (t - 1); tt; tt >>= 1, ++i) {
747 16439 490 if (pi) {
779 39997 96983 if (supralist[i = p->next].count == 0) {
788 110592 26388 } while (p->next);
817 630 194 for (iter_supras(p0, supra_list[0])) {
819 2121 630 for (iter_supras(p1, supra_list[1])) {
827 154 1967 if (k == ilist2top) {
833 7106 1967 for (iter_supras(p2, supra_list[2])) {
842 694 6412 if (k == ilist3top) {
848 33728 6412 for (iter_supras(p3, supra_list[3])) {
861 15621 18107 if (length) {
880 15601 20 if(!linear_flag){
883 34957 15601 for (int i = 0; i < length; ++i) {
887 0 15601 if (pointercount & 0xffff0000) {
923 34990 15621 for (int i = 0; i < length; ++i) {
926 2745 32245 if (!SvPOK(final_pointers_sv)) {
927 2745 0 SvUPGRADE(final_pointers_sv, SVt_PVNV);
928 2745 0 SvGROW(final_pointers_sv, 8 * sizeof(AM_LONG) + 1);
2745 0 SvGROW(final_pointers_sv, 8 * sizeof(AM_LONG) + 1);
934 244930 34990 for (int j = 0; j < 7; ++j) {
971 2745 194 while ((pointers_entry = hv_iternext(pointers))) {
987 19215 2745 for (int i = 0; i < 7; ++i) {
994 0 2745 if (counthi) {
995 0 0 for (int i = 0; i < 6; ++i) {
1000 19215 2745 for (int i = 0; i < 7; ++i) {
1009 2745 0 SvUPGRADE(gang_pointers, SVt_PVNV);
1015 2702 43 if (this_class) {
1016 308 2394 SV_CHECK_THINKFIRST(sum[this_class]);
1018 18914 2702 for (int i = 0; i < 7; ++i) {
1024 112 43 while (SvIOK(exemplar)) {
1027 41 71 SV_CHECK_THINKFIRST(sum[ocnum]);
1029 784 112 for (int i = 0; i < 7; ++i) {
1037 559 194 for (int i = 1; i <= num_classes; ++i) {
1042 194 0 SvUPGRADE(grand_total_entry, SVt_PVNV);