| line |
true |
false |
branch |
|
76
|
50388 |
310 |
if (len == 1) { |
|
78
|
97 |
50291 |
if (adler >= BASE) |
|
81
|
25012 |
25376 |
if (sum2 >= BASE) |
|
87
|
98 |
212 |
if (buf == Z_NULL) |
|
91
|
32 |
180 |
if (len < 16) { |
|
92
|
319 |
32 |
while (len--) { |
|
96
|
0 |
32 |
if (adler >= BASE) |
|
103
|
97 |
180 |
while (len >= NMAX) { |
|
109
|
33562 |
97 |
} while (--n); |
|
115
|
180 |
0 |
if (len) { /* avoid modulos if none remaining */ |
|
116
|
17384 |
180 |
while (len >= 16) { |
|
121
|
775 |
180 |
while (len--) { |
|
153
|
0 |
1 |
if (len2 < 0) |
|
164
|
1 |
0 |
if (sum1 >= BASE) sum1 -= BASE; |
|
165
|
0 |
1 |
if (sum1 >= BASE) sum1 -= BASE; |
|
166
|
0 |
1 |
if (sum2 >= ((unsigned long)BASE << 1)) sum2 -= ((unsigned long)BASE << 1); |
|
167
|
1 |
0 |
if (sum2 >= BASE) sum2 -= BASE; |