version 1.24, 2003/05/16 07:56:16 |
version 1.31, 2004/02/09 08:23:30 |
|
|
* 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.23 2003/05/14 09:18:38 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.30 2003/11/08 01:12:03 noro Exp $ |
*/ |
*/ |
#include <ctype.h> |
#include <ctype.h> |
#include "ca.h" |
#include "ca.h" |
Line 84 pointer eval(FNODE f) |
|
Line 84 pointer eval(FNODE f) |
|
GF2N gf2n; |
GF2N gf2n; |
GFPN gfpn; |
GFPN gfpn; |
GFSN gfsn; |
GFSN gfsn; |
|
RANGE range; |
|
|
#if defined(VISUAL) |
#if defined(VISUAL) |
if ( recv_intr ) { |
if ( recv_intr ) { |
Line 453 extern NODE PVSS; |
|
Line 454 extern NODE PVSS; |
|
pointer evalf(FUNC f,FNODE a,FNODE opt) |
pointer evalf(FUNC f,FNODE a,FNODE opt) |
{ |
{ |
LIST args; |
LIST args; |
|
OPTLIST optlist; |
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 474 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 476 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); |
|
if ( opts ) { |
|
NEWOPTLIST(optlist); |
|
BDY(optlist) = opts; |
|
appendtonode(BDY(args),(pointer)optlist,&dmy); |
|
} |
cur_binf = f; |
cur_binf = f; |
(*f->f.binf)(args?BDY(args):0,&val); |
(*f->f.binf)(args?BDY(args):0,&val); |
} |
} |
Line 827 void searchuf(char *name,FUNC *r) |
|
Line 848 void searchuf(char *name,FUNC *r) |
|
searchf(usrf,name,r); |
searchf(usrf,name,r); |
} |
} |
|
|
/* |
|
* xxx.yyy() is searched in the flist |
|
* of the module xxx. |
|
* yyy() is searched in the current flist |
|
* and proto list. |
|
*/ |
|
|
|
void searchuf_proto(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 if ( CUR_MODULE ) |
|
searchf(CUR_MODULE->proto_list,name,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 == ':' ) { |
searchf(CUR_MODULE->usrf_list,name,&val); |
global = 1; |
if ( !val ) |
name += 2; |
searchf(sysf,name,&val); |
|
if ( !val ) |
|
searchf(ubinf,name,&val); |
|
if ( !val ) |
|
searchpf(name,&val); |
|
if ( !val ) |
|
searchuf_proto(name,&val); |
|
if ( !val ) |
|
appenduf(name,&val); |
|
} else { |
|
if ( !val ) |
|
searchf(sysf,name,&val); |
|
if ( !val ) |
|
searchf(ubinf,name,&val); |
|
if ( !val ) |
|
searchpf(name,&val); |
|
if ( !val ) |
|
searchuf(name,&val); |
|
if ( !val ) |
|
appenduf(name,&val); |
|
} |
} |
|
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); |
|
if ( !val ) |
|
appenduf(name,&val); |
*r = val; |
*r = val; |
} |
} |
|
|
Line 908 void appenduf(char *name,FUNC *r) |
|
Line 897 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_global(char *name,FUNC *r) |
void appenduf_local(char *name,FUNC *r) |
{ |
{ |
NODE tn; |
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=(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; |
f->name = name; |
f->name = name; |
MKNODE(tn,f,usrf); usrf = tn; |
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; |
*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 957 void mkuf(char *name,char *fname,NODE args,SNODE body, |
|
Line 966 void mkuf(char *name,char *fname,NODE args,SNODE body, |
|
char *longname; |
char *longname; |
int argc; |
int argc; |
|
|
|
if ( *name == ':' ) |
|
name += 2; |
if ( !module ) { |
if ( !module ) { |
searchf(sysf,name,&f); |
searchf(sysf,name,&f); |
if ( f ) { |
if ( f ) { |
Line 979 void mkuf(char *name,char *fname,NODE args,SNODE body, |
|
Line 990 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 1057 MODULE mkmodule(char *name) |
|
Line 1073 MODULE mkmodule(char *name) |
|
} |
} |
} |
} |
|
|
/* register function names to the proto list of a module */ |
|
|
|
void register_proto(NODE n) |
|
{ |
|
NODE tn,flist; |
|
char *name; |
|
FUNC val; |
|
|
|
if ( !CUR_MODULE ) |
|
error("globalf : must be declared in a module."); |
|
for ( tn = n; tn; tn = NEXT(tn) ) { |
|
name = (char *)BDY(tn); |
|
searchf(sysf,name,&val); |
|
if ( val ) { |
|
fprintf(stderr,"globalf : `%s' is a builtin function.",name); |
|
error(""); |
|
} |
|
searchf(ubinf,name,&val); |
|
if ( val ) { |
|
fprintf(stderr, |
|
"globalf : `%s' is a user-defined builtin function.",name); |
|
error(""); |
|
} |
|
searchpf(name,&val); |
|
if ( val ) { |
|
fprintf(stderr,"globalf : `%s' is a pure function.",name); |
|
error(""); |
|
} |
|
searchf(usrf,name,&val); |
|
if ( !val ) |
|
appenduf_global(name,&val); |
|
MKNODE(flist,val,CUR_MODULE->proto_list); |
|
CUR_MODULE->proto_list = flist; |
|
} |
|
} |
|
|
|
void print_crossref(FUNC f) |
void print_crossref(FUNC f) |
{ |
{ |
if ( show_crossref && CUR_FUNC ) |
FUNC r; |
fprintf(asir_out,"%s() at line %d in %s()\n", |
if ( show_crossref && CUR_FUNC ) { |
f->name, asir_infile->ln, 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); |
|
} |
|
} |
} |
} |