blob: d348efe914454725bcbcafa3bf54d300dd59a43c [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
Ralf Baechle2209bcb2014-04-16 01:31:11 +020033int ieee754sp_isnan(union ieee754sp x)
Linus Torvalds1da177e2005-04-16 15:20:36 -070034{
35 return ieee754sp_class(x) >= IEEE754_CLASS_SNAN;
36}
37
Ralf Baechlef71baa12014-04-25 00:40:42 +020038static inline int ieee754sp_issnan(union ieee754sp x)
Linus Torvalds1da177e2005-04-16 15:20:36 -070039{
40 assert(ieee754sp_isnan(x));
Ralf Baechlead8fb552014-04-22 15:51:55 +020041 return (SPMANT(x) & SP_MBIT(SP_FBITS-1));
Linus Torvalds1da177e2005-04-16 15:20:36 -070042}
43
44
Ralf Baechle90efba32014-04-25 03:19:57 +020045union ieee754sp __cold ieee754sp_nanxcpt(union ieee754sp r)
Linus Torvalds1da177e2005-04-16 15:20:36 -070046{
Linus Torvalds1da177e2005-04-16 15:20:36 -070047 assert(ieee754sp_isnan(r));
48
49 if (!ieee754sp_issnan(r)) /* QNAN does not cause invalid op !! */
50 return r;
51
Ralf Baechle9e8bad12014-04-19 00:36:32 +020052 if (!ieee754_setandtestcx(IEEE754_INVALID_OPERATION)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -070053 /* not enabled convert to a quiet NaN */
Ralf Baechlead8fb552014-04-22 15:51:55 +020054 SPMANT(r) &= (~SP_MBIT(SP_FBITS-1));
Linus Torvalds1da177e2005-04-16 15:20:36 -070055 if (ieee754sp_isnan(r))
56 return r;
57 else
58 return ieee754sp_indef();
59 }
60
Ralf Baechle90efba32014-04-25 03:19:57 +020061 return r;
Linus Torvalds1da177e2005-04-16 15:20:36 -070062}
63
Ralf Baechlede2fc342014-04-25 10:54:06 +020064static unsigned ieee754sp_get_rounding(int sn, unsigned xm)
Linus Torvalds1da177e2005-04-16 15:20:36 -070065{
66 /* inexact must round of 3 bits
67 */
68 if (xm & (SP_MBIT(3) - 1)) {
69 switch (ieee754_csr.rm) {
Ralf Baechle56a64732014-04-30 11:21:55 +020070 case FPU_CSR_RZ:
Linus Torvalds1da177e2005-04-16 15:20:36 -070071 break;
Ralf Baechle56a64732014-04-30 11:21:55 +020072 case FPU_CSR_RN:
Linus Torvalds1da177e2005-04-16 15:20:36 -070073 xm += 0x3 + ((xm >> 3) & 1);
74 /* xm += (xm&0x8)?0x4:0x3 */
75 break;
Ralf Baechle56a64732014-04-30 11:21:55 +020076 case FPU_CSR_RU: /* toward +Infinity */
Linus Torvalds1da177e2005-04-16 15:20:36 -070077 if (!sn) /* ?? */
78 xm += 0x8;
79 break;
Ralf Baechle56a64732014-04-30 11:21:55 +020080 case FPU_CSR_RD: /* toward -Infinity */
Ralf Baechle70342282013-01-22 12:59:30 +010081 if (sn) /* ?? */
Linus Torvalds1da177e2005-04-16 15:20:36 -070082 xm += 0x8;
83 break;
84 }
85 }
86 return xm;
87}
88
89
90/* generate a normal/denormal number with over,under handling
91 * sn is sign
92 * xe is an unbiased exponent
93 * xm is 3bit extended precision value.
94 */
Ralf Baechle2209bcb2014-04-16 01:31:11 +020095union ieee754sp ieee754sp_format(int sn, int xe, unsigned xm)
Linus Torvalds1da177e2005-04-16 15:20:36 -070096{
97 assert(xm); /* we don't gen exact zeros (probably should) */
98
Ralf Baechlead8fb552014-04-22 15:51:55 +020099 assert((xm >> (SP_FBITS + 1 + 3)) == 0); /* no execess */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700100 assert(xm & (SP_HIDDEN_BIT << 3));
101
102 if (xe < SP_EMIN) {
103 /* strip lower bits */
104 int es = SP_EMIN - xe;
105
106 if (ieee754_csr.nod) {
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200107 ieee754_setcx(IEEE754_UNDERFLOW);
108 ieee754_setcx(IEEE754_INEXACT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700109
110 switch(ieee754_csr.rm) {
Ralf Baechle56a64732014-04-30 11:21:55 +0200111 case FPU_CSR_RN:
112 case FPU_CSR_RZ:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700113 return ieee754sp_zero(sn);
Ralf Baechle56a64732014-04-30 11:21:55 +0200114 case FPU_CSR_RU: /* toward +Infinity */
Ralf Baechle47fa0c02014-04-16 11:00:12 +0200115 if (sn == 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700116 return ieee754sp_min(0);
117 else
118 return ieee754sp_zero(1);
Ralf Baechle56a64732014-04-30 11:21:55 +0200119 case FPU_CSR_RD: /* toward -Infinity */
Ralf Baechle47fa0c02014-04-16 11:00:12 +0200120 if (sn == 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121 return ieee754sp_zero(0);
122 else
123 return ieee754sp_min(1);
124 }
125 }
126
Ralf Baechlede2fc342014-04-25 10:54:06 +0200127 if (xe == SP_EMIN - 1 &&
128 ieee754sp_get_rounding(sn, xm) >> (SP_FBITS + 1 + 3))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700129 {
130 /* Not tiny after rounding */
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200131 ieee754_setcx(IEEE754_INEXACT);
Ralf Baechlede2fc342014-04-25 10:54:06 +0200132 xm = ieee754sp_get_rounding(sn, xm);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133 xm >>= 1;
134 /* Clear grs bits */
135 xm &= ~(SP_MBIT(3) - 1);
136 xe++;
Ralf Baechle47fa0c02014-04-16 11:00:12 +0200137 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700138 /* sticky right shift es bits
139 */
140 SPXSRSXn(es);
141 assert((xm & (SP_HIDDEN_BIT << 3)) == 0);
142 assert(xe == SP_EMIN);
143 }
144 }
145 if (xm & (SP_MBIT(3) - 1)) {
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200146 ieee754_setcx(IEEE754_INEXACT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700147 if ((xm & (SP_HIDDEN_BIT << 3)) == 0) {
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200148 ieee754_setcx(IEEE754_UNDERFLOW);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700149 }
150
151 /* inexact must round of 3 bits
152 */
Ralf Baechlede2fc342014-04-25 10:54:06 +0200153 xm = ieee754sp_get_rounding(sn, xm);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700154 /* adjust exponent for rounding add overflowing
155 */
Ralf Baechlead8fb552014-04-22 15:51:55 +0200156 if (xm >> (SP_FBITS + 1 + 3)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157 /* add causes mantissa overflow */
158 xm >>= 1;
159 xe++;
160 }
161 }
162 /* strip grs bits */
163 xm >>= 3;
164
Ralf Baechlead8fb552014-04-22 15:51:55 +0200165 assert((xm >> (SP_FBITS + 1)) == 0); /* no execess */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700166 assert(xe >= SP_EMIN);
167
168 if (xe > SP_EMAX) {
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200169 ieee754_setcx(IEEE754_OVERFLOW);
170 ieee754_setcx(IEEE754_INEXACT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171 /* -O can be table indexed by (rm,sn) */
172 switch (ieee754_csr.rm) {
Ralf Baechle56a64732014-04-30 11:21:55 +0200173 case FPU_CSR_RN:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174 return ieee754sp_inf(sn);
Ralf Baechle56a64732014-04-30 11:21:55 +0200175 case FPU_CSR_RZ:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700176 return ieee754sp_max(sn);
Ralf Baechle56a64732014-04-30 11:21:55 +0200177 case FPU_CSR_RU: /* toward +Infinity */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178 if (sn == 0)
179 return ieee754sp_inf(0);
180 else
181 return ieee754sp_max(1);
Ralf Baechle56a64732014-04-30 11:21:55 +0200182 case FPU_CSR_RD: /* toward -Infinity */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700183 if (sn == 0)
184 return ieee754sp_max(0);
185 else
186 return ieee754sp_inf(1);
187 }
188 }
189 /* gen norm/denorm/zero */
190
191 if ((xm & SP_HIDDEN_BIT) == 0) {
192 /* we underflow (tiny/zero) */
193 assert(xe == SP_EMIN);
194 if (ieee754_csr.mx & IEEE754_UNDERFLOW)
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200195 ieee754_setcx(IEEE754_UNDERFLOW);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700196 return buildsp(sn, SP_EMIN - 1 + SP_EBIAS, xm);
197 } else {
Ralf Baechlead8fb552014-04-22 15:51:55 +0200198 assert((xm >> (SP_FBITS + 1)) == 0); /* no execess */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700199 assert(xm & SP_HIDDEN_BIT);
200
201 return buildsp(sn, xe + SP_EBIAS, xm & ~SP_HIDDEN_BIT);
202 }
203}