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