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