blob: d07bec3dd1c00620f3eb88efa7df5c802751182c [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 *
8 * ########################################################################
9 *
10 * This program is free software; you can distribute it and/or modify it
11 * under the terms of the GNU General Public License (Version 2) as
12 * published by the Free Software Foundation.
13 *
14 * This program is distributed in the hope it will be useful, but WITHOUT
15 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 * for more details.
18 *
19 * You should have received a copy of the GNU General Public License along
20 * with this program; if not, write to the Free Software Foundation, Inc.,
21 * 59 Temple Place - Suite 330, Boston MA 02111-1307, USA.
22 *
23 * ########################################################################
24 */
25
Ralf Baechlecae55062014-04-16 00:47:59 +020026#include <linux/compiler.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070027
28#include "ieee754sp.h"
29
Ralf Baechle2209bcb2014-04-16 01:31:11 +020030int ieee754sp_class(union ieee754sp x)
Linus Torvalds1da177e2005-04-16 15:20:36 -070031{
32 COMPXSP;
33 EXPLODEXSP;
34 return xc;
35}
36
Ralf Baechle2209bcb2014-04-16 01:31:11 +020037int ieee754sp_isnan(union ieee754sp x)
Linus Torvalds1da177e2005-04-16 15:20:36 -070038{
39 return ieee754sp_class(x) >= IEEE754_CLASS_SNAN;
40}
41
Ralf Baechlef71baa12014-04-25 00:40:42 +020042static inline int ieee754sp_issnan(union ieee754sp x)
Linus Torvalds1da177e2005-04-16 15:20:36 -070043{
44 assert(ieee754sp_isnan(x));
Ralf Baechlead8fb552014-04-22 15:51:55 +020045 return (SPMANT(x) & SP_MBIT(SP_FBITS-1));
Linus Torvalds1da177e2005-04-16 15:20:36 -070046}
47
48
Ralf Baechle90efba32014-04-25 03:19:57 +020049union ieee754sp __cold ieee754sp_nanxcpt(union ieee754sp r)
Linus Torvalds1da177e2005-04-16 15:20:36 -070050{
Linus Torvalds1da177e2005-04-16 15:20:36 -070051 assert(ieee754sp_isnan(r));
52
53 if (!ieee754sp_issnan(r)) /* QNAN does not cause invalid op !! */
54 return r;
55
Ralf Baechle9e8bad12014-04-19 00:36:32 +020056 if (!ieee754_setandtestcx(IEEE754_INVALID_OPERATION)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -070057 /* not enabled convert to a quiet NaN */
Ralf Baechlead8fb552014-04-22 15:51:55 +020058 SPMANT(r) &= (~SP_MBIT(SP_FBITS-1));
Linus Torvalds1da177e2005-04-16 15:20:36 -070059 if (ieee754sp_isnan(r))
60 return r;
61 else
62 return ieee754sp_indef();
63 }
64
Ralf Baechle90efba32014-04-25 03:19:57 +020065 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) {
74 case IEEE754_RZ:
75 break;
76 case IEEE754_RN:
77 xm += 0x3 + ((xm >> 3) & 1);
78 /* xm += (xm&0x8)?0x4:0x3 */
79 break;
80 case IEEE754_RU: /* toward +Infinity */
81 if (!sn) /* ?? */
82 xm += 0x8;
83 break;
84 case IEEE754_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
Ralf Baechlead8fb552014-04-22 15:51:55 +0200103 assert((xm >> (SP_FBITS + 1 + 3)) == 0); /* no execess */
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) {
115 case IEEE754_RN:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700116 case IEEE754_RZ:
117 return ieee754sp_zero(sn);
118 case IEEE754_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);
123 case IEEE754_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 Baechlead8fb552014-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
Ralf Baechlead8fb552014-04-22 15:51:55 +0200169 assert((xm >> (SP_FBITS + 1)) == 0); /* no execess */
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) {
177 case IEEE754_RN:
178 return ieee754sp_inf(sn);
179 case IEEE754_RZ:
180 return ieee754sp_max(sn);
181 case IEEE754_RU: /* toward +Infinity */
182 if (sn == 0)
183 return ieee754sp_inf(0);
184 else
185 return ieee754sp_max(1);
186 case IEEE754_RD: /* toward -Infinity */
187 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 {
Ralf Baechlead8fb552014-04-22 15:51:55 +0200202 assert((xm >> (SP_FBITS + 1)) == 0); /* no execess */
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}