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
|
// SPDX-License-Identifier: MIT
// Copyright (c) 2015-2021 Zig Contributors
// This file is part of [zig](https://ziglang.org/), which is MIT licensed.
// The MIT license requires this copyright notice to be included in all copies
// and substantial portions of the software.
// 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/ilogbf.c
// https://git.musl-libc.org/cgit/musl/tree/src/math/ilogb.c
const std = @import("../std.zig");
const math = std.math;
const expect = std.testing.expect;
const maxInt = std.math.maxInt;
const minInt = std.math.minInt;
/// Returns the binary exponent of x as an integer.
///
/// Special Cases:
/// - ilogb(+-inf) = maxInt(i32)
/// - ilogb(0) = maxInt(i32)
/// - ilogb(nan) = maxInt(i32)
pub fn ilogb(x: anytype) i32 {
const T = @TypeOf(x);
return switch (T) {
f32 => ilogb32(x),
f64 => ilogb64(x),
else => @compileError("ilogb not implemented for " ++ @typeName(T)),
};
}
// NOTE: Should these be exposed publicly?
const fp_ilogbnan = -1 - @as(i32, maxInt(u32) >> 1);
const fp_ilogb0 = fp_ilogbnan;
fn ilogb32(x: f32) i32 {
var u = @bitCast(u32, x);
var e = @intCast(i32, (u >> 23) & 0xFF);
// TODO: We should be able to merge this with the lower check.
if (math.isNan(x)) {
return maxInt(i32);
}
if (e == 0) {
u <<= 9;
if (u == 0) {
math.raiseInvalid();
return fp_ilogb0;
}
// subnormal
e = -0x7F;
while (u >> 31 == 0) : (u <<= 1) {
e -= 1;
}
return e;
}
if (e == 0xFF) {
math.raiseInvalid();
if (u << 9 != 0) {
return fp_ilogbnan;
} else {
return maxInt(i32);
}
}
return e - 0x7F;
}
fn ilogb64(x: f64) i32 {
var u = @bitCast(u64, x);
var e = @intCast(i32, (u >> 52) & 0x7FF);
if (math.isNan(x)) {
return maxInt(i32);
}
if (e == 0) {
u <<= 12;
if (u == 0) {
math.raiseInvalid();
return fp_ilogb0;
}
// subnormal
e = -0x3FF;
while (u >> 63 == 0) : (u <<= 1) {
e -= 1;
}
return e;
}
if (e == 0x7FF) {
math.raiseInvalid();
if (u << 12 != 0) {
return fp_ilogbnan;
} else {
return maxInt(i32);
}
}
return e - 0x3FF;
}
test "math.ilogb" {
try expect(ilogb(@as(f32, 0.2)) == ilogb32(0.2));
try expect(ilogb(@as(f64, 0.2)) == ilogb64(0.2));
}
test "math.ilogb32" {
try expect(ilogb32(0.0) == fp_ilogb0);
try expect(ilogb32(0.5) == -1);
try expect(ilogb32(0.8923) == -1);
try expect(ilogb32(10.0) == 3);
try expect(ilogb32(-123984) == 16);
try expect(ilogb32(2398.23) == 11);
}
test "math.ilogb64" {
try expect(ilogb64(0.0) == fp_ilogb0);
try expect(ilogb64(0.5) == -1);
try expect(ilogb64(0.8923) == -1);
try expect(ilogb64(10.0) == 3);
try expect(ilogb64(-123984) == 16);
try expect(ilogb64(2398.23) == 11);
}
test "math.ilogb32.special" {
try expect(ilogb32(math.inf(f32)) == maxInt(i32));
try expect(ilogb32(-math.inf(f32)) == maxInt(i32));
try expect(ilogb32(0.0) == minInt(i32));
try expect(ilogb32(math.nan(f32)) == maxInt(i32));
}
test "math.ilogb64.special" {
try expect(ilogb64(math.inf(f64)) == maxInt(i32));
try expect(ilogb64(-math.inf(f64)) == maxInt(i32));
try expect(ilogb64(0.0) == minInt(i32));
try expect(ilogb64(math.nan(f64)) == maxInt(i32));
}
|
