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