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