1 /* Floating point library in optimized assembly for 8051
2 * Copyright (c) 2004, Paul Stoffregen, paul@pjrc.com
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Library General Public License
6 * as published by the Free Software Foundation; either version 2
7 * of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
20 #define SDCC_FLOAT_LIB
24 #ifdef FLOAT_ASM_MCS51
26 // float __fsmul (float a, float b) reentrant
27 static void dummy(void) _naked
32 // extract the two inputs, placing them into:
33 // sign exponent mantissa
34 // ---- -------- --------
35 // a: sign_a exp_a r4/r3/r2
36 // b: sign_b exp_b r7/r6/r5
40 // first check if either input is zero
49 // compute final sign bit
54 // check if either input is infinity
66 // if carry then no underflow
81 // now we need to multipy r4/r3/r2 * r7/r6/r5
82 // ------------------------------------------
84 // r3 * r5 + r2 * r6 << 8
85 // r4 * r5 + r3 * r6 + r2 * r7 << 16
86 // r4 * r6 + r3 * r7 << 24
89 // This adds quite a bit of code, but it is a LOT faster
90 // than three calls to __mululong...
92 // output goes into r4/r3/r2/r1/r0/xx
97 // discard lowest 8 bits
115 // discard lowest 8 bits
194 // range 40000000-FFFFFE00
200 ljmp fs_round_and_return
208 ** libgcc support for software floating point.
209 ** Copyright (C) 1991 by Pipeline Associates, Inc. All rights reserved.
210 ** Permission is granted to do *anything* you want with this file,
211 ** commercial or otherwise, provided this message remains intact. So there!
212 ** I would appreciate receiving any updates/patches/changes that anyone
213 ** makes, and am willing to be the repository for said changes (am I
214 ** making a big mistake?).
217 ** Pipeline Associates, Inc.
218 ** pipeline!phw@motown.com or
219 ** sun!pipeline!phw or
220 ** uunet!motown!pipeline!phw
223 /* (c)2000/2001: hacked a little by johan.knol@iduna.nl for sdcc */
232 /* multiply two floats */
233 float __fsmul (float a1, float a2) {
234 volatile union float_long fl1, fl2;
235 volatile unsigned long result;
242 if (!fl1.l || !fl2.l)
245 /* compute sign and exponent */
246 sign = SIGN (fl1.l) ^ SIGN (fl2.l);
247 exp = EXP (fl1.l) - EXCESS;
250 fl1.l = MANT (fl1.l);
251 fl2.l = MANT (fl2.l);
253 /* the multiply is done as one 16x16 multiply and two 16x8 multiples */
254 result = (fl1.l >> 8) * (fl2.l >> 8);
255 result += ((fl1.l & (unsigned long) 0xFF) * (fl2.l >> 8)) >> 8;
256 result += ((fl2.l & (unsigned long) 0xFF) * (fl1.l >> 8)) >> 8;
258 if (result & SIGNBIT)
274 /* pack up and go home */
276 fl1.l = (sign ? SIGNBIT : 0) | 0x7F800000;
280 fl1.l = PACK (sign ? SIGNBIT : 0 , exp, result);