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