version 1.45, 2005/09/27 03:00:21 |
version 1.70, 2014/08/09 06:08:11 |
|
|
* 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.44 2005/09/21 23:39:32 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.69 2013/11/21 06:48:04 noro Exp $ |
*/ |
*/ |
#include <ctype.h> |
#include <ctype.h> |
#include "ca.h" |
#include "ca.h" |
#include "al.h" |
#include "al.h" |
#include "base.h" |
#include "base.h" |
#include "parse.h" |
#include "parse.h" |
|
#if defined(GC7) |
|
#include "gc.h" |
|
#endif |
#include <sys/types.h> |
#include <sys/types.h> |
#include <sys/stat.h> |
#include <sys/stat.h> |
#if defined(PARI) |
#if defined(PARI) |
|
|
#endif |
#endif |
|
|
extern JMP_BUF timer_env; |
extern JMP_BUF timer_env; |
|
extern FUNC cur_binf; |
|
extern NODE PVSS; |
|
|
int f_break,f_return,f_continue; |
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); |
int at_root; |
|
void gen_searchf_searchonly(char *name,FUNC *r,int global); |
|
LIST eval_arg(FNODE a,unsigned int quote); |
|
|
pointer eval(FNODE f) |
pointer eval(FNODE f) |
{ |
{ |
Line 72 pointer eval(FNODE f) |
|
Line 79 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,match; |
NODE tn,tn1,ind,match; |
R u; |
R u; |
DP dp; |
DP dp; |
unsigned int pv; |
unsigned int pv; |
Line 115 pointer eval(FNODE f) |
|
Line 122 pointer eval(FNODE f) |
|
a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f)); |
a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f)); |
(*((ARF)FA0(f))->fp)(CO,a1,a2,&val); |
(*((ARF)FA0(f))->fp)(CO,a1,a2,&val); |
break; |
break; |
|
case I_NARYOP: |
|
tn = (NODE)FA1(f); |
|
a = eval((FNODE)BDY(tn)); |
|
for ( tn = NEXT(tn); tn; tn = NEXT(tn) ) { |
|
a1 = eval((FNODE)BDY(tn)); |
|
(*((ARF)FA0(f))->fp)(CO,a,a1,&a2); |
|
a = a2; |
|
} |
|
val = a; |
|
break; |
case I_COP: |
case I_COP: |
a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f)); |
a1 = eval((FNODE)FA1(f)); a2 = eval((FNODE)FA2(f)); |
c = arf_comp(CO,a1,a2); |
c = arf_comp(CO,a1,a2); |
Line 168 pointer eval(FNODE f) |
|
Line 185 pointer eval(FNODE f) |
|
val = evalf((FUNC)FA0(f),(FNODE)FA1(f),0); break; |
val = evalf((FUNC)FA0(f),(FNODE)FA1(f),0); break; |
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_FUNC_QARG: |
|
tn = BDY(eval_arg((FNODE)FA1(f),(unsigned int)0xffffffff)); |
|
val = bevalf((FUNC)FA0(f),tn); break; |
case I_PFDERIV: |
case I_PFDERIV: |
val = evalf_deriv((FUNC)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break; |
val = evalf_deriv((FUNC)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break; |
case I_MAP: |
case I_MAP: |
Line 175 pointer eval(FNODE f) |
|
Line 195 pointer eval(FNODE f) |
|
case I_RECMAP: |
case I_RECMAP: |
val = eval_rec_mapf((FUNC)FA0(f),(FNODE)FA1(f)); break; |
val = eval_rec_mapf((FUNC)FA0(f),(FNODE)FA1(f)); break; |
case I_IFUNC: |
case I_IFUNC: |
val = evalif((FNODE)FA0(f),(FNODE)FA1(f)); break; |
val = evalif((FNODE)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break; |
#if !defined(VISUAL) |
#if !defined(VISUAL) |
case I_TIMER: |
case I_TIMER: |
{ |
{ |
Line 290 pointer eval(FNODE f) |
|
Line 310 pointer eval(FNODE f) |
|
val = FA0(f); break; |
val = FA0(f); break; |
case I_LIST: |
case I_LIST: |
evalnodebody((NODE)FA0(f),&tn); MKLIST(t,tn); val = (pointer)t; break; |
evalnodebody((NODE)FA0(f),&tn); MKLIST(t,tn); val = (pointer)t; break; |
|
case I_CONS: |
|
evalnodebody((NODE)FA0(f),&tn); a2 = eval(FA1(f)); |
|
if ( !a2 || OID(a2) != O_LIST ) |
|
error("cons : invalid argument"); |
|
for ( tn1 = tn; NEXT(tn1); tn1 = NEXT(tn1) ); |
|
NEXT(tn1) = BDY((LIST)a2); |
|
MKLIST(t,tn); val = (pointer)t; |
|
break; |
case I_NEWCOMP: |
case I_NEWCOMP: |
newstruct((int)FA0(f),(struct oCOMP **)&val); break; |
newstruct((int)FA0(f),(struct oCOMP **)&val); break; |
case I_CAR: |
case I_CAR: |
Line 333 pointer eval(FNODE f) |
|
Line 361 pointer eval(FNODE f) |
|
return ( val ); |
return ( val ); |
} |
} |
|
|
|
NODE fnode_to_nary_node(NODE); |
|
NODE fnode_to_bin_node(NODE,int); |
|
|
|
FNODE fnode_to_nary(FNODE f) |
|
{ |
|
FNODE a0,a1,a2; |
|
NODE n,t,t0; |
|
pointer val; |
|
char *op; |
|
|
|
if ( !f ) |
|
return f; |
|
switch ( f->id ) { |
|
case I_NARYOP: |
|
n = fnode_to_nary_node((NODE)FA1(f)); |
|
return mkfnode(2,I_NARYOP,FA0(f),n); |
|
|
|
case I_BOP: |
|
a1 = fnode_to_nary((FNODE)FA1(f)); |
|
a2 = fnode_to_nary((FNODE)FA2(f)); |
|
op = ((ARF)FA0(f))->name; |
|
if ( !strcmp(op,"+") || !strcmp(op,"*") ) { |
|
if ( a1->id == I_NARYOP && !strcmp(op,((ARF)FA0(a1))->name) ) { |
|
for ( n = (NODE)FA1(a1); NEXT(n); n = NEXT(n) ); |
|
if ( a2->id == I_NARYOP && !strcmp(op,((ARF)FA0(a2))->name) ) |
|
NEXT(n) = (NODE)FA1(a2); |
|
else |
|
MKNODE(NEXT(n),a2,0); |
|
return a1; |
|
} else if ( a2->id == I_NARYOP && !strcmp(op,((ARF)FA0(a2))->name) ) { |
|
MKNODE(t,a1,(NODE)FA1(a2)); |
|
return mkfnode(2,I_NARYOP,FA0(f),t); |
|
} else { |
|
t = mknode(2,a1,a2); |
|
return mkfnode(2,I_NARYOP,FA0(f),t); |
|
} |
|
} else |
|
return mkfnode(3,f->id,FA0(f),a1,a2); |
|
|
|
case I_NOT: case I_PAREN: case I_MINUS: |
|
case I_CAR: case I_CDR: |
|
a0 = fnode_to_nary((FNODE)FA0(f)); |
|
return mkfnode(1,f->id,a0); |
|
|
|
case I_COP: case I_LOP: |
|
a1 = fnode_to_nary((FNODE)FA1(f)); |
|
a2 = fnode_to_nary((FNODE)FA2(f)); |
|
return mkfnode(3,f->id,FA0(f),a1,a2); |
|
|
|
case I_AND: case I_OR: |
|
a0 = fnode_to_nary((FNODE)FA0(f)); |
|
a1 = fnode_to_nary((FNODE)FA1(f)); |
|
return mkfnode(2,f->id,a0,a1); |
|
|
|
/* ternary operators */ |
|
case I_CE: |
|
a0 = fnode_to_nary((FNODE)FA0(f)); |
|
a1 = fnode_to_nary((FNODE)FA1(f)); |
|
a2 = fnode_to_nary((FNODE)FA2(f)); |
|
return mkfnode(3,f->id,a0,a1,a2); |
|
break; |
|
|
|
/* function */ |
|
case I_FUNC: |
|
a1 = fnode_to_nary((FNODE)FA1(f)); |
|
return mkfnode(2,f->id,FA0(f),a1); |
|
|
|
case I_LIST: case I_EV: |
|
n = fnode_to_nary_node((NODE)FA0(f)); |
|
return mkfnode(1,f->id,n); |
|
|
|
case I_STR: case I_FORMULA: case I_PVAR: |
|
return f; |
|
|
|
default: |
|
error("fnode_to_nary : not implemented yet"); |
|
} |
|
} |
|
|
|
FNODE fnode_to_bin(FNODE f,int dir) |
|
{ |
|
FNODE a0,a1,a2; |
|
NODE n,t; |
|
pointer val; |
|
ARF fun; |
|
int len,i; |
|
FNODE *arg; |
|
|
|
if ( !f ) |
|
return f; |
|
switch ( f->id ) { |
|
case I_NARYOP: |
|
fun = (ARF)FA0(f); |
|
len = length((NODE)FA1(f)); |
|
if ( len==1 ) return BDY((NODE)(FA1(f))); |
|
|
|
arg = (FNODE *)ALLOCA(len*sizeof(FNODE)); |
|
for ( i = 0, t = (NODE)FA1(f); i < len; i++, t = NEXT(t) ) |
|
arg[i] = fnode_to_bin((FNODE)BDY(t),dir); |
|
if ( dir ) { |
|
a2 = mkfnode(3,I_BOP,fun,arg[len-2],arg[len-1]); |
|
for ( i = len-3; i >= 0; i-- ) |
|
a2 = mkfnode(3,I_BOP,fun,arg[i],a2); |
|
} else { |
|
a2 = mkfnode(3,I_BOP,fun,arg[0],arg[1]); |
|
for ( i = 2; i < len; i++ ) |
|
a2 = mkfnode(3,I_BOP,fun,a2,arg[i]); |
|
} |
|
return a2; |
|
|
|
case I_NOT: case I_PAREN: case I_MINUS: |
|
case I_CAR: case I_CDR: |
|
a0 = fnode_to_bin((FNODE)FA0(f),dir); |
|
return mkfnode(1,f->id,a0); |
|
|
|
case I_BOP: case I_COP: case I_LOP: |
|
a1 = fnode_to_bin((FNODE)FA1(f),dir); |
|
a2 = fnode_to_bin((FNODE)FA2(f),dir); |
|
return mkfnode(3,f->id,FA0(f),a1,a2); |
|
|
|
case I_AND: case I_OR: |
|
a0 = fnode_to_bin((FNODE)FA0(f),dir); |
|
a1 = fnode_to_bin((FNODE)FA1(f),dir); |
|
return mkfnode(2,f->id,a0,a1); |
|
|
|
/* ternary operators */ |
|
case I_CE: |
|
a0 = fnode_to_bin((FNODE)FA0(f),dir); |
|
a1 = fnode_to_bin((FNODE)FA1(f),dir); |
|
a2 = fnode_to_bin((FNODE)FA2(f),dir); |
|
return mkfnode(3,f->id,a0,a1,a2); |
|
break; |
|
|
|
/* function */ |
|
case I_FUNC: |
|
a1 = fnode_to_bin((FNODE)FA1(f),dir); |
|
return mkfnode(2,f->id,FA0(f),a1); |
|
|
|
case I_LIST: case I_EV: |
|
n = fnode_to_bin_node((NODE)FA0(f),dir); |
|
return mkfnode(1,f->id,n); |
|
|
|
case I_STR: case I_FORMULA: case I_PVAR: |
|
return f; |
|
|
|
default: |
|
error("fnode_to_bin : not implemented yet"); |
|
} |
|
} |
|
|
NODE partial_eval_node(NODE n); |
NODE partial_eval_node(NODE n); |
FNODE partial_eval(FNODE f); |
FNODE partial_eval(FNODE f); |
|
|
Line 340 FNODE partial_eval(FNODE f) |
|
Line 518 FNODE partial_eval(FNODE f) |
|
{ |
{ |
FNODE a0,a1,a2; |
FNODE a0,a1,a2; |
NODE n; |
NODE n; |
|
Obj obj; |
|
QUOTE q; |
pointer val; |
pointer val; |
|
FUNC func; |
|
|
if ( !f ) |
if ( !f ) |
return f; |
return f; |
Line 355 FNODE partial_eval(FNODE f) |
|
Line 536 FNODE partial_eval(FNODE f) |
|
a2 = partial_eval((FNODE)FA2(f)); |
a2 = partial_eval((FNODE)FA2(f)); |
return mkfnode(3,f->id,FA0(f),a1,a2); |
return mkfnode(3,f->id,FA0(f),a1,a2); |
|
|
|
case I_NARYOP: |
|
n = partial_eval_node((NODE)FA1(f)); |
|
return mkfnode(2,f->id,FA0(f),n); |
|
|
case I_AND: case I_OR: |
case I_AND: case I_OR: |
a0 = partial_eval((FNODE)FA0(f)); |
a0 = partial_eval((FNODE)FA0(f)); |
a1 = partial_eval((FNODE)FA1(f)); |
a1 = partial_eval((FNODE)FA1(f)); |
Line 368 FNODE partial_eval(FNODE f) |
|
Line 553 FNODE partial_eval(FNODE f) |
|
return mkfnode(3,f->id,a0,a1,a2); |
return mkfnode(3,f->id,a0,a1,a2); |
break; |
break; |
|
|
/* function */ |
/* XXX : function is evaluated with QUOTE args */ |
case I_FUNC: |
case I_FUNC: |
a1 = partial_eval((FNODE)FA1(f)); |
a1 = partial_eval((FNODE)FA1(f)); |
return mkfnode(2,f->id,FA0(f),a1); |
func = (FUNC)FA0(f); |
|
if ( func->id == A_UNDEF || func->id != A_USR ) { |
|
a1 = mkfnode(2,I_FUNC,func,a1); |
|
return a1; |
|
} else { |
|
n = BDY(eval_arg(a1,(unsigned int)0xffffffff)); |
|
obj = bevalf(func,n); |
|
objtoquote(obj,&q); |
|
return BDY(q); |
|
} |
|
break; |
|
|
case I_LIST: case I_EV: |
case I_LIST: case I_EV: |
n = partial_eval_node((NODE)FA0(f)); |
n = partial_eval_node((NODE)FA0(f)); |
Line 405 NODE partial_eval_node(NODE n) |
|
Line 600 NODE partial_eval_node(NODE n) |
|
return r0; |
return r0; |
} |
} |
|
|
|
NODE rewrite_fnode_node(NODE n,NODE arg,int qarg); |
|
FNODE rewrite_fnode(FNODE f,NODE arg,int qarg); |
|
|
|
FNODE rewrite_fnode(FNODE f,NODE arg,int qarg) |
|
{ |
|
FNODE a0,a1,a2,value; |
|
NODE n,t,pair; |
|
pointer val; |
|
int pv,ind; |
|
|
|
if ( !f ) |
|
return f; |
|
switch ( f->id ) { |
|
case I_NOT: case I_PAREN: case I_MINUS: |
|
case I_CAR: case I_CDR: |
|
a0 = rewrite_fnode((FNODE)FA0(f),arg,qarg); |
|
return mkfnode(1,f->id,a0); |
|
|
|
case I_BOP: case I_COP: case I_LOP: |
|
a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg); |
|
a2 = rewrite_fnode((FNODE)FA2(f),arg,qarg); |
|
return mkfnode(3,f->id,FA0(f),a1,a2); |
|
|
|
case I_AND: case I_OR: |
|
a0 = rewrite_fnode((FNODE)FA0(f),arg,qarg); |
|
a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg); |
|
return mkfnode(2,f->id,a0,a1); |
|
|
|
/* ternary operators */ |
|
case I_CE: |
|
a0 = rewrite_fnode((FNODE)FA0(f),arg,qarg); |
|
a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg); |
|
a2 = rewrite_fnode((FNODE)FA2(f),arg,qarg); |
|
return mkfnode(3,f->id,a0,a1,a2); |
|
break; |
|
|
|
/* nary operators */ |
|
case I_NARYOP: |
|
n = rewrite_fnode_node((NODE)FA1(f),arg,qarg); |
|
return mkfnode(2,f->id,FA0(f),n); |
|
|
|
/* and function */ |
|
case I_FUNC: |
|
a1 = rewrite_fnode((FNODE)FA1(f),arg,qarg); |
|
return mkfnode(2,qarg?I_FUNC_QARG:f->id,FA0(f),a1); |
|
|
|
case I_LIST: case I_EV: |
|
n = rewrite_fnode_node((NODE)FA0(f),arg,qarg); |
|
return mkfnode(1,f->id,n); |
|
|
|
case I_STR: case I_FORMULA: |
|
return f; |
|
|
|
/* program variable */ |
|
case I_PVAR: |
|
pv = (int)FA0(f); |
|
for ( t = arg; t; t = NEXT(t) ) { |
|
pair = (NODE)BDY(t); |
|
ind = (int)BDY(pair); |
|
value = (FNODE)BDY(NEXT(pair)); |
|
if ( pv == ind ) |
|
return value; |
|
} |
|
return f; |
|
break; |
|
|
|
default: |
|
error("rewrite_fnode : not implemented yet"); |
|
} |
|
} |
|
|
|
NODE rewrite_fnode_node(NODE n,NODE arg,int qarg) |
|
{ |
|
NODE r0,r,t; |
|
|
|
for ( r0 = 0, t = n; t; t = NEXT(t) ) { |
|
NEXTNODE(r0,r); |
|
BDY(r) = rewrite_fnode((FNODE)BDY(t),arg,qarg); |
|
} |
|
if ( r0 ) NEXT(r) = 0; |
|
return r0; |
|
} |
|
|
|
NODE fnode_to_nary_node(NODE n) |
|
{ |
|
NODE r0,r,t; |
|
|
|
for ( r0 = 0, t = n; t; t = NEXT(t) ) { |
|
NEXTNODE(r0,r); |
|
BDY(r) = fnode_to_nary((FNODE)BDY(t)); |
|
} |
|
if ( r0 ) NEXT(r) = 0; |
|
return r0; |
|
} |
|
|
|
NODE fnode_to_bin_node(NODE n,int dir) |
|
{ |
|
NODE r0,r,t; |
|
|
|
for ( r0 = 0, t = n; t; t = NEXT(t) ) { |
|
NEXTNODE(r0,r); |
|
BDY(r) = fnode_to_bin((FNODE)BDY(t),dir); |
|
} |
|
if ( r0 ) NEXT(r) = 0; |
|
return r0; |
|
} |
|
|
V searchvar(char *name); |
V searchvar(char *name); |
|
|
pointer evalstat(SNODE f) |
pointer evalstat(SNODE f) |
Line 425 pointer evalstat(SNODE f) |
|
Line 727 pointer evalstat(SNODE f) |
|
bp(f); |
bp(f); |
} |
} |
evalstatline = f->ln; |
evalstatline = f->ln; |
|
if ( !PVSS ) at_root = evalstatline; |
|
|
switch ( f->id ) { |
switch ( f->id ) { |
case S_BP: |
case S_BP: |
Line 538 pointer evalnode(NODE node) |
|
Line 841 pointer evalnode(NODE node) |
|
return ( val ); |
return ( val ); |
} |
} |
|
|
extern FUNC cur_binf; |
|
extern NODE PVSS; |
|
|
|
LIST eval_arg(FNODE a,unsigned int quote) |
LIST eval_arg(FNODE a,unsigned int quote) |
{ |
{ |
Line 581 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 882 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
FUNC f1; |
FUNC f1; |
|
|
if ( f->id == A_UNDEF ) { |
if ( f->id == A_UNDEF ) { |
gen_searchf_searchonly(f->fullname,&f1); |
gen_searchf_searchonly(f->fullname,&f1,0); |
if ( f1->id == A_UNDEF ) { |
if ( f1->id == A_UNDEF ) { |
sprintf(errbuf,"evalf : %s undefined",NAME(f)); |
sprintf(errbuf,"evalf : %s undefined",NAME(f)); |
error(errbuf); |
error(errbuf); |
Line 616 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 917 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
} else |
} else |
opts = 0; |
opts = 0; |
if ( !n ) { |
if ( !n ) { |
|
current_option = opts; |
cur_binf = f; |
cur_binf = f; |
(*f->f.binf)(&val); |
(*f->f.binf)(&val); |
} else { |
} else { |
Line 640 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 942 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
getrlimit(RLIMIT_STACK,&rl); |
getrlimit(RLIMIT_STACK,&rl); |
stack_size = rl.rlim_cur; |
stack_size = rl.rlim_cur; |
} |
} |
if ( !stack_base ) |
if ( !stack_base ) { |
stack_base = (void *)GC_get_stack_base(); |
#if defined(GC7) |
|
stack_base = (void *)GC_get_main_stack_base(); |
|
#else |
|
stack_base = (void *)GC_get_stack_base(); |
|
#endif |
|
} |
if ( (stack_base - (void *)&args) +0x100000 > stack_size ) |
if ( (stack_base - (void *)&args) +0x100000 > stack_size ) |
error("stack overflow"); |
error("stack overflow"); |
#endif |
#endif |
Line 681 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 988 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
for ( tn = f->f.usrf->args, sn = BDY(args); |
for ( tn = f->f.usrf->args, sn = BDY(args); |
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)); |
|
f_return = f_break = f_continue = 0; |
if ( f->f.usrf->module ) { |
if ( f->f.usrf->module ) { |
prev_mpvs = MPVS; |
prev_mpvs = MPVS; |
MPVS = f->f.usrf->module->pvs; |
MPVS = f->f.usrf->module->pvs; |
Line 689 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 997 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
} else |
} else |
val = evalstat((SNODE)BDY(f->f.usrf)); |
val = evalstat((SNODE)BDY(f->f.usrf)); |
f_return = f_break = f_continue = 0; poppvs(); |
f_return = f_break = f_continue = 0; poppvs(); |
|
if ( PVSS ) |
|
evalstatline = ((VS)BDY(PVSS))->at; |
break; |
break; |
case A_PURE: |
case A_PURE: |
args = (LIST)eval(a); |
args = (LIST)eval(a); |
Line 857 pointer bevalf(FUNC f,NODE a) |
|
Line 1167 pointer bevalf(FUNC f,NODE a) |
|
} |
} |
switch ( f->id ) { |
switch ( f->id ) { |
case A_BIN: |
case A_BIN: |
|
current_option = 0; |
if ( !n ) { |
if ( !n ) { |
cur_binf = f; |
cur_binf = f; |
(*f->f.binf)(&val); |
(*f->f.binf)(&val); |
Line 889 pointer bevalf(FUNC f,NODE a) |
|
Line 1200 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)); |
|
f_return = f_break = f_continue = 0; |
if ( f->f.usrf->module ) { |
if ( f->f.usrf->module ) { |
prev_mpvs = MPVS; |
prev_mpvs = MPVS; |
MPVS = f->f.usrf->module->pvs; |
MPVS = f->f.usrf->module->pvs; |
Line 909 pointer bevalf(FUNC f,NODE a) |
|
Line 1221 pointer bevalf(FUNC f,NODE a) |
|
return val; |
return val; |
} |
} |
|
|
pointer evalif(FNODE f,FNODE a) |
pointer bevalf_with_opts(FUNC f,NODE a,NODE opts) |
{ |
{ |
|
pointer val; |
|
int i,n; |
|
NODE tn,sn; |
|
VS pvs,prev_mpvs; |
|
char errbuf[BUFSIZ]; |
|
|
|
if ( f->id == A_UNDEF ) { |
|
sprintf(errbuf,"bevalf : %s undefined",NAME(f)); |
|
error(errbuf); |
|
} |
|
if ( getsecuremode() && !PVSS && !f->secure ) { |
|
sprintf(errbuf,"bevalf : %s not permitted",NAME(f)); |
|
error(errbuf); |
|
} |
|
if ( f->id != A_PARI ) { |
|
for ( i = 0, tn = a; tn; i++, tn = NEXT(tn) ); |
|
if ( ((n = f->argc)>= 0 && i != n) || (n < 0 && i > -n) ) { |
|
sprintf(errbuf,"bevalf : argument mismatch in %s()",NAME(f)); |
|
error(errbuf); |
|
} |
|
} |
|
switch ( f->id ) { |
|
case A_BIN: |
|
current_option = opts; |
|
if ( !n ) { |
|
cur_binf = f; |
|
(*f->f.binf)(&val); |
|
} else { |
|
cur_binf = f; |
|
(*f->f.binf)(a,&val); |
|
} |
|
cur_binf = 0; |
|
break; |
|
case A_PARI: |
|
cur_binf = f; |
|
val = evalparif(f,a); |
|
cur_binf = 0; |
|
break; |
|
case A_USR: |
|
pvs = f->f.usrf->pvs; |
|
if ( PVSS ) |
|
((VS)BDY(PVSS))->at = evalstatline; |
|
MKNODE(tn,pvs,PVSS); PVSS = tn; |
|
CPVS = (VS)ALLOCA(sizeof(struct oVS)); BDY(PVSS) = (pointer)CPVS; |
|
CPVS->usrf = f; CPVS->n = CPVS->asize = pvs->n; |
|
CPVS->opt = opts; |
|
if ( CPVS->n ) { |
|
CPVS->va = (struct oPV *)ALLOCA(CPVS->n*sizeof(struct oPV)); |
|
bcopy((char *)pvs->va,(char *)CPVS->va, |
|
(int)(pvs->n*sizeof(struct oPV))); |
|
} |
|
if ( nextbp ) |
|
nextbplevel++; |
|
for ( tn = f->f.usrf->args, sn = a; |
|
sn; tn = NEXT(tn), sn = NEXT(sn) ) |
|
ASSPV((int)FA0((FNODE)BDY(tn)),BDY(sn)); |
|
f_return = f_break = f_continue = 0; |
|
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(); |
|
break; |
|
case A_PURE: |
|
val = evalpf(f->f.puref,a,0); |
|
break; |
|
default: |
|
sprintf(errbuf,"bevalf : %s undefined",NAME(f)); |
|
error(errbuf); |
|
break; |
|
} |
|
return val; |
|
} |
|
|
|
pointer evalif(FNODE f,FNODE a,FNODE opt) |
|
{ |
Obj g; |
Obj g; |
|
QUOTE q; |
FNODE t; |
FNODE t; |
|
LIST l; |
|
|
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,opt); |
else if ( g && OID(g) == O_QUOTEARG && ((QUOTEARG)g)->type == A_func ) { |
else if ( g && OID(g) == O_QUOTEARG && ((QUOTEARG)g)->type == A_func ) { |
t = mkfnode(2,I_FUNC,((QUOTEARG)g)->body,a); |
t = mkfnode(2,I_FUNC,((QUOTEARG)g)->body,a); |
return eval(t); |
MKQUOTE(q,t); |
|
return q; |
} else { |
} else { |
error("invalid function pointer"); |
error("invalid function pointer"); |
/* NOTREACHED */ |
/* NOTREACHED */ |
Line 930 pointer evalif(FNODE f,FNODE a) |
|
Line 1324 pointer evalif(FNODE f,FNODE a) |
|
pointer evalpf(PF pf,NODE args,NODE dargs) |
pointer evalpf(PF pf,NODE args,NODE dargs) |
{ |
{ |
Obj s,s1; |
Obj s,s1; |
int i; |
int i,di,j; |
NODE node,dnode; |
NODE node,dnode; |
PFINS ins; |
PFINS ins; |
PFAD ad; |
PFAD ad; |
Line 949 pointer evalpf(PF pf,NODE args,NODE dargs) |
|
Line 1343 pointer evalpf(PF pf,NODE args,NODE dargs) |
|
} |
} |
simplify_ins(ins,&s); |
simplify_ins(ins,&s); |
} else { |
} else { |
for ( i = 0, s = pf->body, node = args; |
s = pf->body; |
node; node = NEXT(node), i++ ) { |
if ( dargs ) { |
|
for ( i = 0, dnode = dargs; dnode; dnode = NEXT(dnode), i++ ) { |
|
di = QTOS((Q)dnode->body); |
|
for ( j = 0; j < di; j++ ) { |
|
derivr(CO,s,pf->args[i],&s1); s = s1; |
|
} |
|
} |
|
} |
|
for ( i = 0, node = args; node; node = NEXT(node), i++ ) { |
substr(CO,0,s,pf->args[i],(Obj)node->body,&s1); s = s1; |
substr(CO,0,s,pf->args[i],(Obj)node->body,&s1); s = s1; |
} |
} |
} |
} |
Line 1033 void gen_searchf(char *name,FUNC *r) |
|
Line 1435 void gen_searchf(char *name,FUNC *r) |
|
*r = val; |
*r = val; |
} |
} |
|
|
void gen_searchf_searchonly(char *name,FUNC *r) |
void gen_searchf_searchonly(char *name,FUNC *r,int global) |
{ |
{ |
FUNC val = 0; |
FUNC val = 0; |
int global = 0; |
|
if ( *name == ':' ) { |
if ( *name == ':' ) { |
global = 1; |
global = 1; |
name += 2; |
name += 2; |