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

Diff for /OpenXM_contrib2/asir2000/builtin/parif.c between version 1.7 and 1.19

version 1.7, 2000/12/22 09:58:32 version 1.19, 2015/08/06 09:12:29
Line 1 
Line 1 
 /*  
  * 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/parif.c,v 1.6 2000/12/05 01:24:51 noro Exp $  
 */  
 #include "ca.h"  #include "ca.h"
 #include "parse.h"  #include "parse.h"
   #include "ox.h"
   
 #if PARI  Q ox_pari_stream;
 #include "genpari.h"  int ox_pari_stream_initialized = 0;
   
 extern long prec;  pointer evalparif(FUNC f,NODE arg)
   
 void patori(GEN,Obj *);  
 void patori_i(GEN,N *);  
 void ritopa(Obj,GEN *);  
 void ritopa_i(N,int,GEN *);  
   
 void Peval(),Psetprec(),p_pi(),p_e(),p_mul(),p_gcd();  
 void asir_cgiv(GEN);  
   
 #if defined(INTERVAL) || 1  
 void Psetprecword();  
 #endif  
   
 struct ftab pari_tab[] = {  
         {"eval",Peval,-2},  
         {"setprec",Psetprec,-1},  
 #if defined(INTERVAL) || 1  
         {"setprecword",Psetprecword,-1},  
 #endif  
         {0,0,0},  
 };  
   
 #define MKPREC(a,i,b) (argc(a)==(i)?mkprec(QTOS((Q)(b))):prec)  
   
 #define CALLPARI1(f,a,p,r)\  
 ritopa((Obj)a,&_pt1_); _pt2_ = f(_pt1_,p); patori(_pt2_,r); asir_cgiv(_pt2_); asir_cgiv(_pt1_)  
 #define CALLPARI2(f,a,b,p,r)\  
 ritopa((Obj)a,&_pt1_); ritopa((Obj)b,&_pt2_); _pt3_ = f(_pt1_,_pt2_,p); patori(_pt3_,r); asir_cgiv(_pt3_); asir_cgiv(_pt2_); asir_cgiv(_pt1_)  
   
 #define PARIF1P(f,pf)\  
 void f(NODE,Obj *);\  
 void f(ar,rp) NODE ar; Obj *rp;\  
 { GEN _pt1_,_pt2_; CALLPARI1(pf,ARG0(ar),MKPREC(ar,2,ARG1(ar)),rp); }  
 #define PARIF2P(f,pf)\  
 void f(NODE,Obj *);\  
 void f(ar,rp) NODE ar; Obj *rp;\  
 { GEN _pt1_,_pt2_,_pt3_; CALLPARI2(pf,ARG0(ar),ARG1(ar),MKPREC(ar,3,ARG2(ar)),rp); }  
   
 #if defined(INTERVAL)  
 #define PREC_CONV       pariK1  
 #else  
 #if defined(LONG_IS_32BIT)  
 #define PREC_CONV               0.103810253  
 #endif  
 #if defined(LONG_IS_64BIT)  
 #define PREC_CONV               0.051905126  
 #endif  
 #endif  
   
 /* XXX : we should be more careful when we free PARI pointers. */  
   
 void asir_cgiv(ptr)  
 GEN ptr;  
 {  {
         if ( ptr != gzero && ptr != gun    int ac,intarg,opt,prec;
         && ptr != gdeux && ptr != ghalf    Q q,r,narg;
         && ptr != polvar && ptr != gi )    NODE nd,oxarg;
                 cgiv(ptr);    STRING name;
 }    USINT ui;
     Obj ret,dmy;
   
 mkprec(p)    if ( !ox_pari_stream_initialized ) {
 int p;            MKSTR(name,"ox_pari");
 {            nd = mknode(2,NULL,name);
         if ( p > 0 )            Pox_launch(nd,&r);
                 return (int)(p*PREC_CONV+3);            ox_pari_stream = r;
 }      ox_pari_stream_initialized = 1;
     }
           switch ( f->type ) {
                   case 0: /* in/out : integer */
                           ac = argc(arg);
                           if ( ac > 1 ) {
                                   fprintf(stderr,"argument mismatch in %s()\n",NAME(f));
                                   error("");
                                   /* NOTREACHED */
                                   return 0;
                           }
         intarg = ac == 0 ? 0 : QTOS((Q)ARG0(arg));
         MKUSINT(ui,intarg);
         oxarg = mknode(2,ox_pari_stream,ui);
         Pox_push_cmo(oxarg,&dmy);
         MKSTR(name,f->name);
         oxarg = mknode(3,ox_pari_stream,name,ONE);
         Pox_execute_function(oxarg,&dmy);
         oxarg = mknode(1,ox_pari_stream);
         Pox_pop_cmo(oxarg,&r);
         return r;
   
 void Peval(arg,rp)                  case 1:
 NODE arg;                          ac = argc(arg);
 Obj *rp;                          if ( !ac || ( ac > 2 ) ) {
 {                                  fprintf(stderr,"argument mismatch in %s()\n",NAME(f));
         asir_assert(ARG0(arg),O_R,"eval");                                  error("");
         evalr(CO,(Obj)ARG0(arg),argc(arg)==2?QTOS((Q)ARG1(arg)):0,rp);                                  /* NOTREACHED */
 }                                  return 0;
                           }
         /* arg1 : prec */
         prec = ac == 1 ? 0 : QTOS((Q)ARG1(arg));
         MKUSINT(ui,prec);
         oxarg = mknode(2,ox_pari_stream,ui);
         Pox_push_cmo(oxarg,&dmy);
   
 void Psetprec(arg,rp)        /* arg0 : arg */
 NODE arg;        oxarg = mknode(2,ox_pari_stream,ARG0(arg));
 Obj *rp;        Pox_push_cmo(oxarg,&dmy);
 {  
         int p;  
         Q q;  
   
 #if defined(INTERVAL) || 1        MKSTR(name,f->name);
         p = (int)((prec-2)/PREC_CONV); STOQ(p,q); *rp = (Obj)q;        STOQ(2,narg);
         if ( arg ) {        oxarg = mknode(3,ox_pari_stream,name,narg);
                 asir_assert(ARG0(arg),O_N,"setprec");        Pox_execute_function(oxarg,&dmy);
                 p = QTOS((Q)ARG0(arg));        oxarg = mknode(1,ox_pari_stream);
                 if ( p > 0 )        Pox_pop_cmo(oxarg,&r);
                         prec = (long)(p*PREC_CONV+3);        return r;
         }  
 #else  
         p = (int)((prec-3)/PREC_CONV); STOQ(p,q); *rp = (Obj)q;  
         if ( arg ) {  
                 asir_assert(ARG0(arg),O_N,"setprec");  
                 prec = mkprec(QTOS((Q)ARG0(arg)));  
         }  
 #endif  
 }  
   
 #if defined(INTERVAL) || 1                  case 2:
 void Psetprecword(arg,rp)  
 NODE arg;  
 Obj *rp;  
 {  
         int p;  
         Q q;  
   
         p = (int)((prec-2)); STOQ(p,q); *rp = (Obj)q;  
         if ( arg ) {  
                 asir_assert(ARG0(arg),O_N,"setprecword");  
                 p = QTOS((Q)ARG0(arg));  
                 if ( p > 0 ) {  
                         prec = p + 2;  
                 }  
         }  
 }  
 #endif  
   
 void p_pi(arg,rp)  
 NODE arg;  
 Obj *rp;  
 {  
         GEN x;  
   
         x = mppi(MKPREC(arg,1,ARG0(arg)));  
         patori(x,rp); asir_cgiv(x);  
 }  
   
 void p_e(arg,rp)  
 NODE arg;  
 Obj *rp;  
 {  
         GEN x;  
   
         x = gexp(gun,MKPREC(arg,1,ARG0(arg))); patori(x,rp); asir_cgiv(x);  
 }  
   
 void p_mul(a,b,r)  
 Obj a,b,*r;  
 {  
         GEN p1,p2,p3;  
   
         ritopa((Obj)a,&p1); ritopa((Obj)b,&p2);  
         p3 = mulii(p1,p2);  
         patori(p3,r); asir_cgiv(p3); asir_cgiv(p2); asir_cgiv(p1);  
 }  
   
 void p_gcd(a,b,r)  
 N a,b,*r;  
 {  
         GEN p1,p2,p3;  
   
         ritopa_i(a,1,&p1); ritopa_i(b,1,&p2);  
         p3 = mppgcd(p1,p2);  
         patori_i(p3,r); asir_cgiv(p3); asir_cgiv(p2); asir_cgiv(p1);  
 }  
   
 PARIF1P(p_sin,gsin) PARIF1P(p_cos,gcos) PARIF1P(p_tan,gtan)  
 PARIF1P(p_asin,gasin) PARIF1P(p_acos,gacos) PARIF1P(p_atan,gatan)  
 PARIF1P(p_sinh,gsh) PARIF1P(p_cosh,gch) PARIF1P(p_tanh,gth)  
 PARIF1P(p_asinh,gash) PARIF1P(p_acosh,gach) PARIF1P(p_atanh,gath)  
 PARIF1P(p_exp,gexp) PARIF1P(p_log,glog)  
 PARIF1P(p_dilog,dilog) PARIF1P(p_erf,gerfc)  
 PARIF1P(p_eigen,eigen) PARIF1P(p_roots,roots)  
   
 PARIF2P(p_pow,gpui)  
   
 pointer evalparif(f,arg)  
 FUNC f;  
 NODE arg;  
 {  
         GEN a,v;  
         long ltop,lbot;  
         pointer r;  
         int ac;  
         char buf[BUFSIZ];  
   
         if ( !f->f.binf ) {  
                 sprintf(buf,"pari : %s undefined.",f->name);  
                 error(buf);  
         }  
         switch ( f->type ) {  
                 case 1:  
                         ac = argc(arg);                          ac = argc(arg);
                         if ( !ac || ( ac > 2 ) ) {                          if ( !ac || ( ac > 2 ) ) {
                                 fprintf(stderr,"argument mismatch in %s()\n",NAME(f));                                  fprintf(stderr,"argument mismatch in %s()\n",NAME(f));
                                 error("");                                  error("");
                                   /* NOTREACHED */
                                   return 0;
                         }                          }
                         ltop = avma;                          if ( ac == 1 )
                         ritopa((Obj)ARG0(arg),&a);                                  opt = 0;
 #if 1 || defined(__MWERKS__)                          else
                 {                                  opt = QTOS((Q)ARG1(arg));
                         GEN (*dmy)();  
   
                         dmy = (GEN (*)())f->f.binf;  
                         v = (*dmy)(a,MKPREC(arg,2,ARG1(arg)));  
                 }  
 #else  
                         v = (GEN)(*f->f.binf)(a,MKPREC(arg,2,ARG1(arg)));  
 #endif  
                         lbot = avma;  
                         patori(v,(Obj *)&r); gerepile(ltop,lbot,0);  
                         return r;                          return r;
   
                 default:                  default:
                         error("evalparif : not implemented yet.");                          error("evalparif : not implemented yet.");
                           /* NOTREACHED */
                           return 0;
         }          }
 }  }
   
 struct pariftab {  struct pariftab {
         char *name;          char *name;
         GEN (*f)();    int dmy;
         int type;          int type;
 };  };
   
   /*
    * type = 1 => argc = 1, second arg = precision
    * type = 2 => argc = 1, second arg = optional (long int)
    *
    */
   /*
   {"abs",0,1},
   {"adj",0,1},
   */
   
 struct pariftab pariftab[] = {  struct pariftab pariftab[] = {
 {"abs",(GEN (*)())gabs,1},  {"arg",0,1},
 {"adj",adj,1},  {"bigomega",0,1},
 {"arg",garg,1},  {"binary",0,1},
 {"bigomega",gbigomega,1},  {"ceil",0,1},
 {"binary",binaire,1},  {"centerlift",0,1},
 {"ceil",gceil,1},  {"cf",0,1},
 {"centerlift",centerlift,1},  {"classno",0,1},
 {"cf",gcf,1},  {"classno2",0,1},
 {"classno",classno,1},  {"conj",0,1},
 {"classno2",classno2,1},  {"content",0,1},
 {"conj",gconj,1},  {"denom",0,1},
 {"content",content,1},  {"det",0,1},
 {"denom",denom,1},  {"det2",0,1},
 {"det",det,1},  {"dilog",0,1},
 {"det2",det2,1},  {"disc",0,1},
 {"dilog",dilog,1},  {"discf",0,1},
 {"disc",discsr,1},  {"divisors",0,1},
 {"discf",discf,1},  {"eigen",0,1},
 {"divisors",divisors,1},  {"eintg1",0,1},
 {"eigen",eigen,1},  {"erfc",0,1},
 {"eintg1",eint1,1},  {"eta",0,1},
 {"erfc",gerfc,1},  {"floor",0,1},
 {"eta",eta,1},  {"frac",0,1},
 {"floor",gfloor,1},  {"galois",0,1},
 {"frac",gfrac,1},  {"galoisconj",0,1},
 {"galois",galois,1},  {"gamh",0,1},
 {"galoisconj",galoisconj,1},  {"gamma",0,1},
 {"gamh",ggamd,1},  {"hclassno",0,1},
 {"gamma",ggamma,1},  {"hermite",0,1},
 {"hclassno",classno3,1},  {"hess",0,1},
 {"hermite",hnf,1},  {"imag",0,1},
 {"hess",hess,1},  {"image",0,1},
 {"imag",gimag,1},  {"image2",0,1},
 {"image",image,1},  {"indexrank",0,1},
 {"image2",image2,1},  {"indsort",0,1},
 {"indexrank",indexrank,1},  {"initalg",0,1},
 {"indsort",indexsort,1},  {"isfund",0,1},
 {"initalg",initalg,1},  {"ispsp",0,1},
 {"isfund",gisfundamental,1},  {"isqrt",0,1},
 {"isprime",gisprime,1},  {"issqfree",0,1},
 {"ispsp",gispsp,1},  {"issquare",0,1},
 {"isqrt",racine,1},  {"jacobi",0,1},
 {"issqfree",gissquarefree,1},  {"jell",0,1},
 {"issquare",gcarreparfait,1},  {"ker",0,1},
 {"jacobi",jacobi,1},  {"keri",0,1},
 {"jell",jell,1},  {"kerint",0,1},
 {"ker",ker,1},  {"kerintg1",0,1},
 {"keri",keri,1},  {"length",0,1},
 {"kerint",kerint,1},  {"lexsort",0,1},
 {"kerintg1",kerint1,1},  {"lift",0,1},
 {"kerint2",kerint2,1},  {"lindep",0,1},
 {"length",(GEN(*)())glength,1},  {"lll",0,1},
 {"lexsort",lexsort,1},  {"lllgen",0,1},
 {"lift",lift,1},  {"lllgram",0,1},
 {"lindep",lindep,1},  {"lllgramgen",0,1},
 {"lll",lll,1},  {"lllgramint",0,1},
 {"lllg1",lll1,1},  {"lllgramkerim",0,1},
 {"lllgen",lllgen,1},  {"lllgramkerimgen",0,1},
 {"lllgram",lllgram,1},  {"lllint",0,1},
 {"lllgramg1",lllgram1,1},  {"lllkerim",0,1},
 {"lllgramgen",lllgramgen,1},  {"lllkerimgen",0,1},
 {"lllgramint",lllgramint,1},  {"lngamma",0,1},
 {"lllgramkerim",lllgramkerim,1},  {"logagm",0,1},
 {"lllgramkerimgen",lllgramkerimgen,1},  {"mat",0,1},
 {"lllint",lllint,1},  {"matrixqz2",0,1},
 {"lllkerim",lllkerim,1},  {"matrixqz3",0,1},
 {"lllkerimgen",lllkerimgen,1},  {"matsize",0,1},
 {"lllrat",lllrat,1},  {"modreverse",0,1},
 {"lngamma",glngamma,1},  {"mu",0,1},
 {"logagm",glogagm,1},  {"nextprime",0,1},
 {"mat",gtomat,1},  {"norm",0,1},
 {"matrixqz2",matrixqz2,1},  {"norml2",0,1},
 {"matrixqz3",matrixqz3,1},  {"numdiv",0,1},
 {"matsize",matsize,1},  {"numer",0,1},
 {"modreverse",polymodrecip,1},  {"omega",0,1},
 {"mu",gmu,1},  {"order",0,1},
 {"nextprime",nextprime,1},  {"ordred",0,1},
 {"norm",gnorm,1},  {"phi",0,1},
 {"norml2",gnorml2,1},  {"pnqn",0,1},
 {"numdiv",numbdiv,1},  {"polred",0,1},
 {"numer",numer,1},  {"polred2",0,1},
 {"omega",gomega,1},  {"primroot",0,1},
 {"order",order,1},  {"psi",0,1},
 {"ordred",ordred,1},  {"quadgen",0,1},
 {"phi",phi,1},  {"quadpoly",0,1},
 {"pnqn",pnqn,1},  {"real",0,1},
 {"polred",polred,1},  {"recip",0,1},
 {"polred2",polred2,1},  {"redreal",0,1},
 {"primroot",gener,1},  {"regula",0,1},
 {"psi",gpsi,1},  {"reorder",0,1},
 {"quadgen",quadgen    ,1},  {"reverse",0,1},
 {"quadpoly",quadpoly    ,1},  {"rhoreal",0,1},
 {"real",greal,1},  {"roots",0,1},
 {"recip",polrecip       ,1},  {"round",0,1},
 {"redreal",redreal       ,1},  {"sigma",0,1},
 {"regula",regula  ,1},  {"signat",0,1},
 {"reorder",reorder  ,1},  {"simplify",0,1},
 {"reverse",recip  ,1},  {"smalldiscf",0,1},
 {"rhoreal",rhoreal       ,1},  {"smallfact",0,1},
 {"roots",roots,1},  {"smallpolred",0,1},
 {"round",ground,1},  {"smallpolred2",0,1},
 {"sigma",sumdiv,1},  {"smith",0,1},
 {"signat",signat,1},  {"smith2",0,1},
 {"simplify",simplify,1},  {"sort",0,1},
 {"smalldiscf",smalldiscf,1},  {"sqr",0,1},
 {"smallfact",smallfact,1},  {"sqred",0,1},
 {"smallpolred",smallpolred,1},  {"sqrt",0,1},
 {"smallpolred2",smallpolred2,1},  {"supplement",0,1},
 {"smith",smith,1},  {"trace",0,1},
 {"smith2",smith2,1},  {"trans",0,1},
 {"sort",sort,1},  {"trunc",0,1},
 {"sqr",gsqr,1},  {"unit",0,1},
 {"sqred",sqred,1},  {"vec",0,1},
 {"sqrt",gsqrt,1},  {"wf",0,1},
 {"supplement",suppl,1},  {"wf2",0,1},
 {"trace",gtrace,1},  {"zeta",0,1},
 {"trans",gtrans,1},  {"factor",0,1},
 {"trunc",gtrunc,1},  
 {"unit",fundunit,1},  {"allocatemem",0,0},
 {"vec",gtovec,1},  
 {"wf",wf,1},  {"isprime",0,2},
 {"wf2",wf2,1},  {"factorint",0,2},
 {"zeta",gzeta,1},  
 {0,0,0},  {0,0,0},
 };  };
   
Line 399  void parif_init() {
Line 234  void parif_init() {
         int i;          int i;
   
         for ( i = 0, parif = 0; pariftab[i].name; i++ )          for ( i = 0, parif = 0; pariftab[i].name; i++ )
                  appendparif(&parif,pariftab[i].name, (int (*)())pariftab[i].f,pariftab[i].type);                   appendparif(&parif,pariftab[i].name, 0,pariftab[i].type);
 }  }
 #else /* PARI */  
   
 struct ftab pari_tab[] = {  
         {0,0,0},  
 };  
   
 void parif_init() {}  
   
 pointer evalparif(f,arg)  
 FUNC f;  
 NODE arg;  
 {  
         error("evalparif : PARI is not combined.");  
 }  
 #endif /*PARI */  
Legend:
Removed from v.1.7  
changed lines
  Added in v.1.19
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>