=================================================================== RCS file: /home/cvs/OpenXM_contrib2/asir2000/builtin/var.c,v retrieving revision 1.5 retrieving revision 1.8 diff -u -p -r1.5 -r1.8 --- OpenXM_contrib2/asir2000/builtin/var.c 2005/10/26 07:33:03 1.5 +++ OpenXM_contrib2/asir2000/builtin/var.c 2015/12/02 13:12:31 1.8 @@ -45,21 +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.4 2001/10/09 01:36:07 noro Exp $ + * $OpenXM: OpenXM_contrib2/asir2000/builtin/var.c,v 1.7 2012/02/03 06:42:34 noro Exp $ */ #include "ca.h" #include "parse.h" -void Pvar(), Pvars(), Puc(), Pvars_recursive(); +void Pvar(), Pvars(), Puc(), Pvars_recursive(),Psimple_is_eq(); +void Pdelete_uc(); struct ftab var_tab[] = { {"var",Pvar,1}, {"vars",Pvars,1}, {"vars_recursive",Pvars_recursive,1}, {"uc",Puc,0}, + {"delete_uc",Pdelete_uc,-1}, + {"simple_is_eq",Psimple_is_eq,2}, {0,0,0}, }; +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; @@ -182,6 +220,14 @@ void get_vars(Obj t,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; } @@ -208,4 +254,27 @@ void Puc(Obj *p) break; } MKV(v,t); *p = (Obj)t; +} + +void Pdelete_uc(NODE arg,Obj *p) +{ + VL vl,prev; + V v; + + if ( argc(arg) == 1 ) { + asir_assert(ARG0(arg),O_P,"delete_uc"); + v = VR((P)ARG0(arg)); + } else + v = 0; + + for ( prev = 0, vl = CO; vl; vl = NEXT(vl) ) { + if ( (!v || v == vl->v) && vl->v->attr == (pointer)V_UC ) { + if ( prev == 0 ) + CO = NEXT(vl); + else + NEXT(prev) = NEXT(vl); + } else + prev = vl; + } + *p = 0; }