version 1.36, 2004/10/27 08:21:47 |
version 1.45, 2005/09/27 03:00:21 |
|
|
* 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.35 2004/07/07 07:40:19 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.44 2005/09/21 23:39:32 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 71 pointer eval(FNODE f) |
|
Line 72 pointer eval(FNODE f) |
|
STRING str; |
STRING str; |
pointer val = 0; |
pointer val = 0; |
pointer a,a1,a2; |
pointer a,a1,a2; |
NODE tn,ind; |
NODE tn,ind,match; |
R u; |
R u; |
DP dp; |
DP dp; |
unsigned int pv; |
unsigned int pv; |
int c; |
int c,ret; |
FNODE f1; |
FNODE f1; |
UP2 up2; |
UP2 up2; |
UP up; |
UP up; |
Line 85 pointer eval(FNODE f) |
|
Line 86 pointer eval(FNODE f) |
|
GFPN gfpn; |
GFPN gfpn; |
GFSN gfsn; |
GFSN gfsn; |
RANGE range; |
RANGE range; |
|
QUOTE expr,pattern; |
|
|
#if defined(VISUAL) |
#if defined(VISUAL) |
if ( recv_intr ) { |
if ( recv_intr ) { |
Line 167 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 223 pointer eval(FNODE f) |
|
Line 224 pointer eval(FNODE f) |
|
error("-- : not implemented yet"); |
error("-- : not implemented yet"); |
break; |
break; |
case I_PVAR: |
case I_PVAR: |
pv = (unsigned int)FA0(f); ind = (NODE)FA1(f); GETPV(pv,a); |
pv = (unsigned int)FA0(f); |
|
ind = (NODE)FA1(f); |
|
GETPV(pv,a); |
if ( !ind ) |
if ( !ind ) |
val = a; |
val = a; |
else { |
else { |
Line 330 pointer eval(FNODE f) |
|
Line 333 pointer eval(FNODE f) |
|
return ( val ); |
return ( val ); |
} |
} |
|
|
|
NODE partial_eval_node(NODE n); |
|
FNODE partial_eval(FNODE f); |
|
|
|
FNODE partial_eval(FNODE f) |
|
{ |
|
FNODE a0,a1,a2; |
|
NODE n; |
|
pointer val; |
|
|
|
if ( !f ) |
|
return f; |
|
switch ( f->id ) { |
|
case I_NOT: case I_PAREN: case I_MINUS: |
|
case I_CAR: case I_CDR: |
|
a0 = partial_eval((FNODE)FA0(f)); |
|
return mkfnode(1,f->id,a0); |
|
|
|
case I_BOP: case I_COP: case I_LOP: |
|
a1 = partial_eval((FNODE)FA1(f)); |
|
a2 = partial_eval((FNODE)FA2(f)); |
|
return mkfnode(3,f->id,FA0(f),a1,a2); |
|
|
|
case I_AND: case I_OR: |
|
a0 = partial_eval((FNODE)FA0(f)); |
|
a1 = partial_eval((FNODE)FA1(f)); |
|
return mkfnode(2,f->id,a0,a1); |
|
|
|
/* ternary operators */ |
|
case I_CE: |
|
a0 = partial_eval((FNODE)FA0(f)); |
|
a1 = partial_eval((FNODE)FA1(f)); |
|
a2 = partial_eval((FNODE)FA2(f)); |
|
return mkfnode(3,f->id,a0,a1,a2); |
|
break; |
|
|
|
/* function */ |
|
case I_FUNC: |
|
a1 = partial_eval((FNODE)FA1(f)); |
|
return mkfnode(2,f->id,FA0(f),a1); |
|
|
|
case I_LIST: case I_EV: |
|
n = partial_eval_node((NODE)FA0(f)); |
|
return mkfnode(1,f->id,n); |
|
|
|
case I_STR: case I_FORMULA: |
|
return f; |
|
|
|
/* program variable */ |
|
case I_PVAR: |
|
val = eval(f); |
|
if ( val && OID((Obj)val) == O_QUOTE ) |
|
return partial_eval((FNODE)BDY((QUOTE)val)); |
|
else |
|
return mkfnode(1,I_FORMULA,val); |
|
|
|
default: |
|
error("partial_eval : not implemented yet"); |
|
} |
|
} |
|
|
|
NODE partial_eval_node(NODE n) |
|
{ |
|
NODE r0,r,t; |
|
|
|
for ( r0 = 0, t = n; t; t = NEXT(t) ) { |
|
NEXTNODE(r0,r); |
|
BDY(r) = partial_eval((FNODE)BDY(t)); |
|
} |
|
if ( r0 ) NEXT(r) = 0; |
|
return r0; |
|
} |
|
|
|
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 376 pointer evalstat(SNODE f) |
|
Line 455 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 428 pointer evalstat(SNODE f) |
|
Line 513 pointer evalstat(SNODE f) |
|
break; |
break; |
} |
} |
f_break = 0; break; |
f_break = 0; break; |
|
case S_MODULE: |
|
CUR_MODULE = (MODULE)FA0(f); |
|
if ( CUR_MODULE ) |
|
MPVS = CUR_MODULE->pvs; |
|
else |
|
MPVS = 0; |
|
break; |
default: |
default: |
error("evalstat : unknown id"); |
error("evalstat : unknown id"); |
break; |
break; |
Line 449 pointer evalnode(NODE node) |
|
Line 541 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 459 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 578 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 495 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 619 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 521 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 645 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 568 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 692 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 578 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 702 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 589 pointer evalmapf(FUNC f,FNODE a) |
|
Line 735 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 632 pointer eval_rec_mapf(FUNC f,FNODE a) |
|
Line 778 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 691 pointer bevalf(FUNC f,NODE a) |
|
Line 837 pointer bevalf(FUNC f,NODE a) |
|
pointer val; |
pointer val; |
int i,n; |
int i,n; |
NODE tn,sn; |
NODE tn,sn; |
VS pvs; |
VS pvs,prev_mpvs; |
char errbuf[BUFSIZ]; |
char errbuf[BUFSIZ]; |
|
|
if ( f->id == A_UNDEF ) { |
if ( f->id == A_UNDEF ) { |
sprintf(errbuf,"bevalf : %s undefined",NAME(f)); |
sprintf(errbuf,"bevalf : %s undefined",NAME(f)); |
error(errbuf); |
error(errbuf); |
} |
} |
|
if ( getsecuremode() && !PVSS && !f->secure ) { |
|
sprintf(errbuf,"bevalf : %s not permitted",NAME(f)); |
|
error(errbuf); |
|
} |
if ( f->id != A_PARI ) { |
if ( f->id != A_PARI ) { |
for ( i = 0, tn = a; tn; i++, tn = NEXT(tn) ); |
for ( i = 0, tn = a; tn; i++, tn = NEXT(tn) ); |
if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) { |
if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) { |
Line 739 pointer bevalf(FUNC f,NODE a) |
|
Line 889 pointer bevalf(FUNC f,NODE a) |
|
for ( tn = f->f.usrf->args, sn = a; |
for ( tn = f->f.usrf->args, sn = a; |
sn; tn = NEXT(tn), sn = NEXT(sn) ) |
sn; tn = NEXT(tn), sn = NEXT(sn) ) |
ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn)); |
ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn)); |
val = evalstat((SNODE)BDY(f->f.usrf)); |
if ( f->f.usrf->module ) { |
|
prev_mpvs = MPVS; |
|
MPVS = f->f.usrf->module->pvs; |
|
val = evalstat((SNODE)BDY(f->f.usrf)); |
|
MPVS = prev_mpvs; |
|
} else |
|
val = evalstat((SNODE)BDY(f->f.usrf)); |
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 756 pointer bevalf(FUNC f,NODE a) |
|
Line 912 pointer bevalf(FUNC f,NODE a) |
|
pointer evalif(FNODE f,FNODE a) |
pointer evalif(FNODE f,FNODE a) |
{ |
{ |
Obj g; |
Obj g; |
|
FNODE t; |
|
|
g = (Obj)eval(f); |
g = (Obj)eval(f); |
if ( g && (OID(g) == O_P) && (VR((P)g)->attr == (pointer)V_SR) ) |
if ( g && (OID(g) == O_P) && (VR((P)g)->attr == (pointer)V_SR) ) |
return evalf((FUNC)VR((P)g)->priv,a,0); |
return evalf((FUNC)VR((P)g)->priv,a,0); |
else { |
else if ( g && OID(g) == O_QUOTEARG && ((QUOTEARG)g)->type == A_func ) { |
|
t = mkfnode(2,I_FUNC,((QUOTEARG)g)->body,a); |
|
return eval(t); |
|
} else { |
error("invalid function pointer"); |
error("invalid function pointer"); |
/* NOTREACHED */ |
/* NOTREACHED */ |
return (pointer)-1; |
return (pointer)-1; |
} |
} |
} |
} |
|
|
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 { |
Line 984 void mkuf(char *name,char *fname,NODE args,SNODE body, |
|
Line 1149 void mkuf(char *name,char *fname,NODE args,SNODE body, |
|
char *longname; |
char *longname; |
int argc; |
int argc; |
|
|
|
if ( getsecuremode() ) { |
|
error("defining function is not permitted in the secure mode"); |
|
} |
if ( *name == ':' ) |
if ( *name == ':' ) |
name += 2; |
name += 2; |
if ( !module ) { |
if ( !module ) { |