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

Diff for /OpenXM_contrib2/asir2000/builtin/pf.c between version 1.1.1.1 and 1.7

version 1.1.1.1, 1999/12/03 07:39:07 version 1.7, 2004/06/22 09:17:21
Line 1 
Line 1 
 /* $OpenXM: OpenXM/src/asir99/builtin/pf.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/builtin/pf.c,v 1.6 2003/02/14 22:29:07 ohara Exp $
   */
 #include "ca.h"  #include "ca.h"
 #include "math.h"  #include "math.h"
 #include "parse.h"  #include "parse.h"
Line 17  void simplify_pow(PFINS,Obj *);
Line 65  void simplify_pow(PFINS,Obj *);
   
 void Pfunctor(),Pargs(),Pfunargs(),Pvtype(),Pcall(),Pdeval();  void Pfunctor(),Pargs(),Pfunargs(),Pvtype(),Pcall(),Pdeval();
 void Pregister_handler();  void Pregister_handler();
   void Peval_quote();
   void Pmapat();
   
 struct ftab puref_tab[] = {  struct ftab puref_tab[] = {
           {"mapat",Pmapat,-99999999},
         {"functor",Pfunctor,1},          {"functor",Pfunctor,1},
         {"args",Pargs,1},          {"args",Pargs,1},
         {"funargs",Pfunargs,1},          {"funargs",Pfunargs,1},
Line 26  struct ftab puref_tab[] = {
Line 77  struct ftab puref_tab[] = {
         {"call",Pcall,2},          {"call",Pcall,2},
         {"vtype",Pvtype,1},          {"vtype",Pvtype,1},
         {"deval",Pdeval,1},          {"deval",Pdeval,1},
           {"eval_quote",Peval_quote,1},
         {0,0,0},          {0,0,0},
 };  };
   
 #if PARI  #if defined(PARI)
 int p_pi(),p_e();  int p_pi(),p_e();
 int p_log(),p_exp(),p_pow();  int p_log(),p_exp(),p_pow();
 int p_sin(),p_cos(),p_tan(),p_asin(),p_acos(),p_atan();  int p_sin(),p_cos(),p_tan(),p_asin(),p_acos(),p_atan();
Line 260  P *rp;
Line 312  P *rp;
         else {          else {
                 ins = (PFINS)VR(p)->priv; pf = ins->pf;                  ins = (PFINS)VR(p)->priv; pf = ins->pf;
                 t = (FUNC)MALLOC(sizeof(struct oFUNC));                  t = (FUNC)MALLOC(sizeof(struct oFUNC));
                 t->name = pf->name; t->id = A_PURE; t->argc = pf->argc;                  t->name = t->fullname = pf->name; t->id = A_PURE; t->argc = pf->argc;
                 t->f.puref = pf;                  t->f.puref = pf;
                 makesrvar(t,rp);                  makesrvar(t,rp);
         }          }
Line 310  LIST *rp;
Line 362  LIST *rp;
         else {          else {
                 ins = (PFINS)VR(p)->priv; ad = ins->ad; pf = ins->pf;                  ins = (PFINS)VR(p)->priv; ad = ins->ad; pf = ins->pf;
                 t = (FUNC)MALLOC(sizeof(struct oFUNC));                  t = (FUNC)MALLOC(sizeof(struct oFUNC));
                 t->name = pf->name; t->id = A_PURE; t->argc = pf->argc;                  t->name = t->fullname = pf->name; t->id = A_PURE; t->argc = pf->argc;
                 t->f.puref = pf;                  t->f.puref = pf;
                 makesrvar(t,&f);                  makesrvar(t,&f);
                 n0 = 0; NEXTNODE(n0,n); BDY(n) = (pointer)f;                  n = n0 = 0; NEXTNODE(n0,n); BDY(n) = (pointer)f;
                 for ( i = 0; i < pf->argc; i++ ) {                  for ( i = 0; i < pf->argc; i++ ) {
                         NEXTNODE(n0,n); BDY(n) = (pointer)ad[i].arg;                          NEXTNODE(n0,n); BDY(n) = (pointer)ad[i].arg;
                 }                  }
Line 364  Q *rp;
Line 416  Q *rp;
         }          }
 }  }
   
 void Pcall(arg,rp)  void Pcall(NODE arg,Obj *rp)
 NODE arg;  
 Obj *rp;  
 {  {
         P p;          P p;
         V v;          V v;
Line 382  Obj *rp;
Line 432  Obj *rp;
                 *rp = (Obj)bevalf((FUNC)v->priv,BDY((LIST)ARG1(arg)));                  *rp = (Obj)bevalf((FUNC)v->priv,BDY((LIST)ARG1(arg)));
 }  }
   
   /* at=position of arg to be used for iteration */
   
   void Pmapat(NODE arg,Obj *rp)
   {
           LIST args;
           NODE node,rest,t0,t,n,r,r0;
           P fpoly;
           V fvar;
           FUNC f;
           VECT v,rv;
           MAT m,rm;
           LIST rl;
           int len,row,col,i,j,pos;
           Obj iter;
           pointer val;
   
           if ( argc(arg) < 3 )
                   error("mapat : too few arguments");
   
           fpoly = (P)ARG0(arg);
           if ( !fpoly || OID(fpoly) != O_P )
                   error("mapat : invalid function specification");
           fvar = VR(fpoly);
           if ( fvar->attr != (pointer)V_SR || !(f=(FUNC)fvar->priv) )
                   error("mapat : invalid function specification");
           if ( !INT(ARG1(arg)) )
                   error("mapat : invalid position");
           pos = QTOS((Q)ARG1(arg));
           node = NEXT(NEXT(arg));
           len = length(node);
           if ( pos >= len )
                   error("evalmapatf : invalid position");
           r0 = 0;
           for ( i = 0, t = node; i < pos; i++, t = NEXT(t) ) {
                   NEXTNODE(r0,r);
                   BDY(r) = BDY(t);
           }
           NEXTNODE(r0,r);
           iter = BDY(t); rest = NEXT(t);
           if ( !iter ) {
                   *rp = bevalf(f,node);
                   return;
           }
           switch ( OID(iter) ) {
                   case O_VECT:
                           v = (VECT)iter; len = v->len; MKVECT(rv,len);
                           for ( i = 0; i < len; i++ ) {
                                   BDY(r) = BDY(v)[i]; NEXT(r) = rest;
                                   BDY(rv)[i] = bevalf(f,r0);
                           }
                           *rp = (Obj)rv;
                           break;
                   case O_MAT:
                           m = (MAT)iter; row = m->row; col = m->col; MKMAT(rm,row,col);
                           for ( i = 0; i < row; i++ )
                                   for ( j = 0; j < col; j++ ) {
                                           BDY(r) = BDY(m)[i][j]; NEXT(r) = rest;
                                           BDY(rm)[i][j] = bevalf(f,r0);
                                   }
                           *rp = (Obj)rm;
                           break;
                   case O_LIST:
                           n = BDY((LIST)iter);
                           for ( t0 = t = 0; n; n = NEXT(n) ) {
                                   BDY(r) = BDY(n); NEXT(r) = rest;
                                   NEXTNODE(t0,t); BDY(t) = bevalf(f,r0);
                           }
                           if ( t0 )
                                   NEXT(t) = 0;
                           MKLIST(rl,t0);
                           *rp = (Obj)rl;
                           break;
                   default:
                           *rp = bevalf(f,node);
                           break;
           }
   }
   
 void Pdeval(arg,rp)  void Pdeval(arg,rp)
 NODE arg;  NODE arg;
 Obj *rp;  Obj *rp;
Line 390  Obj *rp;
Line 518  Obj *rp;
         devalr(CO,(Obj)ARG0(arg),rp);          devalr(CO,(Obj)ARG0(arg),rp);
 }  }
   
   void Peval_quote(arg,rp)
   NODE arg;
   Obj *rp;
   {
           asir_assert(ARG0(arg),O_QUOTE,"eval_quote");
           *rp = eval((FNODE)BDY((QUOTE)ARG0(arg)));
   }
Legend:
Removed from v.1.1.1.1  
changed lines
  Added in v.1.7
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>