Annotation of OpenXM_contrib2/asir2000/parse/eval.c, Revision 1.39
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.39 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.38 2004/11/22 04:11:36 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;
433: default:
434: error("evalstat : unknown id");
435: break;
436: }
437: return ( val );
438: }
439:
1.16 noro 440: pointer evalnode(NODE node)
1.1 noro 441: {
442: NODE tn;
443: pointer val;
444:
445: for ( tn = node, val = 0; tn; tn = NEXT(tn) )
446: if ( BDY(tn) )
447: val = eval((FNODE)BDY(tn));
448: return ( val );
449: }
450:
451: extern FUNC cur_binf;
452: extern NODE PVSS;
453:
1.16 noro 454: pointer evalf(FUNC f,FNODE a,FNODE opt)
1.1 noro 455: {
456: LIST args;
457: pointer val;
458: int i,n,level;
1.30 noro 459: NODE tn,sn,opts,opt1,dmy;
460: VS pvs,prev_mpvs;
1.1 noro 461: char errbuf[BUFSIZ];
1.19 saito 462: static unsigned int stack_size;
1.12 noro 463: static void *stack_base;
1.1 noro 464:
465: if ( f->id == A_UNDEF ) {
466: sprintf(errbuf,"evalf : %s undefined",NAME(f));
1.36 noro 467: error(errbuf);
468: }
469: if ( getsecuremode() && !PVSS && !f->secure ) {
470: sprintf(errbuf,"evalf : %s not permitted",NAME(f));
1.1 noro 471: error(errbuf);
472: }
473: if ( f->id != A_PARI ) {
474: for ( i = 0, tn = a?(NODE)FA0(a):0; tn; i++, tn = NEXT(tn) );
475: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
476: sprintf(errbuf,"evalf : argument mismatch in %s()",NAME(f));
477: error(errbuf);
478: }
479: }
480: switch ( f->id ) {
481: case A_BIN:
1.30 noro 482: if ( opt ) {
483: opts = BDY((LIST)eval(opt));
484: /* opts = ["opt1",arg1],... */
485: opt1 = BDY((LIST)BDY(opts));
486: if ( !strcmp(BDY((STRING)BDY(opt1)),"option_list") ) {
487: /*
488: * the special option specification:
489: * option_list=[["o1","a1"],...]
490: */
491: asir_assert(BDY(NEXT(opt1)),O_LIST,"evalf");
492: opts = BDY((LIST)BDY(NEXT(opt1)));
493: }
494: } else
495: opts = 0;
1.1 noro 496: if ( !n ) {
497: cur_binf = f;
498: (*f->f.binf)(&val);
499: } else {
500: args = (LIST)eval(a);
1.33 noro 501: current_option = opts;
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;
1.39 ! noro 696: VS pvs,prev_mpvs;
1.1 noro 697: char errbuf[BUFSIZ];
698:
699: if ( f->id == A_UNDEF ) {
700: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
1.37 noro 701: error(errbuf);
702: }
703: if ( getsecuremode() && !PVSS && !f->secure ) {
704: sprintf(errbuf,"bevalf : %s not permitted",NAME(f));
1.1 noro 705: error(errbuf);
706: }
707: if ( f->id != A_PARI ) {
708: for ( i = 0, tn = a; tn; i++, tn = NEXT(tn) );
709: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
710: sprintf(errbuf,"bevalf : argument mismatch in %s()",NAME(f));
711: error(errbuf);
712: }
713: }
714: switch ( f->id ) {
715: case A_BIN:
716: if ( !n ) {
717: cur_binf = f;
718: (*f->f.binf)(&val);
719: } else {
720: cur_binf = f;
721: (*f->f.binf)(a,&val);
722: }
723: cur_binf = 0;
724: break;
725: case A_PARI:
726: cur_binf = f;
727: val = evalparif(f,a);
728: cur_binf = 0;
729: break;
730: case A_USR:
731: pvs = f->f.usrf->pvs;
732: if ( PVSS )
733: ((VS)BDY(PVSS))->at = evalstatline;
734: MKNODE(tn,pvs,PVSS); PVSS = tn;
735: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
736: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
737: CPVS->opt = 0;
738: if ( CPVS->n ) {
739: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
740: bcopy((char *)pvs->va,(char *)CPVS->va,
741: (int)(pvs->n*sizeof(struct oPV)));
742: }
743: if ( nextbp )
744: nextbplevel++;
745: for ( tn = f->f.usrf->args, sn = a;
746: sn; tn = NEXT(tn), sn = NEXT(sn) )
747: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
1.39 ! noro 748: if ( f->f.usrf->module ) {
! 749: prev_mpvs = MPVS;
! 750: MPVS = f->f.usrf->module->pvs;
! 751: val = evalstat((SNODE)BDY(f->f.usrf));
! 752: MPVS = prev_mpvs;
! 753: } else
! 754: val = evalstat((SNODE)BDY(f->f.usrf));
1.1 noro 755: f_return = f_break = f_continue = 0; poppvs();
756: break;
757: case A_PURE:
758: val = evalpf(f->f.puref,a);
759: break;
760: default:
761: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
762: error(errbuf);
763: break;
764: }
765: return val;
766: }
767:
1.16 noro 768: pointer evalif(FNODE f,FNODE a)
1.1 noro 769: {
770: Obj g;
771:
772: g = (Obj)eval(f);
773: if ( g && (OID(g) == O_P) && (VR((P)g)->attr == (pointer)V_SR) )
774: return evalf((FUNC)VR((P)g)->priv,a,0);
775: else {
776: error("invalid function pointer");
1.16 noro 777: /* NOTREACHED */
778: return (pointer)-1;
1.1 noro 779: }
780: }
781:
1.16 noro 782: pointer evalpf(PF pf,NODE args)
1.1 noro 783: {
784: Obj s,s1;
785: int i;
786: NODE node;
787: PFINS ins;
788: PFAD ad;
789:
790: if ( !pf->body ) {
791: ins = (PFINS)CALLOC(1,sizeof(PF)+pf->argc*sizeof(struct oPFAD));
792: ins->pf = pf;
793: for ( i = 0, node = args, ad = ins->ad;
794: node; node = NEXT(node), i++ ) {
795: ad[i].d = 0; ad[i].arg = (Obj)node->body;
796: }
797: simplify_ins(ins,&s);
798: } else {
799: for ( i = 0, s = pf->body, node = args;
800: node; node = NEXT(node), i++ ) {
801: substr(CO,0,s,pf->args[i],(Obj)node->body,&s1); s = s1;
802: }
803: }
804: return (pointer)s;
805: }
806:
1.16 noro 807: void evalnodebody(NODE sn,NODE *dnp)
1.1 noro 808: {
809: NODE n,n0,tn;
810: int line;
811:
812: if ( !sn ) {
813: *dnp = 0;
814: return;
815: }
816: line = evalstatline;
817: for ( tn = sn, n0 = 0; tn; tn = NEXT(tn) ) {
818: NEXTNODE(n0,n);
819: BDY(n) = eval((FNODE)BDY(tn));
820: evalstatline = line;
821: }
822: NEXT(n) = 0; *dnp = n0;
823: }
824:
1.21 noro 825: MODULE searchmodule(char *name)
826: {
827: MODULE mod;
828: NODE m;
829:
830: for ( m = MODULE_LIST; m; m = NEXT(m) ) {
831: mod = (MODULE)BDY(m);
832: if ( !strcmp(mod->name,name) )
833: return mod;
834: }
835: return 0;
836: }
1.24 noro 837: /*
838: * xxx.yyy() is searched in the flist
839: * of the module xxx.
840: * yyy() is searched in the global flist.
841: */
1.21 noro 842:
1.22 noro 843: void searchuf(char *name,FUNC *r)
844: {
845: MODULE mod;
846: char *name0,*dot;
847:
848: if ( dot = strchr(name,'.') ) {
849: name0 = (char *)ALLOCA(strlen(name)+1);
850: strcpy(name0,name);
851: dot = strchr(name0,'.');
852: *dot = 0;
853: mod = searchmodule(name0);
854: if ( mod )
855: searchf(mod->usrf_list,dot+1,r);
856: } else
857: searchf(usrf,name,r);
858: }
859:
1.16 noro 860: void gen_searchf(char *name,FUNC *r)
1.12 noro 861: {
1.21 noro 862: FUNC val = 0;
1.29 noro 863: int global = 0;
864: if ( *name == ':' ) {
865: global = 1;
866: name += 2;
867: }
868: if ( CUR_MODULE && !global )
1.21 noro 869: searchf(CUR_MODULE->usrf_list,name,&val);
1.25 noro 870: if ( !val )
871: searchf(sysf,name,&val);
872: if ( !val )
873: searchf(ubinf,name,&val);
874: if ( !val )
875: searchpf(name,&val);
876: if ( !val )
877: searchuf(name,&val);
878: if ( !val )
879: appenduf(name,&val);
1.34 noro 880: *r = val;
881: }
882:
883: void gen_searchf_searchonly(char *name,FUNC *r)
884: {
885: FUNC val = 0;
886: int global = 0;
887: if ( *name == ':' ) {
888: global = 1;
889: name += 2;
890: }
891: if ( CUR_MODULE && !global )
892: searchf(CUR_MODULE->usrf_list,name,&val);
893: if ( !val )
894: searchf(sysf,name,&val);
895: if ( !val )
896: searchf(ubinf,name,&val);
897: if ( !val )
898: searchpf(name,&val);
899: if ( !val )
900: searchuf(name,&val);
1.12 noro 901: *r = val;
902: }
903:
1.16 noro 904: void searchf(NODE fn,char *name,FUNC *r)
1.1 noro 905: {
906: NODE tn;
907:
908: for ( tn = fn;
909: tn && strcmp(NAME((FUNC)BDY(tn)),name); tn = NEXT(tn) );
910: if ( tn ) {
911: *r = (FUNC)BDY(tn);
912: return;
913: }
914: *r = 0;
915: }
916:
1.22 noro 917: MODULE mkmodule(char *);
918:
1.16 noro 919: void appenduf(char *name,FUNC *r)
1.1 noro 920: {
921: NODE tn;
922: FUNC f;
1.22 noro 923: int len;
924: MODULE mod;
925: char *modname,*fname,*dot;
1.1 noro 926:
927: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1.22 noro 928: f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
929: if ( dot = strchr(name,'.') ) {
1.28 noro 930: /* undefined function in a module */
1.22 noro 931: len = dot-name;
932: modname = (char *)MALLOC_ATOMIC(len+1);
933: strncpy(modname,name,len); modname[len] = 0;
934: fname = (char *)MALLOC_ATOMIC(strlen(name)-len+1);
935: strcpy(fname,dot+1);
936: f->name = fname;
1.25 noro 937: f->fullname = name;
1.28 noro 938: mod = searchmodule(modname);
939: if ( !mod )
940: mod = mkmodule(modname);
941: MKNODE(tn,f,mod->usrf_list); mod->usrf_list = tn;
1.21 noro 942: } else {
1.22 noro 943: f->name = name;
1.25 noro 944: f->fullname = name;
945: MKNODE(tn,f,usrf); usrf = tn;
1.21 noro 946: }
1.1 noro 947: *r = f;
948: }
949:
1.25 noro 950: void appenduf_local(char *name,FUNC *r)
1.24 noro 951: {
952: NODE tn;
953: FUNC f;
1.25 noro 954: MODULE mod;
1.24 noro 955:
1.27 noro 956: for ( tn = CUR_MODULE->usrf_list; tn; tn = NEXT(tn) )
957: if ( !strcmp(((FUNC)BDY(tn))->name,name) )
958: break;
959: if ( tn )
960: return;
961:
1.24 noro 962: f=(FUNC)MALLOC(sizeof(struct oFUNC));
963: f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
1.25 noro 964: f->name = name;
965: f->fullname =
966: (char *)MALLOC_ATOMIC(strlen(CUR_MODULE->name)+strlen(name)+1);
967: sprintf(f->fullname,"%s.%s",CUR_MODULE->name,name);
968: MKNODE(tn,f,CUR_MODULE->usrf_list); CUR_MODULE->usrf_list = tn;
1.24 noro 969: *r = f;
970: }
971:
1.25 noro 972: void appenduflist(NODE n)
973: {
974: NODE tn;
975: FUNC f;
976:
977: for ( tn = n; tn; tn = NEXT(tn) )
978: appenduf_local((char *)BDY(tn),&f);
979: }
980:
1.16 noro 981: void mkparif(char *name,FUNC *r)
1.1 noro 982: {
983: FUNC f;
984:
985: *r = f =(FUNC)MALLOC(sizeof(struct oFUNC));
986: f->name = name; f->id = A_PARI; f->argc = 0; f->f.binf = 0;
1.27 noro 987: f->fullname = name;
1.1 noro 988: }
989:
1.21 noro 990: void mkuf(char *name,char *fname,NODE args,SNODE body,int startl,int endl,char *desc,MODULE module)
1.1 noro 991: {
992: FUNC f;
993: USRF t;
1.21 noro 994: NODE usrf_list,sn,tn;
1.1 noro 995: FNODE fn;
1.21 noro 996: char *longname;
1.1 noro 997: int argc;
998:
1.38 noro 999: if ( getsecuremode() ) {
1000: error("defining function is not permitted in the secure mode");
1001: }
1.29 noro 1002: if ( *name == ':' )
1003: name += 2;
1.21 noro 1004: if ( !module ) {
1005: searchf(sysf,name,&f);
1006: if ( f ) {
1007: fprintf(stderr,"def : builtin function %s() cannot be redefined.\n",name);
1008: CPVS = GPVS; return;
1009: }
1.1 noro 1010: }
1011: for ( argc = 0, sn = args; sn; argc++, sn = NEXT(sn) ) {
1012: fn = (FNODE)BDY(sn);
1013: if ( !fn || ID(fn) != I_PVAR ) {
1014: fprintf(stderr,"illegal argument in %s()\n",name);
1015: CPVS = GPVS; return;
1016: }
1017: }
1.21 noro 1018: usrf_list = module ? module->usrf_list : usrf;
1019: for ( sn = usrf_list; sn && strcmp(NAME((FUNC)BDY(sn)),name); sn = NEXT(sn) );
1.1 noro 1020: if ( sn )
1021: f = (FUNC)BDY(sn);
1022: else {
1023: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1024: f->name = name;
1.21 noro 1025: MKNODE(tn,f,usrf_list); usrf_list = tn;
1.25 noro 1026: if ( module ) {
1027: f->fullname =
1028: (char *)MALLOC_ATOMIC(strlen(f->name)+strlen(module->name)+1);
1029: sprintf(f->fullname,"%s.%s",module->name,f->name);
1.21 noro 1030: module->usrf_list = usrf_list;
1.25 noro 1031: } else {
1032: f->fullname = f->name;
1.21 noro 1033: usrf = usrf_list;
1.25 noro 1034: }
1.21 noro 1035: }
1036: if ( Verbose && f->id != A_UNDEF ) {
1037: if ( module )
1038: fprintf(stderr,"Warning : %s.%s() redefined.\n",module->name,name);
1039: else
1040: fprintf(stderr,"Warning : %s() redefined.\n",name);
1.1 noro 1041: }
1042: t=(USRF)MALLOC(sizeof(struct oUSRF));
1043: t->args=args; BDY(t)=body; t->pvs = CPVS; t->fname = fname;
1.21 noro 1044: t->startl = startl; t->endl = endl; t->module = module;
1.1 noro 1045: t->desc = desc;
1046: f->id = A_USR; f->argc = argc; f->f.usrf = t;
1047: CPVS = GPVS;
1.24 noro 1048: CUR_FUNC = 0;
1.1 noro 1049: clearbp(f);
1050: }
1051:
1052: /*
1053: retrieve value of an option whose key matches 'key'
1054: CVS->opt is a list(node) of key-value pair (list)
1055: CVS->opt = BDY([[key,value],[key,value],...])
1056: */
1057:
1.16 noro 1058: Obj getopt_from_cpvs(char *key)
1.1 noro 1059: {
1060: NODE opts,opt;
1.12 noro 1061: LIST r;
1.1 noro 1062: extern Obj VOIDobj;
1063:
1064: opts = CPVS->opt;
1.12 noro 1065: if ( !key ) {
1066: MKLIST(r,opts);
1067: return (Obj)r;
1068: } else {
1069: for ( ; opts; opts = NEXT(opts) ) {
1070: asir_assert(BDY(opts),O_LIST,"getopt_from_cvps");
1071: opt = BDY((LIST)BDY(opts));
1072: if ( !strcmp(key,BDY((STRING)BDY(opt))) )
1073: return (Obj)BDY(NEXT(opt));
1074: }
1075: return VOIDobj;
1.1 noro 1076: }
1077:
1.21 noro 1078: }
1079:
1080: MODULE mkmodule(char *name)
1081: {
1082: MODULE mod;
1083: NODE m;
1084: int len;
1085: VS mpvs;
1086:
1087: for ( m = MODULE_LIST; m; m = NEXT(m) ) {
1088: mod = (MODULE)m->body;
1089: if ( !strcmp(mod->name,name) )
1090: break;
1091: }
1092: if ( m )
1093: return mod;
1094: else {
1095: mod = (MODULE)MALLOC(sizeof(struct oMODULE));
1096: len = strlen(name);
1097: mod->name = (char *)MALLOC_ATOMIC(len+1);
1098: strcpy(mod->name,name);
1099: mod->pvs = mpvs = (VS)MALLOC(sizeof(struct oVS));
1100: reallocarray((char **)&mpvs->va,(int *)&mpvs->asize,
1101: (int *)&mpvs->n,(int)sizeof(struct oPV));
1102: mod->usrf_list = 0;
1103: MKNODE(m,mod,MODULE_LIST);
1104: MODULE_LIST = m;
1105: return mod;
1106: }
1.23 noro 1107: }
1108:
1.24 noro 1109: void print_crossref(FUNC f)
1110: {
1.26 takayama 1111: FUNC r;
1112: if ( show_crossref && CUR_FUNC ) {
1113: searchuf(f->fullname,&r);
1114: if (r != NULL) {
1115: fprintf(asir_out,"%s() at line %d in %s()\n",
1116: f->fullname, asir_infile->ln, CUR_FUNC);
1117: }
1118: }
1.1 noro 1119: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>