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