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
|
/* Compute x * y + z as ternary operation.
Copyright (C) 2010 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Jakub Jelinek <jakub@redhat.com>, 2010.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, write to the Free
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA. */
#include "quadmath-imp.h"
#include <math.h>
#include <float.h>
#ifdef HAVE_FENV_H
# include <fenv.h>
# if defined HAVE_FEHOLDEXCEPT && defined HAVE_FESETROUND \
&& defined HAVE_FEUPDATEENV && defined HAVE_FETESTEXCEPT \
&& defined FE_TOWARDZERO && defined FE_INEXACT
# define USE_FENV_H
# endif
#endif
/* This implementation uses rounding to odd to avoid problems with
double rounding. See a paper by Boldo and Melquiond:
http://www.lri.fr/~melquion/doc/08-tc.pdf */
__float128
fmaq (__float128 x, __float128 y, __float128 z)
{
ieee854_float128 u, v, w;
int adjust = 0;
u.value = x;
v.value = y;
w.value = z;
if (__builtin_expect (u.ieee.exponent + v.ieee.exponent
>= 0x7fff + IEEE854_FLOAT128_BIAS
- FLT128_MANT_DIG, 0)
|| __builtin_expect (u.ieee.exponent >= 0x7fff - FLT128_MANT_DIG, 0)
|| __builtin_expect (v.ieee.exponent >= 0x7fff - FLT128_MANT_DIG, 0)
|| __builtin_expect (w.ieee.exponent >= 0x7fff - FLT128_MANT_DIG, 0)
|| __builtin_expect (u.ieee.exponent + v.ieee.exponent
<= IEEE854_FLOAT128_BIAS + FLT128_MANT_DIG, 0))
{
/* If z is Inf, but x and y are finite, the result should be
z rather than NaN. */
if (w.ieee.exponent == 0x7fff
&& u.ieee.exponent != 0x7fff
&& v.ieee.exponent != 0x7fff)
return (z + x) + y;
/* If x or y or z is Inf/NaN, or if fma will certainly overflow,
or if x * y is less than half of FLT128_DENORM_MIN,
compute as x * y + z. */
if (u.ieee.exponent == 0x7fff
|| v.ieee.exponent == 0x7fff
|| w.ieee.exponent == 0x7fff
|| u.ieee.exponent + v.ieee.exponent
> 0x7fff + IEEE854_FLOAT128_BIAS
|| u.ieee.exponent + v.ieee.exponent
< IEEE854_FLOAT128_BIAS - FLT128_MANT_DIG - 2)
return x * y + z;
if (u.ieee.exponent + v.ieee.exponent
>= 0x7fff + IEEE854_FLOAT128_BIAS - FLT128_MANT_DIG)
{
/* Compute 1p-113 times smaller result and multiply
at the end. */
if (u.ieee.exponent > v.ieee.exponent)
u.ieee.exponent -= FLT128_MANT_DIG;
else
v.ieee.exponent -= FLT128_MANT_DIG;
/* If x + y exponent is very large and z exponent is very small,
it doesn't matter if we don't adjust it. */
if (w.ieee.exponent > FLT128_MANT_DIG)
w.ieee.exponent -= FLT128_MANT_DIG;
adjust = 1;
}
else if (w.ieee.exponent >= 0x7fff - FLT128_MANT_DIG)
{
/* Similarly.
If z exponent is very large and x and y exponents are
very small, it doesn't matter if we don't adjust it. */
if (u.ieee.exponent > v.ieee.exponent)
{
if (u.ieee.exponent > FLT128_MANT_DIG)
u.ieee.exponent -= FLT128_MANT_DIG;
}
else if (v.ieee.exponent > FLT128_MANT_DIG)
v.ieee.exponent -= FLT128_MANT_DIG;
w.ieee.exponent -= FLT128_MANT_DIG;
adjust = 1;
}
else if (u.ieee.exponent >= 0x7fff - FLT128_MANT_DIG)
{
u.ieee.exponent -= FLT128_MANT_DIG;
if (v.ieee.exponent)
v.ieee.exponent += FLT128_MANT_DIG;
else
v.value *= 0x1p113Q;
}
else if (v.ieee.exponent >= 0x7fff - FLT128_MANT_DIG)
{
v.ieee.exponent -= FLT128_MANT_DIG;
if (u.ieee.exponent)
u.ieee.exponent += FLT128_MANT_DIG;
else
u.value *= 0x1p113Q;
}
else /* if (u.ieee.exponent + v.ieee.exponent
<= IEEE854_FLOAT128_BIAS + FLT128_MANT_DIG) */
{
if (u.ieee.exponent > v.ieee.exponent)
u.ieee.exponent += 2 * FLT128_MANT_DIG;
else
v.ieee.exponent += 2 * FLT128_MANT_DIG;
if (w.ieee.exponent <= 4 * FLT128_MANT_DIG + 4)
{
if (w.ieee.exponent)
w.ieee.exponent += 2 * FLT128_MANT_DIG;
else
w.value *= 0x1p226Q;
adjust = -1;
}
/* Otherwise x * y should just affect inexact
and nothing else. */
}
x = u.value;
y = v.value;
z = w.value;
}
/* Multiplication m1 + m2 = x * y using Dekker's algorithm. */
#define C ((1LL << (FLT128_MANT_DIG + 1) / 2) + 1)
__float128 x1 = x * C;
__float128 y1 = y * C;
__float128 m1 = x * y;
x1 = (x - x1) + x1;
y1 = (y - y1) + y1;
__float128 x2 = x - x1;
__float128 y2 = y - y1;
__float128 m2 = (((x1 * y1 - m1) + x1 * y2) + x2 * y1) + x2 * y2;
/* Addition a1 + a2 = z + m1 using Knuth's algorithm. */
__float128 a1 = z + m1;
__float128 t1 = a1 - z;
__float128 t2 = a1 - t1;
t1 = m1 - t1;
t2 = z - t2;
__float128 a2 = t1 + t2;
#ifdef USE_FENV_H
fenv_t env;
feholdexcept (&env);
fesetround (FE_TOWARDZERO);
#endif
/* Perform m2 + a2 addition with round to odd. */
u.value = a2 + m2;
if (__builtin_expect (adjust == 0, 1))
{
#ifdef USE_FENV_H
if ((u.ieee.mant_low & 1) == 0 && u.ieee.exponent != 0x7fff)
u.ieee.mant_low |= fetestexcept (FE_INEXACT) != 0;
feupdateenv (&env);
#endif
/* Result is a1 + u.value. */
return a1 + u.value;
}
else if (__builtin_expect (adjust > 0, 1))
{
#ifdef USE_FENV_H
if ((u.ieee.mant_low & 1) == 0 && u.ieee.exponent != 0x7fff)
u.ieee.mant_low |= fetestexcept (FE_INEXACT) != 0;
feupdateenv (&env);
#endif
/* Result is a1 + u.value, scaled up. */
return (a1 + u.value) * 0x1p113Q;
}
else
{
#ifdef USE_FENV_H
if ((u.ieee.mant_low & 1) == 0)
u.ieee.mant_low |= fetestexcept (FE_INEXACT) != 0;
#endif
v.value = a1 + u.value;
/* Ensure the addition is not scheduled after fetestexcept call. */
asm volatile ("" : : "m" (v));
#ifdef USE_FENV_H
int j = fetestexcept (FE_INEXACT) != 0;
feupdateenv (&env);
#else
int j = 0;
#endif
/* Ensure the following computations are performed in default rounding
mode instead of just reusing the round to zero computation. */
asm volatile ("" : "=m" (u) : "m" (u));
/* If a1 + u.value is exact, the only rounding happens during
scaling down. */
if (j == 0)
return v.value * 0x1p-226Q;
/* If result rounded to zero is not subnormal, no double
rounding will occur. */
if (v.ieee.exponent > 226)
return (a1 + u.value) * 0x1p-226Q;
/* If v.value * 0x1p-226Q with round to zero is a subnormal above
or equal to FLT128_MIN / 2, then v.value * 0x1p-226Q shifts mantissa
down just by 1 bit, which means v.ieee.mant_low |= j would
change the round bit, not sticky or guard bit.
v.value * 0x1p-226Q never normalizes by shifting up,
so round bit plus sticky bit should be already enough
for proper rounding. */
if (v.ieee.exponent == 226)
{
/* v.ieee.mant_low & 2 is LSB bit of the result before rounding,
v.ieee.mant_low & 1 is the round bit and j is our sticky
bit. In round-to-nearest 001 rounds down like 00,
011 rounds up, even though 01 rounds down (thus we need
to adjust), 101 rounds down like 10 and 111 rounds up
like 11. */
if ((v.ieee.mant_low & 3) == 1)
{
v.value *= 0x1p-226Q;
if (v.ieee.negative)
return v.value - 0x1p-16494Q /* __FLT128_DENORM_MIN__ */;
else
return v.value + 0x1p-16494Q /* __FLT128_DENORM_MIN__ */;
}
else
return v.value * 0x1p-226Q;
}
v.ieee.mant_low |= j;
return v.value * 0x1p-226Q;
}
}
|
