Annotation of OpenXM_contrib2/asir2000/builtin/parif.c, Revision 1.6
1.3 noro 1: /*
2: * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
3: * All rights reserved.
4: *
5: * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
6: * non-exclusive and royalty-free license to use, copy, modify and
7: * redistribute, solely for non-commercial and non-profit purposes, the
8: * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
9: * conditions of this Agreement. For the avoidance of doubt, you acquire
10: * only a limited right to use the SOFTWARE hereunder, and FLL or any
11: * third party developer retains all rights, including but not limited to
12: * copyrights, in and to the SOFTWARE.
13: *
14: * (1) FLL does not grant you a license in any way for commercial
15: * purposes. You may use the SOFTWARE only for non-commercial and
16: * non-profit purposes only, such as academic, research and internal
17: * business use.
18: * (2) The SOFTWARE is protected by the Copyright Law of Japan and
19: * international copyright treaties. If you make copies of the SOFTWARE,
20: * with or without modification, as permitted hereunder, you shall affix
21: * to all such copies of the SOFTWARE the above copyright notice.
22: * (3) An explicit reference to this SOFTWARE and its copyright owner
23: * shall be made on your publication or presentation in any form of the
24: * results obtained by use of the SOFTWARE.
25: * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
1.4 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.3 noro 27: * for such modification or the source code of the modified part of the
28: * SOFTWARE.
29: *
30: * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
31: * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
32: * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
33: * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
34: * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
35: * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
36: * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
37: * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
38: * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
39: * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
40: * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
41: * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
42: * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
43: * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
44: * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
45: * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
46: * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
47: *
1.6 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/builtin/parif.c,v 1.5 2000/11/15 00:07:20 noro Exp $
1.3 noro 49: */
1.1 noro 50: #include "ca.h"
51: #include "parse.h"
52:
53: #if PARI
54: #include "genpari.h"
55:
56: extern long prec;
57:
58: void patori(GEN,Obj *);
59: void patori_i(GEN,N *);
60: void ritopa(Obj,GEN *);
61: void ritopa_i(N,int,GEN *);
62:
63: void Peval(),Psetprec(),p_pi(),p_e(),p_mul(),p_gcd();
1.5 noro 64: void asir_cgiv(GEN);
1.1 noro 65:
66: struct ftab pari_tab[] = {
67: {"eval",Peval,-2}, {"setprec",Psetprec,-1}, {0,0,0},
68: };
69:
70: #define MKPREC(a,i,b) (argc(a)==(i)?mkprec(QTOS((Q)(b))):prec)
71:
72: #define CALLPARI1(f,a,p,r)\
1.5 noro 73: ritopa((Obj)a,&_pt1_); _pt2_ = f(_pt1_,p); patori(_pt2_,r); asir_cgiv(_pt2_); asir_cgiv(_pt1_)
1.1 noro 74: #define CALLPARI2(f,a,b,p,r)\
1.5 noro 75: 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_)
1.1 noro 76:
77: #define PARIF1P(f,pf)\
78: void f(NODE,Obj *);\
79: void f(ar,rp) NODE ar; Obj *rp;\
80: { GEN _pt1_,_pt2_; CALLPARI1(pf,ARG0(ar),MKPREC(ar,2,ARG1(ar)),rp); }
81: #define PARIF2P(f,pf)\
82: void f(NODE,Obj *);\
83: void f(ar,rp) NODE ar; Obj *rp;\
84: { GEN _pt1_,_pt2_,_pt3_; CALLPARI2(pf,ARG0(ar),ARG1(ar),MKPREC(ar,3,ARG2(ar)),rp); }
85:
86: #if defined(LONG_IS_32BIT)
87: #define PREC_CONV 0.103810253
88: #endif
89: #if defined(LONG_IS_64BIT)
90: #define PREC_CONV 0.051905126
91: #endif
92:
1.5 noro 93: /* XXX : we should be more careful when we free PARI pointers. */
94:
95: void asir_cgiv(ptr)
96: GEN ptr;
97: {
98: if ( ptr != gzero && ptr != gun
99: && ptr != gdeux && ptr != ghalf
100: && ptr != polvar && ptr != gi )
101: cgiv(ptr);
102: }
103:
1.1 noro 104: mkprec(p)
105: int p;
106: {
107: if ( p > 0 )
108: return (int)(p*PREC_CONV+3);
109: }
110:
111: void Peval(arg,rp)
112: NODE arg;
113: Obj *rp;
114: {
115: asir_assert(ARG0(arg),O_R,"eval");
116: evalr(CO,(Obj)ARG0(arg),argc(arg)==2?QTOS((Q)ARG1(arg)):0,rp);
117: }
118:
119: void Psetprec(arg,rp)
120: NODE arg;
121: Obj *rp;
122: {
123: int p;
124: Q q;
125:
126: p = (int)((prec-3)/PREC_CONV); STOQ(p,q); *rp = (Obj)q;
127: if ( arg ) {
128: asir_assert(ARG0(arg),O_N,"setprec");
129: prec = mkprec(QTOS((Q)ARG0(arg)));
130: }
131: }
132:
133: void p_pi(arg,rp)
134: NODE arg;
135: Obj *rp;
136: {
137: GEN x;
138:
139: x = mppi(MKPREC(arg,1,ARG0(arg)));
1.5 noro 140: patori(x,rp); asir_cgiv(x);
1.1 noro 141: }
142:
143: void p_e(arg,rp)
144: NODE arg;
145: Obj *rp;
146: {
147: GEN x;
148:
1.5 noro 149: x = gexp(gun,MKPREC(arg,1,ARG0(arg))); patori(x,rp); asir_cgiv(x);
1.1 noro 150: }
151:
152: void p_mul(a,b,r)
153: Obj a,b,*r;
154: {
155: GEN p1,p2,p3;
156:
157: ritopa((Obj)a,&p1); ritopa((Obj)b,&p2);
158: p3 = mulii(p1,p2);
1.5 noro 159: patori(p3,r); asir_cgiv(p3); asir_cgiv(p2); asir_cgiv(p1);
1.1 noro 160: }
161:
162: void p_gcd(a,b,r)
163: N a,b,*r;
164: {
165: GEN p1,p2,p3;
166:
167: ritopa_i(a,1,&p1); ritopa_i(b,1,&p2);
168: p3 = mppgcd(p1,p2);
1.5 noro 169: patori_i(p3,r); asir_cgiv(p3); asir_cgiv(p2); asir_cgiv(p1);
1.1 noro 170: }
171:
172: PARIF1P(p_sin,gsin) PARIF1P(p_cos,gcos) PARIF1P(p_tan,gtan)
173: PARIF1P(p_asin,gasin) PARIF1P(p_acos,gacos) PARIF1P(p_atan,gatan)
174: PARIF1P(p_sinh,gsh) PARIF1P(p_cosh,gch) PARIF1P(p_tanh,gth)
175: PARIF1P(p_asinh,gash) PARIF1P(p_acosh,gach) PARIF1P(p_atanh,gath)
176: PARIF1P(p_exp,gexp) PARIF1P(p_log,glog)
177: PARIF1P(p_dilog,dilog) PARIF1P(p_erf,gerfc)
178: PARIF1P(p_eigen,eigen) PARIF1P(p_roots,roots)
179:
180: PARIF2P(p_pow,gpui)
181:
182: pointer evalparif(f,arg)
183: FUNC f;
184: NODE arg;
185: {
186: GEN a,v;
187: long ltop,lbot;
188: pointer r;
189: int ac;
190: char buf[BUFSIZ];
191:
192: if ( !f->f.binf ) {
193: sprintf(buf,"pari : %s undefined.",f->name);
194: error(buf);
195: }
196: switch ( f->type ) {
197: case 1:
198: ac = argc(arg);
199: if ( !ac || ( ac > 2 ) ) {
200: fprintf(stderr,"argument mismatch in %s()\n",NAME(f));
201: error("");
202: }
203: ltop = avma;
204: ritopa((Obj)ARG0(arg),&a);
205: #if 1 || defined(__MWERKS__)
206: {
207: GEN (*dmy)();
208:
209: dmy = (GEN (*)())f->f.binf;
210: v = (*dmy)(a,MKPREC(arg,2,ARG1(arg)));
211: }
212: #else
213: v = (GEN)(*f->f.binf)(a,MKPREC(arg,2,ARG1(arg)));
214: #endif
215: lbot = avma;
216: patori(v,(Obj *)&r); gerepile(ltop,lbot,0);
217: return r;
218: default:
219: error("evalparif : not implemented yet.");
220: }
221: }
222:
223: struct pariftab {
224: char *name;
225: GEN (*f)();
226: int type;
227: };
228:
229: struct pariftab pariftab[] = {
230: {"abs",(GEN (*)())gabs,1},
231: {"adj",adj,1},
232: {"arg",garg,1},
233: {"bigomega",gbigomega,1},
234: {"binary",binaire,1},
235: {"ceil",gceil,1},
236: {"centerlift",centerlift,1},
237: {"cf",gcf,1},
238: {"classno",classno,1},
239: {"classno2",classno2,1},
240: {"conj",gconj,1},
241: {"content",content,1},
242: {"denom",denom,1},
243: {"det",det,1},
244: {"det2",det2,1},
245: {"dilog",dilog,1},
246: {"disc",discsr,1},
247: {"discf",discf,1},
248: {"divisors",divisors,1},
249: {"eigen",eigen,1},
250: {"eintg1",eint1,1},
251: {"erfc",gerfc,1},
252: {"eta",eta,1},
253: {"floor",gfloor,1},
254: {"frac",gfrac,1},
255: {"galois",galois,1},
256: {"galoisconj",galoisconj,1},
257: {"gamh",ggamd,1},
258: {"gamma",ggamma,1},
259: {"hclassno",classno3,1},
260: {"hermite",hnf,1},
261: {"hess",hess,1},
262: {"imag",gimag,1},
263: {"image",image,1},
264: {"image2",image2,1},
265: {"indexrank",indexrank,1},
266: {"indsort",indexsort,1},
267: {"initalg",initalg,1},
268: {"isfund",gisfundamental,1},
269: {"isprime",gisprime,1},
270: {"ispsp",gispsp,1},
271: {"isqrt",racine,1},
272: {"issqfree",gissquarefree,1},
273: {"issquare",gcarreparfait,1},
274: {"jacobi",jacobi,1},
275: {"jell",jell,1},
276: {"ker",ker,1},
277: {"keri",keri,1},
278: {"kerint",kerint,1},
279: {"kerintg1",kerint1,1},
280: {"kerint2",kerint2,1},
281: {"length",(GEN(*)())glength,1},
282: {"lexsort",lexsort,1},
283: {"lift",lift,1},
284: {"lindep",lindep,1},
285: {"lll",lll,1},
286: {"lllg1",lll1,1},
287: {"lllgen",lllgen,1},
288: {"lllgram",lllgram,1},
289: {"lllgramg1",lllgram1,1},
290: {"lllgramgen",lllgramgen,1},
291: {"lllgramint",lllgramint,1},
292: {"lllgramkerim",lllgramkerim,1},
293: {"lllgramkerimgen",lllgramkerimgen,1},
294: {"lllint",lllint,1},
295: {"lllkerim",lllkerim,1},
296: {"lllkerimgen",lllkerimgen,1},
297: {"lllrat",lllrat,1},
298: {"lngamma",glngamma,1},
299: {"logagm",glogagm,1},
300: {"mat",gtomat,1},
301: {"matrixqz2",matrixqz2,1},
302: {"matrixqz3",matrixqz3,1},
303: {"matsize",matsize,1},
304: {"modreverse",polymodrecip,1},
305: {"mu",gmu,1},
306: {"nextprime",nextprime,1},
307: {"norm",gnorm,1},
308: {"norml2",gnorml2,1},
309: {"numdiv",numbdiv,1},
310: {"numer",numer,1},
311: {"omega",gomega,1},
312: {"order",order,1},
313: {"ordred",ordred,1},
314: {"phi",phi,1},
315: {"pnqn",pnqn,1},
316: {"polred",polred,1},
317: {"polred2",polred2,1},
318: {"primroot",gener,1},
319: {"psi",gpsi,1},
320: {"quadgen",quadgen ,1},
321: {"quadpoly",quadpoly ,1},
322: {"real",greal,1},
323: {"recip",polrecip ,1},
324: {"redreal",redreal ,1},
325: {"regula",regula ,1},
326: {"reorder",reorder ,1},
327: {"reverse",recip ,1},
328: {"rhoreal",rhoreal ,1},
329: {"roots",roots,1},
330: {"round",ground,1},
331: {"sigma",sumdiv,1},
332: {"signat",signat,1},
333: {"simplify",simplify,1},
334: {"smalldiscf",smalldiscf,1},
335: {"smallfact",smallfact,1},
336: {"smallpolred",smallpolred,1},
337: {"smallpolred2",smallpolred2,1},
338: {"smith",smith,1},
339: {"smith2",smith2,1},
340: {"sort",sort,1},
341: {"sqr",gsqr,1},
342: {"sqred",sqred,1},
343: {"sqrt",gsqrt,1},
344: {"supplement",suppl,1},
345: {"trace",gtrace,1},
346: {"trans",gtrans,1},
347: {"trunc",gtrunc,1},
348: {"unit",fundunit,1},
349: {"vec",gtovec,1},
350: {"wf",wf,1},
351: {"wf2",wf2,1},
352: {"zeta",gzeta,1},
353: {0,0,0},
354: };
355:
356: void parif_init() {
357: int i;
358:
359: for ( i = 0, parif = 0; pariftab[i].name; i++ )
360: appendparif(&parif,pariftab[i].name, (int (*)())pariftab[i].f,pariftab[i].type);
361: }
362: #else /* PARI */
363:
364: struct ftab pari_tab[] = {
365: {0,0,0},
366: };
367:
368: void parif_init() {}
369:
1.2 noro 370: pointer evalparif(f,arg)
371: FUNC f;
372: NODE arg;
373: {
1.1 noro 374: error("evalparif : PARI is not combined.");
375: }
376: #endif /*PARI */
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to parif.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / builtin