| version 1.5, 2000/08/21 08:31:27 |
version 1.21, 2018/03/29 01:32:51 |
|
|
| * shall be made on your publication or presentation in any form of the |
* shall be made on your publication or presentation in any form of the |
| * results obtained by use of the SOFTWARE. |
* results obtained by use of the SOFTWARE. |
| * (4) In the event that you modify the SOFTWARE, you shall notify FLL by |
* (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 |
* for such modification or the source code of the modified part of the |
| * SOFTWARE. |
* SOFTWARE. |
| * |
* |
|
|
| * 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.4 2000/07/13 05:09:01 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/engine/distm.c,v 1.20 2017/08/31 02:36:21 noro Exp $ |
| */ |
*/ |
| #include "ca.h" |
#include "ca.h" |
| #include "inline.h" |
#include "inline.h" |
| |
|
| #define NV(p) ((p)->nv) |
|
| #define C(p) ((p)->c) |
|
| #if 0 |
|
| #define ITOS(p) (((unsigned int)(p))>>1) |
|
| #define STOI(i) ((P)((((unsigned int)(i))<<1)|1)) |
|
| #else |
|
| #define ITOS(p) (((unsigned int)(p))&0x7fffffff) |
|
| #define STOI(i) ((P)((unsigned int)(i)|0x80000000)) |
|
| #endif |
|
| |
|
| extern int (*cmpdl)(); |
extern int (*cmpdl)(); |
| extern int do_weyl; |
extern int do_weyl; |
| |
|
| void comm_mulmd(); |
void ptomd(VL vl,int mod,VL dvl,P p,DP *pr) |
| void weyl_mulmd(); |
|
| void weyl_mulmdm(); |
|
| void weyl_mulmmm(); |
|
| void _comm_mulmd(); |
|
| void _weyl_mulmd(); |
|
| void _weyl_mulmmm(); |
|
| void _weyl_mulmdm(); |
|
| |
|
| void ptomd(vl,mod,dvl,p,pr) |
|
| VL vl,dvl; |
|
| int mod; |
|
| P p; |
|
| DP *pr; |
|
| { |
{ |
| P t; |
P t; |
| |
|
| ptomp(mod,p,&t); |
ptomp(mod,p,&t); |
| mptomd(vl,mod,dvl,t,pr); |
mptomd(vl,mod,dvl,t,pr); |
| } |
} |
| |
|
| void mptomd(vl,mod,dvl,p,pr) |
void mptomd(VL vl,int mod,VL dvl,P p,DP *pr) |
| VL vl,dvl; |
|
| int mod; |
|
| P p; |
|
| DP *pr; |
|
| { |
{ |
| int n,i; |
int n,i; |
| VL tvl; |
VL tvl; |
| V v; |
V v; |
| DL d; |
DL d; |
| MP m; |
MP m; |
| DCP dc; |
DCP dc; |
| DP r,s,t,u; |
DP r,s,t,u; |
| P x,c; |
P x,c; |
| |
|
| if ( !p ) |
if ( !p ) |
| *pr = 0; |
*pr = 0; |
| else { |
else { |
| 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++ ); |
| if ( !tvl ) { |
if ( !tvl ) { |
| for ( dc = DC(p), s = 0, MKV(v,x); dc; dc = NEXT(dc) ) { |
for ( dc = DC(p), s = 0, MKV(v,x); dc; dc = NEXT(dc) ) { |
| mptomd(vl,mod,dvl,COEF(dc),&t); pwrmp(vl,mod,x,DEG(dc),&c); |
mptomd(vl,mod,dvl,COEF(dc),&t); pwrmp(vl,mod,x,DEG(dc),&c); |
| mulmdc(vl,mod,t,c,&r); addmd(vl,mod,r,s,&t); s = t; |
mulmdc(vl,mod,t,c,&r); addmd(vl,mod,r,s,&t); s = t; |
| } |
} |
| *pr = s; |
*pr = s; |
| } 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); |
| comm_mulmd(vl,mod,t,u,&r); addmd(vl,mod,r,s,&t); s = t; |
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; |
| *pr = s; |
} |
| } |
*pr = s; |
| } |
} |
| } |
} |
| |
} |
| } |
} |
| |
|
| void mdtop(vl,mod,dvl,p,pr) |
void mdtodp(DP p,DP *pr) |
| VL vl,dvl; |
|
| int mod; |
|
| DP p; |
|
| P *pr; |
|
| { |
{ |
| int n,i; |
MP m,mr0,mr; |
| DL d; |
|
| MP m; |
|
| P r,s,t,u,w; |
|
| Q q; |
|
| VL tvl; |
|
| |
|
| if ( !p ) |
if ( !p ) |
| *pr = 0; |
*pr = 0; |
| else { |
else { |
| for ( n = p->nv, m = BDY(p), s = 0; m; m = NEXT(m) ) { |
for ( m = BDY(p), mr0 = 0; m; m = NEXT(m) ) { |
| for ( i = 0, t = C(m), d = m->dl, tvl = dvl; |
NEXTMP(mr0,mr); mr->dl = m->dl; |
| i < n; tvl = NEXT(tvl), i++ ) { |
mptop((P)C(m),(P *)&C(mr)); |
| MKMV(tvl->v,r); STOQ(d->d[i],q); pwrmp(vl,mod,r,q,&u); |
} |
| mulmp(vl,mod,t,u,&w); t = w; |
NEXT(mr) = 0; |
| } |
MKDP(NV(p),mr0,*pr); |
| addmp(vl,mod,s,t,&u); s = u; |
(*pr)->sugar = p->sugar; |
| } |
} |
| mptop(s,pr); |
|
| } |
|
| } |
} |
| |
|
| void addmd(vl,mod,p1,p2,pr) |
void _mdtodp(DP p,DP *pr) |
| VL vl; |
|
| int mod; |
|
| DP p1,p2,*pr; |
|
| { |
{ |
| int n; |
MP m,mr0,mr; |
| MP m1,m2,mr,mr0; |
int i; |
| P t; |
Q q; |
| int tmp; |
|
| MQ q; |
|
| |
|
| if ( !p1 ) |
if ( !p ) |
| *pr = p2; |
*pr = 0; |
| else if ( !p2 ) |
else { |
| *pr = p1; |
for ( m = BDY(p), mr0 = 0; m; m = NEXT(m) ) { |
| else { |
NEXTMP(mr0,mr); mr->dl = m->dl; |
| for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) |
i = ITOS(m->c); STOQ(i,q); C(mr) = (Obj)q; |
| switch ( (*cmpdl)(n,m1->dl,m2->dl) ) { |
} |
| case 0: |
NEXT(mr) = 0; |
| if ( NUM(C(m1)) && NUM(C(m2)) ) { |
MKDP(NV(p),mr0,*pr); |
| tmp = (CONT((MQ)C(m1))+CONT((MQ)C(m2))) - mod; |
(*pr)->sugar = p->sugar; |
| if ( tmp < 0 ) |
} |
| tmp += mod; |
|
| if ( tmp ) { |
|
| STOMQ(tmp,q); t = (P)q; |
|
| } else |
|
| t = 0; |
|
| } else |
|
| addmp(vl,mod,C(m1),C(m2),&t); |
|
| if ( t ) { |
|
| NEXTMP(mr0,mr); mr->dl = m1->dl; C(mr) = t; |
|
| } |
|
| m1 = NEXT(m1); m2 = NEXT(m2); break; |
|
| case 1: |
|
| NEXTMP(mr0,mr); mr->dl = m1->dl; C(mr) = C(m1); |
|
| m1 = NEXT(m1); break; |
|
| case -1: |
|
| NEXTMP(mr0,mr); mr->dl = m2->dl; C(mr) = C(m2); |
|
| m2 = NEXT(m2); break; |
|
| } |
|
| if ( !mr0 ) |
|
| if ( m1 ) |
|
| mr0 = m1; |
|
| else if ( m2 ) |
|
| mr0 = m2; |
|
| else { |
|
| *pr = 0; |
|
| return; |
|
| } |
|
| else if ( m1 ) |
|
| NEXT(mr) = m1; |
|
| else if ( m2 ) |
|
| NEXT(mr) = m2; |
|
| else |
|
| NEXT(mr) = 0; |
|
| MKDP(NV(p1),mr0,*pr); |
|
| if ( *pr ) |
|
| (*pr)->sugar = MAX(p1->sugar,p2->sugar); |
|
| } |
|
| } |
} |
| |
|
| void submd(vl,mod,p1,p2,pr) |
void mdtop(VL vl,int mod,VL dvl,DP p,P *pr) |
| VL vl; |
|
| int mod; |
|
| DP p1,p2,*pr; |
|
| { |
{ |
| DP t; |
int n,i; |
| |
DL d; |
| |
MP m; |
| |
P r,s,t,u,w; |
| |
Q q; |
| |
VL tvl; |
| |
|
| if ( !p2 ) |
if ( !p ) |
| *pr = p1; |
*pr = 0; |
| else { |
else { |
| chsgnmd(mod,p2,&t); addmd(vl,mod,p1,t,pr); |
for ( n = p->nv, m = BDY(p), s = 0; m; m = NEXT(m) ) { |
| } |
for ( i = 0, t = (P)C(m), d = m->dl, tvl = dvl; |
| |
i < n; tvl = NEXT(tvl), i++ ) { |
| |
MKMV(tvl->v,r); STOQ(d->d[i],q); pwrmp(vl,mod,r,q,&u); |
| |
mulmp(vl,mod,t,u,&w); t = w; |
| |
} |
| |
addmp(vl,mod,s,t,&u); s = u; |
| |
} |
| |
mptop(s,pr); |
| |
} |
| } |
} |
| |
|
| void chsgnmd(mod,p,pr) |
void addmd(VL vl,int mod,DP p1,DP p2,DP *pr) |
| int mod; |
|
| DP p,*pr; |
|
| { |
{ |
| MP m,mr,mr0; |
int n; |
| |
MP m1,m2,mr,mr0; |
| |
P t; |
| |
int tmp; |
| |
MQ q; |
| |
|
| if ( !p ) |
if ( !p1 ) |
| *pr = 0; |
*pr = p2; |
| else { |
else if ( !p2 ) |
| for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
*pr = p1; |
| NEXTMP(mr0,mr); chsgnmp(mod,C(m),&C(mr)); mr->dl = m->dl; |
else { |
| } |
for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) |
| NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
switch ( (*cmpdl)(n,m1->dl,m2->dl) ) { |
| if ( *pr ) |
case 0: |
| (*pr)->sugar = p->sugar; |
if ( NUM(C(m1)) && NUM(C(m2)) ) { |
| } |
tmp = (CONT((MQ)C(m1))+CONT((MQ)C(m2))) - mod; |
| |
if ( tmp < 0 ) |
| |
tmp += mod; |
| |
if ( tmp ) { |
| |
STOMQ(tmp,q); t = (P)q; |
| |
} else |
| |
t = 0; |
| |
} else |
| |
addmp(vl,mod,(P)C(m1),(P)C(m2),&t); |
| |
if ( t ) { |
| |
NEXTMP(mr0,mr); mr->dl = m1->dl; C(mr) = (Obj)t; |
| |
} |
| |
m1 = NEXT(m1); m2 = NEXT(m2); break; |
| |
case 1: |
| |
NEXTMP(mr0,mr); mr->dl = m1->dl; C(mr) = C(m1); |
| |
m1 = NEXT(m1); break; |
| |
case -1: |
| |
NEXTMP(mr0,mr); mr->dl = m2->dl; C(mr) = C(m2); |
| |
m2 = NEXT(m2); break; |
| |
} |
| |
if ( !mr0 ) |
| |
if ( m1 ) |
| |
mr0 = m1; |
| |
else if ( m2 ) |
| |
mr0 = m2; |
| |
else { |
| |
*pr = 0; |
| |
return; |
| |
} |
| |
else if ( m1 ) |
| |
NEXT(mr) = m1; |
| |
else if ( m2 ) |
| |
NEXT(mr) = m2; |
| |
else |
| |
NEXT(mr) = 0; |
| |
MKDP(NV(p1),mr0,*pr); |
| |
if ( *pr ) |
| |
(*pr)->sugar = MAX(p1->sugar,p2->sugar); |
| |
} |
| } |
} |
| |
|
| void mulmd(vl,mod,p1,p2,pr) |
void submd(VL vl,int mod,DP p1,DP p2,DP *pr) |
| VL vl; |
|
| int mod; |
|
| DP p1,p2,*pr; |
|
| { |
{ |
| if ( !do_weyl ) |
DP t; |
| comm_mulmd(vl,mod,p1,p2,pr); |
|
| else |
if ( !p2 ) |
| weyl_mulmd(vl,mod,p1,p2,pr); |
*pr = p1; |
| |
else { |
| |
chsgnmd(mod,p2,&t); addmd(vl,mod,p1,t,pr); |
| |
} |
| } |
} |
| |
|
| void comm_mulmd(vl,mod,p1,p2,pr) |
void chsgnmd(int mod,DP p,DP *pr) |
| VL vl; |
|
| int mod; |
|
| DP p1,p2,*pr; |
|
| { |
{ |
| MP m; |
MP m,mr,mr0; |
| DP s,t,u; |
|
| int i,l,l1; |
|
| static MP *w; |
|
| static int wlen; |
|
| |
|
| if ( !p1 || !p2 ) |
if ( !p ) |
| *pr = 0; |
*pr = 0; |
| else if ( OID(p1) <= O_P ) |
else { |
| mulmdc(vl,mod,p2,(P)p1,pr); |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
| else if ( OID(p2) <= O_P ) |
NEXTMP(mr0,mr); chsgnmp(mod,(P)C(m),(P *)&C(mr)); mr->dl = m->dl; |
| mulmdc(vl,mod,p1,(P)p2,pr); |
} |
| else { |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
| for ( m = BDY(p1), l1 = 0; m; m = NEXT(m), l1++ ); |
if ( *pr ) |
| for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ ); |
(*pr)->sugar = p->sugar; |
| if ( l1 < l ) { |
} |
| t = p1; p1 = p2; p2 = t; |
|
| l = l1; |
|
| } |
|
| if ( l > wlen ) { |
|
| if ( w ) GC_free(w); |
|
| w = (MP *)MALLOC(l*sizeof(MP)); |
|
| wlen = l; |
|
| } |
|
| for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ ) |
|
| w[i] = m; |
|
| for ( s = 0, i = l-1; i >= 0; i-- ) { |
|
| mulmdm(vl,mod,p1,w[i],&t); addmd(vl,mod,s,t,&u); s = u; |
|
| } |
|
| bzero(w,l*sizeof(MP)); |
|
| *pr = s; |
|
| } |
|
| } |
} |
| |
|
| void weyl_mulmd(vl,mod,p1,p2,pr) |
void mulmd(VL vl,int mod,DP p1,DP p2,DP *pr) |
| VL vl; |
|
| int mod; |
|
| DP p1,p2,*pr; |
|
| { |
{ |
| MP m; |
if ( !do_weyl ) |
| DP s,t,u; |
comm_mulmd(vl,mod,p1,p2,pr); |
| int i,l,l1; |
else |
| static MP *w; |
weyl_mulmd(vl,mod,p1,p2,pr); |
| static int wlen; |
|
| |
|
| if ( !p1 || !p2 ) |
|
| *pr = 0; |
|
| else if ( OID(p1) <= O_P ) |
|
| mulmdc(vl,mod,p2,(P)p1,pr); |
|
| else if ( OID(p2) <= O_P ) |
|
| mulmdc(vl,mod,p1,(P)p2,pr); |
|
| else { |
|
| for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ ); |
|
| if ( l > wlen ) { |
|
| if ( w ) GC_free(w); |
|
| w = (MP *)MALLOC(l*sizeof(MP)); |
|
| wlen = l; |
|
| } |
|
| for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ ) |
|
| w[i] = m; |
|
| for ( s = 0, i = l-1; i >= 0; i-- ) { |
|
| weyl_mulmdm(vl,mod,p1,w[i],&t); addmd(vl,mod,s,t,&u); s = u; |
|
| } |
|
| bzero(w,l*sizeof(MP)); |
|
| *pr = s; |
|
| } |
|
| } |
} |
| |
|
| void mulmdm(vl,mod,p,m0,pr) |
void comm_mulmd(VL vl,int mod,DP p1,DP p2,DP *pr) |
| VL vl; |
|
| int mod; |
|
| DP p; |
|
| MP m0; |
|
| DP *pr; |
|
| { |
{ |
| MP m,mr,mr0; |
MP m; |
| P c; |
DP s,t,u; |
| DL d; |
int i,l,l1; |
| int n,t; |
static MP *w; |
| MQ q; |
static int wlen; |
| |
|
| if ( !p ) |
if ( !p1 || !p2 ) |
| *pr = 0; |
*pr = 0; |
| else { |
else if ( OID(p1) <= O_P ) |
| for ( mr0 = 0, m = BDY(p), c = C(m0), d = m0->dl, n = NV(p); |
mulmdc(vl,mod,p2,(P)p1,pr); |
| m; m = NEXT(m) ) { |
else if ( OID(p2) <= O_P ) |
| NEXTMP(mr0,mr); |
mulmdc(vl,mod,p1,(P)p2,pr); |
| if ( NUM(C(m)) && NUM(c) ) { |
else { |
| t = dmar(((MQ)(C(m)))->cont,((MQ)c)->cont,0,mod); |
for ( m = BDY(p1), l1 = 0; m; m = NEXT(m), l1++ ); |
| STOMQ(t,q); C(mr) = (P)q; |
for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ ); |
| } else |
if ( l1 < l ) { |
| mulmp(vl,mod,C(m),c,&C(mr)); |
t = p1; p1 = p2; p2 = t; |
| adddl(n,m->dl,d,&mr->dl); |
l = l1; |
| } |
} |
| NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
if ( l > wlen ) { |
| if ( *pr ) |
if ( w ) GCFREE(w); |
| (*pr)->sugar = p->sugar + m0->dl->td; |
w = (MP *)MALLOC(l*sizeof(MP)); |
| } |
wlen = l; |
| |
} |
| |
for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ ) |
| |
w[i] = m; |
| |
for ( s = 0, i = l-1; i >= 0; i-- ) { |
| |
mulmdm(vl,mod,p1,w[i],&t); addmd(vl,mod,s,t,&u); s = u; |
| |
} |
| |
bzero(w,l*sizeof(MP)); |
| |
*pr = s; |
| |
} |
| } |
} |
| |
|
| void weyl_mulmdm(vl,mod,p,m0,pr) |
void weyl_mulmd(VL vl,int mod,DP p1,DP p2,DP *pr) |
| VL vl; |
|
| int mod; |
|
| DP p; |
|
| MP m0; |
|
| DP *pr; |
|
| { |
{ |
| DP r,t,t1; |
MP m; |
| MP m; |
DP s,t,u; |
| int n,l,i; |
int i,l; |
| static MP *w; |
static MP *w; |
| static int wlen; |
static int wlen; |
| |
|
| if ( !p ) |
if ( !p1 || !p2 ) |
| *pr = 0; |
*pr = 0; |
| else { |
else if ( OID(p1) <= O_P ) |
| for ( m = BDY(p), l = 0; m; m = NEXT(m), l++ ); |
mulmdc(vl,mod,p2,(P)p1,pr); |
| if ( l > wlen ) { |
else if ( OID(p2) <= O_P ) |
| if ( w ) GC_free(w); |
mulmdc(vl,mod,p1,(P)p2,pr); |
| w = (MP *)MALLOC(l*sizeof(MP)); |
else { |
| wlen = l; |
for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ ); |
| } |
if ( l > wlen ) { |
| for ( m = BDY(p), i = 0; i < l; m = NEXT(m), i++ ) |
if ( w ) GCFREE(w); |
| w[i] = m; |
w = (MP *)MALLOC(l*sizeof(MP)); |
| for ( r = 0, i = l-1, n = NV(p); i >= 0; i-- ) { |
wlen = l; |
| weyl_mulmmm(vl,mod,w[i],m0,n,&t); |
} |
| addmd(vl,mod,r,t,&t1); r = t1; |
for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ ) |
| } |
w[i] = m; |
| bzero(w,l*sizeof(MP)); |
for ( s = 0, i = l-1; i >= 0; i-- ) { |
| if ( r ) |
weyl_mulmdm(vl,mod,p1,w[i],&t); addmd(vl,mod,s,t,&u); s = u; |
| r->sugar = p->sugar + m0->dl->td; |
} |
| *pr = r; |
bzero(w,l*sizeof(MP)); |
| } |
*pr = s; |
| |
} |
| } |
} |
| |
|
| /* m0 = x0^d0*x1^d1*... * dx0^d(n/2)*dx1^d(n/2+1)*... */ |
void mulmdm(VL vl,int mod,DP p,MP m0,DP *pr) |
| |
|
| void weyl_mulmmm(vl,mod,m0,m1,n,pr) |
|
| VL vl; |
|
| int mod; |
|
| MP m0,m1; |
|
| int n; |
|
| DP *pr; |
|
| { |
{ |
| MP m,mr,mr0; |
MP m,mr,mr0; |
| MQ mq; |
P c; |
| DP r,t,t1; |
DL d; |
| P c,c0,c1,cc; |
int n,t; |
| DL d,d0,d1; |
MQ q; |
| int i,j,a,b,k,l,n2,s,min; |
|
| static int *tab; |
|
| static int tablen; |
|
| |
|
| if ( !m0 || !m1 ) |
if ( !p ) |
| *pr = 0; |
*pr = 0; |
| else { |
else { |
| c0 = C(m0); c1 = C(m1); |
for ( mr0 = 0, m = BDY(p), c = (P)C(m0), d = m0->dl, n = NV(p); |
| mulmp(vl,mod,c0,c1,&c); |
m; m = NEXT(m) ) { |
| d0 = m0->dl; d1 = m1->dl; |
NEXTMP(mr0,mr); |
| n2 = n>>1; |
if ( NUM(C(m)) && NUM(c) ) { |
| if ( n & 1 ) { |
t = dmar(((MQ)(C(m)))->cont,((MQ)c)->cont,0,mod); |
| /* homogenized computation; dx-xd=h^2 */ |
STOMQ(t,q); C(mr) = (Obj)q; |
| /* offset of h-degree */ |
} else |
| NEWDL(d,n); |
mulmp(vl,mod,(P)C(m),c,(P *)&C(mr)); |
| d->td = d->d[n-1] = d0->d[n-1]+d1->d[n-1]; |
adddl(n,m->dl,d,&mr->dl); |
| NEWMP(mr); mr->c = (P)ONEM; mr->dl = d; NEXT(mr) = 0; |
} |
| MKDP(n,mr,r); r->sugar = d->td; |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
| } else |
if ( *pr ) |
| r = (DP)ONEM; |
(*pr)->sugar = p->sugar + m0->dl->td; |
| for ( i = 0; i < n2; i++ ) { |
} |
| a = d0->d[i]; b = d1->d[n2+i]; |
|
| k = d0->d[n2+i]; l = d1->d[i]; |
|
| /* degree of xi^a*(Di^k*xi^l)*Di^b */ |
|
| s = a+k+l+b; |
|
| /* compute xi^a*(Di^k*xi^l)*Di^b */ |
|
| min = MIN(k,l); |
|
| |
|
| if ( min+1 > tablen ) { |
|
| if ( tab ) GC_free(tab); |
|
| tab = (int *)MALLOC((min+1)*sizeof(int)); |
|
| tablen = min+1; |
|
| } |
|
| mkwcm(k,l,mod,tab); |
|
| if ( n & 1 ) |
|
| for ( mr0 = 0, j = 0; j <= min; j++ ) { |
|
| NEXTMP(mr0,mr); NEWDL(d,n); |
|
| d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
|
| d->td = s; |
|
| d->d[n-1] = s-(d->d[i]+d->d[n2+i]); |
|
| STOMQ(tab[j],mq); mr->c = (P)mq; mr->dl = d; |
|
| } |
|
| else |
|
| for ( mr0 = 0, s = 0, j = 0; j <= min; j++ ) { |
|
| NEXTMP(mr0,mr); NEWDL(d,n); |
|
| d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
|
| d->td = d->d[i]+d->d[n2+i]; /* XXX */ |
|
| s = MAX(s,d->td); /* XXX */ |
|
| STOMQ(tab[j],mq); mr->c = (P)mq; mr->dl = d; |
|
| } |
|
| bzero(tab,(min+1)*sizeof(int)); |
|
| if ( mr0 ) |
|
| NEXT(mr) = 0; |
|
| MKDP(n,mr0,t); |
|
| if ( t ) |
|
| t->sugar = s; |
|
| comm_mulmd(vl,mod,r,t,&t1); r = t1; |
|
| } |
|
| mulmdc(vl,mod,r,c,pr); |
|
| } |
|
| } |
} |
| |
|
| void mulmdc(vl,mod,p,c,pr) |
void weyl_mulmdm(VL vl,int mod,DP p,MP m0,DP *pr) |
| VL vl; |
|
| int mod; |
|
| DP p; |
|
| P c; |
|
| DP *pr; |
|
| { |
{ |
| MP m,mr,mr0; |
DP r,t,t1; |
| int t; |
MP m; |
| MQ q; |
int n,l,i; |
| |
static MP *w; |
| |
static int wlen; |
| |
|
| if ( !p || !c ) |
if ( !p ) |
| *pr = 0; |
*pr = 0; |
| else { |
else { |
| for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
for ( m = BDY(p), l = 0; m; m = NEXT(m), l++ ); |
| NEXTMP(mr0,mr); |
if ( l > wlen ) { |
| if ( NUM(C(m)) && NUM(c) ) { |
if ( w ) GCFREE(w); |
| t = dmar(((MQ)(C(m)))->cont,((MQ)c)->cont,0,mod); |
w = (MP *)MALLOC(l*sizeof(MP)); |
| STOMQ(t,q); C(mr) = (P)q; |
wlen = l; |
| } else |
} |
| mulmp(vl,mod,C(m),c,&C(mr)); |
for ( m = BDY(p), i = 0; i < l; m = NEXT(m), i++ ) |
| mr->dl = m->dl; |
w[i] = m; |
| } |
for ( r = 0, i = l-1, n = NV(p); i >= 0; i-- ) { |
| NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
weyl_mulmmm(vl,mod,w[i],m0,n,&t); |
| if ( *pr ) |
addmd(vl,mod,r,t,&t1); r = t1; |
| (*pr)->sugar = p->sugar; |
} |
| } |
bzero(w,l*sizeof(MP)); |
| |
if ( r ) |
| |
r->sugar = p->sugar + m0->dl->td; |
| |
*pr = r; |
| |
} |
| } |
} |
| |
|
| void divsmdc(vl,mod,p,c,pr) |
/* m0 = x0^d0*x1^d1*... * dx0^d(n/2)*dx1^d(n/2+1)*... */ |
| VL vl; |
|
| int mod; |
void weyl_mulmmm(VL vl,int mod,MP m0,MP m1,int n,DP *pr) |
| DP p; |
|
| P c; |
|
| DP *pr; |
|
| { |
{ |
| MP m,mr,mr0; |
MP mr,mr0; |
| |
MQ mq; |
| |
DP r,t,t1; |
| |
P c,c0,c1; |
| |
DL d,d0,d1; |
| |
int i,j,a,b,k,l,n2,s,min; |
| |
static int *tab; |
| |
static int tablen; |
| |
|
| if ( !c ) |
if ( !m0 || !m1 ) |
| error("disvsdc : division by 0"); |
*pr = 0; |
| else if ( !p ) |
else { |
| *pr = 0; |
c0 = (P)C(m0); c1 = (P)C(m1); |
| else { |
mulmp(vl,mod,c0,c1,&c); |
| for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
d0 = m0->dl; d1 = m1->dl; |
| NEXTMP(mr0,mr); divsmp(vl,mod,C(m),c,&C(mr)); mr->dl = m->dl; |
n2 = n>>1; |
| } |
if ( n & 1 ) { |
| NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
/* homogenized computation; dx-xd=h^2 */ |
| if ( *pr ) |
/* offset of h-degree */ |
| (*pr)->sugar = p->sugar; |
NEWDL(d,n); |
| } |
d->td = d->d[n-1] = d0->d[n-1]+d1->d[n-1]; |
| } |
NEWMP(mr); mr->c = (Obj)ONEM; mr->dl = d; NEXT(mr) = 0; |
| |
MKDP(n,mr,r); r->sugar = d->td; |
| |
} else |
| |
r = (DP)ONEM; |
| |
for ( i = 0; i < n2; i++ ) { |
| |
a = d0->d[i]; b = d1->d[n2+i]; |
| |
k = d0->d[n2+i]; l = d1->d[i]; |
| |
|
| void _mdtop(vl,mod,dvl,p,pr) |
/* degree of xi^a*(Di^k*xi^l)*Di^b */ |
| VL vl,dvl; |
a += l; |
| int mod; |
b += k; |
| DP p; |
s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i); |
| P *pr; |
|
| { |
|
| int n,i; |
|
| DL d; |
|
| MP m; |
|
| P r,s,t,u,w; |
|
| Q q; |
|
| MQ tq; |
|
| VL tvl; |
|
| |
|
| if ( !p ) |
/* compute xi^a*(Di^k*xi^l)*Di^b */ |
| *pr = 0; |
min = MIN(k,l); |
| else { |
|
| for ( n = p->nv, m = BDY(p), s = 0; m; m = NEXT(m) ) { |
if ( min+1 > tablen ) { |
| STOMQ(ITOS(C(m)),tq); t = (P)tq; |
if ( tab ) GCFREE(tab); |
| for ( i = 0, d = m->dl, tvl = dvl; |
tab = (int *)MALLOC((min+1)*sizeof(int)); |
| i < n; tvl = NEXT(tvl), i++ ) { |
tablen = min+1; |
| MKV(tvl->v,r); STOQ(d->d[i],q); pwrmp(vl,mod,r,q,&u); |
} |
| mulmp(vl,mod,t,u,&w); t = w; |
mkwcm(k,l,mod,tab); |
| } |
if ( n & 1 ) |
| addmp(vl,mod,s,t,&u); s = u; |
for ( mr0 = 0, j = 0; j <= min; j++ ) { |
| } |
NEXTMP(mr0,mr); NEWDL(d,n); |
| mptop(s,pr); |
d->d[i] = a-j; d->d[n2+i] = b-j; |
| } |
d->td = s; |
| |
d->d[n-1] = s-(MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i)); |
| |
STOMQ(tab[j],mq); mr->c = (Obj)mq; mr->dl = d; |
| |
} |
| |
else |
| |
for ( mr0 = 0, s = 0, j = 0; j <= min; j++ ) { |
| |
NEXTMP(mr0,mr); NEWDL(d,n); |
| |
d->d[i] = a-j; d->d[n2+i] = b-j; |
| |
d->td = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i); /* XXX */ |
| |
s = MAX(s,d->td); /* XXX */ |
| |
STOMQ(tab[j],mq); mr->c = (Obj)mq; mr->dl = d; |
| |
} |
| |
bzero(tab,(min+1)*sizeof(int)); |
| |
if ( mr0 ) |
| |
NEXT(mr) = 0; |
| |
MKDP(n,mr0,t); |
| |
if ( t ) |
| |
t->sugar = s; |
| |
comm_mulmd(vl,mod,r,t,&t1); r = t1; |
| |
} |
| |
mulmdc(vl,mod,r,c,pr); |
| |
} |
| } |
} |
| |
|
| void _addmd(vl,mod,p1,p2,pr) |
void mulmdc(VL vl,int mod,DP p,P c,DP *pr) |
| VL vl; |
|
| int mod; |
|
| DP p1,p2,*pr; |
|
| { |
{ |
| int n; |
MP m,mr,mr0; |
| MP m1,m2,mr,mr0; |
int t; |
| int t; |
MQ q; |
| |
|
| if ( !p1 ) |
if ( !p || !c ) |
| *pr = p2; |
*pr = 0; |
| else if ( !p2 ) |
else { |
| *pr = p1; |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
| else { |
NEXTMP(mr0,mr); |
| for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) |
if ( NUM(C(m)) && NUM(c) ) { |
| switch ( (*cmpdl)(n,m1->dl,m2->dl) ) { |
t = dmar(((MQ)(C(m)))->cont,((MQ)c)->cont,0,mod); |
| case 0: |
STOMQ(t,q); C(mr) = (Obj)q; |
| t = (ITOS(C(m1))+ITOS(C(m2))) - mod; |
} else |
| if ( t < 0 ) |
mulmp(vl,mod,(P)C(m),c,(P *)&C(mr)); |
| t += mod; |
mr->dl = m->dl; |
| if ( t ) { |
} |
| NEXTMP(mr0,mr); mr->dl = m1->dl; C(mr) = STOI(t); |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
| } |
if ( *pr ) |
| m1 = NEXT(m1); m2 = NEXT(m2); break; |
(*pr)->sugar = p->sugar; |
| case 1: |
} |
| NEXTMP(mr0,mr); mr->dl = m1->dl; C(mr) = C(m1); |
|
| m1 = NEXT(m1); break; |
|
| case -1: |
|
| NEXTMP(mr0,mr); mr->dl = m2->dl; C(mr) = C(m2); |
|
| m2 = NEXT(m2); break; |
|
| } |
|
| if ( !mr0 ) |
|
| if ( m1 ) |
|
| mr0 = m1; |
|
| else if ( m2 ) |
|
| mr0 = m2; |
|
| else { |
|
| *pr = 0; |
|
| return; |
|
| } |
|
| else if ( m1 ) |
|
| NEXT(mr) = m1; |
|
| else if ( m2 ) |
|
| NEXT(mr) = m2; |
|
| else |
|
| NEXT(mr) = 0; |
|
| MKDP(NV(p1),mr0,*pr); |
|
| if ( *pr ) |
|
| (*pr)->sugar = MAX(p1->sugar,p2->sugar); |
|
| } |
|
| } |
} |
| |
|
| void _submd(vl,mod,p1,p2,pr) |
void divsmdc(VL vl,int mod,DP p,P c,DP *pr) |
| VL vl; |
|
| int mod; |
|
| DP p1,p2,*pr; |
|
| { |
{ |
| DP t; |
MP m,mr,mr0; |
| |
|
| if ( !p2 ) |
if ( !c ) |
| *pr = p1; |
error("disvsdc : division by 0"); |
| else { |
else if ( !p ) |
| _chsgnmd(mod,p2,&t); _addmd(vl,mod,p1,t,pr); |
*pr = 0; |
| } |
else { |
| |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
| |
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); |
| |
if ( *pr ) |
| |
(*pr)->sugar = p->sugar; |
| |
} |
| } |
} |
| |
|
| void _chsgnmd(mod,p,pr) |
void _dtop_mod(VL vl,VL dvl,DP p,P *pr) |
| int mod; |
|
| DP p,*pr; |
|
| { |
{ |
| MP m,mr,mr0; |
int n,i; |
| |
DL d; |
| |
MP m; |
| |
P r,s,t,u,w; |
| |
Q q; |
| |
VL tvl; |
| |
|
| if ( !p ) |
if ( !p ) |
| *pr = 0; |
*pr = 0; |
| else { |
else { |
| for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
for ( n = p->nv, m = BDY(p), s = 0; m; m = NEXT(m) ) { |
| NEXTMP(mr0,mr); C(mr) = STOI(mod - ITOS(C(m))); mr->dl = m->dl; |
i = ITOS(m->c); STOQ(i,q); t = (P)q; |
| } |
for ( i = 0, d = m->dl, tvl = dvl; |
| NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
i < n; tvl = NEXT(tvl), i++ ) { |
| if ( *pr ) |
MKV(tvl->v,r); STOQ(d->d[i],q); pwrp(vl,r,q,&u); |
| (*pr)->sugar = p->sugar; |
mulp(vl,t,u,&w); t = w; |
| } |
} |
| |
addp(vl,s,t,&u); s = u; |
| |
} |
| |
*pr = s; |
| |
} |
| } |
} |
| |
|
| void _mulmd(vl,mod,p1,p2,pr) |
void _dp_mod(DP p,int mod,NODE subst,DP *rp) |
| VL vl; |
|
| int mod; |
|
| DP p1,p2,*pr; |
|
| { |
{ |
| if ( !do_weyl ) |
MP m,mr,mr0; |
| _comm_mulmd(vl,mod,p1,p2,pr); |
P t,s; |
| else |
NODE tn; |
| _weyl_mulmd(vl,mod,p1,p2,pr); |
|
| |
if ( !p ) |
| |
*rp = 0; |
| |
else { |
| |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
| |
for ( tn = subst, s = (P)m->c; tn; tn = NEXT(NEXT(tn)) ) { |
| |
substp(CO,s,BDY(tn),BDY(NEXT(tn)),&t); |
| |
s = t; |
| |
} |
| |
ptomp(mod,s,&t); |
| |
if ( t ) { |
| |
NEXTMP(mr0,mr); mr->c = (Obj)STOI(CONT((MQ)t)); mr->dl = m->dl; |
| |
} |
| |
} |
| |
if ( mr0 ) { |
| |
NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar; |
| |
} else |
| |
*rp = 0; |
| |
} |
| } |
} |
| |
|
| void _comm_mulmd(vl,mod,p1,p2,pr) |
void _dp_monic(DP p,int mod,DP *rp) |
| VL vl; |
|
| int mod; |
|
| DP p1,p2,*pr; |
|
| { |
{ |
| MP m; |
MP m,mr,mr0; |
| DP s,t,u; |
int c,c1; |
| int i,l,l1; |
|
| static MP *w; |
|
| static int wlen; |
|
| |
|
| if ( !p1 || !p2 ) |
if ( !p ) |
| *pr = 0; |
*rp = 0; |
| else { |
else { |
| for ( m = BDY(p1), l1 = 0; m; m = NEXT(m), l1++ ); |
c = invm(ITOS(BDY(p)->c),mod); |
| for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ ); |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
| if ( l1 < l ) { |
c1 = dmar(ITOS(m->c),c,0,mod); |
| t = p1; p1 = p2; p2 = t; |
NEXTMP(mr0,mr); mr->c = (Obj)STOI(c1); mr->dl = m->dl; |
| l = l1; |
} |
| } |
NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar; |
| if ( l > wlen ) { |
} |
| if ( w ) GC_free(w); |
|
| w = (MP *)MALLOC(l*sizeof(MP)); |
|
| wlen = l; |
|
| } |
|
| for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ ) |
|
| w[i] = m; |
|
| for ( s = 0, i = l-1; i >= 0; i-- ) { |
|
| _mulmdm(vl,mod,p1,w[i],&t); _addmd(vl,mod,s,t,&u); s = u; |
|
| } |
|
| bzero(w,l*sizeof(MP)); |
|
| *pr = s; |
|
| } |
|
| } |
} |
| |
|
| void _weyl_mulmd(vl,mod,p1,p2,pr) |
void _printdp(DP d) |
| VL vl; |
|
| int mod; |
|
| DP p1,p2,*pr; |
|
| { |
{ |
| MP m; |
int n,i; |
| DP s,t,u; |
MP m; |
| int i,l,l1; |
DL dl; |
| static MP *w; |
|
| static int wlen; |
|
| |
|
| if ( !p1 || !p2 ) |
if ( !d ) { |
| *pr = 0; |
printf("0"); return; |
| else { |
} |
| for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ ); |
for ( n = d->nv, m = BDY(d); m; m = NEXT(m) ) { |
| if ( l > wlen ) { |
printf("%d*<<",ITOS(m->c)); |
| if ( w ) GC_free(w); |
for ( i = 0, dl = m->dl; i < n-1; i++ ) |
| w = (MP *)MALLOC(l*sizeof(MP)); |
printf("%d,",dl->d[i]); |
| wlen = l; |
printf("%d",dl->d[i]); |
| } |
printf(">>"); |
| for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ ) |
if ( NEXT(m) ) |
| w[i] = m; |
printf("+"); |
| for ( s = 0, i = l-1; i >= 0; i-- ) { |
} |
| _weyl_mulmdm(vl,mod,p1,w[i],&t); _addmd(vl,mod,s,t,&u); s = u; |
|
| } |
|
| bzero(w,l*sizeof(MP)); |
|
| *pr = s; |
|
| } |
|
| } |
} |
| |
|
| void _mulmdm(vl,mod,p,m0,pr) |
/* merge p1 and p2 into pr */ |
| VL vl; |
|
| int mod; |
void addmd_destructive(int mod,DP p1,DP p2,DP *pr) |
| DP p; |
|
| MP m0; |
|
| DP *pr; |
|
| { |
{ |
| MP m,mr,mr0; |
int n; |
| DL d; |
MP m1,m2,mr,mr0,s; |
| int c,n,r; |
int t; |
| |
|
| if ( !p ) |
if ( !p1 ) |
| *pr = 0; |
*pr = p2; |
| else { |
else if ( !p2 ) |
| for ( mr0 = 0, m = BDY(p), c = ITOS(C(m0)), d = m0->dl, n = NV(p); |
*pr = p1; |
| m; m = NEXT(m) ) { |
else { |
| NEXTMP(mr0,mr); |
for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) |
| C(mr) = STOI(dmar(ITOS(C(m)),c,0,mod)); |
switch ( (*cmpdl)(n,m1->dl,m2->dl) ) { |
| adddl(n,m->dl,d,&mr->dl); |
case 0: |
| } |
t = (ITOS(C(m1))+ITOS(C(m2))) - mod; |
| NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
if ( t < 0 ) |
| if ( *pr ) |
t += mod; |
| (*pr)->sugar = p->sugar + m0->dl->td; |
s = m1; m1 = NEXT(m1); |
| } |
if ( t ) { |
| |
NEXTMP2(mr0,mr,s); C(mr) = (Obj)STOI(t); |
| |
} |
| |
s = m2; m2 = NEXT(m2); |
| |
break; |
| |
case 1: |
| |
s = m1; m1 = NEXT(m1); NEXTMP2(mr0,mr,s); |
| |
break; |
| |
case -1: |
| |
s = m2; m2 = NEXT(m2); NEXTMP2(mr0,mr,s); |
| |
break; |
| |
} |
| |
if ( !mr0 ) |
| |
if ( m1 ) |
| |
mr0 = m1; |
| |
else if ( m2 ) |
| |
mr0 = m2; |
| |
else { |
| |
*pr = 0; |
| |
return; |
| |
} |
| |
else if ( m1 ) |
| |
NEXT(mr) = m1; |
| |
else if ( m2 ) |
| |
NEXT(mr) = m2; |
| |
else |
| |
NEXT(mr) = 0; |
| |
MKDP(NV(p1),mr0,*pr); |
| |
if ( *pr ) |
| |
(*pr)->sugar = MAX(p1->sugar,p2->sugar); |
| |
} |
| } |
} |
| |
|
| void _weyl_mulmdm(vl,mod,p,m0,pr) |
void mulmd_dup(int mod,DP p1,DP p2,DP *pr) |
| VL vl; |
|
| int mod; |
|
| DP p; |
|
| MP m0; |
|
| DP *pr; |
|
| { |
{ |
| DP r,t,t1; |
if ( !do_weyl ) |
| MP m; |
comm_mulmd_dup(mod,p1,p2,pr); |
| int n,l,i; |
else |
| static MP *w; |
weyl_mulmd_dup(mod,p1,p2,pr); |
| static int wlen; |
|
| |
|
| if ( !p ) |
|
| *pr = 0; |
|
| else { |
|
| for ( m = BDY(p), l = 0; m; m = NEXT(m), l++ ); |
|
| if ( l > wlen ) { |
|
| if ( w ) GC_free(w); |
|
| w = (MP *)MALLOC(l*sizeof(MP)); |
|
| wlen = l; |
|
| } |
|
| for ( m = BDY(p), i = 0; i < l; m = NEXT(m), i++ ) |
|
| w[i] = m; |
|
| for ( r = 0, i = l-1, n = NV(p); i >= 0; i-- ) { |
|
| _weyl_mulmmm(vl,mod,w[i],m0,n,&t); |
|
| _addmd(vl,mod,r,t,&t1); r = t1; |
|
| } |
|
| bzero(w,l*sizeof(MP)); |
|
| if ( r ) |
|
| r->sugar = p->sugar + m0->dl->td; |
|
| *pr = r; |
|
| } |
|
| } |
} |
| |
|
| /* m0 = x0^d0*x1^d1*... * dx0^d(n/2)*dx1^d(n/2+1)*... */ |
void comm_mulmd_dup(int mod,DP p1,DP p2,DP *pr) |
| |
|
| void _weyl_mulmmm(vl,mod,m0,m1,n,pr) |
|
| VL vl; |
|
| int mod; |
|
| MP m0,m1; |
|
| int n; |
|
| DP *pr; |
|
| { |
{ |
| MP m,mr,mr0; |
MP m; |
| DP r,t,t1; |
DP s,t,u; |
| int c,c0,c1,cc; |
int i,l,l1; |
| DL d,d0,d1; |
static MP *w; |
| int i,j,a,b,k,l,n2,s,min,h; |
static int wlen; |
| static int *tab; |
|
| static int tablen; |
|
| |
|
| if ( !m0 || !m1 ) |
if ( !p1 || !p2 ) |
| *pr = 0; |
*pr = 0; |
| else { |
else { |
| c0 = ITOS(C(m0)); c1 = ITOS(C(m1)); |
for ( m = BDY(p1), l1 = 0; m; m = NEXT(m), l1++ ); |
| c = dmar(c0,c1,0,mod); |
for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ ); |
| d0 = m0->dl; d1 = m1->dl; |
if ( l1 < l ) { |
| n2 = n>>1; |
t = p1; p1 = p2; p2 = t; |
| |
l = l1; |
| NEWDL(d,n); |
} |
| if ( n & 1 ) |
if ( l > wlen ) { |
| /* offset of h-degree */ |
if ( w ) GCFREE(w); |
| d->td = d->d[n-1] = d0->d[n-1]+d1->d[n-1]; |
w = (MP *)MALLOC(l*sizeof(MP)); |
| else |
wlen = l; |
| d->td = 0; |
} |
| NEWMP(mr); mr->c = STOI(c); mr->dl = d; NEXT(mr) = 0; |
for ( m = BDY(p2), i = 0; i < l; m = NEXT(m), i++ ) |
| MKDP(n,mr,r); r->sugar = d->td; |
w[i] = m; |
| |
for ( s = 0, i = l-1; i >= 0; i-- ) { |
| /* homogenized computation; dx-xd=h^2 */ |
mulmdm_dup(mod,p1,w[i],&t); addmd_destructive(mod,s,t,&u); s = u; |
| for ( i = 0; i < n2; i++ ) { |
} |
| a = d0->d[i]; b = d1->d[n2+i]; |
bzero(w,l*sizeof(MP)); |
| k = d0->d[n2+i]; l = d1->d[i]; |
*pr = s; |
| /* degree of xi^a*(Di^k*xi^l)*Di^b */ |
} |
| s = a+k+l+b; |
|
| /* compute xi^a*(Di^k*xi^l)*Di^b */ |
|
| min = MIN(k,l); |
|
| |
|
| if ( min+1 > tablen ) { |
|
| if ( tab ) GC_free(tab); |
|
| tab = (int *)MALLOC((min+1)*sizeof(int)); |
|
| tablen = min+1; |
|
| } |
|
| mkwcm(k,l,mod,tab); |
|
| if ( n & 1 ) |
|
| for ( mr0 = 0, j = 0; j <= min; j++ ) { |
|
| NEXTMP(mr0,mr); NEWDL(d,n); |
|
| d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
|
| d->td = s; |
|
| d->d[n-1] = s-(d->d[i]+d->d[n2+i]); |
|
| mr->c = STOI(tab[j]); mr->dl = d; |
|
| } |
|
| else |
|
| for ( mr0 = 0, s = 0, j = 0; j <= min; j++ ) { |
|
| NEXTMP(mr0,mr); NEWDL(d,n); |
|
| d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
|
| d->td = d->d[i]+d->d[n2+i]; /* XXX */ |
|
| s = MAX(s,d->td); /* XXX */ |
|
| mr->c = STOI(tab[j]); mr->dl = d; |
|
| } |
|
| bzero(tab,(min+1)*sizeof(int)); |
|
| if ( mr0 ) |
|
| NEXT(mr) = 0; |
|
| MKDP(n,mr0,t); |
|
| if ( t ) |
|
| t->sugar = s; |
|
| _comm_mulmd(vl,mod,r,t,&t1); r = t1; |
|
| } |
|
| *pr = r; |
|
| } |
|
| } |
} |
| |
|
| void _dtop_mod(vl,dvl,p,pr) |
void weyl_mulmd_dup(int mod,DP p1,DP p2,DP *pr) |
| VL vl,dvl; |
|
| DP p; |
|
| P *pr; |
|
| { |
{ |
| int n,i; |
MP m; |
| DL d; |
DP s,t,u; |
| MP m; |
int i,l; |
| P r,s,t,u,w; |
static MP *w; |
| Q q; |
static int wlen; |
| VL tvl; |
|
| |
|
| if ( !p ) |
if ( !p1 || !p2 ) |
| *pr = 0; |
*pr = 0; |
| else { |
else { |
| for ( n = p->nv, m = BDY(p), s = 0; m; m = NEXT(m) ) { |
for ( m = BDY(p1), l = 0; m; m = NEXT(m), l++ ); |
| i = ITOS(m->c); STOQ(i,q); t = (P)q; |
if ( l > wlen ) { |
| for ( i = 0, d = m->dl, tvl = dvl; |
if ( w ) GCFREE(w); |
| i < n; tvl = NEXT(tvl), i++ ) { |
w = (MP *)MALLOC(l*sizeof(MP)); |
| MKV(tvl->v,r); STOQ(d->d[i],q); pwrp(vl,r,q,&u); |
wlen = l; |
| mulp(vl,t,u,&w); t = w; |
} |
| } |
for ( m = BDY(p1), i = 0; i < l; m = NEXT(m), i++ ) |
| addp(vl,s,t,&u); s = u; |
w[i] = m; |
| } |
for ( s = 0, i = l-1; i >= 0; i-- ) { |
| *pr = s; |
weyl_mulmdm_dup(mod,w[i],p2,&t); addmd_destructive(mod,s,t,&u); s = u; |
| } |
} |
| |
bzero(w,l*sizeof(MP)); |
| |
*pr = s; |
| |
} |
| } |
} |
| |
|
| void _dp_red_mod(p1,p2,mod,rp) |
void mulmdm_dup(int mod,DP p,MP m0,DP *pr) |
| DP p1,p2; |
|
| int mod; |
|
| DP *rp; |
|
| { |
{ |
| int i,n; |
MP m,mr,mr0; |
| DL d1,d2,d; |
DL d,dt,dm; |
| MP m; |
int c,n,i; |
| DP t,s; |
int *pt,*p1,*p2; |
| int c,c1; |
|
| |
|
| n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
if ( !p ) |
| NEWDL(d,n); d->td = d1->td - d2->td; |
*pr = 0; |
| for ( i = 0; i < n; i++ ) |
else { |
| d->d[i] = d1->d[i]-d2->d[i]; |
for ( mr0 = 0, m = BDY(p), c = ITOS(C(m0)), d = m0->dl, n = NV(p); |
| c = invm(ITOS(BDY(p2)->c),mod); c1 = dmar(c,ITOS(BDY(p1)->c),0,mod); |
m; m = NEXT(m) ) { |
| NEWMP(m); m->dl = d; m->c = STOI(mod-c1); NEXT(m) = 0; |
NEXTMP(mr0,mr); |
| MKDP(n,m,s); s->sugar = d->td; |
C(mr) = (Obj)STOI(dmar(ITOS(C(m)),c,0,mod)); |
| _mulmd(CO,mod,s,p2,&t); _addmd(CO,mod,p1,t,rp); |
NEWDL_NOINIT(dt,n); mr->dl = dt; |
| |
dm = m->dl; |
| |
dt->td = d->td + dm->td; |
| |
for ( i = 0, pt = dt->d, p1=d->d, p2 = dm->d; i < n; i++ ) |
| |
*pt++ = *p1++ + *p2++; |
| |
} |
| |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
| |
if ( *pr ) |
| |
(*pr)->sugar = p->sugar + m0->dl->td; |
| |
} |
| } |
} |
| |
|
| void _dp_mod(p,mod,subst,rp) |
void weyl_mulmdm_dup(int mod,MP m0,DP p,DP *pr) |
| DP p; |
|
| int mod; |
|
| NODE subst; |
|
| DP *rp; |
|
| { |
{ |
| MP m,mr,mr0; |
DP r,t,t1; |
| P t,s; |
MP m; |
| NODE tn; |
DL d0; |
| |
int n,n2,l,i,j,tlen; |
| |
static MP *w,*psum; |
| |
static struct cdlm *tab; |
| |
static int wlen; |
| |
static int rtlen; |
| |
|
| if ( !p ) |
if ( !p ) |
| *rp = 0; |
*pr = 0; |
| else { |
else { |
| for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
for ( m = BDY(p), l = 0; m; m = NEXT(m), l++ ); |
| for ( tn = subst, s = m->c; tn; tn = NEXT(NEXT(tn)) ) { |
if ( l > wlen ) { |
| substp(CO,s,BDY(tn),BDY(NEXT(tn)),&t); |
if ( w ) GCFREE(w); |
| s = t; |
w = (MP *)MALLOC(l*sizeof(MP)); |
| } |
wlen = l; |
| ptomp(mod,s,&t); |
} |
| if ( t ) { |
for ( m = BDY(p), i = 0; i < l; m = NEXT(m), i++ ) |
| NEXTMP(mr0,mr); mr->c = STOI(CONT((MQ)t)); mr->dl = m->dl; |
w[i] = m; |
| } |
n = NV(p); n2 = n>>1; |
| } |
d0 = m0->dl; |
| if ( mr0 ) { |
|
| NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar; |
for ( i = 0, tlen = 1; i < n2; i++ ) |
| } else |
tlen *= d0->d[n2+i]+1; |
| *rp = 0; |
if ( tlen > rtlen ) { |
| } |
if ( tab ) GCFREE(tab); |
| |
if ( psum ) GCFREE(psum); |
| |
rtlen = tlen; |
| |
tab = (struct cdlm *)MALLOC(rtlen*sizeof(struct cdlm)); |
| |
psum = (MP *)MALLOC(rtlen*sizeof(MP)); |
| |
} |
| |
bzero(psum,tlen*sizeof(MP)); |
| |
for ( i = l-1; i >= 0; i-- ) { |
| |
bzero(tab,tlen*sizeof(struct cdlm)); |
| |
weyl_mulmmm_dup(mod,m0,w[i],n,tab,tlen); |
| |
for ( j = 0; j < tlen; j++ ) { |
| |
if ( tab[j].c ) { |
| |
NEWMP(m); m->dl = tab[j].d; |
| |
C(m) = (Obj)STOI(tab[j].c); NEXT(m) = psum[j]; |
| |
psum[j] = m; |
| |
} |
| |
} |
| |
} |
| |
for ( j = tlen-1, r = 0; j >= 0; j-- ) |
| |
if ( psum[j] ) { |
| |
MKDP(n,psum[j],t); addmd_destructive(mod,r,t,&t1); r = t1; |
| |
} |
| |
if ( r ) |
| |
r->sugar = p->sugar + m0->dl->td; |
| |
*pr = r; |
| |
} |
| } |
} |
| |
|
| void _dp_monic(p,mod,rp) |
/* m0 = x0^d0*x1^d1*... * dx0^d(n/2)*dx1^d(n/2+1)*... */ |
| DP p; |
|
| int mod; |
void weyl_mulmmm_dup(int mod,MP m0,MP m1,int n,struct cdlm *rtab,int rtablen) |
| DP *rp; |
|
| { |
{ |
| MP m,mr,mr0; |
int c,c0,c1; |
| int c,c1; |
DL d,d0,d1,dt; |
| NODE tn; |
int i,j,a,b,k,l,n2,s,min,curlen; |
| |
struct cdlm *p; |
| |
static int *ctab; |
| |
static struct cdlm *tab; |
| |
static int tablen; |
| |
static struct cdlm *tmptab; |
| |
static int tmptablen; |
| |
|
| if ( !p ) |
if ( !m0 || !m1 ) { |
| *rp = 0; |
rtab[0].c = 0; |
| else { |
rtab[0].d = 0; |
| c = invm(ITOS(BDY(p)->c),mod); |
return; |
| for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
} |
| c1 = dmar(ITOS(m->c),c,0,mod); |
c0 = ITOS(C(m0)); c1 = ITOS(C(m1)); |
| NEXTMP(mr0,mr); mr->c = STOI(c1); mr->dl = m->dl; |
c = dmar(c0,c1,0,mod); |
| } |
d0 = m0->dl; d1 = m1->dl; |
| NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar; |
n2 = n>>1; |
| } |
curlen = 1; |
| } |
|
| |
|
| void _dp_sp_mod(p1,p2,mod,rp) |
NEWDL(d,n); |
| DP p1,p2; |
if ( n & 1 ) |
| int mod; |
/* offset of h-degree */ |
| DP *rp; |
d->td = d->d[n-1] = d0->d[n-1]+d1->d[n-1]; |
| { |
else |
| int i,n,td; |
d->td = 0; |
| int *w; |
rtab[0].c = c; |
| DL d1,d2,d; |
rtab[0].d = d; |
| MP m; |
|
| DP t,s,u; |
|
| |
|
| n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
if ( rtablen > tmptablen ) { |
| w = (int *)ALLOCA(n*sizeof(int)); |
if ( tmptab ) GCFREE(tmptab); |
| for ( i = 0, td = 0; i < n; i++ ) { |
tmptab = (struct cdlm *)MALLOC(rtablen*sizeof(struct cdlm)); |
| w[i] = MAX(d1->d[i],d2->d[i]); td += w[i]; |
tmptablen = rtablen; |
| } |
} |
| NEWDL(d,n); d->td = td - d1->td; |
|
| for ( i = 0; i < n; i++ ) |
for ( i = 0; i < n2; i++ ) { |
| d->d[i] = w[i] - d1->d[i]; |
a = d0->d[i]; b = d1->d[n2+i]; |
| NEWMP(m); m->dl = d; m->c = BDY(p2)->c; NEXT(m) = 0; |
k = d0->d[n2+i]; l = d1->d[i]; |
| MKDP(n,m,s); s->sugar = d->td; _mulmd(CO,mod,s,p1,&t); |
|
| NEWDL(d,n); d->td = td - d2->td; |
/* degree of xi^a*(Di^k*xi^l)*Di^b */ |
| for ( i = 0; i < n; i++ ) |
a += l; |
| d->d[i] = w[i] - d2->d[i]; |
b += k; |
| NEWMP(m); m->dl = d; m->c = STOI(mod - ITOS(BDY(p1)->c)); NEXT(m) = 0; |
s = MUL_WEIGHT(a,i)+MUL_WEIGHT(b,n2+i); |
| MKDP(n,m,s); s->sugar = d->td; _mulmd(CO,mod,s,p2,&u); |
|
| _addmd(CO,mod,t,u,rp); |
if ( !k || !l ) { |
| |
for ( j = 0, p = rtab; j < curlen; j++, p++ ) { |
| |
if ( p->c ) { |
| |
dt = p->d; |
| |
dt->d[i] = a; |
| |
dt->d[n2+i] = b; |
| |
dt->td += s; |
| |
} |
| |
} |
| |
curlen *= k+1; |
| |
continue; |
| |
} |
| |
if ( k+1 > tablen ) { |
| |
if ( tab ) GCFREE(tab); |
| |
if ( ctab ) GCFREE(ctab); |
| |
tablen = k+1; |
| |
tab = (struct cdlm *)MALLOC(tablen*sizeof(struct cdlm)); |
| |
ctab = (int *)MALLOC(tablen*sizeof(int)); |
| |
} |
| |
/* compute xi^a*(Di^k*xi^l)*Di^b */ |
| |
min = MIN(k,l); |
| |
mkwcm(k,l,mod,ctab); |
| |
bzero(tab,(k+1)*sizeof(struct cdlm)); |
| |
/* n&1 != 0 => homogenized computation; dx-xd=h^2 */ |
| |
if ( n & 1 ) |
| |
for ( j = 0; j <= min; j++ ) { |
| |
NEWDL(d,n); |
| |
d->d[i] = a-j; d->d[n2+i] = b-j; |
| |
d->td = s; |
| |
d->d[n-1] = s-(MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i)); |
| |
tab[j].d = d; |
| |
tab[j].c = ctab[j]; |
| |
} |
| |
else |
| |
for ( j = 0; j <= min; j++ ) { |
| |
NEWDL(d,n); |
| |
d->d[i] = a-j; d->d[n2+i] = b-j; |
| |
d->td = MUL_WEIGHT(a-j,i)+MUL_WEIGHT(b-j,n2+i); /* XXX */ |
| |
tab[j].d = d; |
| |
tab[j].c = ctab[j]; |
| |
} |
| |
comm_mulmd_tab_destructive(mod,n,rtab,curlen,tab,k+1); |
| |
curlen *= k+1; |
| |
} |
| } |
} |
| |
|
| void _dp_sp_component_mod(p1,p2,mod,f1,f2) |
void comm_mulmd_tab_destructive(int mod,int nv,struct cdlm *t,int n,struct cdlm *t1,int n1) |
| DP p1,p2; |
|
| int mod; |
|
| DP *f1,*f2; |
|
| { |
{ |
| int i,n,td; |
int i,j; |
| int *w; |
struct cdlm *p; |
| DL d1,d2,d; |
int c; |
| MP m; |
DL d; |
| DP t,s,u; |
|
| |
|
| n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
for ( j = 1, p = t+n; j < n1; j++ ) { |
| w = (int *)ALLOCA(n*sizeof(int)); |
c = t1[j].c; |
| for ( i = 0, td = 0; i < n; i++ ) { |
d = t1[j].d; |
| w[i] = MAX(d1->d[i],d2->d[i]); td += w[i]; |
if ( !c ) |
| } |
break; |
| NEWDL(d,n); d->td = td - d1->td; |
for ( i = 0; i < n; i++, p++ ) { |
| for ( i = 0; i < n; i++ ) |
if ( t[i].c ) { |
| d->d[i] = w[i] - d1->d[i]; |
p->c = dmar(t[i].c,c,0,mod); |
| NEWMP(m); m->dl = d; m->c = BDY(p2)->c; NEXT(m) = 0; |
adddl_dup(nv,t[i].d,d,&p->d); |
| MKDP(n,m,s); s->sugar = d->td; _mulmd(CO,mod,s,p1,f1); |
} |
| NEWDL(d,n); d->td = td - d2->td; |
} |
| for ( i = 0; i < n; i++ ) |
} |
| d->d[i] = w[i] - d2->d[i]; |
c = t1[0].c; |
| NEWMP(m); m->dl = d; m->c = BDY(p1)->c; NEXT(m) = 0; |
d = t1[0].d; |
| MKDP(n,m,s); s->sugar = d->td; _mulmd(CO,mod,s,p2,f2); |
for ( i = 0, p = t; i < n; i++, p++ ) |
| |
if ( t[i].c ) { |
| |
p->c = dmar(t[i].c,c,0,mod); |
| |
/* t[i].d += d */ |
| |
adddl_destructive(nv,t[i].d,d); |
| |
} |
| } |
} |
| |
|
| void _printdp(d) |
void adddl_dup(int n,DL d1,DL d2,DL *dr) |
| DP d; |
|
| { |
{ |
| int n,i; |
DL dt; |
| MP m; |
int i; |
| DL dl; |
|
| |
|
| if ( !d ) { |
NEWDL(dt,n); |
| printf("0"); return; |
*dr = dt; |
| } |
dt->td = d1->td + d2->td; |
| for ( n = d->nv, m = BDY(d); m; m = NEXT(m) ) { |
for ( i = 0; i < n; i++ ) |
| printf("%d*<<",ITOS(m->c)); |
dt->d[i] = d1->d[i]+d2->d[i]; |
| for ( i = 0, dl = m->dl; i < n-1; i++ ) |
|
| printf("%d,",dl->d[i]); |
|
| printf("%d",dl->d[i]); |
|
| printf(">>"); |
|
| if ( NEXT(m) ) |
|
| printf("+"); |
|
| } |
|
| } |
} |