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