Linux 2.6.25-rc4
[linux-2.6/next.git] / arch / mips / math-emu / sp_flong.c
blob26d6919a269af143ad590d58233d5a8bd8b80310
1 /* IEEE754 floating point arithmetic
2 * single precision
3 */
4 /*
5 * MIPS floating point support
6 * Copyright (C) 1994-2000 Algorithmics Ltd.
7 * http://www.algor.co.uk
9 * ########################################################################
11 * This program is free software; you can distribute it and/or modify it
12 * under the terms of the GNU General Public License (Version 2) as
13 * published by the Free Software Foundation.
15 * This program is distributed in the hope it will be useful, but WITHOUT
16 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 * for more details.
20 * You should have received a copy of the GNU General Public License along
21 * with this program; if not, write to the Free Software Foundation, Inc.,
22 * 59 Temple Place - Suite 330, Boston MA 02111-1307, USA.
24 * ########################################################################
28 #include "ieee754sp.h"
30 ieee754sp ieee754sp_flong(s64 x)
32 u64 xm; /* <--- need 64-bit mantissa temp */
33 int xe;
34 int xs;
36 CLEARCX;
38 if (x == 0)
39 return ieee754sp_zero(0);
40 if (x == 1 || x == -1)
41 return ieee754sp_one(x < 0);
42 if (x == 10 || x == -10)
43 return ieee754sp_ten(x < 0);
45 xs = (x < 0);
46 if (xs) {
47 if (x == (1ULL << 63))
48 xm = (1ULL << 63); /* max neg can't be safely negated */
49 else
50 xm = -x;
51 } else {
52 xm = x;
54 xe = SP_MBITS + 3;
56 if (xm >> (SP_MBITS + 1 + 3)) {
57 /* shunt out overflow bits
59 while (xm >> (SP_MBITS + 1 + 3)) {
60 SPXSRSX1();
62 } else {
63 /* normalize in grs extended single precision */
64 while ((xm >> (SP_MBITS + 3)) == 0) {
65 xm <<= 1;
66 xe--;
69 SPNORMRET1(xs, xe, xm, "sp_flong", x);
73 ieee754sp ieee754sp_fulong(u64 u)
75 if ((s64) u < 0)
76 return ieee754sp_add(ieee754sp_1e63(),
77 ieee754sp_flong(u & ~(1ULL << 63)));
78 return ieee754sp_flong(u);