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