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