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