| line |
true |
false |
branch |
|
24
|
77 |
11 |
for (x = 0; x < dataLength; x += 3) { |
|
29
|
77 |
0 |
if ((x + 1) < dataLength) |
|
34
|
66 |
11 |
if ((x + 2) < dataLength) n += data[x + 2]; |
|
46
|
0 |
77 |
if (resultIndex >= resultSize) return 1; /* indicate failure: buffer too small */ |
|
48
|
0 |
77 |
if (resultIndex >= resultSize) return 1; /* indicate failure: buffer too small */ |
|
55
|
77 |
0 |
if ((x + 1) < dataLength) { |
|
56
|
0 |
77 |
if (resultIndex >= resultSize) return 1; /* indicate failure: buffer too small */ |
|
64
|
66 |
11 |
if ((x + 2) < dataLength) { |
|
65
|
0 |
66 |
if (resultIndex >= resultSize) return 1; /* indicate failure: buffer too small */ |
|
74
|
11 |
0 |
if (padCount > 0) { |
|
75
|
11 |
11 |
for (; padCount < 3; padCount++) { |
|
76
|
0 |
11 |
if (resultIndex >= resultSize) return 1; /* indicate failure: buffer too small */ |
|
80
|
0 |
11 |
if (resultIndex >= resultSize) return 1; /* indicate failure: buffer too small */ |