blob: 860e9162097f4f285a86380e75088571bf07a9df [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/* IEEE754 floating point arithmetic
2 * single precision
3 */
4/*
5 * MIPS floating point support
6 * Copyright (C) 1994-2000 Algorithmics Ltd.
Linus Torvalds1da177e2005-04-16 15:20:36 -07007 *
Linus Torvalds1da177e2005-04-16 15:20:36 -07008 * 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.
11 *
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
15 * for more details.
16 *
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.,
Ralf Baechle3f7cac42014-04-26 01:49:14 +020019 * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
Linus Torvalds1da177e2005-04-16 15:20:36 -070020 */
21
Ralf Baechlecae55062014-04-16 00:47:59 +020022#include <linux/compiler.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070023
24#include "ieee754sp.h"
25
Ralf Baechle2209bcb2014-04-16 01:31:11 +020026int ieee754sp_class(union ieee754sp x)
Linus Torvalds1da177e2005-04-16 15:20:36 -070027{
28 COMPXSP;
29 EXPLODEXSP;
30 return xc;
31}
32
Maciej W. Rozyckie06b5302015-04-03 23:25:57 +010033static inline int ieee754sp_isnan(union ieee754sp x)
Linus Torvalds1da177e2005-04-16 15:20:36 -070034{
Maciej W. Rozyckic9a10842015-04-03 23:25:38 +010035 return ieee754_class_nan(ieee754sp_class(x));
Linus Torvalds1da177e2005-04-16 15:20:36 -070036}
37
Ralf Baechlef71baa12014-04-25 00:40:42 +020038static inline int ieee754sp_issnan(union ieee754sp x)
Linus Torvalds1da177e2005-04-16 15:20:36 -070039{
Maciej W. Rozycki90d53a92015-11-13 00:47:28 +000040 int qbit;
41
Linus Torvalds1da177e2005-04-16 15:20:36 -070042 assert(ieee754sp_isnan(x));
Maciej W. Rozycki90d53a92015-11-13 00:47:28 +000043 qbit = (SPMANT(x) & SP_MBIT(SP_FBITS - 1)) == SP_MBIT(SP_FBITS - 1);
44 return ieee754_csr.nan2008 ^ qbit;
Linus Torvalds1da177e2005-04-16 15:20:36 -070045}
46
47
Maciej W. Rozyckid5afa7e2015-04-03 23:25:34 +010048/*
49 * Raise the Invalid Operation IEEE 754 exception
50 * and convert the signaling NaN supplied to a quiet NaN.
51 */
Ralf Baechle90efba32014-04-25 03:19:57 +020052union ieee754sp __cold ieee754sp_nanxcpt(union ieee754sp r)
Linus Torvalds1da177e2005-04-16 15:20:36 -070053{
Maciej W. Rozyckid5afa7e2015-04-03 23:25:34 +010054 assert(ieee754sp_issnan(r));
Linus Torvalds1da177e2005-04-16 15:20:36 -070055
Maciej W. Rozyckid5afa7e2015-04-03 23:25:34 +010056 ieee754_setcx(IEEE754_INVALID_OPERATION);
Maciej W. Rozyckiacd9e202015-11-13 00:48:48 +000057 if (ieee754_csr.nan2008) {
Maciej W. Rozycki90d53a92015-11-13 00:47:28 +000058 SPMANT(r) |= SP_MBIT(SP_FBITS - 1);
Maciej W. Rozyckiacd9e202015-11-13 00:48:48 +000059 } else {
60 SPMANT(r) &= ~SP_MBIT(SP_FBITS - 1);
61 if (!ieee754sp_isnan(r))
62 SPMANT(r) |= SP_MBIT(SP_FBITS - 2);
63 }
Maciej W. Rozycki90d53a92015-11-13 00:47:28 +000064
65 return r;
Linus Torvalds1da177e2005-04-16 15:20:36 -070066}
67
Ralf Baechlede2fc342014-04-25 10:54:06 +020068static unsigned ieee754sp_get_rounding(int sn, unsigned xm)
Linus Torvalds1da177e2005-04-16 15:20:36 -070069{
70 /* inexact must round of 3 bits
71 */
72 if (xm & (SP_MBIT(3) - 1)) {
73 switch (ieee754_csr.rm) {
Ralf Baechle56a64732014-04-30 11:21:55 +020074 case FPU_CSR_RZ:
Linus Torvalds1da177e2005-04-16 15:20:36 -070075 break;
Ralf Baechle56a64732014-04-30 11:21:55 +020076 case FPU_CSR_RN:
Linus Torvalds1da177e2005-04-16 15:20:36 -070077 xm += 0x3 + ((xm >> 3) & 1);
78 /* xm += (xm&0x8)?0x4:0x3 */
79 break;
Ralf Baechle56a64732014-04-30 11:21:55 +020080 case FPU_CSR_RU: /* toward +Infinity */
Linus Torvalds1da177e2005-04-16 15:20:36 -070081 if (!sn) /* ?? */
82 xm += 0x8;
83 break;
Ralf Baechle56a64732014-04-30 11:21:55 +020084 case FPU_CSR_RD: /* toward -Infinity */
Ralf Baechle70342282013-01-22 12:59:30 +010085 if (sn) /* ?? */
Linus Torvalds1da177e2005-04-16 15:20:36 -070086 xm += 0x8;
87 break;
88 }
89 }
90 return xm;
91}
92
93
94/* generate a normal/denormal number with over,under handling
95 * sn is sign
96 * xe is an unbiased exponent
97 * xm is 3bit extended precision value.
98 */
Ralf Baechle2209bcb2014-04-16 01:31:11 +020099union ieee754sp ieee754sp_format(int sn, int xe, unsigned xm)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700100{
101 assert(xm); /* we don't gen exact zeros (probably should) */
102
Adam Buchbinder92a76f62016-02-25 00:44:58 -0800103 assert((xm >> (SP_FBITS + 1 + 3)) == 0); /* no excess */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104 assert(xm & (SP_HIDDEN_BIT << 3));
105
106 if (xe < SP_EMIN) {
107 /* strip lower bits */
108 int es = SP_EMIN - xe;
109
110 if (ieee754_csr.nod) {
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200111 ieee754_setcx(IEEE754_UNDERFLOW);
112 ieee754_setcx(IEEE754_INEXACT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113
114 switch(ieee754_csr.rm) {
Ralf Baechle56a64732014-04-30 11:21:55 +0200115 case FPU_CSR_RN:
116 case FPU_CSR_RZ:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117 return ieee754sp_zero(sn);
Ralf Baechle56a64732014-04-30 11:21:55 +0200118 case FPU_CSR_RU: /* toward +Infinity */
Ralf Baechle47fa0c02014-04-16 11:00:12 +0200119 if (sn == 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700120 return ieee754sp_min(0);
121 else
122 return ieee754sp_zero(1);
Ralf Baechle56a64732014-04-30 11:21:55 +0200123 case FPU_CSR_RD: /* toward -Infinity */
Ralf Baechle47fa0c02014-04-16 11:00:12 +0200124 if (sn == 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125 return ieee754sp_zero(0);
126 else
127 return ieee754sp_min(1);
128 }
129 }
130
Ralf Baechlede2fc342014-04-25 10:54:06 +0200131 if (xe == SP_EMIN - 1 &&
132 ieee754sp_get_rounding(sn, xm) >> (SP_FBITS + 1 + 3))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133 {
134 /* Not tiny after rounding */
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200135 ieee754_setcx(IEEE754_INEXACT);
Ralf Baechlede2fc342014-04-25 10:54:06 +0200136 xm = ieee754sp_get_rounding(sn, xm);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700137 xm >>= 1;
138 /* Clear grs bits */
139 xm &= ~(SP_MBIT(3) - 1);
140 xe++;
Ralf Baechle47fa0c02014-04-16 11:00:12 +0200141 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142 /* sticky right shift es bits
143 */
144 SPXSRSXn(es);
145 assert((xm & (SP_HIDDEN_BIT << 3)) == 0);
146 assert(xe == SP_EMIN);
147 }
148 }
149 if (xm & (SP_MBIT(3) - 1)) {
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200150 ieee754_setcx(IEEE754_INEXACT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151 if ((xm & (SP_HIDDEN_BIT << 3)) == 0) {
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200152 ieee754_setcx(IEEE754_UNDERFLOW);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153 }
154
155 /* inexact must round of 3 bits
156 */
Ralf Baechlede2fc342014-04-25 10:54:06 +0200157 xm = ieee754sp_get_rounding(sn, xm);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700158 /* adjust exponent for rounding add overflowing
159 */
Ralf Baechlead8fb5532014-04-22 15:51:55 +0200160 if (xm >> (SP_FBITS + 1 + 3)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700161 /* add causes mantissa overflow */
162 xm >>= 1;
163 xe++;
164 }
165 }
166 /* strip grs bits */
167 xm >>= 3;
168
Adam Buchbinder92a76f62016-02-25 00:44:58 -0800169 assert((xm >> (SP_FBITS + 1)) == 0); /* no excess */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700170 assert(xe >= SP_EMIN);
171
172 if (xe > SP_EMAX) {
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200173 ieee754_setcx(IEEE754_OVERFLOW);
174 ieee754_setcx(IEEE754_INEXACT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175 /* -O can be table indexed by (rm,sn) */
176 switch (ieee754_csr.rm) {
Ralf Baechle56a64732014-04-30 11:21:55 +0200177 case FPU_CSR_RN:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178 return ieee754sp_inf(sn);
Ralf Baechle56a64732014-04-30 11:21:55 +0200179 case FPU_CSR_RZ:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700180 return ieee754sp_max(sn);
Ralf Baechle56a64732014-04-30 11:21:55 +0200181 case FPU_CSR_RU: /* toward +Infinity */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182 if (sn == 0)
183 return ieee754sp_inf(0);
184 else
185 return ieee754sp_max(1);
Ralf Baechle56a64732014-04-30 11:21:55 +0200186 case FPU_CSR_RD: /* toward -Infinity */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700187 if (sn == 0)
188 return ieee754sp_max(0);
189 else
190 return ieee754sp_inf(1);
191 }
192 }
193 /* gen norm/denorm/zero */
194
195 if ((xm & SP_HIDDEN_BIT) == 0) {
196 /* we underflow (tiny/zero) */
197 assert(xe == SP_EMIN);
198 if (ieee754_csr.mx & IEEE754_UNDERFLOW)
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200199 ieee754_setcx(IEEE754_UNDERFLOW);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700200 return buildsp(sn, SP_EMIN - 1 + SP_EBIAS, xm);
201 } else {
Adam Buchbinder92a76f62016-02-25 00:44:58 -0800202 assert((xm >> (SP_FBITS + 1)) == 0); /* no excess */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700203 assert(xm & SP_HIDDEN_BIT);
204
205 return buildsp(sn, xe + SP_EBIAS, xm & ~SP_HIDDEN_BIT);
206 }
207}