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