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