![[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.36 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.35 2004/07/07 07:40:19 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_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.30 noro 457: NODE tn,sn,opts,opt1,dmy;
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));
1.36 ! noro 465: error(errbuf);
! 466: }
! 467: if ( getsecuremode() && !PVSS && !f->secure ) {
! 468: sprintf(errbuf,"evalf : %s not permitted",NAME(f));
1.1 noro 469: error(errbuf);
470: }
471: if ( f->id != A_PARI ) {
472: for ( i = 0, tn = a?(NODE)FA0(a):0; tn; i++, tn = NEXT(tn) );
473: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
474: sprintf(errbuf,"evalf : argument mismatch in %s()",NAME(f));
475: error(errbuf);
476: }
477: }
478: switch ( f->id ) {
479: case A_BIN:
1.30 noro 480: if ( opt ) {
481: opts = BDY((LIST)eval(opt));
482: /* opts = ["opt1",arg1],... */
483: opt1 = BDY((LIST)BDY(opts));
484: if ( !strcmp(BDY((STRING)BDY(opt1)),"option_list") ) {
485: /*
486: * the special option specification:
487: * option_list=[["o1","a1"],...]
488: */
489: asir_assert(BDY(NEXT(opt1)),O_LIST,"evalf");
490: opts = BDY((LIST)BDY(NEXT(opt1)));
491: }
492: } else
493: opts = 0;
1.1 noro 494: if ( !n ) {
495: cur_binf = f;
496: (*f->f.binf)(&val);
497: } else {
498: args = (LIST)eval(a);
1.33 noro 499: current_option = opts;
1.1 noro 500: cur_binf = f;
501: (*f->f.binf)(args?BDY(args):0,&val);
502: }
503: cur_binf = 0;
504: break;
505: case A_PARI:
506: args = (LIST)eval(a);
507: cur_binf = f;
508: val = evalparif(f,args?BDY(args):0);
509: cur_binf = 0;
510: break;
511: case A_USR:
1.12 noro 512: /* stack check */
1.17 noro 513: #if !defined(VISUAL) && !defined(__CYGWIN__)
1.12 noro 514: if ( !stack_size ) {
515: struct rlimit rl;
516: getrlimit(RLIMIT_STACK,&rl);
517: stack_size = rl.rlim_cur;
518: }
519: if ( !stack_base )
520: stack_base = (void *)GC_get_stack_base();
521: if ( (stack_base - (void *)&args) +0x100000 > stack_size )
522: error("stack overflow");
523: #endif
1.1 noro 524: args = (LIST)eval(a);
1.11 noro 525: if ( opt ) {
1.1 noro 526: opts = BDY((LIST)eval(opt));
1.11 noro 527: /* opts = ["opt1",arg1],... */
528: opt1 = BDY((LIST)BDY(opts));
529: if ( !strcmp(BDY((STRING)BDY(opt1)),"option_list") ) {
530: /*
531: * the special option specification:
532: * option_list=[["o1","a1"],...]
533: */
534: asir_assert(BDY(NEXT(opt1)),O_LIST,"evalf");
535: opts = BDY((LIST)BDY(NEXT(opt1)));
536: }
537: } else
1.1 noro 538: opts = 0;
539: pvs = f->f.usrf->pvs;
540: if ( PVSS ) {
541: ((VS)BDY(PVSS))->at = evalstatline;
542: level = ((VS)BDY(PVSS))->level+1;
543: } else
544: level = 1;
545: MKNODE(tn,pvs,PVSS); PVSS = tn;
546: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
547: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
548: CPVS->level = level;
549: CPVS->opt = opts;
550: if ( CPVS->n ) {
551: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
552: bcopy((char *)pvs->va,(char *)CPVS->va,
553: (int)(pvs->n*sizeof(struct oPV)));
554: }
555: if ( nextbp )
556: nextbplevel++;
557: for ( tn = f->f.usrf->args, sn = BDY(args);
558: sn; tn = NEXT(tn), sn = NEXT(sn) )
559: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
1.21 noro 560: if ( f->f.usrf->module ) {
561: prev_mpvs = MPVS;
562: MPVS = f->f.usrf->module->pvs;
563: val = evalstat((SNODE)BDY(f->f.usrf));
564: MPVS = prev_mpvs;
565: } else
566: val = evalstat((SNODE)BDY(f->f.usrf));
1.1 noro 567: f_return = f_break = f_continue = 0; poppvs();
568: break;
569: case A_PURE:
570: args = (LIST)eval(a);
571: val = evalpf(f->f.puref,args?BDY(args):0);
572: break;
573: default:
574: sprintf(errbuf,"evalf : %s undefined",NAME(f));
575: error(errbuf);
576: break;
577: }
578: return val;
579: }
580:
1.16 noro 581: pointer evalmapf(FUNC f,FNODE a)
1.1 noro 582: {
583: LIST args;
584: NODE node,rest,t,n,r,r0;
585: Obj head;
586: VECT v,rv;
587: MAT m,rm;
588: LIST rl;
589: int len,row,col,i,j;
590: pointer val;
591:
592: args = (LIST)eval(a);
593: node = BDY(args); head = (Obj)BDY(node); rest = NEXT(node);
1.3 noro 594: if ( !head ) {
595: val = bevalf(f,node);
596: return val;
597: }
1.1 noro 598: switch ( OID(head) ) {
599: case O_VECT:
600: v = (VECT)head; len = v->len; MKVECT(rv,len);
601: for ( i = 0; i < len; i++ ) {
602: MKNODE(t,BDY(v)[i],rest); BDY(rv)[i] = bevalf(f,t);
603: }
604: val = (pointer)rv;
605: break;
606: case O_MAT:
607: m = (MAT)head; row = m->row; col = m->col; MKMAT(rm,row,col);
608: for ( i = 0; i < row; i++ )
609: for ( j = 0; j < col; j++ ) {
610: MKNODE(t,BDY(m)[i][j],rest); BDY(rm)[i][j] = bevalf(f,t);
611: }
612: val = (pointer)rm;
613: break;
614: case O_LIST:
615: n = BDY((LIST)head);
616: for ( r0 = r = 0; n; n = NEXT(n) ) {
617: NEXTNODE(r0,r); MKNODE(t,BDY(n),rest); BDY(r) = bevalf(f,t);
1.9 noro 618: }
619: if ( r0 )
620: NEXT(r) = 0;
621: MKLIST(rl,r0);
622: val = (pointer)rl;
623: break;
624: default:
625: val = bevalf(f,node);
626: break;
627: }
628: return val;
629: }
630:
1.16 noro 631: pointer eval_rec_mapf(FUNC f,FNODE a)
1.9 noro 632: {
633: LIST args;
634:
635: args = (LIST)eval(a);
636: return beval_rec_mapf(f,BDY(args));
637: }
638:
1.16 noro 639: pointer beval_rec_mapf(FUNC f,NODE node)
1.9 noro 640: {
641: NODE rest,t,n,r,r0;
642: Obj head;
643: VECT v,rv;
644: MAT m,rm;
645: LIST rl;
646: int len,row,col,i,j;
647: pointer val;
648:
649: head = (Obj)BDY(node); rest = NEXT(node);
650: if ( !head ) {
651: val = bevalf(f,node);
652: return val;
653: }
654: switch ( OID(head) ) {
655: case O_VECT:
656: v = (VECT)head; len = v->len; MKVECT(rv,len);
657: for ( i = 0; i < len; i++ ) {
658: MKNODE(t,BDY(v)[i],rest); BDY(rv)[i] = beval_rec_mapf(f,t);
659: }
660: val = (pointer)rv;
661: break;
662: case O_MAT:
663: m = (MAT)head; row = m->row; col = m->col; MKMAT(rm,row,col);
664: for ( i = 0; i < row; i++ )
665: for ( j = 0; j < col; j++ ) {
666: MKNODE(t,BDY(m)[i][j],rest);
667: BDY(rm)[i][j] = beval_rec_mapf(f,t);
668: }
669: val = (pointer)rm;
670: break;
671: case O_LIST:
672: n = BDY((LIST)head);
673: for ( r0 = r = 0; n; n = NEXT(n) ) {
674: NEXTNODE(r0,r); MKNODE(t,BDY(n),rest);
675: BDY(r) = beval_rec_mapf(f,t);
1.1 noro 676: }
677: if ( r0 )
678: NEXT(r) = 0;
679: MKLIST(rl,r0);
680: val = (pointer)rl;
681: break;
682: default:
683: val = bevalf(f,node);
684: break;
685: }
686: return val;
687: }
688:
1.16 noro 689: pointer bevalf(FUNC f,NODE a)
1.1 noro 690: {
691: pointer val;
692: int i,n;
693: NODE tn,sn;
694: VS pvs;
695: char errbuf[BUFSIZ];
696:
697: if ( f->id == A_UNDEF ) {
698: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
699: error(errbuf);
700: }
701: if ( f->id != A_PARI ) {
702: for ( i = 0, tn = a; tn; i++, tn = NEXT(tn) );
703: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
704: sprintf(errbuf,"bevalf : argument mismatch in %s()",NAME(f));
705: error(errbuf);
706: }
707: }
708: switch ( f->id ) {
709: case A_BIN:
710: if ( !n ) {
711: cur_binf = f;
712: (*f->f.binf)(&val);
713: } else {
714: cur_binf = f;
715: (*f->f.binf)(a,&val);
716: }
717: cur_binf = 0;
718: break;
719: case A_PARI:
720: cur_binf = f;
721: val = evalparif(f,a);
722: cur_binf = 0;
723: break;
724: case A_USR:
725: pvs = f->f.usrf->pvs;
726: if ( PVSS )
727: ((VS)BDY(PVSS))->at = evalstatline;
728: MKNODE(tn,pvs,PVSS); PVSS = tn;
729: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
730: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
731: CPVS->opt = 0;
732: if ( CPVS->n ) {
733: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
734: bcopy((char *)pvs->va,(char *)CPVS->va,
735: (int)(pvs->n*sizeof(struct oPV)));
736: }
737: if ( nextbp )
738: nextbplevel++;
739: for ( tn = f->f.usrf->args, sn = a;
740: sn; tn = NEXT(tn), sn = NEXT(sn) )
741: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
742: val = evalstat((SNODE)BDY(f->f.usrf));
743: f_return = f_break = f_continue = 0; poppvs();
744: break;
745: case A_PURE:
746: val = evalpf(f->f.puref,a);
747: break;
748: default:
749: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
750: error(errbuf);
751: break;
752: }
753: return val;
754: }
755:
1.16 noro 756: pointer evalif(FNODE f,FNODE a)
1.1 noro 757: {
758: Obj g;
759:
760: g = (Obj)eval(f);
761: if ( g && (OID(g) == O_P) && (VR((P)g)->attr == (pointer)V_SR) )
762: return evalf((FUNC)VR((P)g)->priv,a,0);
763: else {
764: error("invalid function pointer");
1.16 noro 765: /* NOTREACHED */
766: return (pointer)-1;
1.1 noro 767: }
768: }
769:
1.16 noro 770: pointer evalpf(PF pf,NODE args)
1.1 noro 771: {
772: Obj s,s1;
773: int i;
774: NODE node;
775: PFINS ins;
776: PFAD ad;
777:
778: if ( !pf->body ) {
779: ins = (PFINS)CALLOC(1,sizeof(PF)+pf->argc*sizeof(struct oPFAD));
780: ins->pf = pf;
781: for ( i = 0, node = args, ad = ins->ad;
782: node; node = NEXT(node), i++ ) {
783: ad[i].d = 0; ad[i].arg = (Obj)node->body;
784: }
785: simplify_ins(ins,&s);
786: } else {
787: for ( i = 0, s = pf->body, node = args;
788: node; node = NEXT(node), i++ ) {
789: substr(CO,0,s,pf->args[i],(Obj)node->body,&s1); s = s1;
790: }
791: }
792: return (pointer)s;
793: }
794:
1.16 noro 795: void evalnodebody(NODE sn,NODE *dnp)
1.1 noro 796: {
797: NODE n,n0,tn;
798: int line;
799:
800: if ( !sn ) {
801: *dnp = 0;
802: return;
803: }
804: line = evalstatline;
805: for ( tn = sn, n0 = 0; tn; tn = NEXT(tn) ) {
806: NEXTNODE(n0,n);
807: BDY(n) = eval((FNODE)BDY(tn));
808: evalstatline = line;
809: }
810: NEXT(n) = 0; *dnp = n0;
811: }
812:
1.21 noro 813: MODULE searchmodule(char *name)
814: {
815: MODULE mod;
816: NODE m;
817:
818: for ( m = MODULE_LIST; m; m = NEXT(m) ) {
819: mod = (MODULE)BDY(m);
820: if ( !strcmp(mod->name,name) )
821: return mod;
822: }
823: return 0;
824: }
1.24 noro 825: /*
826: * xxx.yyy() is searched in the flist
827: * of the module xxx.
828: * yyy() is searched in the global flist.
829: */
1.21 noro 830:
1.22 noro 831: void searchuf(char *name,FUNC *r)
832: {
833: MODULE mod;
834: char *name0,*dot;
835:
836: if ( dot = strchr(name,'.') ) {
837: name0 = (char *)ALLOCA(strlen(name)+1);
838: strcpy(name0,name);
839: dot = strchr(name0,'.');
840: *dot = 0;
841: mod = searchmodule(name0);
842: if ( mod )
843: searchf(mod->usrf_list,dot+1,r);
844: } else
845: searchf(usrf,name,r);
846: }
847:
1.16 noro 848: void gen_searchf(char *name,FUNC *r)
1.12 noro 849: {
1.21 noro 850: FUNC val = 0;
1.29 noro 851: int global = 0;
852: if ( *name == ':' ) {
853: global = 1;
854: name += 2;
855: }
856: if ( CUR_MODULE && !global )
1.21 noro 857: searchf(CUR_MODULE->usrf_list,name,&val);
1.25 noro 858: if ( !val )
859: searchf(sysf,name,&val);
860: if ( !val )
861: searchf(ubinf,name,&val);
862: if ( !val )
863: searchpf(name,&val);
864: if ( !val )
865: searchuf(name,&val);
866: if ( !val )
867: appenduf(name,&val);
1.34 noro 868: *r = val;
869: }
870:
871: void gen_searchf_searchonly(char *name,FUNC *r)
872: {
873: FUNC val = 0;
874: int global = 0;
875: if ( *name == ':' ) {
876: global = 1;
877: name += 2;
878: }
879: if ( CUR_MODULE && !global )
880: searchf(CUR_MODULE->usrf_list,name,&val);
881: if ( !val )
882: searchf(sysf,name,&val);
883: if ( !val )
884: searchf(ubinf,name,&val);
885: if ( !val )
886: searchpf(name,&val);
887: if ( !val )
888: searchuf(name,&val);
1.12 noro 889: *r = val;
890: }
891:
1.16 noro 892: void searchf(NODE fn,char *name,FUNC *r)
1.1 noro 893: {
894: NODE tn;
895:
896: for ( tn = fn;
897: tn && strcmp(NAME((FUNC)BDY(tn)),name); tn = NEXT(tn) );
898: if ( tn ) {
899: *r = (FUNC)BDY(tn);
900: return;
901: }
902: *r = 0;
903: }
904:
1.22 noro 905: MODULE mkmodule(char *);
906:
1.16 noro 907: void appenduf(char *name,FUNC *r)
1.1 noro 908: {
909: NODE tn;
910: FUNC f;
1.22 noro 911: int len;
912: MODULE mod;
913: char *modname,*fname,*dot;
1.1 noro 914:
915: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1.22 noro 916: f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
917: if ( dot = strchr(name,'.') ) {
1.28 noro 918: /* undefined function in a module */
1.22 noro 919: len = dot-name;
920: modname = (char *)MALLOC_ATOMIC(len+1);
921: strncpy(modname,name,len); modname[len] = 0;
922: fname = (char *)MALLOC_ATOMIC(strlen(name)-len+1);
923: strcpy(fname,dot+1);
924: f->name = fname;
1.25 noro 925: f->fullname = name;
1.28 noro 926: mod = searchmodule(modname);
927: if ( !mod )
928: mod = mkmodule(modname);
929: MKNODE(tn,f,mod->usrf_list); mod->usrf_list = tn;
1.21 noro 930: } else {
1.22 noro 931: f->name = name;
1.25 noro 932: f->fullname = name;
933: MKNODE(tn,f,usrf); usrf = tn;
1.21 noro 934: }
1.1 noro 935: *r = f;
936: }
937:
1.25 noro 938: void appenduf_local(char *name,FUNC *r)
1.24 noro 939: {
940: NODE tn;
941: FUNC f;
1.25 noro 942: MODULE mod;
1.24 noro 943:
1.27 noro 944: for ( tn = CUR_MODULE->usrf_list; tn; tn = NEXT(tn) )
945: if ( !strcmp(((FUNC)BDY(tn))->name,name) )
946: break;
947: if ( tn )
948: return;
949:
1.24 noro 950: f=(FUNC)MALLOC(sizeof(struct oFUNC));
951: f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
1.25 noro 952: f->name = name;
953: f->fullname =
954: (char *)MALLOC_ATOMIC(strlen(CUR_MODULE->name)+strlen(name)+1);
955: sprintf(f->fullname,"%s.%s",CUR_MODULE->name,name);
956: MKNODE(tn,f,CUR_MODULE->usrf_list); CUR_MODULE->usrf_list = tn;
1.24 noro 957: *r = f;
958: }
959:
1.25 noro 960: void appenduflist(NODE n)
961: {
962: NODE tn;
963: FUNC f;
964:
965: for ( tn = n; tn; tn = NEXT(tn) )
966: appenduf_local((char *)BDY(tn),&f);
967: }
968:
1.16 noro 969: void mkparif(char *name,FUNC *r)
1.1 noro 970: {
971: FUNC f;
972:
973: *r = f =(FUNC)MALLOC(sizeof(struct oFUNC));
974: f->name = name; f->id = A_PARI; f->argc = 0; f->f.binf = 0;
1.27 noro 975: f->fullname = name;
1.1 noro 976: }
977:
1.21 noro 978: void mkuf(char *name,char *fname,NODE args,SNODE body,int startl,int endl,char *desc,MODULE module)
1.1 noro 979: {
980: FUNC f;
981: USRF t;
1.21 noro 982: NODE usrf_list,sn,tn;
1.1 noro 983: FNODE fn;
1.21 noro 984: char *longname;
1.1 noro 985: int argc;
986:
1.29 noro 987: if ( *name == ':' )
988: name += 2;
1.21 noro 989: if ( !module ) {
990: searchf(sysf,name,&f);
991: if ( f ) {
992: fprintf(stderr,"def : builtin function %s() cannot be redefined.\n",name);
993: CPVS = GPVS; return;
994: }
1.1 noro 995: }
996: for ( argc = 0, sn = args; sn; argc++, sn = NEXT(sn) ) {
997: fn = (FNODE)BDY(sn);
998: if ( !fn || ID(fn) != I_PVAR ) {
999: fprintf(stderr,"illegal argument in %s()\n",name);
1000: CPVS = GPVS; return;
1001: }
1002: }
1.21 noro 1003: usrf_list = module ? module->usrf_list : usrf;
1004: for ( sn = usrf_list; sn && strcmp(NAME((FUNC)BDY(sn)),name); sn = NEXT(sn) );
1.1 noro 1005: if ( sn )
1006: f = (FUNC)BDY(sn);
1007: else {
1008: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1009: f->name = name;
1.21 noro 1010: MKNODE(tn,f,usrf_list); usrf_list = tn;
1.25 noro 1011: if ( module ) {
1012: f->fullname =
1013: (char *)MALLOC_ATOMIC(strlen(f->name)+strlen(module->name)+1);
1014: sprintf(f->fullname,"%s.%s",module->name,f->name);
1.21 noro 1015: module->usrf_list = usrf_list;
1.25 noro 1016: } else {
1017: f->fullname = f->name;
1.21 noro 1018: usrf = usrf_list;
1.25 noro 1019: }
1.21 noro 1020: }
1021: if ( Verbose && f->id != A_UNDEF ) {
1022: if ( module )
1023: fprintf(stderr,"Warning : %s.%s() redefined.\n",module->name,name);
1024: else
1025: fprintf(stderr,"Warning : %s() redefined.\n",name);
1.1 noro 1026: }
1027: t=(USRF)MALLOC(sizeof(struct oUSRF));
1028: t->args=args; BDY(t)=body; t->pvs = CPVS; t->fname = fname;
1.21 noro 1029: t->startl = startl; t->endl = endl; t->module = module;
1.1 noro 1030: t->desc = desc;
1031: f->id = A_USR; f->argc = argc; f->f.usrf = t;
1032: CPVS = GPVS;
1.24 noro 1033: CUR_FUNC = 0;
1.1 noro 1034: clearbp(f);
1035: }
1036:
1037: /*
1038: retrieve value of an option whose key matches 'key'
1039: CVS->opt is a list(node) of key-value pair (list)
1040: CVS->opt = BDY([[key,value],[key,value],...])
1041: */
1042:
1.16 noro 1043: Obj getopt_from_cpvs(char *key)
1.1 noro 1044: {
1045: NODE opts,opt;
1.12 noro 1046: LIST r;
1.1 noro 1047: extern Obj VOIDobj;
1048:
1049: opts = CPVS->opt;
1.12 noro 1050: if ( !key ) {
1051: MKLIST(r,opts);
1052: return (Obj)r;
1053: } else {
1054: for ( ; opts; opts = NEXT(opts) ) {
1055: asir_assert(BDY(opts),O_LIST,"getopt_from_cvps");
1056: opt = BDY((LIST)BDY(opts));
1057: if ( !strcmp(key,BDY((STRING)BDY(opt))) )
1058: return (Obj)BDY(NEXT(opt));
1059: }
1060: return VOIDobj;
1.1 noro 1061: }
1062:
1.21 noro 1063: }
1064:
1065: MODULE mkmodule(char *name)
1066: {
1067: MODULE mod;
1068: NODE m;
1069: int len;
1070: VS mpvs;
1071:
1072: for ( m = MODULE_LIST; m; m = NEXT(m) ) {
1073: mod = (MODULE)m->body;
1074: if ( !strcmp(mod->name,name) )
1075: break;
1076: }
1077: if ( m )
1078: return mod;
1079: else {
1080: mod = (MODULE)MALLOC(sizeof(struct oMODULE));
1081: len = strlen(name);
1082: mod->name = (char *)MALLOC_ATOMIC(len+1);
1083: strcpy(mod->name,name);
1084: mod->pvs = mpvs = (VS)MALLOC(sizeof(struct oVS));
1085: reallocarray((char **)&mpvs->va,(int *)&mpvs->asize,
1086: (int *)&mpvs->n,(int)sizeof(struct oPV));
1087: mod->usrf_list = 0;
1088: MKNODE(m,mod,MODULE_LIST);
1089: MODULE_LIST = m;
1090: return mod;
1091: }
1.23 noro 1092: }
1093:
1.24 noro 1094: void print_crossref(FUNC f)
1095: {
1.26 takayama 1096: FUNC r;
1097: if ( show_crossref && CUR_FUNC ) {
1098: searchuf(f->fullname,&r);
1099: if (r != NULL) {
1100: fprintf(asir_out,"%s() at line %d in %s()\n",
1101: f->fullname, asir_infile->ln, CUR_FUNC);
1102: }
1103: }
1.1 noro 1104: }