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