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