Annotation of OpenXM_contrib2/asir2000/parse/eval.c, Revision 1.81
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.81 ! kondoh 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.80 2018/03/29 01:32:54 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"
1.62 noro 55: #if defined(GC7)
1.61 ohara 56: #include "gc.h"
1.62 noro 57: #endif
1.1 noro 58: #include <sys/types.h>
59: #include <sys/stat.h>
60:
1.18 noro 61: extern JMP_BUF timer_env;
1.60 noro 62: extern FUNC cur_binf;
63: extern NODE PVSS;
1.78 noro 64: extern int evalef;
1.1 noro 65:
66: int f_break,f_return,f_continue;
67: int evalstatline;
1.24 noro 68: int show_crossref;
1.60 noro 69: int at_root;
1.70 noro 70: void gen_searchf_searchonly(char *name,FUNC *r,int global);
1.57 noro 71: LIST eval_arg(FNODE a,unsigned int quote);
1.1 noro 72:
1.16 noro 73: pointer eval(FNODE f)
1.1 noro 74: {
1.80 noro 75: LIST t;
76: STRING str;
77: pointer val = 0;
78: pointer a,a1,a2;
79: NODE tn,tn1,ind,match;
80: R u;
81: DP dp;
82: unsigned int pv;
83: int c,ret,pos;
84: FNODE f1;
85: UP2 up2;
86: UP up;
87: UM um;
88: Obj obj;
89: GF2N gf2n;
90: GFPN gfpn;
91: GFSN gfsn;
92: RANGE range;
93: QUOTE expr,pattern;
94: Q q;
1.1 noro 95:
1.74 fujimoto 96: #if defined(VISUAL) || defined(__MINGW32__)
1.80 noro 97: check_intr();
1.1 noro 98: #endif
1.80 noro 99: if ( !f )
100: return ( 0 );
101: switch ( f->id ) {
102: case I_PAREN:
103: val = eval((FNODE)(FA0(f)));
104: break;
105: case I_MINUS:
106: a1 = eval((FNODE)(FA0(f)));
107: arf_chsgn((Obj)a1,&obj);
108: val = (pointer)obj;
109: break;
110: case I_BOP:
111: a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f));
112: (*((ARF)FA0(f))->fp)(CO,a1,a2,&val);
113: break;
114: case I_NARYOP:
115: tn = (NODE)FA1(f);
116: a = eval((FNODE)BDY(tn));
117: for ( tn = NEXT(tn); tn; tn = NEXT(tn) ) {
118: a1 = eval((FNODE)BDY(tn));
119: (*((ARF)FA0(f))->fp)(CO,a,a1,&a2);
120: a = a2;
121: }
122: val = a;
123: break;
124: case I_COP:
125: a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f));
126: c = arf_comp(CO,a1,a2);
127: switch ( (cid)FA0(f) ) {
128: case C_EQ:
129: c = (c == 0); break;
130: case C_NE:
131: c = (c != 0); break;
132: case C_GT:
133: c = (c > 0); break;
134: case C_LT:
135: c = (c < 0); break;
136: case C_GE:
137: c = (c >= 0); break;
138: case C_LE:
139: c = (c <= 0); break;
140: default:
141: c = 0; break;
142: }
143: if ( c )
144: val = (pointer)ONE;
145: break;
146: case I_AND:
147: if ( eval((FNODE)FA0(f)) && eval((FNODE)FA1(f)) )
148: val = (pointer)ONE;
149: break;
150: case I_OR:
151: if ( eval((FNODE)FA0(f)) || eval((FNODE)FA1(f)) )
152: val = (pointer)ONE;
153: break;
154: case I_NOT:
155: if ( eval((FNODE)FA0(f)) )
156: val = 0;
157: else
158: val = (pointer)ONE;
159: break;
160: case I_LOP:
161: a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f));
162: val = evall((lid)FA0(f),a1,a2);
163: break;
164: case I_CE:
165: if ( eval((FNODE)FA0(f)) )
166: val = eval((FNODE)FA1(f));
167: else
168: val = eval((FNODE)FA2(f));
169: break;
170: case I_EV:
171: evalnodebody((NODE)FA0(f),&tn); nodetod(tn,&dp); val = (pointer)dp;
172: break;
173: case I_EVM:
174: evalnodebody((NODE)FA0(f),&tn); pos = eval((FNODE)FA1(f)); nodetodpm(tn,pos,&dp); val = (pointer)dp;
175: break;
176: case I_FUNC:
177: val = evalf((FUNC)FA0(f),(FNODE)FA1(f),0); break;
178: case I_FUNC_OPT:
179: val = evalf((FUNC)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break;
180: case I_FUNC_QARG:
181: tn = BDY(eval_arg((FNODE)FA1(f),(unsigned int)0xffffffff));
182: val = bevalf((FUNC)FA0(f),tn); break;
183: case I_PFDERIV:
184: val = evalf_deriv((FUNC)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break;
185: case I_MAP:
186: val = evalmapf((FUNC)FA0(f),(FNODE)FA1(f)); break;
187: case I_RECMAP:
188: val = eval_rec_mapf((FUNC)FA0(f),(FNODE)FA1(f)); break;
189: case I_IFUNC:
190: val = evalif((FNODE)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break;
1.74 fujimoto 191: #if !defined(VISUAL) && !defined(__MINGW32__)
1.80 noro 192: case I_TIMER:
193: {
194: int interval;
195: Obj expired;
196:
197: interval = QTOS((Q)eval((FNODE)FA0(f)));
198: expired = (Obj)eval((FNODE)FA2(f));
199: set_timer(interval);
200: savepvs();
201: if ( !SETJMP(timer_env) )
202: val = eval((FNODE)FA1(f));
203: else {
204: val = (pointer)expired;
205: restorepvs();
206: }
207: reset_timer();
208: }
209: break;
1.1 noro 210: #endif
1.80 noro 211: case I_PRESELF:
212: f1 = (FNODE)FA1(f);
213: if ( ID(f1) == I_PVAR ) {
214: pv = (unsigned int)FA0(f1); ind = (NODE)FA1(f1); GETPV(pv,a);
215: if ( !ind ) {
216: (*((ARF)FA0(f))->fp)(CO,a,ONE,&val); ASSPV(pv,val);
217: } else if ( a ) {
218: evalnodebody(ind,&tn); getarray(a,tn,(pointer *)&u);
219: (*((ARF)FA0(f))->fp)(CO,u,ONE,&val); putarray(a,tn,val);
220: }
221: } else
222: error("++ : not implemented yet");
223: break;
224: case I_POSTSELF:
225: f1 = (FNODE)FA1(f);
226: if ( ID(f1) == I_PVAR ) {
227: pv = (unsigned int)FA0(f1); ind = (NODE)FA1(f1); GETPV(pv,val);
228: if ( !ind ) {
229: (*((ARF)FA0(f))->fp)(CO,val,ONE,&u); ASSPV(pv,u);
230: } else if ( val ) {
231: evalnodebody(ind,&tn); getarray(val,tn,&a);
232: (*((ARF)FA0(f))->fp)(CO,a,ONE,&u); putarray(val,tn,(pointer)u);
233: val = a;
234: }
235: } else
236: error("-- : not implemented yet");
237: break;
238: case I_PVAR:
239: pv = (unsigned int)FA0(f);
240: ind = (NODE)FA1(f);
241: GETPV(pv,a);
242: if ( !ind )
243: val = a;
244: else {
245: evalnodebody(ind,&tn); getarray(a,tn,&val);
246: }
247: break;
248: case I_ASSPVAR:
249: f1 = (FNODE)FA0(f);
250: if ( ID(f1) == I_PVAR ) {
251: pv = (unsigned int)FA0(f1); ind = (NODE)FA1(f1);
252: if ( !ind ) {
253: val = eval((FNODE)FA1(f)); ASSPV(pv,val);
254: } else {
255: GETPV(pv,a);
256: evalnodebody(ind,&tn);
257: putarray(a,tn,val = eval((FNODE)FA1(f)));
258: }
259: } else if ( ID(f1) == I_POINT ) {
260: /* f1 <-> FA0(f1)->FA1(f1) */
261: a = eval(FA0(f1));
262: assign_to_member(a,(char *)FA1(f1),val = eval((FNODE)FA1(f)));
263: } else if ( ID(f1) == I_INDEX ) {
264: /* f1 <-> FA0(f1)[FA1(f1)] */
265: a = eval((FNODE)FA0(f1)); ind = (NODE)FA1(f1);
266: evalnodebody(ind,&tn);
267: putarray(a,tn,val = eval((FNODE)FA1(f)));
268: } else {
269: error("eval : invalid assignment");
270: }
271: break;
272: case I_ANS:
273: if ( (pv =(int)FA0(f)) < (int)APVS->n )
274: val = APVS->va[pv].priv;
275: break;
276: case I_GF2NGEN:
277: NEWUP2(up2,1);
278: up2->w=1;
279: up2->b[0] = 2; /* @ */
280: MKGF2N(up2,gf2n);
281: val = (pointer)gf2n;
282: break;
283: case I_GFPNGEN:
284: up = UPALLOC(1);
285: DEG(up)=1;
286: COEF(up)[0] = 0;
287: COEF(up)[1] = (Num)ONELM;
288: MKGFPN(up,gfpn);
289: val = (pointer)gfpn;
290: break;
291: case I_GFSNGEN:
292: um = UMALLOC(1);
293: DEG(um) = 1;
294: COEF(um)[0] = 0;
295: COEF(um)[1] = _onesf();
296: MKGFSN(um,gfsn);
297: val = (pointer)gfsn;
298: break;
299: case I_STR:
300: MKSTR(str,FA0(f)); val = (pointer)str; break;
301: case I_FORMULA:
302: val = FA0(f);
303: break;
304: case I_LIST:
305: evalnodebody((NODE)FA0(f),&tn); MKLIST(t,tn); val = (pointer)t; break;
306: case I_CONS:
307: evalnodebody((NODE)FA0(f),&tn); a2 = eval(FA1(f));
308: if ( !a2 || OID(a2) != O_LIST )
309: error("cons : invalid argument");
310: for ( tn1 = tn; NEXT(tn1); tn1 = NEXT(tn1) );
311: NEXT(tn1) = BDY((LIST)a2);
312: MKLIST(t,tn); val = (pointer)t;
313: break;
314: case I_NEWCOMP:
315: newstruct((int)FA0(f),(struct oCOMP **)&val); break;
316: case I_CAR:
317: if ( !(a = eval((FNODE)FA0(f))) || (OID(a) != O_LIST) )
318: val = 0;
319: else if ( !BDY((LIST)a) )
320: val = a;
321: else
322: val = (pointer)BDY(BDY((LIST)a));
323: break;
324: case I_CDR:
325: if ( !(a = eval((FNODE)FA0(f))) || (OID(a) != O_LIST) )
326: val = 0;
327: else if ( !BDY((LIST)a) )
328: val = a;
329: else {
330: MKLIST(t,NEXT(BDY((LIST)a))); val = (pointer)t;
331: }
332: break;
333: case I_INDEX:
334: a = eval((FNODE)FA0(f)); ind = (NODE)FA1(f);
335: evalnodebody(ind,&tn); getarray(a,tn,&val);
336: break;
337: case I_OPT:
338: MKSTR(str,(char *)FA0(f));
339: a = (pointer)eval(FA1(f));
340: tn = mknode(2,str,a);
341: MKLIST(t,tn); val = (pointer)t;
342: break;
343: case I_GETOPT:
344: val = (pointer)getopt_from_cpvs((char *)FA0(f));
345: break;
346: case I_POINT:
347: a = (pointer)eval(FA0(f));
348: val = (pointer)memberofstruct(a,(char *)FA1(f));
349: break;
350: default:
351: error("eval : unknown id");
352: break;
353: }
354: return ( val );
1.45 noro 355: }
356:
1.51 noro 357: NODE fnode_to_nary_node(NODE);
358: NODE fnode_to_bin_node(NODE,int);
1.46 noro 359:
1.51 noro 360: FNODE fnode_to_nary(FNODE f)
1.46 noro 361: {
1.80 noro 362: FNODE a0,a1,a2;
363: NODE n,t,t0;
364: pointer val;
365: char *op;
366:
367: if ( !f )
368: return f;
369: switch ( f->id ) {
370: case I_NARYOP:
371: n = fnode_to_nary_node((NODE)FA1(f));
372: return mkfnode(2,I_NARYOP,FA0(f),n);
373:
374: case I_BOP:
375: a1 = fnode_to_nary((FNODE)FA1(f));
376: a2 = fnode_to_nary((FNODE)FA2(f));
377: op = ((ARF)FA0(f))->name;
378: if ( !strcmp(op,"+") || !strcmp(op,"*") ) {
379: if ( a1->id == I_NARYOP && !strcmp(op,((ARF)FA0(a1))->name) ) {
380: for ( n = (NODE)FA1(a1); NEXT(n); n = NEXT(n) );
381: if ( a2->id == I_NARYOP && !strcmp(op,((ARF)FA0(a2))->name) )
382: NEXT(n) = (NODE)FA1(a2);
383: else
384: MKNODE(NEXT(n),a2,0);
385: return a1;
386: } else if ( a2->id == I_NARYOP && !strcmp(op,((ARF)FA0(a2))->name) ) {
387: MKNODE(t,a1,(NODE)FA1(a2));
388: return mkfnode(2,I_NARYOP,FA0(f),t);
389: } else {
390: t = mknode(2,a1,a2);
391: return mkfnode(2,I_NARYOP,FA0(f),t);
392: }
393: } else
394: return mkfnode(3,f->id,FA0(f),a1,a2);
395:
396: case I_NOT: case I_PAREN: case I_MINUS:
397: case I_CAR: case I_CDR:
398: a0 = fnode_to_nary((FNODE)FA0(f));
399: return mkfnode(1,f->id,a0);
400:
401: case I_COP: case I_LOP:
402: a1 = fnode_to_nary((FNODE)FA1(f));
403: a2 = fnode_to_nary((FNODE)FA2(f));
404: return mkfnode(3,f->id,FA0(f),a1,a2);
405:
406: case I_AND: case I_OR:
407: a0 = fnode_to_nary((FNODE)FA0(f));
408: a1 = fnode_to_nary((FNODE)FA1(f));
409: return mkfnode(2,f->id,a0,a1);
410:
411: /* ternary operators */
412: case I_CE:
413: a0 = fnode_to_nary((FNODE)FA0(f));
414: a1 = fnode_to_nary((FNODE)FA1(f));
415: a2 = fnode_to_nary((FNODE)FA2(f));
416: return mkfnode(3,f->id,a0,a1,a2);
417: break;
418:
419: /* function */
420: case I_FUNC:
421: a1 = fnode_to_nary((FNODE)FA1(f));
422: return mkfnode(2,f->id,FA0(f),a1);
423:
424: case I_LIST: case I_EV:
425: n = fnode_to_nary_node((NODE)FA0(f));
426: return mkfnode(1,f->id,n);
427:
428: case I_STR: case I_FORMULA: case I_PVAR:
429: return f;
430:
431: default:
432: error("fnode_to_nary : not implemented yet");
433: }
1.46 noro 434: }
435:
1.51 noro 436: FNODE fnode_to_bin(FNODE f,int dir)
1.46 noro 437: {
1.80 noro 438: FNODE a0,a1,a2;
439: NODE n,t;
440: pointer val;
441: ARF fun;
442: int len,i;
443: FNODE *arg;
444:
445: if ( !f )
446: return f;
447: switch ( f->id ) {
448: case I_NARYOP:
449: fun = (ARF)FA0(f);
450: len = length((NODE)FA1(f));
451: if ( len==1 ) return BDY((NODE)(FA1(f)));
452:
453: arg = (FNODE *)ALLOCA(len*sizeof(FNODE));
454: for ( i = 0, t = (NODE)FA1(f); i < len; i++, t = NEXT(t) )
455: arg[i] = fnode_to_bin((FNODE)BDY(t),dir);
456: if ( dir ) {
457: a2 = mkfnode(3,I_BOP,fun,arg[len-2],arg[len-1]);
458: for ( i = len-3; i >= 0; i-- )
459: a2 = mkfnode(3,I_BOP,fun,arg[i],a2);
460: } else {
461: a2 = mkfnode(3,I_BOP,fun,arg[0],arg[1]);
462: for ( i = 2; i < len; i++ )
463: a2 = mkfnode(3,I_BOP,fun,a2,arg[i]);
464: }
465: return a2;
466:
467: case I_NOT: case I_PAREN: case I_MINUS:
468: case I_CAR: case I_CDR:
469: a0 = fnode_to_bin((FNODE)FA0(f),dir);
470: return mkfnode(1,f->id,a0);
471:
472: case I_BOP: case I_COP: case I_LOP:
473: a1 = fnode_to_bin((FNODE)FA1(f),dir);
474: a2 = fnode_to_bin((FNODE)FA2(f),dir);
475: return mkfnode(3,f->id,FA0(f),a1,a2);
476:
477: case I_AND: case I_OR:
478: a0 = fnode_to_bin((FNODE)FA0(f),dir);
479: a1 = fnode_to_bin((FNODE)FA1(f),dir);
480: return mkfnode(2,f->id,a0,a1);
481:
482: /* ternary operators */
483: case I_CE:
484: a0 = fnode_to_bin((FNODE)FA0(f),dir);
485: a1 = fnode_to_bin((FNODE)FA1(f),dir);
486: a2 = fnode_to_bin((FNODE)FA2(f),dir);
487: return mkfnode(3,f->id,a0,a1,a2);
488: break;
489:
490: /* function */
491: case I_FUNC:
492: a1 = fnode_to_bin((FNODE)FA1(f),dir);
493: return mkfnode(2,f->id,FA0(f),a1);
494:
495: case I_LIST: case I_EV:
496: n = fnode_to_bin_node((NODE)FA0(f),dir);
497: return mkfnode(1,f->id,n);
498:
499: case I_STR: case I_FORMULA: case I_PVAR:
500: return f;
501:
502: default:
503: error("fnode_to_bin : not implemented yet");
504: }
1.46 noro 505: }
506:
1.45 noro 507: NODE partial_eval_node(NODE n);
508: FNODE partial_eval(FNODE f);
509:
510: FNODE partial_eval(FNODE f)
511: {
1.80 noro 512: FNODE a0,a1,a2;
513: NODE n;
514: Obj obj;
515: QUOTE q;
516: pointer val;
517: FUNC func;
518:
519: if ( !f )
520: return f;
521: switch ( f->id ) {
522: case I_NOT: case I_PAREN: case I_MINUS:
523: case I_CAR: case I_CDR:
524: a0 = partial_eval((FNODE)FA0(f));
525: return mkfnode(1,f->id,a0);
526:
527: case I_BOP: case I_COP: case I_LOP:
528: a1 = partial_eval((FNODE)FA1(f));
529: a2 = partial_eval((FNODE)FA2(f));
530: return mkfnode(3,f->id,FA0(f),a1,a2);
531:
532: case I_NARYOP:
533: n = partial_eval_node((NODE)FA1(f));
534: return mkfnode(2,f->id,FA0(f),n);
535:
536: case I_AND: case I_OR:
537: a0 = partial_eval((FNODE)FA0(f));
538: a1 = partial_eval((FNODE)FA1(f));
539: return mkfnode(2,f->id,a0,a1);
540:
541: /* ternary operators */
542: case I_CE:
543: a0 = partial_eval((FNODE)FA0(f));
544: a1 = partial_eval((FNODE)FA1(f));
545: a2 = partial_eval((FNODE)FA2(f));
546: return mkfnode(3,f->id,a0,a1,a2);
547: break;
548:
549: /* XXX : function is evaluated with QUOTE args */
550: case I_FUNC:
551: a1 = partial_eval((FNODE)FA1(f));
552: func = (FUNC)FA0(f);
553: if ( func->id == A_UNDEF || func->id != A_USR ) {
554: a1 = mkfnode(2,I_FUNC,func,a1);
555: return a1;
556: } else {
557: n = BDY(eval_arg(a1,(unsigned int)0xffffffff));
558: obj = bevalf(func,n);
559: objtoquote(obj,&q);
560: return BDY(q);
561: }
562: break;
563:
564: case I_LIST: case I_EV:
565: n = partial_eval_node((NODE)FA0(f));
566: return mkfnode(1,f->id,n);
567:
568: case I_STR: case I_FORMULA:
569: return f;
570:
571: /* program variable */
572: case I_PVAR:
573: val = eval(f);
574: if ( val && OID((Obj)val) == O_QUOTE )
575: return partial_eval((FNODE)BDY((QUOTE)val));
576: else
577: return mkfnode(1,I_FORMULA,val);
578:
579: default:
580: error("partial_eval : not implemented yet");
581: }
1.45 noro 582: }
583:
584: NODE partial_eval_node(NODE n)
585: {
1.80 noro 586: NODE r0,r,t;
1.45 noro 587:
1.80 noro 588: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
589: NEXTNODE(r0,r);
590: BDY(r) = partial_eval((FNODE)BDY(t));
591: }
592: if ( r0 ) NEXT(r) = 0;
593: return r0;
1.49 noro 594: }
595:
1.57 noro 596: NODE rewrite_fnode_node(NODE n,NODE arg,int qarg);
597: FNODE rewrite_fnode(FNODE f,NODE arg,int qarg);
1.49 noro 598:
1.57 noro 599: FNODE rewrite_fnode(FNODE f,NODE arg,int qarg)
1.49 noro 600: {
1.80 noro 601: FNODE a0,a1,a2,value;
602: NODE n,t,pair;
603: pointer val;
604: int pv,ind;
605:
606: if ( !f )
607: return f;
608: switch ( f->id ) {
609: case I_NOT: case I_PAREN: case I_MINUS:
610: case I_CAR: case I_CDR:
611: a0 = rewrite_fnode((FNODE)FA0(f),arg,qarg);
612: return mkfnode(1,f->id,a0);
613:
614: case I_BOP: case I_COP: case I_LOP:
615: a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg);
616: a2 = rewrite_fnode((FNODE)FA2(f),arg,qarg);
617: return mkfnode(3,f->id,FA0(f),a1,a2);
618:
619: case I_AND: case I_OR:
620: a0 = rewrite_fnode((FNODE)FA0(f),arg,qarg);
621: a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg);
622: return mkfnode(2,f->id,a0,a1);
623:
624: /* ternary operators */
625: case I_CE:
626: a0 = rewrite_fnode((FNODE)FA0(f),arg,qarg);
627: a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg);
628: a2 = rewrite_fnode((FNODE)FA2(f),arg,qarg);
629: return mkfnode(3,f->id,a0,a1,a2);
630: break;
631:
632: /* nary operators */
633: case I_NARYOP:
634: n = rewrite_fnode_node((NODE)FA1(f),arg,qarg);
635: return mkfnode(2,f->id,FA0(f),n);
636:
637: /* and function */
638: case I_FUNC:
639: a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg);
640: return mkfnode(2,qarg?I_FUNC_QARG:f->id,FA0(f),a1);
641:
642: case I_LIST: case I_EV:
643: n = rewrite_fnode_node((NODE)FA0(f),arg,qarg);
644: return mkfnode(1,f->id,n);
645:
646: case I_STR: case I_FORMULA:
647: return f;
648:
649: /* program variable */
650: case I_PVAR:
651: pv = (int)FA0(f);
652: for ( t = arg; t; t = NEXT(t) ) {
653: pair = (NODE)BDY(t);
654: ind = (int)BDY(pair);
655: value = (FNODE)BDY(NEXT(pair));
656: if ( pv == ind )
657: return value;
658: }
659: return f;
660: break;
661:
662: default:
663: error("rewrite_fnode : not implemented yet");
664: }
1.49 noro 665: }
666:
1.57 noro 667: NODE rewrite_fnode_node(NODE n,NODE arg,int qarg)
1.49 noro 668: {
1.80 noro 669: NODE r0,r,t;
1.49 noro 670:
1.80 noro 671: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
672: NEXTNODE(r0,r);
673: BDY(r) = rewrite_fnode((FNODE)BDY(t),arg,qarg);
674: }
675: if ( r0 ) NEXT(r) = 0;
676: return r0;
1.46 noro 677: }
678:
1.51 noro 679: NODE fnode_to_nary_node(NODE n)
1.46 noro 680: {
1.80 noro 681: NODE r0,r,t;
1.46 noro 682:
1.80 noro 683: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
684: NEXTNODE(r0,r);
685: BDY(r) = fnode_to_nary((FNODE)BDY(t));
686: }
687: if ( r0 ) NEXT(r) = 0;
688: return r0;
1.46 noro 689: }
690:
1.51 noro 691: NODE fnode_to_bin_node(NODE n,int dir)
1.46 noro 692: {
1.80 noro 693: NODE r0,r,t;
1.46 noro 694:
1.80 noro 695: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
696: NEXTNODE(r0,r);
697: BDY(r) = fnode_to_bin((FNODE)BDY(t),dir);
698: }
699: if ( r0 ) NEXT(r) = 0;
700: return r0;
1.1 noro 701: }
702:
1.43 noro 703: V searchvar(char *name);
704:
1.16 noro 705: pointer evalstat(SNODE f)
1.1 noro 706: {
1.80 noro 707: pointer val = 0,t,s,s1;
708: P u;
709: NODE tn;
710: int i,ac;
711: V v;
712: V *a;
713: char *buf;
714: FUNC func;
715:
716: if ( !f )
717: return ( 0 );
718: if ( nextbp && nextbplevel <= 0 && f->id != S_CPLX ) {
719: nextbp = 0;
720: bp(f);
721: }
722: evalstatline = f->ln;
723: if ( !PVSS ) at_root = evalstatline;
724:
725: switch ( f->id ) {
726: case S_BP:
727: if ( !nextbp && (!FA1(f) || eval((FNODE)FA1(f))) ) {
728: if ( (FNODE)FA2(f) ) {
729: asir_out = stderr;
730: printexpr(CO,eval((FNODE)FA2(f)));
731: putc('\n',asir_out); fflush(asir_out);
732: asir_out = stdout;
733: } else {
734: nextbp = 1; nextbplevel = 0;
735: }
736: }
737: val = evalstat((SNODE)FA0(f));
738: break;
739: case S_PFDEF:
740: ac = argc(FA1(f)); a = (V *)MALLOC(ac*sizeof(V));
741: s = eval((FNODE)FA2(f));
742: buf = (char *)ALLOCA(BUFSIZ);
743: for ( i = 0, tn = (NODE)FA1(f); tn; tn = NEXT(tn), i++ ) {
744: t = eval((FNODE)tn->body); sprintf(buf,"_%s",NAME(VR((P)t)));
745: makevar(buf,&u); a[i] = VR(u);
746: substr(CO,0,(Obj)s,VR((P)t),(Obj)u,(Obj *)&s1); s = s1;
747: }
1.81 ! kondoh 748: #if defined(INTERVAL)
! 749: mkpf((char *)FA0(f),(Obj)s,ac,a,0,0,0,0,(PF *)&val); val = 0;
! 750: #else
1.80 noro 751: mkpf((char *)FA0(f),(Obj)s,ac,a,0,0,0,(PF *)&val); val = 0;
1.81 ! kondoh 752: #endif
1.80 noro 753: v = searchvar((char *)FA0(f));
754: if ( v ) {
755: searchpf((char *)FA0(f),&func);
756: makesrvar(func,&u);
757: }
758: break;
759: case S_SINGLE:
760: val = eval((FNODE)FA0(f)); break;
761: case S_CPLX:
762: for ( tn = (NODE)FA0(f); tn; tn = NEXT(tn) ) {
763: if ( BDY(tn) )
764: val = evalstat((SNODE)BDY(tn));
765: if ( f_break || f_return || f_continue )
766: break;
767: }
768: break;
769: case S_BREAK:
770: if ( 1 || GPVS != CPVS )
771: f_break = 1;
772: break;
773: case S_CONTINUE:
774: if ( 1 || GPVS != CPVS )
775: f_continue = 1;
776: break;
777: case S_RETURN:
778: if ( 1 || GPVS != CPVS ) {
779: val = eval((FNODE)FA0(f)); f_return = 1;
780: }
781: break;
782: case S_IFELSE:
783: if ( evalnode((NODE)FA1(f)) )
784: val = evalstat((SNODE)FA2(f));
785: else if ( FA3(f) )
786: val = evalstat((SNODE)FA3(f));
787: break;
788: case S_FOR:
789: evalnode((NODE)FA1(f));
790: while ( 1 ) {
791: if ( !evalnode((NODE)FA2(f)) )
792: break;
793: val = evalstat((SNODE)FA4(f));
794: if ( f_break || f_return )
795: break;
796: f_continue = 0;
797: evalnode((NODE)FA3(f));
798: }
799: f_break = 0; break;
800: case S_DO:
801: while ( 1 ) {
802: val = evalstat((SNODE)FA1(f));
803: if ( f_break || f_return )
804: break;
805: f_continue = 0;
806: if ( !evalnode((NODE)FA2(f)) )
807: break;
808: }
809: f_break = 0; break;
810: case S_MODULE:
811: CUR_MODULE = (MODULE)FA0(f);
812: if ( CUR_MODULE )
813: MPVS = CUR_MODULE->pvs;
814: else
815: MPVS = 0;
816: break;
817: default:
818: error("evalstat : unknown id");
819: break;
820: }
821: return ( val );
1.1 noro 822: }
823:
1.16 noro 824: pointer evalnode(NODE node)
1.1 noro 825: {
1.80 noro 826: NODE tn;
827: pointer val;
1.1 noro 828:
1.80 noro 829: for ( tn = node, val = 0; tn; tn = NEXT(tn) )
830: if ( BDY(tn) )
831: val = eval((FNODE)BDY(tn));
832: return ( val );
1.1 noro 833: }
834:
835:
1.44 noro 836: LIST eval_arg(FNODE a,unsigned int quote)
837: {
1.80 noro 838: LIST l;
839: FNODE fn;
840: NODE n,n0,tn;
841: QUOTE q;
842: int i;
843:
844: for ( tn = (NODE)FA0(a), n0 = 0, i = 0; tn; tn = NEXT(tn), i++ ) {
845: NEXTNODE(n0,n);
846: if ( quote & (1<<i) ) {
847: fn = (FNODE)(BDY(tn));
848: if ( fn->id == I_FORMULA && FA0(fn)
849: && OID((Obj)FA0(fn))== O_QUOTE )
850: BDY(n) = FA0(fn);
851: else {
852: MKQUOTE(q,(FNODE)BDY(tn));
853: BDY(n) = (pointer)q;
854: }
855: } else
856: BDY(n) = eval((FNODE)BDY(tn));
857: }
858: if ( n0 ) NEXT(n) = 0;
859: MKLIST(l,n0);
860: return l;
1.44 noro 861: }
862:
1.16 noro 863: pointer evalf(FUNC f,FNODE a,FNODE opt)
1.1 noro 864: {
1.80 noro 865: LIST args;
866: pointer val;
867: int i,n,level;
868: NODE tn,sn,opts,opt1,dmy;
869: VS pvs,prev_mpvs;
870: char errbuf[BUFSIZ];
871: static unsigned int stack_size;
872: static void *stack_base;
873: FUNC f1;
874:
875: if ( f->id == A_UNDEF ) {
876: gen_searchf_searchonly(f->fullname,&f1,0);
877: if ( f1->id == A_UNDEF ) {
878: sprintf(errbuf,"evalf : %s undefined",NAME(f));
879: error(errbuf);
880: } else
881: *f = *f1;
882: }
883: if ( getsecuremode() && !PVSS && !f->secure ) {
884: sprintf(errbuf,"evalf : %s not permitted",NAME(f));
885: error(errbuf);
886: }
887: if ( f->id != A_PARI ) {
888: for ( i = 0, tn = a?(NODE)FA0(a):0; tn; i++, tn = NEXT(tn) );
889: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
890: sprintf(errbuf,"evalf : argument mismatch in %s()",NAME(f));
891: error(errbuf);
892: }
893: }
894: switch ( f->id ) {
895: case A_BIN:
896: if ( opt ) {
897: opts = BDY((LIST)eval(opt));
898: /* opts = ["opt1",arg1],... */
899: opt1 = BDY((LIST)BDY(opts));
900: if ( !strcmp(BDY((STRING)BDY(opt1)),"option_list") ) {
901: /*
902: * the special option specification:
903: * option_list=[["o1","a1"],...]
904: */
905: asir_assert(BDY(NEXT(opt1)),O_LIST,"evalf");
906: opts = BDY((LIST)BDY(NEXT(opt1)));
907: }
908: } else
909: opts = 0;
910: if ( !n ) {
911: current_option = opts;
912: cur_binf = f;
913: (*f->f.binf)(&val);
914: } else {
915: args = (LIST)eval_arg(a,f->quote);
916: current_option = opts;
917: cur_binf = f;
918: (*f->f.binf)(args?BDY(args):0,&val);
919: }
920: cur_binf = 0;
921: break;
922: case A_PARI:
923: args = (LIST)eval(a);
924: cur_binf = f;
925: val = evalparif(f,args?BDY(args):0);
926: cur_binf = 0;
927: break;
928: case A_USR:
929: /* stack check */
1.74 fujimoto 930: #if !defined(VISUAL) && !defined(__MINGW32__) && !defined(__CYGWIN__)
1.80 noro 931: if ( !stack_size ) {
932: struct rlimit rl;
933: getrlimit(RLIMIT_STACK,&rl);
934: stack_size = rl.rlim_cur;
935: }
1.61 ohara 936: if ( !stack_base ) {
937: #if defined(GC7)
1.65 ohara 938: stack_base = (void *)GC_get_main_stack_base();
1.61 ohara 939: #else
940: stack_base = (void *)GC_get_stack_base();
941: #endif
942: }
1.80 noro 943: if ( (stack_base - (void *)&args) +0x100000 > stack_size )
944: error("stack overflow");
1.12 noro 945: #endif
1.80 noro 946: args = (LIST)eval_arg(a,f->quote);
947: if ( opt ) {
948: opts = BDY((LIST)eval(opt));
949: /* opts = ["opt1",arg1],... */
950: opt1 = BDY((LIST)BDY(opts));
951: if ( !strcmp(BDY((STRING)BDY(opt1)),"option_list") ) {
952: /*
953: * the special option specification:
954: * option_list=[["o1","a1"],...]
955: */
956: asir_assert(BDY(NEXT(opt1)),O_LIST,"evalf");
957: opts = BDY((LIST)BDY(NEXT(opt1)));
958: }
959: } else
960: opts = 0;
961: pvs = f->f.usrf->pvs;
962: if ( PVSS ) {
963: ((VS)BDY(PVSS))->at = evalstatline;
964: level = ((VS)BDY(PVSS))->level+1;
965: } else
966: level = 1;
967: MKNODE(tn,pvs,PVSS); PVSS = tn;
968: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
969: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
970: CPVS->level = level;
971: CPVS->opt = opts;
972: if ( CPVS->n ) {
973: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
974: bcopy((char *)pvs->va,(char *)CPVS->va,
975: (int)(pvs->n*sizeof(struct oPV)));
976: }
977: if ( nextbp )
978: nextbplevel++;
979: for ( tn = f->f.usrf->args, sn = BDY(args);
980: sn; tn = NEXT(tn), sn = NEXT(sn) )
981: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
982: f_return = f_break = f_continue = 0;
983: if ( f->f.usrf->module ) {
984: prev_mpvs = MPVS;
985: MPVS = f->f.usrf->module->pvs;
986: val = evalstat((SNODE)BDY(f->f.usrf));
987: MPVS = prev_mpvs;
988: } else
989: val = evalstat((SNODE)BDY(f->f.usrf));
990: f_return = f_break = f_continue = 0; poppvs();
991: if ( PVSS )
992: evalstatline = ((VS)BDY(PVSS))->at;
993: break;
994: case A_PURE:
995: args = (LIST)eval(a);
996: val = evalpf(f->f.puref,args?BDY(args):0,0);
997: break;
998: default:
999: sprintf(errbuf,"evalf : %s undefined",NAME(f));
1000: error(errbuf);
1001: break;
1002: }
1003: return val;
1.1 noro 1004: }
1005:
1.44 noro 1006: pointer evalf_deriv(FUNC f,FNODE a,FNODE deriv)
1007: {
1.80 noro 1008: LIST args,dargs;
1009: pointer val;
1010: char errbuf[BUFSIZ];
1011:
1012: switch ( f->id ) {
1013: case A_PURE:
1014: args = (LIST)eval(a);
1015: dargs = (LIST)eval(deriv);
1016: val = evalpf(f->f.puref,
1017: args?BDY(args):0,dargs?BDY(dargs):0);
1018: break;
1019: default:
1020: sprintf(errbuf,
1021: "evalf : %s is not a pure function",NAME(f));
1022: error(errbuf);
1023: break;
1024: }
1025: return val;
1.44 noro 1026: }
1027:
1.16 noro 1028: pointer evalmapf(FUNC f,FNODE a)
1.1 noro 1029: {
1.80 noro 1030: LIST args;
1031: NODE node,rest,t,n,r,r0;
1032: Obj head;
1033: VECT v,rv;
1034: MAT m,rm;
1035: LIST rl;
1036: int len,row,col,i,j;
1037: pointer val;
1038:
1039: args = (LIST)eval_arg(a,f->quote);
1040: node = BDY(args); head = (Obj)BDY(node); rest = NEXT(node);
1041: if ( !head ) {
1042: val = bevalf(f,node);
1043: return val;
1044: }
1045: switch ( OID(head) ) {
1046: case O_VECT:
1047: v = (VECT)head; len = v->len; MKVECT(rv,len);
1048: for ( i = 0; i < len; i++ ) {
1049: MKNODE(t,BDY(v)[i],rest); BDY(rv)[i] = bevalf(f,t);
1050: }
1051: val = (pointer)rv;
1052: break;
1053: case O_MAT:
1054: m = (MAT)head; row = m->row; col = m->col; MKMAT(rm,row,col);
1055: for ( i = 0; i < row; i++ )
1056: for ( j = 0; j < col; j++ ) {
1057: MKNODE(t,BDY(m)[i][j],rest); BDY(rm)[i][j] = bevalf(f,t);
1058: }
1059: val = (pointer)rm;
1060: break;
1061: case O_LIST:
1062: n = BDY((LIST)head);
1063: for ( r0 = r = 0; n; n = NEXT(n) ) {
1064: NEXTNODE(r0,r); MKNODE(t,BDY(n),rest); BDY(r) = bevalf(f,t);
1065: }
1066: if ( r0 )
1067: NEXT(r) = 0;
1068: MKLIST(rl,r0);
1069: val = (pointer)rl;
1070: break;
1071: default:
1072: val = bevalf(f,node);
1073: break;
1074: }
1075: return val;
1.9 noro 1076: }
1077:
1.16 noro 1078: pointer eval_rec_mapf(FUNC f,FNODE a)
1.9 noro 1079: {
1.80 noro 1080: LIST args;
1.9 noro 1081:
1.80 noro 1082: args = (LIST)eval_arg(a,f->quote);
1083: return beval_rec_mapf(f,BDY(args));
1.9 noro 1084: }
1085:
1.16 noro 1086: pointer beval_rec_mapf(FUNC f,NODE node)
1.9 noro 1087: {
1.80 noro 1088: NODE rest,t,n,r,r0;
1089: Obj head;
1090: VECT v,rv;
1091: MAT m,rm;
1092: LIST rl;
1093: int len,row,col,i,j;
1094: pointer val;
1095:
1096: head = (Obj)BDY(node); rest = NEXT(node);
1097: if ( !head ) {
1098: val = bevalf(f,node);
1099: return val;
1100: }
1101: switch ( OID(head) ) {
1102: case O_VECT:
1103: v = (VECT)head; len = v->len; MKVECT(rv,len);
1104: for ( i = 0; i < len; i++ ) {
1105: MKNODE(t,BDY(v)[i],rest); BDY(rv)[i] = beval_rec_mapf(f,t);
1106: }
1107: val = (pointer)rv;
1108: break;
1109: case O_MAT:
1110: m = (MAT)head; row = m->row; col = m->col; MKMAT(rm,row,col);
1111: for ( i = 0; i < row; i++ )
1112: for ( j = 0; j < col; j++ ) {
1113: MKNODE(t,BDY(m)[i][j],rest);
1114: BDY(rm)[i][j] = beval_rec_mapf(f,t);
1115: }
1116: val = (pointer)rm;
1117: break;
1118: case O_LIST:
1119: n = BDY((LIST)head);
1120: for ( r0 = r = 0; n; n = NEXT(n) ) {
1121: NEXTNODE(r0,r); MKNODE(t,BDY(n),rest);
1122: BDY(r) = beval_rec_mapf(f,t);
1123: }
1124: if ( r0 )
1125: NEXT(r) = 0;
1126: MKLIST(rl,r0);
1127: val = (pointer)rl;
1128: break;
1129: default:
1130: val = bevalf(f,node);
1131: break;
1132: }
1133: return val;
1.1 noro 1134: }
1135:
1.16 noro 1136: pointer bevalf(FUNC f,NODE a)
1.1 noro 1137: {
1.80 noro 1138: pointer val;
1139: int i,n;
1140: NODE tn,sn;
1141: VS pvs,prev_mpvs;
1142: char errbuf[BUFSIZ];
1143:
1144: if ( f->id == A_UNDEF ) {
1145: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
1146: error(errbuf);
1147: }
1148: if ( getsecuremode() && !PVSS && !f->secure ) {
1149: sprintf(errbuf,"bevalf : %s not permitted",NAME(f));
1150: error(errbuf);
1151: }
1152: if ( f->id != A_PARI ) {
1153: for ( i = 0, tn = a; tn; i++, tn = NEXT(tn) );
1154: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
1155: sprintf(errbuf,"bevalf : argument mismatch in %s()",NAME(f));
1156: error(errbuf);
1157: }
1158: }
1159: switch ( f->id ) {
1160: case A_BIN:
1161: current_option = 0;
1162: if ( !n ) {
1163: cur_binf = f;
1164: (*f->f.binf)(&val);
1165: } else {
1166: cur_binf = f;
1167: (*f->f.binf)(a,&val);
1168: }
1169: cur_binf = 0;
1170: break;
1171: case A_PARI:
1172: cur_binf = f;
1173: val = evalparif(f,a);
1174: cur_binf = 0;
1175: break;
1176: case A_USR:
1177: pvs = f->f.usrf->pvs;
1178: if ( PVSS )
1179: ((VS)BDY(PVSS))->at = evalstatline;
1180: MKNODE(tn,pvs,PVSS); PVSS = tn;
1181: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
1182: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
1183: CPVS->opt = 0;
1184: if ( CPVS->n ) {
1185: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
1186: bcopy((char *)pvs->va,(char *)CPVS->va,
1187: (int)(pvs->n*sizeof(struct oPV)));
1188: }
1189: if ( nextbp )
1190: nextbplevel++;
1191: for ( tn = f->f.usrf->args, sn = a;
1192: sn; tn = NEXT(tn), sn = NEXT(sn) )
1193: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
1194: f_return = f_break = f_continue = 0;
1195: if ( f->f.usrf->module ) {
1196: prev_mpvs = MPVS;
1197: MPVS = f->f.usrf->module->pvs;
1198: val = evalstat((SNODE)BDY(f->f.usrf));
1199: MPVS = prev_mpvs;
1200: } else
1201: val = evalstat((SNODE)BDY(f->f.usrf));
1202: f_return = f_break = f_continue = 0; poppvs();
1203: break;
1204: case A_PURE:
1205: val = evalpf(f->f.puref,a,0);
1206: break;
1207: default:
1208: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
1209: error(errbuf);
1210: break;
1211: }
1212: return val;
1.1 noro 1213: }
1214:
1.64 ohara 1215: pointer bevalf_with_opts(FUNC f,NODE a,NODE opts)
1216: {
1.80 noro 1217: pointer val;
1218: int i,n;
1219: NODE tn,sn;
1220: VS pvs,prev_mpvs;
1221: char errbuf[BUFSIZ];
1222:
1223: if ( f->id == A_UNDEF ) {
1224: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
1225: error(errbuf);
1226: }
1227: if ( getsecuremode() && !PVSS && !f->secure ) {
1228: sprintf(errbuf,"bevalf : %s not permitted",NAME(f));
1229: error(errbuf);
1230: }
1231: if ( f->id != A_PARI ) {
1232: for ( i = 0, tn = a; tn; i++, tn = NEXT(tn) );
1233: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
1234: sprintf(errbuf,"bevalf : argument mismatch in %s()",NAME(f));
1235: error(errbuf);
1236: }
1237: }
1238: switch ( f->id ) {
1239: case A_BIN:
1240: current_option = opts;
1241: if ( !n ) {
1242: cur_binf = f;
1243: (*f->f.binf)(&val);
1244: } else {
1245: cur_binf = f;
1246: (*f->f.binf)(a,&val);
1247: }
1248: cur_binf = 0;
1249: break;
1250: case A_PARI:
1251: cur_binf = f;
1252: val = evalparif(f,a);
1253: cur_binf = 0;
1254: break;
1255: case A_USR:
1256: pvs = f->f.usrf->pvs;
1257: if ( PVSS )
1258: ((VS)BDY(PVSS))->at = evalstatline;
1259: MKNODE(tn,pvs,PVSS); PVSS = tn;
1260: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
1261: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
1262: CPVS->opt = opts;
1263: if ( CPVS->n ) {
1264: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
1265: bcopy((char *)pvs->va,(char *)CPVS->va,
1266: (int)(pvs->n*sizeof(struct oPV)));
1267: }
1268: if ( nextbp )
1269: nextbplevel++;
1270: for ( tn = f->f.usrf->args, sn = a;
1271: sn; tn = NEXT(tn), sn = NEXT(sn) )
1272: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
1273: f_return = f_break = f_continue = 0;
1274: if ( f->f.usrf->module ) {
1275: prev_mpvs = MPVS;
1276: MPVS = f->f.usrf->module->pvs;
1277: val = evalstat((SNODE)BDY(f->f.usrf));
1278: MPVS = prev_mpvs;
1279: } else
1280: val = evalstat((SNODE)BDY(f->f.usrf));
1281: f_return = f_break = f_continue = 0; poppvs();
1282: break;
1283: case A_PURE:
1284: val = evalpf(f->f.puref,a,0);
1285: break;
1286: default:
1287: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
1288: error(errbuf);
1289: break;
1290: }
1291: return val;
1.64 ohara 1292: }
1293:
1.63 noro 1294: pointer evalif(FNODE f,FNODE a,FNODE opt)
1.1 noro 1295: {
1.80 noro 1296: Obj g;
1297: QUOTE q;
1298: FNODE t;
1299: LIST l;
1300:
1301: g = (Obj)eval(f);
1302: if ( g && (OID(g) == O_P) && (VR((P)g)->attr == (pointer)V_SR) )
1303: return evalf((FUNC)VR((P)g)->priv,a,opt);
1304: else if ( g && OID(g) == O_QUOTEARG && ((QUOTEARG)g)->type == A_func ) {
1305: t = mkfnode(2,I_FUNC,((QUOTEARG)g)->body,a);
1306: MKQUOTE(q,t);
1307: return q;
1308: } else {
1309: error("invalid function pointer");
1310: /* NOTREACHED */
1311: return (pointer)-1;
1312: }
1.1 noro 1313: }
1314:
1.44 noro 1315: pointer evalpf(PF pf,NODE args,NODE dargs)
1.1 noro 1316: {
1.80 noro 1317: Obj s,s1;
1318: int i,di,j;
1319: NODE node,dnode;
1320: PFINS ins;
1321: PFAD ad;
1322:
1323: if ( !pf->body ) {
1324: ins = (PFINS)CALLOC(1,sizeof(PF)+pf->argc*sizeof(struct oPFAD));
1325: ins->pf = pf;
1326: for ( i = 0, node = args, dnode = dargs, ad = ins->ad;
1327: node; i++ ) {
1328: ad[i].arg = (Obj)node->body;
1329: if ( !dnode ) ad[i].d = 0;
1330: else
1331: ad[i].d = QTOS((Q)dnode->body);
1332: node = NEXT(node);
1333: if ( dnode ) dnode = NEXT(dnode);
1334: }
1335: simplify_ins(ins,&s);
1336: } else {
1337: s = pf->body;
1338: if ( dargs ) {
1339: for ( i = 0, dnode = dargs; dnode; dnode = NEXT(dnode), i++ ) {
1340: di = QTOS((Q)dnode->body);
1341: for ( j = 0; j < di; j++ ) {
1342: derivr(CO,s,pf->args[i],&s1); s = s1;
1343: }
1344: }
1345: }
1346: for ( i = 0, node = args; node; node = NEXT(node), i++ ) {
1347: substr(CO,0,s,pf->args[i],(Obj)node->body,&s1); s = s1;
1348: }
1349: }
1350: return (pointer)s;
1.1 noro 1351: }
1352:
1.16 noro 1353: void evalnodebody(NODE sn,NODE *dnp)
1.1 noro 1354: {
1.80 noro 1355: NODE n,n0,tn;
1356: int line;
1.1 noro 1357:
1.80 noro 1358: if ( !sn ) {
1359: *dnp = 0;
1360: return;
1361: }
1362: line = evalstatline;
1363: for ( tn = sn, n0 = 0; tn; tn = NEXT(tn) ) {
1364: NEXTNODE(n0,n);
1365: BDY(n) = eval((FNODE)BDY(tn));
1366: evalstatline = line;
1367: }
1368: NEXT(n) = 0; *dnp = n0;
1.1 noro 1369: }
1370:
1.21 noro 1371: MODULE searchmodule(char *name)
1372: {
1.80 noro 1373: MODULE mod;
1374: NODE m;
1.21 noro 1375:
1.80 noro 1376: for ( m = MODULE_LIST; m; m = NEXT(m) ) {
1377: mod = (MODULE)BDY(m);
1378: if ( !strcmp(mod->name,name) )
1379: return mod;
1380: }
1381: return 0;
1.21 noro 1382: }
1.24 noro 1383: /*
1384: * xxx.yyy() is searched in the flist
1385: * of the module xxx.
1386: * yyy() is searched in the global flist.
1387: */
1.21 noro 1388:
1.22 noro 1389: void searchuf(char *name,FUNC *r)
1390: {
1.80 noro 1391: MODULE mod;
1392: char *name0,*dot;
1.22 noro 1393:
1.80 noro 1394: if ( dot = strchr(name,'.') ) {
1395: name0 = (char *)ALLOCA(strlen(name)+1);
1396: strcpy(name0,name);
1397: dot = strchr(name0,'.');
1398: *dot = 0;
1399: mod = searchmodule(name0);
1400: if ( mod )
1401: searchf(mod->usrf_list,dot+1,r);
1402: } else
1403: searchf(usrf,name,r);
1.22 noro 1404: }
1405:
1.16 noro 1406: void gen_searchf(char *name,FUNC *r)
1.12 noro 1407: {
1.80 noro 1408: FUNC val = 0;
1409: int global = 0;
1410: if ( *name == ':' ) {
1411: global = 1;
1412: name += 2;
1413: }
1414: if ( CUR_MODULE && !global )
1415: searchf(CUR_MODULE->usrf_list,name,&val);
1416: if ( !val )
1417: searchf(sysf,name,&val);
1418: if ( !val )
1419: searchf(ubinf,name,&val);
1420: if ( !val )
1421: searchpf(name,&val);
1422: if ( !val )
1423: searchuf(name,&val);
1424: if ( !val )
1425: appenduf(name,&val);
1426: *r = val;
1.34 noro 1427: }
1428:
1.70 noro 1429: void gen_searchf_searchonly(char *name,FUNC *r,int global)
1.34 noro 1430: {
1.80 noro 1431: FUNC val = 0;
1432: if ( *name == ':' ) {
1433: global = 1;
1434: name += 2;
1435: }
1436: if ( CUR_MODULE && !global )
1437: searchf(CUR_MODULE->usrf_list,name,&val);
1438: if ( !val )
1439: searchf(sysf,name,&val);
1440: if ( !val )
1441: searchf(ubinf,name,&val);
1442: if ( !val )
1443: searchpf(name,&val);
1444: if ( !val )
1445: searchuf(name,&val);
1446: *r = val;
1.12 noro 1447: }
1448:
1.16 noro 1449: void searchf(NODE fn,char *name,FUNC *r)
1.1 noro 1450: {
1.80 noro 1451: NODE tn;
1.1 noro 1452:
1.80 noro 1453: for ( tn = fn;
1454: tn && strcmp(NAME((FUNC)BDY(tn)),name); tn = NEXT(tn) );
1455: if ( tn ) {
1456: *r = (FUNC)BDY(tn);
1457: return;
1458: }
1459: *r = 0;
1.1 noro 1460: }
1461:
1.22 noro 1462: MODULE mkmodule(char *);
1463:
1.16 noro 1464: void appenduf(char *name,FUNC *r)
1.1 noro 1465: {
1.80 noro 1466: NODE tn;
1467: FUNC f;
1468: int len;
1469: MODULE mod;
1470: char *modname,*fname,*dot;
1471:
1472: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1473: f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
1474: if ( dot = strchr(name,'.') ) {
1475: /* undefined function in a module */
1476: len = dot-name;
1477: modname = (char *)MALLOC_ATOMIC(len+1);
1478: strncpy(modname,name,len); modname[len] = 0;
1479: fname = (char *)MALLOC_ATOMIC(strlen(name)-len+1);
1480: strcpy(fname,dot+1);
1481: f->name = fname;
1482: f->fullname = name;
1483: mod = searchmodule(modname);
1484: if ( !mod )
1485: mod = mkmodule(modname);
1486: MKNODE(tn,f,mod->usrf_list); mod->usrf_list = tn;
1487: } else {
1488: f->name = name;
1489: f->fullname = name;
1490: MKNODE(tn,f,usrf); usrf = tn;
1491: }
1492: *r = f;
1.1 noro 1493: }
1494:
1.25 noro 1495: void appenduf_local(char *name,FUNC *r)
1.24 noro 1496: {
1.80 noro 1497: NODE tn;
1498: FUNC f;
1499: MODULE mod;
1500:
1501: for ( tn = CUR_MODULE->usrf_list; tn; tn = NEXT(tn) )
1502: if ( !strcmp(((FUNC)BDY(tn))->name,name) )
1503: break;
1504: if ( tn )
1505: return;
1506:
1507: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1508: f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
1509: f->name = name;
1510: f->fullname =
1511: (char *)MALLOC_ATOMIC(strlen(CUR_MODULE->name)+strlen(name)+1);
1512: sprintf(f->fullname,"%s.%s",CUR_MODULE->name,name);
1513: MKNODE(tn,f,CUR_MODULE->usrf_list); CUR_MODULE->usrf_list = tn;
1514: *r = f;
1.24 noro 1515: }
1516:
1.25 noro 1517: void appenduflist(NODE n)
1518: {
1.80 noro 1519: NODE tn;
1520: FUNC f;
1.25 noro 1521:
1.80 noro 1522: for ( tn = n; tn; tn = NEXT(tn) )
1523: appenduf_local((char *)BDY(tn),&f);
1.25 noro 1524: }
1525:
1.16 noro 1526: void mkparif(char *name,FUNC *r)
1.1 noro 1527: {
1.80 noro 1528: FUNC f;
1.1 noro 1529:
1.80 noro 1530: *r = f =(FUNC)MALLOC(sizeof(struct oFUNC));
1531: f->name = name; f->id = A_PARI; f->argc = 0; f->f.binf = 0;
1532: f->fullname = name;
1.1 noro 1533: }
1534:
1.21 noro 1535: void mkuf(char *name,char *fname,NODE args,SNODE body,int startl,int endl,char *desc,MODULE module)
1.1 noro 1536: {
1.80 noro 1537: FUNC f;
1538: USRF t;
1539: NODE usrf_list,sn,tn;
1540: FNODE fn;
1541: char *longname;
1542: int argc;
1543:
1544: if ( getsecuremode() ) {
1545: error("defining function is not permitted in the secure mode");
1546: }
1547: if ( *name == ':' )
1548: name += 2;
1549: if ( !module ) {
1550: searchf(sysf,name,&f);
1551: if ( f ) {
1552: fprintf(stderr,"def : builtin function %s() cannot be redefined.\n",name);
1553: CPVS = GPVS; return;
1554: }
1555: }
1556: for ( argc = 0, sn = args; sn; argc++, sn = NEXT(sn) ) {
1557: fn = (FNODE)BDY(sn);
1558: if ( !fn || ID(fn) != I_PVAR ) {
1559: fprintf(stderr,"illegal argument in %s()\n",name);
1560: CPVS = GPVS; return;
1561: }
1562: }
1563: usrf_list = module ? module->usrf_list : usrf;
1564: for ( sn = usrf_list; sn && strcmp(NAME((FUNC)BDY(sn)),name); sn = NEXT(sn) );
1565: if ( sn )
1566: f = (FUNC)BDY(sn);
1567: else {
1568: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1569: f->name = name;
1570: MKNODE(tn,f,usrf_list); usrf_list = tn;
1571: if ( module ) {
1572: f->fullname =
1573: (char *)MALLOC_ATOMIC(strlen(f->name)+strlen(module->name)+1);
1574: sprintf(f->fullname,"%s.%s",module->name,f->name);
1575: module->usrf_list = usrf_list;
1576: } else {
1577: f->fullname = f->name;
1578: usrf = usrf_list;
1579: }
1580: }
1581: if ( Verbose && f->id != A_UNDEF ) {
1582: if ( module )
1583: fprintf(stderr,"Warning : %s.%s() redefined.\n",module->name,name);
1584: else
1585: fprintf(stderr,"Warning : %s() redefined.\n",name);
1586: }
1587: t=(USRF)MALLOC(sizeof(struct oUSRF));
1588: t->args=args; BDY(t)=body; t->pvs = CPVS; t->fname = fname;
1589: t->startl = startl; t->endl = endl; t->module = module;
1590: t->desc = desc;
1591: f->id = A_USR; f->argc = argc; f->f.usrf = t;
1592: CPVS = GPVS;
1593: CUR_FUNC = 0;
1594: clearbp(f);
1.1 noro 1595: }
1596:
1597: /*
1.80 noro 1598: retrieve value of an option whose key matches 'key'
1599: CVS->opt is a list(node) of key-value pair (list)
1600: CVS->opt = BDY([[key,value],[key,value],...])
1.1 noro 1601: */
1602:
1.16 noro 1603: Obj getopt_from_cpvs(char *key)
1.1 noro 1604: {
1.80 noro 1605: NODE opts,opt;
1606: LIST r;
1607: extern Obj VOIDobj;
1608:
1609: opts = CPVS->opt;
1610: if ( !key ) {
1611: MKLIST(r,opts);
1612: return (Obj)r;
1613: } else {
1614: for ( ; opts; opts = NEXT(opts) ) {
1615: asir_assert(BDY(opts),O_LIST,"getopt_from_cvps");
1616: opt = BDY((LIST)BDY(opts));
1617: if ( !strcmp(key,BDY((STRING)BDY(opt))) )
1618: return (Obj)BDY(NEXT(opt));
1619: }
1620: return VOIDobj;
1621: }
1.1 noro 1622:
1.21 noro 1623: }
1624:
1625: MODULE mkmodule(char *name)
1626: {
1.80 noro 1627: MODULE mod;
1628: NODE m;
1629: int len;
1630: VS mpvs;
1631:
1632: for ( m = MODULE_LIST; m; m = NEXT(m) ) {
1633: mod = (MODULE)m->body;
1634: if ( !strcmp(mod->name,name) )
1635: break;
1636: }
1637: if ( m )
1638: return mod;
1639: else {
1640: mod = (MODULE)MALLOC(sizeof(struct oMODULE));
1641: len = strlen(name);
1642: mod->name = (char *)MALLOC_ATOMIC(len+1);
1643: strcpy(mod->name,name);
1644: mod->pvs = mpvs = (VS)MALLOC(sizeof(struct oVS));
1645: asir_reallocarray((char **)&mpvs->va,(int *)&mpvs->asize,
1646: (int *)&mpvs->n,(int)sizeof(struct oPV));
1647: mod->usrf_list = 0;
1648: MKNODE(m,mod,MODULE_LIST);
1649: MODULE_LIST = m;
1650: return mod;
1651: }
1.23 noro 1652: }
1653:
1.24 noro 1654: void print_crossref(FUNC f)
1655: {
1.26 takayama 1656: FUNC r;
1657: if ( show_crossref && CUR_FUNC ) {
1.80 noro 1658: searchuf(f->fullname,&r);
1659: if (r != NULL) {
1660: fprintf(asir_out,"%s() at line %d in %s()\n",
1661: f->fullname, asir_infile->ln, CUR_FUNC);
1662: }
1.26 takayama 1663: }
1.1 noro 1664: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[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