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