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