version 1.63, 2008/09/01 06:20:33 |
version 1.76, 2017/02/07 08:30:31 |
|
|
* 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.62 2007/12/20 03:31:01 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.75 2016/08/24 08:21:03 ohara Exp $ |
*/ |
*/ |
#include <ctype.h> |
#include <ctype.h> |
#include "ca.h" |
#include "ca.h" |
|
|
#endif |
#endif |
#include <sys/types.h> |
#include <sys/types.h> |
#include <sys/stat.h> |
#include <sys/stat.h> |
#if defined(PARI) |
|
#include "genpari.h" |
|
#endif |
|
|
|
extern JMP_BUF timer_env; |
extern JMP_BUF timer_env; |
extern FUNC cur_binf; |
extern FUNC cur_binf; |
Line 67 extern NODE PVSS; |
|
Line 64 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 show_crossref; |
int show_crossref; |
int at_root; |
int at_root; |
void gen_searchf_searchonly(char *name,FUNC *r); |
void gen_searchf_searchonly(char *name,FUNC *r,int global); |
LIST eval_arg(FNODE a,unsigned int quote); |
LIST eval_arg(FNODE a,unsigned int quote); |
|
|
pointer eval(FNODE f) |
pointer eval(FNODE f) |
Line 95 pointer eval(FNODE f) |
|
Line 91 pointer eval(FNODE f) |
|
RANGE range; |
RANGE range; |
QUOTE expr,pattern; |
QUOTE expr,pattern; |
|
|
#if defined(VISUAL) |
#if defined(VISUAL) || defined(__MINGW32__) |
if ( recv_intr ) { |
check_intr(); |
#include <signal.h> |
|
if ( recv_intr == 1 ) { |
|
recv_intr = 0; |
|
int_handler(SIGINT); |
|
} else { |
|
recv_intr = 0; |
|
ox_usr1_handler(0); |
|
} |
|
} |
|
#endif |
#endif |
if ( !f ) |
if ( !f ) |
return ( 0 ); |
return ( 0 ); |
Line 196 pointer eval(FNODE f) |
|
Line 183 pointer eval(FNODE f) |
|
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),(FNODE)FA2(f)); break; |
val = evalif((FNODE)FA0(f),(FNODE)FA1(f),(FNODE)FA2(f)); break; |
#if !defined(VISUAL) |
#if !defined(VISUAL) && !defined(__MINGW32__) |
case I_TIMER: |
case I_TIMER: |
{ |
{ |
int interval; |
int interval; |
Line 733 pointer evalstat(SNODE f) |
|
Line 720 pointer evalstat(SNODE f) |
|
case S_BP: |
case S_BP: |
if ( !nextbp && (!FA1(f) || eval((FNODE)FA1(f))) ) { |
if ( !nextbp && (!FA1(f) || eval((FNODE)FA1(f))) ) { |
if ( (FNODE)FA2(f) ) { |
if ( (FNODE)FA2(f) ) { |
#if defined(PARI) |
|
pari_outfile = stderr; |
|
#endif |
|
asir_out = stderr; |
asir_out = stderr; |
printexpr(CO,eval((FNODE)FA2(f))); |
printexpr(CO,eval((FNODE)FA2(f))); |
putc('\n',asir_out); fflush(asir_out); |
putc('\n',asir_out); fflush(asir_out); |
#if defined(PARI) |
|
pari_outfile = stdout; |
|
#endif |
|
asir_out = stdout; |
asir_out = stdout; |
} else { |
} else { |
nextbp = 1; nextbplevel = 0; |
nextbp = 1; nextbplevel = 0; |
Line 882 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 863 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 917 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 898 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 935 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 917 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
break; |
break; |
case A_USR: |
case A_USR: |
/* stack check */ |
/* stack check */ |
#if !defined(VISUAL) && !defined(__CYGWIN__) |
#if !defined(VISUAL) && !defined(__MINGW32__) && !defined(__CYGWIN__) |
if ( !stack_size ) { |
if ( !stack_size ) { |
struct rlimit rl; |
struct rlimit rl; |
getrlimit(RLIMIT_STACK,&rl); |
getrlimit(RLIMIT_STACK,&rl); |
Line 943 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 925 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
} |
} |
if ( !stack_base ) { |
if ( !stack_base ) { |
#if defined(GC7) |
#if defined(GC7) |
struct GC_stack_base sb; |
stack_base = (void *)GC_get_main_stack_base(); |
GC_get_stack_base(&sb); |
|
stack_base = (void *)sb.mem_base; |
|
#else |
#else |
stack_base = (void *)GC_get_stack_base(); |
stack_base = (void *)GC_get_stack_base(); |
#endif |
#endif |
Line 989 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 969 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 997 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 978 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 1165 pointer bevalf(FUNC f,NODE a) |
|
Line 1148 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 1197 pointer bevalf(FUNC f,NODE a) |
|
Line 1181 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 1217 pointer bevalf(FUNC f,NODE a) |
|
Line 1202 pointer bevalf(FUNC f,NODE a) |
|
return val; |
return val; |
} |
} |
|
|
|
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) |
pointer evalif(FNODE f,FNODE a,FNODE opt) |
{ |
{ |
Obj g; |
Obj g; |
Line 1261 pointer evalpf(PF pf,NODE args,NODE dargs) |
|
Line 1325 pointer evalpf(PF pf,NODE args,NODE dargs) |
|
simplify_ins(ins,&s); |
simplify_ins(ins,&s); |
} else { |
} else { |
s = pf->body; |
s = pf->body; |
if ( dnode ) { |
if ( dargs ) { |
for ( i = 0, dnode = dargs; dnode; dnode = NEXT(dnode), i++ ) { |
for ( i = 0, dnode = dargs; dnode; dnode = NEXT(dnode), i++ ) { |
di = QTOS((Q)dnode->body); |
di = QTOS((Q)dnode->body); |
for ( j = 0; j < di; j++ ) { |
for ( j = 0; j < di; j++ ) { |
Line 1352 void gen_searchf(char *name,FUNC *r) |
|
Line 1416 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; |
Line 1569 MODULE mkmodule(char *name) |
|
Line 1632 MODULE mkmodule(char *name) |
|
mod->name = (char *)MALLOC_ATOMIC(len+1); |
mod->name = (char *)MALLOC_ATOMIC(len+1); |
strcpy(mod->name,name); |
strcpy(mod->name,name); |
mod->pvs = mpvs = (VS)MALLOC(sizeof(struct oVS)); |
mod->pvs = mpvs = (VS)MALLOC(sizeof(struct oVS)); |
reallocarray((char **)&mpvs->va,(int *)&mpvs->asize, |
asir_reallocarray((char **)&mpvs->va,(int *)&mpvs->asize, |
(int *)&mpvs->n,(int)sizeof(struct oPV)); |
(int *)&mpvs->n,(int)sizeof(struct oPV)); |
mod->usrf_list = 0; |
mod->usrf_list = 0; |
MKNODE(m,mod,MODULE_LIST); |
MKNODE(m,mod,MODULE_LIST); |