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