blob: e0b2c450b9634caadcd24d5a25d3f58d4ad2f805 [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. Rozycki90d53a92015-11-13 00:47:28 +000057 if (ieee754_csr.nan2008)
58 SPMANT(r) |= SP_MBIT(SP_FBITS - 1);
59 else
60 r = ieee754sp_indef();
61
62 return r;
Linus Torvalds1da177e2005-04-16 15:20:36 -070063}
64
Ralf Baechlede2fc342014-04-25 10:54:06 +020065static unsigned ieee754sp_get_rounding(int sn, unsigned xm)
Linus Torvalds1da177e2005-04-16 15:20:36 -070066{
67 /* inexact must round of 3 bits
68 */
69 if (xm & (SP_MBIT(3) - 1)) {
70 switch (ieee754_csr.rm) {
Ralf Baechle56a64732014-04-30 11:21:55 +020071 case FPU_CSR_RZ:
Linus Torvalds1da177e2005-04-16 15:20:36 -070072 break;
Ralf Baechle56a64732014-04-30 11:21:55 +020073 case FPU_CSR_RN:
Linus Torvalds1da177e2005-04-16 15:20:36 -070074 xm += 0x3 + ((xm >> 3) & 1);
75 /* xm += (xm&0x8)?0x4:0x3 */
76 break;
Ralf Baechle56a64732014-04-30 11:21:55 +020077 case FPU_CSR_RU: /* toward +Infinity */
Linus Torvalds1da177e2005-04-16 15:20:36 -070078 if (!sn) /* ?? */
79 xm += 0x8;
80 break;
Ralf Baechle56a64732014-04-30 11:21:55 +020081 case FPU_CSR_RD: /* toward -Infinity */
Ralf Baechle70342282013-01-22 12:59:30 +010082 if (sn) /* ?? */
Linus Torvalds1da177e2005-04-16 15:20:36 -070083 xm += 0x8;
84 break;
85 }
86 }
87 return xm;
88}
89
90
91/* generate a normal/denormal number with over,under handling
92 * sn is sign
93 * xe is an unbiased exponent
94 * xm is 3bit extended precision value.
95 */
Ralf Baechle2209bcb2014-04-16 01:31:11 +020096union ieee754sp ieee754sp_format(int sn, int xe, unsigned xm)
Linus Torvalds1da177e2005-04-16 15:20:36 -070097{
98 assert(xm); /* we don't gen exact zeros (probably should) */
99
Adam Buchbinder92a76f62016-02-25 00:44:58 -0800100 assert((xm >> (SP_FBITS + 1 + 3)) == 0); /* no excess */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101 assert(xm & (SP_HIDDEN_BIT << 3));
102
103 if (xe < SP_EMIN) {
104 /* strip lower bits */
105 int es = SP_EMIN - xe;
106
107 if (ieee754_csr.nod) {
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200108 ieee754_setcx(IEEE754_UNDERFLOW);
109 ieee754_setcx(IEEE754_INEXACT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110
111 switch(ieee754_csr.rm) {
Ralf Baechle56a64732014-04-30 11:21:55 +0200112 case FPU_CSR_RN:
113 case FPU_CSR_RZ:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700114 return ieee754sp_zero(sn);
Ralf Baechle56a64732014-04-30 11:21:55 +0200115 case FPU_CSR_RU: /* toward +Infinity */
Ralf Baechle47fa0c02014-04-16 11:00:12 +0200116 if (sn == 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117 return ieee754sp_min(0);
118 else
119 return ieee754sp_zero(1);
Ralf Baechle56a64732014-04-30 11:21:55 +0200120 case FPU_CSR_RD: /* toward -Infinity */
Ralf Baechle47fa0c02014-04-16 11:00:12 +0200121 if (sn == 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122 return ieee754sp_zero(0);
123 else
124 return ieee754sp_min(1);
125 }
126 }
127
Ralf Baechlede2fc342014-04-25 10:54:06 +0200128 if (xe == SP_EMIN - 1 &&
129 ieee754sp_get_rounding(sn, xm) >> (SP_FBITS + 1 + 3))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700130 {
131 /* Not tiny after rounding */
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200132 ieee754_setcx(IEEE754_INEXACT);
Ralf Baechlede2fc342014-04-25 10:54:06 +0200133 xm = ieee754sp_get_rounding(sn, xm);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700134 xm >>= 1;
135 /* Clear grs bits */
136 xm &= ~(SP_MBIT(3) - 1);
137 xe++;
Ralf Baechle47fa0c02014-04-16 11:00:12 +0200138 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139 /* sticky right shift es bits
140 */
141 SPXSRSXn(es);
142 assert((xm & (SP_HIDDEN_BIT << 3)) == 0);
143 assert(xe == SP_EMIN);
144 }
145 }
146 if (xm & (SP_MBIT(3) - 1)) {
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200147 ieee754_setcx(IEEE754_INEXACT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700148 if ((xm & (SP_HIDDEN_BIT << 3)) == 0) {
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200149 ieee754_setcx(IEEE754_UNDERFLOW);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700150 }
151
152 /* inexact must round of 3 bits
153 */
Ralf Baechlede2fc342014-04-25 10:54:06 +0200154 xm = ieee754sp_get_rounding(sn, xm);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700155 /* adjust exponent for rounding add overflowing
156 */
Ralf Baechlead8fb552014-04-22 15:51:55 +0200157 if (xm >> (SP_FBITS + 1 + 3)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700158 /* add causes mantissa overflow */
159 xm >>= 1;
160 xe++;
161 }
162 }
163 /* strip grs bits */
164 xm >>= 3;
165
Adam Buchbinder92a76f62016-02-25 00:44:58 -0800166 assert((xm >> (SP_FBITS + 1)) == 0); /* no excess */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167 assert(xe >= SP_EMIN);
168
169 if (xe > SP_EMAX) {
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200170 ieee754_setcx(IEEE754_OVERFLOW);
171 ieee754_setcx(IEEE754_INEXACT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172 /* -O can be table indexed by (rm,sn) */
173 switch (ieee754_csr.rm) {
Ralf Baechle56a64732014-04-30 11:21:55 +0200174 case FPU_CSR_RN:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175 return ieee754sp_inf(sn);
Ralf Baechle56a64732014-04-30 11:21:55 +0200176 case FPU_CSR_RZ:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177 return ieee754sp_max(sn);
Ralf Baechle56a64732014-04-30 11:21:55 +0200178 case FPU_CSR_RU: /* toward +Infinity */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179 if (sn == 0)
180 return ieee754sp_inf(0);
181 else
182 return ieee754sp_max(1);
Ralf Baechle56a64732014-04-30 11:21:55 +0200183 case FPU_CSR_RD: /* toward -Infinity */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700184 if (sn == 0)
185 return ieee754sp_max(0);
186 else
187 return ieee754sp_inf(1);
188 }
189 }
190 /* gen norm/denorm/zero */
191
192 if ((xm & SP_HIDDEN_BIT) == 0) {
193 /* we underflow (tiny/zero) */
194 assert(xe == SP_EMIN);
195 if (ieee754_csr.mx & IEEE754_UNDERFLOW)
Ralf Baechle9e8bad12014-04-19 00:36:32 +0200196 ieee754_setcx(IEEE754_UNDERFLOW);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700197 return buildsp(sn, SP_EMIN - 1 + SP_EBIAS, xm);
198 } else {
Adam Buchbinder92a76f62016-02-25 00:44:58 -0800199 assert((xm >> (SP_FBITS + 1)) == 0); /* no excess */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700200 assert(xm & SP_HIDDEN_BIT);
201
202 return buildsp(sn, xe + SP_EBIAS, xm & ~SP_HIDDEN_BIT);
203 }
204}