version 1.4, 2001/04/20 02:34:21 |
version 1.9, 2004/12/17 03:09:08 |
|
|
* 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/pf.c,v 1.3 2000/08/22 05:03:59 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/pf.c,v 1.8 2004/06/27 03:15:57 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "math.h" |
#include "math.h" |
Line 66 void simplify_pow(PFINS,Obj *); |
|
Line 66 void simplify_pow(PFINS,Obj *); |
|
void Pfunctor(),Pargs(),Pfunargs(),Pvtype(),Pcall(),Pdeval(); |
void Pfunctor(),Pargs(),Pfunargs(),Pvtype(),Pcall(),Pdeval(); |
void Pregister_handler(); |
void Pregister_handler(); |
void Peval_quote(); |
void Peval_quote(); |
|
void Pmapat(); |
|
void Padd_handler(); |
|
void Plist_handler(); |
|
void Pclear_handler(); |
|
|
struct ftab puref_tab[] = { |
struct ftab puref_tab[] = { |
|
{"mapat",Pmapat,-99999999}, |
{"functor",Pfunctor,1}, |
{"functor",Pfunctor,1}, |
{"args",Pargs,1}, |
{"args",Pargs,1}, |
{"funargs",Pfunargs,1}, |
{"funargs",Pfunargs,1}, |
{"register_handler",Pregister_handler,1}, |
{"register_handler",Pregister_handler,1}, |
|
{"add_handler",Padd_handler,2}, |
|
{"list_handler",Plist_handler,1}, |
|
{"clear_handler",Pclear_handler,1}, |
{"call",Pcall,2}, |
{"call",Pcall,2}, |
{"vtype",Pvtype,1}, |
{"vtype",Pvtype,1}, |
{"deval",Pdeval,1}, |
{"deval",Pdeval,1}, |
Line 79 struct ftab puref_tab[] = { |
|
Line 87 struct ftab puref_tab[] = { |
|
{0,0,0}, |
{0,0,0}, |
}; |
}; |
|
|
#if PARI |
#if defined(PARI) |
int p_pi(),p_e(); |
int p_pi(),p_e(); |
int p_log(),p_exp(),p_pow(); |
int p_log(),p_exp(),p_pow(); |
int p_sin(),p_cos(),p_tan(),p_asin(),p_acos(),p_atan(); |
int p_sin(),p_cos(),p_tan(),p_asin(),p_acos(),p_atan(); |
|
|
pf = ins->pf; ad = ins->ad; a0 = ad[0].arg; a1 = ad[1].arg; |
pf = ins->pf; ad = ins->ad; a0 = ad[0].arg; a1 = ad[1].arg; |
if ( !a1 ) |
if ( !a1 ) |
*rp = (Obj)ONE; |
*rp = (Obj)ONE; |
else if ( !a0 ) |
else if ( !a0 ) { |
*rp = 0; |
if ( RATN(a1) && SGN((Q)a1)>0 ) |
else if ( NUM(a1) && INT(a1) ) |
*rp = 0; |
|
else if ( RATN(a1) && SGN((Q)a1) < 0 ) |
|
error("simplify_pow : division by 0"); |
|
else { |
|
instov(ins,&v); MKV(v,t); *rp = (Obj)t; |
|
} |
|
} else if ( NUM(a1) && INT(a1) ) |
arf_pwr(CO,a0,a1,rp); |
arf_pwr(CO,a0,a1,rp); |
else { |
else { |
instov(ins,&v); MKV(v,t); *rp = (Obj)t; |
instov(ins,&v); MKV(v,t); *rp = (Obj)t; |
|
|
else { |
else { |
ins = (PFINS)VR(p)->priv; pf = ins->pf; |
ins = (PFINS)VR(p)->priv; pf = ins->pf; |
t = (FUNC)MALLOC(sizeof(struct oFUNC)); |
t = (FUNC)MALLOC(sizeof(struct oFUNC)); |
t->name = pf->name; t->id = A_PURE; t->argc = pf->argc; |
t->name = t->fullname = pf->name; t->id = A_PURE; t->argc = pf->argc; |
t->f.puref = pf; |
t->f.puref = pf; |
makesrvar(t,rp); |
makesrvar(t,rp); |
} |
} |
|
|
else { |
else { |
ins = (PFINS)VR(p)->priv; ad = ins->ad; pf = ins->pf; |
ins = (PFINS)VR(p)->priv; ad = ins->ad; pf = ins->pf; |
t = (FUNC)MALLOC(sizeof(struct oFUNC)); |
t = (FUNC)MALLOC(sizeof(struct oFUNC)); |
t->name = pf->name; t->id = A_PURE; t->argc = pf->argc; |
t->name = t->fullname = pf->name; t->id = A_PURE; t->argc = pf->argc; |
t->f.puref = pf; |
t->f.puref = pf; |
makesrvar(t,&f); |
makesrvar(t,&f); |
n0 = 0; NEXTNODE(n0,n); BDY(n) = (pointer)f; |
n = n0 = 0; NEXTNODE(n0,n); BDY(n) = (pointer)f; |
for ( i = 0; i < pf->argc; i++ ) { |
for ( i = 0; i < pf->argc; i++ ) { |
NEXTNODE(n0,n); BDY(n) = (pointer)ad[i].arg; |
NEXTNODE(n0,n); BDY(n) = (pointer)ad[i].arg; |
} |
} |
|
|
STOQ((int)VR(p)->attr,*rp); |
STOQ((int)VR(p)->attr,*rp); |
} |
} |
|
|
extern FUNC registered_handler; |
extern NODE user_int_handler,user_quit_handler; |
|
|
void Pregister_handler(arg,rp) |
void Pregister_handler(arg,rp) |
NODE arg; |
NODE arg; |
|
|
{ |
{ |
P p; |
P p; |
V v; |
V v; |
|
NODE n; |
FUNC func; |
FUNC func; |
|
|
p = (P)ARG0(arg); |
p = (P)ARG0(arg); |
if ( !p ) |
if ( !p ) { |
registered_handler = 0; |
user_int_handler = 0; |
else if ( OID(p) != 2 ) |
*rp = 0; |
|
return; |
|
} else if ( OID(p) != 2 ) |
error("register_hanlder : invalid argument"); |
error("register_hanlder : invalid argument"); |
v = VR(p); |
v = VR(p); |
if ( (int)v->attr != V_SR ) |
if ( (int)v->attr != V_SR ) |
|
|
if ( func->argc ) |
if ( func->argc ) |
error("register_hanlder : the function must be with no argument"); |
error("register_hanlder : the function must be with no argument"); |
else { |
else { |
registered_handler = func; |
MKNODE(n,(pointer)func,user_int_handler); |
|
user_int_handler = n; |
*rp = ONE; |
*rp = ONE; |
} |
} |
} |
} |
} |
} |
|
|
void Pcall(arg,rp) |
void Padd_handler(arg,rp) |
NODE arg; |
NODE arg; |
Obj *rp; |
Q *rp; |
{ |
{ |
P p; |
P p; |
V v; |
V v; |
|
NODE n; |
|
FUNC func; |
|
char *name; |
|
NODE *hlistp; |
|
|
|
asir_assert(ARG0(arg),O_STR,"add_handler"); |
|
name = BDY((STRING)ARG0(arg)); |
|
p = (P)ARG1(arg); |
|
if ( !strcmp(name,"intr") ) |
|
hlistp = &user_int_handler; |
|
else if ( !strcmp(name,"quit") ) |
|
hlistp = &user_quit_handler; |
|
else |
|
error("add_handler : invalid keyword (must be \"intr\" or \"quit\")"); |
|
if ( !p ) { |
|
*hlistp = 0; *rp = 0; |
|
return; |
|
} |
|
if ( OID(p) == 2 ) { |
|
v = VR(p); |
|
if ( (int)v->attr != V_SR ) |
|
error("add_hanlder : no such function"); |
|
func = (FUNC)v->priv; |
|
} else if ( OID(p) == O_STR ) { |
|
gen_searchf_searchonly(BDY((STRING)p),&func); |
|
if ( !func ) |
|
error("add_hanlder : no such function"); |
|
} |
|
if ( func->argc ) |
|
error("register_hanlder : the function must be with no argument"); |
|
else { |
|
MKNODE(n,(pointer)func,*hlistp); |
|
*hlistp = n; |
|
*rp = ONE; |
|
} |
|
} |
|
|
|
void Plist_handler(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
NODE r0,r,t; |
|
char *name; |
|
NODE hlist; |
|
STRING fname; |
|
|
|
asir_assert(ARG0(arg),O_STR,"list_handler"); |
|
name = BDY((STRING)ARG0(arg)); |
|
if ( !strcmp(name,"intr") ) |
|
hlist = user_int_handler; |
|
else if ( !strcmp(name,"quit") ) |
|
hlist = user_quit_handler; |
|
else |
|
error("list_handler : invalid keyword (must be \"intr\" or \"quit\")"); |
|
for ( r0 = 0, t = hlist; t; t = NEXT(t) ) { |
|
NEXTNODE(r0,r); |
|
MKSTR(fname,((FUNC)BDY(t))->fullname); |
|
BDY(r) = (pointer)fname; |
|
} |
|
if ( r0 ) NEXT(r) = 0; |
|
MKLIST(*rp,r0); |
|
} |
|
|
|
void Pclear_handler(arg,rp) |
|
NODE arg; |
|
Q *rp; |
|
{ |
|
NODE r0,r,t; |
|
char *name; |
|
NODE hlist; |
|
STRING fname; |
|
|
|
asir_assert(ARG0(arg),O_STR,"clear_handler"); |
|
name = BDY((STRING)ARG0(arg)); |
|
if ( !strcmp(name,"intr") ) |
|
user_int_handler = 0; |
|
else if ( !strcmp(name,"quit") ) |
|
user_quit_handler = 0; |
|
else |
|
error("clear_handler : invalid keyword (must be \"intr\" or \"quit\")"); |
|
*rp = 0; |
|
} |
|
|
|
void Pcall(NODE arg,Obj *rp) |
|
{ |
|
P p; |
|
V v; |
|
|
p = (P)ARG0(arg); |
p = (P)ARG0(arg); |
if ( !p || OID(p) != 2 ) |
if ( !p || OID(p) != 2 ) |
error("call : invalid argument"); |
error("call : invalid argument"); |
|
|
|
|
else |
else |
*rp = (Obj)bevalf((FUNC)v->priv,BDY((LIST)ARG1(arg))); |
*rp = (Obj)bevalf((FUNC)v->priv,BDY((LIST)ARG1(arg))); |
|
} |
|
|
|
/* at=position of arg to be used for iteration */ |
|
|
|
void Pmapat(NODE arg,Obj *rp) |
|
{ |
|
LIST args; |
|
NODE node,rest,t0,t,n,r,r0; |
|
P fpoly; |
|
V fvar; |
|
FUNC f; |
|
VECT v,rv; |
|
MAT m,rm; |
|
LIST rl; |
|
int len,row,col,i,j,pos; |
|
Obj iter; |
|
pointer val; |
|
|
|
if ( argc(arg) < 3 ) |
|
error("mapat : too few arguments"); |
|
|
|
fpoly = (P)ARG0(arg); |
|
if ( !fpoly || OID(fpoly) != O_P ) |
|
error("mapat : invalid function specification"); |
|
fvar = VR(fpoly); |
|
if ( fvar->attr != (pointer)V_SR || !(f=(FUNC)fvar->priv) ) |
|
error("mapat : invalid function specification"); |
|
if ( !INT(ARG1(arg)) ) |
|
error("mapat : invalid position"); |
|
pos = QTOS((Q)ARG1(arg)); |
|
node = NEXT(NEXT(arg)); |
|
len = length(node); |
|
if ( pos >= len ) |
|
error("evalmapatf : invalid position"); |
|
r0 = 0; |
|
for ( i = 0, t = node; i < pos; i++, t = NEXT(t) ) { |
|
NEXTNODE(r0,r); |
|
BDY(r) = BDY(t); |
|
} |
|
NEXTNODE(r0,r); |
|
iter = BDY(t); rest = NEXT(t); |
|
if ( !iter ) { |
|
*rp = bevalf(f,node); |
|
return; |
|
} |
|
switch ( OID(iter) ) { |
|
case O_VECT: |
|
v = (VECT)iter; len = v->len; MKVECT(rv,len); |
|
for ( i = 0; i < len; i++ ) { |
|
BDY(r) = BDY(v)[i]; NEXT(r) = rest; |
|
BDY(rv)[i] = bevalf(f,r0); |
|
} |
|
*rp = (Obj)rv; |
|
break; |
|
case O_MAT: |
|
m = (MAT)iter; row = m->row; col = m->col; MKMAT(rm,row,col); |
|
for ( i = 0; i < row; i++ ) |
|
for ( j = 0; j < col; j++ ) { |
|
BDY(r) = BDY(m)[i][j]; NEXT(r) = rest; |
|
BDY(rm)[i][j] = bevalf(f,r0); |
|
} |
|
*rp = (Obj)rm; |
|
break; |
|
case O_LIST: |
|
n = BDY((LIST)iter); |
|
for ( t0 = t = 0; n; n = NEXT(n) ) { |
|
BDY(r) = BDY(n); NEXT(r) = rest; |
|
NEXTNODE(t0,t); BDY(t) = bevalf(f,r0); |
|
} |
|
if ( t0 ) |
|
NEXT(t) = 0; |
|
MKLIST(rl,t0); |
|
*rp = (Obj)rl; |
|
break; |
|
default: |
|
*rp = bevalf(f,node); |
|
break; |
|
} |
} |
} |
|
|
void Pdeval(arg,rp) |
void Pdeval(arg,rp) |