[BACK]Return to real.c CVS log [TXT][DIR] Up to [local] / OpenXM_contrib2 / asir2000 / engine

Diff for /OpenXM_contrib2/asir2000/engine/real.c between version 1.1.1.1 and 1.9

version 1.1.1.1, 1999/12/03 07:39:08 version 1.9, 2015/08/06 10:01:52
Line 1 
Line 1 
 /* $OpenXM: OpenXM/src/asir99/engine/real.c,v 1.1.1.1 1999/11/10 08:12:26 noro Exp $ */  /*
    * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
    * All rights reserved.
    *
    * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
    * non-exclusive and royalty-free license to use, copy, modify and
    * redistribute, solely for non-commercial and non-profit purposes, the
    * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
    * conditions of this Agreement. For the avoidance of doubt, you acquire
    * only a limited right to use the SOFTWARE hereunder, and FLL or any
    * third party developer retains all rights, including but not limited to
    * copyrights, in and to the SOFTWARE.
    *
    * (1) FLL does not grant you a license in any way for commercial
    * purposes. You may use the SOFTWARE only for non-commercial and
    * non-profit purposes only, such as academic, research and internal
    * business use.
    * (2) The SOFTWARE is protected by the Copyright Law of Japan and
    * international copyright treaties. If you make copies of the SOFTWARE,
    * with or without modification, as permitted hereunder, you shall affix
    * to all such copies of the SOFTWARE the above copyright notice.
    * (3) An explicit reference to this SOFTWARE and its copyright owner
    * shall be made on your publication or presentation in any form of the
    * results obtained by use of the SOFTWARE.
    * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
    * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
    * for such modification or the source code of the modified part of the
    * SOFTWARE.
    *
    * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
    * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
    * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
    * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
    * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
    * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
    * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
    * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
    * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
    * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
    * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
    * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
    * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
    * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
    * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
    * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
    * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
    *
    * $OpenXM: OpenXM_contrib2/asir2000/engine/real.c,v 1.8 2003/12/24 08:00:38 noro Exp $
   */
 #include "ca.h"  #include "ca.h"
 #include "base.h"  #include "base.h"
 #include <math.h>  #include <math.h>
   
 #if defined(THINK_C)  
 double RatnToReal(a)  double RatnToReal(a)
 Q a;  Q a;
 {  {
         double nm,dn,t;          double nm,dn,man;
         int enm,edn;  
         char buf[BUFSIZ];  
   
         nm = NatToReal(NM(a),&enm);  
         if ( INT(a) )  
                 if ( enm >= 1 )  
                         error("RatnToReal : Overflow");  
                 else  
                         return SGN(a)>0 ? nm : -nm;  
         else {  
                 dn = NatToReal(DN(a),&edn);  
                 sprintf(buf,"1.0E%d",enm-edn);  
                 sscanf(buf,"%lf",&t);  
                 if ( SGN(a) < 0 )  
                         t = -t;  
                 return nm/dn*t;  
         }  
 }  
   
 double NatToReal(a,expo)  
 N a;  
 int *expo;  
 {  
         int *p;  
         int l,all,i,j,s,tb,top,tail;  
         unsigned int t,m[2];  
   
         p = BD(a); l = PL(a) - 1;  
         for ( top = 0, t = p[l]; t; t >>= 1, top++ );  
         all = top + BSH*l; tail = (53-top)%BSH; i = l-(53-top)/BSH-1;  
         m[1] = i < 0 ? 0 : p[i]>>(BSH-tail);  
         for ( j = 1, i++, tb = tail; i <= l; i++ ) {  
                 s = 32-tb; t = i < 0 ? 0 : p[i];  
                 if ( BSH > s ) {  
                         m[j] |= ((t&((1<<s)-1))<<tb);  
                         if ( !j )  
                                 break;  
                         else {  
                                 j--; m[j] = t>>s; tb = BSH-s;  
                         }  
                 } else {  
                         m[j] |= (t<<tb); tb += BSH;  
                 }  
         }  
         s = (all-1)+1023;  
         m[0] = (m[0]&((1<<20)-1))|(MIN(2046,s)<<20); *expo = MAX(s-2046,0);  
 #ifdef vax  
         t = m[0]; m[0] = m[1]; m[1] = t; itod(m);  
 #endif  
 #if defined(MIPSEL)  
         t = m[0]; m[0] = m[1]; m[1] = t;  
 #endif  
         return (double)(*((short double *)m));  
 }  
 #else  
 double RatnToReal(a)  
 Q a;  
 {  
         double nm,dn,t,man;  
         int enm,edn,e;          int enm,edn,e;
         unsigned int *p,s;  
   
         nm = NatToReal(NM(a),&enm);          nm = NatToReal(NM(a),&enm);
         if ( INT(a) )          if ( INT(a) )
                 if ( enm >= 1 )                  if ( enm >= 1 ) {
                         error("RatnToReal : Overflow");                          error("RatnToReal : Overflow");
                 else                          /* NOTREACHED */
                           return 0;
                   } else
                         return SGN(a)>0 ? nm : -nm;                          return SGN(a)>0 ? nm : -nm;
         else {          else {
                 dn = NatToReal(DN(a),&edn);                  dn = NatToReal(DN(a),&edn);
                 man = nm/dn;                  man = nm/dn;
                 if ( SGN(a) < 0 )                  if ( SGN(a) < 0 )
                         man = -man;                          man = -man;
                 if ( ((e = enm - edn) >= 1024) || (e <= -1023) )                  if ( ((e = enm - edn) >= 1024) || (e <= -1023) ) {
                         error("RatnToReal : Overflow"); /* XXX */                          error("RatnToReal : Overflow"); /* XXX */
                 else if ( !e )                          /* NOTREACHED */
                           return 0;
                   } else if ( !e )
                         return man;                          return man;
                 else                  else
                         return man*pow(2,e);                          return man*pow(2,e);
Line 120  int *expo;
Line 111  int *expo;
 #ifdef vax  #ifdef vax
         t = m[0]; m[0] = m[1]; m[1] = t; itod(m);          t = m[0]; m[0] = m[1]; m[1] = t; itod(m);
 #endif  #endif
 #if defined(i386) || defined(MIPSEL) || defined(VISUAL) || defined(linux) || defined(__alpha) || defined(__FreeBSD__) || defined(__NetBSD__)  #if defined(__i386__) || defined(MIPSEL) || defined(VISUAL) || defined(__MINGW32__) || defined(__MINGW64__) || defined(__alpha) || defined(__FreeBSD__) || defined(__NetBSD__) || defined(__x86_64)
         t = m[0]; m[0] = m[1]; m[1] = t;          t = m[0]; m[0] = m[1]; m[1] = t;
 #endif  #endif
         return *((double *)m);          return *((double *)m);
 }  }
 #endif  
   
 void addreal(a,b,c)  void addreal(a,b,c)
 Num a,b;  Num a,b;
Line 155  Real *c;
Line 145  Real *c;
                 *c = 0;                  *c = 0;
         else {          else {
                 t = ToReal(a)*ToReal(b);                  t = ToReal(a)*ToReal(b);
   #if 0
                 if ( !t )                  if ( !t )
                         error("mulreal : Underflow"); /* XXX */                          error("mulreal : Underflow"); /* XXX */
                 else                  else
   #endif
                         MKReal(t,*c);                          MKReal(t,*c);
         }          }
 }  }
