replaced by _mulint.c and _mullong.c

git-svn-id: https://sdcc.svn.sourceforge.net/svnroot/sdcc/trunk/sdcc@1350 4a8a32a2-be11-0410-ad9d-d568d2c75423

diff --git a/device/lib/_mulsint.c b/device/lib/_mulsint.c
deleted file mode 100644 (file)
index f14ab45..0000000
--- a/device/lib/_mulsint.c
+++ /dev/null
@@ -1,37 +0,0 @@
-/*-------------------------------------------------------------------------
-
-  _mulsint.c :- routine for signed int (16 bit) multiplication               
-
-             Written By -  Sandeep Dutta . sandeep.dutta@usa.net (1999)
-
-   This library is free software; you can redistribute it and/or modify it
-   under the terms of the GNU Library General Public License as published by the
-   Free Software Foundation; either version 2, or (at your option) any
-   later version.
-   
-   This library is distributed in the hope that it will be useful,
-   but WITHOUT ANY WARRANTY; without even the implied warranty of
-   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-   GNU Library General Public License for more details.
-   
-   You should have received a copy of the GNU Library General Public License
-   along with this program; if not, write to the Free Software
-   Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
-   
-   In other words, you are welcome to use, share and improve this program.
-   You are forbidden to forbid anyone else to use, share and improve
-   what you give them.   Help stamp out software-hoarding!  
--------------------------------------------------------------------------*/
-
-int _mulsint (int a, int b)
-{
-       register int r;
-       
-       r = _muluint ( ((a < 0) ? -a : a),
-                     ((b < 0) ? -b : b) );
-
-       if ( (a < 0) ^ (b < 0))
-           return -r;
-       else
-           return r;
-}              

diff --git a/device/lib/_mulslong.c b/device/lib/_mulslong.c
deleted file mode 100644 (file)
index af24958..0000000
--- a/device/lib/_mulslong.c
+++ /dev/null
@@ -1,42 +0,0 @@
-/*-------------------------------------------------------------------------
-   _mulslong.c - routine for multiplication of 32 bit signed long
-
-             Written By -  Sandeep Dutta . sandeep.dutta@usa.net (1999)
-
-   This library is free software; you can redistribute it and/or modify it
-   under the terms of the GNU Library General Public License as published by the
-   Free Software Foundation; either version 2, or (at your option) any
-   later version.
-   
-   This library is distributed in the hope that it will be useful,
-   but WITHOUT ANY WARRANTY; without even the implied warranty of
-   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-   GNU Library General Public License for more details.
-   
-   You should have received a copy of the GNU Library General Public License
-   along with this program; if not, write to the Free Software
-   Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
-   
-   In other words, you are welcome to use, share and improve this program.
-   You are forbidden to forbid anyone else to use, share and improve
-   what you give them.   Help stamp out software-hoarding!  
--------------------------------------------------------------------------*/
-
-#include <sdcc-lib.h>
-
-#if _SDCC_MANGLES_SUPPORT_FUNS
-unsigned long _mululong (unsigned long a, unsigned long b);
-#endif
-
-long _mulslong (long a, long b)
-{
-       long r;
-       
-       r = _mululong ( ((a < 0) ? -a : a),
-                     ((b < 0) ? -b : b) );
-
-       if ( (a < 0) ^ (b < 0))
-           return -r;
-       else
-           return r;
-}              

diff --git a/device/lib/_muluint.c b/device/lib/_muluint.c
deleted file mode 100644 (file)
index d5b923b..0000000
--- a/device/lib/_muluint.c
+++ /dev/null
@@ -1,104 +0,0 @@
-/*-------------------------------------------------------------------------
-
-  _muluint.c :- routine for unsigned int (16 bit) multiplication               
-
-             Written By -  Sandeep Dutta . sandeep.dutta@usa.net (1999)
-
-   This library is free software; you can redistribute it and/or modify it
-   under the terms of the GNU Library General Public License as published by the
-   Free Software Foundation; either version 2, or (at your option) any
-   later version.
-   
-   This library is distributed in the hope that it will be useful,
-   but WITHOUT ANY WARRANTY; without even the implied warranty of
-   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-   GNU Library General Public License for more details.
-   
-   You should have received a copy of the GNU Library General Public License
-   along with this program; if not, write to the Free Software
-   Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
-   
-   In other words, you are welcome to use, share and improve this program.
-   You are forbidden to forbid anyone else to use, share and improve
-   what you give them.   Help stamp out software-hoarding!  
--------------------------------------------------------------------------*/
-
-#if defined(__ds390) || defined (__mcs51)
-
-// we can do this faster and more efficient in assembler
-
-unsigned int _muluint (unsigned int a, unsigned int b) 
-{
-  a*b; // hush the compiler
-
-  /* muluint=
-      (int)(lsb_a*lsb_b) +
-      (char)(msb_a*lsb_b)<<8 +
-      (char)(lsb_a*msb_b)<<8
-  */
-
-  _asm 
-    mov r2,dph ; msb_a
-    mov r3,dpl ; lsb_a
-
-    mov b,r3 ; lsb_a
-#if defined(SDCC_ds390) || defined(SDCC_MODEL_LARGE)
-    mov dptr,#__muluint_PARM_2
-    movx a,@dptr ; lsb_b
-#else // must be SDCC_MODEL_SMALL
-    mov a,__muluint_PARM_2 ; lsb_b
-#endif
-    mul ab ; lsb_a*lsb_b
-    mov r0,a
-    mov r1,b
-
-    mov b,r2 ; msb_a
-#if defined(SDCC_ds390) || defined(SDCC_MODEL_LARGE)
-    movx a,@dptr ; lsb_b
-#else // must be SDCC_MODEL_SMALL
-    mov a,__muluint_PARM_2 ; lsb_b
-#endif
-    mul ab ; msb_a*lsb_b
-    add a,r1
-    mov r1,a
-
-    mov b,r3 ; lsb_a
-#if defined(SDCC_ds390) || defined(SDCC_MODEL_LARGE)
-    inc dptr
-    movx a,@dptr ; msb_b
-#else // must be SDCC_MODEL_SMALL
-    mov a,1+__muluint_PARM_2 ; msb_b
-#endif
-    mul ab ; lsb_a*msb_b
-    add a,r1
-
-    mov dph,a
-    mov dpl,r0
-    ret
-  _endasm;
-}
-
-#else
-
-// we have to do it the hard way
-
-union uu {
-  struct { unsigned char lo,hi ;} s;
-  unsigned int t;
-};
-
-unsigned int _muluint (unsigned int a, unsigned int b) 
-{
-  union uu *x;
-  union uu *y; 
-  union uu t;
-  x = (union uu *)&a;
-  y = (union uu *)&b;
-
-  t.t = x->s.lo * y->s.lo;
-  t.s.hi += (x->s.lo * y->s.hi) + (x->s.hi * y->s.lo);
-  
-  return t.t;
-} 
-
-#endif

