version 1.42, 2005/09/13 06:54:22 |
version 1.44, 2005/09/21 23:39:32 |
|
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* |
* |
* $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.41 2005/09/13 06:40:46 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.43 2005/09/14 02:48:38 noro Exp $ |
*/ |
*/ |
#include <ctype.h> |
#include <ctype.h> |
#include "ca.h" |
#include "ca.h" |
Line 64 int f_break,f_return,f_continue; |
|
Line 64 int f_break,f_return,f_continue; |
|
int evalstatline; |
int evalstatline; |
int recv_intr; |
int recv_intr; |
int show_crossref; |
int show_crossref; |
|
void gen_searchf_searchonly(char *name,FUNC *r); |
|
|
pointer eval(FNODE f) |
pointer eval(FNODE f) |
{ |
{ |
Line 168 pointer eval(FNODE f) |
|
Line 169 pointer eval(FNODE f) |
|
case I_FUNC_OPT: |
case I_FUNC_OPT: |
val = evalf((FUNC)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break; |
val = evalf((FUNC)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break; |
case I_PFDERIV: |
case I_PFDERIV: |
error("eval : not implemented yet"); |
val = evalf_deriv((FUNC)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break; |
break; |
|
case I_MAP: |
case I_MAP: |
val = evalmapf((FUNC)FA0(f),(FNODE)FA1(f)); break; |
val = evalmapf((FUNC)FA0(f),(FNODE)FA1(f)); break; |
case I_RECMAP: |
case I_RECMAP: |
Line 333 pointer eval(FNODE f) |
|
Line 333 pointer eval(FNODE f) |
|
return ( val ); |
return ( val ); |
} |
} |
|
|
|
V searchvar(char *name); |
|
|
pointer evalstat(SNODE f) |
pointer evalstat(SNODE f) |
{ |
{ |
pointer val = 0,t,s,s1; |
pointer val = 0,t,s,s1; |
P u; |
P u; |
NODE tn; |
NODE tn; |
int i,ac; |
int i,ac; |
|
V v; |
V *a; |
V *a; |
char *buf; |
char *buf; |
|
FUNC func; |
|
|
if ( !f ) |
if ( !f ) |
return ( 0 ); |
return ( 0 ); |
Line 379 pointer evalstat(SNODE f) |
|
Line 383 pointer evalstat(SNODE f) |
|
makevar(buf,&u); a[i] = VR(u); |
makevar(buf,&u); a[i] = VR(u); |
substr(CO,0,(Obj)s,VR((P)t),(Obj)u,(Obj *)&s1); s = s1; |
substr(CO,0,(Obj)s,VR((P)t),(Obj)u,(Obj *)&s1); s = s1; |
} |
} |
mkpf((char *)FA0(f),(Obj)s,ac,a,0,0,0,(PF *)&val); val = 0; break; |
mkpf((char *)FA0(f),(Obj)s,ac,a,0,0,0,(PF *)&val); val = 0; |
|
v = searchvar((char *)FA0(f)); |
|
if ( v ) { |
|
searchpf((char *)FA0(f),&func); |
|
makesrvar(func,&u); |
|
} |
|
break; |
case S_SINGLE: |
case S_SINGLE: |
val = eval((FNODE)FA0(f)); break; |
val = eval((FNODE)FA0(f)); break; |
case S_CPLX: |
case S_CPLX: |
Line 459 pointer evalnode(NODE node) |
|
Line 469 pointer evalnode(NODE node) |
|
extern FUNC cur_binf; |
extern FUNC cur_binf; |
extern NODE PVSS; |
extern NODE PVSS; |
|
|
|
LIST eval_arg(FNODE a,unsigned int quote) |
|
{ |
|
LIST l; |
|
FNODE fn; |
|
NODE n,n0,tn; |
|
QUOTE q; |
|
int i; |
|
|
|
for ( tn = (NODE)FA0(a), n0 = 0, i = 0; tn; tn = NEXT(tn), i++ ) { |
|
NEXTNODE(n0,n); |
|
if ( quote & (1<<i) ) { |
|
fn = (FNODE)(BDY(tn)); |
|
if ( fn->id == I_FORMULA && FA0(fn) |
|
&& OID((Obj)FA0(fn))== O_QUOTE ) |
|
BDY(n) = FA0(fn); |
|
else { |
|
MKQUOTE(q,(FNODE)BDY(tn)); |
|
BDY(n) = (pointer)q; |
|
} |
|
} else |
|
BDY(n) = eval((FNODE)BDY(tn)); |
|
} |
|
if ( n0 ) NEXT(n) = 0; |
|
MKLIST(l,n0); |
|
return l; |
|
} |
|
|
pointer evalf(FUNC f,FNODE a,FNODE opt) |
pointer evalf(FUNC f,FNODE a,FNODE opt) |
{ |
{ |
LIST args; |
LIST args; |
Line 469 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 506 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
char errbuf[BUFSIZ]; |
char errbuf[BUFSIZ]; |
static unsigned int stack_size; |
static unsigned int stack_size; |
static void *stack_base; |
static void *stack_base; |
|
FUNC f1; |
|
|
if ( f->id == A_UNDEF ) { |
if ( f->id == A_UNDEF ) { |
sprintf(errbuf,"evalf : %s undefined",NAME(f)); |
gen_searchf_searchonly(f->fullname,&f1); |
error(errbuf); |
if ( f1->id == A_UNDEF ) { |
|
sprintf(errbuf,"evalf : %s undefined",NAME(f)); |
|
error(errbuf); |
|
} else |
|
*f = *f1; |
} |
} |
if ( getsecuremode() && !PVSS && !f->secure ) { |
if ( getsecuremode() && !PVSS && !f->secure ) { |
sprintf(errbuf,"evalf : %s not permitted",NAME(f)); |
sprintf(errbuf,"evalf : %s not permitted",NAME(f)); |
Line 505 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 547 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
cur_binf = f; |
cur_binf = f; |
(*f->f.binf)(&val); |
(*f->f.binf)(&val); |
} else { |
} else { |
args = (LIST)eval(a); |
args = (LIST)eval_arg(a,f->quote); |
current_option = opts; |
current_option = opts; |
cur_binf = f; |
cur_binf = f; |
(*f->f.binf)(args?BDY(args):0,&val); |
(*f->f.binf)(args?BDY(args):0,&val); |
Line 531 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 573 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
if ( (stack_base - (void *)&args) +0x100000 > stack_size ) |
if ( (stack_base - (void *)&args) +0x100000 > stack_size ) |
error("stack overflow"); |
error("stack overflow"); |
#endif |
#endif |
args = (LIST)eval(a); |
args = (LIST)eval_arg(a,f->quote); |
if ( opt ) { |
if ( opt ) { |
opts = BDY((LIST)eval(opt)); |
opts = BDY((LIST)eval(opt)); |
/* opts = ["opt1",arg1],... */ |
/* opts = ["opt1",arg1],... */ |
Line 578 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 620 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
break; |
break; |
case A_PURE: |
case A_PURE: |
args = (LIST)eval(a); |
args = (LIST)eval(a); |
val = evalpf(f->f.puref,args?BDY(args):0); |
val = evalpf(f->f.puref,args?BDY(args):0,0); |
break; |
break; |
default: |
default: |
sprintf(errbuf,"evalf : %s undefined",NAME(f)); |
sprintf(errbuf,"evalf : %s undefined",NAME(f)); |
Line 588 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 630 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
return val; |
return val; |
} |
} |
|
|
|
pointer evalf_deriv(FUNC f,FNODE a,FNODE deriv) |
|
{ |
|
LIST args,dargs; |
|
pointer val; |
|
char errbuf[BUFSIZ]; |
|
|
|
switch ( f->id ) { |
|
case A_PURE: |
|
args = (LIST)eval(a); |
|
dargs = (LIST)eval(deriv); |
|
val = evalpf(f->f.puref, |
|
args?BDY(args):0,dargs?BDY(dargs):0); |
|
break; |
|
default: |
|
sprintf(errbuf, |
|
"evalf : %s is not a pure function",NAME(f)); |
|
error(errbuf); |
|
break; |
|
} |
|
return val; |
|
} |
|
|
pointer evalmapf(FUNC f,FNODE a) |
pointer evalmapf(FUNC f,FNODE a) |
{ |
{ |
LIST args; |
LIST args; |
Line 599 pointer evalmapf(FUNC f,FNODE a) |
|
Line 663 pointer evalmapf(FUNC f,FNODE a) |
|
int len,row,col,i,j; |
int len,row,col,i,j; |
pointer val; |
pointer val; |
|
|
args = (LIST)eval(a); |
args = (LIST)eval_arg(a,f->quote); |
node = BDY(args); head = (Obj)BDY(node); rest = NEXT(node); |
node = BDY(args); head = (Obj)BDY(node); rest = NEXT(node); |
if ( !head ) { |
if ( !head ) { |
val = bevalf(f,node); |
val = bevalf(f,node); |
Line 642 pointer eval_rec_mapf(FUNC f,FNODE a) |
|
Line 706 pointer eval_rec_mapf(FUNC f,FNODE a) |
|
{ |
{ |
LIST args; |
LIST args; |
|
|
args = (LIST)eval(a); |
args = (LIST)eval_arg(a,f->quote); |
return beval_rec_mapf(f,BDY(args)); |
return beval_rec_mapf(f,BDY(args)); |
} |
} |
|
|
Line 701 pointer bevalf(FUNC f,NODE a) |
|
Line 765 pointer bevalf(FUNC f,NODE a) |
|
pointer val; |
pointer val; |
int i,n; |
int i,n; |
NODE tn,sn; |
NODE tn,sn; |
VS pvs,prev_mpvs; |
VS pvs,prev_mpvs; |
char errbuf[BUFSIZ]; |
char errbuf[BUFSIZ]; |
|
|
if ( f->id == A_UNDEF ) { |
if ( f->id == A_UNDEF ) { |
Line 763 pointer bevalf(FUNC f,NODE a) |
|
Line 827 pointer bevalf(FUNC f,NODE a) |
|
f_return = f_break = f_continue = 0; poppvs(); |
f_return = f_break = f_continue = 0; poppvs(); |
break; |
break; |
case A_PURE: |
case A_PURE: |
val = evalpf(f->f.puref,a); |
val = evalpf(f->f.puref,a,0); |
break; |
break; |
default: |
default: |
sprintf(errbuf,"bevalf : %s undefined",NAME(f)); |
sprintf(errbuf,"bevalf : %s undefined",NAME(f)); |
Line 791 pointer evalif(FNODE f,FNODE a) |
|
Line 855 pointer evalif(FNODE f,FNODE a) |
|
} |
} |
} |
} |
|
|
pointer evalpf(PF pf,NODE args) |
pointer evalpf(PF pf,NODE args,NODE dargs) |
{ |
{ |
Obj s,s1; |
Obj s,s1; |
int i; |
int i; |
NODE node; |
NODE node,dnode; |
PFINS ins; |
PFINS ins; |
PFAD ad; |
PFAD ad; |
|
|
if ( !pf->body ) { |
if ( !pf->body ) { |
ins = (PFINS)CALLOC(1,sizeof(PF)+pf->argc*sizeof(struct oPFAD)); |
ins = (PFINS)CALLOC(1,sizeof(PF)+pf->argc*sizeof(struct oPFAD)); |
ins->pf = pf; |
ins->pf = pf; |
for ( i = 0, node = args, ad = ins->ad; |
for ( i = 0, node = args, dnode = dargs, ad = ins->ad; |
node; node = NEXT(node), i++ ) { |
node; i++ ) { |
ad[i].d = 0; ad[i].arg = (Obj)node->body; |
ad[i].arg = (Obj)node->body; |
|
if ( !dnode ) ad[i].d = 0; |
|
else |
|
ad[i].d = QTOS((Q)dnode->body); |
|
node = NEXT(node); |
|
if ( dnode ) dnode = NEXT(dnode); |
} |
} |
simplify_ins(ins,&s); |
simplify_ins(ins,&s); |
} else { |
} else { |