version 1.9, 2001/10/09 01:36:11 |
version 1.20, 2017/08/31 02:36:21 |
|
|
* 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/engine/distm.c,v 1.8 2000/12/05 08:29:44 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/engine/distm.c,v 1.19 2012/12/17 07:20:44 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "inline.h" |
#include "inline.h" |
Line 78 void mptomd(VL vl,int mod,VL dvl,P p,DP *pr) |
|
Line 78 void mptomd(VL vl,int mod,VL dvl,P p,DP *pr) |
|
for ( n = 0, tvl = dvl; tvl; tvl = NEXT(tvl), n++ ); |
for ( n = 0, tvl = dvl; tvl; tvl = NEXT(tvl), n++ ); |
if ( NUM(p) ) { |
if ( NUM(p) ) { |
NEWDL(d,n); |
NEWDL(d,n); |
NEWMP(m); m->dl = d; C(m) = p; NEXT(m) = 0; MKDP(n,m,*pr); |
NEWMP(m); m->dl = d; C(m) = (Obj)p; NEXT(m) = 0; MKDP(n,m,*pr); |
} else { |
} else { |
for ( i = 0, tvl = dvl, v = VR(p); |
for ( i = 0, tvl = dvl, v = VR(p); |
tvl && tvl->v != v; tvl = NEXT(tvl), i++ ); |
tvl && tvl->v != v; tvl = NEXT(tvl), i++ ); |
Line 91 void mptomd(VL vl,int mod,VL dvl,P p,DP *pr) |
|
Line 91 void mptomd(VL vl,int mod,VL dvl,P p,DP *pr) |
|
} else { |
} else { |
for ( dc = DC(p), s = 0; dc; dc = NEXT(dc) ) { |
for ( dc = DC(p), s = 0; dc; dc = NEXT(dc) ) { |
mptomd(vl,mod,dvl,COEF(dc),&t); |
mptomd(vl,mod,dvl,COEF(dc),&t); |
NEWDL(d,n); d->td = QTOS(DEG(dc)); d->d[i] = d->td; |
NEWDL(d,n); d->d[i] = QTOS(DEG(dc)); |
NEWMP(m); m->dl = d; C(m) = (P)ONEM; NEXT(m) = 0; MKDP(n,m,u); |
d->td = MUL_WEIGHT(d->d[i],i); |
|
NEWMP(m); m->dl = d; C(m) = (Obj)ONEM; NEXT(m) = 0; MKDP(n,m,u); |
comm_mulmd(vl,mod,t,u,&r); addmd(vl,mod,r,s,&t); s = t; |
comm_mulmd(vl,mod,t,u,&r); addmd(vl,mod,r,s,&t); s = t; |
} |
} |
*pr = s; |
*pr = s; |
Line 101 void mptomd(VL vl,int mod,VL dvl,P p,DP *pr) |
|
Line 102 void mptomd(VL vl,int mod,VL dvl,P p,DP *pr) |
|
} |
} |
} |
} |
|
|
|
void mdtodp(DP p,DP *pr) |
|
{ |
|
MP m,mr0,mr; |
|
|
|
if ( !p ) |
|
*pr = 0; |
|
else { |
|
for ( m = BDY(p), mr0 = 0; m; m = NEXT(m) ) { |
|
NEXTMP(mr0,mr); mr->dl = m->dl; |
|
mptop((P)C(m),(P *)&C(mr)); |
|
} |
|
NEXT(mr) = 0; |
|
MKDP(NV(p),mr0,*pr); |
|
(*pr)->sugar = p->sugar; |
|
} |
|
} |
|
|
|
void _mdtodp(DP p,DP *pr) |
|
{ |
|
MP m,mr0,mr; |
|
int i; |
|
Q q; |
|
|
|
if ( !p ) |
|
*pr = 0; |
|
else { |
|
for ( m = BDY(p), mr0 = 0; m; m = NEXT(m) ) { |
|
NEXTMP(mr0,mr); mr->dl = m->dl; |
|
i = ITOS(m->c); STOQ(i,q); C(mr) = (Obj)q; |
|
} |
|
NEXT(mr) = 0; |
|
MKDP(NV(p),mr0,*pr); |
|
(*pr)->sugar = p->sugar; |
|
} |
|
} |
|
|
void mdtop(VL vl,int mod,VL dvl,DP p,P *pr) |
void mdtop(VL vl,int mod,VL dvl,DP p,P *pr) |
{ |
{ |
int n,i; |
int n,i; |
Line 114 void mdtop(VL vl,int mod,VL dvl,DP p,P *pr) |
|
Line 151 void mdtop(VL vl,int mod,VL dvl,DP p,P *pr) |
|
*pr = 0; |
*pr = 0; |
else { |
else { |
for ( n = p->nv, m = BDY(p), s = 0; m; m = NEXT(m) ) { |
for ( n = p->nv, m = BDY(p), s = 0; m; m = NEXT(m) ) { |
for ( i = 0, t = C(m), d = m->dl, tvl = dvl; |
for ( i = 0, t = (P)C(m), d = m->dl, tvl = dvl; |
i < n; tvl = NEXT(tvl), i++ ) { |
i < n; tvl = NEXT(tvl), i++ ) { |
MKMV(tvl->v,r); STOQ(d->d[i],q); pwrmp(vl,mod,r,q,&u); |
MKMV(tvl->v,r); STOQ(d->d[i],q); pwrmp(vl,mod,r,q,&u); |
mulmp(vl,mod,t,u,&w); t = w; |
mulmp(vl,mod,t,u,&w); t = w; |
Line 150 void addmd(VL vl,int mod,DP p1,DP p2,DP *pr) |
|
Line 187 void addmd(VL vl,int mod,DP p1,DP p2,DP *pr) |
|
} else |
} else |
t = 0; |
t = 0; |
} else |
} else |
addmp(vl,mod,C(m1),C(m2),&t); |
addmp(vl,mod,(P)C(m1),(P)C(m2),&t); |
if ( t ) { |
if ( t ) { |
NEXTMP(mr0,mr); mr->dl = m1->dl; C(mr) = t; |
NEXTMP(mr0,mr); mr->dl = m1->dl; C(mr) = (Obj)t; |
} |
} |
m1 = NEXT(m1); m2 = NEXT(m2); break; |
m1 = NEXT(m1); m2 = NEXT(m2); break; |
case 1: |
case 1: |
Line 202 void chsgnmd(int mod,DP p,DP *pr) |
|
Line 239 void chsgnmd(int mod,DP p,DP *pr) |
|
*pr = 0; |
*pr = 0; |
else { |
else { |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
NEXTMP(mr0,mr); chsgnmp(mod,C(m),&C(mr)); mr->dl = m->dl; |
NEXTMP(mr0,mr); chsgnmp(mod,(P)C(m),(P *)&C(mr)); mr->dl = m->dl; |
} |
} |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
if ( *pr ) |
if ( *pr ) |
Line 240 void comm_mulmd(VL vl,int mod,DP p1,DP p2,DP *pr) |
|
Line 277 void comm_mulmd(VL vl,int mod,DP p1,DP p2,DP *pr) |
|
l = l1; |
l = l1; |
} |
} |
if ( l > wlen ) { |
if ( l > wlen ) { |
if ( w ) GC_free(w); |
if ( w ) GCFREE(w); |
w = (MP *)MALLOC(l*sizeof(MP)); |
w = (MP *)MALLOC(l*sizeof(MP)); |
wlen = l; |
wlen = l; |
} |
} |
Line 271 void weyl_mulmd(VL vl,int mod,DP p1,DP p2,DP *pr) |
|
Line 308 void weyl_mulmd(VL vl,int mod,DP p1,DP p2,DP *pr) |
|
else { |
else { |
for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ ); |
for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ ); |
if ( l > wlen ) { |
if ( l > wlen ) { |
if ( w ) GC_free(w); |
if ( w ) GCFREE(w); |
w = (MP *)MALLOC(l*sizeof(MP)); |
w = (MP *)MALLOC(l*sizeof(MP)); |
wlen = l; |
wlen = l; |
} |
} |
Line 296 void mulmdm(VL vl,int mod,DP p,MP m0,DP *pr) |
|
Line 333 void mulmdm(VL vl,int mod,DP p,MP m0,DP *pr) |
|
if ( !p ) |
if ( !p ) |
*pr = 0; |
*pr = 0; |
else { |
else { |
for ( mr0 = 0, m = BDY(p), c = C(m0), d = m0->dl, n = NV(p); |
for ( mr0 = 0, m = BDY(p), c = (P)C(m0), d = m0->dl, n = NV(p); |
m; m = NEXT(m) ) { |
m; m = NEXT(m) ) { |
NEXTMP(mr0,mr); |
NEXTMP(mr0,mr); |
if ( NUM(C(m)) && NUM(c) ) { |
if ( NUM(C(m)) && NUM(c) ) { |
t = dmar(((MQ)(C(m)))->cont,((MQ)c)->cont,0,mod); |
t = dmar(((MQ)(C(m)))->cont,((MQ)c)->cont,0,mod); |
STOMQ(t,q); C(mr) = (P)q; |
STOMQ(t,q); C(mr) = (Obj)q; |
} else |
} else |
mulmp(vl,mod,C(m),c,&C(mr)); |
mulmp(vl,mod,(P)C(m),c,(P *)&C(mr)); |
adddl(n,m->dl,d,&mr->dl); |
adddl(n,m->dl,d,&mr->dl); |
} |
} |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
Line 325 void weyl_mulmdm(VL vl,int mod,DP p,MP m0,DP *pr) |
|
Line 362 void weyl_mulmdm(VL vl,int mod,DP p,MP m0,DP *pr) |
|
else { |
else { |
for ( m = BDY(p), l = 0; m; m = NEXT(m), l++ ); |
for ( m = BDY(p), l = 0; m; m = NEXT(m), l++ ); |
if ( l > wlen ) { |
if ( l > wlen ) { |
if ( w ) GC_free(w); |
if ( w ) GCFREE(w); |
w = (MP *)MALLOC(l*sizeof(MP)); |
w = (MP *)MALLOC(l*sizeof(MP)); |
wlen = l; |
wlen = l; |
} |
} |
Line 358 void weyl_mulmmm(VL vl,int mod,MP m0,MP m1,int n,DP *p |
|
Line 395 void weyl_mulmmm(VL vl,int mod,MP m0,MP m1,int n,DP *p |
|
if ( !m0 || !m1 ) |
if ( !m0 || !m1 ) |
*pr = 0; |
*pr = 0; |
else { |
else { |
c0 = C(m0); c1 = C(m1); |
c0 = (P)C(m0); c1 = (P)C(m1); |
mulmp(vl,mod,c0,c1,&c); |
mulmp(vl,mod,c0,c1,&c); |
d0 = m0->dl; d1 = m1->dl; |
d0 = m0->dl; d1 = m1->dl; |
n2 = n>>1; |
n2 = n>>1; |
Line 367 void weyl_mulmmm(VL vl,int mod,MP m0,MP m1,int n,DP *p |
|
Line 404 void weyl_mulmmm(VL vl,int mod,MP m0,MP m1,int n,DP *p |
|
/* offset of h-degree */ |
/* offset of h-degree */ |
NEWDL(d,n); |
NEWDL(d,n); |
d->td = d->d[n-1] = d0->d[n-1]+d1->d[n-1]; |
d->td = d->d[n-1] = d0->d[n-1]+d1->d[n-1]; |
NEWMP(mr); mr->c = (P)ONEM; mr->dl = d; NEXT(mr) = 0; |
NEWMP(mr); mr->c = (Obj)ONEM; mr->dl = d; NEXT(mr) = 0; |
MKDP(n,mr,r); r->sugar = d->td; |
MKDP(n,mr,r); r->sugar = d->td; |
} else |
} else |
r = (DP)ONEM; |
r = (DP)ONEM; |
for ( i = 0; i < n2; i++ ) { |
for ( i = 0; i < n2; i++ ) { |
a = d0->d[i]; b = d1->d[n2+i]; |
a = d0->d[i]; b = d1->d[n2+i]; |
k = d0->d[n2+i]; l = d1->d[i]; |
k = d0->d[n2+i]; l = d1->d[i]; |
|
|
/* degree of xi^a*(Di^k*xi^l)*Di^b */ |
/* degree of xi^a*(Di^k*xi^l)*Di^b */ |
s = a+k+l+b; |
a += l; |
|
b += k; |
|
s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i); |
|
|
/* compute xi^a*(Di^k*xi^l)*Di^b */ |
/* compute xi^a*(Di^k*xi^l)*Di^b */ |
min = MIN(k,l); |
min = MIN(k,l); |
|
|
if ( min+1 > tablen ) { |
if ( min+1 > tablen ) { |
if ( tab ) GC_free(tab); |
if ( tab ) GCFREE(tab); |
tab = (int *)MALLOC((min+1)*sizeof(int)); |
tab = (int *)MALLOC((min+1)*sizeof(int)); |
tablen = min+1; |
tablen = min+1; |
} |
} |
Line 388 void weyl_mulmmm(VL vl,int mod,MP m0,MP m1,int n,DP *p |
|
Line 429 void weyl_mulmmm(VL vl,int mod,MP m0,MP m1,int n,DP *p |
|
if ( n & 1 ) |
if ( n & 1 ) |
for ( mr0 = 0, j = 0; j <= min; j++ ) { |
for ( mr0 = 0, j = 0; j <= min; j++ ) { |
NEXTMP(mr0,mr); NEWDL(d,n); |
NEXTMP(mr0,mr); NEWDL(d,n); |
d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
d->d[i] = a-j; d->d[n2+i] = b-j; |
d->td = s; |
d->td = s; |
d->d[n-1] = s-(d->d[i]+d->d[n2+i]); |
d->d[n-1] = s-(MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i)); |
STOMQ(tab[j],mq); mr->c = (P)mq; mr->dl = d; |
STOMQ(tab[j],mq); mr->c = (Obj)mq; mr->dl = d; |
} |
} |
else |
else |
for ( mr0 = 0, s = 0, j = 0; j <= min; j++ ) { |
for ( mr0 = 0, s = 0, j = 0; j <= min; j++ ) { |
NEXTMP(mr0,mr); NEWDL(d,n); |
NEXTMP(mr0,mr); NEWDL(d,n); |
d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
d->d[i] = a-j; d->d[n2+i] = b-j; |
d->td = d->d[i]+d->d[n2+i]; /* XXX */ |
d->td = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i); /* XXX */ |
s = MAX(s,d->td); /* XXX */ |
s = MAX(s,d->td); /* XXX */ |
STOMQ(tab[j],mq); mr->c = (P)mq; mr->dl = d; |
STOMQ(tab[j],mq); mr->c = (Obj)mq; mr->dl = d; |
} |
} |
bzero(tab,(min+1)*sizeof(int)); |
bzero(tab,(min+1)*sizeof(int)); |
if ( mr0 ) |
if ( mr0 ) |
Line 426 void mulmdc(VL vl,int mod,DP p,P c,DP *pr) |
|
Line 467 void mulmdc(VL vl,int mod,DP p,P c,DP *pr) |
|
NEXTMP(mr0,mr); |
NEXTMP(mr0,mr); |
if ( NUM(C(m)) && NUM(c) ) { |
if ( NUM(C(m)) && NUM(c) ) { |
t = dmar(((MQ)(C(m)))->cont,((MQ)c)->cont,0,mod); |
t = dmar(((MQ)(C(m)))->cont,((MQ)c)->cont,0,mod); |
STOMQ(t,q); C(mr) = (P)q; |
STOMQ(t,q); C(mr) = (Obj)q; |
} else |
} else |
mulmp(vl,mod,C(m),c,&C(mr)); |
mulmp(vl,mod,(P)C(m),c,(P *)&C(mr)); |
mr->dl = m->dl; |
mr->dl = m->dl; |
} |
} |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
Line 447 void divsmdc(VL vl,int mod,DP p,P c,DP *pr) |
|
Line 488 void divsmdc(VL vl,int mod,DP p,P c,DP *pr) |
|
*pr = 0; |
*pr = 0; |
else { |
else { |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
NEXTMP(mr0,mr); divsmp(vl,mod,C(m),c,&C(mr)); mr->dl = m->dl; |
NEXTMP(mr0,mr); divsmp(vl,mod,(P)C(m),c,(P *)&C(mr)); mr->dl = m->dl; |
} |
} |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
if ( *pr ) |
if ( *pr ) |
Line 490 void _dp_mod(DP p,int mod,NODE subst,DP *rp) |
|
Line 531 void _dp_mod(DP p,int mod,NODE subst,DP *rp) |
|
*rp = 0; |
*rp = 0; |
else { |
else { |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
for ( tn = subst, s = m->c; tn; tn = NEXT(NEXT(tn)) ) { |
for ( tn = subst, s = (P)m->c; tn; tn = NEXT(NEXT(tn)) ) { |
substp(CO,s,BDY(tn),BDY(NEXT(tn)),&t); |
substp(CO,s,BDY(tn),BDY(NEXT(tn)),&t); |
s = t; |
s = t; |
} |
} |
ptomp(mod,s,&t); |
ptomp(mod,s,&t); |
if ( t ) { |
if ( t ) { |
NEXTMP(mr0,mr); mr->c = STOI(CONT((MQ)t)); mr->dl = m->dl; |
NEXTMP(mr0,mr); mr->c = (Obj)STOI(CONT((MQ)t)); mr->dl = m->dl; |
} |
} |
} |
} |
if ( mr0 ) { |
if ( mr0 ) { |
Line 517 void _dp_monic(DP p,int mod,DP *rp) |
|
Line 558 void _dp_monic(DP p,int mod,DP *rp) |
|
c = invm(ITOS(BDY(p)->c),mod); |
c = invm(ITOS(BDY(p)->c),mod); |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
c1 = dmar(ITOS(m->c),c,0,mod); |
c1 = dmar(ITOS(m->c),c,0,mod); |
NEXTMP(mr0,mr); mr->c = STOI(c1); mr->dl = m->dl; |
NEXTMP(mr0,mr); mr->c = (Obj)STOI(c1); mr->dl = m->dl; |
} |
} |
NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar; |
NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar; |
} |
} |
Line 564 void addmd_destructive(int mod,DP p1,DP p2,DP *pr) |
|
Line 605 void addmd_destructive(int mod,DP p1,DP p2,DP *pr) |
|
t += mod; |
t += mod; |
s = m1; m1 = NEXT(m1); |
s = m1; m1 = NEXT(m1); |
if ( t ) { |
if ( t ) { |
NEXTMP2(mr0,mr,s); C(mr) = STOI(t); |
NEXTMP2(mr0,mr,s); C(mr) = (Obj)STOI(t); |
} |
} |
s = m2; m2 = NEXT(m2); |
s = m2; m2 = NEXT(m2); |
break; |
break; |
Line 622 void comm_mulmd_dup(int mod,DP p1,DP p2,DP *pr) |
|
Line 663 void comm_mulmd_dup(int mod,DP p1,DP p2,DP *pr) |
|
l = l1; |
l = l1; |
} |
} |
if ( l > wlen ) { |
if ( l > wlen ) { |
if ( w ) GC_free(w); |
if ( w ) GCFREE(w); |
w = (MP *)MALLOC(l*sizeof(MP)); |
w = (MP *)MALLOC(l*sizeof(MP)); |
wlen = l; |
wlen = l; |
} |
} |
Line 649 void weyl_mulmd_dup(int mod,DP p1,DP p2,DP *pr) |
|
Line 690 void weyl_mulmd_dup(int mod,DP p1,DP p2,DP *pr) |
|
else { |
else { |
for ( m = BDY(p1), l = 0; m; m = NEXT(m), l++ ); |
for ( m = BDY(p1), l = 0; m; m = NEXT(m), l++ ); |
if ( l > wlen ) { |
if ( l > wlen ) { |
if ( w ) GC_free(w); |
if ( w ) GCFREE(w); |
w = (MP *)MALLOC(l*sizeof(MP)); |
w = (MP *)MALLOC(l*sizeof(MP)); |
wlen = l; |
wlen = l; |
} |
} |
Line 676 void mulmdm_dup(int mod,DP p,MP m0,DP *pr) |
|
Line 717 void mulmdm_dup(int mod,DP p,MP m0,DP *pr) |
|
for ( mr0 = 0, m = BDY(p), c = ITOS(C(m0)), d = m0->dl, n = NV(p); |
for ( mr0 = 0, m = BDY(p), c = ITOS(C(m0)), d = m0->dl, n = NV(p); |
m; m = NEXT(m) ) { |
m; m = NEXT(m) ) { |
NEXTMP(mr0,mr); |
NEXTMP(mr0,mr); |
C(mr) = STOI(dmar(ITOS(C(m)),c,0,mod)); |
C(mr) = (Obj)STOI(dmar(ITOS(C(m)),c,0,mod)); |
NEWDL_NOINIT(dt,n); mr->dl = dt; |
NEWDL_NOINIT(dt,n); mr->dl = dt; |
dm = m->dl; |
dm = m->dl; |
dt->td = d->td + dm->td; |
dt->td = d->td + dm->td; |
Line 705 void weyl_mulmdm_dup(int mod,MP m0,DP p,DP *pr) |
|
Line 746 void weyl_mulmdm_dup(int mod,MP m0,DP p,DP *pr) |
|
else { |
else { |
for ( m = BDY(p), l = 0; m; m = NEXT(m), l++ ); |
for ( m = BDY(p), l = 0; m; m = NEXT(m), l++ ); |
if ( l > wlen ) { |
if ( l > wlen ) { |
if ( w ) GC_free(w); |
if ( w ) GCFREE(w); |
w = (MP *)MALLOC(l*sizeof(MP)); |
w = (MP *)MALLOC(l*sizeof(MP)); |
wlen = l; |
wlen = l; |
} |
} |
Line 717 void weyl_mulmdm_dup(int mod,MP m0,DP p,DP *pr) |
|
Line 758 void weyl_mulmdm_dup(int mod,MP m0,DP p,DP *pr) |
|
for ( i = 0, tlen = 1; i < n2; i++ ) |
for ( i = 0, tlen = 1; i < n2; i++ ) |
tlen *= d0->d[n2+i]+1; |
tlen *= d0->d[n2+i]+1; |
if ( tlen > rtlen ) { |
if ( tlen > rtlen ) { |
if ( tab ) GC_free(tab); |
if ( tab ) GCFREE(tab); |
if ( psum ) GC_free(psum); |
if ( psum ) GCFREE(psum); |
rtlen = tlen; |
rtlen = tlen; |
tab = (struct cdlm *)MALLOC(rtlen*sizeof(struct cdlm)); |
tab = (struct cdlm *)MALLOC(rtlen*sizeof(struct cdlm)); |
psum = (MP *)MALLOC(rtlen*sizeof(MP)); |
psum = (MP *)MALLOC(rtlen*sizeof(MP)); |
Line 730 void weyl_mulmdm_dup(int mod,MP m0,DP p,DP *pr) |
|
Line 771 void weyl_mulmdm_dup(int mod,MP m0,DP p,DP *pr) |
|
for ( j = 0; j < tlen; j++ ) { |
for ( j = 0; j < tlen; j++ ) { |
if ( tab[j].c ) { |
if ( tab[j].c ) { |
NEWMP(m); m->dl = tab[j].d; |
NEWMP(m); m->dl = tab[j].d; |
C(m) = STOI(tab[j].c); NEXT(m) = psum[j]; |
C(m) = (Obj)STOI(tab[j].c); NEXT(m) = psum[j]; |
psum[j] = m; |
psum[j] = m; |
} |
} |
} |
} |
Line 780 void weyl_mulmmm_dup(int mod,MP m0,MP m1,int n,struct |
|
Line 821 void weyl_mulmmm_dup(int mod,MP m0,MP m1,int n,struct |
|
rtab[0].d = d; |
rtab[0].d = d; |
|
|
if ( rtablen > tmptablen ) { |
if ( rtablen > tmptablen ) { |
if ( tmptab ) GC_free(tmptab); |
if ( tmptab ) GCFREE(tmptab); |
tmptab = (struct cdlm *)MALLOC(rtablen*sizeof(struct cdlm)); |
tmptab = (struct cdlm *)MALLOC(rtablen*sizeof(struct cdlm)); |
tmptablen = rtablen; |
tmptablen = rtablen; |
} |
} |
Line 788 void weyl_mulmmm_dup(int mod,MP m0,MP m1,int n,struct |
|
Line 829 void weyl_mulmmm_dup(int mod,MP m0,MP m1,int n,struct |
|
for ( i = 0; i < n2; i++ ) { |
for ( i = 0; i < n2; i++ ) { |
a = d0->d[i]; b = d1->d[n2+i]; |
a = d0->d[i]; b = d1->d[n2+i]; |
k = d0->d[n2+i]; l = d1->d[i]; |
k = d0->d[n2+i]; l = d1->d[i]; |
|
|
|
/* degree of xi^a*(Di^k*xi^l)*Di^b */ |
|
a += l; |
|
b += k; |
|
s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i); |
|
|
if ( !k || !l ) { |
if ( !k || !l ) { |
a += l; |
|
b += k; |
|
s = a+b; |
|
for ( j = 0, p = rtab; j < curlen; j++, p++ ) { |
for ( j = 0, p = rtab; j < curlen; j++, p++ ) { |
if ( p->c ) { |
if ( p->c ) { |
dt = p->d; |
dt = p->d; |
Line 804 void weyl_mulmmm_dup(int mod,MP m0,MP m1,int n,struct |
|
Line 848 void weyl_mulmmm_dup(int mod,MP m0,MP m1,int n,struct |
|
continue; |
continue; |
} |
} |
if ( k+1 > tablen ) { |
if ( k+1 > tablen ) { |
if ( tab ) GC_free(tab); |
if ( tab ) GCFREE(tab); |
if ( ctab ) GC_free(ctab); |
if ( ctab ) GCFREE(ctab); |
tablen = k+1; |
tablen = k+1; |
tab = (struct cdlm *)MALLOC(tablen*sizeof(struct cdlm)); |
tab = (struct cdlm *)MALLOC(tablen*sizeof(struct cdlm)); |
ctab = (int *)MALLOC(tablen*sizeof(int)); |
ctab = (int *)MALLOC(tablen*sizeof(int)); |
} |
} |
/* degree of xi^a*(Di^k*xi^l)*Di^b */ |
|
s = a+k+l+b; |
|
/* compute xi^a*(Di^k*xi^l)*Di^b */ |
/* compute xi^a*(Di^k*xi^l)*Di^b */ |
min = MIN(k,l); |
min = MIN(k,l); |
mkwcm(k,l,mod,ctab); |
mkwcm(k,l,mod,ctab); |
Line 820 void weyl_mulmmm_dup(int mod,MP m0,MP m1,int n,struct |
|
Line 862 void weyl_mulmmm_dup(int mod,MP m0,MP m1,int n,struct |
|
if ( n & 1 ) |
if ( n & 1 ) |
for ( j = 0; j <= min; j++ ) { |
for ( j = 0; j <= min; j++ ) { |
NEWDL(d,n); |
NEWDL(d,n); |
d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
d->d[i] = a-j; d->d[n2+i] = b-j; |
d->td = s; |
d->td = s; |
d->d[n-1] = s-(d->d[i]+d->d[n2+i]); |
d->d[n-1] = s-(MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i)); |
tab[j].d = d; |
tab[j].d = d; |
tab[j].c = ctab[j]; |
tab[j].c = ctab[j]; |
} |
} |
else |
else |
for ( j = 0; j <= min; j++ ) { |
for ( j = 0; j <= min; j++ ) { |
NEWDL(d,n); |
NEWDL(d,n); |
d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
d->d[i] = a-j; d->d[n2+i] = b-j; |
d->td = d->d[i]+d->d[n2+i]; /* XXX */ |
d->td = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i); /* XXX */ |
tab[j].d = d; |
tab[j].d = d; |
tab[j].c = ctab[j]; |
tab[j].c = ctab[j]; |
} |
} |