=================================================================== RCS file: /home/cvs/OpenXM_contrib2/asir2000/builtin/var.c,v retrieving revision 1.2 retrieving revision 1.10 diff -u -p -r1.2 -r1.10 --- OpenXM_contrib2/asir2000/builtin/var.c 2000/08/21 08:31:21 1.2 +++ OpenXM_contrib2/asir2000/builtin/var.c 2018/03/29 01:32:50 1.10 @@ -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,175 +45,238 @@ * 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.9 2018/03/27 06:29:19 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(); +void Pdelete_uc(); struct ftab var_tab[] = { - {"var",Pvar,1}, - {"vars",Pvars,1}, - {"vars_recursive",Pvars_recursive,1}, - {"uc",Puc,0}, - {0,0,0}, + {"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 Pvar(arg,rp) -NODE arg; -Obj *rp; +void Psimple_is_eq(NODE arg,Q *rp) { - Obj t; - P p; - V vn,vd,v; - VL vl; + int ret; - if ( !(t = (Obj)ARG0(arg)) ) - v = 0; - else - switch ( OID(t) ) { - case O_P: - v = VR((P)t); break; - case O_R: - vn = VR(NM((R)t)); vd = VR(DN((R)t)); - for ( vl = CO; (vl->v != vn) && (vl->v != vd); vl = NEXT(vl) ); - v = vl->v; break; - default: - v = 0; break; - } - if ( v ) { - MKV(v,p); *rp = (Obj)p; - } else - *rp = 0; + ret = is_eq(ARG0(arg),ARG1(arg)); + STOQ(ret,*rp); } -void Pvars(arg,rp) -NODE arg; -LIST *rp; +int is_eq(Obj a0,Obj a1) { - VL vl; - NODE n,n0; - P p; + P p0,p1; + DCP dc0,dc1; - get_vars((Obj)ARG0(arg),&vl); - for ( n0 = 0; vl; vl = NEXT(vl) ) { - NEXTNODE(n0,n); MKV(vl->v,p); BDY(n) = (pointer)p; - } - if ( n0 ) - NEXT(n) = 0; - MKLIST(*rp,n0); + 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 Pvars_recursive(arg,rp) -NODE arg; -LIST *rp; +void Pvar(NODE arg,Obj *rp) { - VL vl; - NODE n,n0; - P p; + Obj t; + P p; + V vn,vd,v; + VL vl; - get_vars_recursive((Obj)ARG0(arg),&vl); - for ( n0 = 0; vl; vl = NEXT(vl) ) { - NEXTNODE(n0,n); MKV(vl->v,p); BDY(n) = (pointer)p; - } - if ( n0 ) - NEXT(n) = 0; - MKLIST(*rp,n0); + if ( !(t = (Obj)ARG0(arg)) ) + v = 0; + else + switch ( OID(t) ) { + case O_P: + v = VR((P)t); break; + case O_R: + vn = VR(NM((R)t)); vd = VR(DN((R)t)); + for ( vl = CO; (vl->v != vn) && (vl->v != vd); vl = NEXT(vl) ); + v = vl->v; break; + default: + v = 0; break; + } + if ( v ) { + MKV(v,p); *rp = (Obj)p; + } else + *rp = 0; } -void get_vars_recursive(obj,vlp) -Obj obj; -VL *vlp; +void Pvars(NODE arg,LIST *rp) { - VL vl,vl0,vl1,vl2,t; - PFINS ins; - int argc,i; - PFAD ad; + VL vl; + NODE n,n0; + P p; - get_vars(obj,&vl); - vl0 = 0; - for ( t = vl; t; t = NEXT(t) ) - if ( t->v->attr == (pointer)V_PF ) { - ins = (PFINS)t->v->priv; - argc = ins->pf->argc; - ad = ins->ad; - for ( i = 0; i < argc; i++ ) { - get_vars_recursive(ad[i].arg,&vl1); - mergev(CO,vl0,vl1,&vl2); vl0 = vl2; - } - } - mergev(CO,vl,vl0,vlp); + get_vars((Obj)ARG0(arg),&vl); + for ( n0 = 0; vl; vl = NEXT(vl) ) { + NEXTNODE(n0,n); MKV(vl->v,p); BDY(n) = (pointer)p; + } + if ( n0 ) + NEXT(n) = 0; + MKLIST(*rp,n0); } -void get_vars(t,vlp) -Obj t; -VL *vlp; +void Pvars_recursive(NODE arg,LIST *rp) { - pointer *vb; - pointer **mb; - VL vl,vl1,vl2; - NODE n; - MP mp; - int i,j,row,col,len; + VL vl; + NODE n,n0; + P p; - if ( !t ) - vl = 0; - else - switch ( OID(t) ) { - case O_P: case O_R: - clctvr(CO,t,&vl); break; - case O_VECT: - len = ((VECT)t)->len; vb = BDY((VECT)t); - for ( i = 0, vl = 0; i < len; i++ ) { - get_vars((Obj)vb[i],&vl1); mergev(CO,vl,vl1,&vl2); - vl = vl2; - } - break; - case O_MAT: - row = ((MAT)t)->row; col = ((MAT)t)->col; mb = BDY((MAT)t); - for ( i = 0, vl = 0; i < row; i++ ) - for ( j = 0; j < col; j++ ) { - get_vars((Obj)mb[i][j],&vl1); mergev(CO,vl,vl1,&vl2); - vl = vl2; - } - break; - case O_LIST: - n = BDY((LIST)t); - for ( vl = 0; n; n = NEXT(n) ) { - get_vars((Obj)BDY(n),&vl1); mergev(CO,vl,vl1,&vl2); - vl = vl2; - } - break; - case O_DP: - mp = ((DP)t)->body; - for ( vl = 0; mp; mp = NEXT(mp) ) { - get_vars((Obj)mp->c,&vl1); mergev(CO,vl,vl1,&vl2); - vl = vl2; - } - break; - default: - vl = 0; break; - } - *vlp = vl; + get_vars_recursive((Obj)ARG0(arg),&vl); + for ( n0 = 0; vl; vl = NEXT(vl) ) { + NEXTNODE(n0,n); MKV(vl->v,p); BDY(n) = (pointer)p; + } + if ( n0 ) + NEXT(n) = 0; + MKLIST(*rp,n0); } -void Puc(p) -Obj *p; +void get_vars_recursive(Obj obj,VL *vlp) { - VL vl; - V v; - P t; - char buf[BUFSIZ]; - static int UCN; + VL vl,vl0,vl1,vl2,t; + PFINS ins; + int argc,i; + PFAD ad; - NEWV(v); v->attr = (pointer)V_UC; - sprintf(buf,"_%d",UCN++); - 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; - MKV(v,t); *p = (Obj)t; + get_vars(obj,&vl); + vl0 = 0; + for ( t = vl; t; t = NEXT(t) ) + if ( t->v->attr == (pointer)V_PF ) { + ins = (PFINS)t->v->priv; + argc = ins->pf->argc; + ad = ins->ad; + for ( i = 0; i < argc; i++ ) { + get_vars_recursive(ad[i].arg,&vl1); + mergev(CO,vl0,vl1,&vl2); vl0 = vl2; + } + } + mergev(CO,vl,vl0,vlp); +} + +void get_vars(Obj t,VL *vlp) +{ + pointer *vb; + pointer **mb; + VL vl,vl1,vl2; + NODE n; + MP mp; + int i,j,row,col,len; + + if ( !t ) + vl = 0; + else + switch ( OID(t) ) { + case O_P: case O_R: + clctvr(CO,t,&vl); break; + case O_VECT: + len = ((VECT)t)->len; vb = BDY((VECT)t); + for ( i = 0, vl = 0; i < len; i++ ) { + get_vars((Obj)vb[i],&vl1); mergev(CO,vl,vl1,&vl2); + vl = vl2; + } + break; + case O_MAT: + row = ((MAT)t)->row; col = ((MAT)t)->col; mb = BDY((MAT)t); + for ( i = 0, vl = 0; i < row; i++ ) + for ( j = 0; j < col; j++ ) { + get_vars((Obj)mb[i][j],&vl1); mergev(CO,vl,vl1,&vl2); + vl = vl2; + } + break; + case O_LIST: + n = BDY((LIST)t); + for ( vl = 0; n; n = NEXT(n) ) { + get_vars((Obj)BDY(n),&vl1); mergev(CO,vl,vl1,&vl2); + vl = vl2; + } + break; + case O_DP: + mp = ((DP)t)->body; + for ( vl = 0; mp; mp = NEXT(mp) ) { + get_vars((Obj)mp->c,&vl1); mergev(CO,vl,vl1,&vl2); + 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(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++); + nv = NAME(v) = (char *)CALLOC(strlen(buf)+1,sizeof(char)); + strcpy(NAME(v),buf); + 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; + LASTCO = NEXT(vl); + 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; + } + update_LASTCO(); + *p = 0; }