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
|
/*
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright © 2025 Keith Packard
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef TEST_FUNC
#error Pass -DTEST_FUNC=function when building
#endif
#define _GNU_SOURCE
#include "test-math.h"
#define FNAME MATH_STRING(TEST_FUNC)
#if !defined(HAS_BINARY32) || !defined(HAS_BINARY64)
int
main(void)
{
printf("Skipping test-math-compare-" FNAME " on target without 32-bit and 64-bit floats\n");
return (77);
}
#else
static inline binary32
binary32_from_uint32(uint32_t u32)
{
union {
binary32 f32;
uint32_t u32;
} u;
u.u32 = u32;
return u.f32;
}
static inline uint32_t
uint32_from_binary32(binary32 f32)
{
union {
binary32 f32;
uint32_t u32;
} u;
u.f32 = f32;
return u.u32;
}
#define UINV_ULP UINTMAX_C(0xffffffff)
static inline uint32_t
compare_ulp32(binary32 x, binary32 y)
{
uint32_t ulp = 0;
uint32_t ux = uint32_from_binary32(x);
uint32_t uy = uint32_from_binary32(y);
if (ux == uy)
return 0;
if (isnan(x) && isnan(y))
return 0;
if (isnan(x) || isnan(y))
return UINV_ULP;
if ((ux & 0x80000000UL) != (uy & 0x80000000UL))
ulp++;
ux &= 0x7fffffffUL;
uy &= 0x7fffffffUL;
if (ux > uy)
ulp += ux - uy;
else
ulp += uy - ux;
return ulp;
}
#ifdef __PICOLIBC__
#define LIBNAME "picolibc"
#else
#define LIBNAME "native"
#endif
#if 0
#define START 0xc0000000UL
#define END 0xd0000000UL
#define STEP 0x00000001UL
#else
#define START 0x00000000UL
#define END 0xffffffffUL
#define STEP 0x00000001UL
#endif
int
main(void)
{
uint32_t u32 = START;
uint32_t max_ulp = 0;
uint32_t max_ulp_u32 = 0;
ulp_t check_ulps = math_find_ulp_binary32();
int ret = 0;
#define ULP_BINS 4
uint32_t ulps[ULP_BINS] = {};
uint32_t bin;
printf("Testing %s: \n", FNAME);
for (;;) {
binary32 fx = binary32_from_uint32(u32);
binary64 dx = (binary64)fx;
binary32 fy = TEST_FUNC_32(fx);
binary64 dy = TEST_FUNC_64(dx);
binary32 fdy = (binary32)dy;
uint32_t ulp = compare_ulp32(fy, fdy);
if (ulp) {
bin = ulp - 1;
if (bin >= ULP_BINS)
bin = ULP_BINS - 1;
ulps[bin]++;
}
if (ulp > max_ulp) {
max_ulp = ulp;
max_ulp_u32 = u32;
}
if (ulp > (uint32_t)check_ulps && check_ulps < MAX_ULP) {
ret = 1;
printf("%s: ulp %" PRIu32 " 0x%08" PRIx32 " %a got 0x%08" PRIx32 " %a want 0x%08" PRIx32
" %a\n",
FNAME, ulp, uint32_from_binary32(fx), (binary64)fx, uint32_from_binary32(fy),
(binary64)fy, uint32_from_binary32(fdy), (binary64)fdy);
if (ulp == 1) {
if (fy < fdy)
printf("plus %" PRIx32 "\n", uint32_from_binary32(fx));
else
printf("minus %" PRIx32 "\n", uint32_from_binary32(fx));
}
}
if ((u32 & 0xfffffff) == 0)
printf(" 0x%08" PRIx32 "\n", u32);
if (u32 == END)
break;
u32 += STEP;
}
for (bin = 0; bin < ULP_BINS; bin++) {
if (ulps[bin]) {
if (bin == ULP_BINS - 1)
printf(">%d ulp: %8" PRIu32 "\n", bin + 1, ulps[bin]);
else
printf(" %d ulp: %8" PRIu32 "\n", bin + 1, ulps[bin]);
}
}
printf("%s %s: max_ulp %" PRIu32 " at 0x%08" PRIx32 " %a\n", LIBNAME, FNAME, max_ulp,
max_ulp_u32, (binary64)binary32_from_uint32(max_ulp_u32));
if (ret)
printf("FAILED\n");
else
printf("PASSED\n");
return ret;
}
#endif
|
