OpenXM_contrib2/asir2000/parse/eval.c - diff

Return to eval.c CVS log

Up to [local] / OpenXM_contrib2 / asir2000 / parse

Diff for /OpenXM_contrib2/asir2000/parse/eval.c between version 1.18 and 1.37

version 1.18, 2001/12/25 02:39:06

version 1.37, 2004/11/22 02:26:56

Line 45

* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,

* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.

* $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.17 2001/12/21 08:23:15 noro Exp $

* $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.36 2004/10/27 08:21:47 noro Exp $

#include <ctype.h>

#include "ca.h"

Line 54

#include "parse.h"

#include <sys/types.h>

#include <sys/stat.h>

#if PARI

#if defined(PARI)

#include "genpari.h"

#endif

Line 63 extern JMP_BUF timer_env;

int f_break,f_return,f_continue;

int evalstatline;

int recv_intr;

int show_crossref;

pointer eval(FNODE f)

{

Line 73 pointer eval(FNODE f)

Line 74 pointer eval(FNODE f)

NODE tn,ind;

R u;

DP dp;

int pv,c;

unsigned int pv;

int c;

FNODE f1;

UP2 up2;

UP up;

Line 82 pointer eval(FNODE f)

Line 84 pointer eval(FNODE f)

GF2N gf2n;

GFPN gfpn;

GFSN gfsn;

RANGE range;

#if defined(VISUAL)

if ( recv_intr ) {

Line 195 pointer eval(FNODE f)

Line 198 pointer eval(FNODE f)

case I_PRESELF:

f1 = (FNODE)FA1(f);

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 ) {

(*((ARF)FA0(f))->fp)(CO,a,ONE,&val); ASSPV(pv,val);

} else if ( a ) {

Line 208 pointer eval(FNODE f)

Line 211 pointer eval(FNODE f)

case I_POSTSELF:

f1 = (FNODE)FA1(f);

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 ) {

(*((ARF)FA0(f))->fp)(CO,val,ONE,&u); ASSPV(pv,u);

} else if ( val ) {

Line 220 pointer eval(FNODE f)

Line 223 pointer eval(FNODE f)

error("-- : not implemented yet");

break;

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 )

val = a;

else {

Line 230 pointer eval(FNODE f)

Line 233 pointer eval(FNODE f)

case I_ASSPVAR:

f1 = (FNODE)FA0(f);

if ( ID(f1) == I_PVAR ) {

pv = (int)FA0(f1); ind = (NODE)FA1(f1);

pv = (unsigned int)FA0(f1); ind = (NODE)FA1(f1);

if ( !ind ) {

val = eval((FNODE)FA1(f)); ASSPV(pv,val);

} else {

Line 303 pointer eval(FNODE f)

Line 306 pointer eval(FNODE f)

MKLIST(t,NEXT(BDY((LIST)a))); val = (pointer)t;

}

break;

case I_PROC:

val = (pointer)FA0(f); break;

case I_INDEX:

a = eval((FNODE)FA0(f)); ind = (NODE)FA1(f);

evalnodebody(ind,&tn); getarray(a,tn,&val);

Line 350 pointer evalstat(SNODE f)

Line 351 pointer evalstat(SNODE f)

case S_BP:

if ( !nextbp && (!FA1(f) || eval((FNODE)FA1(f))) ) {

if ( (FNODE)FA2(f) ) {

#if PARI

#if defined(PARI)

pari_outfile = stderr;

#endif

asir_out = stderr;

printexpr(CO,eval((FNODE)FA2(f)));

putc('\n',asir_out); fflush(asir_out);

#if PARI

#if defined(PARI)

pari_outfile = stdout;

#endif

asir_out = stdout;

Line 453 pointer evalf(FUNC f,FNODE a,FNODE opt)

Line 454 pointer evalf(FUNC f,FNODE a,FNODE opt)

LIST args;

pointer val;

int i,n,level;

NODE tn,sn,opts,opt1;

NODE tn,sn,opts,opt1,dmy;

VS pvs;

VS pvs,prev_mpvs;

char errbuf[BUFSIZ];

static int stack_size;

static unsigned int stack_size;

static void *stack_base;

if ( f->id == A_UNDEF ) {

sprintf(errbuf,"evalf : %s undefined",NAME(f));

error(errbuf);

}

if ( getsecuremode() && !PVSS && !f->secure ) {

sprintf(errbuf,"evalf : %s not permitted",NAME(f));

error(errbuf);

}

if ( f->id != A_PARI ) {

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) ) {

Line 472 pointer evalf(FUNC f,FNODE a,FNODE opt)

Line 477 pointer evalf(FUNC f,FNODE a,FNODE opt)

}

switch ( f->id ) {

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 ) {

cur_binf = f;

(*f->f.binf)(&val);

} else {

args = (LIST)eval(a);

current_option = opts;

cur_binf = f;

(*f->f.binf)(args?BDY(args):0,&val);

}

Line 537 pointer evalf(FUNC f,FNODE a,FNODE opt)

Line 557 pointer evalf(FUNC f,FNODE a,FNODE opt)

for ( tn = f->f.usrf->args, sn = BDY(args);

sn; tn = NEXT(tn), sn = NEXT(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();

break;

case A_PURE:

Line 672 pointer bevalf(FUNC f,NODE a)

Line 698 pointer bevalf(FUNC f,NODE a)

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) ) {

Line 784 void evalnodebody(NODE sn,NODE *dnp)

Line 814 void evalnodebody(NODE sn,NODE *dnp)

NEXT(n) = 0; *dnp = n0;

}

void gen_searchf(char *name,FUNC *r)

MODULE searchmodule(char *name)

{

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 )

searchf(sysf,name,&val);

if ( !val )

searchf(ubinf,name,&val);

if ( !val )

searchpf(name,&val);

if ( !val )

searchf(usrf,name,&val);

searchuf(name,&val);

if ( !val )

appenduf(name,&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)

{

NODE tn;

Line 813 void searchf(NODE fn,char *name,FUNC *r)

Line 906 void searchf(NODE fn,char *name,FUNC *r)

*r = 0;

}

MODULE mkmodule(char *);

void appenduf(char *name,FUNC *r)

{

NODE tn;

FUNC f;

int len;

MODULE mod;

char *modname,*fname,*dot;

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;

}

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)

{

FUNC f;

*r = f =(FUNC)MALLOC(sizeof(struct oFUNC));

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)

void mkuf(char *name,char *fname,NODE args,SNODE body,int startl,int endl,char *desc,MODULE module)

{

FUNC f;

USRF t;

NODE sn,tn;

NODE usrf_list,sn,tn;

FNODE fn;

char *longname;

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) ) {

fn = (FNODE)BDY(sn);

Line 852 void mkuf(char *name,char *fname,NODE args,SNODE body,

Line 1004 void mkuf(char *name,char *fname,NODE args,SNODE body,

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 )

f = (FUNC)BDY(sn);

else {

f=(FUNC)MALLOC(sizeof(struct oFUNC));

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->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;

f->id = A_USR; f->argc = argc; f->f.usrf = t;

CPVS = GPVS;

CUR_FUNC = 0;

clearbp(f);

}

Line 899 Obj getopt_from_cpvs(char *key)

Line 1064 Obj getopt_from_cpvs(char *key)

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);

}

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>