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