=================================================================== RCS file: /home/cvs/OpenXM_contrib2/asir2000/engine/dist.c,v retrieving revision 1.46 retrieving revision 1.51 diff -u -p -r1.46 -r1.51 --- OpenXM_contrib2/asir2000/engine/dist.c 2013/11/05 02:55:03 1.46 +++ OpenXM_contrib2/asir2000/engine/dist.c 2015/09/24 04:43:13 1.51 @@ -45,7 +45,7 @@ * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. * - * $OpenXM: OpenXM_contrib2/asir2000/engine/dist.c,v 1.45 2012/12/17 07:20:44 noro Exp $ + * $OpenXM: OpenXM_contrib2/asir2000/engine/dist.c,v 1.50 2014/10/10 09:02:25 noro Exp $ */ #include "ca.h" @@ -71,6 +71,9 @@ int (*cmpdl)()=cmpdl_revgradlex; int (*cmpdl_tie_breaker)(); int (*primitive_cmpdl[3])() = {cmpdl_revgradlex,cmpdl_gradlex,cmpdl_lex}; +Obj current_top_weight; +int current_top_weight_len; + int do_weyl; int dp_nelim,dp_fcoeffs; @@ -82,6 +85,8 @@ void comm_muld_trunc(VL vl,DP p1,DP p2,DL dl,DP *pr); void comm_quod(VL vl,DP p1,DP p2,DP *pr); void muldm_trunc(VL vl,DP p,MP m0,DL dl,DP *pr); void muldc_trunc(VL vl,DP p,P c,DL dl,DP *pr); +int create_order_spec(VL vl,Obj obj,struct order_spec **specp); +void create_modorder_spec(int id,LIST shift,struct modorder_spec **s); void order_init() { @@ -92,6 +97,8 @@ void order_init() create_modorder_spec(0,0,&dp_current_modspec); } +int has_sfcoef_p(P f); + int has_sfcoef(DP f) { MP t; @@ -120,12 +127,21 @@ int has_sfcoef_p(P f) } } -extern N *current_top_weight_vector; -static int current_top_weight_len; +extern Obj nd_top_weight; +void reset_top_weight() +{ + cmpdl = cmpdl_tie_breaker; + cmpdl_tie_breaker = 0; + nd_top_weight = 0; + current_top_weight = 0; + current_top_weight_len = 0; +} + void initd(struct order_spec *spec) { - int len,i; + int len,i,k,row; + Q **mat; switch ( spec->id ) { case 3: @@ -172,12 +188,20 @@ void initd(struct order_spec *spec) } break; } - if ( current_top_weight_vector ) { + if ( current_top_weight ) { cmpdl_tie_breaker = cmpdl; cmpdl = cmpdl_top_weight; - for ( len = 0, i = 0; i < spec->nv; i++ ) - if ( current_top_weight_vector[i] ) - len = MAX(PL(current_top_weight_vector[i]),len); + if ( OID(current_top_weight) == O_VECT ) { + mat = (Q **)&BDY((VECT)current_top_weight); + row = 1; + } else { + mat = (Q **)BDY((MAT)current_top_weight); + row = ((MAT)current_top_weight)->row; + } + for ( k = 0, len = 0; k < row; k++ ) + for ( i = 0; i < spec->nv; i++ ) + if ( mat[k][i] ) + len = MAX(PL(NM(mat[k][i])),len); current_top_weight_len = len; } dp_current_spec = spec; @@ -185,7 +209,6 @@ void initd(struct order_spec *spec) void ptod(VL vl,VL dvl,P p,DP *pr) { - int isconst = 0; int n,i,j,k; VL tvl; V v; @@ -313,7 +336,7 @@ int sugard(MP m) void addd(VL vl,DP p1,DP p2,DP *pr) { int n; - MP m1,m2,mr,mr0; + MP m1,m2,mr=0,mr0; P t; DL d; @@ -373,7 +396,7 @@ void addd(VL vl,DP p1,DP p2,DP *pr) void symb_addd(DP p1,DP p2,DP *pr) { int n; - MP m1,m2,mr,mr0; + MP m1,m2,mr=0,mr0; if ( !p1 ) *pr = p2; @@ -424,8 +447,7 @@ void symb_addd(DP p1,DP p2,DP *pr) NODE symb_merge(NODE m1,NODE m2,int n) { - NODE top,prev,cur,m,t; - int c,i; + NODE top=0,prev,cur,m=0,t; DL d1,d2; if ( !m1 ) @@ -610,7 +632,7 @@ void subd(VL vl,DP p1,DP p2,DP *pr) void chsgnd(DP p,DP *pr) { - MP m,mr,mr0; + MP m,mr=0,mr0; Obj r; if ( !p ) @@ -711,7 +733,7 @@ void comm_muld_trunc(VL vl,DP p1,DP p2,DL dl,DP *pr) void comm_quod(VL vl,DP p1,DP p2,DP *pr) { - MP m,m0; + MP m=0,m0; DP s,t; int i,n,sugar; DL d1,d2,d; @@ -752,7 +774,7 @@ void comm_quod(VL vl,DP p1,DP p2,DP *pr) void muldm(VL vl,DP p,MP m0,DP *pr) { - MP m,mr,mr0; + MP m,mr=0,mr0; P c; DL d; int n; @@ -777,7 +799,7 @@ void muldm(VL vl,DP p,MP m0,DP *pr) void muldm_trunc(VL vl,DP p,MP m0,DL dl,DP *pr) { - MP m,mr,mr0; + MP m,mr=0,mr0; P c; DL d,tdl; int n,i; @@ -843,6 +865,54 @@ void weyl_muld(VL vl,DP p1,DP p2,DP *pr) } } +void actm(VL vl,int nv,MP m1,MP m2,DP *pr) +{ + DL d1,d2,d; + int n2,i,j,k; + Q jq,c,c1; + MP m; + P t; + + d1 = m1->dl; + d2 = m2->dl; + for ( i = 0; i < nv; i++ ) + if ( d1->d[i] > d2->d[i] ) { + *pr = 0; return; + } + NEWDL(d,nv); + c = ONE; + for ( i = 0; i < nv; i++ ) { + for ( j = d2->d[i], k = d1->d[i]; k > 0; k--, j-- ) { + STOQ(j,jq); mulq(c,jq,&c1); c = c1; + } + d->d[i] = d2->d[i]-d1->d[i]; + } + mulp(vl,C(m1),C(m2),&t); + NEWMP(m); + mulp(vl,(P)c,t,&C(m)); + m->dl = d; + MKDP(nv,m,*pr); +} + +void weyl_actd(VL vl,DP p1,DP p2,DP *pr) +{ + int n; + MP m1,m2; + DP d,r,s; + + if ( !p1 || !p2 ) *pr = 0; + else { + n = NV(p1); + r = 0; + for ( m1 = BDY(p1); m1; m1 = NEXT(m1) ) + for ( m2 = BDY(p2); m2; m2 = NEXT(m2) ) { + actm(vl,n,m1,m2,&d); + addd(vl,r,d,&s); r = s; + } + *pr = r; + } +} + /* monomial * polynomial */ void weyl_muldm(VL vl,MP m0,DP p,DP *pr) @@ -1029,7 +1099,7 @@ void comm_muld_tab(VL vl,int nv,struct cdl *t,int n,st void muldc(VL vl,DP p,P c,DP *pr) { - MP m,mr,mr0; + MP m,mr=0,mr0; if ( !p || !c ) *pr = 0; @@ -1054,7 +1124,7 @@ void muldc(VL vl,DP p,P c,DP *pr) void muldc_trunc(VL vl,DP p,P c,DL dl,DP *pr) { - MP m,mr,mr0; + MP m,mr=0,mr0; DL mdl; int i,n; @@ -1083,7 +1153,7 @@ void muldc_trunc(VL vl,DP p,P c,DL dl,DP *pr) void divsdc(VL vl,DP p,P c,DP *pr) { - MP m,mr,mr0; + MP m,mr=0,mr0; if ( !c ) error("disvsdc : division by 0"); @@ -1130,9 +1200,10 @@ int compd(VL vl,DP p1,DP p2) return p2 ? -1 : 0; else if ( !p2 ) return 1; - else if ( NV(p1) != NV(p2) ) + else if ( NV(p1) != NV(p2) ) { error("compd : size mismatch"); - else { + return 0; /* XXX */ + } else { for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2); m1 && m2; m1 = NEXT(m1), m2 = NEXT(m2) ) if ( (t = (*cmpdl)(n,m1->dl,m2->dl)) || @@ -1253,7 +1324,7 @@ int cmpdl_blex(int n,DL d1,DL d2) { int c; - if ( c = cmpdl_lex(n-1,d1,d2) ) + if ( (c = cmpdl_lex(n-1,d1,d2)) ) return c; else { c = d1->d[n-1] - d2->d[n-1]; @@ -1458,8 +1529,8 @@ int cmpdl_drl_zigzag(int n,DL d1,DL d2) else { m = n>>1; for ( i= m - 1, p1 = d1->d, p2 = d2->d; i >= 0; i-- ) { - if ( t = p1[m+i] - p2[m+i] ) return t > 0 ? -1 : 1; - if ( t = p1[i] - p2[i] ) return t > 0 ? -1 : 1; + if ( (t = p1[m+i] - p2[m+i]) ) return t > 0 ? -1 : 1; + if ( (t = p1[i] - p2[i]) ) return t > 0 ? -1 : 1; } return 0; } @@ -1493,8 +1564,8 @@ int cmpdl_homo_ww_drl_zigzag(int n,DL d1,DL d2) return -1; for ( i= m - 1, p1 = d1->d, p2 = d2->d; i >= 0; i-- ) { - if ( t = p1[m+i] - p2[m+i] ) return t > 0 ? -1 : 1; - if ( t = p1[i] - p2[i] ) return t > 0 ? -1 : 1; + if ( (t = p1[m+i] - p2[m+i]) ) return t > 0 ? -1 : 1; + if ( (t = p1[i] - p2[i]) ) return t > 0 ? -1 : 1; } return 0; } @@ -1653,9 +1724,10 @@ int cmpdl_top_weight(int n,DL d1,DL d2) { int *w; N sum,wm,wma,t; - N *a; + Q **mat; + Q *a; struct oN tn; - int len,i,sgn,tsgn; + int len,i,sgn,tsgn,row,k; int *t1,*t2; w = (int *)ALLOCA(n*sizeof(int)); @@ -1665,32 +1737,41 @@ int cmpdl_top_weight(int n,DL d1,DL d2) sum = (N)W_ALLOC(len); sgn = 0; wm = (N)W_ALLOC(len); wma = (N)W_ALLOC(len); - a = current_top_weight_vector; - for ( i = 0; i < n; i++ ) { - if ( !a[i] || !w[i] ) continue; - tn.p = 1; - if ( w[i] > 0 ) { - tn.b[0] = w[i]; tsgn = 1; - } else { - tn.b[0] = -w[i]; tsgn = -1; - } - _muln(a[i],&tn,wm); - if ( !sgn ) { - sgn = tsgn; - t = wm; wm = sum; sum = t; - } else if ( sgn == tsgn ) { - _addn(sum,wm,wma); - if ( !PL(wma) ) - sgn = 0; - t = wma; wma = sum; sum = t; - } else { - sgn *= _subn(sum,wm,wma); - t = wma; wma = sum; sum = t; - } + if ( OID(current_top_weight) == O_VECT ) { + mat = (Q **)&BDY((VECT)current_top_weight); + row = 1; + } else { + mat = (Q **)BDY((MAT)current_top_weight); + row = ((MAT)current_top_weight)->row; } - if ( sgn > 0 ) return 1; - else if ( sgn < 0 ) return -1; - else return (*cmpdl_tie_breaker)(n,d1,d2); + for ( k = 0; k < row; k++ ) { + a = mat[k]; + for ( i = 0; i < n; i++ ) { + if ( !a[i] || !w[i] ) continue; + tn.p = 1; + if ( w[i] > 0 ) { + tn.b[0] = w[i]; tsgn = 1; + } else { + tn.b[0] = -w[i]; tsgn = -1; + } + _muln(NM(a[i]),&tn,wm); + if ( !sgn ) { + sgn = tsgn; + t = wm; wm = sum; sum = t; + } else if ( sgn == tsgn ) { + _addn(sum,wm,wma); + if ( !PL(wma) ) + sgn = 0; + t = wma; wma = sum; sum = t; + } else { + sgn *= _subn(sum,wm,wma); + t = wma; wma = sum; sum = t; + } + } + if ( sgn > 0 ) return 1; + else if ( sgn < 0 ) return -1; + } + return (*cmpdl_tie_breaker)(n,d1,d2); } GeoBucket create_bucket() @@ -1702,6 +1783,8 @@ GeoBucket create_bucket() return g; } +int length(NODE d); + void add_bucket(GeoBucket g,NODE d,int nv) { int l,k,m; @@ -1825,12 +1908,13 @@ int compdv(VL vl,DPV p1,DPV p2) { int i,t,len; - if ( p1->len != p2->len ) + if ( p1->len != p2->len ) { error("compdv : size mismatch"); - else { + return 0; /* XXX */ + } else { len = p1->len; for ( i = 0; i < len; i++ ) - if ( t = compd(vl,p1->body[i],p2->body[i]) ) + if ( (t = compd(vl,p1->body[i],p2->body[i])) ) return t; return 0; } @@ -1856,7 +1940,7 @@ int ni_next(int *a,int n) int comp_nbm(NBM a,NBM b) { - int d,i,w,ai,bi; + int d,i,ai,bi; int *ab,*bb; if ( a->d > b->d ) return 1; @@ -1885,8 +1969,6 @@ NBM mul_nbm(NBM a,NBM b) int ad,bd,d,i,j; int *ab,*bb,*mb; NBM m; - NODE r; - NBP u; ad = a->d; bd = b->d; ab = a->b; bb = b->b; d = ad + bd; @@ -2079,7 +2161,7 @@ NBP harmonic_mul_nbm(NBM a,NBM b) void addnbp(VL vl,NBP p1,NBP p2, NBP *rp) { - NODE b1,b2,br,br0; + NODE b1,b2,br=0,br0; NBM m1,m2,m; P c; @@ -2136,7 +2218,7 @@ void subnbp(VL vl,NBP p1,NBP p2, NBP *rp) void chsgnnbp(NBP p,NBP *rp) { - NODE r0,r,b; + NODE r0,r=0,b; NBM m,m1; for ( r0 = 0, b = BDY(p); b; b = NEXT(b) ) { @@ -2187,7 +2269,7 @@ void mulnbp(VL vl,NBP p1,NBP p2, NBP *rp) void mulnbmnbp(VL vl,NBM m,NBP p, NBP *rp) { - NODE b,r0,r; + NODE b,r0,r=0; if ( !p ) *rp = 0; else { @@ -2202,7 +2284,7 @@ void mulnbmnbp(VL vl,NBM m,NBP p, NBP *rp) void mulnbpnbm(VL vl,NBP p,NBM m, NBP *rp) { - NODE b,r0,r; + NODE b,r0,r=0; if ( !p ) *rp = 0; else {