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