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