| line |
true |
false |
branch |
|
66
|
0 |
35 |
assert(v < 100000000000000000L); |
|
67
|
15 |
20 |
if (v >= 10000000000000000L) { return 17; } |
|
68
|
0 |
20 |
if (v >= 1000000000000000L) { return 16; } |
|
69
|
0 |
20 |
if (v >= 100000000000000L) { return 15; } |
|
70
|
0 |
20 |
if (v >= 10000000000000L) { return 14; } |
|
71
|
0 |
20 |
if (v >= 1000000000000L) { return 13; } |
|
72
|
0 |
20 |
if (v >= 100000000000L) { return 12; } |
|
73
|
0 |
20 |
if (v >= 10000000000L) { return 11; } |
|
74
|
0 |
20 |
if (v >= 1000000000L) { return 10; } |
|
75
|
0 |
20 |
if (v >= 100000000L) { return 9; } |
|
76
|
0 |
20 |
if (v >= 10000000L) { return 8; } |
|
77
|
0 |
20 |
if (v >= 1000000L) { return 7; } |
|
78
|
0 |
20 |
if (v >= 100000L) { return 6; } |
|
79
|
0 |
20 |
if (v >= 10000L) { return 5; } |
|
80
|
0 |
20 |
if (v >= 1000L) { return 4; } |
|
81
|
0 |
20 |
if (v >= 100L) { return 3; } |
|
82
|
0 |
20 |
if (v >= 10L) { return 2; } |
|
97
|
10 |
25 |
if (ieeeExponent == 0) { |
|
115
|
0 |
35 |
const uint32_t mmShift = ieeeMantissa != 0 || ieeeExponent <= 1; |
|
|
0 |
0 |
const uint32_t mmShift = ieeeMantissa != 0 || ieeeExponent <= 1; |
|
125
|
0 |
35 |
if (e2 >= 0) { |
|
143
|
0 |
0 |
if (q <= 21) { |
|
148
|
0 |
0 |
if (mvMod5 == 0) { |
|
150
|
0 |
0 |
} else if (acceptBounds) { |
|
179
|
0 |
35 |
if (q <= 1) { |
|
183
|
0 |
0 |
if (acceptBounds) { |
|
190
|
25 |
10 |
} else if (q < 63) { // TODO(ulfjack): Use a tighter bound here. |
|
213
|
35 |
0 |
if (vmIsTrailingZeros || vrIsTrailingZeros) { |
|
|
0 |
35 |
if (vmIsTrailingZeros || vrIsTrailingZeros) { |
|
218
|
0 |
0 |
if (vpDiv10 <= vmDiv10) { |
|
236
|
0 |
0 |
if (vmIsTrailingZeros) { |
|
240
|
0 |
0 |
if (vmMod10 != 0) { |
|
258
|
0 |
0 |
if (vrIsTrailingZeros && lastRemovedDigit == 5 && vr % 2 == 0) { |
|
|
0 |
0 |
if (vrIsTrailingZeros && lastRemovedDigit == 5 && vr % 2 == 0) { |
|
|
0 |
0 |
if (vrIsTrailingZeros && lastRemovedDigit == 5 && vr % 2 == 0) { |
|
263
|
0 |
0 |
output = vr + ((vr == vm && (!acceptBounds || !vmIsTrailingZeros)) || lastRemovedDigit >= 5); |
|
|
0 |
0 |
output = vr + ((vr == vm && (!acceptBounds || !vmIsTrailingZeros)) || lastRemovedDigit >= 5); |
|
|
0 |
0 |
output = vr + ((vr == vm && (!acceptBounds || !vmIsTrailingZeros)) || lastRemovedDigit >= 5); |
|
|
0 |
0 |
output = vr + ((vr == vm && (!acceptBounds || !vmIsTrailingZeros)) || lastRemovedDigit >= 5); |
|
269
|
25 |
10 |
if (vpDiv100 > vmDiv100) { // Optimization: remove two digits at a time (~86.2%). |
|
285
|
35 |
170 |
if (vpDiv10 <= vmDiv10) { |
|
301
|
35 |
0 |
output = vr + (vr == vm || roundUp); |
|
|
20 |
15 |
output = vr + (vr == vm || roundUp); |
|
320
|
10 |
25 |
if (sign) { |
|
346
|
15 |
20 |
if ((output >> 32) != 0) { |
|
366
|
30 |
35 |
while (output2 >= 10000) { |
|
379
|
0 |
35 |
if (output2 >= 100) { |
|
385
|
0 |
35 |
if (output2 >= 10) { |
|
395
|
15 |
20 |
if (olength > 1) { |
|
405
|
25 |
10 |
if (exp < 0) { |
|
410
|
10 |
25 |
if (exp >= 100) { |
|
415
|
0 |
25 |
} else if (exp >= 10) { |
|
430
|
0 |
35 |
if (e2 > 0) { |
|
436
|
25 |
10 |
if (e2 < -52) { |
|
445
|
10 |
0 |
if (fraction != 0) { |
|
474
|
35 |
0 |
if (ieeeExponent == ((1u << DOUBLE_EXPONENT_BITS) - 1u) || (ieeeExponent == 0 && ieeeMantissa == 0)) { |
|
|
10 |
25 |
if (ieeeExponent == ((1u << DOUBLE_EXPONENT_BITS) - 1u) || (ieeeExponent == 0 && ieeeMantissa == 0)) { |
|
|
0 |
10 |
if (ieeeExponent == ((1u << DOUBLE_EXPONENT_BITS) - 1u) || (ieeeExponent == 0 && ieeeMantissa == 0)) { |
|
480
|
0 |
35 |
if (isSmallInt) { |
|
488
|
0 |
0 |
if (r != 0) { |