=================================================================== RCS file: /home/cvs/OpenXM_contrib2/asir2000/builtin/var.c,v retrieving revision 1.2 retrieving revision 1.7 diff -u -p -r1.2 -r1.7 --- OpenXM_contrib2/asir2000/builtin/var.c 2000/08/21 08:31:21 1.2 +++ OpenXM_contrib2/asir2000/builtin/var.c 2012/02/03 06:42:34 1.7 @@ -23,7 +23,7 @@ * 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@flab.fujitsu.co.jp of the detailed specification + * 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. * @@ -45,27 +45,59 @@ * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. * - * $OpenXM: OpenXM_contrib2/asir2000/builtin/var.c,v 1.1.1.1 1999/12/03 07:39:07 noro Exp $ + * $OpenXM: OpenXM_contrib2/asir2000/builtin/var.c,v 1.6 2006/08/09 10:08:46 noro Exp $ */ #include "ca.h" #include "parse.h" -void Pvar(), Pvars(), Puc(), Pvars_recursive(); -void get_vars(Obj,VL *); -void get_vars_recursive(Obj,VL *); +void Pvar(), Pvars(), Puc(), Pvars_recursive(),Psimple_is_eq(); struct ftab var_tab[] = { {"var",Pvar,1}, {"vars",Pvars,1}, {"vars_recursive",Pvars_recursive,1}, {"uc",Puc,0}, + {"simple_is_eq",Psimple_is_eq,2}, {0,0,0}, }; -void Pvar(arg,rp) -NODE arg; -Obj *rp; +void Psimple_is_eq(NODE arg,Q *rp) { + int ret; + + ret = is_eq(ARG0(arg),ARG1(arg)); + STOQ(ret,*rp); +} + +int is_eq(Obj a0,Obj a1) +{ + P p0,p1; + DCP dc0,dc1; + + if ( !a0 ) return a1?0:1; + else if ( !a1 ) return 0; + else if ( OID(a0) != OID(a1) ) return 0; + else { + switch ( OID(a0) ) { + case O_P: + p0 = (P)a0; p1 = (P)a1; + if ( VR(p0) == VR(p1) ) { + for ( dc0 = DC(p0), dc1 = DC(p1); dc0 && dc1; dc0 = NEXT(dc0), dc1 = NEXT(dc1) ) { + if ( cmpq(DEG(dc0),DEG(dc1)) ) return 0; + if ( !is_eq((Obj)COEF(dc0),(Obj)COEF(dc1)) ) return 0; + } + return (dc0||dc1)?0:1; + } else return 0; + break; + default: + return !arf_comp(CO,a0,a1); + break; + } + } +} + +void Pvar(NODE arg,Obj *rp) +{ Obj t; P p; V vn,vd,v; @@ -90,9 +122,7 @@ Obj *rp; *rp = 0; } -void Pvars(arg,rp) -NODE arg; -LIST *rp; +void Pvars(NODE arg,LIST *rp) { VL vl; NODE n,n0; @@ -107,9 +137,7 @@ LIST *rp; MKLIST(*rp,n0); } -void Pvars_recursive(arg,rp) -NODE arg; -LIST *rp; +void Pvars_recursive(NODE arg,LIST *rp) { VL vl; NODE n,n0; @@ -124,9 +152,7 @@ LIST *rp; MKLIST(*rp,n0); } -void get_vars_recursive(obj,vlp) -Obj obj; -VL *vlp; +void get_vars_recursive(Obj obj,VL *vlp) { VL vl,vl0,vl1,vl2,t; PFINS ins; @@ -148,9 +174,7 @@ VL *vlp; mergev(CO,vl,vl0,vlp); } -void get_vars(t,vlp) -Obj t; -VL *vlp; +void get_vars(Obj t,VL *vlp) { pointer *vb; pointer **mb; @@ -194,26 +218,38 @@ VL *vlp; vl = vl2; } break; + case O_NBP: + n = BDY((NBP)t); + for ( vl = 0; n; n = NEXT(n) ) { + get_vars((Obj)(((NBM)BDY(n))->c),&vl1); + mergev(CO,vl,vl1,&vl2); + vl = vl2; + } + break; default: vl = 0; break; } *vlp = vl; } -void Puc(p) -Obj *p; +void Puc(Obj *p) { VL vl; V v; P t; char buf[BUFSIZ]; + char *n,*nv; static int UCN; NEWV(v); v->attr = (pointer)V_UC; sprintf(buf,"_%d",UCN++); - NAME(v) = (char *)CALLOC(strlen(buf)+1,sizeof(char)); + nv = NAME(v) = (char *)CALLOC(strlen(buf)+1,sizeof(char)); strcpy(NAME(v),buf); - for ( vl = CO; NEXT(vl); vl = NEXT(vl) ); - NEWVL(NEXT(vl)); VR(NEXT(vl)) = v; NEXT(NEXT(vl)) = 0; + for ( vl = CO; vl; vl = NEXT(vl) ) + if ( (n=NAME(VR(vl))) && !strcmp(n,nv) ) break; + else if ( !NEXT(vl) ) { + NEWVL(NEXT(vl)); VR(NEXT(vl)) = v; NEXT(NEXT(vl)) = 0; + break; + } MKV(v,t); *p = (Obj)t; }