| line |
true |
false |
branch |
|
70
|
50388 |
303 |
if (len == 1) {
|
|
72
|
96 |
50292 |
if (adler >= BASE)
|
|
75
|
24902 |
25486 |
if (sum2 >= BASE)
|
|
81
|
98 |
205 |
if (buf == Z_NULL)
|
|
85
|
33 |
172 |
if (len < 16) {
|
|
86
|
384 |
33 |
while (len--) {
|
|
90
|
0 |
33 |
if (adler >= BASE)
|
|
97
|
97 |
172 |
while (len >= NMAX) {
|
|
103
|
33562 |
97 |
} while (--n);
|
|
109
|
172 |
0 |
if (len) { /* avoid modulos if none remaining */
|
|
110
|
17384 |
172 |
while (len >= 16) {
|
|
115
|
710 |
172 |
while (len--) {
|
|
139
|
0 |
1 |
if (len2 < 0)
|
|
150
|
1 |
0 |
if (sum1 >= BASE) sum1 -= BASE;
|
|
151
|
0 |
1 |
if (sum1 >= BASE) sum1 -= BASE;
|
|
152
|
0 |
1 |
if (sum2 >= ((unsigned long)BASE << 1)) sum2 -= ((unsigned long)BASE << 1);
|
|
153
|
1 |
0 |
if (sum2 >= BASE) sum2 -= BASE;
|