1 /* IEEE754 floating point arithmetic
5 * MIPS floating point support
6 * Copyright (C) 1994-2000 Algorithmics Ltd.
8 * This program is free software; you can distribute it and/or modify it
9 * under the terms of the GNU General Public License (Version 2) as
10 * published by the Free Software Foundation.
12 * This program is distributed in the hope it will be useful, but WITHOUT
13 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 * You should have received a copy of the GNU General Public License along
18 * with this program; if not, write to the Free Software Foundation, Inc.,
19 * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
22 #include <linux/compiler.h>
24 #include "ieee754sp.h"
26 int ieee754sp_class(union ieee754sp x
)
33 static inline int ieee754sp_isnan(union ieee754sp x
)
35 return ieee754_class_nan(ieee754sp_class(x
));
38 static inline int ieee754sp_issnan(union ieee754sp x
)
42 assert(ieee754sp_isnan(x
));
43 qbit
= (SPMANT(x
) & SP_MBIT(SP_FBITS
- 1)) == SP_MBIT(SP_FBITS
- 1);
44 return ieee754_csr
.nan2008
^ qbit
;
49 * Raise the Invalid Operation IEEE 754 exception
50 * and convert the signaling NaN supplied to a quiet NaN.
52 union ieee754sp __cold
ieee754sp_nanxcpt(union ieee754sp r
)
54 assert(ieee754sp_issnan(r
));
56 ieee754_setcx(IEEE754_INVALID_OPERATION
);
57 if (ieee754_csr
.nan2008
)
58 SPMANT(r
) |= SP_MBIT(SP_FBITS
- 1);
60 r
= ieee754sp_indef();
65 static unsigned ieee754sp_get_rounding(int sn
, unsigned xm
)
67 /* inexact must round of 3 bits
69 if (xm
& (SP_MBIT(3) - 1)) {
70 switch (ieee754_csr
.rm
) {
74 xm
+= 0x3 + ((xm
>> 3) & 1);
75 /* xm += (xm&0x8)?0x4:0x3 */
77 case FPU_CSR_RU
: /* toward +Infinity */
81 case FPU_CSR_RD
: /* toward -Infinity */
91 /* generate a normal/denormal number with over,under handling
93 * xe is an unbiased exponent
94 * xm is 3bit extended precision value.
96 union ieee754sp
ieee754sp_format(int sn
, int xe
, unsigned xm
)
98 assert(xm
); /* we don't gen exact zeros (probably should) */
100 assert((xm
>> (SP_FBITS
+ 1 + 3)) == 0); /* no excess */
101 assert(xm
& (SP_HIDDEN_BIT
<< 3));
104 /* strip lower bits */
105 int es
= SP_EMIN
- xe
;
107 if (ieee754_csr
.nod
) {
108 ieee754_setcx(IEEE754_UNDERFLOW
);
109 ieee754_setcx(IEEE754_INEXACT
);
111 switch(ieee754_csr
.rm
) {
114 return ieee754sp_zero(sn
);
115 case FPU_CSR_RU
: /* toward +Infinity */
117 return ieee754sp_min(0);
119 return ieee754sp_zero(1);
120 case FPU_CSR_RD
: /* toward -Infinity */
122 return ieee754sp_zero(0);
124 return ieee754sp_min(1);
128 if (xe
== SP_EMIN
- 1 &&
129 ieee754sp_get_rounding(sn
, xm
) >> (SP_FBITS
+ 1 + 3))
131 /* Not tiny after rounding */
132 ieee754_setcx(IEEE754_INEXACT
);
133 xm
= ieee754sp_get_rounding(sn
, xm
);
136 xm
&= ~(SP_MBIT(3) - 1);
139 /* sticky right shift es bits
142 assert((xm
& (SP_HIDDEN_BIT
<< 3)) == 0);
143 assert(xe
== SP_EMIN
);
146 if (xm
& (SP_MBIT(3) - 1)) {
147 ieee754_setcx(IEEE754_INEXACT
);
148 if ((xm
& (SP_HIDDEN_BIT
<< 3)) == 0) {
149 ieee754_setcx(IEEE754_UNDERFLOW
);
152 /* inexact must round of 3 bits
154 xm
= ieee754sp_get_rounding(sn
, xm
);
155 /* adjust exponent for rounding add overflowing
157 if (xm
>> (SP_FBITS
+ 1 + 3)) {
158 /* add causes mantissa overflow */
166 assert((xm
>> (SP_FBITS
+ 1)) == 0); /* no excess */
167 assert(xe
>= SP_EMIN
);
170 ieee754_setcx(IEEE754_OVERFLOW
);
171 ieee754_setcx(IEEE754_INEXACT
);
172 /* -O can be table indexed by (rm,sn) */
173 switch (ieee754_csr
.rm
) {
175 return ieee754sp_inf(sn
);
177 return ieee754sp_max(sn
);
178 case FPU_CSR_RU
: /* toward +Infinity */
180 return ieee754sp_inf(0);
182 return ieee754sp_max(1);
183 case FPU_CSR_RD
: /* toward -Infinity */
185 return ieee754sp_max(0);
187 return ieee754sp_inf(1);
190 /* gen norm/denorm/zero */
192 if ((xm
& SP_HIDDEN_BIT
) == 0) {
193 /* we underflow (tiny/zero) */
194 assert(xe
== SP_EMIN
);
195 if (ieee754_csr
.mx
& IEEE754_UNDERFLOW
)
196 ieee754_setcx(IEEE754_UNDERFLOW
);
197 return buildsp(sn
, SP_EMIN
- 1 + SP_EBIAS
, xm
);
199 assert((xm
>> (SP_FBITS
+ 1)) == 0); /* no excess */
200 assert(xm
& SP_HIDDEN_BIT
);
202 return buildsp(sn
, xe
+ SP_EBIAS
, xm
& ~SP_HIDDEN_BIT
);