| line |
true |
false |
branch |
|
76
|
3 |
3466 |
if (len == 1) { |
|
78
|
0 |
3 |
if (adler >= BASE) |
|
81
|
3 |
0 |
if (sum2 >= BASE) |
|
87
|
1633 |
1833 |
if (buf == Z_NULL) |
|
91
|
140 |
1693 |
if (len < 16) { |
|
92
|
1353 |
140 |
while (len--) { |
|
96
|
0 |
140 |
if (adler >= BASE) |
|
103
|
0 |
1693 |
while (len >= NMAX) { |
|
109
|
0 |
0 |
} while (--n); |
|
115
|
1693 |
0 |
if (len) { /* avoid modulos if none remaining */ |
|
116
|
8016 |
1693 |
while (len >= 16) { |
|
121
|
8914 |
1693 |
while (len--) { |
|
153
|
0 |
0 |
if (len2 < 0) |
|
164
|
0 |
0 |
if (sum1 >= BASE) sum1 -= BASE; |
|
165
|
0 |
0 |
if (sum1 >= BASE) sum1 -= BASE; |
|
166
|
0 |
0 |
if (sum2 >= ((unsigned long)BASE << 1)) sum2 -= ((unsigned long)BASE << 1); |
|
167
|
0 |
0 |
if (sum2 >= BASE) sum2 -= BASE; |