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