Line 172  Real *c;
Line 164  Real *c;
                 *c = 0;                  *c = 0;
         else {          else {
                 t = ToReal(a)/ToReal(b);                  t = ToReal(a)/ToReal(b);
   #if 0
                 if ( !t )                  if ( !t )
                         error("divreal : Underflow"); /* XXX */                          error("divreal : Underflow"); /* XXX */
                 else                  else
   #endif
                         MKReal(t,*c);                          MKReal(t,*c);
         }          }
 }  }
Line 207  Real *c;
Line 201  Real *c;
                 *c = 0;                  *c = 0;
         else if ( !RATN(b) || !INT(b) || (PL(NM((Q)b)) > 1) ) {          else if ( !RATN(b) || !INT(b) || (PL(NM((Q)b)) > 1) ) {
                 t = (double)pow((double)ToReal(a),(double)ToReal(b));                  t = (double)pow((double)ToReal(a),(double)ToReal(b));
   #if 0
                 if ( !t )                  if ( !t )
                         error("pwrreal : Underflow"); /* XXX */                          error("pwrreal : Underflow"); /* XXX */
                 else                  else
   #endif
                         MKReal(t,*c);                          MKReal(t,*c);
         } else {          } else {
                 t = pwrreal0(BDY((Real)a),BD(NM((Q)b))[0]);                  t = pwrreal0(BDY((Real)a),BD(NM((Q)b))[0]);
                 t = SGN((Q)b)>0?t:1/t;                  t = SGN((Q)b)>0?t:1/t;
   #if 0
                 if ( !t )                  if ( !t )
                         error("pwrreal : Underflow"); /* XXX */                          error("pwrreal : Underflow"); /* XXX */
                 else                  else
   #endif
                         MKReal(t,*c);                          MKReal(t,*c);
         }          }
 }  }
Legend:
Removed from v.1.1.1.1  
changed lines
  Added in v.1.9
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>