Branch Coverage

lib/PDL/Compression/ricecomp.c
Criterion Covered Total %
branch 86 234 36.7


line true false branch
162 0 1920 if (diff == (unsigned int *) NULL) {
172 0 1920 if (output_nbits(buffer, a[0], 32) == -1) {
181 23040 1920 for (i=0; i
183 0 23040 if (nx-i < nblock) thisblock = nx-i;
196 737280 23040 for (j=0; j
199 350215 387065 diff[j] = (unsigned int) ((pdiff<0) ? ~(pdiff<<1) : (pdiff<<1));
208 0 23040 if (dpsum < 0) dpsum = 0.0;
210 111880 23040 for (fs = 0; psum>0; fs++) psum >>= 1;
216 0 23040 if (fs >= fsmax) {
220 0 0 if (output_nbits(buffer, fsmax+1, fsbits) == -1) {
225 0 0 for (j=0; j
226 0 0 if (output_nbits(buffer, diff[j], bbits) == -1) {
232 0 23040 } else if (fs == 0 && pixelsum == 0) {
0 0 } else if (fs == 0 && pixelsum == 0) {
238 0 0 if (output_nbits(buffer, 0, fsbits) == -1) {
245 0 23040 if (output_nbits(buffer, fs+1, fsbits) == -1) {
256 737280 23040 for (j=0; j
262 641925 95355 if (lbits_to_go >= top+1) {
270 525 95355 for (top -= lbits_to_go; top>=8; top -= 8) {
282 737280 0 if (fs > 0) {
286 539605 737280 while (lbits_to_go <= 0) {
294 0 23040 if (buffer->current > buffer->end) {
391 0 0 if (diff == (unsigned int *) NULL) {
401 0 0 if (output_nbits(buffer, a[0], 16) == -1) {
410 0 0 for (i=0; i
412 0 0 if (nx-i < nblock) thisblock = nx-i;
425 0 0 for (j=0; j
428 0 0 diff[j] = (unsigned int) ((pdiff<0) ? ~(pdiff<<1) : (pdiff<<1));
436 0 0 if (dpsum < 0) dpsum = 0.0;
439 0 0 for (fs = 0; psum>0; fs++) psum >>= 1;
445 0 0 if (fs >= fsmax) {
450 0 0 if (output_nbits(buffer, fsmax+1, fsbits) == -1) {
455 0 0 for (j=0; j
456 0 0 if (output_nbits(buffer, diff[j], bbits) == -1) {
462 0 0 } else if (fs == 0 && pixelsum == 0) {
0 0 } else if (fs == 0 && pixelsum == 0) {
469 0 0 if (output_nbits(buffer, 0, fsbits) == -1) {
477 0 0 if (output_nbits(buffer, fs+1, fsbits) == -1) {
488 0 0 for (j=0; j
494 0 0 if (lbits_to_go >= top+1) {
501 0 0 for (top -= lbits_to_go; top>=8; top -= 8) {
513 0 0 if (fs > 0) {
517 0 0 while (lbits_to_go <= 0) {
524 0 0 if (buffer->current > buffer->end) {
620 0 1 if (diff == (unsigned int *) NULL) {
630 0 1 if (output_nbits(buffer, a[0], 8) == -1) {
639 2 1 for (i=0; i
641 0 2 if (nx-i < nblock) thisblock = nx-i;
654 64 2 for (j=0; j
657 24 40 diff[j] = (unsigned int) ((pdiff<0) ? ~(pdiff<<1) : (pdiff<<1));
665 0 2 if (dpsum < 0) dpsum = 0.0;
668 0 2 for (fs = 0; psum>0; fs++) psum >>= 1;
674 0 2 if (fs >= fsmax) {
678 0 0 if (output_nbits(buffer, fsmax+1, fsbits) == -1) {
683 0 0 for (j=0; j
684 0 0 if (output_nbits(buffer, diff[j], bbits) == -1) {
690 2 0 } else if (fs == 0 && pixelsum == 0) {
0 2 } else if (fs == 0 && pixelsum == 0) {
696 0 0 if (output_nbits(buffer, 0, fsbits) == -1) {
703 0 2 if (output_nbits(buffer, fs+1, fsbits) == -1) {
714 64 2 for (j=0; j
720 47 17 if (lbits_to_go >= top+1) {
727 1 17 for (top -= lbits_to_go; top>=8; top -= 8) {
739 0 64 if (fs > 0) {
743 0 0 while (lbits_to_go <= 0) {
750 0 2 if (buffer->current > buffer->end) {
808 1920 23043 if (lbits_to_go+n > 32) {
824 19036 24963 while (lbits_to_go <= 0) {
840 1711 210 if(buffer->bits_to_go < 8) {
950 46080 3840 for (i = 0; i
953 26180 46080 while (nbits < 0) {
962 0 46080 if (imax > nx) imax = nx;
963 0 46080 if (fs<0) {
965 0 0 for ( ; i
966 0 46080 } else if (fs==fsmax) {
968 0 0 for ( ; i
971 0 0 for (k -= 8; k >= 0; k -= 8) {
975 0 0 if (nbits>0) {
988 0 0 if ((diff & 1) == 0) {
998 1474560 46080 for ( ; i
1000 375290 1474560 while (b == 0) {
1010 895630 1474560 while (nbits < 0) {
1018 774130 700430 if ((diff & 1) == 0) {
1027 0 46080 if (c > cend) {
1031 0 3840 if (c < cend) {
1115 0 0 for (i = 0; i
1118 0 0 while (nbits < 0) {
1127 0 0 if (imax > nx) imax = nx;
1128 0 0 if (fs<0) {
1130 0 0 for ( ; i
1131 0 0 } else if (fs==fsmax) {
1133 0 0 for ( ; i
1136 0 0 for (k -= 8; k >= 0; k -= 8) {
1140 0 0 if (nbits>0) {
1154 0 0 if ((diff & 1) == 0) {
1164 0 0 for ( ; i
1166 0 0 while (b == 0) {
1176 0 0 while (nbits < 0) {
1184 0 0 if ((diff & 1) == 0) {
1193 0 0 if (c > cend) {
1197 0 0 if (c < cend) {
1276 4 2 for (i = 0; i
1279 0 4 while (nbits < 0) {
1288 0 4 if (imax > nx) imax = nx;
1289 0 4 if (fs<0) {
1291 0 0 for ( ; i
1292 0 4 } else if (fs==fsmax) {
1294 0 0 for ( ; i
1297 0 0 for (k -= 8; k >= 0; k -= 8) {
1301 0 0 if (nbits>0) {
1315 0 0 if ((diff & 1) == 0) {
1325 128 4 for ( ; i
1327 36 128 while (b == 0) {
1337 0 128 while (nbits < 0) {
1345 80 48 if ((diff & 1) == 0) {
1354 0 4 if (c > cend) {
1358 0 2 if (c < cend) {