version 1.15, 2001/09/20 04:08:21 |
version 1.29, 2003/05/30 00:47:24 |
|
|
* 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.14 2001/09/05 09:01:28 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.28 2003/05/24 10:42:18 noro Exp $ |
*/ |
*/ |
#include <ctype.h> |
#include <ctype.h> |
#include "ca.h" |
#include "ca.h" |
|
|
#include "parse.h" |
#include "parse.h" |
#include <sys/types.h> |
#include <sys/types.h> |
#include <sys/stat.h> |
#include <sys/stat.h> |
#if PARI |
#if defined(PARI) |
#include "genpari.h" |
#include "genpari.h" |
#endif |
#endif |
|
|
extern jmp_buf timer_env; |
extern JMP_BUF timer_env; |
|
|
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; |
|
|
pointer bevalf(), evalmapf(), evall(); |
pointer eval(FNODE f) |
pointer eval_rec_mapf(), beval_rec_mapf(); |
|
Obj getopt_from_cpvs(); |
|
|
|
pointer eval(f) |
|
FNODE f; |
|
{ |
{ |
LIST t; |
LIST t; |
STRING str; |
STRING str; |
|
|
NODE tn,ind; |
NODE tn,ind; |
R u; |
R u; |
DP dp; |
DP dp; |
int pv,c; |
unsigned int pv; |
|
int c; |
FNODE f1; |
FNODE f1; |
UP2 up2; |
UP2 up2; |
UP up; |
UP up; |
|
|
expired = (Obj)eval((FNODE)FA2(f)); |
expired = (Obj)eval((FNODE)FA2(f)); |
set_timer(interval); |
set_timer(interval); |
savepvs(); |
savepvs(); |
if ( !setjmp(timer_env) ) |
if ( !SETJMP(timer_env) ) |
val = eval((FNODE)FA1(f)); |
val = eval((FNODE)FA1(f)); |
else { |
else { |
val = (pointer)expired; |
val = (pointer)expired; |
|
|
case I_PRESELF: |
case I_PRESELF: |
f1 = (FNODE)FA1(f); |
f1 = (FNODE)FA1(f); |
if ( ID(f1) == I_PVAR ) { |
if ( ID(f1) == I_PVAR ) { |
pv = (int)FA0(f1); ind = (NODE)FA1(f1); GETPV(pv,a); |
pv = (unsigned int)FA0(f1); ind = (NODE)FA1(f1); GETPV(pv,a); |
if ( !ind ) { |
if ( !ind ) { |
(*((ARF)FA0(f))->fp)(CO,a,ONE,&val); ASSPV(pv,val); |
(*((ARF)FA0(f))->fp)(CO,a,ONE,&val); ASSPV(pv,val); |
} else if ( a ) { |
} else if ( a ) { |
|
|
case I_POSTSELF: |
case I_POSTSELF: |
f1 = (FNODE)FA1(f); |
f1 = (FNODE)FA1(f); |
if ( ID(f1) == I_PVAR ) { |
if ( ID(f1) == I_PVAR ) { |
pv = (int)FA0(f1); ind = (NODE)FA1(f1); GETPV(pv,val); |
pv = (unsigned int)FA0(f1); ind = (NODE)FA1(f1); GETPV(pv,val); |
if ( !ind ) { |
if ( !ind ) { |
(*((ARF)FA0(f))->fp)(CO,val,ONE,&u); ASSPV(pv,u); |
(*((ARF)FA0(f))->fp)(CO,val,ONE,&u); ASSPV(pv,u); |
} else if ( val ) { |
} else if ( val ) { |
|
|
error("-- : not implemented yet"); |
error("-- : not implemented yet"); |
break; |
break; |
case I_PVAR: |
case I_PVAR: |
pv = (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 { |
|
|
case I_ASSPVAR: |
case I_ASSPVAR: |
f1 = (FNODE)FA0(f); |
f1 = (FNODE)FA0(f); |
if ( ID(f1) == I_PVAR ) { |
if ( ID(f1) == I_PVAR ) { |
pv = (int)FA0(f1); ind = (NODE)FA1(f1); |
pv = (unsigned int)FA0(f1); ind = (NODE)FA1(f1); |
if ( !ind ) { |
if ( !ind ) { |
val = eval((FNODE)FA1(f)); ASSPV(pv,val); |
val = eval((FNODE)FA1(f)); ASSPV(pv,val); |
} else { |
} else { |
|
|
return ( val ); |
return ( val ); |
} |
} |
|
|
pointer evalstat(f) |
pointer evalstat(SNODE f) |
SNODE f; |
|
{ |
{ |
pointer val = 0,t,s,s1; |
pointer val = 0,t,s,s1; |
P u; |
P u; |
|
|
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 PARI |
#if defined(PARI) |
pari_outfile = stderr; |
pari_outfile = stderr; |
#endif |
#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 PARI |
#if defined(PARI) |
pari_outfile = stdout; |
pari_outfile = stdout; |
#endif |
#endif |
asir_out = stdout; |
asir_out = stdout; |
|
|
return ( val ); |
return ( val ); |
} |
} |
|
|
pointer evalnode(node) |
pointer evalnode(NODE node) |
NODE node; |
|
{ |
{ |
NODE tn; |
NODE tn; |
pointer val; |
pointer val; |
|
|
extern FUNC cur_binf; |
extern FUNC cur_binf; |
extern NODE PVSS; |
extern NODE PVSS; |
|
|
pointer evalf(f,a,opt) |
pointer evalf(FUNC f,FNODE a,FNODE opt) |
FUNC f; |
|
FNODE a; |
|
FNODE opt; |
|
{ |
{ |
LIST args; |
LIST args; |
pointer val; |
pointer val; |
int i,n,level; |
int i,n,level; |
NODE tn,sn,opts,opt1; |
NODE tn,sn,opts,opt1; |
VS pvs; |
VS pvs,prev_mpvs; |
char errbuf[BUFSIZ]; |
char errbuf[BUFSIZ]; |
static int stack_size; |
static unsigned int stack_size; |
static void *stack_base; |
static void *stack_base; |
|
|
if ( f->id == A_UNDEF ) { |
if ( f->id == A_UNDEF ) { |
|
|
break; |
break; |
case A_USR: |
case A_USR: |
/* stack check */ |
/* stack check */ |
#if !defined(VISUAL) |
#if !defined(VISUAL) && !defined(__CYGWIN__) |
if ( !stack_size ) { |
if ( !stack_size ) { |
struct rlimit rl; |
struct rlimit rl; |
getrlimit(RLIMIT_STACK,&rl); |
getrlimit(RLIMIT_STACK,&rl); |
|
|
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)); |
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: |
|
|
return val; |
return val; |
} |
} |
|
|
pointer evalmapf(f,a) |
pointer evalmapf(FUNC f,FNODE a) |
FUNC f; |
|
FNODE a; |
|
{ |
{ |
LIST args; |
LIST args; |
NODE node,rest,t,n,r,r0; |
NODE node,rest,t,n,r,r0; |
|
|
return val; |
return val; |
} |
} |
|
|
pointer eval_rec_mapf(f,a) |
pointer eval_rec_mapf(FUNC f,FNODE a) |
FUNC f; |
|
FNODE a; |
|
{ |
{ |
LIST args; |
LIST args; |
|
|
|
|
return beval_rec_mapf(f,BDY(args)); |
return beval_rec_mapf(f,BDY(args)); |
} |
} |
|
|
pointer beval_rec_mapf(f,node) |
pointer beval_rec_mapf(FUNC f,NODE node) |
FUNC f; |
|
NODE node; |
|
{ |
{ |
LIST args; |
|
NODE rest,t,n,r,r0; |
NODE rest,t,n,r,r0; |
Obj head; |
Obj head; |
VECT v,rv; |
VECT v,rv; |
|
|
return val; |
return val; |
} |
} |
|
|
pointer bevalf(f,a) |
pointer bevalf(FUNC f,NODE a) |
FUNC f; |
|
NODE a; |
|
{ |
{ |
pointer val; |
pointer val; |
int i,n; |
int i,n; |
NODE tn,sn; |
NODE tn,sn; |
VS pvs; |
VS pvs; |
struct oLIST list; |
|
struct oFNODE fnode; |
|
char errbuf[BUFSIZ]; |
char errbuf[BUFSIZ]; |
|
|
if ( f->id == A_UNDEF ) { |
if ( f->id == A_UNDEF ) { |
|
|
return val; |
return val; |
} |
} |
|
|
pointer evalif(f,a) |
pointer evalif(FNODE f,FNODE a) |
FNODE f,a; |
|
{ |
{ |
Obj g; |
Obj g; |
|
|
|
|
return evalf((FUNC)VR((P)g)->priv,a,0); |
return evalf((FUNC)VR((P)g)->priv,a,0); |
else { |
else { |
error("invalid function pointer"); |
error("invalid function pointer"); |
|
/* NOTREACHED */ |
|
return (pointer)-1; |
} |
} |
} |
} |
|
|
pointer evalpf(pf,args) |
pointer evalpf(PF pf,NODE args) |
PF pf; |
|
NODE args; |
|
{ |
{ |
Obj s,s1; |
Obj s,s1; |
int i; |
int i; |
NODE node; |
NODE node; |
PFINS ins; |
PFINS ins; |
PFAD ad; |
PFAD ad; |
char errbuf[BUFSIZ]; |
|
|
|
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)); |
|
|
return (pointer)s; |
return (pointer)s; |
} |
} |
|
|
void evalnodebody(sn,dnp) |
void evalnodebody(NODE sn,NODE *dnp) |
NODE sn; |
|
NODE *dnp; |
|
{ |
{ |
NODE n,n0,tn; |
NODE n,n0,tn; |
int line; |
int line; |
|
|
NEXT(n) = 0; *dnp = n0; |
NEXT(n) = 0; *dnp = n0; |
} |
} |
|
|
void gen_searchf(name,r) |
MODULE searchmodule(char *name) |
char *name; |
|
FUNC *r; |
|
{ |
{ |
FUNC val; |
MODULE mod; |
|
NODE m; |
|
|
searchf(sysf,name,&val); |
for ( m = MODULE_LIST; m; m = NEXT(m) ) { |
|
mod = (MODULE)BDY(m); |
|
if ( !strcmp(mod->name,name) ) |
|
return mod; |
|
} |
|
return 0; |
|
} |
|
/* |
|
* xxx.yyy() is searched in the flist |
|
* of the module xxx. |
|
* yyy() is searched in the global flist. |
|
*/ |
|
|
|
void searchuf(char *name,FUNC *r) |
|
{ |
|
MODULE mod; |
|
char *name0,*dot; |
|
|
|
if ( dot = strchr(name,'.') ) { |
|
name0 = (char *)ALLOCA(strlen(name)+1); |
|
strcpy(name0,name); |
|
dot = strchr(name0,'.'); |
|
*dot = 0; |
|
mod = searchmodule(name0); |
|
if ( mod ) |
|
searchf(mod->usrf_list,dot+1,r); |
|
} else |
|
searchf(usrf,name,r); |
|
} |
|
|
|
void gen_searchf(char *name,FUNC *r) |
|
{ |
|
FUNC val = 0; |
|
int global = 0; |
|
if ( *name == ':' ) { |
|
global = 1; |
|
name += 2; |
|
} |
|
if ( CUR_MODULE && !global ) |
|
searchf(CUR_MODULE->usrf_list,name,&val); |
if ( !val ) |
if ( !val ) |
|
searchf(sysf,name,&val); |
|
if ( !val ) |
searchf(ubinf,name,&val); |
searchf(ubinf,name,&val); |
if ( !val ) |
if ( !val ) |
searchpf(name,&val); |
searchpf(name,&val); |
if ( !val ) |
if ( !val ) |
searchf(usrf,name,&val); |
searchuf(name,&val); |
if ( !val ) |
if ( !val ) |
appenduf(name,&val); |
appenduf(name,&val); |
*r = val; |
*r = val; |
} |
} |
|
|
void searchf(fn,name,r) |
void searchf(NODE fn,char *name,FUNC *r) |
NODE fn; |
|
char *name; |
|
FUNC *r; |
|
{ |
{ |
NODE tn; |
NODE tn; |
|
|
|
|
*r = 0; |
*r = 0; |
} |
} |
|
|
void appenduf(name,r) |
MODULE mkmodule(char *); |
char *name; |
|
FUNC *r; |
void appenduf(char *name,FUNC *r) |
{ |
{ |
NODE tn; |
NODE tn; |
FUNC f; |
FUNC f; |
|
int len; |
|
MODULE mod; |
|
char *modname,*fname,*dot; |
|
|
f=(FUNC)MALLOC(sizeof(struct oFUNC)); |
f=(FUNC)MALLOC(sizeof(struct oFUNC)); |
f->name = name; f->id = A_UNDEF; f->argc = 0; f->f.binf = 0; |
f->id = A_UNDEF; f->argc = 0; f->f.binf = 0; |
MKNODE(tn,f,usrf); usrf = tn; |
if ( dot = strchr(name,'.') ) { |
|
/* undefined function in a module */ |
|
len = dot-name; |
|
modname = (char *)MALLOC_ATOMIC(len+1); |
|
strncpy(modname,name,len); modname[len] = 0; |
|
fname = (char *)MALLOC_ATOMIC(strlen(name)-len+1); |
|
strcpy(fname,dot+1); |
|
f->name = fname; |
|
f->fullname = name; |
|
mod = searchmodule(modname); |
|
if ( !mod ) |
|
mod = mkmodule(modname); |
|
MKNODE(tn,f,mod->usrf_list); mod->usrf_list = tn; |
|
} else { |
|
f->name = name; |
|
f->fullname = name; |
|
MKNODE(tn,f,usrf); usrf = tn; |
|
} |
*r = f; |
*r = f; |
} |
} |
|
|
void mkparif(name,r) |
void appenduf_local(char *name,FUNC *r) |
char *name; |
|
FUNC *r; |
|
{ |
{ |
|
NODE tn; |
FUNC f; |
FUNC f; |
|
MODULE mod; |
|
|
|
for ( tn = CUR_MODULE->usrf_list; tn; tn = NEXT(tn) ) |
|
if ( !strcmp(((FUNC)BDY(tn))->name,name) ) |
|
break; |
|
if ( tn ) |
|
return; |
|
|
|
f=(FUNC)MALLOC(sizeof(struct oFUNC)); |
|
f->id = A_UNDEF; f->argc = 0; f->f.binf = 0; |
|
f->name = name; |
|
f->fullname = |
|
(char *)MALLOC_ATOMIC(strlen(CUR_MODULE->name)+strlen(name)+1); |
|
sprintf(f->fullname,"%s.%s",CUR_MODULE->name,name); |
|
MKNODE(tn,f,CUR_MODULE->usrf_list); CUR_MODULE->usrf_list = tn; |
|
*r = f; |
|
} |
|
|
|
void appenduflist(NODE n) |
|
{ |
|
NODE tn; |
|
FUNC f; |
|
|
|
for ( tn = n; tn; tn = NEXT(tn) ) |
|
appenduf_local((char *)BDY(tn),&f); |
|
} |
|
|
|
void mkparif(char *name,FUNC *r) |
|
{ |
|
FUNC f; |
|
|
*r = f =(FUNC)MALLOC(sizeof(struct oFUNC)); |
*r = f =(FUNC)MALLOC(sizeof(struct oFUNC)); |
f->name = name; f->id = A_PARI; f->argc = 0; f->f.binf = 0; |
f->name = name; f->id = A_PARI; f->argc = 0; f->f.binf = 0; |
|
f->fullname = name; |
} |
} |
|
|
void mkuf(name,fname,args,body,startl,endl,desc) |
void mkuf(char *name,char *fname,NODE args,SNODE body,int startl,int endl,char *desc,MODULE module) |
char *name,*fname; |
|
NODE args; |
|
SNODE body; |
|
int startl,endl; |
|
char *desc; |
|
{ |
{ |
FUNC f; |
FUNC f; |
USRF t; |
USRF t; |
NODE sn,tn; |
NODE usrf_list,sn,tn; |
FNODE fn; |
FNODE fn; |
|
char *longname; |
int argc; |
int argc; |
|
|
searchf(sysf,name,&f); |
if ( *name == ':' ) |
if ( f ) { |
name += 2; |
fprintf(stderr,"def : builtin function %s() cannot be redefined.\n",name); |
if ( !module ) { |
CPVS = GPVS; return; |
searchf(sysf,name,&f); |
|
if ( f ) { |
|
fprintf(stderr,"def : builtin function %s() cannot be redefined.\n",name); |
|
CPVS = GPVS; return; |
|
} |
} |
} |
for ( argc = 0, sn = args; sn; argc++, sn = NEXT(sn) ) { |
for ( argc = 0, sn = args; sn; argc++, sn = NEXT(sn) ) { |
fn = (FNODE)BDY(sn); |
fn = (FNODE)BDY(sn); |
|
|
CPVS = GPVS; return; |
CPVS = GPVS; return; |
} |
} |
} |
} |
for ( sn = usrf; sn && strcmp(NAME((FUNC)BDY(sn)),name); sn = NEXT(sn) ); |
usrf_list = module ? module->usrf_list : usrf; |
|
for ( sn = usrf_list; sn && strcmp(NAME((FUNC)BDY(sn)),name); sn = NEXT(sn) ); |
if ( sn ) |
if ( sn ) |
f = (FUNC)BDY(sn); |
f = (FUNC)BDY(sn); |
else { |
else { |
f=(FUNC)MALLOC(sizeof(struct oFUNC)); |
f=(FUNC)MALLOC(sizeof(struct oFUNC)); |
f->name = name; |
f->name = name; |
MKNODE(tn,f,usrf); usrf = tn; |
MKNODE(tn,f,usrf_list); usrf_list = tn; |
|
if ( module ) { |
|
f->fullname = |
|
(char *)MALLOC_ATOMIC(strlen(f->name)+strlen(module->name)+1); |
|
sprintf(f->fullname,"%s.%s",module->name,f->name); |
|
module->usrf_list = usrf_list; |
|
} else { |
|
f->fullname = f->name; |
|
usrf = usrf_list; |
|
} |
} |
} |
if ( Verbose && f->id != A_UNDEF ) |
if ( Verbose && f->id != A_UNDEF ) { |
fprintf(stderr,"Warning : %s() redefined.\n",name); |
if ( module ) |
/* else |
fprintf(stderr,"Warning : %s.%s() redefined.\n",module->name,name); |
fprintf(stderr,"%s() defined.\n",name); */ |
else |
|
fprintf(stderr,"Warning : %s() redefined.\n",name); |
|
} |
t=(USRF)MALLOC(sizeof(struct oUSRF)); |
t=(USRF)MALLOC(sizeof(struct oUSRF)); |
t->args=args; BDY(t)=body; t->pvs = CPVS; t->fname = fname; |
t->args=args; BDY(t)=body; t->pvs = CPVS; t->fname = fname; |
t->startl = startl; t->endl = endl; t->vol = asir_infile->vol; |
t->startl = startl; t->endl = endl; t->module = module; |
t->desc = desc; |
t->desc = desc; |
f->id = A_USR; f->argc = argc; f->f.usrf = t; |
f->id = A_USR; f->argc = argc; f->f.usrf = t; |
CPVS = GPVS; |
CPVS = GPVS; |
|
CUR_FUNC = 0; |
clearbp(f); |
clearbp(f); |
} |
} |
|
|
|
|
CVS->opt = BDY([[key,value],[key,value],...]) |
CVS->opt = BDY([[key,value],[key,value],...]) |
*/ |
*/ |
|
|
Obj getopt_from_cpvs(key) |
Obj getopt_from_cpvs(char *key) |
char *key; |
|
{ |
{ |
NODE opts,opt; |
NODE opts,opt; |
Obj value; |
|
LIST r; |
LIST r; |
extern Obj VOIDobj; |
extern Obj VOIDobj; |
|
|
|
|
return VOIDobj; |
return VOIDobj; |
} |
} |
|
|
|
} |
|
|
|
MODULE mkmodule(char *name) |
|
{ |
|
MODULE mod; |
|
NODE m; |
|
int len; |
|
VS mpvs; |
|
|
|
for ( m = MODULE_LIST; m; m = NEXT(m) ) { |
|
mod = (MODULE)m->body; |
|
if ( !strcmp(mod->name,name) ) |
|
break; |
|
} |
|
if ( m ) |
|
return mod; |
|
else { |
|
mod = (MODULE)MALLOC(sizeof(struct oMODULE)); |
|
len = strlen(name); |
|
mod->name = (char *)MALLOC_ATOMIC(len+1); |
|
strcpy(mod->name,name); |
|
mod->pvs = mpvs = (VS)MALLOC(sizeof(struct oVS)); |
|
reallocarray((char **)&mpvs->va,(int *)&mpvs->asize, |
|
(int *)&mpvs->n,(int)sizeof(struct oPV)); |
|
mod->usrf_list = 0; |
|
MKNODE(m,mod,MODULE_LIST); |
|
MODULE_LIST = m; |
|
return mod; |
|
} |
|
} |
|
|
|
void print_crossref(FUNC f) |
|
{ |
|
FUNC r; |
|
if ( show_crossref && CUR_FUNC ) { |
|
searchuf(f->fullname,&r); |
|
if (r != NULL) { |
|
fprintf(asir_out,"%s() at line %d in %s()\n", |
|
f->fullname, asir_infile->ln, CUR_FUNC); |
|
} |
|
} |
} |
} |