1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502
|
// SPDX-License-Identifier: MPL-2.0
// (c) Hare authors <https://harelang.org>
// Using Ryƫ: fast float-to-string conversion algorithm by Ulf Adams.
// https://doi.org/10.1145/3192366.3192369
// This Hare implementation is translated from the original
// C implementation here: https://github.com/ulfjack/ryu
use math;
use types;
type r128 = struct {
hi: u64,
lo: u64,
};
// TODO: use 128-bit integers when implemented
fn u128mul(a: u64, b: u64) r128 = {
const a0 = a: u32: u64, a1 = a >> 32;
const b0 = b: u32: u64, b1 = b >> 32;
const p00 = a0 * b0, p01 = a0 * b1, p10 = a1 * b0, p11 = a1 * b1;
const p00_lo = p00: u32: u64, p00_hi = p00 >> 32;
const mid1 = p10 + p00_hi;
const mid1_lo = mid1: u32: u64, mid1_hi = mid1 >> 32;
const mid2 = p01 + mid1_lo;
const mid2_lo = mid2: u32: u64, mid2_hi = mid2 >> 32;
const r_hi = p11 + mid1_hi + mid2_hi;
const r_lo = (mid2_lo << 32) | p00_lo;
return r128 { hi = r_hi, lo = r_lo };
};
// TODO: Same as above
fn u128rshift(lo: u64, hi: u64, s: u32) u64 = {
assert(0 <= s);
assert(s <= 64);
return (hi << (64 - s)) | (lo >> s);
};
fn pow5fac(value: u64) u32 = {
const m_inv_5: u64 = 14757395258967641293; // 5 * m_inv_5 = 1 (mod 2^64)
const n_div_5: u64 = 3689348814741910323;
let count: u32 = 0;
for (true) {
assert(value != 0);
value *= m_inv_5;
if (value > n_div_5) break;
count += 1;
};
return count;
};
fn pow5fac32(value: u32) u32 = {
let count: u32 = 0;
for (true) {
assert(value != 0);
const q = value / 5, r = value % 5;
if (r != 0) break;
value = q;
count += 1;
};
return count;
};
fn ibool(b: bool) u8 = if (b) 1 else 0;
fn pow5multiple(v: u64, p: u32) bool = pow5fac(v) >= p;
fn pow5multiple32(v: u32, p: u32) bool = pow5fac32(v) >= p;
fn pow2multiple(v: u64, p: u32) bool = {
assert(v > 0);
assert(p < 64);
return (v & ((1u64 << p) - 1)) == 0;
};
fn pow2multiple32(v: u32, p: u32) bool = {
assert(v > 0);
assert(p < 32);
return (v & ((1u32 << p) - 1)) == 0;
};
fn mulshift64(m: u64, mul: (u64, u64), j: u32) u64 = {
// m is maximum 55 bits
let r0 = u128mul(m, mul.0), r1 = u128mul(m, mul.1);
const sum = r1.lo + r0.hi;
r1.hi += ibool(sum < r0.hi);
return u128rshift(sum, r1.hi, j - 64);
};
fn mulshiftall64(
m: u64,
mul: (u64, u64),
j: i32,
mm_shift: u32,
) (u64, u64, u64) = {
m <<= 1;
const r0 = u128mul(m, mul.0), r1 = u128mul(m, mul.1);
const lo = r0.lo, tmp = r0.hi, mid = tmp + r1.lo;
const hi = r1.hi + ibool(mid < tmp);
const lo2 = lo + mul.0;
const mid2 = mid + mul.1 + ibool(lo2 < lo);
const hi2 = hi + ibool(mid2 < mid);
const v_plus = u128rshift(mid2, hi2, (j - 64 - 1): u32);
const v_minus = if (mm_shift == 1) {
const lo3 = lo - mul.0;
const mid3 = mid - mul.1 - ibool(lo3 > lo);
const hi3 = hi - ibool(mid3 > mid);
yield u128rshift(mid3, hi3, (j - 64 - 1): u32);
} else {
const lo3 = lo + lo;
const mid3 = mid + mid + ibool(lo3 < lo);
const hi3 = hi + hi + ibool(mid3 < mid);
const lo4 = lo3 - mul.0;
const mid4 = mid3 - mul.1 - ibool(lo4 > lo3);
const hi4 = hi3 - ibool(mid4 > mid3);
yield u128rshift(mid4, hi4, (j - 64): u32);
};
const v_rounded = u128rshift(mid, hi, (j - 64 - 1): u32);
return (v_plus, v_rounded, v_minus);
};
fn mulshift32(m: u32, a: u64, s: u32) u32 = {
assert(s > 32);
const a_lo = a: u32: u64, a_hi = a >> 32;
const b0 = m * a_lo, b1 = m * a_hi;
const sum = (b0 >> 32) + b1, ss = sum >> (s - 32);
assert(ss <= types::U32_MAX);
return ss: u32;
};
fn mulpow5inv_divpow2(m: u32, q: u32, j: i32) u32 = {
const pow5 = f64computeinvpow5(q);
return mulshift32(m, pow5.1 + 1, j: u32);
};
fn mulpow5_divpow2(m: u32, i: u32, j: i32) u32 = {
const pow5 = f64computepow5(i);
return mulshift32(m, pow5.1, j: u32);
};
fn log2pow5(e: u32) u32 = {
assert(e <= 3528);
return ((e * 1217359) >> 19);
};
fn ceil_log2pow5(e: u32) u32 = log2pow5(e) + 1;
fn pow5bits(e: u32) u32 = ceil_log2pow5(e);
fn log10pow2(e: u32) u32 = {
assert(e <= 1650);
return ((e * 78913) >> 18);
};
fn log10pow5(e: u32) u32 = {
assert(e <= 2620);
return ((e * 732923) >> 20);
};
def F64_POW5_INV_BITCOUNT: u8 = 125;
def F64_POW5_BITCOUNT: u8 = 125;
def F32_POW5_INV_BITCOUNT: u8 = F64_POW5_INV_BITCOUNT - 64;
def F32_POW5_BITCOUNT: u8 = F64_POW5_BITCOUNT - 64;
const F64_POW5_INV_SPLIT2: [15][2]u64 = [
[1, 2305843009213693952],
[5955668970331000884, 1784059615882449851],
[8982663654677661702, 1380349269358112757],
[7286864317269821294, 2135987035920910082],
[7005857020398200553, 1652639921975621497],
[17965325103354776697, 1278668206209430417],
[8928596168509315048, 1978643211784836272],
[10075671573058298858, 1530901034580419511],
[597001226353042382, 1184477304306571148],
[1527430471115325346, 1832889850782397517],
[12533209867169019542, 1418129833677084982],
[5577825024675947042, 2194449627517475473],
[11006974540203867551, 1697873161311732311],
[10313493231639821582, 1313665730009899186],
[12701016819766672773, 2032799256770390445],
];
const POW5_INV_OFFSETS: [19]u32 = [
0x54544554, 0x04055545, 0x10041000, 0x00400414, 0x40010000, 0x41155555,
0x00000454, 0x00010044, 0x40000000, 0x44000041, 0x50454450, 0x55550054,
0x51655554, 0x40004000, 0x01000001, 0x00010500, 0x51515411, 0x05555554,
0x00000000
];
const F64_POW5_SPLIT2: [13][2]u64 = [
[0, 1152921504606846976],
[0, 1490116119384765625],
[1032610780636961552, 1925929944387235853],
[7910200175544436838, 1244603055572228341],
[16941905809032713930, 1608611746708759036],
[13024893955298202172, 2079081953128979843],
[6607496772837067824, 1343575221513417750],
[17332926989895652603, 1736530273035216783],
[13037379183483547984, 2244412773384604712],
[1605989338741628675, 1450417759929778918],
[9630225068416591280, 1874621017369538693],
[665883850346957067, 1211445438634777304],
[14931890668723713708, 1565756531257009982]
];
const POW5_OFFSETS: [21]u32 = [
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x40000000, 0x59695995,
0x55545555, 0x56555515, 0x41150504, 0x40555410, 0x44555145, 0x44504540,
0x45555550, 0x40004000, 0x96440440, 0x55565565, 0x54454045, 0x40154151,
0x55559155, 0x51405555, 0x00000105
];
def POW5_TABLE_SZ: u8 = 26;
const POW5_TABLE: [POW5_TABLE_SZ]u64 = [
1u64, 5u64, 25u64, 125u64, 625u64, 3125u64, 15625u64, 78125u64,
390625u64, 1953125u64, 9765625u64, 48828125u64, 244140625u64,
1220703125u64, 6103515625u64, 30517578125u64, 152587890625u64,
762939453125u64, 3814697265625u64, 19073486328125u64, 95367431640625u64,
476837158203125u64, 2384185791015625u64, 11920928955078125u64,
59604644775390625u64, 298023223876953125u64 //, 1490116119384765625u64
];
fn f64computeinvpow5(i: u32) (u64, u64) = {
const base = ((i + POW5_TABLE_SZ - 1) / POW5_TABLE_SZ): u32;
const base2 = base * POW5_TABLE_SZ;
const mul = F64_POW5_INV_SPLIT2[base];
const off = base2 - i;
if (off == 0) {
return (mul[0], mul[1]);
};
const m = POW5_TABLE[off];
const r1 = u128mul(m, mul[1]), r0 = u128mul(m, mul[0] - 1);
let high1 = r1.hi, low1 = r1.lo, high0 = r0.hi, low0 = r0.lo;
const sum = high0 + low1;
if (sum < high0) {
high1 += 1;
};
const delta = pow5bits(base2) - pow5bits(i);
const res0 = u128rshift(low0, sum, delta) + 1 +
((POW5_INV_OFFSETS[i / 16] >> ((i % 16) << 1)) & 3);
const res1 = u128rshift(sum, high1, delta);
return (res0, res1);
};
fn f64computepow5(i: u32) (u64, u64) = {
const base = i / POW5_TABLE_SZ, base2 = base * POW5_TABLE_SZ;
const mul = F64_POW5_SPLIT2[base];
const off = i - base2;
if (off == 0) {
return (mul[0], mul[1]);
};
const m = POW5_TABLE[off];
const r1 = u128mul(m, mul[1]), r0 = u128mul(m, mul[0]);
let high1 = r1.hi, low1 = r1.lo, high0 = r0.hi, low0 = r0.lo;
const sum = high0 + low1;
if (sum < high0) {
high1 += 1;
};
const delta = pow5bits(i) - pow5bits(base2);
const res0 = u128rshift(low0, sum, delta) +
((POW5_OFFSETS[i / 16] >> ((i % 16) << 1)) & 3);
const res1 = u128rshift(sum, high1, delta);
return (res0, res1);
};
type decf64 = struct {
mantissa: u64,
exponent: i32,
};
fn f64todecf64(mantissa: u64, exponent: u32) decf64 = {
let e2 = (math::F64_EXPONENT_BIAS + math::F64_MANTISSA_BITS + 2): i32;
let m2: u64 = 0;
if (exponent == 0) {
e2 = 1 - e2;
m2 = mantissa;
} else {
e2 = (exponent: i32) - e2;
m2 = (1u64 << math::F64_MANTISSA_BITS) | mantissa;
};
const accept_bounds = (m2 & 1) == 0;
const mv = 4 * m2;
const mm_shift = ibool(mantissa != 0 || exponent <= 1);
let vp: u64 = 0, vr: u64 = 0, vm: u64 = 0;
let e10: i32 = 0;
let vm_trailing_zeros = false, vr_trailing_zeros = false;
if (e2 >= 0) {
const q = log10pow2(e2: u32) - ibool(e2 > 3);
e10 = q: i32;
const k = F64_POW5_INV_BITCOUNT + pow5bits(q) - 1;
const i = -e2 + (q + k): i32;
let pow5 = f64computeinvpow5(q);
const res = mulshiftall64(m2, pow5, i, mm_shift);
vp = res.0; vr = res.1; vm = res.2;
if (q <= 21) {
if ((mv - 5 * (mv / 5)) == 0) {
vr_trailing_zeros = pow5multiple(mv, q);
} else if (accept_bounds) {
vm_trailing_zeros = pow5multiple(mv - 1 -
mm_shift, q);
} else {
vp -= ibool(pow5multiple(mv + 2, q));
};
};
} else {
const q = log10pow5((-e2): u32) - ibool(-e2 > 1);
e10 = e2 + (q: i32);
const i = -e2 - (q: i32);
const k = pow5bits(i: u32): i32 - F64_POW5_BITCOUNT: i32;
const j = (q: i32) - k;
let pow5 = f64computepow5(i: u32);
const res = mulshiftall64(m2, pow5, j, mm_shift);
vp = res.0; vr = res.1; vm = res.2;
if (q <= 1) {
vr_trailing_zeros = true;
if (accept_bounds) {
vm_trailing_zeros = mm_shift == 1;
} else {
vp -= 1;
};
} else if (q < 63) {
vr_trailing_zeros = pow2multiple(mv, q);
};
};
let removed: i32 = 0, last_removed_digit: u8 = 0;
let output: u64 = 0;
if (vm_trailing_zeros || vr_trailing_zeros) {
for (true) {
const vpby10 = vp / 10, vmby10 = vm / 10;
if (vpby10 <= vmby10) break;
const vmmod10 = (vm: u32) - 10 * (vmby10: u32);
const vrby10 = vr / 10;
const vrmod10 = (vr: u32) - 10 * (vrby10: u32);
vm_trailing_zeros &&= vmmod10 == 0;
vr_trailing_zeros &&= last_removed_digit == 0;
last_removed_digit = vrmod10: u8;
vr = vrby10; vp = vpby10; vm = vmby10;
removed += 1;
};
if (vm_trailing_zeros) {
for (true) {
const vmby10 = vm / 10;
const vmmod10 = (vm: u32) - 10 * (vmby10: u32);
if (vmmod10 != 0) break;
const vpby10 = vp / 10, vrby10 = vr / 10;
const vrmod10 = (vr: u32) - 10 * (vrby10: u32);
vr_trailing_zeros &&= last_removed_digit == 0;
last_removed_digit = vrmod10: u8;
vr = vrby10; vp = vpby10; vm = vmby10;
removed += 1;
};
};
if (vr_trailing_zeros && last_removed_digit == 5 &&
(vr & 1 == 0)) {
// round to even
last_removed_digit = 4;
};
output = vr + ibool((vr == vm &&
(!accept_bounds || !vm_trailing_zeros)) ||
last_removed_digit >= 5);
} else {
let round_up = false;
const vpby100 = vp / 100, vmby100 = vm / 100;
if (vpby100 > vmby100) {
const vrby100 = vr / 100;
const vrmod100 = (vr: u32) - 100 * (vrby100: u32);
round_up = vrmod100 >= 50;
vr = vrby100; vp = vpby100; vm = vmby100;
removed += 2;
};
for (true) {
const vmby10 = vm / 10, vpby10 = vp / 10;
if (vpby10 <= vmby10) break;
const vrby10 = vr / 10;
const vrmod10 = (vr: u32) - 10 * (vrby10: u32);
round_up = vrmod10 >= 5;
vr = vrby10; vp = vpby10; vm = vmby10;
removed += 1;
};
output = vr + ibool(vr == vm || round_up);
};
const exp = e10 + removed;
return decf64 { exponent = exp, mantissa = output };
};
type decf32 = struct {
mantissa: u32,
exponent: i32,
};
fn f32todecf32(mantissa: u32, exponent: u32) decf32 = {
let e2 = (math::F32_EXPONENT_BIAS + math::F32_MANTISSA_BITS + 2): i32;
let m2: u32 = 0;
if (exponent == 0) {
e2 = 1 - e2;
m2 = mantissa;
} else {
e2 = (exponent: i32) - e2;
m2 = (1u32 << math::F32_MANTISSA_BITS: u32) | mantissa;
};
const accept_bounds = (m2 & 1) == 0;
const mv = 4 * m2, mp = mv + 2;
const mm_shift = ibool(mantissa != 0 || exponent <= 1);
const mm = mv - 1 - mm_shift;
let vr: u32 = 0, vp: u32 = 0, vm: u32 = 0;
let e10: i32 = 0;
let vm_trailing_zeroes = false, vr_trailing_zeroes = false;
let last_removed_digit: u8 = 0;
if (e2 >= 0) {
const q = log10pow2(e2: u32);
e10 = q: i32;
const k = F32_POW5_INV_BITCOUNT + pow5bits(q) - 1;
const i = -e2 + (q + k): i32;
vr = mulpow5inv_divpow2(mv, q, i);
vp = mulpow5inv_divpow2(mp, q, i);
vm = mulpow5inv_divpow2(mm, q, i);
if (q != 0 && (vp - 1) / 10 <= vm / 10) {
const l = F32_POW5_INV_BITCOUNT + pow5bits(q - 1) - 1;
last_removed_digit = (mulpow5inv_divpow2(mv, q - 1,
-e2 + ((q + l): i32) - 1) % 10): u8;
};
if (q <= 9) {
if (mv % 5 == 0) {
vr_trailing_zeroes = pow5multiple32(mv, q);
} else if (accept_bounds) {
vm_trailing_zeroes = pow5multiple32(mm, q);
} else {
vp -= ibool(pow5multiple32(mp, q));
};
};
} else {
const q = log10pow5((-e2): u32);
e10 = (q: i32) + e2;
const i = (-e2 - (q: i32)): u32;
const k = pow5bits(i) - F32_POW5_BITCOUNT;
let j = (q: i32) - k: i32;
vr = mulpow5_divpow2(mv, i, j);
vp = mulpow5_divpow2(mp, i, j);
vm = mulpow5_divpow2(mm, i, j);
if (q != 0 && (vp - 1) / 10 <= vm / 10) {
j = (q: i32) - 1 - (pow5bits(i + 1): i32 -
F32_POW5_BITCOUNT: i32);
last_removed_digit = (mulpow5_divpow2(mv,
(i + 1), j) % 10): u8;
};
if (q <= 1) {
vr_trailing_zeroes = true;
if (accept_bounds) {
vm_trailing_zeroes = mm_shift == 1;
} else {
vp -= 1;
};
} else if (q < 31) {
vr_trailing_zeroes = pow2multiple32(mv, q - 1);
};
};
let removed: i32 = 0, output: u32 = 0;
if (vm_trailing_zeroes || vr_trailing_zeroes) {
for (vp / 10 > vm / 10) {
vm_trailing_zeroes &&= (vm - (vm / 10) * 10) == 0;
vr_trailing_zeroes &&= last_removed_digit == 0;
last_removed_digit = (vr % 10): u8;
vr /= 10;
vp /= 10;
vm /= 10;
removed += 1;
};
if (vm_trailing_zeroes) {
for (vm % 10 == 0) {
vr_trailing_zeroes &&= last_removed_digit == 0;
last_removed_digit = (vr % 10): u8;
vr /= 10;
vp /= 10;
vm /= 10;
removed += 1;
};
};
if (vr_trailing_zeroes && last_removed_digit == 5 &&
vr % 2 == 0) {
// round to even
last_removed_digit = 4;
};
output = vr + ibool((vr == vm &&
(!accept_bounds || !vm_trailing_zeroes)) ||
last_removed_digit >= 5);
} else {
for (vp / 10 > vm / 10) {
last_removed_digit = (vr % 10): u8;
vr /= 10;
vp /= 10;
vm /= 10;
removed += 1;
};
output = vr + ibool(vr == vm || last_removed_digit >= 5);
};
const exp = e10 + removed;
return decf32 { mantissa = output, exponent = exp };
};
def F32_DECIMAL_DIGITS: i32 = 9;
def F64_DECIMAL_DIGITS: i32 = 17;
|