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