version 1.64, 2008/11/18 20:52:47 |
version 1.70, 2014/08/09 06:08:11 |
|
|
* 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.63 2008/09/01 06:20:33 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/parse/eval.c,v 1.69 2013/11/21 06:48:04 noro Exp $ |
*/ |
*/ |
#include <ctype.h> |
#include <ctype.h> |
#include "ca.h" |
#include "ca.h" |
Line 70 int evalstatline; |
|
Line 70 int evalstatline; |
|
int recv_intr; |
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 882 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 882 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 917 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 943 pointer evalf(FUNC f,FNODE a,FNODE opt) |
|
Line 944 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 988 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 997 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 1167 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 1200 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 1275 pointer bevalf_with_opts(FUNC f,NODE a,NODE opts) |
|
Line 1279 pointer bevalf_with_opts(FUNC f,NODE a,NODE opts) |
|
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 1339 pointer evalpf(PF pf,NODE args,NODE dargs) |
|
Line 1344 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 1430 void gen_searchf(char *name,FUNC *r) |
|
Line 1435 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; |