Branch Coverage

inffast.c
Criterion Covered Total %
branch 42 70 60.0


line true false branch
101 617 1190 if (bits < 15) {
113 280 1527 if (op == 0) { /* literal */
119 1517 10 else if (op & 16) { /* length base */
122 10 1507 if (op) {
123 0 10 if (bits < op) {
132 83 1434 if (bits < 15) {
144 1517 0 if (op & 16) { /* distance base */
147 0 1517 if (bits < op) {
150 0 0 if (bits < op) {
168 16 1501 if (dist > op) { /* see if copy from window */
170 0 16 if (op > whave) {
171 0 0 if (state->sane) {
198 0 16 if (wnext == 0) { /* very common case */
200 0 0 if (op < len) { /* some from window */
204 0 0 } while (--op);
208 0 16 else if (wnext < op) { /* wrap around window */
211 0 0 if (op < len) { /* some from end of window */
215 0 0 } while (--op);
217 0 0 if (wnext < len) { /* some from start of window */
222 0 0 } while (--op);
229 16 0 if (op < len) { /* some from window */
233 121 16 } while (--op);
237 1069 16 while (len > 2) {
243 16 0 if (len) {
245 3 13 if (len > 1)
256 126769 1501 } while (len > 2);
257 10 1491 if (len) {
259 9 1 if (len > 1)
264 0 0 else if ((op & 64) == 0) { /* 2nd level distance code */
274 0 10 else if ((op & 64) == 0) { /* 2nd level length code */
278 10 0 else if (op & 32) { /* end-of-block */
288 1759 38 } while (in < last && out < end);
1682 77 } while (in < last && out < end);
299 111 14 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
300 48 77 strm->avail_out = (unsigned)(out < end ?