![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to eval.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / parse|
Return to eval.c CVS log | Up to [local] / OpenXM_contrib2 / asir2000 / parse |
1.4 noro 1: /*
2: * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
3: * All rights reserved.
4: *
5: * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
6: * non-exclusive and royalty-free license to use, copy, modify and
7: * redistribute, solely for non-commercial and non-profit purposes, the
8: * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
9: * conditions of this Agreement. For the avoidance of doubt, you acquire
10: * only a limited right to use the SOFTWARE hereunder, and FLL or any
11: * third party developer retains all rights, including but not limited to
12: * copyrights, in and to the SOFTWARE.
13: *
14: * (1) FLL does not grant you a license in any way for commercial
15: * purposes. You may use the SOFTWARE only for non-commercial and
16: * non-profit purposes only, such as academic, research and internal
17: * business use.
18: * (2) The SOFTWARE is protected by the Copyright Law of Japan and
19: * international copyright treaties. If you make copies of the SOFTWARE,
20: * with or without modification, as permitted hereunder, you shall affix
21: * to all such copies of the SOFTWARE the above copyright notice.
22: * (3) An explicit reference to this SOFTWARE and its copyright owner
23: * shall be made on your publication or presentation in any form of the
24: * results obtained by use of the SOFTWARE.
25: * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
1.5 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.4 noro 27: * for such modification or the source code of the modified part of the
28: * SOFTWARE.
29: *
30: * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
31: * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
32: * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
33: * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
34: * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
35: * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
36: * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
37: * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
38: * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
39: * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
40: * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
41: * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
42: * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
43: * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
44: * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
45: * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
46: * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
47: *
1.74 ! fujimoto 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.73 2015/08/08 14:19:42 fujimoto 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.1 noro 64:
65: int f_break,f_return,f_continue;
66: int evalstatline;
67: int recv_intr;
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: {
75: LIST t;
76: STRING str;
77: pointer val = 0;
78: pointer a,a1,a2;
1.48 noro 79: NODE tn,tn1,ind,match;
1.1 noro 80: R u;
81: DP dp;
1.21 noro 82: unsigned int pv;
1.41 noro 83: int c,ret;
1.1 noro 84: FNODE f1;
85: UP2 up2;
86: UP up;
1.13 noro 87: UM um;
1.14 noro 88: Obj obj;
1.1 noro 89: GF2N gf2n;
90: GFPN gfpn;
1.13 noro 91: GFSN gfsn;
1.31 noro 92: RANGE range;
1.41 noro 93: QUOTE expr,pattern;
1.1 noro 94:
1.74 ! fujimoto 95: #if defined(VISUAL) || defined(__MINGW32__)
1.1 noro 96: if ( recv_intr ) {
97: #include <signal.h>
98: if ( recv_intr == 1 ) {
99: recv_intr = 0;
100: int_handler(SIGINT);
101: } else {
102: recv_intr = 0;
103: ox_usr1_handler(0);
104: }
105: }
106: #endif
107: if ( !f )
108: return ( 0 );
109: switch ( f->id ) {
1.10 noro 110: case I_PAREN:
111: val = eval((FNODE)(FA0(f)));
1.14 noro 112: break;
113: case I_MINUS:
114: a1 = eval((FNODE)(FA0(f)));
115: arf_chsgn((Obj)a1,&obj);
116: val = (pointer)obj;
1.10 noro 117: break;
1.1 noro 118: case I_BOP:
119: a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f));
120: (*((ARF)FA0(f))->fp)(CO,a1,a2,&val);
1.10 noro 121: break;
1.46 noro 122: case I_NARYOP:
123: tn = (NODE)FA1(f);
124: a = eval((FNODE)BDY(tn));
125: for ( tn = NEXT(tn); tn; tn = NEXT(tn) ) {
126: a1 = eval((FNODE)BDY(tn));
127: (*((ARF)FA0(f))->fp)(CO,a,a1,&a2);
128: a = a2;
129: }
130: val = a;
131: break;
1.1 noro 132: case I_COP:
133: a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f));
134: c = arf_comp(CO,a1,a2);
135: switch ( (cid)FA0(f) ) {
136: case C_EQ:
137: c = (c == 0); break;
138: case C_NE:
139: c = (c != 0); break;
140: case C_GT:
141: c = (c > 0); break;
142: case C_LT:
143: c = (c < 0); break;
144: case C_GE:
145: c = (c >= 0); break;
146: case C_LE:
147: c = (c <= 0); break;
148: default:
149: c = 0; break;
150: }
151: if ( c )
152: val = (pointer)ONE;
153: break;
154: case I_AND:
155: if ( eval((FNODE)FA0(f)) && eval((FNODE)FA1(f)) )
156: val = (pointer)ONE;
157: break;
158: case I_OR:
159: if ( eval((FNODE)FA0(f)) || eval((FNODE)FA1(f)) )
160: val = (pointer)ONE;
161: break;
162: case I_NOT:
163: if ( eval((FNODE)FA0(f)) )
164: val = 0;
165: else
166: val = (pointer)ONE;
167: break;
168: case I_LOP:
169: a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f));
170: val = evall((lid)FA0(f),a1,a2);
171: break;
172: case I_CE:
173: if ( eval((FNODE)FA0(f)) )
174: val = eval((FNODE)FA1(f));
175: else
176: val = eval((FNODE)FA2(f));
177: break;
178: case I_EV:
179: evalnodebody((NODE)FA0(f),&tn); nodetod(tn,&dp); val = (pointer)dp;
180: break;
181: case I_FUNC:
182: val = evalf((FUNC)FA0(f),(FNODE)FA1(f),0); break;
183: case I_FUNC_OPT:
184: val = evalf((FUNC)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break;
1.57 noro 185: case I_FUNC_QARG:
186: tn = BDY(eval_arg((FNODE)FA1(f),(unsigned int)0xffffffff));
187: val = bevalf((FUNC)FA0(f),tn); break;
1.1 noro 188: case I_PFDERIV:
1.44 noro 189: val = evalf_deriv((FUNC)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break;
1.1 noro 190: case I_MAP:
191: val = evalmapf((FUNC)FA0(f),(FNODE)FA1(f)); break;
1.9 noro 192: case I_RECMAP:
193: val = eval_rec_mapf((FUNC)FA0(f),(FNODE)FA1(f)); break;
1.1 noro 194: case I_IFUNC:
1.63 noro 195: val = evalif((FNODE)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break;
1.74 ! fujimoto 196: #if !defined(VISUAL) && !defined(__MINGW32__)
1.1 noro 197: case I_TIMER:
198: {
199: int interval;
200: Obj expired;
201:
202: interval = QTOS((Q)eval((FNODE)FA0(f)));
203: expired = (Obj)eval((FNODE)FA2(f));
204: set_timer(interval);
205: savepvs();
1.18 noro 206: if ( !SETJMP(timer_env) )
1.1 noro 207: val = eval((FNODE)FA1(f));
208: else {
209: val = (pointer)expired;
210: restorepvs();
211: }
212: reset_timer();
213: }
214: break;
215: #endif
216: case I_PRESELF:
217: f1 = (FNODE)FA1(f);
218: if ( ID(f1) == I_PVAR ) {
1.21 noro 219: pv = (unsigned int)FA0(f1); ind = (NODE)FA1(f1); GETPV(pv,a);
1.1 noro 220: if ( !ind ) {
221: (*((ARF)FA0(f))->fp)(CO,a,ONE,&val); ASSPV(pv,val);
222: } else if ( a ) {
223: evalnodebody(ind,&tn); getarray(a,tn,(pointer *)&u);
224: (*((ARF)FA0(f))->fp)(CO,u,ONE,&val); putarray(a,tn,val);
225: }
226: } else
1.6 noro 227: error("++ : not implemented yet");
1.1 noro 228: break;
229: case I_POSTSELF:
230: f1 = (FNODE)FA1(f);
231: if ( ID(f1) == I_PVAR ) {
1.21 noro 232: pv = (unsigned int)FA0(f1); ind = (NODE)FA1(f1); GETPV(pv,val);
1.1 noro 233: if ( !ind ) {
234: (*((ARF)FA0(f))->fp)(CO,val,ONE,&u); ASSPV(pv,u);
235: } else if ( val ) {
236: evalnodebody(ind,&tn); getarray(val,tn,&a);
237: (*((ARF)FA0(f))->fp)(CO,a,ONE,&u); putarray(val,tn,(pointer)u);
238: val = a;
239: }
240: } else
1.6 noro 241: error("-- : not implemented yet");
1.1 noro 242: break;
243: case I_PVAR:
1.39 noro 244: pv = (unsigned int)FA0(f);
245: ind = (NODE)FA1(f);
246: GETPV(pv,a);
1.1 noro 247: if ( !ind )
248: val = a;
249: else {
250: evalnodebody(ind,&tn); getarray(a,tn,&val);
251: }
252: break;
253: case I_ASSPVAR:
254: f1 = (FNODE)FA0(f);
255: if ( ID(f1) == I_PVAR ) {
1.21 noro 256: pv = (unsigned int)FA0(f1); ind = (NODE)FA1(f1);
1.1 noro 257: if ( !ind ) {
258: val = eval((FNODE)FA1(f)); ASSPV(pv,val);
259: } else {
260: GETPV(pv,a);
261: evalnodebody(ind,&tn);
262: putarray(a,tn,val = eval((FNODE)FA1(f)));
263: }
1.6 noro 264: } else if ( ID(f1) == I_POINT ) {
265: /* f1 <-> FA0(f1)->FA1(f1) */
266: a = eval(FA0(f1));
1.7 noro 267: assign_to_member(a,(char *)FA1(f1),val = eval((FNODE)FA1(f)));
268: } else if ( ID(f1) == I_INDEX ) {
269: /* f1 <-> FA0(f1)[FA1(f1)] */
270: a = eval((FNODE)FA0(f1)); ind = (NODE)FA1(f1);
271: evalnodebody(ind,&tn);
272: putarray(a,tn,val = eval((FNODE)FA1(f)));
1.15 noro 273: } else {
274: error("eval : invalid assignment");
1.6 noro 275: }
1.1 noro 276: break;
277: case I_ANS:
278: if ( (pv =(int)FA0(f)) < (int)APVS->n )
279: val = APVS->va[pv].priv;
280: break;
281: case I_GF2NGEN:
282: NEWUP2(up2,1);
283: up2->w=1;
284: up2->b[0] = 2; /* @ */
285: MKGF2N(up2,gf2n);
286: val = (pointer)gf2n;
287: break;
288: case I_GFPNGEN:
289: up = UPALLOC(1);
1.13 noro 290: DEG(up)=1;
291: COEF(up)[0] = 0;
292: COEF(up)[1] = (Num)ONELM;
1.1 noro 293: MKGFPN(up,gfpn);
294: val = (pointer)gfpn;
1.13 noro 295: break;
296: case I_GFSNGEN:
297: um = UMALLOC(1);
298: DEG(um) = 1;
299: COEF(um)[0] = 0;
300: COEF(um)[1] = _onesf();
301: MKGFSN(um,gfsn);
302: val = (pointer)gfsn;
1.1 noro 303: break;
304: case I_STR:
305: MKSTR(str,FA0(f)); val = (pointer)str; break;
306: case I_FORMULA:
307: val = FA0(f); break;
308: case I_LIST:
309: evalnodebody((NODE)FA0(f),&tn); MKLIST(t,tn); val = (pointer)t; break;
1.48 noro 310: case I_CONS:
311: evalnodebody((NODE)FA0(f),&tn); a2 = eval(FA1(f));
312: if ( !a2 || OID(a2) != O_LIST )
313: error("cons : invalid argument");
314: for ( tn1 = tn; NEXT(tn1); tn1 = NEXT(tn1) );
315: NEXT(tn1) = BDY((LIST)a2);
316: MKLIST(t,tn); val = (pointer)t;
317: break;
1.1 noro 318: case I_NEWCOMP:
319: newstruct((int)FA0(f),(struct oCOMP **)&val); break;
320: case I_CAR:
321: if ( !(a = eval((FNODE)FA0(f))) || (OID(a) != O_LIST) )
322: val = 0;
323: else if ( !BDY((LIST)a) )
324: val = a;
325: else
326: val = (pointer)BDY(BDY((LIST)a));
327: break;
328: case I_CDR:
329: if ( !(a = eval((FNODE)FA0(f))) || (OID(a) != O_LIST) )
330: val = 0;
331: else if ( !BDY((LIST)a) )
332: val = a;
333: else {
334: MKLIST(t,NEXT(BDY((LIST)a))); val = (pointer)t;
335: }
336: break;
337: case I_INDEX:
338: a = eval((FNODE)FA0(f)); ind = (NODE)FA1(f);
339: evalnodebody(ind,&tn); getarray(a,tn,&val);
340: break;
341: case I_OPT:
342: MKSTR(str,(char *)FA0(f));
343: a = (pointer)eval(FA1(f));
344: tn = mknode(2,str,a);
345: MKLIST(t,tn); val = (pointer)t;
346: break;
347: case I_GETOPT:
348: val = (pointer)getopt_from_cpvs((char *)FA0(f));
1.6 noro 349: break;
350: case I_POINT:
351: a = (pointer)eval(FA0(f));
352: val = (pointer)memberofstruct(a,(char *)FA1(f));
1.1 noro 353: break;
354: default:
355: error("eval : unknown id");
356: break;
357: }
358: return ( val );
1.45 noro 359: }
360:
1.51 noro 361: NODE fnode_to_nary_node(NODE);
362: NODE fnode_to_bin_node(NODE,int);
1.46 noro 363:
1.51 noro 364: FNODE fnode_to_nary(FNODE f)
1.46 noro 365: {
366: FNODE a0,a1,a2;
1.47 noro 367: NODE n,t,t0;
1.46 noro 368: pointer val;
369: char *op;
370:
371: if ( !f )
372: return f;
373: switch ( f->id ) {
1.47 noro 374: case I_NARYOP:
1.51 noro 375: n = fnode_to_nary_node((NODE)FA1(f));
1.47 noro 376: return mkfnode(2,I_NARYOP,FA0(f),n);
377:
1.46 noro 378: case I_BOP:
1.51 noro 379: a1 = fnode_to_nary((FNODE)FA1(f));
380: a2 = fnode_to_nary((FNODE)FA2(f));
1.46 noro 381: op = ((ARF)FA0(f))->name;
382: if ( !strcmp(op,"+") || !strcmp(op,"*") ) {
383: if ( a1->id == I_NARYOP && !strcmp(op,((ARF)FA0(a1))->name) ) {
1.47 noro 384: for ( n = (NODE)FA1(a1); NEXT(n); n = NEXT(n) );
1.46 noro 385: if ( a2->id == I_NARYOP && !strcmp(op,((ARF)FA0(a2))->name) )
1.47 noro 386: NEXT(n) = (NODE)FA1(a2);
1.46 noro 387: else
1.47 noro 388: MKNODE(NEXT(n),a2,0);
1.46 noro 389: return a1;
390: } else if ( a2->id == I_NARYOP && !strcmp(op,((ARF)FA0(a2))->name) ) {
391: MKNODE(t,a1,(NODE)FA1(a2));
1.47 noro 392: return mkfnode(2,I_NARYOP,FA0(f),t);
1.46 noro 393: } else {
394: t = mknode(2,a1,a2);
395: return mkfnode(2,I_NARYOP,FA0(f),t);
396: }
397: } else
398: return mkfnode(3,f->id,FA0(f),a1,a2);
399:
400: case I_NOT: case I_PAREN: case I_MINUS:
401: case I_CAR: case I_CDR:
1.51 noro 402: a0 = fnode_to_nary((FNODE)FA0(f));
1.46 noro 403: return mkfnode(1,f->id,a0);
404:
405: case I_COP: case I_LOP:
1.51 noro 406: a1 = fnode_to_nary((FNODE)FA1(f));
407: a2 = fnode_to_nary((FNODE)FA2(f));
1.46 noro 408: return mkfnode(3,f->id,FA0(f),a1,a2);
409:
410: case I_AND: case I_OR:
1.51 noro 411: a0 = fnode_to_nary((FNODE)FA0(f));
412: a1 = fnode_to_nary((FNODE)FA1(f));
1.46 noro 413: return mkfnode(2,f->id,a0,a1);
414:
415: /* ternary operators */
416: case I_CE:
1.51 noro 417: a0 = fnode_to_nary((FNODE)FA0(f));
418: a1 = fnode_to_nary((FNODE)FA1(f));
419: a2 = fnode_to_nary((FNODE)FA2(f));
1.46 noro 420: return mkfnode(3,f->id,a0,a1,a2);
421: break;
422:
423: /* function */
424: case I_FUNC:
1.51 noro 425: a1 = fnode_to_nary((FNODE)FA1(f));
1.46 noro 426: return mkfnode(2,f->id,FA0(f),a1);
427:
428: case I_LIST: case I_EV:
1.51 noro 429: n = fnode_to_nary_node((NODE)FA0(f));
1.46 noro 430: return mkfnode(1,f->id,n);
431:
432: case I_STR: case I_FORMULA: case I_PVAR:
433: return f;
434:
435: default:
1.51 noro 436: error("fnode_to_nary : not implemented yet");
1.46 noro 437: }
438: }
439:
1.51 noro 440: FNODE fnode_to_bin(FNODE f,int dir)
1.46 noro 441: {
442: FNODE a0,a1,a2;
443: NODE n,t;
444: pointer val;
445: ARF fun;
446: int len,i;
447: FNODE *arg;
448:
449: if ( !f )
450: return f;
451: switch ( f->id ) {
452: case I_NARYOP:
453: fun = (ARF)FA0(f);
454: len = length((NODE)FA1(f));
1.53 noro 455: if ( len==1 ) return BDY((NODE)(FA1(f)));
456:
1.46 noro 457: arg = (FNODE *)ALLOCA(len*sizeof(FNODE));
458: for ( i = 0, t = (NODE)FA1(f); i < len; i++, t = NEXT(t) )
1.51 noro 459: arg[i] = fnode_to_bin((FNODE)BDY(t),dir);
1.46 noro 460: if ( dir ) {
461: a2 = mkfnode(3,I_BOP,fun,arg[len-2],arg[len-1]);
462: for ( i = len-3; i >= 0; i-- )
463: a2 = mkfnode(3,I_BOP,fun,arg[i],a2);
464: } else {
465: a2 = mkfnode(3,I_BOP,fun,arg[0],arg[1]);
466: for ( i = 2; i < len; i++ )
467: a2 = mkfnode(3,I_BOP,fun,a2,arg[i]);
468: }
469: return a2;
470:
471: case I_NOT: case I_PAREN: case I_MINUS:
472: case I_CAR: case I_CDR:
1.51 noro 473: a0 = fnode_to_bin((FNODE)FA0(f),dir);
1.46 noro 474: return mkfnode(1,f->id,a0);
475:
476: case I_BOP: case I_COP: case I_LOP:
1.51 noro 477: a1 = fnode_to_bin((FNODE)FA1(f),dir);
478: a2 = fnode_to_bin((FNODE)FA2(f),dir);
1.46 noro 479: return mkfnode(3,f->id,FA0(f),a1,a2);
480:
481: case I_AND: case I_OR:
1.51 noro 482: a0 = fnode_to_bin((FNODE)FA0(f),dir);
483: a1 = fnode_to_bin((FNODE)FA1(f),dir);
1.46 noro 484: return mkfnode(2,f->id,a0,a1);
485:
486: /* ternary operators */
487: case I_CE:
1.51 noro 488: a0 = fnode_to_bin((FNODE)FA0(f),dir);
489: a1 = fnode_to_bin((FNODE)FA1(f),dir);
490: a2 = fnode_to_bin((FNODE)FA2(f),dir);
1.46 noro 491: return mkfnode(3,f->id,a0,a1,a2);
492: break;
493:
494: /* function */
495: case I_FUNC:
1.51 noro 496: a1 = fnode_to_bin((FNODE)FA1(f),dir);
1.46 noro 497: return mkfnode(2,f->id,FA0(f),a1);
498:
499: case I_LIST: case I_EV:
1.51 noro 500: n = fnode_to_bin_node((NODE)FA0(f),dir);
1.46 noro 501: return mkfnode(1,f->id,n);
502:
503: case I_STR: case I_FORMULA: case I_PVAR:
504: return f;
505:
506: default:
1.51 noro 507: error("fnode_to_bin : not implemented yet");
1.46 noro 508: }
509: }
510:
1.45 noro 511: NODE partial_eval_node(NODE n);
512: FNODE partial_eval(FNODE f);
513:
514: FNODE partial_eval(FNODE f)
515: {
516: FNODE a0,a1,a2;
517: NODE n;
1.55 noro 518: Obj obj;
519: QUOTE q;
1.45 noro 520: pointer val;
1.56 noro 521: FUNC func;
1.45 noro 522:
523: if ( !f )
524: return f;
525: switch ( f->id ) {
526: case I_NOT: case I_PAREN: case I_MINUS:
527: case I_CAR: case I_CDR:
528: a0 = partial_eval((FNODE)FA0(f));
529: return mkfnode(1,f->id,a0);
530:
531: case I_BOP: case I_COP: case I_LOP:
532: a1 = partial_eval((FNODE)FA1(f));
533: a2 = partial_eval((FNODE)FA2(f));
534: return mkfnode(3,f->id,FA0(f),a1,a2);
535:
1.50 noro 536: case I_NARYOP:
537: n = partial_eval_node((NODE)FA1(f));
538: return mkfnode(2,f->id,FA0(f),n);
539:
1.45 noro 540: case I_AND: case I_OR:
541: a0 = partial_eval((FNODE)FA0(f));
542: a1 = partial_eval((FNODE)FA1(f));
543: return mkfnode(2,f->id,a0,a1);
544:
545: /* ternary operators */
546: case I_CE:
547: a0 = partial_eval((FNODE)FA0(f));
548: a1 = partial_eval((FNODE)FA1(f));
549: a2 = partial_eval((FNODE)FA2(f));
550: return mkfnode(3,f->id,a0,a1,a2);
551: break;
552:
1.58 noro 553: /* XXX : function is evaluated with QUOTE args */
554: case I_FUNC:
1.45 noro 555: a1 = partial_eval((FNODE)FA1(f));
1.56 noro 556: func = (FUNC)FA0(f);
1.59 noro 557: if ( func->id == A_UNDEF || func->id != A_USR ) {
1.58 noro 558: a1 = mkfnode(2,I_FUNC,func,a1);
1.56 noro 559: return a1;
1.58 noro 560: } else {
561: n = BDY(eval_arg(a1,(unsigned int)0xffffffff));
562: obj = bevalf(func,n);
1.56 noro 563: objtoquote(obj,&q);
564: return BDY(q);
565: }
1.55 noro 566: break;
1.45 noro 567:
568: case I_LIST: case I_EV:
569: n = partial_eval_node((NODE)FA0(f));
570: return mkfnode(1,f->id,n);
571:
572: case I_STR: case I_FORMULA:
573: return f;
574:
575: /* program variable */
576: case I_PVAR:
577: val = eval(f);
578: if ( val && OID((Obj)val) == O_QUOTE )
579: return partial_eval((FNODE)BDY((QUOTE)val));
580: else
581: return mkfnode(1,I_FORMULA,val);
582:
583: default:
584: error("partial_eval : not implemented yet");
585: }
586: }
587:
588: NODE partial_eval_node(NODE n)
589: {
590: NODE r0,r,t;
591:
592: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
593: NEXTNODE(r0,r);
594: BDY(r) = partial_eval((FNODE)BDY(t));
1.49 noro 595: }
596: if ( r0 ) NEXT(r) = 0;
597: return r0;
598: }
599:
1.57 noro 600: NODE rewrite_fnode_node(NODE n,NODE arg,int qarg);
601: FNODE rewrite_fnode(FNODE f,NODE arg,int qarg);
1.49 noro 602:
1.57 noro 603: FNODE rewrite_fnode(FNODE f,NODE arg,int qarg)
1.49 noro 604: {
605: FNODE a0,a1,a2,value;
606: NODE n,t,pair;
607: pointer val;
608: int pv,ind;
609:
610: if ( !f )
611: return f;
612: switch ( f->id ) {
613: case I_NOT: case I_PAREN: case I_MINUS:
614: case I_CAR: case I_CDR:
1.57 noro 615: a0 = rewrite_fnode((FNODE)FA0(f),arg,qarg);
1.49 noro 616: return mkfnode(1,f->id,a0);
617:
618: case I_BOP: case I_COP: case I_LOP:
1.57 noro 619: a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg);
620: a2 = rewrite_fnode((FNODE)FA2(f),arg,qarg);
1.49 noro 621: return mkfnode(3,f->id,FA0(f),a1,a2);
622:
623: case I_AND: case I_OR:
1.57 noro 624: a0 = rewrite_fnode((FNODE)FA0(f),arg,qarg);
625: a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg);
1.49 noro 626: return mkfnode(2,f->id,a0,a1);
627:
628: /* ternary operators */
629: case I_CE:
1.57 noro 630: a0 = rewrite_fnode((FNODE)FA0(f),arg,qarg);
631: a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg);
632: a2 = rewrite_fnode((FNODE)FA2(f),arg,qarg);
1.49 noro 633: return mkfnode(3,f->id,a0,a1,a2);
634: break;
635:
1.52 noro 636: /* nary operators */
637: case I_NARYOP:
1.57 noro 638: n = rewrite_fnode_node((NODE)FA1(f),arg,qarg);
1.52 noro 639: return mkfnode(2,f->id,FA0(f),n);
640:
641: /* and function */
1.49 noro 642: case I_FUNC:
1.57 noro 643: a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg);
644: return mkfnode(2,qarg?I_FUNC_QARG:f->id,FA0(f),a1);
1.49 noro 645:
646: case I_LIST: case I_EV:
1.57 noro 647: n = rewrite_fnode_node((NODE)FA0(f),arg,qarg);
1.49 noro 648: return mkfnode(1,f->id,n);
649:
650: case I_STR: case I_FORMULA:
651: return f;
652:
653: /* program variable */
654: case I_PVAR:
655: pv = (int)FA0(f);
656: for ( t = arg; t; t = NEXT(t) ) {
657: pair = (NODE)BDY(t);
1.57 noro 658: ind = (int)BDY(pair);
659: value = (FNODE)BDY(NEXT(pair));
1.49 noro 660: if ( pv == ind )
661: return value;
662: }
663: return f;
664: break;
665:
666: default:
667: error("rewrite_fnode : not implemented yet");
668: }
669: }
670:
1.57 noro 671: NODE rewrite_fnode_node(NODE n,NODE arg,int qarg)
1.49 noro 672: {
673: NODE r0,r,t;
674:
675: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
676: NEXTNODE(r0,r);
1.57 noro 677: BDY(r) = rewrite_fnode((FNODE)BDY(t),arg,qarg);
1.46 noro 678: }
679: if ( r0 ) NEXT(r) = 0;
680: return r0;
681: }
682:
1.51 noro 683: NODE fnode_to_nary_node(NODE n)
1.46 noro 684: {
685: NODE r0,r,t;
686:
687: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
688: NEXTNODE(r0,r);
1.51 noro 689: BDY(r) = fnode_to_nary((FNODE)BDY(t));
1.46 noro 690: }
691: if ( r0 ) NEXT(r) = 0;
692: return r0;
693: }
694:
1.51 noro 695: NODE fnode_to_bin_node(NODE n,int dir)
1.46 noro 696: {
697: NODE r0,r,t;
698:
699: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
700: NEXTNODE(r0,r);
1.51 noro 701: BDY(r) = fnode_to_bin((FNODE)BDY(t),dir);
1.45 noro 702: }
703: if ( r0 ) NEXT(r) = 0;
704: return r0;
1.1 noro 705: }
706:
1.43 noro 707: V searchvar(char *name);
708:
1.16 noro 709: pointer evalstat(SNODE f)
1.1 noro 710: {
711: pointer val = 0,t,s,s1;
712: P u;
713: NODE tn;
714: int i,ac;
1.43 noro 715: V v;
1.1 noro 716: V *a;
717: char *buf;
1.43 noro 718: FUNC func;
1.1 noro 719:
720: if ( !f )
721: return ( 0 );
722: if ( nextbp && nextbplevel <= 0 && f->id != S_CPLX ) {
723: nextbp = 0;
724: bp(f);
725: }
726: evalstatline = f->ln;
1.60 noro 727: if ( !PVSS ) at_root = evalstatline;
1.1 noro 728:
729: switch ( f->id ) {
730: case S_BP:
731: if ( !nextbp && (!FA1(f) || eval((FNODE)FA1(f))) ) {
732: if ( (FNODE)FA2(f) ) {
733: asir_out = stderr;
734: printexpr(CO,eval((FNODE)FA2(f)));
735: putc('\n',asir_out); fflush(asir_out);
736: asir_out = stdout;
737: } else {
738: nextbp = 1; nextbplevel = 0;
739: }
740: }
741: val = evalstat((SNODE)FA0(f));
742: break;
743: case S_PFDEF:
744: ac = argc(FA1(f)); a = (V *)MALLOC(ac*sizeof(V));
745: s = eval((FNODE)FA2(f));
746: buf = (char *)ALLOCA(BUFSIZ);
747: for ( i = 0, tn = (NODE)FA1(f); tn; tn = NEXT(tn), i++ ) {
748: t = eval((FNODE)tn->body); sprintf(buf,"_%s",NAME(VR((P)t)));
749: makevar(buf,&u); a[i] = VR(u);
750: substr(CO,0,(Obj)s,VR((P)t),(Obj)u,(Obj *)&s1); s = s1;
751: }
1.43 noro 752: mkpf((char *)FA0(f),(Obj)s,ac,a,0,0,0,(PF *)&val); val = 0;
753: v = searchvar((char *)FA0(f));
754: if ( v ) {
755: searchpf((char *)FA0(f),&func);
756: makesrvar(func,&u);
757: }
758: break;
1.1 noro 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 ( GPVS != CPVS )
771: f_break = 1;
772: break;
773: case S_CONTINUE:
774: if ( GPVS != CPVS )
775: f_continue = 1;
776: break;
777: case S_RETURN:
778: if ( 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;
1.40 noro 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;
1.1 noro 817: default:
818: error("evalstat : unknown id");
819: break;
820: }
821: return ( val );
822: }
823:
1.16 noro 824: pointer evalnode(NODE node)
1.1 noro 825: {
826: NODE tn;
827: pointer val;
828:
829: for ( tn = node, val = 0; tn; tn = NEXT(tn) )
830: if ( BDY(tn) )
831: val = eval((FNODE)BDY(tn));
832: return ( val );
833: }
834:
835:
1.44 noro 836: LIST eval_arg(FNODE a,unsigned int quote)
837: {
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;
861: }
862:
1.16 noro 863: pointer evalf(FUNC f,FNODE a,FNODE opt)
1.1 noro 864: {
865: LIST args;
866: pointer val;
867: int i,n,level;
1.30 noro 868: NODE tn,sn,opts,opt1,dmy;
869: VS pvs,prev_mpvs;
1.1 noro 870: char errbuf[BUFSIZ];
1.19 saito 871: static unsigned int stack_size;
1.12 noro 872: static void *stack_base;
1.43 noro 873: FUNC f1;
1.1 noro 874:
875: if ( f->id == A_UNDEF ) {
1.70 noro 876: gen_searchf_searchonly(f->fullname,&f1,0);
1.43 noro 877: if ( f1->id == A_UNDEF ) {
878: sprintf(errbuf,"evalf : %s undefined",NAME(f));
879: error(errbuf);
880: } else
881: *f = *f1;
1.36 noro 882: }
883: if ( getsecuremode() && !PVSS && !f->secure ) {
884: sprintf(errbuf,"evalf : %s not permitted",NAME(f));
1.1 noro 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:
1.30 noro 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;
1.1 noro 910: if ( !n ) {
1.68 noro 911: current_option = opts;
1.1 noro 912: cur_binf = f;
913: (*f->f.binf)(&val);
914: } else {
1.44 noro 915: args = (LIST)eval_arg(a,f->quote);
1.33 noro 916: current_option = opts;
1.1 noro 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:
1.12 noro 929: /* stack check */
1.74 ! fujimoto 930: #if !defined(VISUAL) && !defined(__MINGW32__) && !defined(__CYGWIN__)
1.12 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.12 noro 943: if ( (stack_base - (void *)&args) +0x100000 > stack_size )
944: error("stack overflow");
945: #endif
1.44 noro 946: args = (LIST)eval_arg(a,f->quote);
1.11 noro 947: if ( opt ) {
1.1 noro 948: opts = BDY((LIST)eval(opt));
1.11 noro 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
1.1 noro 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));
1.66 noro 982: f_return = f_break = f_continue = 0;
1.21 noro 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));
1.1 noro 990: f_return = f_break = f_continue = 0; poppvs();
1.67 noro 991: if ( PVSS )
992: evalstatline = ((VS)BDY(PVSS))->at;
1.1 noro 993: break;
994: case A_PURE:
995: args = (LIST)eval(a);
1.44 noro 996: val = evalpf(f->f.puref,args?BDY(args):0,0);
1.1 noro 997: break;
998: default:
999: sprintf(errbuf,"evalf : %s undefined",NAME(f));
1000: error(errbuf);
1001: break;
1002: }
1003: return val;
1004: }
1005:
1.44 noro 1006: pointer evalf_deriv(FUNC f,FNODE a,FNODE deriv)
1007: {
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;
1026: }
1027:
1.16 noro 1028: pointer evalmapf(FUNC f,FNODE a)
1.1 noro 1029: {
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:
1.44 noro 1039: args = (LIST)eval_arg(a,f->quote);
1.1 noro 1040: node = BDY(args); head = (Obj)BDY(node); rest = NEXT(node);
1.3 noro 1041: if ( !head ) {
1042: val = bevalf(f,node);
1043: return val;
1044: }
1.1 noro 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);
1.9 noro 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;
1076: }
1077:
1.16 noro 1078: pointer eval_rec_mapf(FUNC f,FNODE a)
1.9 noro 1079: {
1080: LIST args;
1081:
1.44 noro 1082: args = (LIST)eval_arg(a,f->quote);
1.9 noro 1083: return beval_rec_mapf(f,BDY(args));
1084: }
1085:
1.16 noro 1086: pointer beval_rec_mapf(FUNC f,NODE node)
1.9 noro 1087: {
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);
1.1 noro 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;
1134: }
1135:
1.16 noro 1136: pointer bevalf(FUNC f,NODE a)
1.1 noro 1137: {
1138: pointer val;
1139: int i,n;
1140: NODE tn,sn;
1.44 noro 1141: VS pvs,prev_mpvs;
1.1 noro 1142: char errbuf[BUFSIZ];
1143:
1144: if ( f->id == A_UNDEF ) {
1145: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
1.37 noro 1146: error(errbuf);
1147: }
1148: if ( getsecuremode() && !PVSS && !f->secure ) {
1149: sprintf(errbuf,"bevalf : %s not permitted",NAME(f));
1.1 noro 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:
1.68 noro 1161: current_option = 0;
1.1 noro 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));
1.66 noro 1194: f_return = f_break = f_continue = 0;
1.39 noro 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));
1.1 noro 1202: f_return = f_break = f_continue = 0; poppvs();
1203: break;
1204: case A_PURE:
1.44 noro 1205: val = evalpf(f->f.puref,a,0);
1.1 noro 1206: break;
1207: default:
1208: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
1209: error(errbuf);
1210: break;
1211: }
1212: return val;
1213: }
1214:
1.64 ohara 1215: pointer bevalf_with_opts(FUNC f,NODE a,NODE opts)
1216: {
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));
1.66 noro 1273: f_return = f_break = f_continue = 0;
1.64 ohara 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;
1292: }
1293:
1.63 noro 1294: pointer evalif(FNODE f,FNODE a,FNODE opt)
1.1 noro 1295: {
1296: Obj g;
1.50 noro 1297: QUOTE q;
1.41 noro 1298: FNODE t;
1.50 noro 1299: LIST l;
1.1 noro 1300:
1301: g = (Obj)eval(f);
1302: if ( g && (OID(g) == O_P) && (VR((P)g)->attr == (pointer)V_SR) )
1.63 noro 1303: return evalf((FUNC)VR((P)g)->priv,a,opt);
1.41 noro 1304: else if ( g && OID(g) == O_QUOTEARG && ((QUOTEARG)g)->type == A_func ) {
1305: t = mkfnode(2,I_FUNC,((QUOTEARG)g)->body,a);
1.50 noro 1306: MKQUOTE(q,t);
1307: return q;
1.41 noro 1308: } else {
1.1 noro 1309: error("invalid function pointer");
1.16 noro 1310: /* NOTREACHED */
1311: return (pointer)-1;
1.1 noro 1312: }
1313: }
1314:
1.44 noro 1315: pointer evalpf(PF pf,NODE args,NODE dargs)
1.1 noro 1316: {
1317: Obj s,s1;
1.54 noro 1318: int i,di,j;
1.44 noro 1319: NODE node,dnode;
1.1 noro 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;
1.44 noro 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);
1.1 noro 1334: }
1335: simplify_ins(ins,&s);
1336: } else {
1.54 noro 1337: s = pf->body;
1.69 noro 1338: if ( dargs ) {
1.54 noro 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++ ) {
1.1 noro 1347: substr(CO,0,s,pf->args[i],(Obj)node->body,&s1); s = s1;
1348: }
1349: }
1350: return (pointer)s;
1351: }
1352:
1.16 noro 1353: void evalnodebody(NODE sn,NODE *dnp)
1.1 noro 1354: {
1355: NODE n,n0,tn;
1356: int line;
1357:
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;
1369: }
1370:
1.21 noro 1371: MODULE searchmodule(char *name)
1372: {
1373: MODULE mod;
1374: NODE m;
1375:
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;
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: {
1391: MODULE mod;
1392: char *name0,*dot;
1393:
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);
1404: }
1405:
1.16 noro 1406: void gen_searchf(char *name,FUNC *r)
1.12 noro 1407: {
1.21 noro 1408: FUNC val = 0;
1.29 noro 1409: int global = 0;
1410: if ( *name == ':' ) {
1411: global = 1;
1412: name += 2;
1413: }
1414: if ( CUR_MODULE && !global )
1.21 noro 1415: searchf(CUR_MODULE->usrf_list,name,&val);
1.25 noro 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);
1.34 noro 1426: *r = val;
1427: }
1428:
1.70 noro 1429: void gen_searchf_searchonly(char *name,FUNC *r,int global)
1.34 noro 1430: {
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);
1.12 noro 1446: *r = val;
1447: }
1448:
1.16 noro 1449: void searchf(NODE fn,char *name,FUNC *r)
1.1 noro 1450: {
1451: NODE tn;
1452:
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;
1460: }
1461:
1.22 noro 1462: MODULE mkmodule(char *);
1463:
1.16 noro 1464: void appenduf(char *name,FUNC *r)
1.1 noro 1465: {
1466: NODE tn;
1467: FUNC f;
1.22 noro 1468: int len;
1469: MODULE mod;
1470: char *modname,*fname,*dot;
1.1 noro 1471:
1472: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1.22 noro 1473: f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
1474: if ( dot = strchr(name,'.') ) {
1.28 noro 1475: /* undefined function in a module */
1.22 noro 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;
1.25 noro 1482: f->fullname = name;
1.28 noro 1483: mod = searchmodule(modname);
1484: if ( !mod )
1485: mod = mkmodule(modname);
1486: MKNODE(tn,f,mod->usrf_list); mod->usrf_list = tn;
1.21 noro 1487: } else {
1.22 noro 1488: f->name = name;
1.25 noro 1489: f->fullname = name;
1490: MKNODE(tn,f,usrf); usrf = tn;
1.21 noro 1491: }
1.1 noro 1492: *r = f;
1493: }
1494:
1.25 noro 1495: void appenduf_local(char *name,FUNC *r)
1.24 noro 1496: {
1497: NODE tn;
1498: FUNC f;
1.25 noro 1499: MODULE mod;
1.24 noro 1500:
1.27 noro 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:
1.24 noro 1507: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1508: f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
1.25 noro 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;
1.24 noro 1514: *r = f;
1515: }
1516:
1.25 noro 1517: void appenduflist(NODE n)
1518: {
1519: NODE tn;
1520: FUNC f;
1521:
1522: for ( tn = n; tn; tn = NEXT(tn) )
1523: appenduf_local((char *)BDY(tn),&f);
1524: }
1525:
1.16 noro 1526: void mkparif(char *name,FUNC *r)
1.1 noro 1527: {
1528: FUNC f;
1529:
1530: *r = f =(FUNC)MALLOC(sizeof(struct oFUNC));
1531: f->name = name; f->id = A_PARI; f->argc = 0; f->f.binf = 0;
1.27 noro 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: {
1537: FUNC f;
1538: USRF t;
1.21 noro 1539: NODE usrf_list,sn,tn;
1.1 noro 1540: FNODE fn;
1.21 noro 1541: char *longname;
1.1 noro 1542: int argc;
1543:
1.38 noro 1544: if ( getsecuremode() ) {
1545: error("defining function is not permitted in the secure mode");
1546: }
1.29 noro 1547: if ( *name == ':' )
1548: name += 2;
1.21 noro 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: }
1.1 noro 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: }
1.21 noro 1563: usrf_list = module ? module->usrf_list : usrf;
1564: for ( sn = usrf_list; sn && strcmp(NAME((FUNC)BDY(sn)),name); sn = NEXT(sn) );
1.1 noro 1565: if ( sn )
1566: f = (FUNC)BDY(sn);
1567: else {
1568: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1569: f->name = name;
1.21 noro 1570: MKNODE(tn,f,usrf_list); usrf_list = tn;
1.25 noro 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);
1.21 noro 1575: module->usrf_list = usrf_list;
1.25 noro 1576: } else {
1577: f->fullname = f->name;
1.21 noro 1578: usrf = usrf_list;
1.25 noro 1579: }
1.21 noro 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);
1.1 noro 1586: }
1587: t=(USRF)MALLOC(sizeof(struct oUSRF));
1588: t->args=args; BDY(t)=body; t->pvs = CPVS; t->fname = fname;
1.21 noro 1589: t->startl = startl; t->endl = endl; t->module = module;
1.1 noro 1590: t->desc = desc;
1591: f->id = A_USR; f->argc = argc; f->f.usrf = t;
1592: CPVS = GPVS;
1.24 noro 1593: CUR_FUNC = 0;
1.1 noro 1594: clearbp(f);
1595: }
1596:
1597: /*
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],...])
1601: */
1602:
1.16 noro 1603: Obj getopt_from_cpvs(char *key)
1.1 noro 1604: {
1605: NODE opts,opt;
1.12 noro 1606: LIST r;
1.1 noro 1607: extern Obj VOIDobj;
1608:
1609: opts = CPVS->opt;
1.12 noro 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;
1.1 noro 1621: }
1622:
1.21 noro 1623: }
1624:
1625: MODULE mkmodule(char *name)
1626: {
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: 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 ) {
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: }
1663: }
1.1 noro 1664: }