version 1.12, 2001/09/05 04:43:58 |
version 1.16, 2004/03/03 01:16:28 |
|
|
* 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/builtin/print.c,v 1.11 2001/09/04 03:12:20 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/print.c,v 1.15 2003/11/08 01:12:02 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
|
|
void Pprint(); |
void Pprint(); |
void Pquotetolist(); |
void Pquotetolist(); |
|
void Pobjtoquote(); |
void Peval_variables_in_quote(); |
void Peval_variables_in_quote(); |
void Pset_print_function(); |
void Pset_print_function(); |
FNODE eval_pvar_in_fnode(); |
|
FNODE subst_in_fnode(); |
|
|
|
struct ftab print_tab[] = { |
struct ftab print_tab[] = { |
{"print",Pprint,-2}, |
{"print",Pprint,-2}, |
|
{"objtoquote",Pobjtoquote,1}, |
{"quotetolist",Pquotetolist,1}, |
{"quotetolist",Pquotetolist,1}, |
{"eval_variables_in_quote",Peval_variables_in_quote,1}, |
{"eval_variables_in_quote",Peval_variables_in_quote,1}, |
{"set_print_function",Pset_print_function,-1}, |
{"set_print_function",Pset_print_function,-1}, |
{0,0,0}, |
{0,0,0}, |
}; |
}; |
|
|
void Pprint(arg,rp) |
void Pprint(NODE arg,pointer *rp) |
NODE arg; |
|
pointer *rp; |
|
{ |
{ |
printexpr(CO,ARG0(arg)); |
Obj obj; |
if ( argc(arg) == 2 ) |
OPTLIST opt; |
switch ( QTOS((Q)ARG1(arg)) ) { |
|
case 0: |
if ( arg ) { |
break; |
obj = (Obj)ARG0(arg); |
case 2: |
if ( NEXT(arg) ) { |
fflush(asir_out); break; |
opt = (OPTLIST)ARG1(arg); |
break; |
if ( INT(opt) ) { |
case 1: default: |
printexpr(CO,obj); |
putc('\n',asir_out); break; |
switch ( QTOS((Q)opt) ) { |
|
case 0: |
|
break; |
|
case 2: |
|
fflush(asir_out); break; |
|
break; |
|
case 1: default: |
|
putc('\n',asir_out); break; |
|
} |
|
} else if ( OID(opt) == O_OPTLIST ) { |
|
} else |
|
error("print : invalid argument"); |
|
} else { |
|
printexpr(CO,obj); |
|
putc('\n',asir_out); |
} |
} |
else |
} |
putc('\n',asir_out); |
|
*rp = 0; |
*rp = 0; |
} |
} |
|
|
void fnodetotree(); |
void Pobjtoquote(NODE arg,QUOTE *rp) |
|
{ |
|
objtoquote(ARG0(arg),rp); |
|
} |
|
|
void Pquotetolist(arg,rp) |
void Pquotetolist(NODE arg,LIST *rp) |
NODE arg; |
|
Obj *rp; |
|
{ |
{ |
asir_assert(ARG0(arg),O_QUOTE,"quotetolist"); |
asir_assert(ARG0(arg),O_QUOTE,"quotetolist"); |
fnodetotree((FNODE)BDY((QUOTE)(ARG0(arg))),rp); |
fnodetotree((FNODE)BDY((QUOTE)(ARG0(arg))),rp); |
} |
} |
|
|
void Peval_variables_in_quote(arg,rp) |
void Peval_variables_in_quote(NODE arg,QUOTE *rp) |
NODE arg; |
|
QUOTE *rp; |
|
{ |
{ |
FNODE fn; |
FNODE fn; |
|
|
|
|
|
|
/* fnode -> [tag,name,arg0,arg1,...] */ |
/* fnode -> [tag,name,arg0,arg1,...] */ |
|
|
void fnodetotree(f,rp) |
void fnodetotree(FNODE f,LIST *rp) |
FNODE f; |
|
Obj *rp; |
|
{ |
{ |
Obj a1,a2,a3; |
LIST a1,a2,a3; |
NODE n,t,t0; |
NODE n,t,t0; |
STRING head,op,str; |
STRING head,op,str; |
LIST r,arg; |
|
char *opname; |
char *opname; |
|
|
if ( !f ) { |
if ( !f ) { |
MKSTR(head,"internal"); |
MKSTR(head,"internal"); |
n = mknode(2,head,0); |
n = mknode(2,head,0); |
MKLIST(r,n); |
MKLIST(*rp,n); |
*rp = (Obj)r; |
|
return; |
return; |
} |
} |
switch ( f->id ) { |
switch ( f->id ) { |
/* unary operators */ |
/* unary operators */ |
case I_NOT: case I_PAREN: |
case I_NOT: case I_PAREN: case I_MINUS: |
MKSTR(head,"u_op"); |
MKSTR(head,"u_op"); |
switch ( f->id ) { |
switch ( f->id ) { |
case I_NOT: |
case I_NOT: |
|
|
case I_PAREN: |
case I_PAREN: |
MKSTR(op,"()"); |
MKSTR(op,"()"); |
break; |
break; |
|
case I_MINUS: |
|
MKSTR(op,"-"); |
|
break; |
} |
} |
fnodetotree((FNODE)FA0(f),&a1); |
fnodetotree((FNODE)FA0(f),&a1); |
n = mknode(3,head,op,a1); |
n = mknode(3,head,op,a1); |
MKLIST(r,n); |
MKLIST(*rp,n); |
*rp = (Obj)r; |
|
break; |
break; |
|
|
/* binary operators */ |
/* binary operators */ |
|
|
MKSTR(head,"u_op"); |
MKSTR(head,"u_op"); |
MKSTR(op,opname); |
MKSTR(op,opname); |
n = mknode(3,head,op,a1); |
n = mknode(3,head,op,a1); |
MKLIST(r,n); |
MKLIST(*rp,n); |
*rp = (Obj)r; |
|
return; |
return; |
} |
} |
MKSTR(op,opname); break; |
MKSTR(op,opname); break; |
|
|
MKSTR(op,"||"); break; |
MKSTR(op,"||"); break; |
} |
} |
n = mknode(4,head,op,a1,a2); |
n = mknode(4,head,op,a1,a2); |
MKLIST(r,n); |
MKLIST(*rp,n); |
*rp = (Obj)r; |
|
break; |
break; |
|
|
/* ternary operators */ |
/* ternary operators */ |
|
|
fnodetotree((FNODE)FA1(f),&a2); |
fnodetotree((FNODE)FA1(f),&a2); |
fnodetotree((FNODE)FA2(f),&a3); |
fnodetotree((FNODE)FA2(f),&a3); |
n = mknode(5,head,op,a1,a2,a3); |
n = mknode(5,head,op,a1,a2,a3); |
MKLIST(r,n); |
MKLIST(*rp,n); |
*rp = (Obj)r; |
|
break; |
break; |
|
|
/* lists */ |
/* lists */ |
|
|
n = (NODE)FA0(f); |
n = (NODE)FA0(f); |
for ( t0 = 0; n; n = NEXT(n) ) { |
for ( t0 = 0; n; n = NEXT(n) ) { |
NEXTNODE(t0,t); |
NEXTNODE(t0,t); |
fnodetotree(BDY(n),&BDY(t)); |
fnodetotree((FNODE)BDY(n),&a1); |
|
BDY(t) = (pointer)a1; |
} |
} |
if ( t0 ) |
if ( t0 ) |
NEXT(t) = 0; |
NEXT(t) = 0; |
MKSTR(head,"list"); |
MKSTR(head,"list"); |
MKNODE(n,head,t0); |
MKNODE(n,head,t0); |
MKLIST(r,n); |
MKLIST(*rp,n); |
*rp = (Obj)r; |
|
break; |
break; |
|
|
/* function */ |
/* function */ |
|
|
switch ( f->id ) { |
switch ( f->id ) { |
case I_FUNC: |
case I_FUNC: |
MKSTR(op,((FUNC)FA0(f))->name); |
MKSTR(op,((FUNC)FA0(f))->name); |
fnodetotree((FNODE)FA1(f),&arg); |
fnodetotree((FNODE)FA1(f),&a1); |
break; |
break; |
case I_CAR: |
case I_CAR: |
MKSTR(op,"car"); |
MKSTR(op,"car"); |
fnodetotree((FNODE)FA0(f),&arg); |
fnodetotree((FNODE)FA0(f),&a1); |
break; |
break; |
case I_CDR: |
case I_CDR: |
MKSTR(op,"cdr"); |
MKSTR(op,"cdr"); |
fnodetotree((FNODE)FA0(f),&arg); |
fnodetotree((FNODE)FA0(f),&a1); |
break; |
break; |
case I_EV: |
case I_EV: |
/* exponent vector; should be treated as function call */ |
/* exponent vector; should be treated as function call */ |
MKSTR(op,"exponent_vector"); |
MKSTR(op,"exponent_vector"); |
fnodetotree(mkfnode(1,I_LIST,FA0(f)),&arg); |
fnodetotree(mkfnode(1,I_LIST,FA0(f)),&a1); |
break; |
break; |
} |
} |
t0 = NEXT(BDY(arg)); /* XXX : skip the headers */ |
t0 = NEXT(BDY(a1)); /* XXX : skip the headers */ |
MKNODE(t,op,t0); |
MKNODE(t,op,t0); |
MKNODE(n,head,t); |
MKNODE(n,head,t); |
MKLIST(r,n); |
MKLIST(*rp,n); |
*rp = (Obj)r; |
|
break; |
break; |
|
|
case I_STR: |
case I_STR: |
MKSTR(head,"internal"); |
MKSTR(head,"internal"); |
MKSTR(str,FA0(f)); |
MKSTR(str,FA0(f)); |
n = mknode(2,head,str); |
n = mknode(2,head,str); |
MKLIST(r,n); |
MKLIST(*rp,n); |
*rp = (Obj)r; |
|
break; |
break; |
|
|
case I_FORMULA: |
case I_FORMULA: |
MKSTR(head,"internal"); |
MKSTR(head,"internal"); |
n = mknode(2,head,FA0(f)); |
n = mknode(2,head,FA0(f)); |
MKLIST(r,n); |
MKLIST(*rp,n); |
*rp = (Obj)r; |
|
break; |
break; |
|
|
case I_PVAR: |
case I_PVAR: |
|
|
GETPVNAME(FA0(f),opname); |
GETPVNAME(FA0(f),opname); |
MKSTR(op,opname); |
MKSTR(op,opname); |
n = mknode(2,head,op); |
n = mknode(2,head,op); |
MKLIST(r,n); |
MKLIST(*rp,n); |
*rp = (Obj)r; |
|
break; |
break; |
|
|
default: |
default: |
|
|
} |
} |
} |
} |
|
|
FNODE eval_pvar_in_fnode(f) |
FNODE eval_pvar_in_fnode(FNODE f) |
FNODE f; |
|
{ |
{ |
FNODE a1,a2,a3; |
FNODE a1,a2,a3; |
pointer r; |
pointer r; |
|
|
|
|
switch ( f->id ) { |
switch ( f->id ) { |
/* unary operators */ |
/* unary operators */ |
case I_NOT: case I_PAREN: |
case I_NOT: case I_PAREN: case I_MINUS: |
a1 = eval_pvar_in_fnode((FNODE)FA0(f)); |
a1 = eval_pvar_in_fnode((FNODE)FA0(f)); |
return mkfnode(1,f->id,a1); |
return mkfnode(1,f->id,a1); |
|
|
|
|
|
|
default: |
default: |
error("eval_pvar_in_fnode : not implemented yet"); |
error("eval_pvar_in_fnode : not implemented yet"); |
|
/* NOTREACHED */ |
|
return 0; |
} |
} |
} |
} |
|
|
FNODE subst_in_fnode(f,v,g) |
FNODE subst_in_fnode(FNODE f,V v,FNODE g) |
FNODE f; |
|
V v; |
|
FNODE g; |
|
{ |
{ |
FNODE a1,a2,a3; |
FNODE a1,a2,a3; |
DCP dc; |
DCP dc; |
pointer r; |
|
V vf; |
V vf; |
NODE n,t,t0; |
NODE n,t,t0; |
QUOTE q; |
|
Obj obj; |
Obj obj; |
|
|
if ( !f ) |
if ( !f ) |
|
|
|
|
switch ( f->id ) { |
switch ( f->id ) { |
/* unary operators */ |
/* unary operators */ |
case I_NOT: case I_PAREN: |
case I_NOT: case I_PAREN: case I_MINUS: |
a1 = subst_in_fnode((FNODE)FA0(f),v,g); |
a1 = subst_in_fnode((FNODE)FA0(f),v,g); |
return mkfnode(1,f->id,a1); |
return mkfnode(1,f->id,a1); |
|
|
|
|
|
|
default: |
default: |
error("subst_in_fnode : not implemented yet"); |
error("subst_in_fnode : not implemented yet"); |
|
/* NOTREACHED */ |
|
return 0; |
} |
} |
} |
} |
|
|
char *get_attribute(key,attr) |
/* not completed yet */ |
char *key; |
|
LIST attr; |
#if 0 |
|
char *get_attribute(char *key,LIST attr) |
{} |
{} |
|
|
void treetofnode(obj,f) |
void treetofnode(Obj obj,FNODE *f) |
Obj obj; |
|
FNODE *f; |
|
{ |
{ |
NODE n; |
NODE n; |
LIST attr; |
LIST attr; |
|
|
/* default will be set to P_FUNC */ |
/* default will be set to P_FUNC */ |
} |
} |
} |
} |
|
#endif |
|
|
FUNC user_print_function; |
FUNC user_print_function; |
|
|
void Pset_print_function(arg,rp) |
void Pset_print_function(NODE arg,pointer *rp) |
NODE arg; |
|
pointer *rp; |
|
{ |
{ |
if ( !arg ) |
if ( !arg ) |
user_print_function = 0; |
user_print_function = 0; |