mirror of
https://codeberg.org/ziglang/zig.git
synced 2025-12-06 05:44:20 +00:00
ec95e00e28
stage2: change logic for detecting whether the main package is inside
the std package. Previously it relied on realpath() which is not portable.
This uses resolve() which is how imports already work.
* stage2: fix cleanup bug when creating Module
* flatten lib/std/special/* to lib/*
- this was motivated by making main_pkg_is_inside_std false for
compiler_rt & friends.
* rename "mini libc" to "universal libc"
101 lines
2.6 KiB
Zig
101 lines
2.6 KiB
Zig
// Ported from:
|
|
//
|
|
// https://github.com/llvm/llvm-project/commit/d674d96bc56c0f377879d01c9d8dfdaaa7859cdb/compiler-rt/test/builtins/Unit/comparesf2_test.c
|
|
|
|
const std = @import("std");
|
|
const builtin = @import("builtin");
|
|
const is_test = builtin.is_test;
|
|
|
|
const comparesf2 = @import("compareXf2.zig");
|
|
|
|
const TestVector = struct {
|
|
a: f32,
|
|
b: f32,
|
|
eqReference: c_int,
|
|
geReference: c_int,
|
|
gtReference: c_int,
|
|
leReference: c_int,
|
|
ltReference: c_int,
|
|
neReference: c_int,
|
|
unReference: c_int,
|
|
};
|
|
|
|
fn test__cmpsf2(vector: TestVector) bool {
|
|
if (comparesf2.__eqsf2(vector.a, vector.b) != vector.eqReference) {
|
|
return false;
|
|
}
|
|
if (comparesf2.__gesf2(vector.a, vector.b) != vector.geReference) {
|
|
return false;
|
|
}
|
|
if (comparesf2.__gtsf2(vector.a, vector.b) != vector.gtReference) {
|
|
return false;
|
|
}
|
|
if (comparesf2.__lesf2(vector.a, vector.b) != vector.leReference) {
|
|
return false;
|
|
}
|
|
if (comparesf2.__ltsf2(vector.a, vector.b) != vector.ltReference) {
|
|
return false;
|
|
}
|
|
if (comparesf2.__nesf2(vector.a, vector.b) != vector.neReference) {
|
|
return false;
|
|
}
|
|
if (comparesf2.__unordsf2(vector.a, vector.b) != vector.unReference) {
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
const arguments = [_]f32{
|
|
std.math.nan(f32),
|
|
-std.math.inf(f32),
|
|
-0x1.fffffep127,
|
|
-0x1.000002p0 - 0x1.000000p0,
|
|
-0x1.fffffep-1,
|
|
-0x1.000000p-126,
|
|
-0x0.fffffep-126,
|
|
-0x0.000002p-126,
|
|
-0.0,
|
|
0.0,
|
|
0x0.000002p-126,
|
|
0x0.fffffep-126,
|
|
0x1.000000p-126,
|
|
0x1.fffffep-1,
|
|
0x1.000000p0,
|
|
0x1.000002p0,
|
|
0x1.fffffep127,
|
|
std.math.inf(f32),
|
|
};
|
|
|
|
fn generateVector(comptime a: f32, comptime b: f32) TestVector {
|
|
const leResult = if (a < b) -1 else if (a == b) 0 else 1;
|
|
const geResult = if (a > b) 1 else if (a == b) 0 else -1;
|
|
const unResult = if (a != a or b != b) 1 else 0;
|
|
return TestVector{
|
|
.a = a,
|
|
.b = b,
|
|
.eqReference = leResult,
|
|
.geReference = geResult,
|
|
.gtReference = geResult,
|
|
.leReference = leResult,
|
|
.ltReference = leResult,
|
|
.neReference = leResult,
|
|
.unReference = unResult,
|
|
};
|
|
}
|
|
|
|
const test_vectors = init: {
|
|
@setEvalBranchQuota(10000);
|
|
var vectors: [arguments.len * arguments.len]TestVector = undefined;
|
|
for (arguments[0..]) |arg_i, i| {
|
|
for (arguments[0..]) |arg_j, j| {
|
|
vectors[(i * arguments.len) + j] = generateVector(arg_i, arg_j);
|
|
}
|
|
}
|
|
break :init vectors;
|
|
};
|
|
|
|
test "compare f32" {
|
|
for (test_vectors) |vector| {
|
|
try std.testing.expect(test__cmpsf2(vector));
|
|
}
|
|
}
|