diff --git a/device/lib/_mululong.c b/device/lib/_mululong.c
deleted file mode 100644 (file)
index c7c249d..0000000
--- a/device/lib/_mululong.c
+++ /dev/null
@@ -1,90 +0,0 @@
-/*-------------------------------------------------------------------------
-   _mululong.c - routine for multiplication of 32 bit unsigned long
-
-             Written By -  Jean Louis VERN jlvern@writeme.com (1999)
-
-   This program is free software; you can redistribute it and/or modify it
-   under the terms of the GNU General Public License as published by the
-   Free Software Foundation; either version 2, or (at your option) any
-   later version.
-
-   This program is distributed in the hope that it will be useful,
-   but WITHOUT ANY WARRANTY; without even the implied warranty of
-   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-   GNU General Public License for more details.
-
-   You should have received a copy of the GNU General Public License
-   along with this program; if not, write to the Free Software
-   Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
-
-   In other words, you are welcome to use, share and improve this program.
-   You are forbidden to forbid anyone else to use, share and improve
-   what you give them.   Help stamp out software-hoarding!
--------------------------------------------------------------------------*/
-
-struct some_struct {
-       int a ;
-       char b;
-       long c ;};
-union bil {
-        struct {unsigned char b0,b1,b2,b3 ;} b;
-        struct {unsigned int lo,hi ;} i;
-        unsigned long l;
-        struct { unsigned char b0; unsigned int i12; unsigned char b3;} bi;
-} ;
-#if defined(SDCC_MODEL_LARGE) || defined (SDCC_ds390)
-#define bcast(x) ((union bil xdata  *)&(x))
-#elif defined(__z80) || defined(__gbz80)
-#define bcast(x) ((union bil *)&(x))
-#else
-#define bcast(x) ((union bil near *)&(x))
-#endif
-
-/*
-                     3   2   1   0
-       X             3   2   1   0
-       ----------------------------
-                   0.3 0.2 0.1 0.0 
-               1.3 1.2 1.1 1.0 
-           2.3 2.2 2.1 2.0 
-       3.3 3.2 3.1 3.0 
-       ----------------------------
-                  |3.3|1.3|0.2|0.0|   A
-                    |2.3|0.3|0.1|     B
-                    |3.2|1.2|1.0|     C
-                      |2.2|1.1|       D
-                      |3.1|2.0|       E
-                        |2.1|         F
-                        |3.0|         G
-                          |-------> only this side 32 x 32 -> 32
-*/
-
-unsigned long _mululong (unsigned long a, unsigned long b) 
-{
-        union bil t;
-
-        t.i.hi = bcast(a)->b.b0 * bcast(b)->b.b2;       // A
-        t.i.lo = bcast(a)->b.b0 * bcast(b)->b.b0;       // A
-        t.b.b3 += bcast(a)->b.b3 *
-                                  bcast(b)->b.b0;       // G
-        t.b.b3 += bcast(a)->b.b2 *
-                                  bcast(b)->b.b1;       // F
-        t.i.hi += bcast(a)->b.b2 * bcast(b)->b.b0;      // E <- b lost in .lst
-        // bcast(a)->i.hi is free !
-        t.i.hi += bcast(a)->b.b1 * bcast(b)->b.b1;      // D <- b lost in .lst
-
-        bcast(a)->bi.b3 = bcast(a)->b.b1 *
-                                          bcast(b)->b.b2;
-        bcast(a)->bi.i12 = bcast(a)->b.b1 *
-                           bcast(b)->b.b0;              // C
-
-        bcast(b)->bi.b3 = bcast(a)->b.b0 *
-                                          bcast(b)->b.b3;
-        bcast(b)->bi.i12 = bcast(a)->b.b0 *
-                           bcast(b)->b.b1;              // B
-        bcast(b)->bi.b0 = 0;                            // B
-        bcast(a)->bi.b0 = 0;                            // C
-        t.l += a;
-
-        return t.l + b;
-}