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