mirror of
https://github.com/ziglang/zig.git
synced 2024-11-16 00:57:04 +00:00
0fe3fd01dd
The compiler actually doesn't need any functional changes for this: Sema does reification based on the tag indices of `std.builtin.Type` already! So, no zig1.wasm update is necessary. This change is necessary to disallow name clashes between fields and decls on a type, which is a prerequisite of #9938.
225 lines
7.3 KiB
Zig
225 lines
7.3 KiB
Zig
//! Ported from musl, which is licensed under the MIT license:
|
|
//! https://git.musl-libc.org/cgit/musl/tree/COPYRIGHT
|
|
//!
|
|
//! https://git.musl-libc.org/cgit/musl/tree/src/math/log10f.c
|
|
//! https://git.musl-libc.org/cgit/musl/tree/src/math/log10.c
|
|
|
|
const std = @import("std");
|
|
const builtin = @import("builtin");
|
|
const math = std.math;
|
|
const testing = std.testing;
|
|
const maxInt = std.math.maxInt;
|
|
const arch = builtin.cpu.arch;
|
|
const common = @import("common.zig");
|
|
|
|
pub const panic = common.panic;
|
|
|
|
comptime {
|
|
@export(&__log10h, .{ .name = "__log10h", .linkage = common.linkage, .visibility = common.visibility });
|
|
@export(&log10f, .{ .name = "log10f", .linkage = common.linkage, .visibility = common.visibility });
|
|
@export(&log10, .{ .name = "log10", .linkage = common.linkage, .visibility = common.visibility });
|
|
@export(&__log10x, .{ .name = "__log10x", .linkage = common.linkage, .visibility = common.visibility });
|
|
if (common.want_ppc_abi) {
|
|
@export(&log10q, .{ .name = "log10f128", .linkage = common.linkage, .visibility = common.visibility });
|
|
}
|
|
@export(&log10q, .{ .name = "log10q", .linkage = common.linkage, .visibility = common.visibility });
|
|
@export(&log10l, .{ .name = "log10l", .linkage = common.linkage, .visibility = common.visibility });
|
|
}
|
|
|
|
pub fn __log10h(a: f16) callconv(.C) f16 {
|
|
// TODO: more efficient implementation
|
|
return @floatCast(log10f(a));
|
|
}
|
|
|
|
pub fn log10f(x_: f32) callconv(.C) f32 {
|
|
const ivln10hi: f32 = 4.3432617188e-01;
|
|
const ivln10lo: f32 = -3.1689971365e-05;
|
|
const log10_2hi: f32 = 3.0102920532e-01;
|
|
const log10_2lo: f32 = 7.9034151668e-07;
|
|
const Lg1: f32 = 0xaaaaaa.0p-24;
|
|
const Lg2: f32 = 0xccce13.0p-25;
|
|
const Lg3: f32 = 0x91e9ee.0p-25;
|
|
const Lg4: f32 = 0xf89e26.0p-26;
|
|
|
|
var x = x_;
|
|
var u: u32 = @bitCast(x);
|
|
var ix = u;
|
|
var k: i32 = 0;
|
|
|
|
// x < 2^(-126)
|
|
if (ix < 0x00800000 or ix >> 31 != 0) {
|
|
// log(+-0) = -inf
|
|
if (ix << 1 == 0) {
|
|
return -math.inf(f32);
|
|
}
|
|
// log(-#) = nan
|
|
if (ix >> 31 != 0) {
|
|
return math.nan(f32);
|
|
}
|
|
|
|
k -= 25;
|
|
x *= 0x1.0p25;
|
|
ix = @bitCast(x);
|
|
} else if (ix >= 0x7F800000) {
|
|
return x;
|
|
} else if (ix == 0x3F800000) {
|
|
return 0;
|
|
}
|
|
|
|
// x into [sqrt(2) / 2, sqrt(2)]
|
|
ix += 0x3F800000 - 0x3F3504F3;
|
|
k += @as(i32, @intCast(ix >> 23)) - 0x7F;
|
|
ix = (ix & 0x007FFFFF) + 0x3F3504F3;
|
|
x = @bitCast(ix);
|
|
|
|
const f = x - 1.0;
|
|
const s = f / (2.0 + f);
|
|
const z = s * s;
|
|
const w = z * z;
|
|
const t1 = w * (Lg2 + w * Lg4);
|
|
const t2 = z * (Lg1 + w * Lg3);
|
|
const R = t2 + t1;
|
|
const hfsq = 0.5 * f * f;
|
|
|
|
var hi = f - hfsq;
|
|
u = @bitCast(hi);
|
|
u &= 0xFFFFF000;
|
|
hi = @bitCast(u);
|
|
const lo = f - hi - hfsq + s * (hfsq + R);
|
|
const dk: f32 = @floatFromInt(k);
|
|
|
|
return dk * log10_2lo + (lo + hi) * ivln10lo + lo * ivln10hi + hi * ivln10hi + dk * log10_2hi;
|
|
}
|
|
|
|
pub fn log10(x_: f64) callconv(.C) f64 {
|
|
const ivln10hi: f64 = 4.34294481878168880939e-01;
|
|
const ivln10lo: f64 = 2.50829467116452752298e-11;
|
|
const log10_2hi: f64 = 3.01029995663611771306e-01;
|
|
const log10_2lo: f64 = 3.69423907715893078616e-13;
|
|
const Lg1: f64 = 6.666666666666735130e-01;
|
|
const Lg2: f64 = 3.999999999940941908e-01;
|
|
const Lg3: f64 = 2.857142874366239149e-01;
|
|
const Lg4: f64 = 2.222219843214978396e-01;
|
|
const Lg5: f64 = 1.818357216161805012e-01;
|
|
const Lg6: f64 = 1.531383769920937332e-01;
|
|
const Lg7: f64 = 1.479819860511658591e-01;
|
|
|
|
var x = x_;
|
|
var ix: u64 = @bitCast(x);
|
|
var hx: u32 = @intCast(ix >> 32);
|
|
var k: i32 = 0;
|
|
|
|
if (hx < 0x00100000 or hx >> 31 != 0) {
|
|
// log(+-0) = -inf
|
|
if (ix << 1 == 0) {
|
|
return -math.inf(f64);
|
|
}
|
|
// log(-#) = nan
|
|
if (hx >> 31 != 0) {
|
|
return math.nan(f64);
|
|
}
|
|
|
|
// subnormal, scale x
|
|
k -= 54;
|
|
x *= 0x1.0p54;
|
|
hx = @intCast(@as(u64, @bitCast(x)) >> 32);
|
|
} else if (hx >= 0x7FF00000) {
|
|
return x;
|
|
} else if (hx == 0x3FF00000 and ix << 32 == 0) {
|
|
return 0;
|
|
}
|
|
|
|
// x into [sqrt(2) / 2, sqrt(2)]
|
|
hx += 0x3FF00000 - 0x3FE6A09E;
|
|
k += @as(i32, @intCast(hx >> 20)) - 0x3FF;
|
|
hx = (hx & 0x000FFFFF) + 0x3FE6A09E;
|
|
ix = (@as(u64, hx) << 32) | (ix & 0xFFFFFFFF);
|
|
x = @bitCast(ix);
|
|
|
|
const f = x - 1.0;
|
|
const hfsq = 0.5 * f * f;
|
|
const s = f / (2.0 + f);
|
|
const z = s * s;
|
|
const w = z * z;
|
|
const t1 = w * (Lg2 + w * (Lg4 + w * Lg6));
|
|
const t2 = z * (Lg1 + w * (Lg3 + w * (Lg5 + w * Lg7)));
|
|
const R = t2 + t1;
|
|
|
|
// hi + lo = f - hfsq + s * (hfsq + R) ~ log(1 + f)
|
|
var hi = f - hfsq;
|
|
var hii: u64 = @bitCast(hi);
|
|
hii &= @as(u64, maxInt(u64)) << 32;
|
|
hi = @bitCast(hii);
|
|
const lo = f - hi - hfsq + s * (hfsq + R);
|
|
|
|
// val_hi + val_lo ~ log10(1 + f) + k * log10(2)
|
|
var val_hi = hi * ivln10hi;
|
|
const dk: f64 = @floatFromInt(k);
|
|
const y = dk * log10_2hi;
|
|
var val_lo = dk * log10_2lo + (lo + hi) * ivln10lo + lo * ivln10hi;
|
|
|
|
// Extra precision multiplication
|
|
const ww = y + val_hi;
|
|
val_lo += (y - ww) + val_hi;
|
|
val_hi = ww;
|
|
|
|
return val_lo + val_hi;
|
|
}
|
|
|
|
pub fn __log10x(a: f80) callconv(.C) f80 {
|
|
// TODO: more efficient implementation
|
|
return @floatCast(log10q(a));
|
|
}
|
|
|
|
pub fn log10q(a: f128) callconv(.C) f128 {
|
|
// TODO: more correct implementation
|
|
return log10(@floatCast(a));
|
|
}
|
|
|
|
pub fn log10l(x: c_longdouble) callconv(.C) c_longdouble {
|
|
switch (@typeInfo(c_longdouble).float.bits) {
|
|
16 => return __log10h(x),
|
|
32 => return log10f(x),
|
|
64 => return log10(x),
|
|
80 => return __log10x(x),
|
|
128 => return log10q(x),
|
|
else => @compileError("unreachable"),
|
|
}
|
|
}
|
|
|
|
test "log10_32" {
|
|
const epsilon = 0.000001;
|
|
|
|
try testing.expect(math.approxEqAbs(f32, log10f(0.2), -0.698970, epsilon));
|
|
try testing.expect(math.approxEqAbs(f32, log10f(0.8923), -0.049489, epsilon));
|
|
try testing.expect(math.approxEqAbs(f32, log10f(1.5), 0.176091, epsilon));
|
|
try testing.expect(math.approxEqAbs(f32, log10f(37.45), 1.573452, epsilon));
|
|
try testing.expect(math.approxEqAbs(f32, log10f(89.123), 1.94999, epsilon));
|
|
try testing.expect(math.approxEqAbs(f32, log10f(123123.234375), 5.09034, epsilon));
|
|
}
|
|
|
|
test "log10_64" {
|
|
const epsilon = 0.000001;
|
|
|
|
try testing.expect(math.approxEqAbs(f64, log10(0.2), -0.698970, epsilon));
|
|
try testing.expect(math.approxEqAbs(f64, log10(0.8923), -0.049489, epsilon));
|
|
try testing.expect(math.approxEqAbs(f64, log10(1.5), 0.176091, epsilon));
|
|
try testing.expect(math.approxEqAbs(f64, log10(37.45), 1.573452, epsilon));
|
|
try testing.expect(math.approxEqAbs(f64, log10(89.123), 1.94999, epsilon));
|
|
try testing.expect(math.approxEqAbs(f64, log10(123123.234375), 5.09034, epsilon));
|
|
}
|
|
|
|
test "log10_32.special" {
|
|
try testing.expect(math.isPositiveInf(log10f(math.inf(f32))));
|
|
try testing.expect(math.isNegativeInf(log10f(0.0)));
|
|
try testing.expect(math.isNan(log10f(-1.0)));
|
|
try testing.expect(math.isNan(log10f(math.nan(f32))));
|
|
}
|
|
|
|
test "log10_64.special" {
|
|
try testing.expect(math.isPositiveInf(log10(math.inf(f64))));
|
|
try testing.expect(math.isNegativeInf(log10(0.0)));
|
|
try testing.expect(math.isNan(log10(-1.0)));
|
|
try testing.expect(math.isNan(log10(math.nan(f64))));
|
|
}
|