![[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.48 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.47 2005/09/29 08:55:26 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.46 noro 569: }
570: if ( r0 ) NEXT(r) = 0;
571: return r0;
572: }
573:
1.47 noro 574: NODE quote_to_nary_node(NODE n)
1.46 noro 575: {
576: NODE r0,r,t;
577:
578: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
579: NEXTNODE(r0,r);
1.47 noro 580: BDY(r) = quote_to_nary((FNODE)BDY(t));
1.46 noro 581: }
582: if ( r0 ) NEXT(r) = 0;
583: return r0;
584: }
585:
1.47 noro 586: NODE quote_to_bin_node(NODE n,int dir)
1.46 noro 587: {
588: NODE r0,r,t;
589:
590: for ( r0 = 0, t = n; t; t = NEXT(t) ) {
591: NEXTNODE(r0,r);
1.47 noro 592: BDY(r) = quote_to_bin((FNODE)BDY(t),dir);
1.45 noro 593: }
594: if ( r0 ) NEXT(r) = 0;
595: return r0;
1.1 noro 596: }
597:
1.43 noro 598: V searchvar(char *name);
599:
1.16 noro 600: pointer evalstat(SNODE f)
1.1 noro 601: {
602: pointer val = 0,t,s,s1;
603: P u;
604: NODE tn;
605: int i,ac;
1.43 noro 606: V v;
1.1 noro 607: V *a;
608: char *buf;
1.43 noro 609: FUNC func;
1.1 noro 610:
611: if ( !f )
612: return ( 0 );
613: if ( nextbp && nextbplevel <= 0 && f->id != S_CPLX ) {
614: nextbp = 0;
615: bp(f);
616: }
617: evalstatline = f->ln;
618:
619: switch ( f->id ) {
620: case S_BP:
621: if ( !nextbp && (!FA1(f) || eval((FNODE)FA1(f))) ) {
622: if ( (FNODE)FA2(f) ) {
1.20 ohara 623: #if defined(PARI)
1.1 noro 624: pari_outfile = stderr;
625: #endif
626: asir_out = stderr;
627: printexpr(CO,eval((FNODE)FA2(f)));
628: putc('\n',asir_out); fflush(asir_out);
1.20 ohara 629: #if defined(PARI)
1.1 noro 630: pari_outfile = stdout;
631: #endif
632: asir_out = stdout;
633: } else {
634: nextbp = 1; nextbplevel = 0;
635: }
636: }
637: val = evalstat((SNODE)FA0(f));
638: break;
639: case S_PFDEF:
640: ac = argc(FA1(f)); a = (V *)MALLOC(ac*sizeof(V));
641: s = eval((FNODE)FA2(f));
642: buf = (char *)ALLOCA(BUFSIZ);
643: for ( i = 0, tn = (NODE)FA1(f); tn; tn = NEXT(tn), i++ ) {
644: t = eval((FNODE)tn->body); sprintf(buf,"_%s",NAME(VR((P)t)));
645: makevar(buf,&u); a[i] = VR(u);
646: substr(CO,0,(Obj)s,VR((P)t),(Obj)u,(Obj *)&s1); s = s1;
647: }
1.43 noro 648: mkpf((char *)FA0(f),(Obj)s,ac,a,0,0,0,(PF *)&val); val = 0;
649: v = searchvar((char *)FA0(f));
650: if ( v ) {
651: searchpf((char *)FA0(f),&func);
652: makesrvar(func,&u);
653: }
654: break;
1.1 noro 655: case S_SINGLE:
656: val = eval((FNODE)FA0(f)); break;
657: case S_CPLX:
658: for ( tn = (NODE)FA0(f); tn; tn = NEXT(tn) ) {
659: if ( BDY(tn) )
660: val = evalstat((SNODE)BDY(tn));
661: if ( f_break || f_return || f_continue )
662: break;
663: }
664: break;
665: case S_BREAK:
666: if ( GPVS != CPVS )
667: f_break = 1;
668: break;
669: case S_CONTINUE:
670: if ( GPVS != CPVS )
671: f_continue = 1;
672: break;
673: case S_RETURN:
674: if ( GPVS != CPVS ) {
675: val = eval((FNODE)FA0(f)); f_return = 1;
676: }
677: break;
678: case S_IFELSE:
679: if ( evalnode((NODE)FA1(f)) )
680: val = evalstat((SNODE)FA2(f));
681: else if ( FA3(f) )
682: val = evalstat((SNODE)FA3(f));
683: break;
684: case S_FOR:
685: evalnode((NODE)FA1(f));
686: while ( 1 ) {
687: if ( !evalnode((NODE)FA2(f)) )
688: break;
689: val = evalstat((SNODE)FA4(f));
690: if ( f_break || f_return )
691: break;
692: f_continue = 0;
693: evalnode((NODE)FA3(f));
694: }
695: f_break = 0; break;
696: case S_DO:
697: while ( 1 ) {
698: val = evalstat((SNODE)FA1(f));
699: if ( f_break || f_return )
700: break;
701: f_continue = 0;
702: if ( !evalnode((NODE)FA2(f)) )
703: break;
704: }
705: f_break = 0; break;
1.40 noro 706: case S_MODULE:
707: CUR_MODULE = (MODULE)FA0(f);
708: if ( CUR_MODULE )
709: MPVS = CUR_MODULE->pvs;
710: else
711: MPVS = 0;
712: break;
1.1 noro 713: default:
714: error("evalstat : unknown id");
715: break;
716: }
717: return ( val );
718: }
719:
1.16 noro 720: pointer evalnode(NODE node)
1.1 noro 721: {
722: NODE tn;
723: pointer val;
724:
725: for ( tn = node, val = 0; tn; tn = NEXT(tn) )
726: if ( BDY(tn) )
727: val = eval((FNODE)BDY(tn));
728: return ( val );
729: }
730:
731: extern FUNC cur_binf;
732: extern NODE PVSS;
733:
1.44 noro 734: LIST eval_arg(FNODE a,unsigned int quote)
735: {
736: LIST l;
737: FNODE fn;
738: NODE n,n0,tn;
739: QUOTE q;
740: int i;
741:
742: for ( tn = (NODE)FA0(a), n0 = 0, i = 0; tn; tn = NEXT(tn), i++ ) {
743: NEXTNODE(n0,n);
744: if ( quote & (1<<i) ) {
745: fn = (FNODE)(BDY(tn));
746: if ( fn->id == I_FORMULA && FA0(fn)
747: && OID((Obj)FA0(fn))== O_QUOTE )
748: BDY(n) = FA0(fn);
749: else {
750: MKQUOTE(q,(FNODE)BDY(tn));
751: BDY(n) = (pointer)q;
752: }
753: } else
754: BDY(n) = eval((FNODE)BDY(tn));
755: }
756: if ( n0 ) NEXT(n) = 0;
757: MKLIST(l,n0);
758: return l;
759: }
760:
1.16 noro 761: pointer evalf(FUNC f,FNODE a,FNODE opt)
1.1 noro 762: {
763: LIST args;
764: pointer val;
765: int i,n,level;
1.30 noro 766: NODE tn,sn,opts,opt1,dmy;
767: VS pvs,prev_mpvs;
1.1 noro 768: char errbuf[BUFSIZ];
1.19 saito 769: static unsigned int stack_size;
1.12 noro 770: static void *stack_base;
1.43 noro 771: FUNC f1;
1.1 noro 772:
773: if ( f->id == A_UNDEF ) {
1.43 noro 774: gen_searchf_searchonly(f->fullname,&f1);
775: if ( f1->id == A_UNDEF ) {
776: sprintf(errbuf,"evalf : %s undefined",NAME(f));
777: error(errbuf);
778: } else
779: *f = *f1;
1.36 noro 780: }
781: if ( getsecuremode() && !PVSS && !f->secure ) {
782: sprintf(errbuf,"evalf : %s not permitted",NAME(f));
1.1 noro 783: error(errbuf);
784: }
785: if ( f->id != A_PARI ) {
786: for ( i = 0, tn = a?(NODE)FA0(a):0; tn; i++, tn = NEXT(tn) );
787: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
788: sprintf(errbuf,"evalf : argument mismatch in %s()",NAME(f));
789: error(errbuf);
790: }
791: }
792: switch ( f->id ) {
793: case A_BIN:
1.30 noro 794: if ( opt ) {
795: opts = BDY((LIST)eval(opt));
796: /* opts = ["opt1",arg1],... */
797: opt1 = BDY((LIST)BDY(opts));
798: if ( !strcmp(BDY((STRING)BDY(opt1)),"option_list") ) {
799: /*
800: * the special option specification:
801: * option_list=[["o1","a1"],...]
802: */
803: asir_assert(BDY(NEXT(opt1)),O_LIST,"evalf");
804: opts = BDY((LIST)BDY(NEXT(opt1)));
805: }
806: } else
807: opts = 0;
1.1 noro 808: if ( !n ) {
809: cur_binf = f;
810: (*f->f.binf)(&val);
811: } else {
1.44 noro 812: args = (LIST)eval_arg(a,f->quote);
1.33 noro 813: current_option = opts;
1.1 noro 814: cur_binf = f;
815: (*f->f.binf)(args?BDY(args):0,&val);
816: }
817: cur_binf = 0;
818: break;
819: case A_PARI:
820: args = (LIST)eval(a);
821: cur_binf = f;
822: val = evalparif(f,args?BDY(args):0);
823: cur_binf = 0;
824: break;
825: case A_USR:
1.12 noro 826: /* stack check */
1.17 noro 827: #if !defined(VISUAL) && !defined(__CYGWIN__)
1.12 noro 828: if ( !stack_size ) {
829: struct rlimit rl;
830: getrlimit(RLIMIT_STACK,&rl);
831: stack_size = rl.rlim_cur;
832: }
833: if ( !stack_base )
834: stack_base = (void *)GC_get_stack_base();
835: if ( (stack_base - (void *)&args) +0x100000 > stack_size )
836: error("stack overflow");
837: #endif
1.44 noro 838: args = (LIST)eval_arg(a,f->quote);
1.11 noro 839: if ( opt ) {
1.1 noro 840: opts = BDY((LIST)eval(opt));
1.11 noro 841: /* opts = ["opt1",arg1],... */
842: opt1 = BDY((LIST)BDY(opts));
843: if ( !strcmp(BDY((STRING)BDY(opt1)),"option_list") ) {
844: /*
845: * the special option specification:
846: * option_list=[["o1","a1"],...]
847: */
848: asir_assert(BDY(NEXT(opt1)),O_LIST,"evalf");
849: opts = BDY((LIST)BDY(NEXT(opt1)));
850: }
851: } else
1.1 noro 852: opts = 0;
853: pvs = f->f.usrf->pvs;
854: if ( PVSS ) {
855: ((VS)BDY(PVSS))->at = evalstatline;
856: level = ((VS)BDY(PVSS))->level+1;
857: } else
858: level = 1;
859: MKNODE(tn,pvs,PVSS); PVSS = tn;
860: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
861: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
862: CPVS->level = level;
863: CPVS->opt = opts;
864: if ( CPVS->n ) {
865: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
866: bcopy((char *)pvs->va,(char *)CPVS->va,
867: (int)(pvs->n*sizeof(struct oPV)));
868: }
869: if ( nextbp )
870: nextbplevel++;
871: for ( tn = f->f.usrf->args, sn = BDY(args);
872: sn; tn = NEXT(tn), sn = NEXT(sn) )
873: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
1.21 noro 874: if ( f->f.usrf->module ) {
875: prev_mpvs = MPVS;
876: MPVS = f->f.usrf->module->pvs;
877: val = evalstat((SNODE)BDY(f->f.usrf));
878: MPVS = prev_mpvs;
879: } else
880: val = evalstat((SNODE)BDY(f->f.usrf));
1.1 noro 881: f_return = f_break = f_continue = 0; poppvs();
882: break;
883: case A_PURE:
884: args = (LIST)eval(a);
1.44 noro 885: val = evalpf(f->f.puref,args?BDY(args):0,0);
1.1 noro 886: break;
887: default:
888: sprintf(errbuf,"evalf : %s undefined",NAME(f));
889: error(errbuf);
890: break;
891: }
892: return val;
893: }
894:
1.44 noro 895: pointer evalf_deriv(FUNC f,FNODE a,FNODE deriv)
896: {
897: LIST args,dargs;
898: pointer val;
899: char errbuf[BUFSIZ];
900:
901: switch ( f->id ) {
902: case A_PURE:
903: args = (LIST)eval(a);
904: dargs = (LIST)eval(deriv);
905: val = evalpf(f->f.puref,
906: args?BDY(args):0,dargs?BDY(dargs):0);
907: break;
908: default:
909: sprintf(errbuf,
910: "evalf : %s is not a pure function",NAME(f));
911: error(errbuf);
912: break;
913: }
914: return val;
915: }
916:
1.16 noro 917: pointer evalmapf(FUNC f,FNODE a)
1.1 noro 918: {
919: LIST args;
920: NODE node,rest,t,n,r,r0;
921: Obj head;
922: VECT v,rv;
923: MAT m,rm;
924: LIST rl;
925: int len,row,col,i,j;
926: pointer val;
927:
1.44 noro 928: args = (LIST)eval_arg(a,f->quote);
1.1 noro 929: node = BDY(args); head = (Obj)BDY(node); rest = NEXT(node);
1.3 noro 930: if ( !head ) {
931: val = bevalf(f,node);
932: return val;
933: }
1.1 noro 934: switch ( OID(head) ) {
935: case O_VECT:
936: v = (VECT)head; len = v->len; MKVECT(rv,len);
937: for ( i = 0; i < len; i++ ) {
938: MKNODE(t,BDY(v)[i],rest); BDY(rv)[i] = bevalf(f,t);
939: }
940: val = (pointer)rv;
941: break;
942: case O_MAT:
943: m = (MAT)head; row = m->row; col = m->col; MKMAT(rm,row,col);
944: for ( i = 0; i < row; i++ )
945: for ( j = 0; j < col; j++ ) {
946: MKNODE(t,BDY(m)[i][j],rest); BDY(rm)[i][j] = bevalf(f,t);
947: }
948: val = (pointer)rm;
949: break;
950: case O_LIST:
951: n = BDY((LIST)head);
952: for ( r0 = r = 0; n; n = NEXT(n) ) {
953: NEXTNODE(r0,r); MKNODE(t,BDY(n),rest); BDY(r) = bevalf(f,t);
1.9 noro 954: }
955: if ( r0 )
956: NEXT(r) = 0;
957: MKLIST(rl,r0);
958: val = (pointer)rl;
959: break;
960: default:
961: val = bevalf(f,node);
962: break;
963: }
964: return val;
965: }
966:
1.16 noro 967: pointer eval_rec_mapf(FUNC f,FNODE a)
1.9 noro 968: {
969: LIST args;
970:
1.44 noro 971: args = (LIST)eval_arg(a,f->quote);
1.9 noro 972: return beval_rec_mapf(f,BDY(args));
973: }
974:
1.16 noro 975: pointer beval_rec_mapf(FUNC f,NODE node)
1.9 noro 976: {
977: NODE rest,t,n,r,r0;
978: Obj head;
979: VECT v,rv;
980: MAT m,rm;
981: LIST rl;
982: int len,row,col,i,j;
983: pointer val;
984:
985: head = (Obj)BDY(node); rest = NEXT(node);
986: if ( !head ) {
987: val = bevalf(f,node);
988: return val;
989: }
990: switch ( OID(head) ) {
991: case O_VECT:
992: v = (VECT)head; len = v->len; MKVECT(rv,len);
993: for ( i = 0; i < len; i++ ) {
994: MKNODE(t,BDY(v)[i],rest); BDY(rv)[i] = beval_rec_mapf(f,t);
995: }
996: val = (pointer)rv;
997: break;
998: case O_MAT:
999: m = (MAT)head; row = m->row; col = m->col; MKMAT(rm,row,col);
1000: for ( i = 0; i < row; i++ )
1001: for ( j = 0; j < col; j++ ) {
1002: MKNODE(t,BDY(m)[i][j],rest);
1003: BDY(rm)[i][j] = beval_rec_mapf(f,t);
1004: }
1005: val = (pointer)rm;
1006: break;
1007: case O_LIST:
1008: n = BDY((LIST)head);
1009: for ( r0 = r = 0; n; n = NEXT(n) ) {
1010: NEXTNODE(r0,r); MKNODE(t,BDY(n),rest);
1011: BDY(r) = beval_rec_mapf(f,t);
1.1 noro 1012: }
1013: if ( r0 )
1014: NEXT(r) = 0;
1015: MKLIST(rl,r0);
1016: val = (pointer)rl;
1017: break;
1018: default:
1019: val = bevalf(f,node);
1020: break;
1021: }
1022: return val;
1023: }
1024:
1.16 noro 1025: pointer bevalf(FUNC f,NODE a)
1.1 noro 1026: {
1027: pointer val;
1028: int i,n;
1029: NODE tn,sn;
1.44 noro 1030: VS pvs,prev_mpvs;
1.1 noro 1031: char errbuf[BUFSIZ];
1032:
1033: if ( f->id == A_UNDEF ) {
1034: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
1.37 noro 1035: error(errbuf);
1036: }
1037: if ( getsecuremode() && !PVSS && !f->secure ) {
1038: sprintf(errbuf,"bevalf : %s not permitted",NAME(f));
1.1 noro 1039: error(errbuf);
1040: }
1041: if ( f->id != A_PARI ) {
1042: for ( i = 0, tn = a; tn; i++, tn = NEXT(tn) );
1043: if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) {
1044: sprintf(errbuf,"bevalf : argument mismatch in %s()",NAME(f));
1045: error(errbuf);
1046: }
1047: }
1048: switch ( f->id ) {
1049: case A_BIN:
1050: if ( !n ) {
1051: cur_binf = f;
1052: (*f->f.binf)(&val);
1053: } else {
1054: cur_binf = f;
1055: (*f->f.binf)(a,&val);
1056: }
1057: cur_binf = 0;
1058: break;
1059: case A_PARI:
1060: cur_binf = f;
1061: val = evalparif(f,a);
1062: cur_binf = 0;
1063: break;
1064: case A_USR:
1065: pvs = f->f.usrf->pvs;
1066: if ( PVSS )
1067: ((VS)BDY(PVSS))->at = evalstatline;
1068: MKNODE(tn,pvs,PVSS); PVSS = tn;
1069: CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS;
1070: CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n;
1071: CPVS->opt = 0;
1072: if ( CPVS->n ) {
1073: CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV));
1074: bcopy((char *)pvs->va,(char *)CPVS->va,
1075: (int)(pvs->n*sizeof(struct oPV)));
1076: }
1077: if ( nextbp )
1078: nextbplevel++;
1079: for ( tn = f->f.usrf->args, sn = a;
1080: sn; tn = NEXT(tn), sn = NEXT(sn) )
1081: ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn));
1.39 noro 1082: if ( f->f.usrf->module ) {
1083: prev_mpvs = MPVS;
1084: MPVS = f->f.usrf->module->pvs;
1085: val = evalstat((SNODE)BDY(f->f.usrf));
1086: MPVS = prev_mpvs;
1087: } else
1088: val = evalstat((SNODE)BDY(f->f.usrf));
1.1 noro 1089: f_return = f_break = f_continue = 0; poppvs();
1090: break;
1091: case A_PURE:
1.44 noro 1092: val = evalpf(f->f.puref,a,0);
1.1 noro 1093: break;
1094: default:
1095: sprintf(errbuf,"bevalf : %s undefined",NAME(f));
1096: error(errbuf);
1097: break;
1098: }
1099: return val;
1100: }
1101:
1.16 noro 1102: pointer evalif(FNODE f,FNODE a)
1.1 noro 1103: {
1104: Obj g;
1.41 noro 1105: FNODE t;
1.1 noro 1106:
1107: g = (Obj)eval(f);
1108: if ( g && (OID(g) == O_P) && (VR((P)g)->attr == (pointer)V_SR) )
1109: return evalf((FUNC)VR((P)g)->priv,a,0);
1.41 noro 1110: else if ( g && OID(g) == O_QUOTEARG && ((QUOTEARG)g)->type == A_func ) {
1111: t = mkfnode(2,I_FUNC,((QUOTEARG)g)->body,a);
1112: return eval(t);
1113: } else {
1.1 noro 1114: error("invalid function pointer");
1.16 noro 1115: /* NOTREACHED */
1116: return (pointer)-1;
1.1 noro 1117: }
1118: }
1119:
1.44 noro 1120: pointer evalpf(PF pf,NODE args,NODE dargs)
1.1 noro 1121: {
1122: Obj s,s1;
1123: int i;
1.44 noro 1124: NODE node,dnode;
1.1 noro 1125: PFINS ins;
1126: PFAD ad;
1127:
1128: if ( !pf->body ) {
1129: ins = (PFINS)CALLOC(1,sizeof(PF)+pf->argc*sizeof(struct oPFAD));
1130: ins->pf = pf;
1.44 noro 1131: for ( i = 0, node = args, dnode = dargs, ad = ins->ad;
1132: node; i++ ) {
1133: ad[i].arg = (Obj)node->body;
1134: if ( !dnode ) ad[i].d = 0;
1135: else
1136: ad[i].d = QTOS((Q)dnode->body);
1137: node = NEXT(node);
1138: if ( dnode ) dnode = NEXT(dnode);
1.1 noro 1139: }
1140: simplify_ins(ins,&s);
1141: } else {
1142: for ( i = 0, s = pf->body, node = args;
1143: node; node = NEXT(node), i++ ) {
1144: substr(CO,0,s,pf->args[i],(Obj)node->body,&s1); s = s1;
1145: }
1146: }
1147: return (pointer)s;
1148: }
1149:
1.16 noro 1150: void evalnodebody(NODE sn,NODE *dnp)
1.1 noro 1151: {
1152: NODE n,n0,tn;
1153: int line;
1154:
1155: if ( !sn ) {
1156: *dnp = 0;
1157: return;
1158: }
1159: line = evalstatline;
1160: for ( tn = sn, n0 = 0; tn; tn = NEXT(tn) ) {
1161: NEXTNODE(n0,n);
1162: BDY(n) = eval((FNODE)BDY(tn));
1163: evalstatline = line;
1164: }
1165: NEXT(n) = 0; *dnp = n0;
1166: }
1167:
1.21 noro 1168: MODULE searchmodule(char *name)
1169: {
1170: MODULE mod;
1171: NODE m;
1172:
1173: for ( m = MODULE_LIST; m; m = NEXT(m) ) {
1174: mod = (MODULE)BDY(m);
1175: if ( !strcmp(mod->name,name) )
1176: return mod;
1177: }
1178: return 0;
1179: }
1.24 noro 1180: /*
1181: * xxx.yyy() is searched in the flist
1182: * of the module xxx.
1183: * yyy() is searched in the global flist.
1184: */
1.21 noro 1185:
1.22 noro 1186: void searchuf(char *name,FUNC *r)
1187: {
1188: MODULE mod;
1189: char *name0,*dot;
1190:
1191: if ( dot = strchr(name,'.') ) {
1192: name0 = (char *)ALLOCA(strlen(name)+1);
1193: strcpy(name0,name);
1194: dot = strchr(name0,'.');
1195: *dot = 0;
1196: mod = searchmodule(name0);
1197: if ( mod )
1198: searchf(mod->usrf_list,dot+1,r);
1199: } else
1200: searchf(usrf,name,r);
1201: }
1202:
1.16 noro 1203: void gen_searchf(char *name,FUNC *r)
1.12 noro 1204: {
1.21 noro 1205: FUNC val = 0;
1.29 noro 1206: int global = 0;
1207: if ( *name == ':' ) {
1208: global = 1;
1209: name += 2;
1210: }
1211: if ( CUR_MODULE && !global )
1.21 noro 1212: searchf(CUR_MODULE->usrf_list,name,&val);
1.25 noro 1213: if ( !val )
1214: searchf(sysf,name,&val);
1215: if ( !val )
1216: searchf(ubinf,name,&val);
1217: if ( !val )
1218: searchpf(name,&val);
1219: if ( !val )
1220: searchuf(name,&val);
1221: if ( !val )
1222: appenduf(name,&val);
1.34 noro 1223: *r = val;
1224: }
1225:
1226: void gen_searchf_searchonly(char *name,FUNC *r)
1227: {
1228: FUNC val = 0;
1229: int global = 0;
1230: if ( *name == ':' ) {
1231: global = 1;
1232: name += 2;
1233: }
1234: if ( CUR_MODULE && !global )
1235: searchf(CUR_MODULE->usrf_list,name,&val);
1236: if ( !val )
1237: searchf(sysf,name,&val);
1238: if ( !val )
1239: searchf(ubinf,name,&val);
1240: if ( !val )
1241: searchpf(name,&val);
1242: if ( !val )
1243: searchuf(name,&val);
1.12 noro 1244: *r = val;
1245: }
1246:
1.16 noro 1247: void searchf(NODE fn,char *name,FUNC *r)
1.1 noro 1248: {
1249: NODE tn;
1250:
1251: for ( tn = fn;
1252: tn && strcmp(NAME((FUNC)BDY(tn)),name); tn = NEXT(tn) );
1253: if ( tn ) {
1254: *r = (FUNC)BDY(tn);
1255: return;
1256: }
1257: *r = 0;
1258: }
1259:
1.22 noro 1260: MODULE mkmodule(char *);
1261:
1.16 noro 1262: void appenduf(char *name,FUNC *r)
1.1 noro 1263: {
1264: NODE tn;
1265: FUNC f;
1.22 noro 1266: int len;
1267: MODULE mod;
1268: char *modname,*fname,*dot;
1.1 noro 1269:
1270: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1.22 noro 1271: f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
1272: if ( dot = strchr(name,'.') ) {
1.28 noro 1273: /* undefined function in a module */
1.22 noro 1274: len = dot-name;
1275: modname = (char *)MALLOC_ATOMIC(len+1);
1276: strncpy(modname,name,len); modname[len] = 0;
1277: fname = (char *)MALLOC_ATOMIC(strlen(name)-len+1);
1278: strcpy(fname,dot+1);
1279: f->name = fname;
1.25 noro 1280: f->fullname = name;
1.28 noro 1281: mod = searchmodule(modname);
1282: if ( !mod )
1283: mod = mkmodule(modname);
1284: MKNODE(tn,f,mod->usrf_list); mod->usrf_list = tn;
1.21 noro 1285: } else {
1.22 noro 1286: f->name = name;
1.25 noro 1287: f->fullname = name;
1288: MKNODE(tn,f,usrf); usrf = tn;
1.21 noro 1289: }
1.1 noro 1290: *r = f;
1291: }
1292:
1.25 noro 1293: void appenduf_local(char *name,FUNC *r)
1.24 noro 1294: {
1295: NODE tn;
1296: FUNC f;
1.25 noro 1297: MODULE mod;
1.24 noro 1298:
1.27 noro 1299: for ( tn = CUR_MODULE->usrf_list; tn; tn = NEXT(tn) )
1300: if ( !strcmp(((FUNC)BDY(tn))->name,name) )
1301: break;
1302: if ( tn )
1303: return;
1304:
1.24 noro 1305: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1306: f->id = A_UNDEF; f->argc = 0; f->f.binf = 0;
1.25 noro 1307: f->name = name;
1308: f->fullname =
1309: (char *)MALLOC_ATOMIC(strlen(CUR_MODULE->name)+strlen(name)+1);
1310: sprintf(f->fullname,"%s.%s",CUR_MODULE->name,name);
1311: MKNODE(tn,f,CUR_MODULE->usrf_list); CUR_MODULE->usrf_list = tn;
1.24 noro 1312: *r = f;
1313: }
1314:
1.25 noro 1315: void appenduflist(NODE n)
1316: {
1317: NODE tn;
1318: FUNC f;
1319:
1320: for ( tn = n; tn; tn = NEXT(tn) )
1321: appenduf_local((char *)BDY(tn),&f);
1322: }
1323:
1.16 noro 1324: void mkparif(char *name,FUNC *r)
1.1 noro 1325: {
1326: FUNC f;
1327:
1328: *r = f =(FUNC)MALLOC(sizeof(struct oFUNC));
1329: f->name = name; f->id = A_PARI; f->argc = 0; f->f.binf = 0;
1.27 noro 1330: f->fullname = name;
1.1 noro 1331: }
1332:
1.21 noro 1333: void mkuf(char *name,char *fname,NODE args,SNODE body,int startl,int endl,char *desc,MODULE module)
1.1 noro 1334: {
1335: FUNC f;
1336: USRF t;
1.21 noro 1337: NODE usrf_list,sn,tn;
1.1 noro 1338: FNODE fn;
1.21 noro 1339: char *longname;
1.1 noro 1340: int argc;
1341:
1.38 noro 1342: if ( getsecuremode() ) {
1343: error("defining function is not permitted in the secure mode");
1344: }
1.29 noro 1345: if ( *name == ':' )
1346: name += 2;
1.21 noro 1347: if ( !module ) {
1348: searchf(sysf,name,&f);
1349: if ( f ) {
1350: fprintf(stderr,"def : builtin function %s() cannot be redefined.\n",name);
1351: CPVS = GPVS; return;
1352: }
1.1 noro 1353: }
1354: for ( argc = 0, sn = args; sn; argc++, sn = NEXT(sn) ) {
1355: fn = (FNODE)BDY(sn);
1356: if ( !fn || ID(fn) != I_PVAR ) {
1357: fprintf(stderr,"illegal argument in %s()\n",name);
1358: CPVS = GPVS; return;
1359: }
1360: }
1.21 noro 1361: usrf_list = module ? module->usrf_list : usrf;
1362: for ( sn = usrf_list; sn && strcmp(NAME((FUNC)BDY(sn)),name); sn = NEXT(sn) );
1.1 noro 1363: if ( sn )
1364: f = (FUNC)BDY(sn);
1365: else {
1366: f=(FUNC)MALLOC(sizeof(struct oFUNC));
1367: f->name = name;
1.21 noro 1368: MKNODE(tn,f,usrf_list); usrf_list = tn;
1.25 noro 1369: if ( module ) {
1370: f->fullname =
1371: (char *)MALLOC_ATOMIC(strlen(f->name)+strlen(module->name)+1);
1372: sprintf(f->fullname,"%s.%s",module->name,f->name);
1.21 noro 1373: module->usrf_list = usrf_list;
1.25 noro 1374: } else {
1375: f->fullname = f->name;
1.21 noro 1376: usrf = usrf_list;
1.25 noro 1377: }
1.21 noro 1378: }
1379: if ( Verbose && f->id != A_UNDEF ) {
1380: if ( module )
1381: fprintf(stderr,"Warning : %s.%s() redefined.\n",module->name,name);
1382: else
1383: fprintf(stderr,"Warning : %s() redefined.\n",name);
1.1 noro 1384: }
1385: t=(USRF)MALLOC(sizeof(struct oUSRF));
1386: t->args=args; BDY(t)=body; t->pvs = CPVS; t->fname = fname;
1.21 noro 1387: t->startl = startl; t->endl = endl; t->module = module;
1.1 noro 1388: t->desc = desc;
1389: f->id = A_USR; f->argc = argc; f->f.usrf = t;
1390: CPVS = GPVS;
1.24 noro 1391: CUR_FUNC = 0;
1.1 noro 1392: clearbp(f);
1393: }
1394:
1395: /*
1396: retrieve value of an option whose key matches 'key'
1397: CVS->opt is a list(node) of key-value pair (list)
1398: CVS->opt = BDY([[key,value],[key,value],...])
1399: */
1400:
1.16 noro 1401: Obj getopt_from_cpvs(char *key)
1.1 noro 1402: {
1403: NODE opts,opt;
1.12 noro 1404: LIST r;
1.1 noro 1405: extern Obj VOIDobj;
1406:
1407: opts = CPVS->opt;
1.12 noro 1408: if ( !key ) {
1409: MKLIST(r,opts);
1410: return (Obj)r;
1411: } else {
1412: for ( ; opts; opts = NEXT(opts) ) {
1413: asir_assert(BDY(opts),O_LIST,"getopt_from_cvps");
1414: opt = BDY((LIST)BDY(opts));
1415: if ( !strcmp(key,BDY((STRING)BDY(opt))) )
1416: return (Obj)BDY(NEXT(opt));
1417: }
1418: return VOIDobj;
1.1 noro 1419: }
1420:
1.21 noro 1421: }
1422:
1423: MODULE mkmodule(char *name)
1424: {
1425: MODULE mod;
1426: NODE m;
1427: int len;
1428: VS mpvs;
1429:
1430: for ( m = MODULE_LIST; m; m = NEXT(m) ) {
1431: mod = (MODULE)m->body;
1432: if ( !strcmp(mod->name,name) )
1433: break;
1434: }
1435: if ( m )
1436: return mod;
1437: else {
1438: mod = (MODULE)MALLOC(sizeof(struct oMODULE));
1439: len = strlen(name);
1440: mod->name = (char *)MALLOC_ATOMIC(len+1);
1441: strcpy(mod->name,name);
1442: mod->pvs = mpvs = (VS)MALLOC(sizeof(struct oVS));
1443: reallocarray((char **)&mpvs->va,(int *)&mpvs->asize,
1444: (int *)&mpvs->n,(int)sizeof(struct oPV));
1445: mod->usrf_list = 0;
1446: MKNODE(m,mod,MODULE_LIST);
1447: MODULE_LIST = m;
1448: return mod;
1449: }
1.23 noro 1450: }
1451:
1.24 noro 1452: void print_crossref(FUNC f)
1453: {
1.26 takayama 1454: FUNC r;
1455: if ( show_crossref && CUR_FUNC ) {
1456: searchuf(f->fullname,&r);
1457: if (r != NULL) {
1458: fprintf(asir_out,"%s() at line %d in %s()\n",
1459: f->fullname, asir_infile->ln, CUR_FUNC);
1460: }
1461: }
1.1 noro 1462: }