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