version 1.16, 2004/03/03 01:16:28 |
version 1.21, 2006/02/01 07:29:29 |
|
|
* 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.15 2003/11/08 01:12:02 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/print.c,v 1.20 2005/12/10 14:14:15 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
Line 65 struct ftab print_tab[] = { |
|
Line 65 struct ftab print_tab[] = { |
|
{0,0,0}, |
{0,0,0}, |
}; |
}; |
|
|
|
extern int I_am_server; |
|
|
void Pprint(NODE arg,pointer *rp) |
void Pprint(NODE arg,pointer *rp) |
{ |
{ |
Obj obj; |
Obj obj; |
OPTLIST opt; |
Q opt; |
|
|
if ( arg ) { |
if ( arg ) { |
obj = (Obj)ARG0(arg); |
obj = (Obj)ARG0(arg); |
if ( NEXT(arg) ) { |
if ( NEXT(arg) ) { |
opt = (OPTLIST)ARG1(arg); |
opt = (Q)ARG1(arg); |
if ( INT(opt) ) { |
if ( INT(opt) ) { |
printexpr(CO,obj); |
printexpr(CO,obj); |
switch ( QTOS((Q)opt) ) { |
switch ( QTOS(opt) ) { |
case 0: |
case 0: |
break; |
break; |
case 2: |
case 2: |
Line 85 void Pprint(NODE arg,pointer *rp) |
|
Line 87 void Pprint(NODE arg,pointer *rp) |
|
case 1: default: |
case 1: default: |
putc('\n',asir_out); break; |
putc('\n',asir_out); break; |
} |
} |
} else if ( OID(opt) == O_OPTLIST ) { |
|
} else |
} else |
error("print : invalid argument"); |
error("print : invalid argument"); |
} else { |
} else { |
Line 93 void Pprint(NODE arg,pointer *rp) |
|
Line 94 void Pprint(NODE arg,pointer *rp) |
|
putc('\n',asir_out); |
putc('\n',asir_out); |
} |
} |
} |
} |
|
/* XXX : if ox_asir, we have to fflush always */ |
|
if ( I_am_server ) |
|
fflush(asir_out); |
*rp = 0; |
*rp = 0; |
} |
} |
|
|
Line 215 void fnodetotree(FNODE f,LIST *rp) |
|
Line 219 void fnodetotree(FNODE f,LIST *rp) |
|
MKLIST(*rp,n); |
MKLIST(*rp,n); |
break; |
break; |
|
|
|
case I_NARYOP: |
|
/* head */ |
|
MKSTR(head,"n_op"); |
|
n = (NODE)FA1(f); |
|
for ( t0 = 0; n; n = NEXT(n) ) { |
|
NEXTNODE(t0,t); |
|
fnodetotree((FNODE)BDY(n),&a1); |
|
BDY(t) = (pointer)a1; |
|
} |
|
MKSTR(op,((ARF)FA0(f))->name); |
|
MKNODE(t,op,t0); |
|
MKNODE(n,head,t); |
|
MKLIST(*rp,n); |
|
break; |
|
|
/* ternary operators */ |
/* ternary operators */ |
case I_CE: |
case I_CE: |
MKSTR(head,"t_op"); |
MKSTR(head,"t_op"); |
Line 242 void fnodetotree(FNODE f,LIST *rp) |
|
Line 261 void fnodetotree(FNODE f,LIST *rp) |
|
break; |
break; |
|
|
/* function */ |
/* function */ |
case I_FUNC: case I_CAR: case I_CDR: case I_EV: |
case I_FUNC: case I_FUNC_QARG: case I_CAR: case I_CDR: case I_EV: |
MKSTR(head,"function"); |
MKSTR(head,"function"); |
switch ( f->id ) { |
switch ( f->id ) { |
case I_FUNC: |
case I_FUNC: case I_FUNC_QARG: |
MKSTR(op,((FUNC)FA0(f))->name); |
MKSTR(op,((FUNC)FA0(f))->fullname); |
fnodetotree((FNODE)FA1(f),&a1); |
fnodetotree((FNODE)FA1(f),&a1); |
break; |
break; |
case I_CAR: |
case I_CAR: |