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