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