version 1.4, 2000/08/22 05:04:17 |
version 1.9, 2001/08/06 04:25:43 |
|
|
* OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY |
* OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY |
* 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/io/cio.c,v 1.3 2000/08/21 08:31:38 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/io/cio.c,v 1.8 2001/08/06 01:48:33 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
|
|
return 1; |
return 1; |
switch ( OID(obj) ) { |
switch ( OID(obj) ) { |
case O_MATHCAP: case O_P: case O_R: case O_DP: case O_STR: |
case O_MATHCAP: case O_P: case O_R: case O_DP: case O_STR: |
case O_ERR: case O_USINT: case O_VOID: |
case O_ERR: case O_USINT: case O_BYTEARRAY: case O_VOID: |
return 1; |
return 1; |
case O_N: |
case O_N: |
if ( NID((Num)obj) == N_Q || NID((Num)obj) == N_R ) |
if ( NID((Num)obj) == N_Q || NID((Num)obj) == N_R ) |
|
|
if ( !valid_as_cmo(BDY(m)) ) |
if ( !valid_as_cmo(BDY(m)) ) |
return 0; |
return 0; |
return 1; |
return 1; |
|
case O_QUOTE: |
|
return 1; |
default: |
default: |
return 0; |
return 0; |
} |
} |
|
|
case O_ERR: |
case O_ERR: |
write_cmo_error(s,obj); |
write_cmo_error(s,obj); |
break; |
break; |
|
case O_BYTEARRAY: |
|
write_cmo_bytearray(s,obj); |
|
break; |
case O_VOID: |
case O_VOID: |
r = ((USINT)obj)->body; write_int(s,&r); |
r = ((USINT)obj)->body; write_int(s,&r); |
break; |
break; |
|
case O_QUOTE: |
|
write_cmo_tree(s,(FNODE)(((QUOTE)obj)->body)); |
|
break; |
default: |
default: |
sprintf(errmsg, "write_cmo : id=%d not implemented.",OID(obj)); |
sprintf(errmsg, "write_cmo : id=%d not implemented.",OID(obj)); |
error(errmsg); |
error(errmsg); |
|
|
} |
} |
} |
} |
|
|
|
int cmo_tag(obj,tag) |
|
Obj obj; |
|
int *tag; |
|
{ |
|
if ( !valid_as_cmo(obj) ) |
|
return 0; |
|
if ( !obj ) { |
|
*tag = CMO_NULL; |
|
return 1; |
|
} |
|
switch ( OID(obj) ) { |
|
case O_N: |
|
switch ( NID((Num)obj) ) { |
|
case N_Q: |
|
*tag = DN((Q)obj) ? CMO_QQ : CMO_ZZ; break; |
|
case N_R: |
|
*tag = CMO_IEEE_DOUBLE_FLOAT; break; |
|
default: |
|
return 0; |
|
} |
|
break; |
|
case O_P: |
|
*tag = CMO_RECURSIVE_POLYNOMIAL; break; |
|
case O_R: |
|
*tag = CMO_RATIONAL; break; |
|
case O_DP: |
|
*tag = CMO_DISTRIBUTED_POLYNOMIAL; break; |
|
case O_LIST: |
|
*tag = CMO_LIST; break; |
|
case O_STR: |
|
*tag = CMO_STRING; break; |
|
case O_USINT: |
|
*tag = CMO_INT32; break; |
|
case O_MATHCAP: |
|
*tag = CMO_MATHCAP; break; |
|
case O_ERR: |
|
*tag = CMO_ERROR2; break; |
|
case O_QUOTE: |
|
*tag = CMO_TREE; break; break; |
|
default: |
|
return 0; |
|
} |
|
return 1; |
|
} |
|
|
write_cmo_mathcap(s,mc) |
write_cmo_mathcap(s,mc) |
FILE *s; |
FILE *s; |
MATHCAP mc; |
MATHCAP mc; |
|
|
savestr(s,BDY(str)); |
savestr(s,BDY(str)); |
} |
} |
|
|
|
write_cmo_bytearray(s,array) |
|
FILE *s; |
|
BYTEARRAY array; |
|
{ |
|
int r; |
|
|
|
r = CMO_DATUM; write_int(s,&r); |
|
write_int(s,&array->len); |
|
write_string(s,array->body,array->len); |
|
} |
|
|
write_cmo_error(s,e) |
write_cmo_error(s,e) |
FILE *s; |
FILE *s; |
ERR e; |
ERR e; |
|
|
write_cmo(s,BDY(e)); |
write_cmo(s,BDY(e)); |
} |
} |
|
|
|
/* XXX */ |
|
|
|
write_cmo_tree(s,f) |
|
FILE *s; |
|
FNODE f; |
|
{ |
|
int r,i,n; |
|
char opname[BUFSIZ]; |
|
NODE args,t; |
|
FUNC fspec; |
|
struct oSTRING str,nullstr; |
|
|
|
/* zero */ |
|
if ( !f ) { |
|
r = CMO_NULL; write_int(s,&r); |
|
return; |
|
} |
|
|
|
/* null string */ |
|
nullstr.id = O_STR; |
|
nullstr.body = 0; |
|
|
|
/* name string */ |
|
str.id = O_STR; |
|
str.body = opname; |
|
|
|
switch ( f->id ) { |
|
case I_BOP: case I_COP: |
|
case I_AND: case I_OR: |
|
/* |
|
* (CMO_TREE (CMO_STRING,op),(CMO_STRING,0)(CMO_LIST,2,arg1,arg2)) |
|
*/ |
|
switch ( f->id ) { |
|
case I_BOP: |
|
strcpy(opname,((ARF)FA0(f))->name); break; |
|
case I_COP: |
|
switch( (cid)FA0(f) ) { |
|
case C_EQ: strcpy(opname,"=="); break; |
|
case C_NE: strcpy(opname,"!="); break; |
|
case C_GT: strcpy(opname,">"); break; |
|
case C_LT: strcpy(opname,"<"); break; |
|
case C_GE: strcpy(opname,">="); break; |
|
case C_LE: strcpy(opname,"<="); break; |
|
} |
|
break; |
|
case I_AND: |
|
strcpy(opname,"&&"); break; |
|
case I_OR: |
|
strcpy(opname,"||"); break; |
|
} |
|
r = CMO_TREE; write_int(s,&r); |
|
write_cmo_string(s,&str); |
|
write_cmo_string(s,&nullstr); |
|
r = CMO_LIST; write_int(s,&r); |
|
n = 2; write_int(s,&n); |
|
write_cmo_tree(s,(FNODE)FA1(f)); |
|
write_cmo_tree(s,(FNODE)FA2(f)); |
|
break; |
|
case I_NOT: |
|
r = CMO_TREE; write_int(s,&r); |
|
strcpy(opname,"!"); |
|
write_cmo_string(s,&str);; |
|
write_cmo_string(s,&nullstr); |
|
r = CMO_LIST; write_int(s,&r); |
|
n = 1; write_int(s,&n); |
|
write_cmo_tree(s,(FNODE)FA1(f)); |
|
break; |
|
case I_FUNC: |
|
r = CMO_TREE; write_int(s,&r); |
|
fspec = (FUNC)FA0(f); |
|
strcpy(opname,fspec->name); |
|
write_cmo_string(s,&str); |
|
write_cmo_string(s,&nullstr); |
|
args = (NODE)FA0((FNODE)FA1(f)); |
|
r = CMO_LIST; write_int(s,&r); |
|
for ( n = 0, t = args; t; t = NEXT(t), n++ ); |
|
write_int(s,&n); |
|
for ( i = 0, t = args; i < n; t = NEXT(t), i++ ) |
|
write_cmo_tree(s,BDY(t)); |
|
break; |
|
case I_LIST: |
|
r = CMO_LIST; write_int(s,&r); |
|
args = (NODE)FA0(f); |
|
for ( n = 0, t = args; t; t = NEXT(t), n++ ); |
|
write_int(s,&n); |
|
for ( i = 0, t = args; i < n; i++, t = NEXT(t) ) |
|
write_cmo_tree(s,BDY(t)); |
|
break; |
|
case I_FORMULA: |
|
write_cmo(s,FA0(f)); |
|
break; |
|
default: |
|
break; /* XXX */ |
|
} |
|
} |
|
|
read_cmo(s,rp) |
read_cmo(s,rp) |
FILE *s; |
FILE *s; |
Obj *rp; |
Obj *rp; |
|
|
Obj obj; |
Obj obj; |
ERR e; |
ERR e; |
MATHCAP mc; |
MATHCAP mc; |
|
BYTEARRAY array; |
|
QUOTE quote; |
|
FNODE fn; |
|
|
read_int(s,&id); |
read_int(s,&id); |
switch ( id ) { |
switch ( id ) { |
|
|
read_cmo_uint(s,rp); |
read_cmo_uint(s,rp); |
break; |
break; |
case CMO_DATUM: |
case CMO_DATUM: |
|
loadbytearray(s,&array); *rp = (Obj)array; |
|
break; |
case CMO_STRING: |
case CMO_STRING: |
loadstring(s,&str); *rp = (Obj)str; |
loadstring(s,&str); *rp = (Obj)str; |
break; |
break; |
|
|
case CMO_RING_BY_NAME: |
case CMO_RING_BY_NAME: |
read_cmo(s,rp); |
read_cmo(s,rp); |
break; |
break; |
|
case CMO_TREE: |
|
read_cmo_tree(s,&fn); |
|
MKQUOTE(quote,fn); |
|
*rp = (Obj)quote; |
|
break; |
default: |
default: |
MKUSINT(t,id); |
MKUSINT(t,id); |
t->id = O_VOID; |
t->id = O_VOID; |
|
|
if ( dc0 ) |
if ( dc0 ) |
NEXT(dc) = 0; |
NEXT(dc) = 0; |
MKP(remote_vtab[ind],dc0,*rp); |
MKP(remote_vtab[ind],dc0,*rp); |
|
} |
|
|
|
/* XXX */ |
|
|
|
extern struct oARF arf[]; |
|
|
|
struct operator_tab { |
|
char *name; |
|
fid id; |
|
ARF arf; |
|
cid cid; |
|
}; |
|
|
|
static struct operator_tab optab[] = { |
|
{"+",I_BOP,&arf[0],0}, /* XXX */ |
|
{"-",I_BOP,&arf[1],0}, |
|
{"*",I_BOP,&arf[2],0}, |
|
{"/",I_BOP,&arf[3],0}, |
|
{"%",I_BOP,&arf[4],0}, |
|
{"^",I_BOP,&arf[5],0}, |
|
{"==",I_COP,0,C_EQ}, |
|
{"!=",I_COP,0,C_NE}, |
|
{"<",I_COP,0,C_LT}, |
|
{"<=",I_COP,0,C_LE}, |
|
{">",I_COP,0,C_GT}, |
|
{">=",I_COP,0,C_GE}, |
|
{"&&",I_AND,0,0}, |
|
{"||",I_OR,0,0}, |
|
{"!",I_NOT,0,0}, |
|
}; |
|
|
|
static int optab_len = sizeof(optab)/sizeof(struct operator_tab); |
|
|
|
read_cmo_tree(s,rp) |
|
FILE *s; |
|
FNODE *rp; |
|
{ |
|
int r,i,n; |
|
char *opname; |
|
STRING name,cd; |
|
int op; |
|
pointer *arg; |
|
QUOTE quote; |
|
FNODE fn; |
|
NODE t,t1; |
|
fid id; |
|
Obj expr; |
|
FUNC func; |
|
|
|
read_cmo(s,&name); |
|
read_cmo(s,&cd); /* XXX: currently not used */ |
|
for ( i = 0; i < optab_len; i++ ) |
|
if ( !strcmp(optab[i].name,BDY(name)) ) |
|
break; |
|
if ( i == optab_len ) { |
|
/* may be a function name */ |
|
n = read_cmo_tree_arg(s,&arg); |
|
for ( i = n-1, t = 0; i >= 0; i-- ) { |
|
MKNODE(t1,arg[i],t); t = t1; |
|
} |
|
searchf(sysf,BDY(name),&func); |
|
if ( !func ) |
|
searchf(ubinf,BDY(name),&func); |
|
if ( !func ) |
|
searchpf(BDY(name),&func); |
|
if ( !func ) |
|
searchf(usrf,BDY(name),&func); |
|
if ( !func ) |
|
appenduf(BDY(name),&func); |
|
*rp = mkfnode(2,I_FUNC,func,mkfnode(1,I_LIST,t)); |
|
} else { |
|
opname = optab[i].name; |
|
id = optab[i].id; |
|
switch ( id ) { |
|
case I_BOP: |
|
read_cmo_tree_arg(s,&arg); |
|
*rp = mkfnode(3,I_BOP,optab[i].arf,arg[0],arg[1]); |
|
return; |
|
case I_COP: |
|
read_cmo_tree_arg(s,&arg); |
|
*rp = mkfnode(3,I_COP,optab[i].cid,arg[0],arg[0]); |
|
return; |
|
case I_AND: |
|
read_cmo_tree_arg(s,&arg); |
|
*rp = mkfnode(2,I_AND,arg[0],arg[1]); |
|
return; |
|
case I_OR: |
|
read_cmo_tree_arg(s,&arg); |
|
*rp = mkfnode(2,I_OR,arg[0],arg[1]); |
|
return; |
|
case I_NOT: |
|
read_cmo_tree_arg(s,&arg); |
|
*rp = mkfnode(1,I_OR,arg[0]); |
|
return; |
|
} |
|
} |
|
} |
|
|
|
int read_cmo_tree_arg(s,argp) |
|
FILE *s; |
|
pointer **argp; |
|
{ |
|
int id,n,i; |
|
pointer *ap; |
|
Obj t; |
|
|
|
read_int(s,&id); /* id = CMO_LIST */ |
|
read_int(s,&n); /* n = the number of args */ |
|
*argp = ap = (pointer *) MALLOC(n*sizeof(pointer)); |
|
for ( i = 0; i < n; i++ ) { |
|
read_cmo(s,&t); |
|
if ( !t || (OID(t) != O_QUOTE) ) |
|
ap[i] = mkfnode(1,I_FORMULA,t); |
|
else |
|
ap[i] = BDY((QUOTE)t); |
|
} |
|
return n; |
} |
} |
|
|
localname_to_cmoname(a,b) |
localname_to_cmoname(a,b) |