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