/*
* Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
* All rights reserved.
*
* FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
* non-exclusive and royalty-free license to use, copy, modify and
* redistribute, solely for non-commercial and non-profit purposes, the
* computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
* conditions of this Agreement. For the avoidance of doubt, you acquire
* only a limited right to use the SOFTWARE hereunder, and FLL or any
* third party developer retains all rights, including but not limited to
* copyrights, in and to the SOFTWARE.
*
* (1) FLL does not grant you a license in any way for commercial
* purposes. You may use the SOFTWARE only for non-commercial and
* non-profit purposes only, such as academic, research and internal
* business use.
* (2) The SOFTWARE is protected by the Copyright Law of Japan and
* international copyright treaties. If you make copies of the SOFTWARE,
* with or without modification, as permitted hereunder, you shall affix
* to all such copies of the SOFTWARE the above copyright notice.
* (3) An explicit reference to this SOFTWARE and its copyright owner
* shall be made on your publication or presentation in any form of the
* results obtained by use of the SOFTWARE.
* (4) In the event that you modify the SOFTWARE, you shall notify FLL by
* e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
* for such modification or the source code of the modified part of the
* SOFTWARE.
*
* THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
* MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
* EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
* FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
* RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
* MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
* UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
* OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
* DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
* ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
* FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
* DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
* SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
* OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
*
* $OpenXM: OpenXM_contrib2/asir2000/builtin/strobj.c,v 1.71 2005/10/12 14:43:36 noro Exp $
*/
#include "ca.h"
#include "parse.h"
#include "ctype.h"
#if defined(PARI)
#include "genpari.h"
# if !(PARI_VERSION_CODE > 131588)
extern jmp_buf environnement;
# endif
#endif
#include <string.h>
struct TeXSymbol {
char *text;
char *symbol;
};
#define OPNAME(f) (((ARF)FA0(f))->name[0])
extern char *parse_strp;
void Psprintf();
void Prtostr(), Pstrtov(), Peval_str();
void Pstrtoascii(), Pasciitostr();
void Pstr_len(), Pstr_chr(), Psub_str();
void Pwrite_to_tb();
void Ptb_to_string();
void Pclear_tb();
void Pstring_to_tb();
void Pquotetotex_tb();
void Pquotetotex();
void Pquotetotex_env();
void Pflatten_quote();
void Pquote_is_integer(),Pquote_is_rational(),Pquote_is_number();
void Pquote_is_dependent(),Pquote_is_function();
void Pquote_normalize();
void Pquote_to_funargs(),Pfunargs_to_quote(),Pget_function_name();
void Pquote_unify(),Pget_quote_id(),Pquote_match_rewrite();
void Pquote_to_nary(),Pquote_to_bin();
void do_assign(NODE arg);
void fnodetotex_tb(FNODE f,TB tb);
char *symbol_name(char *name);
char *conv_rule(char *name);
char *conv_subs(char *name);
char *call_convfunc(char *name);
void tb_to_string(TB tb,STRING *rp);
void fnodenodetotex_tb(NODE n,TB tb);
void fargstotex_tb(char *opname,FNODE f,TB tb);
int top_is_minus(FNODE f);
int quote_unify(Obj f,Obj pat,NODE *rp);
struct ftab str_tab[] = {
{"sprintf",Psprintf,-99999999},
{"rtostr",Prtostr,1},
{"strtov",Pstrtov,1},
{"eval_str",Peval_str,1},
{"strtoascii",Pstrtoascii,1},
{"asciitostr",Pasciitostr,1},
{"str_len",Pstr_len,1},
{"str_chr",Pstr_chr,3},
{"sub_str",Psub_str,3},
{"write_to_tb",Pwrite_to_tb,2},
{"clear_tb",Pclear_tb,1},
{"tb_to_string",Ptb_to_string,1},
{"string_to_tb",Pstring_to_tb,1},
{"get_quote_id",Pget_quote_id,1},
{"quote_is_number",Pquote_is_number,1},
{"quote_is_rational",Pquote_is_rational,1},
{"quote_is_integer",Pquote_is_integer,1},
{"quote_is_function",Pquote_is_function,1},
{"quote_is_dependent",Pquote_is_dependent,2},
{"quote_normalize",Pquote_normalize,1},
{"quote_to_nary",Pquote_to_nary,1},
{"quote_to_bin",Pquote_to_bin,2},
{"quotetotex_tb",Pquotetotex_tb,2},
{"quotetotex",Pquotetotex,1},
{"quotetotex_env",Pquotetotex_env,-99999999},
{"flatten_quote",Pflatten_quote,-2},
{"quote_to_funargs",Pquote_to_funargs,1},
{"quote_unify",Pquote_unify,2},
{"quote_match_rewrite",Pquote_match_rewrite,-4},
{"funargs_to_quote",Pfunargs_to_quote,1},
{"get_function_name",Pget_function_name,1},
{0,0,0},
};
void write_tb(char *s,TB tb)
{
if ( tb->next == tb->size ) {
tb->size *= 2;
tb->body = (char **)REALLOC(tb->body,tb->size*sizeof(char *));
}
tb->body[tb->next] = s;
tb->next++;
}
int register_symbol_table(Obj arg);
int register_conv_rule(Obj arg);
int register_conv_func(Obj arg);
int register_dp_vars(Obj arg);
int register_dp_vars_origin(Obj arg);
int register_dp_dvars_origin(Obj arg);
int register_dp_dvars_prefix(Obj arg);
int register_dp_vars_prefix(Obj arg);
int register_dp_vars_hweyl(Obj arg);
int register_show_lt(Obj arg);
char *objtostr(Obj obj);
static struct TeXSymbol *user_texsymbol;
static char **dp_vars;
static int dp_vars_len;
static char *dp_vars_prefix;
static char *dp_dvars_prefix;
static int dp_vars_origin;
static int dp_dvars_origin;
static int show_lt;
static FUNC convfunc;
static int is_lt;
static int conv_flag;
static int dp_vars_hweyl;
#define CONV_TABLE (1U<<0)
#define CONV_SUBS (1U<<1)
#define CONV_DMODE (1U<<2)
static struct {
char *name;
Obj value;
int (*reg)();
} qtot_env[] = {
{"symbol_table",0,register_symbol_table},
{"conv_rule",0,register_conv_rule},
{"conv_func",0,register_conv_func},
{"dp_vars",0,register_dp_vars},
{"dp_vars_prefix",0,register_dp_vars_prefix},
{"dp_dvars_prefix",0,register_dp_dvars_prefix},
{"dp_vars_origin",0,register_dp_vars_origin},
{"dp_dvars_origin",0,register_dp_dvars_origin},
{"dp_vars_hweyl",0,register_dp_vars_hweyl},
{"show_lt",0,register_show_lt},
{0,0,0},
};
#define PARTIAL "\\partial"
char *conv_rule(char *name)
{
char *body,*r;
int len;
if ( convfunc )
name = call_convfunc(name);
if ( conv_flag & CONV_TABLE ) {
r = symbol_name(name);
if ( r ) return r;
}
if ( (conv_flag & CONV_DMODE) && *name == 'd' ) {
body = conv_rule(name+1);
r = MALLOC_ATOMIC((strlen(PARTIAL)+strlen(body)+5)*sizeof(char));
if ( !body || !(len=strlen(body)) )
strcpy(r,PARTIAL);
else if ( len == 1 )
sprintf(r,"%s_%s",PARTIAL,body);
else
sprintf(r,"%s_{%s}",PARTIAL,body);
return r;
} else
return conv_subs(name);
}
int _is_delimiter(char c)
{
if ( (c == ' ' || c == '_' || c == ',') ) return 1;
else return 0;
}
int _is_alpha(char c)
{
if ( isdigit(c) || c == '{' || _is_delimiter(c) ) return 0;
else return 1;
}
char *conv_subs(char *name)
{
int i,j,k,len,clen,slen,start,level;
char *buf,*head,*r,*h,*brace,*buf_conv;
char **subs;
if ( !name || !(len=strlen(name)) ) return "";
if ( !(conv_flag&CONV_SUBS) ) return name;
subs = (char **)ALLOCA(len*sizeof(char* ));
for ( i = 0, j = 0, start = i; ; j++ ) {
while ( (i < len) && _is_delimiter(name[i]) ) i++;
start = i;
if ( i == len ) break;
if ( name[i] == '{' ) {
for ( level = 1, i++; i < len && level; i++ ) {
if ( name[i] == '{' ) level++;
else if ( name[i] == '}' ) level--;
}
slen = i-start;
if ( slen >= 3 ) {
brace = (char *)ALLOCA((slen+1)*sizeof(char));
strncpy(brace,name+start+1,slen-2);
brace[slen-2] = 0;
buf = conv_subs(brace);
subs[j] = (char *)ALLOCA((strlen(buf)+3)*sizeof(char));
if ( strlen(buf) == 1 )
strcpy(subs[j],buf);
else
sprintf(subs[j],"{%s}",buf);
} else
subs[j] = "{}";
} else {
if ( isdigit(name[i]) )
while ( i < len && isdigit(name[i]) ) i++;
else
while ( i < len && _is_alpha(name[i]) ) i++;
slen = i-start;
buf = (char *)ALLOCA((slen+1)*sizeof(char));
strncpy(buf,name+start,slen); buf[slen] = 0;
buf_conv = symbol_name(buf);
subs[j] = buf_conv?buf_conv:buf;
}
}
for ( k = 0, clen = 0; k < j; k++ ) clen += strlen(subs[k]);
/* {subs(0)}_{{subs(1)},...,{subs(j-1)}} => {}:j+1 _:1 ,:j-2 */
h = r = MALLOC_ATOMIC((clen+(j+1)*2+1+(j-2)+1)*sizeof(char));
if ( j == 1 )
sprintf(h,"{%s}",subs[0]);
else {
sprintf(h,"{%s}_{%s",subs[0],subs[1]);
h += strlen(h);
for ( k = 2; k < j; k++ ) {
sprintf(h,",%s",subs[k]);
h += strlen(h);
}
strcpy(h,"}");
}
return r;
}
char *call_convfunc(char *name)
{
STRING str,r;
NODE arg;
MKSTR(str,name);
arg = mknode(1,str);
r = (STRING)bevalf(convfunc,arg);
if ( !r || OID(r) != O_STR )
error("call_convfunc : invalid result");
return BDY(r);
}
int register_symbol_table(Obj arg)
{
NODE n,t;
Obj b;
STRING a0,a1;
struct TeXSymbol *uts;
int i,len;
/* check */
if ( !arg ) {
user_texsymbol = 0;
return 1;
}
if ( OID(arg) != O_LIST ) return 0;
n = BDY((LIST)arg);
len = length(n);
uts = (struct TeXSymbol *)MALLOC((len+1)*sizeof(struct TeXSymbol));
for ( i = 0; n; n = NEXT(n), i++ ) {
b = (Obj)BDY(n);
if ( !b || OID(b) != O_LIST ) return 0;
t = BDY((LIST)b);
if ( !t || !NEXT(t) ) return 0;
a0 = (STRING)BDY(t);
a1 = (STRING)BDY(NEXT(t));
if ( !a0 ) return 0;
if ( OID(a0) == O_STR )
uts[i].text = BDY(a0);
else if ( OID(a0) == O_P )
uts[i].text = NAME(VR((P)a0));
else
return 0;
if ( !a1 ) return 0;
if ( OID(a1) == O_STR )
uts[i].symbol = BDY(a1);
else if ( OID(a1) == O_P )
uts[i].symbol = NAME(VR((P)a1));
else
return 0;
}
uts[i].text = 0;
uts[i].symbol = 0;
user_texsymbol = uts;
return 1;
}
int register_dp_vars_origin(Obj arg)
{
if ( INT(arg) ) {
dp_vars_origin = QTOS((Q)arg);
return 1;
} else return 0;
}
int register_dp_dvars_origin(Obj arg)
{
if ( INT(arg) ) {
dp_dvars_origin = QTOS((Q)arg);
return 1;
} else return 0;
}
int register_dp_vars_hweyl(Obj arg)
{
if ( INT(arg) ) {
dp_vars_hweyl = QTOS((Q)arg);
return 1;
} else return 0;
}
int register_show_lt(Obj arg)
{
if ( INT(arg) ) {
show_lt = QTOS((Q)arg);
return 1;
} else return 0;
}
int register_conv_rule(Obj arg)
{
if ( INT(arg) ) {
conv_flag = QTOS((Q)arg);
convfunc = 0;
return 1;
} else return 0;
}
int register_conv_func(Obj arg)
{
if ( !arg ) {
convfunc = 0;
return 1;
} else if ( OID(arg) == O_P && (int)(VR((P)arg))->attr == V_SR ) {
convfunc = (FUNC)(VR((P)arg)->priv);
/* f must be a function which takes single argument */
return 1;
} else return 0;
}
int register_dp_vars(Obj arg)
{
int l,i;
char **r;
NODE n;
STRING a;
if ( !arg ) {
dp_vars = 0;
dp_vars_len = 0;
return 1;
} else if ( OID(arg) != O_LIST )
return 0;
else {
n = BDY((LIST)arg);
l = length(n);
r = (char **)MALLOC_ATOMIC(l*sizeof(char *));
for ( i = 0; i < l; i++, n = NEXT(n) ) {
a = (STRING)BDY(n);
if ( !a ) return 0;
if ( OID(a) == O_STR )
r[i] = BDY(a);
else if ( OID(a) == O_P )
r[i] = NAME(VR((P)a));
else
return 0;
}
dp_vars = r;
dp_vars_len = l;
return 1;
}
}
int register_dp_vars_prefix(Obj arg)
{
if ( !arg ) {
dp_vars_prefix = 0;
return 1;
} else if ( OID(arg) == O_STR ) {
dp_vars_prefix = BDY((STRING)arg);
return 1;
} else if ( OID(arg) == O_P ) {
dp_vars_prefix = NAME(VR((P)arg));
return 1;
} else return 0;
}
int register_dp_dvars_prefix(Obj arg)
{
if ( !arg ) {
dp_dvars_prefix = 0;
return 1;
} else if ( OID(arg) == O_STR ) {
dp_dvars_prefix = BDY((STRING)arg);
return 1;
} else if ( OID(arg) == O_P ) {
dp_dvars_prefix = NAME(VR((P)arg));
return 1;
} else return 0;
}
void Pquotetotex_env(NODE arg,Obj *rp)
{
int ac,i;
char *name;
NODE n,n0;
STRING s;
LIST l;
ac = argc(arg);
if ( !ac ) {
n0 = 0;
for ( i = 0; qtot_env[i].name; i++ ) {
NEXTNODE(n0,n); MKSTR(s,qtot_env[i].name); BDY(n) = (pointer)s;
NEXTNODE(n0,n); BDY(n) = (Q)qtot_env[i].value;
}
NEXT(n) = 0;
MKLIST(l,n0);
*rp = (Obj)l;
} else if ( ac == 1 && !ARG0(arg) ) {
/* set to default */
for ( i = 0; qtot_env[i].name; i++ ) {
(qtot_env[i].reg)(0);
qtot_env[i].value = 0;
}
*rp = 0;
} else if ( ac == 1 || ac == 2 ) {
asir_assert(ARG0(arg),O_STR,"quotetotex_env");
name = BDY((STRING)ARG0(arg));
for ( i = 0; qtot_env[i].name; i++ )
if ( !strcmp(qtot_env[i].name,name) ) {
if ( ac == 2 ) {
if ( (qtot_env[i].reg)((Obj)ARG1(arg)) )
qtot_env[i].value = (Obj)ARG1(arg);
else
error("quotetotex_env : invalid argument");
}
*rp = qtot_env[i].value;
return;
}
*rp = 0;
} else
*rp = 0;
}
void Pwrite_to_tb(NODE arg,Q *rp)
{
int i;
Obj obj;
TB tb;
asir_assert(ARG1(arg),O_TB,"write_to_tb");
obj = ARG0(arg);
if ( !obj )
write_tb("",ARG1(arg));
else if ( OID(obj) == O_STR )
write_tb(BDY((STRING)obj),ARG1(arg));
else if ( OID(obj) == O_TB ) {
tb = (TB)obj;
for ( i = 0; i < tb->next; i++ )
write_tb(tb->body[i],ARG1(arg));
}
*rp = 0;
}
FNODE partial_eval(FNODE), fnode_to_nary(FNODE), fnode_to_bin(FNODE,int);
FNODE fnode_normalize(FNODE);
void Pquote_to_nary(NODE arg,QUOTE *rp)
{
FNODE f;
f = fnode_to_nary(BDY((QUOTE)ARG0(arg)));
MKQUOTE(*rp,f);
}
void Pquote_to_bin(NODE arg,QUOTE *rp)
{
FNODE f;
int direction;
direction = QTOS((Q)ARG1(arg));
f = fnode_to_bin(BDY((QUOTE)ARG0(arg)),direction);
MKQUOTE(*rp,f);
}
void Pquote_is_number(NODE arg,Q *rp)
{
QUOTE q;
int ret;
q = (QUOTE)ARG0(arg);
asir_assert(q,O_QUOTE,"quote_is_number");
ret = fnode_is_number(BDY(q));
STOQ(ret,*rp);
}
void Pquote_is_rational(NODE arg,Q *rp)
{
QUOTE q;
int ret;
q = (QUOTE)ARG0(arg);
asir_assert(q,O_QUOTE,"quote_is_rational");
ret = fnode_is_rational(BDY(q));
STOQ(ret,*rp);
}
void Pquote_is_integer(NODE arg,Q *rp)
{
QUOTE q;
int ret;
q = (QUOTE)ARG0(arg);
asir_assert(q,O_QUOTE,"quote_is_integer");
ret = fnode_is_integer(BDY(q));
STOQ(ret,*rp);
}
void Pquote_is_function(NODE arg,Q *rp)
{
QUOTE q;
int ret;
q = (QUOTE)ARG0(arg);
asir_assert(q,O_QUOTE,"quote_is_function");
if ( q->id == I_FUNC || q->id == I_IFUNC )
ret = 1;
else
ret = 0;
STOQ(ret,*rp);
}
void Pquote_is_dependent(NODE arg,Q *rp)
{
P x;
QUOTE q,v;
int ret;
V var;
q = (QUOTE)ARG0(arg);
v = (QUOTE)ARG1(arg);
asir_assert(q,O_QUOTE,"quote_is_dependent");
asir_assert(v,O_QUOTE,"quote_is_dependent");
x = (P)eval(BDY(v));
if ( !x || OID(x) != O_P )
*rp = 0;
var = VR(x);
ret = fnode_is_dependent(BDY(q),var);
STOQ(ret,*rp);
}
void Pquote_unify(NODE arg,Q *rp)
{
FNODE f,g;
Obj obj;
QUOTE q;
NODE r;
int ret;
#if 0
g = partial_eval(BDY(((QUOTE)ARG0(arg))));
MKQUOTE(q,g);
ret = quote_unify((Obj)q,(Obj)ARG1(arg),&r);
#else
obj = (Obj)ARG0(arg);
ret = quote_unify(obj,(Obj)ARG1(arg),&r);
#endif
if ( ret ) {
do_assign(r);
*rp = ONE;
} else
*rp = 0;
}
FNODE rewrite_fnode(FNODE,NODE);
extern Obj VOIDobj;
void Pquote_match_rewrite(NODE arg,Obj *rp)
{
FNODE f,g,h,c,value;
Obj obj;
QUOTE q;
NODE r,t,s,s0,pair;
int ret,ind,ac;
obj = (Obj)ARG0(arg);
ret = quote_unify(obj,(Obj)ARG1(arg),&r);
if ( ret ) {
for ( t = r, s0 = 0; t; t = NEXT(t) ) {
NEXTNODE(s0,s);
pair = BDY((LIST)BDY(t));
ind = (int)FA0((FNODE)BDY((QUOTE)BDY(pair)));
value = mkfnode(1,I_FORMULA,BDY(NEXT(pair)));
BDY(s) = mknode(2,ind,value);
}
if ( s0 ) NEXT(s) = 0;
switch ( ac = argc(arg) ) {
case 3:
h = rewrite_fnode(BDY((QUOTE)ARG2(arg)),s0);
*rp = eval(h);
break;
case 4:
c = rewrite_fnode(BDY((QUOTE)ARG2(arg)),s0);
if ( eval(c) ) {
h = rewrite_fnode(BDY((QUOTE)ARG3(arg)),s0);
*rp = eval(h);
} else
*rp = VOIDobj;
break;
default:
error("quote_match_rewrite : invalid argument");
}
} else
*rp = VOIDobj;
}
void do_assign(NODE arg)
{
NODE t,pair;
int pv;
QUOTE value;
for ( t = arg; t; t = NEXT(t) ) {
pair = BDY((LIST)BDY(t));
pv = (int)FA0((FNODE)BDY((QUOTE)BDY(pair)));
value = (QUOTE)(BDY(NEXT(pair)));
ASSPV(pv,value);
}
}
/*
/* consistency check and merge
*/
int merge_matching_node(NODE n,NODE a,NODE *rp)
{
NODE ta,ba,tn,bn;
QUOTE pa,va,pn,vn;
if ( !n ) {
*rp = a;
return 1;
}
for ( ta = a; ta; ta = NEXT(ta) ) {
ba = BDY((LIST)BDY(ta));
if ( !ba ) continue;
pa = (QUOTE)BDY(ba); va = (QUOTE)BDY(NEXT(ba));
for ( tn = n; tn; tn = NEXT(tn) ) {
bn = BDY((LIST)BDY(tn));
if ( !bn ) continue;
pn = (QUOTE)BDY(bn); vn = (QUOTE)BDY(NEXT(bn));
if ( !compquote(CO,pa,pn) ) {
if ( !compquote(CO,va,vn) ) break;
else return 0;
}
}
if ( !tn ) {
MKNODE(tn,(pointer)BDY(ta),n);
n = tn;
}
}
*rp = n;
return 1;
}
int quote_unify_node(NODE f,NODE pat,NODE *rp) {
NODE r,a,tf,tp,r1;
int ret;
if ( length(f) != length(pat) ) return 0;
r = 0;
for ( tf = f, tp = pat; tf; tf = NEXT(tf), tp = NEXT(tp) ) {
ret = quote_unify((Obj)BDY(tf),(Obj)BDY(tp),&a);
if ( !ret ) return 0;
ret = merge_matching_node(r,a,&r1);
if ( !ret ) return 0;
else r = r1;
}
*rp = r;
return 1;
}
/* f = [a,b,c,...] pat = [X,Y,...] rpat matches the rest of f */
int quote_unify_cons(NODE f,NODE pat,Obj rpat,NODE *rp) {
QUOTE q;
Q id;
FNODE fn;
NODE r,a,tf,tp,r1,arg;
int ret;
LIST list,alist;
/* matching of the head part */
if ( length(f) < length(pat) ) return 0;
r = 0;
for ( tf = f, tp = pat; tp; tf = NEXT(tf), tp = NEXT(tp) ) {
ret = quote_unify((Obj)BDY(tf),(Obj)BDY(tp),&a);
if ( !ret ) return 0;
ret = merge_matching_node(r,a,&r1);
if ( !ret ) return 0;
else r = r1;
}
/* matching of the rest */
MKLIST(list,tf);
STOQ(I_LIST,id); a = mknode(2,id,list);
MKLIST(alist,a);
arg = mknode(1,alist);
Pfunargs_to_quote(arg,&q);
ret = quote_unify((Obj)q,rpat,&a);
if ( !ret ) return 0;
ret = merge_matching_node(r,a,&r1);
if ( !ret ) return 0;
*rp = r1;
return 1;
}
void get_quote_id_arg(QUOTE f,int *id,NODE *r)
{
LIST fa;
NODE arg,fab;
arg = mknode(1,f); Pquote_to_funargs(arg,&fa); fab = BDY((LIST)fa);
*id = QTOS((Q)BDY(fab)); *r = NEXT(fab);
}
/* *rp : [[quote(A),quote(1)],...] */
int quote_unify(Obj f, Obj pat, NODE *rp)
{
NODE tf,tp,head,body;
NODE parg,farg,r;
Obj rpat;
LIST fa,l;
int pid,id;
FUNC ff,pf;
int ret;
QUOTE q;
FNODE g;
if ( !f )
if ( !pat ) {
*rp = 0; return 1;
} else
return 0;
else if ( OID(pat) == O_LIST ) {
if ( OID(f) == O_LIST )
return quote_unify_node(BDY((LIST)f),BDY((LIST)pat),rp);
else
return 0;
} else if ( OID(pat) == O_QUOTE ) {
pid = ((FNODE)BDY((QUOTE)pat))->id;
switch ( pid ) {
case I_FORMULA:
if ( compquote(CO,f,pat) )
return 0;
else {
*rp = 0; return 1;
}
break;
case I_LIST: case I_CONS:
get_quote_id_arg((QUOTE)pat,&pid,&parg);
if ( OID(f) == O_LIST )
tf = BDY((LIST)f);
else if ( OID(f) == O_QUOTE
&& ((FNODE)BDY((QUOTE)f))->id == pid ) {
get_quote_id_arg((QUOTE)f,&id,&farg);
tf = BDY((LIST)BDY(farg));
} else
return 0;
tp = BDY((LIST)BDY(parg));
if ( pid == I_LIST )
return quote_unify_node(tf,tp,rp);
else {
rpat = (Obj)BDY(NEXT(parg));
return quote_unify_cons(tf,tp,rpat,rp);
}
case I_PVAR:
/* [[pat,f]] */
r = mknode(2,pat,f); MKLIST(l,r);
*rp = mknode(1,l);
return 1;
case I_IFUNC:
/* F(X,Y,...) = ... */
get_quote_id_arg((QUOTE)f,&id,&farg);
get_quote_id_arg((QUOTE)pat,&pid,&parg);
if ( id == I_FUNC ) {
r = mknode(2,BDY(parg),BDY(farg)); MKLIST(l,r);
head = mknode(1,l);
ret = quote_unify(BDY(NEXT(farg)),
BDY(NEXT(parg)),&body);
if ( !ret ) return 0;
else return merge_matching_node(head,body,rp);
} else
return 0;
case I_NARYOP: case I_BOP: case I_FUNC:
/* X+Y = ... */
/* f(...) = ... */
if ( OID(f) != O_QUOTE ) return 0;
id = ((FNODE)BDY((QUOTE)f))->id;
if ( pid == I_FUNC )
;
else {
/* XXX converting to I_BOP */
if ( pid == I_NARYOP ) {
g = fnode_to_bin(BDY((QUOTE)pat),1);
MKQUOTE(q,g); pat = (Obj)q;
}
if ( id == I_NARYOP ) {
g = fnode_to_bin(BDY((QUOTE)f),1);
MKQUOTE(q,g); f = (Obj)q;
}
}
get_quote_id_arg((QUOTE)pat,&pid,&parg);
get_quote_id_arg((QUOTE)f,&id,&farg);
if ( compqa(CO,BDY(farg),BDY(parg)) ) return 0;
return quote_unify_node(NEXT(farg),NEXT(parg),rp);
default:
if ( OID(f) != O_QUOTE ) return 0;
id = ((FNODE)BDY((QUOTE)f))->id;
if ( id != pid ) return 0;
get_quote_id_arg((QUOTE)pat,&pid,&parg);
get_quote_id_arg((QUOTE)f,&id,&farg);
return quote_unify_node(farg,parg,rp);
}
}
}
void Pquotetotex(NODE arg,STRING *rp)
{
TB tb;
NEWTB(tb);
/* XXX for DP */
is_lt = 1;
fnodetotex_tb(BDY((QUOTE)ARG0(arg)),tb);
tb_to_string(tb,rp);
}
void Pquotetotex_tb(NODE arg,Q *rp)
{
int i;
TB tb;
asir_assert(ARG1(arg),O_TB,"quotetotex_tb");
/* XXX for DP */
is_lt = 1;
fnodetotex_tb(BDY((QUOTE)ARG0(arg)),ARG1(arg));
*rp = 0;
}
void Pstring_to_tb(NODE arg,TB *rp)
{
TB tb;
asir_assert(ARG0(arg),O_STR,"string_to_tb");
NEWTB(tb);
tb->body[0] = BDY((STRING)ARG0(arg));
tb->next++;
*rp = tb;
}
void Ptb_to_string(NODE arg,STRING *rp)
{
TB tb;
asir_assert(ARG0(arg),O_TB,"tb_to_string");
tb = (TB)ARG0(arg);
tb_to_string(tb,rp);
}
void tb_to_string(TB tb,STRING *rp)
{
int j,len;
char *all,*p,*q;
for ( j = 0, len = 0; j < tb->next; j++ )
len += strlen(tb->body[j]);
all = (char *)MALLOC_ATOMIC((len+1)*sizeof(char));
for ( j = 0, p = all; j < tb->next; j++ )
for ( q = tb->body[j]; *q; *p++ = *q++ );
*p = 0;
MKSTR(*rp,all);
}
void Pclear_tb(NODE arg,Q *rp)
{
TB tb;
int j;
asir_assert(ARG0(arg),O_TB,"clear_tb");
tb = (TB)ARG0(arg);
for ( j = 0; j < tb->next; j++ )
tb->body[j] = 0;
tb->next = 0;
*rp = 0;
}
void Pstr_len(arg,rp)
NODE arg;
Q *rp;
{
Obj obj;
TB tb;
int r,i;
obj = (Obj)ARG0(arg);
if ( !obj || (OID(obj) != O_STR && OID(obj) != O_TB) )
error("str_len : invalid argument");
if ( OID(obj) == O_STR)
r = strlen(BDY((STRING)obj));
else if ( OID(obj) == O_TB ) {
tb = (TB)obj;
for ( r = i = 0; i < tb->next; i++ )
r += strlen(tb->body[i]);
}
STOQ(r,*rp);
}
void Pstr_chr(arg,rp)
NODE arg;
Q *rp;
{
STRING str,terminator;
Q start;
char *p,*ind;
int chr,spos,r;
str = (STRING)ARG0(arg);
start = (Q)ARG1(arg);
terminator = (STRING)ARG2(arg);
asir_assert(str,O_STR,"str_chr");
asir_assert(start,O_N,"str_chr");
asir_assert(terminator,O_STR,"str_chr");
p = BDY(str);
spos = QTOS(start);
chr = BDY(terminator)[0];
if ( spos > (int)strlen(p) )
r = -1;
else {
ind = strchr(p+spos,chr);
if ( ind )
r = ind-p;
else
r = -1;
}
STOQ(r,*rp);
}
void Psub_str(arg,rp)
NODE arg;
STRING *rp;
{
STRING str;
Q head,tail;
char *p,*r;
int spos,epos,len;
str = (STRING)ARG0(arg);
head = (Q)ARG1(arg);
tail = (Q)ARG2(arg);
asir_assert(str,O_STR,"sub_str");
asir_assert(head,O_N,"sub_str");
asir_assert(tail,O_N,"sub_str");
p = BDY(str);
spos = QTOS(head);
epos = QTOS(tail);
len = strlen(p);
if ( (spos >= len) || (epos < spos) ) {
*rp = 0; return;
}
if ( epos >= len )
epos = len-1;
len = epos-spos+1;
r = (char *)MALLOC(len+1);
strncpy(r,p+spos,len);
r[len] = 0;
MKSTR(*rp,r);
}
void Pstrtoascii(arg,rp)
NODE arg;
LIST *rp;
{
STRING str;
unsigned char *p;
int len,i;
NODE n,n1;
Q q;
str = (STRING)ARG0(arg);
asir_assert(str,O_STR,"strtoascii");
p = BDY(str);
len = strlen(p);
for ( i = len-1, n = 0; i >= 0; i-- ) {
UTOQ((unsigned int)p[i],q);
MKNODE(n1,q,n);
n = n1;
}
MKLIST(*rp,n);
}
void Pasciitostr(arg,rp)
NODE arg;
STRING *rp;
{
LIST list;
unsigned char *p;
int len,i,j;
NODE n;
Q q;
list = (LIST)ARG0(arg);
asir_assert(list,O_LIST,"asciitostr");
n = BDY(list);
len = length(n);
p = MALLOC_ATOMIC(len+1);
for ( i = 0; i < len; i++, n = NEXT(n) ) {
q = (Q)BDY(n);
asir_assert(q,O_N,"asciitostr");
j = QTOS(q);
if ( j >= 256 || j <= 0 )
error("asciitostr : argument out of range");
p[i] = j;
}
p[i] = 0;
MKSTR(*rp,(char *)p);
}
void Peval_str(arg,rp)
NODE arg;
Obj *rp;
{
FNODE fnode;
char *cmd;
#if defined(PARI)
void recover(int);
recover(0);
# if !(PARI_VERSION_CODE > 131588)
if ( setjmp(environnement) ) {
avma = top; recover(1);
resetenv("");
}
# endif
#endif
cmd = BDY((STRING)ARG0(arg));
exprparse_create_var(0,cmd,&fnode);
*rp = eval(fnode);
}
void Prtostr(arg,rp)
NODE arg;
STRING *rp;
{
char *b;
int len;
len = estimate_length(CO,ARG0(arg));
b = (char *)MALLOC_ATOMIC(len+1);
soutput_init(b);
sprintexpr(CO,ARG0(arg));
MKSTR(*rp,b);
}
void Pstrtov(arg,rp)
NODE arg;
P *rp;
{
char *p;
p = BDY((STRING)ARG0(arg));
#if 0
if ( !islower(*p) )
*rp = 0;
else {
for ( t = p+1; t && (isalnum(*t) || *t == '_'); t++ );
if ( *t )
*rp = 0;
else
makevar(p,rp);
}
#else
makevar(p,rp);
#endif
}
static struct TeXSymbol texsymbol[] = {
{"sin","\\sin"},
{"cos","\\cos"},
{"tan","\\tan"},
{"sinh","\\sinh"},
{"cosh","\\cosh"},
{"tanh","\\tanh"},
{"exp","\\exp"},
{"log","\\log"},
/* Greek Letters (lower case) */
{"alpha","\\alpha"},
{"beta","\\beta"},
{"gamma","\\gamma"},
{"delta","\\delta"},
{"epsilon","\\epsilon"},
{"varepsilon","\\varepsilon"},
{"zeta","\\zeta"},
{"eta","\\eta"},
{"theta","\\theta"},
{"vartheta","\\vartheta"},
{"iota","\\iota"},
{"kappa","\\kappa"},
{"lambda","\\lambda"},
{"mu","\\mu"},
{"nu","\\nu"},
{"xi","\\xi"},
{"pi","\\pi"},
{"varpi","\\varpi"},
{"rho","\\rho"},
{"sigma","\\sigma"},
{"varsigma","\\varsigma"},
{"tau","\\tau"},
{"upsilon","\\upsilon"},
{"phi","\\phi"},
{"varphi","\\varphi"},
{"chi","\\chi"},
{"omega","\\omega"},
/* Greek Letters, (upper case) */
{"ggamma","\\Gamma"},
{"ddelta","\\Delta"},
{"ttheta","\\Theta"},
{"llambda","\\Lambda"},
{"xxi","\\Xi"},
{"ppi","\\Pi"},
{"ssigma","\\Sigma"},
{"uupsilon","\\Upsilon"},
{"pphi","\\Phi"},
{"ppsi","\\Psi"},
{"oomega","\\Omega"},
/* Our own mathematical functions */
{"algebra_tensor","\\otimes"},
{"base_where","{\\rm \\ where \\ }"},
/* Mathematical constants */
{"c_pi","\\pi"},
{"c_i","\\sqrt{-1}"},
/* Temporary */
{0,0}
};
char *symbol_name(char *name)
{
int i;
if ( !name || strlen(name) == 0 )
return "";
if ( !(conv_flag & CONV_TABLE) )
return name;
if ( user_texsymbol )
for ( i = 0; user_texsymbol[i].text; i++ )
if ( !strcmp(user_texsymbol[i].text,name) )
return user_texsymbol[i].symbol;
for ( i = 0; texsymbol[i].text; i++ )
if ( !strcmp(texsymbol[i].text,name) )
return texsymbol[i].symbol;
return 0;
}
void Pget_function_name(NODE arg,STRING *rp)
{
QUOTEARG qa;
ARF f;
char *opname;
qa = (QUOTEARG)BDY(arg);
if ( !qa || OID(qa) != O_QUOTEARG || qa->type != A_arf )
*rp = 0;
else {
f = (ARF)BDY(qa);
opname = f->name;
MKSTR(*rp,opname);
}
}
FNODE strip_paren(FNODE);
void fnodetotex_tb(FNODE f,TB tb)
{
NODE n,t,t0;
char vname[BUFSIZ],prefix[BUFSIZ];
char *opname,*vname_conv,*prefix_conv;
Obj obj;
int i,len,allzero,elen,elen2,si;
C cplx;
char *r;
FNODE fi,f2;
write_tb(" ",tb);
if ( !f ) {
write_tb("0",tb);
return;
}
switch ( f->id ) {
/* unary operators */
case I_NOT:
write_tb("\\neg (",tb);
fnodetotex_tb((FNODE)FA0(f),tb);
write_tb(")",tb);
break;
case I_PAREN:
write_tb("(",tb);
fnodetotex_tb((FNODE)FA0(f),tb);
write_tb(")",tb);
break;
case I_MINUS:
write_tb("-",tb);
fnodetotex_tb((FNODE)FA0(f),tb);
break;
/* binary operators */
/* arg list */
/* I_AND, I_OR => FA0(f), FA1(f) */
/* otherwise => FA1(f), FA2(f) */
case I_BOP:
opname = ((ARF)FA0(f))->name;
switch ( opname[0] ) {
case '+':
fnodetotex_tb((FNODE)FA1(f),tb);
if ( !top_is_minus((FNODE)FA2(f)) ) write_tb(opname,tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case '-':
if ( FA1(f) ) fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(opname,tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case '*':
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" ",tb);
/* XXX special care for DP */
f2 = (FNODE)FA2(f);
if ( f2->id == I_EV ) {
n = (NODE)FA0(f2);
for ( i = 0; n; n = NEXT(n), i++ ) {
fi = (FNODE)BDY(n);
if ( fi->id != I_FORMULA || FA0(fi) )
break;
}
if ( n )
fnodetotex_tb((FNODE)FA2(f),tb);
} else
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case '/':
write_tb("\\frac{",tb);
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb("} {",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
write_tb("}",tb);
break;
case '^':
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb("^{",tb);
fnodetotex_tb(strip_paren((FNODE)FA2(f)),tb);
write_tb("} ",tb);
break;
case '%':
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" {\\rm mod}\\, ",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
default:
error("invalid binary operator");
break;
}
break;
case I_COP:
switch( (cid)FA0(f) ) {
case C_EQ:
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" = ",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case C_NE:
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" \\neq ",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case C_GT:
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" > ",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case C_LT:
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" < ",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case C_GE:
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" \\geq ",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case C_LE:
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" \\leq ",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
}
break;
case I_LOP:
switch( (lid)FA0(f) ) {
case L_EQ:
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" = ",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case L_NE:
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" \\neq ",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case L_GT:
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" > ",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case L_LT:
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" < ",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case L_GE:
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" \\geq ",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case L_LE:
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" \\leq ",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case L_AND:
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" {\\rm \\ and\\ } ",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case L_OR:
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(" {\\rm \\ or\\ } ",tb);
fnodetotex_tb((FNODE)FA2(f),tb);
break;
case L_NOT:
/* XXX : L_NOT is a unary operator */
write_tb("\\neg (",tb);
fnodetotex_tb((FNODE)FA1(f),tb);
write_tb(")",tb);
return;
}
break;
case I_AND:
fnodetotex_tb((FNODE)FA0(f),tb);
write_tb(" {\\rm \\ and\\ } ",tb);
fnodetotex_tb((FNODE)FA1(f),tb);
break;
case I_OR:
fnodetotex_tb((FNODE)FA0(f),tb);
write_tb(" {\\rm \\ or\\ } ",tb);
fnodetotex_tb((FNODE)FA1(f),tb);
break;
/* ternary operators */
case I_CE:
error("fnodetotex_tb : not implemented yet");
break;
/* lists */
case I_LIST:
write_tb(" [ ",tb);
n = (NODE)FA0(f);
fnodenodetotex_tb(n,tb);
write_tb("]",tb);
break;
/* function */
case I_FUNC:
if ( !strcmp(((FUNC)FA0(f))->name,"@pi") )
write_tb("\\pi",tb);
else if ( !strcmp(((FUNC)FA0(f))->name,"@e") )
write_tb("e",tb);
else {
opname = conv_rule(((FUNC)FA0(f))->name);
write_tb(opname,tb);
write_tb("(",tb);
fargstotex_tb(opname,FA1(f),tb);
write_tb(")",tb);
}
break;
/* XXX */
case I_CAR:
opname = conv_rule("car");
write_tb(opname,tb);
write_tb("(",tb);
fargstotex_tb(opname,FA0(f),tb);
write_tb(")",tb);
break;
case I_CDR:
opname = conv_rule("cdr");
write_tb(opname,tb);
write_tb("(",tb);
fargstotex_tb(opname,FA0(f),tb);
write_tb(")",tb);
break;
/* exponent vector */
case I_EV:
n = (NODE)FA0(f);
if ( dp_vars_hweyl ) {
elen = length(n);
elen2 = elen>>1;
elen = elen2<<1;
}
allzero = 1;
if ( show_lt && is_lt )
write_tb("\\underline{",tb);
for ( t0 = 0, i = 0; n; n = NEXT(n), i++ ) {
fi = (FNODE)BDY(n);
if ( fi->id == I_FORMULA && !FA0(fi) ) continue;
allzero = 0;
if ( dp_vars && i < dp_vars_len ) {
strcpy(vname,dp_vars[i]);
vname_conv = conv_rule(vname);
} else {
if ( dp_vars_hweyl ) {
if ( i < elen2 ) {
strcpy(prefix,dp_vars_prefix?dp_vars_prefix:"x");
prefix_conv = conv_rule(prefix);
vname_conv = (char *)ALLOCA(strlen(prefix_conv)+50);
si = i+dp_vars_origin;
sprintf(vname_conv,(si>=0&&si<10)?"%s_%d":"%s_{%d}",
prefix_conv,si);
} else if ( i < elen ) {
strcpy(prefix,
dp_dvars_prefix?dp_dvars_prefix:"\\partial");
prefix_conv = conv_rule(prefix);
vname_conv = (char *)ALLOCA(strlen(prefix_conv)+50);
si = i+dp_dvars_origin-elen2;
sprintf(vname_conv,(si>=0&&si<10)?"%s_%d":"%s_{%d}",
prefix_conv,si);
} else {
strcpy(prefix,"h");
vname_conv = conv_rule(prefix);
}
} else {
strcpy(prefix,dp_vars_prefix?dp_vars_prefix:"x");
prefix_conv = conv_rule(prefix);
vname_conv = (char *)ALLOCA(strlen(prefix_conv)+50);
si = i+dp_vars_origin;
sprintf(vname_conv,(si>=0&&si<10)?"%s_%d":"%s_{%d}",
prefix_conv,si);
}
}
if ( fi->id == I_FORMULA && UNIQ(FA0(fi)) ) {
len = strlen(vname_conv);
opname = MALLOC_ATOMIC(len+2);
sprintf(opname,"%s ",vname_conv);
write_tb(opname,tb);
} else {
len = strlen(vname_conv);
/* 2: ^{ */
opname = MALLOC_ATOMIC(len+1+2);
sprintf(opname,"%s^{",vname_conv);
write_tb(opname,tb);
fnodetotex_tb((FNODE)BDY(n),tb);
write_tb("} ",tb);
}
}
/* XXX */
if ( allzero )
write_tb(" 1 ",tb);
if ( show_lt && is_lt ) {
write_tb("}",tb);
is_lt = 0;
}
break;
/* string */
case I_STR:
write_tb((char *)FA0(f),tb);
break;
/* internal object */
case I_FORMULA:
obj = (Obj)FA0(f);
if ( !obj )
write_tb("0",tb);
else if ( OID(obj) == O_N && NID(obj) == N_C ) {
cplx = (C)obj;
write_tb("(",tb);
if ( cplx->r ) {
r = objtostr((Obj)cplx->r); write_tb(r,tb);
}
if ( cplx->i ) {
if ( cplx->r && compnum(0,cplx->i,0) > 0 ) {
write_tb("+",tb);
if ( !UNIQ(cplx->i) ) {
r = objtostr((Obj)cplx->i); write_tb(r,tb);
}
} else if ( MUNIQ(cplx->i) )
write_tb("-",tb);
else if ( !UNIQ(cplx->i) ) {
r = objtostr((Obj)cplx->i); write_tb(r,tb);
}
write_tb("\\sqrt{-1}",tb);
}
write_tb(")",tb);
} else if ( OID(obj) == O_P )
write_tb(conv_rule(VR((P)obj)->name),tb);
else
write_tb(objtostr(obj),tb);
break;
/* program variable */
case I_PVAR:
if ( FA1(f) )
error("fnodetotex_tb : not implemented yet");
GETPVNAME(FA0(f),opname);
write_tb(opname,tb);
break;
default:
error("fnodetotex_tb : not implemented yet");
}
}
char *objtostr(Obj obj)
{
int len;
char *r;
len = estimate_length(CO,obj);
r = (char *)MALLOC_ATOMIC(len+1);
soutput_init(r);
sprintexpr(CO,obj);
return r;
}
void Psprintf(NODE arg,STRING *rp)
{
STRING string;
char *s,*t,*r;
int argc,n,len;
NODE node;
string = (STRING)ARG0(arg);
asir_assert(string,O_STR,"sprintf");
s = BDY(string);
for(n = 0, t = s; *t; t++) {
if (*t=='%' && *(t+1)=='a') {
n++;
}
}
for(node = NEXT(arg), argc = 0, len = strlen(s); node; node = NEXT(node), argc++) {
len += estimate_length(CO,BDY(node));
}
if (argc < n) {
error("sprintf: invalid argument");
}
r = (char *)MALLOC_ATOMIC(len);
for(node = NEXT(arg), t = r; *s; s++) {
if (*s=='%' && *(s+1)=='a') {
strcpy(t,objtostr(BDY(node)));
node = NEXT(node);
t = strchr(t,0);
s++;
}else {
*t++ = *s;
}
}
*t = 0;
MKSTR(*rp,r);
}
void fnodenodetotex_tb(NODE n,TB tb)
{
for ( ; n; n = NEXT(n) ) {
is_lt = 1;
fnodetotex_tb((FNODE)BDY(n),tb);
if ( NEXT(n) ) write_tb(", ",tb);
}
}
void fargstotex_tb(char *name,FNODE f,TB tb)
{
NODE n;
if ( !strcmp(name,"matrix") ) {
error("fargstotex_tb : not implemented yet");
} else if ( !strcmp(name,"vector") ) {
error("fargstotex_tb : not implemented yet");
} else {
if ( f->id == I_LIST ) {
n = (NODE)FA0(f);
fnodenodetotex_tb(n,tb);
} else
fnodetotex_tb(f,tb);
}
}
int top_is_minus(FNODE f)
{
char *opname;
int len;
Obj obj;
if ( !f )
return 0;
switch ( f->id ) {
case I_MINUS:
return 1;
case I_BOP:
opname = ((ARF)FA0(f))->name;
switch ( opname[0] ) {
case '+': case '*': case '/': case '^': case '%':
return top_is_minus((FNODE)FA1(f));
case '-':
if ( FA1(f) )
return top_is_minus((FNODE)FA1(f));
else
return 1;
default:
return 0;
}
break;
case I_COP:
return top_is_minus((FNODE)FA1(f));
case I_LOP:
if ( (lid)FA0(f) == L_NOT ) return 0;
else return top_is_minus((FNODE)FA1(f));
case I_AND: case I_OR:
return top_is_minus((FNODE)FA0(f));
case I_FORMULA:
obj = (Obj)FA0(f);
if ( !obj )
return 0;
else {
switch ( OID(obj) ) {
case O_N:
return mmono((P)obj);
case O_P:
/* must be a variable */
opname = conv_rule(VR((P)obj)->name);
return opname[0]=='-';
default:
/* ??? */
len = estimate_length(CO,obj);
opname = (char *)MALLOC_ATOMIC(len+1);
soutput_init(opname);
sprintexpr(CO,obj);
return opname[0]=='-';
}
}
default:
return 0;
}
}
FNODE flatten_fnode(FNODE,char *);
void Pflatten_quote(NODE arg,Obj *rp)
{
FNODE f;
QUOTE q;
if ( !ARG0(arg) || OID((Obj)ARG0(arg)) != O_QUOTE )
*rp = (Obj)ARG0(arg);
else if ( argc(arg) == 1 ) {
f = flatten_fnode(BDY((QUOTE)ARG0(arg)),"+");
f = flatten_fnode(f,"*");
MKQUOTE(q,f);
*rp = (Obj)q;
} else {
f = flatten_fnode(BDY((QUOTE)ARG0(arg)),BDY((STRING)ARG1(arg)));
MKQUOTE(q,f);
*rp = (Obj)q;
}
}
void Pget_quote_id(NODE arg,Q *rp)
{
FNODE f;
QUOTE q;
q = (QUOTE)ARG0(arg);
if ( !q || OID(q) != O_QUOTE )
error("get_quote_id : invalid argument");
f = BDY(q);
STOQ((int)f->id,*rp);
}
void Pquote_to_funargs(NODE arg,LIST *rp)
{
fid_spec_p spec;
QUOTE q;
QUOTEARG qa;
FNODE f;
STRING s;
QUOTE r;
int i;
Q id,a;
LIST l;
NODE t0,t,w,u,u0;
q = (QUOTE)ARG0(arg);
if ( !q || OID(q) != O_QUOTE )
error("quote_to_funargs : invalid argument");
f = BDY(q);
if ( !f ) {
MKLIST(*rp,0);
return;
}
get_fid_spec(f->id,&spec);
if ( !spec )
error("quote_to_funargs : not supported yet");
t0 = 0;
STOQ((int)f->id,id);
NEXTNODE(t0,t);
BDY(t) = (pointer)id;
for ( i = 0; spec->type[i] != A_end; i++ ) {
NEXTNODE(t0,t);
switch ( spec->type[i] ) {
case A_fnode:
MKQUOTE(r,(FNODE)f->arg[i]);
BDY(t) = (pointer)r;
break;
case A_int:
STOQ((int)f->arg[i],a);
BDY(t) = (pointer)a;
break;
case A_str:
MKSTR(s,(char *)f->arg[i]);
BDY(t) = (pointer)s;
break;
case A_internal:
BDY(t) = (pointer)f->arg[i];
break;
case A_node:
w = (NODE)f->arg[i];
for ( u0 = 0; w; w = NEXT(w) ){
NEXTNODE(u0,u);
MKQUOTE(r,(FNODE)BDY(w));
BDY(u) = (pointer)r;
}
if ( u0 ) NEXT(u) = 0;
MKLIST(l,u0);
BDY(t) = (pointer)l;
break;
default:
MKQUOTEARG(qa,spec->type[i],f->arg[i]);
BDY(t) = (pointer)qa;
break;
}
}
if ( t0 ) NEXT(t) = 0;
MKLIST(*rp,t0);
}
void Pfunargs_to_quote(NODE arg,QUOTE *rp)
{
fid_spec_p spec;
QUOTE q;
QUOTEARG qa;
FNODE f;
STRING s;
QUOTE r,b;
int i;
LIST l;
fid id;
Obj a;
NODE t0,t,u0,u,w;
l = (LIST)ARG0(arg);
if ( !l || OID(l) != O_LIST || !(t=BDY(l)) )
error("funargs_to_quote : invalid argument");
t = BDY(l);
id = (fid)QTOS((Q)BDY(t)); t = NEXT(t);
get_fid_spec(id,&spec);
if ( !spec )
error("funargs_to_quote : not supported yet");
for ( i = 0; spec->type[i] != A_end; i++ );
NEWFNODE(f,i);
f->id = id;
for ( i = 0; spec->type[i] != A_end; i++, t = NEXT(t) ) {
if ( !t )
error("funargs_to_quote : argument mismatch");
a = (Obj)BDY(t);
switch ( spec->type[i] ) {
case A_fnode:
if ( !a || OID(a) != O_QUOTE )
error("funargs_to_quote : invalid argument");
f->arg[i] = BDY((QUOTE)a);
break;
case A_int:
if ( !INT(a) )
error("funargs_to_quote : invalid argument");
f->arg[i] = (pointer)QTOS((Q)a);
break;
case A_str:
if ( !a || OID(a) != O_STR )
error("funargs_to_quote : invalid argument");
f->arg[i] = (pointer)BDY((STRING)a);
break;
case A_internal:
f->arg[i] = (pointer)a;
break;
case A_node:
if ( !a || OID(a) != O_LIST )
error("funargs_to_quote : invalid argument");
u0 = 0;
for ( w = BDY((LIST)a); w; w = NEXT(w) ) {
NEXTNODE(u0,u);
b = (QUOTE)BDY(w);
if ( !b || OID(b) != O_QUOTE )
error("funargs_to_quote : invalid argument");
BDY(u) = BDY(b);
}
if ( u0 ) NEXT(u) = 0;
f->arg[i] = (pointer)u0;
break;
default:
if ( !a || OID(a) != O_QUOTEARG ||
((QUOTEARG)a)->type != spec->type[i] )
error("funargs_to_quote : invalid argument");
f->arg[i] = BDY((QUOTEARG)a);
break;
}
}
MKQUOTE(*rp,f);
}
FNODE fnode_apply(FNODE f,FNODE (*func)());
FNODE fnode_normalize(FNODE f);
FNODE fnode_normalize_nary(FNODE f);
void Pquote_normalize(NODE arg,QUOTE *rp)
{
QUOTE q,r;
FNODE f;
q = (QUOTE)ARG0(arg);
if ( !q || OID(q) != O_QUOTE ) {
*rp = q;
return;
} else {
#if 0
f = flatten_fnode(BDY(q),"+");
f = flatten_fnode(f,"*");
#endif
f = fnode_normalize(BDY(q));
f = fnode_to_nary(f);
f = fnode_normalize_nary(f);
MKQUOTE(r,f);
*rp = r;
}
}
int fnode_is_number(FNODE f)
{
Obj obj;
switch ( f->id ) {
case I_MINUS: case I_PAREN:
return fnode_is_number(FA0(f));
case I_FORMULA:
obj = FA0(f);
if ( !obj ) return 1;
else if ( OID(obj) == O_QUOTE )
return fnode_is_number(BDY((QUOTE)obj));
else if ( NUM(obj) ) return 1;
else return 0;
case I_BOP:
return fnode_is_number(FA1(f)) && fnode_is_number(FA2(f));
default:
return 0;
}
}
int fnode_is_rational(FNODE f)
{
Obj obj;
switch ( f->id ) {
case I_MINUS: case I_PAREN:
return fnode_is_number(FA0(f));
case I_FORMULA:
obj = FA0(f);
if ( !obj ) return 1;
else if ( OID(obj) == O_QUOTE )
return fnode_is_rational(BDY((QUOTE)obj));
else if ( NUM(obj) && RATN(obj) ) return 1;
else return 0;
case I_BOP:
if ( !strcmp(((ARF)FA0(f))->name,"^") )
return fnode_is_rational(FA1(f)) && fnode_is_integer(FA2(f));
else
return fnode_is_rational(FA1(f)) && fnode_is_rational(FA2(f));
default:
return 0;
}
}
int fnode_is_integer(FNODE f)
{
Obj obj;
switch ( f->id ) {
case I_MINUS: case I_PAREN:
return fnode_is_integer(FA0(f));
case I_FORMULA:
obj = FA0(f);
if ( !obj ) return 1;
else if ( OID(obj) == O_QUOTE )
return fnode_is_integer(BDY((QUOTE)obj));
else if ( INT(obj)) return 1;
else return 0;
case I_BOP:
switch ( ((ARF)FA0(f))->name[0] ) {
case '^':
return fnode_is_integer(FA1(f))
&& fnode_is_nonnegative_integer(FA2(f));
case '/':
return fnode_is_integer(FA1(f)) &&
( fnode_is_one(FA2(f)) || fnode_is_minusone(FA2(f)) );
default:
return fnode_is_integer(FA1(f)) && fnode_is_integer(FA2(f));
}
break;
default:
return 0;
}
}
int fnode_is_zero(FNODE f)
{
Q n;
n = eval(f);
if ( !n ) return 1;
else return 0;
}
int fnode_is_nonnegative_integer(FNODE f)
{
Q n;
n = eval(f);
if ( !n || (INT(n) && SGN(n) > 0) ) return 1;
else return 0;
}
int fnode_is_one(FNODE f)
{
Q n;
n = eval(f);
if ( UNIQ(n) ) return 1;
else return 0;
}
int fnode_is_minusone(FNODE f)
{
Q n;
n = eval(f);
if ( MUNIQ(n) ) return 1;
else return 0;
}
int fnode_is_dependent(FNODE f,V v)
{
Obj obj;
FNODE arg;
NODE t;
switch ( f->id ) {
case I_MINUS: case I_PAREN:
return fnode_is_dependent(FA0(f),v);
case I_FORMULA:
obj = FA0(f);
if ( !obj ) return 0;
else if ( OID(obj) == O_QUOTE )
return fnode_is_dependent(BDY((QUOTE)obj),v);
else if ( obj_is_dependent(obj,v) ) return 1;
else return 0;
case I_BOP:
return fnode_is_dependent(FA1(f),v) || fnode_is_dependent(FA2(f),v);
case I_FUNC:
arg = (FNODE)FA1(f);
for ( t = FA0(arg); t; t = NEXT(t) )
if ( fnode_is_dependent(BDY(t),v) ) return 1;
return 0;
default:
return 0;
}
}
FNODE fnode_normalize(FNODE f)
{
FNODE a2,mone;
Q q;
NODE n;
switch ( f->id ) {
case I_PAREN:
return fnode_normalize(FA0(f));
case I_MINUS:
f = fnode_normalize(FA0(f));
return f->id==I_MINUS ? FA0(f) : mkfnode(1,I_MINUS,f);
case I_BOP:
/* arf fnode fnode */
f = fnode_apply(f,fnode_normalize);
switch ( ((ARF)FA0(f))->name[0] ) {
case '-':
a2 = mkfnode(1,I_MINUS,FA2(f));
return mkfnode(3,I_BOP,addfs,FA1(f),a2);
case '/':
STOQ(-1,q);
mone = mkfnode(1,I_FORMULA,q);
a2 = mkfnode(3,I_BOP,pwrfs,FA2(f),mone);
return mkfnode(3,I_BOP,mulfs,FA1(f),a2);
default:
return f;
}
break;
default:
return fnode_apply(f,fnode_normalize);
}
}
FNODE fnode_simplify_add(FNODE f);
FNODE fnode_simplify_mul(FNODE f);
FNODE fnode_normalize_nary(FNODE f)
{
NODE n;
switch ( f->id ) {
case I_PAREN:
return fnode_normalize_nary(FA0(f));
case I_MINUS:
f = fnode_normalize_nary(FA0(f));
return f->id==I_MINUS ? FA0(f) : mkfnode(1,I_MINUS,f);
case I_NARYOP:
f = fnode_apply(f,fnode_normalize_nary);
switch ( ((ARF)FA0(f))->name[0] ) {
/* XXX */
case '+':
return fnode_simplify_add(f);
case '*':
return fnode_simplify_mul(f);
default:
return f;
}
break;
default:
return fnode_apply(f,fnode_normalize_nary);
break;
}
}
FNODE fnode_apply(FNODE f,FNODE (*func)())
{
fid_spec_p spec;
FNODE r;
int i,n;
NODE t,t0,s;
get_fid_spec(f->id,&spec);
for ( n = 0; spec->type[n] != A_end; n++ );
NEWFNODE(r,n); r->id = f->id;
for ( i = 0; i < n; i++ ) {
switch ( spec->type[i] ) {
case A_fnode:
r->arg[i] = func(f->arg[i]);
break;
case A_node:
s = (NODE)f->arg[i];
for ( t0 = 0; s; s = NEXT(s) ) {
NEXTNODE(t0,t);
BDY(t) = (pointer)func((FNODE)BDY(s));
}
if ( t0 ) NEXT(t) = 0;
r->arg[i] = t0;
break;
default:
r->arg[i] = f->arg[i];
break;
}
}
return r;
}
NODE2 fnode_add_monomial(NODE2 s0,FNODE g);
FNODE fnode_simplify_add(FNODE f)
{
NODE n;
NODE r0,r,t,u;
NODE2 s,s0;
FNODE g,m;
QUOTE q;
n = (NODE)FA1(f);
s0 = 0;
for ( t = n; t; t = NEXT(t) ) {
g = (FNODE)BDY(t);
s0 = fnode_add_monomial(s0,g);
}
if ( !s0 )
return mkfnode(1,I_FORMULA,0);
else {
for ( s = s0, r0 = 0; s; s = NEXT(s) ) {
NEXTNODE(r0,r);
if ( UNIQ(s->body1) )
BDY(r) = s->body2;
else if ( MUNIQ(s->body1) )
BDY(r) = mkfnode(1,I_MINUS,s->body2);
else {
objtoquote(s->body1,&q);
m = (FNODE)s->body2;
if ( m->id == I_NARYOP && OPNAME(m) == '*' ) {
MKNODE(u,BDY(q),FA1(m)); FA1(m) = u;
BDY(r) = m;
} else {
u = mknode(2,BDY(q),m);
BDY(r) = mkfnode(2,I_NARYOP,mulfs,u);
}
}
}
if ( r0 ) NEXT(r) = 0;
if ( length(r0) == 1 )
return (FNODE)BDY(r0);
else
return mkfnode(2,I_NARYOP,FA0(f),r0);
}
}
NODE2 fnode_add_monomial(NODE2 r,FNODE g)
{
Num c,c1;
FNODE b;
NODE arg;
NODE2 prev,cur,t;
int a;
if ( fnode_is_number(g) ) {
c = (Num)eval(g);
b = mkfnode(1,I_FORMULA,ONE);
} else if ( g->id == I_NARYOP && OPNAME(g) == '*' ) {
arg = (NODE)FA1(g);
if ( fnode_is_number(BDY(arg)) ) {
c = (Num)eval(BDY(arg));
if ( length(arg) > 2 )
b = mkfnode(2,I_NARYOP,FA0(g),NEXT(arg));
else
b = BDY(NEXT(arg));
} else {
c = (Num)ONE;
b = g;
}
} else {
c = (Num)ONE;
b = g;
}
for ( prev = 0, cur = r; cur; prev = cur, cur = NEXT(cur) ) {
a = compfnode(b,cur->body2);
if ( a > 0 ) {
MKNODE2(t,c,b,cur);
if ( !prev )
return t;
else {
NEXT(prev) = t; return r;
}
} else if ( a == 0 ) {
addnum(0,cur->body1,c,&c1);
if ( !c1 ) {
if ( !prev )
return NEXT(cur);
else {
NEXT(prev) = NEXT(cur); return r;
}
} else {
cur->body1 = c1; return r;
}
}
}
MKNODE2(t,c,b,0);
if ( !r )
return t;
else {
NEXT(prev) = t; return r;
}
}
FNODE fnode_simplify_mul(FNODE f)
{
int l,i,j;
FNODE *b;
Obj *e;
NODE n,t,r,r1;
FNODE g,base;
QUOTE q;
Obj exp,exp1;
Num c,c1;
n = (NODE)FA1(f);
for ( l = 0, t = n; t; t = NEXT(t), l++ );
b = (FNODE *)MALLOC(l*sizeof(FNODE));
e = (Obj *)MALLOC(l*sizeof(Obj));
c = (Num)ONE;
for ( i = 0, t = n; t; t = NEXT(t) ) {
g = (FNODE)BDY(t);
if ( fnode_is_number(g) ) {
if ( fnode_is_zero(g) )
return mkfnode(1,I_FORMULA,0);
else {
mulnum(0,c,(Num)eval(g),&c1); c = c1;
}
} else {
if ( g->id == I_MINUS ) {
chsgnnum(c,&c1); c = c1;
g = FA0(g);
}
if ( g->id == I_BOP && ((ARF)FA0(g))->name[0] == '^' ) {
base = FA1(g);
exp = (Obj)eval(FA2(g));
} else {
base = g; exp = (Obj)ONE;
}
if ( i > 0 && !compfnode(b[i-1],base) ) {
arf_add(CO,e[i-1],exp,&exp1);
if ( !exp1 )
i--;
else
e[i-1] = exp1;
} else {
b[i] = base;
e[i] = exp;
i++;
}
}
}
if ( !i ) {
/* coeff only */
g = mkfnode(1,I_FORMULA,c);
return g;
} else {
r = 0;
for ( j = i-1; j >= 0; j-- ) {
if ( UNIQ(e[j]) )
g = b[j];
else {
objtoquote(e[j],&q);
g = mkfnode(3,I_BOP,pwrfs,b[j],BDY(q));
}
MKNODE(r1,g,r); r = r1;
}
g = mkfnode(1,I_FORMULA,c);
MKNODE(r1,g,r); r = r1;
return mkfnode(2,I_NARYOP,FA0(f),r);
}
}
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to strobj.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / builtin