![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to eval.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / parse|
Return to eval.c CVS log | Up to [local] / OpenXM_contrib2 / asir2000 / parse |
1.4 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.5 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.4 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.67 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.66 2010/04/23 04:44:52 noro Exp $
1.4 noro 49: */
1.1 noro 50: #include <ctype.h>
51: #include "ca.h"
52: #include "al.h"
53: #include "base.h"
54: #include "parse.h"
1.62 noro 55: #if defined(GC7)
1.61 ohara 56: #include "gc.h"
1.62 noro 57: #endif
1.1 noro 58: #include <sys/types.h>
59: #include <sys/stat.h>
1.20 ohara 60: #if defined(PARI)
1.1 noro 61: #include "genpari.h"
1.2 noro 62: #endif
1.1 noro 63:
1.18 noro 64: extern JMP_BUF timer_env;
1.60 noro 65: extern FUNC cur_binf;
66: extern NODE PVSS;
1.1 noro 67:
68: int f_break,f_return,f_continue;
69: int evalstatline;
70: int recv_intr;
1.24 noro 71: int show_crossref;
1.60 noro 72: int at_root;
1.43 noro 73: void gen_searchf_searchonly(char *name,FUNC *r);
1.57 noro 74: LIST eval_arg(FNODE a,unsigned int quote);
1.1 noro 75:
1.16 noro 76: pointer eval(FNODE f)
1.1 noro 77: {
78: LIST t;
79: STRING str;
80: pointer val = 0;
81: pointer a,a1,a2;
1.48 noro 82: NODE tn,tn1,ind,match;
1.1 noro 83: R u;
84: DP dp;
1.21 noro 85: unsigned int pv;
1.41 noro 86: int c,ret;
1.1 noro 87: FNODE f1;
88: UP2 up2;
89: UP up;
1.13 noro 90: UM um;
1.14 noro 91: Obj obj;
1.1 noro 92: GF2N gf2n;
93: GFPN gfpn;
1.13 noro 94: GFSN gfsn;
1.31 noro 95: RANGE range;
1.41 noro 96: QUOTE expr,pattern;
1.1 noro 97:
98: #if defined(VISUAL)
99: if ( recv_intr ) {
100: #include <signal.h>
101: if ( recv_intr == 1 ) {
102: recv_intr = 0;
103: int_handler(SIGINT);
104: } else {
105: recv_intr = 0;
106: ox_usr1_handler(0);
107: }
108: }
109: #endif
110: if ( !f )
111: return ( 0 );
112: switch ( f->id ) {
1.10 noro 113: case I_PAREN:
114: val = eval((FNODE)(FA0(f)));
1.14 noro 115: break;
116: case I_MINUS:
117: a1 = eval((FNODE)(FA0(f)));
118: arf_chsgn((Obj)a1,&obj);
119: val = (pointer)obj;
1.10 noro 120: break;
1.1 noro 121: case I_BOP:
122: a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f));
123: (*((ARF)FA0(f))->fp)(CO,a1,a2,&val);
1.10 noro 124: break;
1.46 noro 125: case I_NARYOP:
126: tn = (NODE)FA1(f);
127: a = eval((FNODE)BDY(tn));
128: for ( tn = NEXT(tn); tn; tn = NEXT(tn) ) {
129: a1 = eval((FNODE)BDY(tn));
130: (*((ARF)FA0(f))->fp)(CO,a,a1,&a2);
131: a = a2;
132: }
133: val = a;
134: break;
1.1 noro 135: case I_COP:
136: a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f));
137: c = arf_comp(CO,a1,a2);
138: switch ( (cid)FA0(f) ) {
139: case C_EQ:
140: c = (c == 0); break;
141: case C_NE:
142: c = (c != 0); break;
143: case C_GT:
144: c = (c > 0); break;
145: case C_LT:
146: c = (c < 0); break;
147: case C_GE:
148: c = (c >= 0); break;
149: case C_LE:
150: c = (c <= 0); break;
151: default:
152: c = 0; break;
153: }
154: if ( c )
155: val = (pointer)ONE;
156: break;
157: case I_AND:
158: if ( eval((FNODE)FA0(f)) && eval((FNODE)FA1(f)) )
159: val = (pointer)ONE;
160: break;
161: case I_OR:
162: if ( eval((FNODE)FA0(f)) || eval((FNODE)FA1(f)) )
163: val = (pointer)ONE;
164: break;
165: case I_NOT:
166: if ( eval((FNODE)FA0(f)) )
167: val = 0;
168: else
169: val = (pointer)ONE;
170: break;
171: case I_LOP:
172: a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f));
173: val = evall((lid)FA0(f),a1,a2);
174: break;
175: case I_CE:
176: if ( eval((FNODE)FA0(f)) )
177: val = eval((FNODE)FA1(f));
178: else
179: val = eval((FNODE)FA2(f));
180: break;
181: case I_EV:
182: evalnodebody((NODE)FA0(f),&tn); nodetod(tn,&dp); val = (pointer)dp;
183: break;
184: case I_FUNC:
185: val = evalf((FUNC)FA0(f),(FNODE)FA1(f),0); break;
186: case I_FUNC_OPT:
187: val = evalf((FUNC)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break;
1.57 noro 188: case I_FUNC_QARG:
189: tn = BDY(eval_arg((FNODE)FA1(f),(unsigned int)0xffffffff));
190: val = bevalf((FUNC)FA0(f),tn); break;
1.1 noro 191: case I_PFDERIV:
1.44 noro 192: val = evalf_deriv((FUNC)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break;
1.1 noro 193: case I_MAP:
194: val = evalmapf((FUNC)FA0(f),(FNODE)FA1(f)); break;
1.9 noro 195: case I_RECMAP:
196: val = eval_rec_mapf((FUNC)FA0(f),(FNODE)FA1(f)); break;
1.1 noro 197: case I_IFUNC:
1.63 noro 198: val = evalif((FNODE)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break;
1.1 noro 199: #if !defined(VISUAL)
200: case I_TIMER:
201: {
202: int interval;
203: Obj expired;
204:
205: interval = QTOS((Q)eval((FNODE)FA0(f)));
206: expired = (Obj)eval((FNODE)FA2(f));
207: set_timer(interval);
208: savepvs();
1.18 noro 209: if ( !SETJMP(timer_env) )
1.1 noro 210: val = eval((FNODE)FA1(f));
211: else {
212: val = (pointer)expired;
213: restorepvs();
214: }
215: reset_timer();
216: }
217: break;
218: #endif
219: case I_PRESELF:
220: f1 = (FNODE)FA1(f);
221: if ( ID(f1) == I_PVAR ) {
1.21 noro 222: pv = (unsigned int)FA0(f1); ind = (NODE)FA1(f1); GETPV(pv,a);
1.1 noro 223: if ( !ind ) {
224: (*((ARF)FA0(f))->fp)(CO,a,ONE,&val); ASSPV(pv,val);
225: } else if ( a ) {
226: evalnodebody(ind,&tn); getarray(a,tn,(pointer *)&u);
227: (*((ARF)FA0(f))->fp)(CO,u,ONE,&val); putarray(a,tn,val);
228: }
229: } else
1.6 noro 230: error("++ : not implemented yet");
1.1 noro 231: break;
232: case I_POSTSELF:
233: f1 = (FNODE)FA1(f);
234: if ( ID(f1) == I_PVAR ) {
1.21 noro 235: pv = (unsigned int)FA0(f1); ind = (NODE)FA1(f1); GETPV(pv,val);
1.1 noro 236: if ( !ind ) {
237: (*((ARF)FA0(f))->fp)(CO,val,ONE,&u); ASSPV(pv,u);
238: } else if ( val ) {
239: evalnodebody(ind,&tn); getarray(val,tn,&a);
240: (*((ARF)FA0(f))->fp)(CO,a,ONE,&u); putarray(val,tn,(pointer)u);
241: val = a;
242: }
243: } else
1.6 noro 244: error("-- : not implemented yet");
1.1 noro 245: break;
246: case I_PVAR:
1.39 noro 247: pv = (unsigned int)FA0(f);
248: ind = (NODE)FA1(f);
249: GETPV(pv,a);
1.1 noro 250: if ( !ind )
251: val = a;
252: else {
253: evalnodebody(ind,&tn); getarray(a,tn,&val);
254: }
255: break;
256: case I_ASSPVAR:
257: f1 = (FNODE)FA0(f);
258: if ( ID(f1) == I_PVAR ) {
1.21 noro 259: pv = (unsigned int)FA0(f1); ind = (NODE)FA1(f1);
1.1 noro 260: if ( !ind ) {
261: val = eval((FNODE)FA1(f)); ASSPV(pv,val);
262: } else {
263: GETPV(pv,a);
264: evalnodebody(ind,&tn);
265: putarray(a,tn,val = eval((FNODE)FA1(f)));
266: }
1.6 noro 267: } else if ( ID(f1) == I_POINT ) {
268: /* f1 <-> FA0(f1)->FA1(f1) */
269: a = eval(FA0(f1));
1.7 noro 270: assign_to_member(a,(char *)FA1(f1),val = eval((FNODE)FA1(f)));
271: } else if ( ID(f1) == I_INDEX ) {
272: /* f1 <-> FA0(f1)[FA1(f1)] */
273: a = eval((FNODE)FA0(f1)); ind = (NODE)FA1(f1);
274: evalnodebody(ind,&tn);
275: putarray(a,tn,val = eval((FNODE)FA1(f)));
1.15 noro 276: } else {
277: error("eval : invalid assignment");
1.6 noro 278: }
1.1 noro 279: break;
280: case I_ANS:
281: if ( (pv =(int)FA0(f)) < (int)APVS->n )
282: val = APVS->va[pv].priv;
283: break;
284: case I_GF2NGEN:
285: NEWUP2(up2,1);
286: up2->w=1;
287: up2->b[0] = 2; /* @ */
288: MKGF2N(up2,gf2n);
289: val = (pointer)gf2n;
290: break;
291: case I_GFPNGEN:
292: up = UPALLOC(1);
1.13 noro 293: DEG(up)=1;
294: COEF(up)[0] = 0;
295: COEF(up)[1] = (Num)ONELM;
1.1 noro 296: MKGFPN(up,gfpn);
297: val = (pointer)gfpn;
1.13 noro 298: break;
299: case I_GFSNGEN:
300: um = UMALLOC(1);
301: DEG(um) = 1;
302: COEF(um)[0] = 0;
303: COEF(um)[1] = _onesf();
304: MKGFSN(um,gfsn);
305: val = (pointer)gfsn;
1.1 noro 306: break;
307: case I_STR:
308: MKSTR(str,FA0(f)); val = (pointer)str; break;
309: case I_FORMULA:
310: val = FA0(f); break;
311: case I_LIST:
312: evalnodebody((NODE)FA0(f),&tn); MKLIST(t,tn); val = (pointer)t; break;
1.48 noro 313: case I_CONS:
314: evalnodebody((NODE)FA0(f),&tn); a2 = eval(FA1(f));
315: if ( !a2 || OID(a2) != O_LIST )
316: error("cons : invalid argument");
317: for ( tn1 = tn; NEXT(tn1); tn1 = NEXT(tn1) );
318: NEXT(tn1) = BDY((LIST)a2);
319: MKLIST(t,tn); val = (pointer)t;
320: break;
1.1 noro 321: case I_NEWCOMP:
322: newstruct((int)FA0(f),(struct oCOMP **)&val); break;
323: case I_CAR:
324: if ( !(a = eval((FNODE)FA0(f))) || (OID(a) != O_LIST) )
325: val = 0;
326: else if ( !BDY((LIST)a) )
327: val = a;
328: else
329: val = (pointer)BDY(BDY((LIST)a));
330: break;
331: case I_CDR:
332: if ( !(a = eval((FNODE)FA0(f))) || (OID(a) != O_LIST) )
333: val = 0;
334: else if ( !BDY((LIST)a) )
335: val = a;
336: else {
337: MKLIST(t,NEXT(BDY((LIST)a))); val = (pointer)t;
338: }
339: break;
340: case I_INDEX:
341: a = eval((FNODE)FA0(f)); ind = (NODE)FA1(f);
342: evalnodebody(ind,&tn); getarray(a,tn,&val);
343: break;
344: case I_OPT:
345: MKSTR(str,(char *)FA0(f));
346: a = (pointer)eval(FA1(f));
347: tn = mknode(2,str,a);
348: MKLIST(t,tn); val = (pointer)t;
349: break;
350: case I_GETOPT:
351: val = (pointer)getopt_from_cpvs((char *)FA0(f));
1.6 noro 352: break;
353: case I_POINT:
354: a = (pointer)eval(FA0(f));
355: val = (pointer)memberofstruct(a,(char *)FA1(f));
1.1 noro 356: break;
357: default:
358: error("eval : unknown id");
359: break;
360: }
361: return ( val );
1.45 noro 362: }
363:
1.51 noro 364: NODE fnode_to_nary_node(NODE);
365: NODE fnode_to_bin_node(NODE,int);
1.46 noro 366:
1.51 noro 367: FNODE fnode_to_nary(FNODE f)
1.46 noro 368: {
369: FNODE a0,a1,a2;
1.47 noro 370: NODE n,t,t0;
1.46 noro 371: pointer val;
372: char *op;
373:
374: if ( !f )
375: return f;
376: switch ( f->id ) {
1.47 noro 377: case I_NARYOP:
1.51 noro 378: n = fnode_to_nary_node((NODE)FA1(f));
1.47 noro 379: return mkfnode(2,I_NARYOP,FA0(f),n);
380:
1.46 noro 381: case I_BOP:
1.51 noro 382: a1 = fnode_to_nary((FNODE)FA1(f));
383: a2 = fnode_to_nary((FNODE)FA2(f));
1.46 noro 384: op = ((ARF)FA0(f))->name;
385: if ( !strcmp(op,"+") || !strcmp(op,"*") ) {
386: if ( a1->id == I_NARYOP && !strcmp(op,((ARF)FA0(a1))->name) ) {
1.47 noro 387: for ( n = (NODE)FA1(a1); NEXT(n); n = NEXT(n) );
1.46 noro 388: if ( a2->id == I_NARYOP && !strcmp(op,((ARF)FA0(a2))->name) )
1.47 noro 389: NEXT(n) = (NODE)FA1(a2);
1.46 noro 390: else
1.47 noro 391: MKNODE(NEXT(n),a2,0);
1.46 noro 392: return a1;
393: } else if ( a2->id == I_NARYOP && !strcmp(op,((ARF)FA0(a2))->name) ) {
394: MKNODE(t,a1,(NODE)FA1(a2));
1.47 noro 395: return mkfnode(2,I_NARYOP,FA0(f),t);
1.46 noro 396: } else {
397: t = mknode(2,a1,a2);
398: return mkfnode(2,I_NARYOP,FA0(f),t);
399: }
400: } else
401: return mkfnode(3,f->id,FA0(f),a1,a2);
402:
403: case I_NOT: case I_PAREN: case I_MINUS:
404: case I_CAR: case I_CDR:
1.51 noro 405: a0 = fnode_to_nary((FNODE)FA0(f));
1.46 noro 406: return mkfnode(1,f->id,a0);
407:
408: case I_COP: case I_LOP:
1.51 noro 409: a1 = fnode_to_nary((FNODE)FA1(f));
410: a2 = fnode_to_nary((FNODE)FA2(f));
1.46 noro 411: return mkfnode(3,f->id,FA0(f),a1,a2);
412:
413: case I_AND: case I_OR:
1.51 noro 414: a0 = fnode_to_nary((FNODE)FA0(f));
415: a1 = fnode_to_nary((FNODE)FA1(f));
1.46 noro 416: return mkfnode(2,f->id,a0,a1);
417:
418: /* ternary operators */
419: case I_CE:
1.51 noro 420: a0 = fnode_to_nary((FNODE)FA0(f));
421: a1 = fnode_to_nary((FNODE)FA1(f));
422: a2 = fnode_to_nary((FNODE)FA2(f));
1.46 noro 423: return mkfnode(3,f->id,a0,a1,a2);
424: break;
425:
426: /* function */
427: case I_FUNC:
1.51 noro 428: a1 = fnode_to_nary((FNODE)FA1(f));
1.46 noro 429: return mkfnode(2,f->id,FA0(f),a1);
430:
431: case I_LIST: case I_EV:
1.51 noro 432: n = fnode_to_nary_node((NODE)FA0(f));
1.46 noro 433: return mkfnode(1,f->id,n);
434:
435: case I_STR: case I_FORMULA: case I_PVAR:
436: return f;
437:
438: default:
1.51 noro 439: error("fnode_to_nary : not implemented yet");
1.46 noro 440: }
441: }
442:
1.51 noro 443: FNODE fnode_to_bin(FNODE f,int dir)
1.46 noro 444: {
445: FNODE a0,a1,a2;
446: NODE n,t;
447: pointer val;
448: ARF fun;
449: int len,i;
450: FNODE *arg;
451:
452: if ( !f )
453: return f;
454: switch ( f->id ) {
455: case I_NARYOP:
456: fun = (ARF)FA0(f);
457: len = length((NODE)FA1(f));
1.53 noro 458: if ( len==1 ) return BDY((NODE)(FA1(f)));
459:
1.46 noro 460: arg = (FNODE *)ALLOCA(len*sizeof(FNODE));
461: for ( i = 0, t = (NODE)FA1(f); i < len; i++, t = NEXT(t) )
1.51 noro 462: arg[i] = fnode_to_bin((FNODE)BDY(t),dir);
1.46 noro 463: if ( dir ) {
464: a2 = mkfnode(3,I_BOP,fun,arg[len-2],arg[len-1]);
465: for ( i = len-3; i >= 0; i-- )
466: a2 = mkfnode(3,I_BOP,fun,arg[i],a2);
467: } else {
468: a2 = mkfnode(3,I_BOP,fun,arg[0],arg[1]);
469: for ( i = 2; i < len; i++ )
470: a2 = mkfnode(3,I_BOP,fun,a2,arg[i]);
471: }
472: return a2;
473:
474: case I_NOT: case I_PAREN: case I_MINUS:
475: case I_CAR: case I_CDR:
1.51 noro 476: a0 = fnode_to_bin((FNODE)FA0(f),dir);
1.46 noro 477: return mkfnode(1,f->id,a0);
478:
479: case I_BOP: case I_COP: case I_LOP:
1.51 noro 480: a1 = fnode_to_bin((FNODE)FA1(f),dir);
481: a2 = fnode_to_bin((FNODE)FA2(f),dir);
1.46 noro 482: return mkfnode(3,f->id,FA0(f),a1,a2);
483:
484: case I_AND: case I_OR:
1.51 noro 485: a0 = fnode_to_bin((FNODE)FA0(f),dir);
486: a1 = fnode_to_bin((FNODE)FA1(f),dir);
1.46 noro 487: return mkfnode(2,f->id,a0,a1);
488:
489: /* ternary operators */
490: case I_CE:
1.51 noro 491: a0 = fnode_to_bin((FNODE)FA0(f),dir);
492: a1 = fnode_to_bin((FNODE)FA1(f),dir);
493: a2 = fnode_to_bin((FNODE)FA2(f),dir);
1.46 noro 494: return mkfnode(3,f->id,a0,a1,a2);
495: break;
496:
497: /* function */
498: case I_FUNC:
1.51 noro 499: a1 = fnode_to_bin((FNODE)FA1(f),dir);
1.46 noro 500: return mkfnode(2,f->id,FA0(f),a1);
501:
502: case I_LIST: case I_EV:
1.51 noro 503: n = fnode_to_bin_node((NODE)FA0(f),dir);
1.46 noro 504: return mkfnode(1,f->id,n);
505:
506: case I_STR: case I_FORMULA: case I_PVAR:
507: return f;
508:
509: default:
1.51 noro 510: error("fnode_to_bin : not implemented yet");
1.46 noro 511: }
512: }
513:
1.45 noro 514: NODE partial_eval_node(NODE n);
515: FNODE partial_eval(FNODE f);
516:
517: FNODE partial_eval(FNODE f)
518: {
519: FNODE a0,a1,a2;
520: NODE n;
1.55 noro 521: Obj obj;
522: QUOTE q;
1.45 noro 523: pointer val;
1.56 noro 524: FUNC func;
1.45 noro 525:
526: if ( !f )
527: return f;
528: switch ( f->id ) {
529: case I_NOT: case I_PAREN: case I_MINUS:
530: case I_CAR: case I_CDR:
531: a0 = partial_eval((FNODE)FA0(f));
532: return mkfnode(1,f->id,a0);
533:
534: case I_BOP: case I_COP: case I_LOP:
535: a1 = partial_eval((FNODE)FA1(f));
536: a2 = partial_eval((FNODE)FA2(f));
537: return mkfnode(3,f->id,FA0(f),a1,a2);
538:
1.50 noro 539: case I_NARYOP:
540: n = partial_eval_node((NODE)FA1(f));
541: return mkfnode(2,f->id,FA0(f),n);
542:
1.45 noro 543: case I_AND: case I_OR:
544: a0 = partial_eval((FNODE)FA0(f));
545: a1 = partial_eval((FNODE)FA1(f));
546: return mkfnode(2,f->id,a0,a1);
547:
548: /* ternary operators */
549: case I_CE:
550: a0 = partial_eval((FNODE)FA0(f));
551: a1 = partial_eval((FNODE)FA1(f));
552: a2 = partial_eval((FNODE)FA2(f));
553: return mkfnode(3,f->id,a0,a1,a2);
554: break;
555:
1.58 noro 556: /* XXX : function is evaluated with QUOTE args */
557: case I_FUNC:
1.45 noro 558: a1 = partial_eval((FNODE)FA1(f));
1.56 noro 559: func = (FUNC)FA0(f);
1.59 noro 560: if ( func->id == A_UNDEF || func->id != A_USR ) {
1.58 noro 561: a1 = mkfnode(2,I_FUNC,func,a1);
1.56 noro 562: return a1;
1.58 noro 563: } else {
564: n = BDY(eval_arg(a1,(unsigned int)0xffffffff));
565: obj = bevalf(func,n);
1.56 noro 566: objtoquote(obj,&q);
567: return BDY(q);
568: }
1.55 noro 569: break;
1.45 noro 570:
571: case I_LIST: case I_EV:
572: n = partial_eval_node((NODE)FA0(f));
573: return mkfnode(1,f->id,n);
574:
575: case I_STR: case I_FORMULA:
576: return f;
577:
578: /* program variable */
579: case I_PVAR:
580: val = eval(f);
581: if ( val && OID((Obj)val) == O_QUOTE )
582: return partial_eval((FNODE)BDY((QUOTE)val));
583: else
584: return mkfnode(1,I_FORMULA,val);
585:
586: default:
587: error("partial_eval : not implemented yet");
588: }
589: }
590:
591: NODE partial_eval_node(NODE n)
592: {
593: NODE r0,r,t;
594:
595: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
596: NEXTNODE(r0,r);
597: BDY(r) = partial_eval((FNODE)BDY(t));
1.49 noro 598: }
599: if ( r0 ) NEXT(r) = 0;
600: return r0;
601: }
602:
1.57 noro 603: NODE rewrite_fnode_node(NODE n,NODE arg,int qarg);
604: FNODE rewrite_fnode(FNODE f,NODE arg,int qarg);
1.49 noro 605:
1.57 noro 606: FNODE rewrite_fnode(FNODE f,NODE arg,int qarg)
1.49 noro 607: {
608: FNODE a0,a1,a2,value;
609: NODE n,t,pair;
610: pointer val;
611: int pv,ind;
612:
613: if ( !f )
614: return f;
615: switch ( f->id ) {
616: case I_NOT: case I_PAREN: case I_MINUS:
617: case I_CAR: case I_CDR:
1.57 noro 618: a0 = rewrite_fnode((FNODE)FA0(f),arg,qarg);
1.49 noro 619: return mkfnode(1,f->id,a0);
620:
621: case I_BOP: case I_COP: case I_LOP:
1.57 noro 622: a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg);
623: a2 = rewrite_fnode((FNODE)FA2(f),arg,qarg);
1.49 noro 624: return mkfnode(3,f->id,FA0(f),a1,a2);
625:
626: case I_AND: case I_OR:
1.57 noro 627: a0 = rewrite_fnode((FNODE)FA0(f),arg,qarg);
628: a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg);
1.49 noro 629: return mkfnode(2,f->id,a0,a1);
630:
631: /* ternary operators */
632: case I_CE:
1.57 noro 633: a0 = rewrite_fnode((FNODE)FA0(f),arg,qarg);
634: a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg);
635: a2 = rewrite_fnode((FNODE)FA2(f),arg,qarg);
1.49 noro 636: return mkfnode(3,f->id,a0,a1,a2);
637: break;
638:
1.52 noro 639: /* nary operators */
640: case I_NARYOP:
1.57 noro 641: n = rewrite_fnode_node((NODE)FA1(f),arg,qarg);
1.52 noro 642: return mkfnode(2,f->id,FA0(f),n);
643:
644: /* and function */
1.49 noro 645: case I_FUNC:
1.57 noro 646: a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg);
647: return mkfnode(2,qarg?I_FUNC_QARG:f->id,FA0(f),a1);
1.49 noro 648:
649: case I_LIST: case I_EV:
1.57 noro 650: n = rewrite_fnode_node((NODE)FA0(f),arg,qarg);
1.49 noro 651: return mkfnode(1,f->id,n);
652:
653: case I_STR: case I_FORMULA:
654: return f;
655:
656: /* program variable */
657: case I_PVAR:
658: pv = (int)FA0(f);
659: for ( t = arg; t; t = NEXT(t) ) {
660: pair = (NODE)BDY(t);
1.57 noro 661: ind = (int)BDY(pair);
662: value = (FNODE)BDY(NEXT(pair));
1.49 noro 663: if ( pv == ind )
664: return value;
665: }
666: return f;
667: break;
668:
669: default:
670: error("rewrite_fnode : not implemented yet");
671: }
672: }
673:
1.57 noro 674: NODE rewrite_fnode_node(NODE n,NODE arg,int qarg)
1.49 noro 675: {
676: NODE r0,r,t;
677:
678: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
679: NEXTNODE(r0,r);
1.57 noro 680: BDY(r) = rewrite_fnode((FNODE)BDY(t),arg,qarg);
1.46 noro 681: }
682: if ( r0 ) NEXT(r) = 0;
683: return r0;
684: }
685:
1.51 noro 686: NODE fnode_to_nary_node(NODE n)
1.46 noro 687: {
688: NODE r0,r,t;
689:
690: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
691: NEXTNODE(r0,r);
1.51 noro 692: BDY(r) = fnode_to_nary((FNODE)BDY(t));
1.46 noro 693: }
694: if ( r0 ) NEXT(r) = 0;
695: return r0;
696: }
697:
1.51 noro 698: NODE fnode_to_bin_node(NODE n,int dir)
1.46 noro 699: {
700: NODE r0,r,t;
701:
702: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
703: NEXTNODE(r0,r);
1.51 noro 704: BDY(r) = fnode_to_bin((FNODE)BDY(t),dir);
1.45 noro 705: }
706: if ( r0 ) NEXT(r) = 0;
707: return r0;
1.1 noro 708: }
709:
1.43 noro 710: V searchvar(char *name);
711:
1.16 noro 712: pointer evalstat(SNODE f)
1.1 noro 713: {
714: pointer val = 0,t,s,s1;
715: P u;
716: NODE tn;
717: int i,ac;
1.43 noro 718: V v;
1.1 noro 719: V *a;
720: char *buf;
1.43 noro 721: FUNC func;
1.1 noro 722:
723: if ( !f )
724: return ( 0 );
725: if ( nextbp && nextbplevel <= 0 && f->id != S_CPLX ) {
726: nextbp = 0;
727: bp(f);
728: }
729: evalstatline = f->ln;
1.60 noro 730: if ( !PVSS ) at_root = evalstatline;
1.1 noro 731:
732: switch ( f->id ) {
733: case S_BP:
734: if ( !nextbp && (!FA1(f) || eval((FNODE)FA1(f))) ) {
735: if ( (FNODE)FA2(f) ) {
1.20 ohara 736: #if defined(PARI)
1.1 noro 737: pari_outfile = stderr;
738: #endif
739: asir_out = stderr;
740: printexpr(CO,eval((FNODE)FA2(f)));
741: putc('\n',asir_out); fflush(asir_out);
1.20 ohara 742: #if defined(PARI)
1.1 noro 743: pari_outfile = stdout;
744: #endif
745: asir_out = stdout;
746: } else {
747: nextbp = 1; nextbplevel = 0;
748: }
749: }
750: val = evalstat((SNODE)FA0(f));
751: break;
752: case S_PFDEF:
753: ac = argc(FA1(f)); a = (V *)MALLOC(ac*sizeof(V));
754: s = eval((FNODE)FA2(f));
755: buf = (char *)ALLOCA(BUFSIZ);
756: for ( i = 0, tn = (NODE)FA1(f); tn; tn = NEXT(tn), i++ ) {
757: t = eval((FNODE)tn->body); sprintf(buf,"_%s",NAME(VR((P)t)));
758: makevar(buf,&u); a[i] = VR(u);
759: substr(CO,0,(Obj)s,VR((P)t),(Obj)u,(Obj *)&s1); s = s1;
760: }
1.43 noro 761: mkpf((char *)FA0(f),(Obj)s,ac,a,0,0,0,(PF *)&val); val = 0;
762: v = searchvar((char *)FA0(f));
763: if ( v ) {
764: searchpf((char *)FA0(f),&func);
765: makesrvar(func,&u);
766: }
767: break;
1.1 noro 768: case S_SINGLE:
769: val = eval((FNODE)FA0(f)); break;
770: case S_CPLX:
771: for ( tn = (NODE)FA0(f); tn; tn = NEXT(tn) ) {
772: if ( BDY(tn) )
773: val = evalstat((SNODE)BDY(tn));
774: if ( f_break || f_return || f_continue )
775: break;
776: }
777: break;
778: case S_BREAK:
779: if ( GPVS != CPVS )
780: f_break = 1;
781: break;
782: case S_CONTINUE:
783: if ( GPVS != CPVS )
784: f_continue = 1;
785: break;
786: case S_RETURN:
787: if ( GPVS != CPVS ) {
788: val = eval((FNODE)FA0(f)); f_return = 1;
789: }
790: break;
791: case S_IFELSE:
792: if ( evalnode((NODE)FA1(f)) )
793: val = evalstat((SNODE)FA2(f));
794: else if ( FA3(f) )
795: val = evalstat((SNODE)FA3(f));
796: break;
797: case S_FOR:
798: evalnode((NODE)FA1(f));
799: while ( 1 ) {
800: if ( !evalnode((NODE)FA2(f)) )
801: break;
802: val = evalstat((SNODE)FA4(f));
803: if ( f_break || f_return )
804: break;
805: f_continue = 0;
806: evalnode((NODE)FA3(f));
807: }
808: f_break = 0; break;
809: case S_DO:
810: while ( 1 ) {
811: val = evalstat((SNODE)FA1(f));
812: if ( f_break || f_return )
813: break;
814: f_continue = 0;
815: if ( !evalnode((NODE)FA2(f)) )
816: break;
817: }
818: f_break = 0; break;
1.40 noro 819: case S_MODULE:
820: CUR_MODULE = (MODULE)FA0(f);
821: if ( CUR_MODULE )
822: MPVS = CUR_MODULE->pvs;
823: else
824: MPVS = 0;
825: break;
1.1 noro 826: default:
827: error("evalstat : unknown id");
828: break;
829: }
830: return ( val );
831: }
832:
1.16 noro 833: pointer evalnode(NODE node)
1.1 noro 834: {
835: NODE tn;
836: pointer val;
837:
838: for ( tn = node, val = 0; tn; tn = NEXT(tn) )
839: if ( BDY(tn) )
840: val = eval((FNODE)BDY(tn));
841: return ( val );
842: }
843:
844:
1.44 noro 845: LIST eval_arg(FNODE a,unsigned int quote)
846: {
847: LIST l;
848: FNODE fn;
849: NODE n,n0,tn;
850: QUOTE q;
851: int i;
852:
853: for ( tn = (NODE)FA0(a), n0 = 0, i = 0; tn; tn = NEXT(tn), i++ ) {
854: NEXTNODE(n0,n);
855: if ( quote & (1<<i) ) {
856: fn = (FNODE)(BDY(tn));
857: if ( fn->id == I_FORMULA && FA0(fn)
858: && OID((Obj)FA0(fn))== O_QUOTE )
859: BDY(n) = FA0(fn);
860: else {
861: MKQUOTE(q,(FNODE)BDY(tn));
862: BDY(n) = (pointer)q;
863: }
864: } else
865: BDY(n) = eval((FNODE)BDY(tn));
866: }
867: if ( n0 ) NEXT(n) = 0;
868: MKLIST(l,n0);
869: return l;
870: }
871:
1.16 noro 872: pointer evalf(FUNC f,FNODE a,FNODE opt)
1.1 noro 873: {
874: LIST args;
875: pointer val;
876: int i,n,level;
1.30 noro 877: NODE tn,sn,opts,opt1,dmy;
878: VS pvs,prev_mpvs;
1.1 noro 879: char errbuf[BUFSIZ];
1.19 saito 880: static unsigned int stack_size;
1.12 noro 881: static void *stack_base;
1.43 noro 882: FUNC f1;
1.1 noro 883:
884: if ( f->id == A_UNDEF ) {
1.43 noro 885: gen_searchf_searchonly(f->fullname,&f1);
886: if ( f1->id == A_UNDEF ) {
887: sprintf(errbuf,"evalf : %s undefined",NAME(f));
888: error(errbuf);
889: } else
890: *f = *f1;
1.36 noro 891: }
892: if ( getsecuremode() && !PVSS && !f->secure ) {
893: sprintf(errbuf,"evalf : %s not permitted",NAME(f));
1.1 noro 894: error(errbuf);
895: }
896: if ( f->id != A_PARI ) {
897: for ( i = 0, tn = a?(NODE)FA0(a):0; tn; i++, tn = NEXT(tn) );
898: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
899: sprintf(errbuf,"evalf : argument mismatch in %s()",NAME(f));
900: error(errbuf);
901: }
902: }
903: switch ( f->id ) {
904: case A_BIN:
1.30 noro 905: if ( opt ) {
906: opts = BDY((LIST)eval(opt));
907: /* opts = ["opt1",arg1],... */
908: opt1 = BDY((LIST)BDY(opts));
909: if ( !strcmp(BDY((STRING)BDY(opt1)),"option_list") ) {
910: /*
911: * the special option specification:
912: * option_list=[["o1","a1"],...]
913: */
914: asir_assert(BDY(NEXT(opt1)),O_LIST,"evalf");
915: opts = BDY((LIST)BDY(NEXT(opt1)));
916: }
917: } else
918: opts = 0;
1.1 noro 919: if ( !n ) {
920: cur_binf = f;
921: (*f->f.binf)(&val);
922: } else {
1.44 noro 923: args = (LIST)eval_arg(a,f->quote);
1.33 noro 924: current_option = opts;
1.1 noro 925: cur_binf = f;
926: (*f->f.binf)(args?BDY(args):0,&val);
927: }
928: cur_binf = 0;
929: break;
930: case A_PARI:
931: args = (LIST)eval(a);
932: cur_binf = f;
933: val = evalparif(f,args?BDY(args):0);
934: cur_binf = 0;
935: break;
936: case A_USR:
1.12 noro 937: /* stack check */
1.17 noro 938: #if !defined(VISUAL) && !defined(__CYGWIN__)
1.12 noro 939: if ( !stack_size ) {
940: struct rlimit rl;
941: getrlimit(RLIMIT_STACK,&rl);
942: stack_size = rl.rlim_cur;
943: }
1.61 ohara 944: if ( !stack_base ) {
945: #if defined(GC7)
1.65 ohara 946: stack_base = (void *)GC_get_main_stack_base();
1.61 ohara 947: #else
948: stack_base = (void *)GC_get_stack_base();
949: #endif
950: }
1.12 noro 951: if ( (stack_base - (void *)&args) +0x100000 > stack_size )
952: error("stack overflow");
953: #endif
1.44 noro 954: args = (LIST)eval_arg(a,f->quote);
1.11 noro 955: if ( opt ) {
1.1 noro 956: opts = BDY((LIST)eval(opt));
1.11 noro 957: /* opts = ["opt1",arg1],... */
958: opt1 = BDY((LIST)BDY(opts));
959: if ( !strcmp(BDY((STRING)BDY(opt1)),"option_list") ) {
960: /*
961: * the special option specification:
962: * option_list=[["o1","a1"],...]
963: */
964: asir_assert(BDY(NEXT(opt1)),O_LIST,"evalf");
965: opts = BDY((LIST)BDY(NEXT(opt1)));
966: }
967: } else
1.1 noro 968: opts = 0;
969: pvs = f->f.usrf->pvs;
970: if ( PVSS ) {
971: ((VS)BDY(PVSS))->at = evalstatline;
972: level = ((VS)BDY(PVSS))->level+1;
973: } else
974: level = 1;
975: MKNODE(tn,pvs,PVSS); PVSS = tn;
976: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
977: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
978: CPVS->level = level;
979: CPVS->opt = opts;
980: if ( CPVS->n ) {
981: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
982: bcopy((char *)pvs->va,(char *)CPVS->va,
983: (int)(pvs->n*sizeof(struct oPV)));
984: }
985: if ( nextbp )
986: nextbplevel++;
987: for ( tn = f->f.usrf->args, sn = BDY(args);
988: sn; tn = NEXT(tn), sn = NEXT(sn) )
989: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
1.66 noro 990: f_return = f_break = f_continue = 0;
1.21 noro 991: if ( f->f.usrf->module ) {
992: prev_mpvs = MPVS;
993: MPVS = f->f.usrf->module->pvs;
994: val = evalstat((SNODE)BDY(f->f.usrf));
995: MPVS = prev_mpvs;
996: } else
997: val = evalstat((SNODE)BDY(f->f.usrf));
1.1 noro 998: f_return = f_break = f_continue = 0; poppvs();
1.67 ! noro 999: if ( PVSS )
! 1000: evalstatline = ((VS)BDY(PVSS))->at;
1.1 noro 1001: break;
1002: case A_PURE:
1003: args = (LIST)eval(a);
1.44 noro 1004: val = evalpf(f->f.puref,args?BDY(args):0,0);
1.1 noro 1005: break;
1006: default:
1007: sprintf(errbuf,"evalf : %s undefined",NAME(f));
1008: error(errbuf);
1009: break;
1010: }
1011: return val;
1012: }
1013:
1.44 noro 1014: pointer evalf_deriv(FUNC f,FNODE a,FNODE deriv)
1015: {
1016: LIST args,dargs;
1017: pointer val;
1018: char errbuf[BUFSIZ];
1019:
1020: switch ( f->id ) {
1021: case A_PURE:
1022: args = (LIST)eval(a);
1023: dargs = (LIST)eval(deriv);
1024: val = evalpf(f->f.puref,
1025: args?BDY(args):0,dargs?BDY(dargs):0);
1026: break;
1027: default:
1028: sprintf(errbuf,
1029: "evalf : %s is not a pure function",NAME(f));
1030: error(errbuf);
1031: break;
1032: }
1033: return val;
1034: }
1035:
1.16 noro 1036: pointer evalmapf(FUNC f,FNODE a)
1.1 noro 1037: {
1038: LIST args;
1039: NODE node,rest,t,n,r,r0;
1040: Obj head;
1041: VECT v,rv;
1042: MAT m,rm;
1043: LIST rl;
1044: int len,row,col,i,j;
1045: pointer val;
1046:
1.44 noro 1047: args = (LIST)eval_arg(a,f->quote);
1.1 noro 1048: node = BDY(args); head = (Obj)BDY(node); rest = NEXT(node);
1.3 noro 1049: if ( !head ) {
1050: val = bevalf(f,node);
1051: return val;
1052: }
1.1 noro 1053: switch ( OID(head) ) {
1054: case O_VECT:
1055: v = (VECT)head; len = v->len; MKVECT(rv,len);
1056: for ( i = 0; i < len; i++ ) {
1057: MKNODE(t,BDY(v)[i],rest); BDY(rv)[i] = bevalf(f,t);
1058: }
1059: val = (pointer)rv;
1060: break;
1061: case O_MAT:
1062: m = (MAT)head; row = m->row; col = m->col; MKMAT(rm,row,col);
1063: for ( i = 0; i < row; i++ )
1064: for ( j = 0; j < col; j++ ) {
1065: MKNODE(t,BDY(m)[i][j],rest); BDY(rm)[i][j] = bevalf(f,t);
1066: }
1067: val = (pointer)rm;
1068: break;
1069: case O_LIST:
1070: n = BDY((LIST)head);
1071: for ( r0 = r = 0; n; n = NEXT(n) ) {
1072: NEXTNODE(r0,r); MKNODE(t,BDY(n),rest); BDY(r) = bevalf(f,t);
1.9 noro 1073: }
1074: if ( r0 )
1075: NEXT(r) = 0;
1076: MKLIST(rl,r0);
1077: val = (pointer)rl;
1078: break;
1079: default:
1080: val = bevalf(f,node);
1081: break;
1082: }
1083: return val;
1084: }
1085:
1.16 noro 1086: pointer eval_rec_mapf(FUNC f,FNODE a)
1.9 noro 1087: {
1088: LIST args;
1089:
1.44 noro 1090: args = (LIST)eval_arg(a,f->quote);
1.9 noro 1091: return beval_rec_mapf(f,BDY(args));
1092: }
1093:
1.16 noro 1094: pointer beval_rec_mapf(FUNC f,NODE node)
1.9 noro 1095: {
1096: NODE rest,t,n,r,r0;
1097: Obj head;
1098: VECT v,rv;
1099: MAT m,rm;
1100: LIST rl;
1101: int len,row,col,i,j;
1102: pointer val;
1103:
1104: head = (Obj)BDY(node); rest = NEXT(node);
1105: if ( !head ) {
1106: val = bevalf(f,node);
1107: return val;
1108: }
1109: switch ( OID(head) ) {
1110: case O_VECT:
1111: v = (VECT)head; len = v->len; MKVECT(rv,len);
1112: for ( i = 0; i < len; i++ ) {
1113: MKNODE(t,BDY(v)[i],rest); BDY(rv)[i] = beval_rec_mapf(f,t);
1114: }
1115: val = (pointer)rv;
1116: break;
1117: case O_MAT:
1118: m = (MAT)head; row = m->row; col = m->col; MKMAT(rm,row,col);
1119: for ( i = 0; i < row; i++ )
1120: for ( j = 0; j < col; j++ ) {
1121: MKNODE(t,BDY(m)[i][j],rest);
1122: BDY(rm)[i][j] = beval_rec_mapf(f,t);
1123: }
1124: val = (pointer)rm;
1125: break;
1126: case O_LIST:
1127: n = BDY((LIST)head);
1128: for ( r0 = r = 0; n; n = NEXT(n) ) {
1129: NEXTNODE(r0,r); MKNODE(t,BDY(n),rest);
1130: BDY(r) = beval_rec_mapf(f,t);
1.1 noro 1131: }
1132: if ( r0 )
1133: NEXT(r) = 0;
1134: MKLIST(rl,r0);
1135: val = (pointer)rl;
1136: break;
1137: default:
1138: val = bevalf(f,node);
1139: break;
1140: }
1141: return val;
1142: }
1143:
1.16 noro 1144: pointer bevalf(FUNC f,NODE a)
1.1 noro 1145: {
1146: pointer val;
1147: int i,n;
1148: NODE tn,sn;
1.44 noro 1149: VS pvs,prev_mpvs;
1.1 noro 1150: char errbuf[BUFSIZ];
1151:
1152: if ( f->id == A_UNDEF ) {
1153: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
1.37 noro 1154: error(errbuf);
1155: }
1156: if ( getsecuremode() && !PVSS && !f->secure ) {
1157: sprintf(errbuf,"bevalf : %s not permitted",NAME(f));
1.1 noro 1158: error(errbuf);
1159: }
1160: if ( f->id != A_PARI ) {
1161: for ( i = 0, tn = a; tn; i++, tn = NEXT(tn) );
1162: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
1163: sprintf(errbuf,"bevalf : argument mismatch in %s()",NAME(f));
1164: error(errbuf);
1165: }
1166: }
1167: switch ( f->id ) {
1168: case A_BIN:
1169: if ( !n ) {
1170: cur_binf = f;
1171: (*f->f.binf)(&val);
1172: } else {
1173: cur_binf = f;
1174: (*f->f.binf)(a,&val);
1175: }
1176: cur_binf = 0;
1177: break;
1178: case A_PARI:
1179: cur_binf = f;
1180: val = evalparif(f,a);
1181: cur_binf = 0;
1182: break;
1183: case A_USR:
1184: pvs = f->f.usrf->pvs;
1185: if ( PVSS )
1186: ((VS)BDY(PVSS))->at = evalstatline;
1187: MKNODE(tn,pvs,PVSS); PVSS = tn;
1188: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
1189: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
1190: CPVS->opt = 0;
1191: if ( CPVS->n ) {
1192: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
1193: bcopy((char *)pvs->va,(char *)CPVS->va,
1194: (int)(pvs->n*sizeof(struct oPV)));
1195: }
1196: if ( nextbp )
1197: nextbplevel++;
1198: for ( tn = f->f.usrf->args, sn = a;
1199: sn; tn = NEXT(tn), sn = NEXT(sn) )
1200: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
1.66 noro 1201: f_return = f_break = f_continue = 0;
1.39 noro 1202: if ( f->f.usrf->module ) {
1203: prev_mpvs = MPVS;
1204: MPVS = f->f.usrf->module->pvs;
1205: val = evalstat((SNODE)BDY(f->f.usrf));
1206: MPVS = prev_mpvs;
1207: } else
1208: val = evalstat((SNODE)BDY(f->f.usrf));
1.1 noro 1209: f_return = f_break = f_continue = 0; poppvs();
1210: break;
1211: case A_PURE:
1.44 noro 1212: val = evalpf(f->f.puref,a,0);
1.1 noro 1213: break;
1214: default:
1215: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
1216: error(errbuf);
1217: break;
1218: }
1219: return val;
1220: }
1221:
1.64 ohara 1222: pointer bevalf_with_opts(FUNC f,NODE a,NODE opts)
1223: {
1224: pointer val;
1225: int i,n;
1226: NODE tn,sn;
1227: VS pvs,prev_mpvs;
1228: char errbuf[BUFSIZ];
1229:
1230: if ( f->id == A_UNDEF ) {
1231: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
1232: error(errbuf);
1233: }
1234: if ( getsecuremode() && !PVSS && !f->secure ) {
1235: sprintf(errbuf,"bevalf : %s not permitted",NAME(f));
1236: error(errbuf);
1237: }
1238: if ( f->id != A_PARI ) {
1239: for ( i = 0, tn = a; tn; i++, tn = NEXT(tn) );
1240: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
1241: sprintf(errbuf,"bevalf : argument mismatch in %s()",NAME(f));
1242: error(errbuf);
1243: }
1244: }
1245: switch ( f->id ) {
1246: case A_BIN:
1247: current_option = opts;
1248: if ( !n ) {
1249: cur_binf = f;
1250: (*f->f.binf)(&val);
1251: } else {
1252: cur_binf = f;
1253: (*f->f.binf)(a,&val);
1254: }
1255: cur_binf = 0;
1256: break;
1257: case A_PARI:
1258: cur_binf = f;
1259: val = evalparif(f,a);
1260: cur_binf = 0;
1261: break;
1262: case A_USR:
1263: pvs = f->f.usrf->pvs;
1264: if ( PVSS )
1265: ((VS)BDY(PVSS))->at = evalstatline;
1266: MKNODE(tn,pvs,PVSS); PVSS = tn;
1267: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
1268: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
1269: CPVS->opt = opts;
1270: if ( CPVS->n ) {
1271: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
1272: bcopy((char *)pvs->va,(char *)CPVS->va,
1273: (int)(pvs->n*sizeof(struct oPV)));
1274: }
1275: if ( nextbp )
1276: nextbplevel++;
1277: for ( tn = f->f.usrf->args, sn = a;
1278: sn; tn = NEXT(tn), sn = NEXT(sn) )
1279: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
1.66 noro 1280: f_return = f_break = f_continue = 0;
1.64 ohara 1281: if ( f->f.usrf->module ) {
1282: prev_mpvs = MPVS;
1283: MPVS = f->f.usrf->module->pvs;
1284: val = evalstat((SNODE)BDY(f->f.usrf));
1285: MPVS = prev_mpvs;
1286: } else
1287: val = evalstat((SNODE)BDY(f->f.usrf));
1288: f_return = f_break = f_continue = 0; poppvs();
1289: break;
1290: case A_PURE:
1291: val = evalpf(f->f.puref,a,0);
1292: break;
1293: default:
1294: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
1295: error(errbuf);
1296: break;
1297: }
1298: return val;
1299: }
1300:
1.63 noro 1301: pointer evalif(FNODE f,FNODE a,FNODE opt)
1.1 noro 1302: {
1303: Obj g;
1.50 noro 1304: QUOTE q;
1.41 noro 1305: FNODE t;
1.50 noro 1306: LIST l;
1.1 noro 1307:
1308: g = (Obj)eval(f);
1309: if ( g && (OID(g) == O_P) && (VR((P)g)->attr == (pointer)V_SR) )
1.63 noro 1310: return evalf((FUNC)VR((P)g)->priv,a,opt);
1.41 noro 1311: else if ( g && OID(g) == O_QUOTEARG && ((QUOTEARG)g)->type == A_func ) {
1312: t = mkfnode(2,I_FUNC,((QUOTEARG)g)->body,a);
1.50 noro 1313: MKQUOTE(q,t);
1314: return q;
1.41 noro 1315: } else {
1.1 noro 1316: error("invalid function pointer");
1.16 noro 1317: /* NOTREACHED */
1318: return (pointer)-1;
1.1 noro 1319: }
1320: }
1321:
1.44 noro 1322: pointer evalpf(PF pf,NODE args,NODE dargs)
1.1 noro 1323: {
1324: Obj s,s1;
1.54 noro 1325: int i,di,j;
1.44 noro 1326: NODE node,dnode;
1.1 noro 1327: PFINS ins;
1328: PFAD ad;
1329:
1330: if ( !pf->body ) {
1331: ins = (PFINS)CALLOC(1,sizeof(PF)+pf->argc*sizeof(struct oPFAD));
1332: ins->pf = pf;
1.44 noro 1333: for ( i = 0, node = args, dnode = dargs, ad = ins->ad;
1334: node; i++ ) {
1335: ad[i].arg = (Obj)node->body;
1336: if ( !dnode ) ad[i].d = 0;
1337: else
1338: ad[i].d = QTOS((Q)dnode->body);
1339: node = NEXT(node);
1340: if ( dnode ) dnode = NEXT(dnode);
1.1 noro 1341: }
1342: simplify_ins(ins,&s);
1343: } else {
1.54 noro 1344: s = pf->body;
1345: if ( dnode ) {
1346: for ( i = 0, dnode = dargs; dnode; dnode = NEXT(dnode), i++ ) {
1347: di = QTOS((Q)dnode->body);
1348: for ( j = 0; j < di; j++ ) {
1349: derivr(CO,s,pf->args[i],&s1); s = s1;
1350: }
1351: }
1352: }
1353: for ( i = 0, node = args; node; node = NEXT(node), i++ ) {
1.1 noro 1354: substr(CO,0,s,pf->args[i],(Obj)node->body,&s1); s = s1;
1355: }
1356: }
1357: return (pointer)s;
1358: }
1359:
1.16 noro 1360: void evalnodebody(NODE sn,NODE *dnp)
1.1 noro 1361: {
1362: NODE n,n0,tn;
1363: int line;
1364:
1365: if ( !sn ) {
1366: *dnp = 0;
1367: return;
1368: }
1369: line = evalstatline;
1370: for ( tn = sn, n0 = 0; tn; tn = NEXT(tn) ) {
1371: NEXTNODE(n0,n);
1372: BDY(n) = eval((FNODE)BDY(tn));
1373: evalstatline = line;
1374: }
1375: NEXT(n) = 0; *dnp = n0;
1376: }
1377:
1.21 noro 1378: MODULE searchmodule(char *name)
1379: {
1380: MODULE mod;
1381: NODE m;
1382:
1383: for ( m = MODULE_LIST; m; m = NEXT(m) ) {
1384: mod = (MODULE)BDY(m);
1385: if ( !strcmp(mod->name,name) )
1386: return mod;
1387: }
1388: return 0;
1389: }
1.24 noro 1390: /*
1391: * xxx.yyy() is searched in the flist
1392: * of the module xxx.
1393: * yyy() is searched in the global flist.
1394: */
1.21 noro 1395:
1.22 noro 1396: void searchuf(char *name,FUNC *r)
1397: {
1398: MODULE mod;
1399: char *name0,*dot;
1400:
1401: if ( dot = strchr(name,'.') ) {
1402: name0 = (char *)ALLOCA(strlen(name)+1);
1403: strcpy(name0,name);
1404: dot = strchr(name0,'.');
1405: *dot = 0;
1406: mod = searchmodule(name0);
1407: if ( mod )
1408: searchf(mod->usrf_list,dot+1,r);
1409: } else
1410: searchf(usrf,name,r);
1411: }
1412:
1.16 noro 1413: void gen_searchf(char *name,FUNC *r)
1.12 noro 1414: {
1.21 noro 1415: FUNC val = 0;
1.29 noro 1416: int global = 0;
1417: if ( *name == ':' ) {
1418: global = 1;
1419: name += 2;
1420: }
1421: if ( CUR_MODULE && !global )
1.21 noro 1422: searchf(CUR_MODULE->usrf_list,name,&val);
1.25 noro 1423: if ( !val )
1424: searchf(sysf,name,&val);
1425: if ( !val )
1426: searchf(ubinf,name,&val);
1427: if ( !val )
1428: searchpf(name,&val);
1429: if ( !val )
1430: searchuf(name,&val);
1431: if ( !val )
1432: appenduf(name,&val);
1.34 noro 1433: *r = val;
1434: }
1435:
1436: void gen_searchf_searchonly(char *name,FUNC *r)
1437: {
1438: FUNC val = 0;
1439: int global = 0;
1440: if ( *name == ':' ) {
1441: global = 1;
1442: name += 2;
1443: }
1444: if ( CUR_MODULE && !global )
1445: searchf(CUR_MODULE->usrf_list,name,&val);
1446: if ( !val )
1447: searchf(sysf,name,&val);
1448: if ( !val )
1449: searchf(ubinf,name,&val);
1450: if ( !val )
1451: searchpf(name,&val);
1452: if ( !val )
1453: searchuf(name,&val);
1.12 noro 1454: *r = val;
1455: }
1456:
1.16 noro 1457: void searchf(NODE fn,char *name,FUNC *r)
1.1 noro 1458: {
1459: NODE tn;
1460:
1461: for ( tn = fn;
1462: tn && strcmp(NAME((FUNC)BDY(tn)),name); tn = NEXT(tn) );
1463: if ( tn ) {
1464: *r = (FUNC)BDY(tn);
1465: return;
1466: }
1467: *r = 0;
1468: }
1469:
1.22 noro 1470: MODULE mkmodule(char *);
1471:
1.16 noro 1472: void appenduf(char *name,FUNC *r)
1.1 noro 1473: {
1474: NODE tn;
1475: FUNC f;
1.22 noro 1476: int len;
1477: MODULE mod;
1478: char *modname,*fname,*dot;
1.1 noro 1479:
1480: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1.22 noro 1481: f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
1482: if ( dot = strchr(name,'.') ) {
1.28 noro 1483: /* undefined function in a module */
1.22 noro 1484: len = dot-name;
1485: modname = (char *)MALLOC_ATOMIC(len+1);
1486: strncpy(modname,name,len); modname[len] = 0;
1487: fname = (char *)MALLOC_ATOMIC(strlen(name)-len+1);
1488: strcpy(fname,dot+1);
1489: f->name = fname;
1.25 noro 1490: f->fullname = name;
1.28 noro 1491: mod = searchmodule(modname);
1492: if ( !mod )
1493: mod = mkmodule(modname);
1494: MKNODE(tn,f,mod->usrf_list); mod->usrf_list = tn;
1.21 noro 1495: } else {
1.22 noro 1496: f->name = name;
1.25 noro 1497: f->fullname = name;
1498: MKNODE(tn,f,usrf); usrf = tn;
1.21 noro 1499: }
1.1 noro 1500: *r = f;
1501: }
1502:
1.25 noro 1503: void appenduf_local(char *name,FUNC *r)
1.24 noro 1504: {
1505: NODE tn;
1506: FUNC f;
1.25 noro 1507: MODULE mod;
1.24 noro 1508:
1.27 noro 1509: for ( tn = CUR_MODULE->usrf_list; tn; tn = NEXT(tn) )
1510: if ( !strcmp(((FUNC)BDY(tn))->name,name) )
1511: break;
1512: if ( tn )
1513: return;
1514:
1.24 noro 1515: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1516: f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
1.25 noro 1517: f->name = name;
1518: f->fullname =
1519: (char *)MALLOC_ATOMIC(strlen(CUR_MODULE->name)+strlen(name)+1);
1520: sprintf(f->fullname,"%s.%s",CUR_MODULE->name,name);
1521: MKNODE(tn,f,CUR_MODULE->usrf_list); CUR_MODULE->usrf_list = tn;
1.24 noro 1522: *r = f;
1523: }
1524:
1.25 noro 1525: void appenduflist(NODE n)
1526: {
1527: NODE tn;
1528: FUNC f;
1529:
1530: for ( tn = n; tn; tn = NEXT(tn) )
1531: appenduf_local((char *)BDY(tn),&f);
1532: }
1533:
1.16 noro 1534: void mkparif(char *name,FUNC *r)
1.1 noro 1535: {
1536: FUNC f;
1537:
1538: *r = f =(FUNC)MALLOC(sizeof(struct oFUNC));
1539: f->name = name; f->id = A_PARI; f->argc = 0; f->f.binf = 0;
1.27 noro 1540: f->fullname = name;
1.1 noro 1541: }
1542:
1.21 noro 1543: void mkuf(char *name,char *fname,NODE args,SNODE body,int startl,int endl,char *desc,MODULE module)
1.1 noro 1544: {
1545: FUNC f;
1546: USRF t;
1.21 noro 1547: NODE usrf_list,sn,tn;
1.1 noro 1548: FNODE fn;
1.21 noro 1549: char *longname;
1.1 noro 1550: int argc;
1551:
1.38 noro 1552: if ( getsecuremode() ) {
1553: error("defining function is not permitted in the secure mode");
1554: }
1.29 noro 1555: if ( *name == ':' )
1556: name += 2;
1.21 noro 1557: if ( !module ) {
1558: searchf(sysf,name,&f);
1559: if ( f ) {
1560: fprintf(stderr,"def : builtin function %s() cannot be redefined.\n",name);
1561: CPVS = GPVS; return;
1562: }
1.1 noro 1563: }
1564: for ( argc = 0, sn = args; sn; argc++, sn = NEXT(sn) ) {
1565: fn = (FNODE)BDY(sn);
1566: if ( !fn || ID(fn) != I_PVAR ) {
1567: fprintf(stderr,"illegal argument in %s()\n",name);
1568: CPVS = GPVS; return;
1569: }
1570: }
1.21 noro 1571: usrf_list = module ? module->usrf_list : usrf;
1572: for ( sn = usrf_list; sn && strcmp(NAME((FUNC)BDY(sn)),name); sn = NEXT(sn) );
1.1 noro 1573: if ( sn )
1574: f = (FUNC)BDY(sn);
1575: else {
1576: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1577: f->name = name;
1.21 noro 1578: MKNODE(tn,f,usrf_list); usrf_list = tn;
1.25 noro 1579: if ( module ) {
1580: f->fullname =
1581: (char *)MALLOC_ATOMIC(strlen(f->name)+strlen(module->name)+1);
1582: sprintf(f->fullname,"%s.%s",module->name,f->name);
1.21 noro 1583: module->usrf_list = usrf_list;
1.25 noro 1584: } else {
1585: f->fullname = f->name;
1.21 noro 1586: usrf = usrf_list;
1.25 noro 1587: }
1.21 noro 1588: }
1589: if ( Verbose && f->id != A_UNDEF ) {
1590: if ( module )
1591: fprintf(stderr,"Warning : %s.%s() redefined.\n",module->name,name);
1592: else
1593: fprintf(stderr,"Warning : %s() redefined.\n",name);
1.1 noro 1594: }
1595: t=(USRF)MALLOC(sizeof(struct oUSRF));
1596: t->args=args; BDY(t)=body; t->pvs = CPVS; t->fname = fname;
1.21 noro 1597: t->startl = startl; t->endl = endl; t->module = module;
1.1 noro 1598: t->desc = desc;
1599: f->id = A_USR; f->argc = argc; f->f.usrf = t;
1600: CPVS = GPVS;
1.24 noro 1601: CUR_FUNC = 0;
1.1 noro 1602: clearbp(f);
1603: }
1604:
1605: /*
1606: retrieve value of an option whose key matches 'key'
1607: CVS->opt is a list(node) of key-value pair (list)
1608: CVS->opt = BDY([[key,value],[key,value],...])
1609: */
1610:
1.16 noro 1611: Obj getopt_from_cpvs(char *key)
1.1 noro 1612: {
1613: NODE opts,opt;
1.12 noro 1614: LIST r;
1.1 noro 1615: extern Obj VOIDobj;
1616:
1617: opts = CPVS->opt;
1.12 noro 1618: if ( !key ) {
1619: MKLIST(r,opts);
1620: return (Obj)r;
1621: } else {
1622: for ( ; opts; opts = NEXT(opts) ) {
1623: asir_assert(BDY(opts),O_LIST,"getopt_from_cvps");
1624: opt = BDY((LIST)BDY(opts));
1625: if ( !strcmp(key,BDY((STRING)BDY(opt))) )
1626: return (Obj)BDY(NEXT(opt));
1627: }
1628: return VOIDobj;
1.1 noro 1629: }
1630:
1.21 noro 1631: }
1632:
1633: MODULE mkmodule(char *name)
1634: {
1635: MODULE mod;
1636: NODE m;
1637: int len;
1638: VS mpvs;
1639:
1640: for ( m = MODULE_LIST; m; m = NEXT(m) ) {
1641: mod = (MODULE)m->body;
1642: if ( !strcmp(mod->name,name) )
1643: break;
1644: }
1645: if ( m )
1646: return mod;
1647: else {
1648: mod = (MODULE)MALLOC(sizeof(struct oMODULE));
1649: len = strlen(name);
1650: mod->name = (char *)MALLOC_ATOMIC(len+1);
1651: strcpy(mod->name,name);
1652: mod->pvs = mpvs = (VS)MALLOC(sizeof(struct oVS));
1653: reallocarray((char **)&mpvs->va,(int *)&mpvs->asize,
1654: (int *)&mpvs->n,(int)sizeof(struct oPV));
1655: mod->usrf_list = 0;
1656: MKNODE(m,mod,MODULE_LIST);
1657: MODULE_LIST = m;
1658: return mod;
1659: }
1.23 noro 1660: }
1661:
1.24 noro 1662: void print_crossref(FUNC f)
1663: {
1.26 takayama 1664: FUNC r;
1665: if ( show_crossref && CUR_FUNC ) {
1666: searchuf(f->fullname,&r);
1667: if (r != NULL) {
1668: fprintf(asir_out,"%s() at line %d in %s()\n",
1669: f->fullname, asir_infile->ln, CUR_FUNC);
1670: }
1671: }
1.1 noro 1672: }