![[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.54 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.53 2005/10/19 14:09:13 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;
511: pointer val;
512:
513: if ( !f )
514: return f;
515: switch ( f->id ) {
516: case I_NOT: case I_PAREN: case I_MINUS:
517: case I_CAR: case I_CDR:
518: a0 = partial_eval((FNODE)FA0(f));
519: return mkfnode(1,f->id,a0);
520:
521: case I_BOP: case I_COP: case I_LOP:
522: a1 = partial_eval((FNODE)FA1(f));
523: a2 = partial_eval((FNODE)FA2(f));
524: return mkfnode(3,f->id,FA0(f),a1,a2);
525:
1.50 noro 526: case I_NARYOP:
527: n = partial_eval_node((NODE)FA1(f));
528: return mkfnode(2,f->id,FA0(f),n);
529:
1.45 noro 530: case I_AND: case I_OR:
531: a0 = partial_eval((FNODE)FA0(f));
532: a1 = partial_eval((FNODE)FA1(f));
533: return mkfnode(2,f->id,a0,a1);
534:
535: /* ternary operators */
536: case I_CE:
537: a0 = partial_eval((FNODE)FA0(f));
538: a1 = partial_eval((FNODE)FA1(f));
539: a2 = partial_eval((FNODE)FA2(f));
540: return mkfnode(3,f->id,a0,a1,a2);
541: break;
542:
543: /* function */
544: case I_FUNC:
545: a1 = partial_eval((FNODE)FA1(f));
546: return mkfnode(2,f->id,FA0(f),a1);
547:
548: case I_LIST: case I_EV:
549: n = partial_eval_node((NODE)FA0(f));
550: return mkfnode(1,f->id,n);
551:
552: case I_STR: case I_FORMULA:
553: return f;
554:
555: /* program variable */
556: case I_PVAR:
557: val = eval(f);
558: if ( val && OID((Obj)val) == O_QUOTE )
559: return partial_eval((FNODE)BDY((QUOTE)val));
560: else
561: return mkfnode(1,I_FORMULA,val);
562:
563: default:
564: error("partial_eval : not implemented yet");
565: }
566: }
567:
568: NODE partial_eval_node(NODE n)
569: {
570: NODE r0,r,t;
571:
572: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
573: NEXTNODE(r0,r);
574: BDY(r) = partial_eval((FNODE)BDY(t));
1.49 noro 575: }
576: if ( r0 ) NEXT(r) = 0;
577: return r0;
578: }
579:
580: NODE rewrite_fnode_node(NODE n,NODE arg);
581: FNODE rewrite_fnode(FNODE f,NODE arg);
582:
583: FNODE rewrite_fnode(FNODE f,NODE arg)
584: {
585: FNODE a0,a1,a2,value;
586: NODE n,t,pair;
587: pointer val;
588: int pv,ind;
589:
590: if ( !f )
591: return f;
592: switch ( f->id ) {
593: case I_NOT: case I_PAREN: case I_MINUS:
594: case I_CAR: case I_CDR:
595: a0 = rewrite_fnode((FNODE)FA0(f),arg);
596: return mkfnode(1,f->id,a0);
597:
598: case I_BOP: case I_COP: case I_LOP:
599: a1 = rewrite_fnode((FNODE)FA1(f),arg);
600: a2 = rewrite_fnode((FNODE)FA2(f),arg);
601: return mkfnode(3,f->id,FA0(f),a1,a2);
602:
603: case I_AND: case I_OR:
604: a0 = rewrite_fnode((FNODE)FA0(f),arg);
605: a1 = rewrite_fnode((FNODE)FA1(f),arg);
606: return mkfnode(2,f->id,a0,a1);
607:
608: /* ternary operators */
609: case I_CE:
610: a0 = rewrite_fnode((FNODE)FA0(f),arg);
611: a1 = rewrite_fnode((FNODE)FA1(f),arg);
612: a2 = rewrite_fnode((FNODE)FA2(f),arg);
613: return mkfnode(3,f->id,a0,a1,a2);
614: break;
615:
1.52 noro 616: /* nary operators */
617: case I_NARYOP:
618: n = rewrite_fnode_node((NODE)FA1(f),arg);
619: return mkfnode(2,f->id,FA0(f),n);
620:
621: /* and function */
1.49 noro 622: case I_FUNC:
623: a1 = rewrite_fnode((FNODE)FA1(f),arg);
624: return mkfnode(2,f->id,FA0(f),a1);
625:
626: case I_LIST: case I_EV:
627: n = rewrite_fnode_node((NODE)FA0(f),arg);
628: return mkfnode(1,f->id,n);
629:
630: case I_STR: case I_FORMULA:
631: return f;
632:
633: /* program variable */
634: case I_PVAR:
635: pv = (int)FA0(f);
636: for ( t = arg; t; t = NEXT(t) ) {
637: pair = (NODE)BDY(t);
638: ind = (int)BDY(pair); value = (FNODE)BDY(NEXT(pair));
639: if ( pv == ind )
640: return value;
641: }
642: return f;
643: break;
644:
645: default:
646: error("rewrite_fnode : not implemented yet");
647: }
648: }
649:
650: NODE rewrite_fnode_node(NODE n,NODE arg)
651: {
652: NODE r0,r,t;
653:
654: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
655: NEXTNODE(r0,r);
656: BDY(r) = rewrite_fnode((FNODE)BDY(t),arg);
1.46 noro 657: }
658: if ( r0 ) NEXT(r) = 0;
659: return r0;
660: }
661:
1.51 noro 662: NODE fnode_to_nary_node(NODE n)
1.46 noro 663: {
664: NODE r0,r,t;
665:
666: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
667: NEXTNODE(r0,r);
1.51 noro 668: BDY(r) = fnode_to_nary((FNODE)BDY(t));
1.46 noro 669: }
670: if ( r0 ) NEXT(r) = 0;
671: return r0;
672: }
673:
1.51 noro 674: NODE fnode_to_bin_node(NODE n,int dir)
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_bin((FNODE)BDY(t),dir);
1.45 noro 681: }
682: if ( r0 ) NEXT(r) = 0;
683: return r0;
1.1 noro 684: }
685:
1.43 noro 686: V searchvar(char *name);
687:
1.16 noro 688: pointer evalstat(SNODE f)
1.1 noro 689: {
690: pointer val = 0,t,s,s1;
691: P u;
692: NODE tn;
693: int i,ac;
1.43 noro 694: V v;
1.1 noro 695: V *a;
696: char *buf;
1.43 noro 697: FUNC func;
1.1 noro 698:
699: if ( !f )
700: return ( 0 );
701: if ( nextbp && nextbplevel <= 0 && f->id != S_CPLX ) {
702: nextbp = 0;
703: bp(f);
704: }
705: evalstatline = f->ln;
706:
707: switch ( f->id ) {
708: case S_BP:
709: if ( !nextbp && (!FA1(f) || eval((FNODE)FA1(f))) ) {
710: if ( (FNODE)FA2(f) ) {
1.20 ohara 711: #if defined(PARI)
1.1 noro 712: pari_outfile = stderr;
713: #endif
714: asir_out = stderr;
715: printexpr(CO,eval((FNODE)FA2(f)));
716: putc('\n',asir_out); fflush(asir_out);
1.20 ohara 717: #if defined(PARI)
1.1 noro 718: pari_outfile = stdout;
719: #endif
720: asir_out = stdout;
721: } else {
722: nextbp = 1; nextbplevel = 0;
723: }
724: }
725: val = evalstat((SNODE)FA0(f));
726: break;
727: case S_PFDEF:
728: ac = argc(FA1(f)); a = (V *)MALLOC(ac*sizeof(V));
729: s = eval((FNODE)FA2(f));
730: buf = (char *)ALLOCA(BUFSIZ);
731: for ( i = 0, tn = (NODE)FA1(f); tn; tn = NEXT(tn), i++ ) {
732: t = eval((FNODE)tn->body); sprintf(buf,"_%s",NAME(VR((P)t)));
733: makevar(buf,&u); a[i] = VR(u);
734: substr(CO,0,(Obj)s,VR((P)t),(Obj)u,(Obj *)&s1); s = s1;
735: }
1.43 noro 736: mkpf((char *)FA0(f),(Obj)s,ac,a,0,0,0,(PF *)&val); val = 0;
737: v = searchvar((char *)FA0(f));
738: if ( v ) {
739: searchpf((char *)FA0(f),&func);
740: makesrvar(func,&u);
741: }
742: break;
1.1 noro 743: case S_SINGLE:
744: val = eval((FNODE)FA0(f)); break;
745: case S_CPLX:
746: for ( tn = (NODE)FA0(f); tn; tn = NEXT(tn) ) {
747: if ( BDY(tn) )
748: val = evalstat((SNODE)BDY(tn));
749: if ( f_break || f_return || f_continue )
750: break;
751: }
752: break;
753: case S_BREAK:
754: if ( GPVS != CPVS )
755: f_break = 1;
756: break;
757: case S_CONTINUE:
758: if ( GPVS != CPVS )
759: f_continue = 1;
760: break;
761: case S_RETURN:
762: if ( GPVS != CPVS ) {
763: val = eval((FNODE)FA0(f)); f_return = 1;
764: }
765: break;
766: case S_IFELSE:
767: if ( evalnode((NODE)FA1(f)) )
768: val = evalstat((SNODE)FA2(f));
769: else if ( FA3(f) )
770: val = evalstat((SNODE)FA3(f));
771: break;
772: case S_FOR:
773: evalnode((NODE)FA1(f));
774: while ( 1 ) {
775: if ( !evalnode((NODE)FA2(f)) )
776: break;
777: val = evalstat((SNODE)FA4(f));
778: if ( f_break || f_return )
779: break;
780: f_continue = 0;
781: evalnode((NODE)FA3(f));
782: }
783: f_break = 0; break;
784: case S_DO:
785: while ( 1 ) {
786: val = evalstat((SNODE)FA1(f));
787: if ( f_break || f_return )
788: break;
789: f_continue = 0;
790: if ( !evalnode((NODE)FA2(f)) )
791: break;
792: }
793: f_break = 0; break;
1.40 noro 794: case S_MODULE:
795: CUR_MODULE = (MODULE)FA0(f);
796: if ( CUR_MODULE )
797: MPVS = CUR_MODULE->pvs;
798: else
799: MPVS = 0;
800: break;
1.1 noro 801: default:
802: error("evalstat : unknown id");
803: break;
804: }
805: return ( val );
806: }
807:
1.16 noro 808: pointer evalnode(NODE node)
1.1 noro 809: {
810: NODE tn;
811: pointer val;
812:
813: for ( tn = node, val = 0; tn; tn = NEXT(tn) )
814: if ( BDY(tn) )
815: val = eval((FNODE)BDY(tn));
816: return ( val );
817: }
818:
819: extern FUNC cur_binf;
820: extern NODE PVSS;
821:
1.44 noro 822: LIST eval_arg(FNODE a,unsigned int quote)
823: {
824: LIST l;
825: FNODE fn;
826: NODE n,n0,tn;
827: QUOTE q;
828: int i;
829:
830: for ( tn = (NODE)FA0(a), n0 = 0, i = 0; tn; tn = NEXT(tn), i++ ) {
831: NEXTNODE(n0,n);
832: if ( quote & (1<<i) ) {
833: fn = (FNODE)(BDY(tn));
834: if ( fn->id == I_FORMULA && FA0(fn)
835: && OID((Obj)FA0(fn))== O_QUOTE )
836: BDY(n) = FA0(fn);
837: else {
838: MKQUOTE(q,(FNODE)BDY(tn));
839: BDY(n) = (pointer)q;
840: }
841: } else
842: BDY(n) = eval((FNODE)BDY(tn));
843: }
844: if ( n0 ) NEXT(n) = 0;
845: MKLIST(l,n0);
846: return l;
847: }
848:
1.16 noro 849: pointer evalf(FUNC f,FNODE a,FNODE opt)
1.1 noro 850: {
851: LIST args;
852: pointer val;
853: int i,n,level;
1.30 noro 854: NODE tn,sn,opts,opt1,dmy;
855: VS pvs,prev_mpvs;
1.1 noro 856: char errbuf[BUFSIZ];
1.19 saito 857: static unsigned int stack_size;
1.12 noro 858: static void *stack_base;
1.43 noro 859: FUNC f1;
1.1 noro 860:
861: if ( f->id == A_UNDEF ) {
1.43 noro 862: gen_searchf_searchonly(f->fullname,&f1);
863: if ( f1->id == A_UNDEF ) {
864: sprintf(errbuf,"evalf : %s undefined",NAME(f));
865: error(errbuf);
866: } else
867: *f = *f1;
1.36 noro 868: }
869: if ( getsecuremode() && !PVSS && !f->secure ) {
870: sprintf(errbuf,"evalf : %s not permitted",NAME(f));
1.1 noro 871: error(errbuf);
872: }
873: if ( f->id != A_PARI ) {
874: for ( i = 0, tn = a?(NODE)FA0(a):0; tn; i++, tn = NEXT(tn) );
875: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
876: sprintf(errbuf,"evalf : argument mismatch in %s()",NAME(f));
877: error(errbuf);
878: }
879: }
880: switch ( f->id ) {
881: case A_BIN:
1.30 noro 882: if ( opt ) {
883: opts = BDY((LIST)eval(opt));
884: /* opts = ["opt1",arg1],... */
885: opt1 = BDY((LIST)BDY(opts));
886: if ( !strcmp(BDY((STRING)BDY(opt1)),"option_list") ) {
887: /*
888: * the special option specification:
889: * option_list=[["o1","a1"],...]
890: */
891: asir_assert(BDY(NEXT(opt1)),O_LIST,"evalf");
892: opts = BDY((LIST)BDY(NEXT(opt1)));
893: }
894: } else
895: opts = 0;
1.1 noro 896: if ( !n ) {
897: cur_binf = f;
898: (*f->f.binf)(&val);
899: } else {
1.44 noro 900: args = (LIST)eval_arg(a,f->quote);
1.33 noro 901: current_option = opts;
1.1 noro 902: cur_binf = f;
903: (*f->f.binf)(args?BDY(args):0,&val);
904: }
905: cur_binf = 0;
906: break;
907: case A_PARI:
908: args = (LIST)eval(a);
909: cur_binf = f;
910: val = evalparif(f,args?BDY(args):0);
911: cur_binf = 0;
912: break;
913: case A_USR:
1.12 noro 914: /* stack check */
1.17 noro 915: #if !defined(VISUAL) && !defined(__CYGWIN__)
1.12 noro 916: if ( !stack_size ) {
917: struct rlimit rl;
918: getrlimit(RLIMIT_STACK,&rl);
919: stack_size = rl.rlim_cur;
920: }
921: if ( !stack_base )
922: stack_base = (void *)GC_get_stack_base();
923: if ( (stack_base - (void *)&args) +0x100000 > stack_size )
924: error("stack overflow");
925: #endif
1.44 noro 926: args = (LIST)eval_arg(a,f->quote);
1.11 noro 927: if ( opt ) {
1.1 noro 928: opts = BDY((LIST)eval(opt));
1.11 noro 929: /* opts = ["opt1",arg1],... */
930: opt1 = BDY((LIST)BDY(opts));
931: if ( !strcmp(BDY((STRING)BDY(opt1)),"option_list") ) {
932: /*
933: * the special option specification:
934: * option_list=[["o1","a1"],...]
935: */
936: asir_assert(BDY(NEXT(opt1)),O_LIST,"evalf");
937: opts = BDY((LIST)BDY(NEXT(opt1)));
938: }
939: } else
1.1 noro 940: opts = 0;
941: pvs = f->f.usrf->pvs;
942: if ( PVSS ) {
943: ((VS)BDY(PVSS))->at = evalstatline;
944: level = ((VS)BDY(PVSS))->level+1;
945: } else
946: level = 1;
947: MKNODE(tn,pvs,PVSS); PVSS = tn;
948: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
949: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
950: CPVS->level = level;
951: CPVS->opt = opts;
952: if ( CPVS->n ) {
953: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
954: bcopy((char *)pvs->va,(char *)CPVS->va,
955: (int)(pvs->n*sizeof(struct oPV)));
956: }
957: if ( nextbp )
958: nextbplevel++;
959: for ( tn = f->f.usrf->args, sn = BDY(args);
960: sn; tn = NEXT(tn), sn = NEXT(sn) )
961: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
1.21 noro 962: if ( f->f.usrf->module ) {
963: prev_mpvs = MPVS;
964: MPVS = f->f.usrf->module->pvs;
965: val = evalstat((SNODE)BDY(f->f.usrf));
966: MPVS = prev_mpvs;
967: } else
968: val = evalstat((SNODE)BDY(f->f.usrf));
1.1 noro 969: f_return = f_break = f_continue = 0; poppvs();
970: break;
971: case A_PURE:
972: args = (LIST)eval(a);
1.44 noro 973: val = evalpf(f->f.puref,args?BDY(args):0,0);
1.1 noro 974: break;
975: default:
976: sprintf(errbuf,"evalf : %s undefined",NAME(f));
977: error(errbuf);
978: break;
979: }
980: return val;
981: }
982:
1.44 noro 983: pointer evalf_deriv(FUNC f,FNODE a,FNODE deriv)
984: {
985: LIST args,dargs;
986: pointer val;
987: char errbuf[BUFSIZ];
988:
989: switch ( f->id ) {
990: case A_PURE:
991: args = (LIST)eval(a);
992: dargs = (LIST)eval(deriv);
993: val = evalpf(f->f.puref,
994: args?BDY(args):0,dargs?BDY(dargs):0);
995: break;
996: default:
997: sprintf(errbuf,
998: "evalf : %s is not a pure function",NAME(f));
999: error(errbuf);
1000: break;
1001: }
1002: return val;
1003: }
1004:
1.16 noro 1005: pointer evalmapf(FUNC f,FNODE a)
1.1 noro 1006: {
1007: LIST args;
1008: NODE node,rest,t,n,r,r0;
1009: Obj head;
1010: VECT v,rv;
1011: MAT m,rm;
1012: LIST rl;
1013: int len,row,col,i,j;
1014: pointer val;
1015:
1.44 noro 1016: args = (LIST)eval_arg(a,f->quote);
1.1 noro 1017: node = BDY(args); head = (Obj)BDY(node); rest = NEXT(node);
1.3 noro 1018: if ( !head ) {
1019: val = bevalf(f,node);
1020: return val;
1021: }
1.1 noro 1022: switch ( OID(head) ) {
1023: case O_VECT:
1024: v = (VECT)head; len = v->len; MKVECT(rv,len);
1025: for ( i = 0; i < len; i++ ) {
1026: MKNODE(t,BDY(v)[i],rest); BDY(rv)[i] = bevalf(f,t);
1027: }
1028: val = (pointer)rv;
1029: break;
1030: case O_MAT:
1031: m = (MAT)head; row = m->row; col = m->col; MKMAT(rm,row,col);
1032: for ( i = 0; i < row; i++ )
1033: for ( j = 0; j < col; j++ ) {
1034: MKNODE(t,BDY(m)[i][j],rest); BDY(rm)[i][j] = bevalf(f,t);
1035: }
1036: val = (pointer)rm;
1037: break;
1038: case O_LIST:
1039: n = BDY((LIST)head);
1040: for ( r0 = r = 0; n; n = NEXT(n) ) {
1041: NEXTNODE(r0,r); MKNODE(t,BDY(n),rest); BDY(r) = bevalf(f,t);
1.9 noro 1042: }
1043: if ( r0 )
1044: NEXT(r) = 0;
1045: MKLIST(rl,r0);
1046: val = (pointer)rl;
1047: break;
1048: default:
1049: val = bevalf(f,node);
1050: break;
1051: }
1052: return val;
1053: }
1054:
1.16 noro 1055: pointer eval_rec_mapf(FUNC f,FNODE a)
1.9 noro 1056: {
1057: LIST args;
1058:
1.44 noro 1059: args = (LIST)eval_arg(a,f->quote);
1.9 noro 1060: return beval_rec_mapf(f,BDY(args));
1061: }
1062:
1.16 noro 1063: pointer beval_rec_mapf(FUNC f,NODE node)
1.9 noro 1064: {
1065: NODE rest,t,n,r,r0;
1066: Obj head;
1067: VECT v,rv;
1068: MAT m,rm;
1069: LIST rl;
1070: int len,row,col,i,j;
1071: pointer val;
1072:
1073: head = (Obj)BDY(node); rest = NEXT(node);
1074: if ( !head ) {
1075: val = bevalf(f,node);
1076: return val;
1077: }
1078: switch ( OID(head) ) {
1079: case O_VECT:
1080: v = (VECT)head; len = v->len; MKVECT(rv,len);
1081: for ( i = 0; i < len; i++ ) {
1082: MKNODE(t,BDY(v)[i],rest); BDY(rv)[i] = beval_rec_mapf(f,t);
1083: }
1084: val = (pointer)rv;
1085: break;
1086: case O_MAT:
1087: m = (MAT)head; row = m->row; col = m->col; MKMAT(rm,row,col);
1088: for ( i = 0; i < row; i++ )
1089: for ( j = 0; j < col; j++ ) {
1090: MKNODE(t,BDY(m)[i][j],rest);
1091: BDY(rm)[i][j] = beval_rec_mapf(f,t);
1092: }
1093: val = (pointer)rm;
1094: break;
1095: case O_LIST:
1096: n = BDY((LIST)head);
1097: for ( r0 = r = 0; n; n = NEXT(n) ) {
1098: NEXTNODE(r0,r); MKNODE(t,BDY(n),rest);
1099: BDY(r) = beval_rec_mapf(f,t);
1.1 noro 1100: }
1101: if ( r0 )
1102: NEXT(r) = 0;
1103: MKLIST(rl,r0);
1104: val = (pointer)rl;
1105: break;
1106: default:
1107: val = bevalf(f,node);
1108: break;
1109: }
1110: return val;
1111: }
1112:
1.16 noro 1113: pointer bevalf(FUNC f,NODE a)
1.1 noro 1114: {
1115: pointer val;
1116: int i,n;
1117: NODE tn,sn;
1.44 noro 1118: VS pvs,prev_mpvs;
1.1 noro 1119: char errbuf[BUFSIZ];
1120:
1121: if ( f->id == A_UNDEF ) {
1122: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
1.37 noro 1123: error(errbuf);
1124: }
1125: if ( getsecuremode() && !PVSS && !f->secure ) {
1126: sprintf(errbuf,"bevalf : %s not permitted",NAME(f));
1.1 noro 1127: error(errbuf);
1128: }
1129: if ( f->id != A_PARI ) {
1130: for ( i = 0, tn = a; tn; i++, tn = NEXT(tn) );
1131: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
1132: sprintf(errbuf,"bevalf : argument mismatch in %s()",NAME(f));
1133: error(errbuf);
1134: }
1135: }
1136: switch ( f->id ) {
1137: case A_BIN:
1138: if ( !n ) {
1139: cur_binf = f;
1140: (*f->f.binf)(&val);
1141: } else {
1142: cur_binf = f;
1143: (*f->f.binf)(a,&val);
1144: }
1145: cur_binf = 0;
1146: break;
1147: case A_PARI:
1148: cur_binf = f;
1149: val = evalparif(f,a);
1150: cur_binf = 0;
1151: break;
1152: case A_USR:
1153: pvs = f->f.usrf->pvs;
1154: if ( PVSS )
1155: ((VS)BDY(PVSS))->at = evalstatline;
1156: MKNODE(tn,pvs,PVSS); PVSS = tn;
1157: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
1158: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
1159: CPVS->opt = 0;
1160: if ( CPVS->n ) {
1161: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
1162: bcopy((char *)pvs->va,(char *)CPVS->va,
1163: (int)(pvs->n*sizeof(struct oPV)));
1164: }
1165: if ( nextbp )
1166: nextbplevel++;
1167: for ( tn = f->f.usrf->args, sn = a;
1168: sn; tn = NEXT(tn), sn = NEXT(sn) )
1169: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
1.39 noro 1170: if ( f->f.usrf->module ) {
1171: prev_mpvs = MPVS;
1172: MPVS = f->f.usrf->module->pvs;
1173: val = evalstat((SNODE)BDY(f->f.usrf));
1174: MPVS = prev_mpvs;
1175: } else
1176: val = evalstat((SNODE)BDY(f->f.usrf));
1.1 noro 1177: f_return = f_break = f_continue = 0; poppvs();
1178: break;
1179: case A_PURE:
1.44 noro 1180: val = evalpf(f->f.puref,a,0);
1.1 noro 1181: break;
1182: default:
1183: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
1184: error(errbuf);
1185: break;
1186: }
1187: return val;
1188: }
1189:
1.16 noro 1190: pointer evalif(FNODE f,FNODE a)
1.1 noro 1191: {
1192: Obj g;
1.50 noro 1193: QUOTE q;
1.41 noro 1194: FNODE t;
1.50 noro 1195: LIST l;
1.1 noro 1196:
1197: g = (Obj)eval(f);
1198: if ( g && (OID(g) == O_P) && (VR((P)g)->attr == (pointer)V_SR) )
1199: return evalf((FUNC)VR((P)g)->priv,a,0);
1.41 noro 1200: else if ( g && OID(g) == O_QUOTEARG && ((QUOTEARG)g)->type == A_func ) {
1201: t = mkfnode(2,I_FUNC,((QUOTEARG)g)->body,a);
1.50 noro 1202: MKQUOTE(q,t);
1203: return q;
1.41 noro 1204: } else {
1.1 noro 1205: error("invalid function pointer");
1.16 noro 1206: /* NOTREACHED */
1207: return (pointer)-1;
1.1 noro 1208: }
1209: }
1210:
1.44 noro 1211: pointer evalpf(PF pf,NODE args,NODE dargs)
1.1 noro 1212: {
1213: Obj s,s1;
1.54 ! noro 1214: int i,di,j;
1.44 noro 1215: NODE node,dnode;
1.1 noro 1216: PFINS ins;
1217: PFAD ad;
1218:
1219: if ( !pf->body ) {
1220: ins = (PFINS)CALLOC(1,sizeof(PF)+pf->argc*sizeof(struct oPFAD));
1221: ins->pf = pf;
1.44 noro 1222: for ( i = 0, node = args, dnode = dargs, ad = ins->ad;
1223: node; i++ ) {
1224: ad[i].arg = (Obj)node->body;
1225: if ( !dnode ) ad[i].d = 0;
1226: else
1227: ad[i].d = QTOS((Q)dnode->body);
1228: node = NEXT(node);
1229: if ( dnode ) dnode = NEXT(dnode);
1.1 noro 1230: }
1231: simplify_ins(ins,&s);
1232: } else {
1.54 ! noro 1233: s = pf->body;
! 1234: if ( dnode ) {
! 1235: for ( i = 0, dnode = dargs; dnode; dnode = NEXT(dnode), i++ ) {
! 1236: di = QTOS((Q)dnode->body);
! 1237: for ( j = 0; j < di; j++ ) {
! 1238: derivr(CO,s,pf->args[i],&s1); s = s1;
! 1239: }
! 1240: }
! 1241: }
! 1242: for ( i = 0, node = args; node; node = NEXT(node), i++ ) {
1.1 noro 1243: substr(CO,0,s,pf->args[i],(Obj)node->body,&s1); s = s1;
1244: }
1245: }
1246: return (pointer)s;
1247: }
1248:
1.16 noro 1249: void evalnodebody(NODE sn,NODE *dnp)
1.1 noro 1250: {
1251: NODE n,n0,tn;
1252: int line;
1253:
1254: if ( !sn ) {
1255: *dnp = 0;
1256: return;
1257: }
1258: line = evalstatline;
1259: for ( tn = sn, n0 = 0; tn; tn = NEXT(tn) ) {
1260: NEXTNODE(n0,n);
1261: BDY(n) = eval((FNODE)BDY(tn));
1262: evalstatline = line;
1263: }
1264: NEXT(n) = 0; *dnp = n0;
1265: }
1266:
1.21 noro 1267: MODULE searchmodule(char *name)
1268: {
1269: MODULE mod;
1270: NODE m;
1271:
1272: for ( m = MODULE_LIST; m; m = NEXT(m) ) {
1273: mod = (MODULE)BDY(m);
1274: if ( !strcmp(mod->name,name) )
1275: return mod;
1276: }
1277: return 0;
1278: }
1.24 noro 1279: /*
1280: * xxx.yyy() is searched in the flist
1281: * of the module xxx.
1282: * yyy() is searched in the global flist.
1283: */
1.21 noro 1284:
1.22 noro 1285: void searchuf(char *name,FUNC *r)
1286: {
1287: MODULE mod;
1288: char *name0,*dot;
1289:
1290: if ( dot = strchr(name,'.') ) {
1291: name0 = (char *)ALLOCA(strlen(name)+1);
1292: strcpy(name0,name);
1293: dot = strchr(name0,'.');
1294: *dot = 0;
1295: mod = searchmodule(name0);
1296: if ( mod )
1297: searchf(mod->usrf_list,dot+1,r);
1298: } else
1299: searchf(usrf,name,r);
1300: }
1301:
1.16 noro 1302: void gen_searchf(char *name,FUNC *r)
1.12 noro 1303: {
1.21 noro 1304: FUNC val = 0;
1.29 noro 1305: int global = 0;
1306: if ( *name == ':' ) {
1307: global = 1;
1308: name += 2;
1309: }
1310: if ( CUR_MODULE && !global )
1.21 noro 1311: searchf(CUR_MODULE->usrf_list,name,&val);
1.25 noro 1312: if ( !val )
1313: searchf(sysf,name,&val);
1314: if ( !val )
1315: searchf(ubinf,name,&val);
1316: if ( !val )
1317: searchpf(name,&val);
1318: if ( !val )
1319: searchuf(name,&val);
1320: if ( !val )
1321: appenduf(name,&val);
1.34 noro 1322: *r = val;
1323: }
1324:
1325: void gen_searchf_searchonly(char *name,FUNC *r)
1326: {
1327: FUNC val = 0;
1328: int global = 0;
1329: if ( *name == ':' ) {
1330: global = 1;
1331: name += 2;
1332: }
1333: if ( CUR_MODULE && !global )
1334: searchf(CUR_MODULE->usrf_list,name,&val);
1335: if ( !val )
1336: searchf(sysf,name,&val);
1337: if ( !val )
1338: searchf(ubinf,name,&val);
1339: if ( !val )
1340: searchpf(name,&val);
1341: if ( !val )
1342: searchuf(name,&val);
1.12 noro 1343: *r = val;
1344: }
1345:
1.16 noro 1346: void searchf(NODE fn,char *name,FUNC *r)
1.1 noro 1347: {
1348: NODE tn;
1349:
1350: for ( tn = fn;
1351: tn && strcmp(NAME((FUNC)BDY(tn)),name); tn = NEXT(tn) );
1352: if ( tn ) {
1353: *r = (FUNC)BDY(tn);
1354: return;
1355: }
1356: *r = 0;
1357: }
1358:
1.22 noro 1359: MODULE mkmodule(char *);
1360:
1.16 noro 1361: void appenduf(char *name,FUNC *r)
1.1 noro 1362: {
1363: NODE tn;
1364: FUNC f;
1.22 noro 1365: int len;
1366: MODULE mod;
1367: char *modname,*fname,*dot;
1.1 noro 1368:
1369: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1.22 noro 1370: f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
1371: if ( dot = strchr(name,'.') ) {
1.28 noro 1372: /* undefined function in a module */
1.22 noro 1373: len = dot-name;
1374: modname = (char *)MALLOC_ATOMIC(len+1);
1375: strncpy(modname,name,len); modname[len] = 0;
1376: fname = (char *)MALLOC_ATOMIC(strlen(name)-len+1);
1377: strcpy(fname,dot+1);
1378: f->name = fname;
1.25 noro 1379: f->fullname = name;
1.28 noro 1380: mod = searchmodule(modname);
1381: if ( !mod )
1382: mod = mkmodule(modname);
1383: MKNODE(tn,f,mod->usrf_list); mod->usrf_list = tn;
1.21 noro 1384: } else {
1.22 noro 1385: f->name = name;
1.25 noro 1386: f->fullname = name;
1387: MKNODE(tn,f,usrf); usrf = tn;
1.21 noro 1388: }
1.1 noro 1389: *r = f;
1390: }
1391:
1.25 noro 1392: void appenduf_local(char *name,FUNC *r)
1.24 noro 1393: {
1394: NODE tn;
1395: FUNC f;
1.25 noro 1396: MODULE mod;
1.24 noro 1397:
1.27 noro 1398: for ( tn = CUR_MODULE->usrf_list; tn; tn = NEXT(tn) )
1399: if ( !strcmp(((FUNC)BDY(tn))->name,name) )
1400: break;
1401: if ( tn )
1402: return;
1403:
1.24 noro 1404: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1405: f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
1.25 noro 1406: f->name = name;
1407: f->fullname =
1408: (char *)MALLOC_ATOMIC(strlen(CUR_MODULE->name)+strlen(name)+1);
1409: sprintf(f->fullname,"%s.%s",CUR_MODULE->name,name);
1410: MKNODE(tn,f,CUR_MODULE->usrf_list); CUR_MODULE->usrf_list = tn;
1.24 noro 1411: *r = f;
1412: }
1413:
1.25 noro 1414: void appenduflist(NODE n)
1415: {
1416: NODE tn;
1417: FUNC f;
1418:
1419: for ( tn = n; tn; tn = NEXT(tn) )
1420: appenduf_local((char *)BDY(tn),&f);
1421: }
1422:
1.16 noro 1423: void mkparif(char *name,FUNC *r)
1.1 noro 1424: {
1425: FUNC f;
1426:
1427: *r = f =(FUNC)MALLOC(sizeof(struct oFUNC));
1428: f->name = name; f->id = A_PARI; f->argc = 0; f->f.binf = 0;
1.27 noro 1429: f->fullname = name;
1.1 noro 1430: }
1431:
1.21 noro 1432: void mkuf(char *name,char *fname,NODE args,SNODE body,int startl,int endl,char *desc,MODULE module)
1.1 noro 1433: {
1434: FUNC f;
1435: USRF t;
1.21 noro 1436: NODE usrf_list,sn,tn;
1.1 noro 1437: FNODE fn;
1.21 noro 1438: char *longname;
1.1 noro 1439: int argc;
1440:
1.38 noro 1441: if ( getsecuremode() ) {
1442: error("defining function is not permitted in the secure mode");
1443: }
1.29 noro 1444: if ( *name == ':' )
1445: name += 2;
1.21 noro 1446: if ( !module ) {
1447: searchf(sysf,name,&f);
1448: if ( f ) {
1449: fprintf(stderr,"def : builtin function %s() cannot be redefined.\n",name);
1450: CPVS = GPVS; return;
1451: }
1.1 noro 1452: }
1453: for ( argc = 0, sn = args; sn; argc++, sn = NEXT(sn) ) {
1454: fn = (FNODE)BDY(sn);
1455: if ( !fn || ID(fn) != I_PVAR ) {
1456: fprintf(stderr,"illegal argument in %s()\n",name);
1457: CPVS = GPVS; return;
1458: }
1459: }
1.21 noro 1460: usrf_list = module ? module->usrf_list : usrf;
1461: for ( sn = usrf_list; sn && strcmp(NAME((FUNC)BDY(sn)),name); sn = NEXT(sn) );
1.1 noro 1462: if ( sn )
1463: f = (FUNC)BDY(sn);
1464: else {
1465: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1466: f->name = name;
1.21 noro 1467: MKNODE(tn,f,usrf_list); usrf_list = tn;
1.25 noro 1468: if ( module ) {
1469: f->fullname =
1470: (char *)MALLOC_ATOMIC(strlen(f->name)+strlen(module->name)+1);
1471: sprintf(f->fullname,"%s.%s",module->name,f->name);
1.21 noro 1472: module->usrf_list = usrf_list;
1.25 noro 1473: } else {
1474: f->fullname = f->name;
1.21 noro 1475: usrf = usrf_list;
1.25 noro 1476: }
1.21 noro 1477: }
1478: if ( Verbose && f->id != A_UNDEF ) {
1479: if ( module )
1480: fprintf(stderr,"Warning : %s.%s() redefined.\n",module->name,name);
1481: else
1482: fprintf(stderr,"Warning : %s() redefined.\n",name);
1.1 noro 1483: }
1484: t=(USRF)MALLOC(sizeof(struct oUSRF));
1485: t->args=args; BDY(t)=body; t->pvs = CPVS; t->fname = fname;
1.21 noro 1486: t->startl = startl; t->endl = endl; t->module = module;
1.1 noro 1487: t->desc = desc;
1488: f->id = A_USR; f->argc = argc; f->f.usrf = t;
1489: CPVS = GPVS;
1.24 noro 1490: CUR_FUNC = 0;
1.1 noro 1491: clearbp(f);
1492: }
1493:
1494: /*
1495: retrieve value of an option whose key matches 'key'
1496: CVS->opt is a list(node) of key-value pair (list)
1497: CVS->opt = BDY([[key,value],[key,value],...])
1498: */
1499:
1.16 noro 1500: Obj getopt_from_cpvs(char *key)
1.1 noro 1501: {
1502: NODE opts,opt;
1.12 noro 1503: LIST r;
1.1 noro 1504: extern Obj VOIDobj;
1505:
1506: opts = CPVS->opt;
1.12 noro 1507: if ( !key ) {
1508: MKLIST(r,opts);
1509: return (Obj)r;
1510: } else {
1511: for ( ; opts; opts = NEXT(opts) ) {
1512: asir_assert(BDY(opts),O_LIST,"getopt_from_cvps");
1513: opt = BDY((LIST)BDY(opts));
1514: if ( !strcmp(key,BDY((STRING)BDY(opt))) )
1515: return (Obj)BDY(NEXT(opt));
1516: }
1517: return VOIDobj;
1.1 noro 1518: }
1519:
1.21 noro 1520: }
1521:
1522: MODULE mkmodule(char *name)
1523: {
1524: MODULE mod;
1525: NODE m;
1526: int len;
1527: VS mpvs;
1528:
1529: for ( m = MODULE_LIST; m; m = NEXT(m) ) {
1530: mod = (MODULE)m->body;
1531: if ( !strcmp(mod->name,name) )
1532: break;
1533: }
1534: if ( m )
1535: return mod;
1536: else {
1537: mod = (MODULE)MALLOC(sizeof(struct oMODULE));
1538: len = strlen(name);
1539: mod->name = (char *)MALLOC_ATOMIC(len+1);
1540: strcpy(mod->name,name);
1541: mod->pvs = mpvs = (VS)MALLOC(sizeof(struct oVS));
1542: reallocarray((char **)&mpvs->va,(int *)&mpvs->asize,
1543: (int *)&mpvs->n,(int)sizeof(struct oPV));
1544: mod->usrf_list = 0;
1545: MKNODE(m,mod,MODULE_LIST);
1546: MODULE_LIST = m;
1547: return mod;
1548: }
1.23 noro 1549: }
1550:
1.24 noro 1551: void print_crossref(FUNC f)
1552: {
1.26 takayama 1553: FUNC r;
1554: if ( show_crossref && CUR_FUNC ) {
1555: searchuf(f->fullname,&r);
1556: if (r != NULL) {
1557: fprintf(asir_out,"%s() at line %d in %s()\n",
1558: f->fullname, asir_infile->ln, CUR_FUNC);
1559: }
1560: }
1.1 noro 1561: }