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

Diff for /OpenXM_contrib2/asir2000/parse/arith.c between version 1.1.1.1 and 1.14

version 1.1.1.1, 1999/12/03 07:39:11 version 1.14, 2004/05/14 06:02:54
Line 1 
Line 1 
 /* $OpenXM: OpenXM/src/asir99/parse/arith.c,v 1.2 1999/11/18 05:42:02 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/parse/arith.c,v 1.13 2004/04/14 07:27:42 ohara Exp $
   */
 #include "ca.h"  #include "ca.h"
 #include "parse.h"  #include "parse.h"
   
Line 18  ARF addfs, subfs, mulfs, divfs, remfs, pwrfs;
Line 66  ARF addfs, subfs, mulfs, divfs, remfs, pwrfs;
 void divsdc();  void divsdc();
   
 struct oAFUNC afunc[] = {  struct oAFUNC afunc[] = {
 /* ??? */       {0,0,0,0,0,0,0},  /* ???=0 */     {0,0,0,0,0,0,0},
 /* O_N */       {addnum,subnum,mulnum,divnum,pwrnum,chsgnnum,compnum},  /* O_N=1 */     {addnum,subnum,mulnum,divnum,pwrnum,chsgnnum,compnum},
 /* O_P */       {addp,subp,mulp,divr,pwrp,chsgnp,compp},  /* O_P=2 */     {addp,subp,mulp,divr,pwrp,chsgnp,compp},
 /* O_R */       {addr,subr,mulr,divr,pwrr,chsgnr,compr},  /* O_R=3 */     {addr,subr,mulr,divr,pwrr,chsgnr,compr},
 /* O_LIST */    {notdef,notdef,notdef,notdef,notdef,notdef,complist},  /* O_LIST=4 */  {notdef,notdef,notdef,notdef,notdef,notdef,complist},
 /* O_VECT */    {addvect,subvect,mulvect,divvect,notdef,chsgnvect,compvect},  /* O_VECT=5 */  {addvect,subvect,mulvect,divvect,notdef,chsgnvect,compvect},
 /* O_MAT */     {addmat,submat,mulmat,divmat,pwrmat,chsgnmat,compmat},  /* O_MAT=6 */   {addmat,submat,mulmat,divmat,pwrmat,chsgnmat,compmat},
 /* O_STR */     {addstr,notdef,notdef,notdef,notdef,notdef,compstr},  /* O_STR=7 */   {addstr,notdef,notdef,notdef,notdef,notdef,compstr},
 /* O_COMP */    {addcomp,subcomp,mulcomp,divcomp,pwrcomp,chsgncomp,compcomp},  /* O_COMP=8 */  {addcomp,subcomp,mulcomp,divcomp,pwrcomp,chsgncomp,compcomp},
 /* O_DP */   {addd,subd,muld,divsdc,notdef,chsgnd,compd},  /* O_DP=9 */   {addd,subd,muld,divsdc,notdef,chsgnd,compd},
 /* O_UI */      {notdef,notdef,notdef,notdef,notdef,notdef,compui},  /* O_USINT=10 */        {notdef,notdef,notdef,notdef,notdef,notdef,compui},
 /* O_GF2MAT */  {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},  /* O_ERR=11 */  {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
 /* O_ERR */     {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},  /* O_GF2MAT=12 */       {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
 /* O_GFMMAT */  {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},  /* O_MATHCAP=13 */      {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
   /* O_F=14 */    {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
   /* O_GFMMAT=15 */       {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
   /* O_BYTEARRAY=16 */    {notdef,notdef,notdef,notdef,notdef,notdef,compbytearray},
   /* O_QUOTE=17 */        {addquote,subquote,mulquote,divquote,pwrquote,chsgnquote,(int(*)())notdef},
   /* O_OPTLIST=18 */      {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
   /* O_SYMBOL=19 */       {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
   /* O_RANGE=20 */        {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
   /* O_TB=21 */   {notdef,notdef,notdef,notdef,notdef,notdef,(int(*)())notdef},
   /* O_DPV=22 */  {adddv,subdv,muldv,notdef,notdef,chsgndv,compdv},
 };  };
   
 void arf_init() {  void arf_init() {
Line 57  Obj a,b,*r;
Line 114  Obj a,b,*r;
                 (*afunc[OID(a)].add)(vl,a,b,r);                  (*afunc[OID(a)].add)(vl,a,b,r);
         else if ( (mid = MAX(OID(a),OID(b))) <= O_R )          else if ( (mid = MAX(OID(a),OID(b))) <= O_R )
                 (*afunc[mid].add)(vl,a,b,r);                  (*afunc[mid].add)(vl,a,b,r);
           else if ( (mid = MAX(OID(a),OID(b))) == O_DP && MIN(OID(a),OID(b)) <= O_R )
                   (*afunc[mid].add)(vl,a,b,r);
         else          else
                 notdef(vl,a,b,r);                  notdef(vl,a,b,r);
 }  }
Line 86  void arf_mul(vl,a,b,r)
Line 145  void arf_mul(vl,a,b,r)
 VL vl;  VL vl;
 Obj a,b,*r;  Obj a,b,*r;
 {  {
         int mid;          int mid,aid,bid;
   
         if ( !a || !b )          if ( !a && !b )
                 *r = 0;                  *r = 0;
         else if ( OID(a) == OID(b) )          else if ( !a || !b ) {
                 (*(afunc[OID(a)].mul))(vl,a,b,r);                  if ( !a )
         else if ( (mid = MAX(OID(a),OID(b))) <= O_R ||                          a = b;
                 (mid == O_MAT) || (mid == O_VECT) || (mid == O_DP) )                  /* compute a*0 */
                   if ( OID(a) == O_MAT || OID(a) == O_VECT )
                           (*(afunc[O_MAT].mul))(vl,a,0,r);
                   else
                           *r = 0;
           } else if ( (aid = OID(a)) == (bid = OID(b)) )
                   (*(afunc[aid].mul))(vl,a,b,r);
           else if ( (mid = MAX(aid,bid)) <= O_R )
                 (*afunc[mid].mul)(vl,a,b,r);                  (*afunc[mid].mul)(vl,a,b,r);
         else          else {
                 notdef(vl,a,b,r);                  switch ( aid ) {
                           case O_N: case O_P:
                                   (*afunc[mid].mul)(vl,a,b,r);
                                   break;
                           case O_R:
                                   /* rat * something; bid > O_R */
                                   if ( bid == O_VECT || bid == O_MAT )
                                           (*afunc[mid].mul)(vl,a,b,r);
                                   else
                                           notdef(vl,a,b,r);
                                   break;
                           case O_MAT:
                                   if ( bid <= O_R || bid == O_VECT || bid == O_DP )
                                           (*afunc[O_MAT].mul)(vl,a,b,r);
                                   else
                                           notdef(vl,a,b,r);
                                   break;
                           case O_VECT:
                                   if ( bid <= O_R || bid == O_DP )
                                           (*afunc[O_VECT].mul)(vl,a,b,r);
                                   else if ( bid == O_MAT )
                                           (*afunc[O_MAT].mul)(vl,a,b,r);
                                   else
                                           notdef(vl,a,b,r);
                                   break;
                           case O_DP:
                                   if ( bid <= O_P )
                                           (*afunc[O_DP].mul)(vl,a,b,r);
                                   else if ( bid == O_MAT || bid == O_VECT || bid == O_DPV )
                                           (*afunc[bid].mul)(vl,a,b,r);
                                   else
                                           notdef(vl,a,b,r);
                                   break;
                           default:
                                           notdef(vl,a,b,r);
                                   break;
                   }
           }
 }  }
   
 void arf_div(vl,a,b,r)  void arf_div(vl,a,b,r)
Line 139  Obj a,e,*r;
Line 242  Obj a,e,*r;
         R t;          R t;
   
         if ( !a )          if ( !a )
                 *r = 0;                  if ( !e )
         else if ( !e )                          *r = (pointer)ONE;
                 *r = (pointer)ONE;                  else
         else if ( (OID(e) <= O_N) && INT(e) ) {                          *r = 0;
           else if ( OID(a) == O_QUOTE )
                   (*(afunc[O_QUOTE].pwr))(vl,a,e,r);
           else if ( !e ) {
                   if ( OID(a) == O_MAT )
                           (*(afunc[O_MAT].pwr))(vl,a,e,r);
                   else
                           *r = (pointer)ONE;
           } else if ( (OID(e) <= O_N) && INT(e) ) {
                 if ( (OID(a) == O_P) && (SGN((Q)e) < 0) ) {                  if ( (OID(a) == O_P) && (SGN((Q)e) < 0) ) {
                         MKRAT((P)a,(P)ONE,1,t);                          MKRAT((P)a,(P)ONE,1,t);
                         (*(afunc[O_R].pwr))(vl,t,e,r);                          (*(afunc[O_R].pwr))(vl,t,e,r);
Line 184  int complist(vl,a,b)
Line 295  int complist(vl,a,b)
 VL vl;  VL vl;
 LIST a,b;  LIST a,b;
 {  {
         int i,t;          int t;
         NODE an,bn;          NODE an,bn;
   
         if ( !a )          if ( !a )
Line 194  LIST a,b;
Line 305  LIST a,b;
                         return -1;                          return -1;
         else if ( !b )          else if ( !b )
                 return 1;                  return 1;
         for ( i = 0, an = BDY(a); an; i++, an = NEXT(an) );          for ( an = BDY(a), bn = BDY(b); an && bn; an = NEXT(an), bn = NEXT(bn) );
         for ( an = BDY(b); an; i--, an = NEXT(an) );          if ( an && !bn )
         if ( i )                  return 1;
                 return i > 0 ? 1 : -1;          else if ( !an && bn )
                   return -1;
         for ( an = BDY(a), bn = BDY(b); an; an = NEXT(an), bn = NEXT(bn) )          for ( an = BDY(a), bn = BDY(b); an; an = NEXT(an), bn = NEXT(bn) )
                 if ( t = arf_comp(vl,BDY(an),BDY(bn)) )                  if ( t = arf_comp(vl,BDY(an),BDY(bn)) )
                         return t;                          return t;
Legend:
Removed from v.1.1.1.1  
changed lines
  Added in v.1.14
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>