Branch Coverage

cruncher.c
Criterion Covered Total %
branch 61 72 84.7


line true false branch
110 3801 26677 if((--curCnt) == 0) {
115 0 3801 if(put == 0) {
133 2523 110 if(b < 0x80)
136 5866 2633 while(b > 1) {
145 25 0 if(copyFlag == 1) {
157 25 64246 if(get < 2) {
166 294928451 59528 while(((get - scn) <= max_offs) &&
294923733 4718 while(((get - scn) <= max_offs) &&
168 1149583 293774150 if((ibuf[scn] == first) &&
4365 1145218 if((ibuf[scn] == first) &&
171 4382 0 while((len < 255) &&
4376 6 while((len < 255) &&
172 17 4359 (scn >= len) &&
177 4220 145 if(len > matchLen) {
185 64233 13 if((matchLen > 2) ||
4207 60026 if((matchLen > 2) ||
186 1294 2913 ((matchLen == 2) && (matchOffset <= max_offs_short))) {
207 4819 0 while(i < 4) {
209 4774 45 if(matchLen == 2) {
215 12275 4819 while(b > 0) {
221 1307 3512 if(matchOffset == 0)
241 25 1299 if(plainLen == 0) {
251 0 1299 if((plainLen % 255) == 0) {
256 1309 1299 while(plainLen > 0) {
260 1 1308 if(put < len) {
267 62964 1309 for(i = 0; i < len; ++i) {
316 65593 17 for(i = 0; i < ibufSize; ++i) {
329 64271 17 while(get >= 0) {
330 1307 62964 if(scan(&theMatchLen, &theMatchOffset)) {
341 1 16 if(errorFlag == _true) {
354 0 16 if(aTarget->data == NULL) {
365 80 16 for(i = 0; i < packLen; ++i) {
372 0 15 if(isRelocated)
392 0 0 for(i = 0; i < decrLen; ++i) {
411 282 1 for(i = 0; i < decrLen; ++i) {
430 0 0 for(i = 0; i < decrLen; ++i) {