![[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.9 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.8 2000/12/05 01:24:56 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.2 noro 57: #if PARI
1.1 noro 58: #include "genpari.h"
1.2 noro 59: #endif
1.1 noro 60:
61: extern jmp_buf timer_env;
62:
63: int f_break,f_return,f_continue;
64: int evalstatline;
65: int recv_intr;
66:
67: pointer bevalf(), evalmapf(), evall();
1.9 ! noro 68: pointer eval_rec_mapf(), beval_rec_mapf();
1.1 noro 69: Obj getopt_from_cpvs();
70:
71: pointer eval(f)
72: FNODE f;
73: {
74: LIST t;
75: STRING str;
76: pointer val = 0;
77: pointer a,a1,a2;
78: NODE tn,ind;
79: R u;
80: DP dp;
81: int pv,c;
82: FNODE f1;
83: UP2 up2;
84: UP up;
85: GF2N gf2n;
86: GFPN gfpn;
87:
88: #if defined(VISUAL)
89: if ( recv_intr ) {
90: #include <signal.h>
91: if ( recv_intr == 1 ) {
92: recv_intr = 0;
93: int_handler(SIGINT);
94: } else {
95: recv_intr = 0;
96: ox_usr1_handler(0);
97: }
98: }
99: #endif
100: if ( !f )
101: return ( 0 );
102: switch ( f->id ) {
103: case I_BOP:
104: a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f));
105: (*((ARF)FA0(f))->fp)(CO,a1,a2,&val);
106: break;
107: case I_COP:
108: a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f));
109: c = arf_comp(CO,a1,a2);
110: switch ( (cid)FA0(f) ) {
111: case C_EQ:
112: c = (c == 0); break;
113: case C_NE:
114: c = (c != 0); break;
115: case C_GT:
116: c = (c > 0); break;
117: case C_LT:
118: c = (c < 0); break;
119: case C_GE:
120: c = (c >= 0); break;
121: case C_LE:
122: c = (c <= 0); break;
123: default:
124: c = 0; break;
125: }
126: if ( c )
127: val = (pointer)ONE;
128: break;
129: case I_AND:
130: if ( eval((FNODE)FA0(f)) && eval((FNODE)FA1(f)) )
131: val = (pointer)ONE;
132: break;
133: case I_OR:
134: if ( eval((FNODE)FA0(f)) || eval((FNODE)FA1(f)) )
135: val = (pointer)ONE;
136: break;
137: case I_NOT:
138: if ( eval((FNODE)FA0(f)) )
139: val = 0;
140: else
141: val = (pointer)ONE;
142: break;
143: case I_LOP:
144: a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f));
145: val = evall((lid)FA0(f),a1,a2);
146: break;
147: case I_CE:
148: if ( eval((FNODE)FA0(f)) )
149: val = eval((FNODE)FA1(f));
150: else
151: val = eval((FNODE)FA2(f));
152: break;
153: case I_EV:
154: evalnodebody((NODE)FA0(f),&tn); nodetod(tn,&dp); val = (pointer)dp;
155: break;
156: case I_FUNC:
157: val = evalf((FUNC)FA0(f),(FNODE)FA1(f),0); break;
158: case I_FUNC_OPT:
159: val = evalf((FUNC)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break;
160: case I_PFDERIV:
161: error("eval : not implemented yet");
162: break;
163: case I_MAP:
164: val = evalmapf((FUNC)FA0(f),(FNODE)FA1(f)); break;
1.9 ! noro 165: case I_RECMAP:
! 166: val = eval_rec_mapf((FUNC)FA0(f),(FNODE)FA1(f)); break;
1.1 noro 167: case I_IFUNC:
168: val = evalif((FNODE)FA0(f),(FNODE)FA1(f)); break;
169: #if !defined(VISUAL)
170: case I_TIMER:
171: {
172: int interval;
173: Obj expired;
174:
175: interval = QTOS((Q)eval((FNODE)FA0(f)));
176: expired = (Obj)eval((FNODE)FA2(f));
177: set_timer(interval);
178: savepvs();
179: if ( !setjmp(timer_env) )
180: val = eval((FNODE)FA1(f));
181: else {
182: val = (pointer)expired;
183: restorepvs();
184: }
185: reset_timer();
186: }
187: break;
188: #endif
189: case I_PRESELF:
190: f1 = (FNODE)FA1(f);
191: if ( ID(f1) == I_PVAR ) {
192: pv = (int)FA0(f1); ind = (NODE)FA1(f1); GETPV(pv,a);
193: if ( !ind ) {
194: (*((ARF)FA0(f))->fp)(CO,a,ONE,&val); ASSPV(pv,val);
195: } else if ( a ) {
196: evalnodebody(ind,&tn); getarray(a,tn,(pointer *)&u);
197: (*((ARF)FA0(f))->fp)(CO,u,ONE,&val); putarray(a,tn,val);
198: }
199: } else
1.6 noro 200: error("++ : not implemented yet");
1.1 noro 201: break;
202: case I_POSTSELF:
203: f1 = (FNODE)FA1(f);
204: if ( ID(f1) == I_PVAR ) {
205: pv = (int)FA0(f1); ind = (NODE)FA1(f1); GETPV(pv,val);
206: if ( !ind ) {
207: (*((ARF)FA0(f))->fp)(CO,val,ONE,&u); ASSPV(pv,u);
208: } else if ( val ) {
209: evalnodebody(ind,&tn); getarray(val,tn,&a);
210: (*((ARF)FA0(f))->fp)(CO,a,ONE,&u); putarray(val,tn,(pointer)u);
211: val = a;
212: }
213: } else
1.6 noro 214: error("-- : not implemented yet");
1.1 noro 215: break;
216: case I_PVAR:
217: pv = (int)FA0(f); ind = (NODE)FA1(f); GETPV(pv,a);
218: if ( !ind )
219: val = a;
220: else {
221: evalnodebody(ind,&tn); getarray(a,tn,&val);
222: }
223: break;
224: case I_ASSPVAR:
225: f1 = (FNODE)FA0(f);
226: if ( ID(f1) == I_PVAR ) {
227: pv = (int)FA0(f1); ind = (NODE)FA1(f1);
228: if ( !ind ) {
229: val = eval((FNODE)FA1(f)); ASSPV(pv,val);
230: } else {
231: GETPV(pv,a);
232: evalnodebody(ind,&tn);
233: putarray(a,tn,val = eval((FNODE)FA1(f)));
234: }
1.6 noro 235: } else if ( ID(f1) == I_POINT ) {
236: /* f1 <-> FA0(f1)->FA1(f1) */
237: a = eval(FA0(f1));
1.7 noro 238: assign_to_member(a,(char *)FA1(f1),val = eval((FNODE)FA1(f)));
239: } else if ( ID(f1) == I_INDEX ) {
240: /* f1 <-> FA0(f1)[FA1(f1)] */
241: a = eval((FNODE)FA0(f1)); ind = (NODE)FA1(f1);
242: evalnodebody(ind,&tn);
243: putarray(a,tn,val = eval((FNODE)FA1(f)));
1.6 noro 244: }
1.1 noro 245: break;
246: case I_ANS:
247: if ( (pv =(int)FA0(f)) < (int)APVS->n )
248: val = APVS->va[pv].priv;
249: break;
250: case I_GF2NGEN:
251: NEWUP2(up2,1);
252: up2->w=1;
253: up2->b[0] = 2; /* @ */
254: MKGF2N(up2,gf2n);
255: val = (pointer)gf2n;
256: break;
257: case I_GFPNGEN:
258: up = UPALLOC(1);
259: up->d=1;
260: up->c[0] = 0;
261: up->c[1] = (Num)ONELM;
262: MKGFPN(up,gfpn);
263: val = (pointer)gfpn;
264: break;
265: case I_STR:
266: MKSTR(str,FA0(f)); val = (pointer)str; break;
267: case I_FORMULA:
268: val = FA0(f); break;
269: case I_LIST:
270: evalnodebody((NODE)FA0(f),&tn); MKLIST(t,tn); val = (pointer)t; break;
271: case I_NEWCOMP:
272: newstruct((int)FA0(f),(struct oCOMP **)&val); break;
273: case I_CAR:
274: if ( !(a = eval((FNODE)FA0(f))) || (OID(a) != O_LIST) )
275: val = 0;
276: else if ( !BDY((LIST)a) )
277: val = a;
278: else
279: val = (pointer)BDY(BDY((LIST)a));
280: break;
281: case I_CDR:
282: if ( !(a = eval((FNODE)FA0(f))) || (OID(a) != O_LIST) )
283: val = 0;
284: else if ( !BDY((LIST)a) )
285: val = a;
286: else {
287: MKLIST(t,NEXT(BDY((LIST)a))); val = (pointer)t;
288: }
289: break;
290: case I_PROC:
291: val = (pointer)FA0(f); break;
292: case I_INDEX:
293: a = eval((FNODE)FA0(f)); ind = (NODE)FA1(f);
294: evalnodebody(ind,&tn); getarray(a,tn,&val);
295: break;
296: case I_OPT:
297: MKSTR(str,(char *)FA0(f));
298: a = (pointer)eval(FA1(f));
299: tn = mknode(2,str,a);
300: MKLIST(t,tn); val = (pointer)t;
301: break;
302: case I_GETOPT:
303: val = (pointer)getopt_from_cpvs((char *)FA0(f));
1.6 noro 304: break;
305: case I_POINT:
306: a = (pointer)eval(FA0(f));
307: val = (pointer)memberofstruct(a,(char *)FA1(f));
1.1 noro 308: break;
309: default:
310: error("eval : unknown id");
311: break;
312: }
313: return ( val );
314: }
315:
316: pointer evalstat(f)
317: SNODE f;
318: {
319: pointer val = 0,t,s,s1;
320: P u;
321: NODE tn;
322: int i,ac;
323: V *a;
324: char *buf;
325:
326: if ( !f )
327: return ( 0 );
328: if ( nextbp && nextbplevel <= 0 && f->id != S_CPLX ) {
329: nextbp = 0;
330: bp(f);
331: }
332: evalstatline = f->ln;
333:
334: switch ( f->id ) {
335: case S_BP:
336: if ( !nextbp && (!FA1(f) || eval((FNODE)FA1(f))) ) {
337: if ( (FNODE)FA2(f) ) {
338: #if PARI
339: pari_outfile = stderr;
340: #endif
341: asir_out = stderr;
342: printexpr(CO,eval((FNODE)FA2(f)));
343: putc('\n',asir_out); fflush(asir_out);
344: #if PARI
345: pari_outfile = stdout;
346: #endif
347: asir_out = stdout;
348: } else {
349: nextbp = 1; nextbplevel = 0;
350: }
351: }
352: val = evalstat((SNODE)FA0(f));
353: break;
354: case S_PFDEF:
355: ac = argc(FA1(f)); a = (V *)MALLOC(ac*sizeof(V));
356: s = eval((FNODE)FA2(f));
357: buf = (char *)ALLOCA(BUFSIZ);
358: for ( i = 0, tn = (NODE)FA1(f); tn; tn = NEXT(tn), i++ ) {
359: t = eval((FNODE)tn->body); sprintf(buf,"_%s",NAME(VR((P)t)));
360: makevar(buf,&u); a[i] = VR(u);
361: substr(CO,0,(Obj)s,VR((P)t),(Obj)u,(Obj *)&s1); s = s1;
362: }
363: mkpf((char *)FA0(f),(Obj)s,ac,a,0,0,0,(PF *)&val); val = 0; break;
364: case S_SINGLE:
365: val = eval((FNODE)FA0(f)); break;
366: case S_CPLX:
367: for ( tn = (NODE)FA0(f); tn; tn = NEXT(tn) ) {
368: if ( BDY(tn) )
369: val = evalstat((SNODE)BDY(tn));
370: if ( f_break || f_return || f_continue )
371: break;
372: }
373: break;
374: case S_BREAK:
375: if ( GPVS != CPVS )
376: f_break = 1;
377: break;
378: case S_CONTINUE:
379: if ( GPVS != CPVS )
380: f_continue = 1;
381: break;
382: case S_RETURN:
383: if ( GPVS != CPVS ) {
384: val = eval((FNODE)FA0(f)); f_return = 1;
385: }
386: break;
387: case S_IFELSE:
388: if ( evalnode((NODE)FA1(f)) )
389: val = evalstat((SNODE)FA2(f));
390: else if ( FA3(f) )
391: val = evalstat((SNODE)FA3(f));
392: break;
393: case S_FOR:
394: evalnode((NODE)FA1(f));
395: while ( 1 ) {
396: if ( !evalnode((NODE)FA2(f)) )
397: break;
398: val = evalstat((SNODE)FA4(f));
399: if ( f_break || f_return )
400: break;
401: f_continue = 0;
402: evalnode((NODE)FA3(f));
403: }
404: f_break = 0; break;
405: case S_DO:
406: while ( 1 ) {
407: val = evalstat((SNODE)FA1(f));
408: if ( f_break || f_return )
409: break;
410: f_continue = 0;
411: if ( !evalnode((NODE)FA2(f)) )
412: break;
413: }
414: f_break = 0; break;
415: default:
416: error("evalstat : unknown id");
417: break;
418: }
419: return ( val );
420: }
421:
422: pointer evalnode(node)
423: NODE node;
424: {
425: NODE tn;
426: pointer val;
427:
428: for ( tn = node, val = 0; tn; tn = NEXT(tn) )
429: if ( BDY(tn) )
430: val = eval((FNODE)BDY(tn));
431: return ( val );
432: }
433:
434: extern FUNC cur_binf;
435: extern NODE PVSS;
436:
437: pointer evalf(f,a,opt)
438: FUNC f;
439: FNODE a;
440: FNODE opt;
441: {
442: LIST args;
443: pointer val;
444: int i,n,level;
445: NODE tn,sn,opts;
446: VS pvs;
447: char errbuf[BUFSIZ];
448:
449: if ( f->id == A_UNDEF ) {
450: sprintf(errbuf,"evalf : %s undefined",NAME(f));
451: error(errbuf);
452: }
453: if ( f->id != A_PARI ) {
454: for ( i = 0, tn = a?(NODE)FA0(a):0; tn; i++, tn = NEXT(tn) );
455: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
456: sprintf(errbuf,"evalf : argument mismatch in %s()",NAME(f));
457: error(errbuf);
458: }
459: }
460: switch ( f->id ) {
461: case A_BIN:
462: if ( !n ) {
463: cur_binf = f;
464: (*f->f.binf)(&val);
465: } else {
466: args = (LIST)eval(a);
467: cur_binf = f;
468: (*f->f.binf)(args?BDY(args):0,&val);
469: }
470: cur_binf = 0;
471: break;
472: case A_PARI:
473: args = (LIST)eval(a);
474: cur_binf = f;
475: val = evalparif(f,args?BDY(args):0);
476: cur_binf = 0;
477: break;
478: case A_USR:
479: args = (LIST)eval(a);
480: if ( opt )
481: opts = BDY((LIST)eval(opt));
482: else
483: opts = 0;
484: pvs = f->f.usrf->pvs;
485: if ( PVSS ) {
486: ((VS)BDY(PVSS))->at = evalstatline;
487: level = ((VS)BDY(PVSS))->level+1;
488: } else
489: level = 1;
490: MKNODE(tn,pvs,PVSS); PVSS = tn;
491: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
492: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
493: CPVS->level = level;
494: CPVS->opt = opts;
495: if ( CPVS->n ) {
496: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
497: bcopy((char *)pvs->va,(char *)CPVS->va,
498: (int)(pvs->n*sizeof(struct oPV)));
499: }
500: if ( nextbp )
501: nextbplevel++;
502: for ( tn = f->f.usrf->args, sn = BDY(args);
503: sn; tn = NEXT(tn), sn = NEXT(sn) )
504: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
505: val = evalstat((SNODE)BDY(f->f.usrf));
506: f_return = f_break = f_continue = 0; poppvs();
507: break;
508: case A_PURE:
509: args = (LIST)eval(a);
510: val = evalpf(f->f.puref,args?BDY(args):0);
511: break;
512: default:
513: sprintf(errbuf,"evalf : %s undefined",NAME(f));
514: error(errbuf);
515: break;
516: }
517: return val;
518: }
519:
520: pointer evalmapf(f,a)
521: FUNC f;
522: FNODE a;
523: {
524: LIST args;
525: NODE node,rest,t,n,r,r0;
526: Obj head;
527: VECT v,rv;
528: MAT m,rm;
529: LIST rl;
530: int len,row,col,i,j;
531: pointer val;
532:
533: args = (LIST)eval(a);
534: node = BDY(args); head = (Obj)BDY(node); rest = NEXT(node);
1.3 noro 535: if ( !head ) {
536: val = bevalf(f,node);
537: return val;
538: }
1.1 noro 539: switch ( OID(head) ) {
540: case O_VECT:
541: v = (VECT)head; len = v->len; MKVECT(rv,len);
542: for ( i = 0; i < len; i++ ) {
543: MKNODE(t,BDY(v)[i],rest); BDY(rv)[i] = bevalf(f,t);
544: }
545: val = (pointer)rv;
546: break;
547: case O_MAT:
548: m = (MAT)head; row = m->row; col = m->col; MKMAT(rm,row,col);
549: for ( i = 0; i < row; i++ )
550: for ( j = 0; j < col; j++ ) {
551: MKNODE(t,BDY(m)[i][j],rest); BDY(rm)[i][j] = bevalf(f,t);
552: }
553: val = (pointer)rm;
554: break;
555: case O_LIST:
556: n = BDY((LIST)head);
557: for ( r0 = r = 0; n; n = NEXT(n) ) {
558: NEXTNODE(r0,r); MKNODE(t,BDY(n),rest); BDY(r) = bevalf(f,t);
1.9 ! noro 559: }
! 560: if ( r0 )
! 561: NEXT(r) = 0;
! 562: MKLIST(rl,r0);
! 563: val = (pointer)rl;
! 564: break;
! 565: default:
! 566: val = bevalf(f,node);
! 567: break;
! 568: }
! 569: return val;
! 570: }
! 571:
! 572: pointer eval_rec_mapf(f,a)
! 573: FUNC f;
! 574: FNODE a;
! 575: {
! 576: LIST args;
! 577:
! 578: args = (LIST)eval(a);
! 579: return beval_rec_mapf(f,BDY(args));
! 580: }
! 581:
! 582: pointer beval_rec_mapf(f,node)
! 583: FUNC f;
! 584: NODE node;
! 585: {
! 586: LIST args;
! 587: NODE rest,t,n,r,r0;
! 588: Obj head;
! 589: VECT v,rv;
! 590: MAT m,rm;
! 591: LIST rl;
! 592: int len,row,col,i,j;
! 593: pointer val;
! 594:
! 595: head = (Obj)BDY(node); rest = NEXT(node);
! 596: if ( !head ) {
! 597: val = bevalf(f,node);
! 598: return val;
! 599: }
! 600: switch ( OID(head) ) {
! 601: case O_VECT:
! 602: v = (VECT)head; len = v->len; MKVECT(rv,len);
! 603: for ( i = 0; i < len; i++ ) {
! 604: MKNODE(t,BDY(v)[i],rest); BDY(rv)[i] = beval_rec_mapf(f,t);
! 605: }
! 606: val = (pointer)rv;
! 607: break;
! 608: case O_MAT:
! 609: m = (MAT)head; row = m->row; col = m->col; MKMAT(rm,row,col);
! 610: for ( i = 0; i < row; i++ )
! 611: for ( j = 0; j < col; j++ ) {
! 612: MKNODE(t,BDY(m)[i][j],rest);
! 613: BDY(rm)[i][j] = beval_rec_mapf(f,t);
! 614: }
! 615: val = (pointer)rm;
! 616: break;
! 617: case O_LIST:
! 618: n = BDY((LIST)head);
! 619: for ( r0 = r = 0; n; n = NEXT(n) ) {
! 620: NEXTNODE(r0,r); MKNODE(t,BDY(n),rest);
! 621: BDY(r) = beval_rec_mapf(f,t);
1.1 noro 622: }
623: if ( r0 )
624: NEXT(r) = 0;
625: MKLIST(rl,r0);
626: val = (pointer)rl;
627: break;
628: default:
629: val = bevalf(f,node);
630: break;
631: }
632: return val;
633: }
634:
635: pointer bevalf(f,a)
636: FUNC f;
637: NODE a;
638: {
639: pointer val;
640: int i,n;
641: NODE tn,sn;
642: VS pvs;
643: struct oLIST list;
644: struct oFNODE fnode;
645: char errbuf[BUFSIZ];
646:
647: if ( f->id == A_UNDEF ) {
648: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
649: error(errbuf);
650: }
651: if ( f->id != A_PARI ) {
652: for ( i = 0, tn = a; tn; i++, tn = NEXT(tn) );
653: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
654: sprintf(errbuf,"bevalf : argument mismatch in %s()",NAME(f));
655: error(errbuf);
656: }
657: }
658: switch ( f->id ) {
659: case A_BIN:
660: if ( !n ) {
661: cur_binf = f;
662: (*f->f.binf)(&val);
663: } else {
664: cur_binf = f;
665: (*f->f.binf)(a,&val);
666: }
667: cur_binf = 0;
668: break;
669: case A_PARI:
670: cur_binf = f;
671: val = evalparif(f,a);
672: cur_binf = 0;
673: break;
674: case A_USR:
675: pvs = f->f.usrf->pvs;
676: if ( PVSS )
677: ((VS)BDY(PVSS))->at = evalstatline;
678: MKNODE(tn,pvs,PVSS); PVSS = tn;
679: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
680: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
681: CPVS->opt = 0;
682: if ( CPVS->n ) {
683: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
684: bcopy((char *)pvs->va,(char *)CPVS->va,
685: (int)(pvs->n*sizeof(struct oPV)));
686: }
687: if ( nextbp )
688: nextbplevel++;
689: for ( tn = f->f.usrf->args, sn = a;
690: sn; tn = NEXT(tn), sn = NEXT(sn) )
691: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
692: val = evalstat((SNODE)BDY(f->f.usrf));
693: f_return = f_break = f_continue = 0; poppvs();
694: break;
695: case A_PURE:
696: val = evalpf(f->f.puref,a);
697: break;
698: default:
699: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
700: error(errbuf);
701: break;
702: }
703: return val;
704: }
705:
706: pointer evalif(f,a)
707: FNODE f,a;
708: {
709: Obj g;
710:
711: g = (Obj)eval(f);
712: if ( g && (OID(g) == O_P) && (VR((P)g)->attr == (pointer)V_SR) )
713: return evalf((FUNC)VR((P)g)->priv,a,0);
714: else {
715: error("invalid function pointer");
716: }
717: }
718:
719: pointer evalpf(pf,args)
720: PF pf;
721: NODE args;
722: {
723: Obj s,s1;
724: int i;
725: NODE node;
726: PFINS ins;
727: PFAD ad;
728: char errbuf[BUFSIZ];
729:
730: if ( !pf->body ) {
731: ins = (PFINS)CALLOC(1,sizeof(PF)+pf->argc*sizeof(struct oPFAD));
732: ins->pf = pf;
733: for ( i = 0, node = args, ad = ins->ad;
734: node; node = NEXT(node), i++ ) {
735: ad[i].d = 0; ad[i].arg = (Obj)node->body;
736: }
737: simplify_ins(ins,&s);
738: } else {
739: for ( i = 0, s = pf->body, node = args;
740: node; node = NEXT(node), i++ ) {
741: substr(CO,0,s,pf->args[i],(Obj)node->body,&s1); s = s1;
742: }
743: }
744: return (pointer)s;
745: }
746:
747: void evalnodebody(sn,dnp)
748: NODE sn;
749: NODE *dnp;
750: {
751: NODE n,n0,tn;
752: int line;
753:
754: if ( !sn ) {
755: *dnp = 0;
756: return;
757: }
758: line = evalstatline;
759: for ( tn = sn, n0 = 0; tn; tn = NEXT(tn) ) {
760: NEXTNODE(n0,n);
761: BDY(n) = eval((FNODE)BDY(tn));
762: evalstatline = line;
763: }
764: NEXT(n) = 0; *dnp = n0;
765: }
766:
767: void searchf(fn,name,r)
768: NODE fn;
769: char *name;
770: FUNC *r;
771: {
772: NODE tn;
773:
774: for ( tn = fn;
775: tn && strcmp(NAME((FUNC)BDY(tn)),name); tn = NEXT(tn) );
776: if ( tn ) {
777: *r = (FUNC)BDY(tn);
778: return;
779: }
780: *r = 0;
781: }
782:
783: void appenduf(name,r)
784: char *name;
785: FUNC *r;
786: {
787: NODE tn;
788: FUNC f;
789:
790: f=(FUNC)MALLOC(sizeof(struct oFUNC));
791: f->name = name; f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
792: MKNODE(tn,f,usrf); usrf = tn;
793: *r = f;
794: }
795:
796: void mkparif(name,r)
797: char *name;
798: FUNC *r;
799: {
800: FUNC f;
801:
802: *r = f =(FUNC)MALLOC(sizeof(struct oFUNC));
803: f->name = name; f->id = A_PARI; f->argc = 0; f->f.binf = 0;
804: }
805:
806: void mkuf(name,fname,args,body,startl,endl,desc)
807: char *name,*fname;
808: NODE args;
809: SNODE body;
810: int startl,endl;
811: char *desc;
812: {
813: FUNC f;
814: USRF t;
815: NODE sn,tn;
816: FNODE fn;
817: int argc;
818:
819: searchf(sysf,name,&f);
820: if ( f ) {
821: fprintf(stderr,"def : builtin function %s() cannot be redefined.\n",name);
822: CPVS = GPVS; return;
823: }
824: for ( argc = 0, sn = args; sn; argc++, sn = NEXT(sn) ) {
825: fn = (FNODE)BDY(sn);
826: if ( !fn || ID(fn) != I_PVAR ) {
827: fprintf(stderr,"illegal argument in %s()\n",name);
828: CPVS = GPVS; return;
829: }
830: }
831: for ( sn = usrf; sn && strcmp(NAME((FUNC)BDY(sn)),name); sn = NEXT(sn) );
832: if ( sn )
833: f = (FUNC)BDY(sn);
834: else {
835: f=(FUNC)MALLOC(sizeof(struct oFUNC));
836: f->name = name;
837: MKNODE(tn,f,usrf); usrf = tn;
838: }
839: if ( Verbose && f->id != A_UNDEF )
840: fprintf(stderr,"Warning : %s() redefined.\n",name);
841: /* else
842: fprintf(stderr,"%s() defined.\n",name); */
843: t=(USRF)MALLOC(sizeof(struct oUSRF));
844: t->args=args; BDY(t)=body; t->pvs = CPVS; t->fname = fname;
845: t->startl = startl; t->endl = endl; t->vol = asir_infile->vol;
846: t->desc = desc;
847: f->id = A_USR; f->argc = argc; f->f.usrf = t;
848: CPVS = GPVS;
849: clearbp(f);
850: }
851:
852: /*
853: retrieve value of an option whose key matches 'key'
854: CVS->opt is a list(node) of key-value pair (list)
855: CVS->opt = BDY([[key,value],[key,value],...])
856: */
857:
858: Obj getopt_from_cpvs(key)
859: char *key;
860: {
861: NODE opts,opt;
862: Obj value;
863: extern Obj VOIDobj;
864:
865: opts = CPVS->opt;
866: for ( ; opts; opts = NEXT(opts) ) {
867: opt = BDY((LIST)BDY(opts));
868: if ( !strcmp(key,BDY((STRING)BDY(opt))) )
869: return (Obj)BDY(NEXT(opt));
870: }
871: return VOIDobj;
872:
873: }