version 1.22, 2003/05/14 07:08:48 |
version 1.41, 2005/09/13 06:40:46 |
|
|
* 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.21 2003/05/14 06:20:12 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.40 2005/07/27 04:35:11 noro Exp $ |
*/ |
*/ |
#include <ctype.h> |
#include <ctype.h> |
#include "ca.h" |
#include "ca.h" |
Line 63 extern JMP_BUF timer_env; |
|
Line 63 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 eval(FNODE f) |
pointer eval(FNODE f) |
{ |
{ |
Line 70 pointer eval(FNODE f) |
|
Line 71 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 83 pointer eval(FNODE f) |
|
Line 84 pointer eval(FNODE f) |
|
GF2N gf2n; |
GF2N gf2n; |
GFPN gfpn; |
GFPN gfpn; |
GFSN gfsn; |
GFSN gfsn; |
|
RANGE range; |
|
QUOTE expr,pattern; |
|
|
#if defined(VISUAL) |
#if defined(VISUAL) |
if ( recv_intr ) { |
if ( recv_intr ) { |
Line 171 pointer eval(FNODE f) |
|
Line 174 pointer eval(FNODE f) |
|
val = evalmapf((FUNC)FA0(f),(FNODE)FA1(f)); break; |
val = evalmapf((FUNC)FA0(f),(FNODE)FA1(f)); break; |
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_UNIFY: |
|
MKQUOTE(expr,(FNODE)FA0(f)); |
|
MKQUOTE(pattern,(FNODE)FA1(f)); |
|
ret = quote_unify(expr,pattern,&match); |
|
if ( !ret ) val = 0; |
|
else { |
|
do_assign(match); |
|
val = (pointer)ONE; |
|
} |
|
break; |
case I_IFUNC: |
case I_IFUNC: |
val = evalif((FNODE)FA0(f),(FNODE)FA1(f)); break; |
val = evalif((FNODE)FA0(f),(FNODE)FA1(f)); break; |
#if !defined(VISUAL) |
#if !defined(VISUAL) |
Line 221 pointer eval(FNODE f) |
|
Line 234 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 304 pointer eval(FNODE f) |
|
Line 319 pointer eval(FNODE f) |
|
MKLIST(t,NEXT(BDY((LIST)a))); val = (pointer)t; |
MKLIST(t,NEXT(BDY((LIST)a))); val = (pointer)t; |
} |
} |
break; |
break; |
case I_PROC: |
|
val = (pointer)FA0(f); break; |
|
case I_INDEX: |
case I_INDEX: |
a = eval((FNODE)FA0(f)); ind = (NODE)FA1(f); |
a = eval((FNODE)FA0(f)); ind = (NODE)FA1(f); |
evalnodebody(ind,&tn); getarray(a,tn,&val); |
evalnodebody(ind,&tn); getarray(a,tn,&val); |
Line 428 pointer evalstat(SNODE f) |
|
Line 441 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 454 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 474 pointer evalf(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,dmy; |
VS pvs,prev_mpvs; |
VS pvs,prev_mpvs; |
char errbuf[BUFSIZ]; |
char errbuf[BUFSIZ]; |
static unsigned int stack_size; |
static unsigned int stack_size; |
static void *stack_base; |
static void *stack_base; |
Line 464 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 484 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
sprintf(errbuf,"evalf : %s undefined",NAME(f)); |
sprintf(errbuf,"evalf : %s undefined",NAME(f)); |
error(errbuf); |
error(errbuf); |
} |
} |
|
if ( getsecuremode() && !PVSS && !f->secure ) { |
|
sprintf(errbuf,"evalf : %s not permitted",NAME(f)); |
|
error(errbuf); |
|
} |
if ( f->id != A_PARI ) { |
if ( f->id != A_PARI ) { |
for ( i = 0, tn = a?(NODE)FA0(a):0; tn; i++, tn = NEXT(tn) ); |
for ( i = 0, tn = a?(NODE)FA0(a):0; 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 473 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 497 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
} |
} |
switch ( f->id ) { |
switch ( f->id ) { |
case A_BIN: |
case A_BIN: |
|
if ( opt ) { |
|
opts = BDY((LIST)eval(opt)); |
|
/* opts = ["opt1",arg1],... */ |
|
opt1 = BDY((LIST)BDY(opts)); |
|
if ( !strcmp(BDY((STRING)BDY(opt1)),"option_list") ) { |
|
/* |
|
* the special option specification: |
|
* option_list=[["o1","a1"],...] |
|
*/ |
|
asir_assert(BDY(NEXT(opt1)),O_LIST,"evalf"); |
|
opts = BDY((LIST)BDY(NEXT(opt1))); |
|
} |
|
} else |
|
opts = 0; |
if ( !n ) { |
if ( !n ) { |
cur_binf = f; |
cur_binf = f; |
(*f->f.binf)(&val); |
(*f->f.binf)(&val); |
} else { |
} else { |
args = (LIST)eval(a); |
args = (LIST)eval(a); |
|
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 672 pointer bevalf(FUNC f,NODE a) |
|
Line 711 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 720 pointer bevalf(FUNC f,NODE a) |
|
Line 763 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: |
Line 737 pointer bevalf(FUNC f,NODE a) |
|
Line 786 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; |
Line 803 MODULE searchmodule(char *name) |
|
Line 856 MODULE searchmodule(char *name) |
|
} |
} |
return 0; |
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) |
void searchuf(char *name,FUNC *r) |
{ |
{ |
Line 824 void searchuf(char *name,FUNC *r) |
|
Line 882 void searchuf(char *name,FUNC *r) |
|
void gen_searchf(char *name,FUNC *r) |
void gen_searchf(char *name,FUNC *r) |
{ |
{ |
FUNC val = 0; |
FUNC val = 0; |
|
int global = 0; |
if ( CUR_MODULE ) |
if ( *name == ':' ) { |
|
global = 1; |
|
name += 2; |
|
} |
|
if ( CUR_MODULE && !global ) |
searchf(CUR_MODULE->usrf_list,name,&val); |
searchf(CUR_MODULE->usrf_list,name,&val); |
if ( !val ) |
if ( !val ) |
searchf(sysf,name,&val); |
searchf(sysf,name,&val); |
Line 840 void gen_searchf(char *name,FUNC *r) |
|
Line 902 void gen_searchf(char *name,FUNC *r) |
|
*r = val; |
*r = val; |
} |
} |
|
|
|
void gen_searchf_searchonly(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 ) |
|
searchf(sysf,name,&val); |
|
if ( !val ) |
|
searchf(ubinf,name,&val); |
|
if ( !val ) |
|
searchpf(name,&val); |
|
if ( !val ) |
|
searchuf(name,&val); |
|
*r = val; |
|
} |
|
|
void searchf(NODE fn,char *name,FUNC *r) |
void searchf(NODE fn,char *name,FUNC *r) |
{ |
{ |
NODE tn; |
NODE tn; |
Line 866 void appenduf(char *name,FUNC *r) |
|
Line 949 void appenduf(char *name,FUNC *r) |
|
f=(FUNC)MALLOC(sizeof(struct oFUNC)); |
f=(FUNC)MALLOC(sizeof(struct oFUNC)); |
f->id = A_UNDEF; f->argc = 0; f->f.binf = 0; |
f->id = A_UNDEF; f->argc = 0; f->f.binf = 0; |
if ( dot = strchr(name,'.') ) { |
if ( dot = strchr(name,'.') ) { |
/* undefined function in undefined module */ |
/* undefined function in a module */ |
len = dot-name; |
len = dot-name; |
modname = (char *)MALLOC_ATOMIC(len+1); |
modname = (char *)MALLOC_ATOMIC(len+1); |
strncpy(modname,name,len); modname[len] = 0; |
strncpy(modname,name,len); modname[len] = 0; |
mod = mkmodule(modname); |
|
fname = (char *)MALLOC_ATOMIC(strlen(name)-len+1); |
fname = (char *)MALLOC_ATOMIC(strlen(name)-len+1); |
strcpy(fname,dot+1); |
strcpy(fname,dot+1); |
f->name = fname; |
f->name = fname; |
MKNODE(mod->usrf_list,f,0); |
f->fullname = name; |
|
mod = searchmodule(modname); |
|
if ( !mod ) |
|
mod = mkmodule(modname); |
|
MKNODE(tn,f,mod->usrf_list); mod->usrf_list = tn; |
} else { |
} else { |
f->name = name; |
f->name = name; |
if ( CUR_MODULE ) { |
f->fullname = name; |
MKNODE(tn,f,CUR_MODULE->usrf_list); CUR_MODULE->usrf_list = tn; |
MKNODE(tn,f,usrf); usrf = tn; |
} else { |
|
MKNODE(tn,f,usrf); usrf = tn; |
|
} |
|
} |
} |
*r = f; |
*r = f; |
} |
} |
|
|
|
void appenduf_local(char *name,FUNC *r) |
|
{ |
|
NODE tn; |
|
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) |
void mkparif(char *name,FUNC *r) |
{ |
{ |
FUNC f; |
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(char *name,char *fname,NODE args,SNODE body,int startl,int endl,char *desc,MODULE module) |
void mkuf(char *name,char *fname,NODE args,SNODE body,int startl,int endl,char *desc,MODULE module) |
Line 903 void mkuf(char *name,char *fname,NODE args,SNODE body, |
|
Line 1018 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 == ':' ) |
|
name += 2; |
if ( !module ) { |
if ( !module ) { |
searchf(sysf,name,&f); |
searchf(sysf,name,&f); |
if ( f ) { |
if ( f ) { |
Line 925 void mkuf(char *name,char *fname,NODE args,SNODE body, |
|
Line 1045 void mkuf(char *name,char *fname,NODE args,SNODE body, |
|
f=(FUNC)MALLOC(sizeof(struct oFUNC)); |
f=(FUNC)MALLOC(sizeof(struct oFUNC)); |
f->name = name; |
f->name = name; |
MKNODE(tn,f,usrf_list); usrf_list = tn; |
MKNODE(tn,f,usrf_list); usrf_list = tn; |
if ( module ) |
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; |
module->usrf_list = usrf_list; |
else |
} else { |
|
f->fullname = f->name; |
usrf = usrf_list; |
usrf = usrf_list; |
|
} |
} |
} |
if ( Verbose && f->id != A_UNDEF ) { |
if ( Verbose && f->id != A_UNDEF ) { |
if ( module ) |
if ( module ) |
Line 942 void mkuf(char *name,char *fname,NODE args,SNODE body, |
|
Line 1067 void mkuf(char *name,char *fname,NODE args,SNODE body, |
|
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); |
} |
} |
|
|
Line 973 Obj getopt_from_cpvs(char *key) |
|
Line 1099 Obj getopt_from_cpvs(char *key) |
|
|
|
} |
} |
|
|
extern NODE MODULE_LIST; |
|
|
|
MODULE mkmodule(char *name) |
MODULE mkmodule(char *name) |
{ |
{ |
MODULE mod; |
MODULE mod; |
Line 1002 MODULE mkmodule(char *name) |
|
Line 1126 MODULE mkmodule(char *name) |
|
MODULE_LIST = m; |
MODULE_LIST = m; |
return mod; |
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); |
|
} |
|
} |
} |
} |