version 1.1, 1999/12/03 07:39:08 |
version 1.7, 2000/12/05 06:59:16 |
|
|
/* $OpenXM: OpenXM/src/asir99/engine/distm.c,v 1.1.1.1 1999/11/10 08:12:26 noro Exp $ */ |
/* |
|
* Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED |
|
* All rights reserved. |
|
* |
|
* FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited, |
|
* non-exclusive and royalty-free license to use, copy, modify and |
|
* redistribute, solely for non-commercial and non-profit purposes, the |
|
* computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and |
|
* conditions of this Agreement. For the avoidance of doubt, you acquire |
|
* only a limited right to use the SOFTWARE hereunder, and FLL or any |
|
* third party developer retains all rights, including but not limited to |
|
* copyrights, in and to the SOFTWARE. |
|
* |
|
* (1) FLL does not grant you a license in any way for commercial |
|
* purposes. You may use the SOFTWARE only for non-commercial and |
|
* non-profit purposes only, such as academic, research and internal |
|
* business use. |
|
* (2) The SOFTWARE is protected by the Copyright Law of Japan and |
|
* international copyright treaties. If you make copies of the SOFTWARE, |
|
* with or without modification, as permitted hereunder, you shall affix |
|
* to all such copies of the SOFTWARE the above copyright notice. |
|
* (3) An explicit reference to this SOFTWARE and its copyright owner |
|
* 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@sec.flab.fujitsu.co.jp of the detailed specification |
|
* for such modification or the source code of the modified part of the |
|
* SOFTWARE. |
|
* |
|
* THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL |
|
* MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND |
|
* EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS |
|
* FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES' |
|
* RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY |
|
* MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY. |
|
* UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT, |
|
* OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY |
|
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL |
|
* DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES |
|
* ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES |
|
* FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY |
|
* DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF |
|
* SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART |
|
* OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY |
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
|
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
|
* |
|
* $OpenXM: OpenXM_contrib2/asir2000/engine/distm.c,v 1.6 2000/08/22 05:04:05 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; |
|
|
|
void comm_mulmd(); |
|
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) |
void ptomd(vl,mod,dvl,p,pr) |
VL vl,dvl; |
VL vl,dvl; |
int mod; |
int mod; |
|
|
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->td = QTOS(DEG(dc)); d->d[i] = d->td; |
NEWMP(m); m->dl = d; C(m) = (P)ONEM; NEXT(m) = 0; MKDP(n,m,u); |
NEWMP(m); m->dl = d; C(m) = (P)ONEM; NEXT(m) = 0; MKDP(n,m,u); |
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; |
} |
} |
|
|
int mod; |
int mod; |
DP p1,p2,*pr; |
DP p1,p2,*pr; |
{ |
{ |
|
if ( !do_weyl ) |
|
comm_mulmd(vl,mod,p1,p2,pr); |
|
else |
|
weyl_mulmd(vl,mod,p1,p2,pr); |
|
} |
|
|
|
void comm_mulmd(vl,mod,p1,p2,pr) |
|
VL vl; |
|
int mod; |
|
DP p1,p2,*pr; |
|
{ |
MP m; |
MP m; |
DP s,t,u; |
DP s,t,u; |
|
int i,l,l1; |
|
static MP *w; |
|
static int wlen; |
|
|
if ( !p1 || !p2 ) |
if ( !p1 || !p2 ) |
*pr = 0; |
*pr = 0; |
|
|
else if ( OID(p2) <= O_P ) |
else if ( OID(p2) <= O_P ) |
mulmdc(vl,mod,p1,(P)p2,pr); |
mulmdc(vl,mod,p1,(P)p2,pr); |
else { |
else { |
for ( m = BDY(p2), s = 0; m; m = NEXT(m) ) { |
for ( m = BDY(p1), l1 = 0; m; m = NEXT(m), l1++ ); |
mulmdm(vl,mod,p1,m,&t); addmd(vl,mod,s,t,&u); s = u; |
for ( m = BDY(p2), l = 0; m; m = NEXT(m), l++ ); |
|
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; |
*pr = s; |
} |
} |
} |
} |
|
|
|
void weyl_mulmd(vl,mod,p1,p2,pr) |
|
VL vl; |
|
int mod; |
|
DP p1,p2,*pr; |
|
{ |
|
MP m; |
|
DP s,t,u; |
|
int i,l,l1; |
|
static MP *w; |
|
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 mulmdm(vl,mod,p,m0,pr) |
VL vl; |
VL vl; |
int mod; |
int mod; |
|
|
} |
} |
} |
} |
|
|
void mulmdc(vl,mod,p,c,pr) |
void weyl_mulmdm(vl,mod,p,m0,pr) |
VL vl; |
VL vl; |
int mod; |
int mod; |
DP p; |
DP p; |
P c; |
MP m0; |
DP *pr; |
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 ) GC_free(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)); |
|
mr->dl = m->dl; |
|
} |
} |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
for ( m = BDY(p), i = 0; i < l; m = NEXT(m), i++ ) |
if ( *pr ) |
w[i] = m; |
(*pr)->sugar = p->sugar; |
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; |
} |
} |
} |
} |
|
|
void divsmdc(vl,mod,p,c,pr) |
/* m0 = x0^d0*x1^d1*... * dx0^d(n/2)*dx1^d(n/2+1)*... */ |
|
|
|
void weyl_mulmmm(vl,mod,m0,m1,n,pr) |
VL vl; |
VL vl; |
int mod; |
int mod; |
DP p; |
MP m0,m1; |
P c; |
int n; |
DP *pr; |
DP *pr; |
{ |
{ |
MP m,mr,mr0; |
MP m,mr,mr0; |
|
MQ mq; |
|
DP r,t,t1; |
|
P c,c0,c1,cc; |
|
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"); |
|
else if ( !p ) |
|
*pr = 0; |
*pr = 0; |
else { |
else { |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
c0 = C(m0); c1 = C(m1); |
NEXTMP(mr0,mr); divsmp(vl,mod,C(m),c,&C(mr)); mr->dl = m->dl; |
mulmp(vl,mod,c0,c1,&c); |
} |
d0 = m0->dl; d1 = m1->dl; |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
n2 = n>>1; |
if ( *pr ) |
if ( n & 1 ) { |
(*pr)->sugar = p->sugar; |
/* homogenized computation; dx-xd=h^2 */ |
} |
/* offset of h-degree */ |
} |
NEWDL(d,n); |
|
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; |
|
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]; |
|
/* 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); |
|
|
#define MKDPM(n,m,d) (NEWDP(d),(d)->nv=(n),BDY(d)=(m)) |
if ( min+1 > tablen ) { |
|
if ( tab ) GC_free(tab); |
void _mdtop(vl,mod,dvl,p,pr) |
tab = (int *)MALLOC((min+1)*sizeof(int)); |
VL vl,dvl; |
tablen = min+1; |
int mod; |
|
DP p; |
|
P *pr; |
|
{ |
|
int n,i; |
|
DL d; |
|
MP m; |
|
P r,s,t,u,w; |
|
Q q; |
|
MQ tq; |
|
VL tvl; |
|
|
|
if ( !p ) |
|
*pr = 0; |
|
else { |
|
for ( n = p->nv, m = BDY(p), s = 0; m; m = NEXT(m) ) { |
|
STOMQ(ITOS(C(m)),tq); t = (P)tq; |
|
for ( i = 0, d = m->dl, tvl = dvl; |
|
i < n; tvl = NEXT(tvl), i++ ) { |
|
MKV(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; |
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; |
} |
} |
mptop(s,pr); |
mulmdc(vl,mod,r,c,pr); |
} |
} |
} |
} |
|
|
void _addmd(vl,mod,p1,p2,pr) |
void mulmdc(vl,mod,p,c,pr) |
VL vl; |
VL vl; |
int mod; |
int mod; |
DP p1,p2,*pr; |
DP p; |
|
P c; |
|
DP *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; |
|
else if ( !p2 ) |
|
*pr = p1; |
|
else { |
|
for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) |
|
switch ( (*cmpdl)(n,m1->dl,m2->dl) ) { |
|
case 0: |
|
t = (ITOS(C(m1))+ITOS(C(m2))) - mod; |
|
if ( t < 0 ) |
|
t += mod; |
|
if ( t ) { |
|
NEXTMP(mr0,mr); mr->dl = m1->dl; C(mr) = STOI(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; |
|
MKDPM(NV(p1),mr0,*pr); |
|
if ( *pr ) |
|
(*pr)->sugar = MAX(p1->sugar,p2->sugar); |
|
} |
|
} |
|
|
|
void _submd(vl,mod,p1,p2,pr) |
|
VL vl; |
|
int mod; |
|
DP p1,p2,*pr; |
|
{ |
|
DP t; |
|
|
|
if ( !p2 ) |
|
*pr = p1; |
|
else { |
|
_chsgnmd(mod,p2,&t); _addmd(vl,mod,p1,t,pr); |
|
} |
|
} |
|
|
|
void _chsgnmd(mod,p,pr) |
|
int mod; |
|
DP p,*pr; |
|
{ |
|
MP m,mr,mr0; |
|
|
|
if ( !p ) |
|
*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); C(mr) = STOI(mod - ITOS(C(m))); mr->dl = m->dl; |
NEXTMP(mr0,mr); |
|
if ( NUM(C(m)) && NUM(c) ) { |
|
t = dmar(((MQ)(C(m)))->cont,((MQ)c)->cont,0,mod); |
|
STOMQ(t,q); C(mr) = (P)q; |
|
} else |
|
mulmp(vl,mod,C(m),c,&C(mr)); |
|
mr->dl = m->dl; |
} |
} |
NEXT(mr) = 0; MKDPM(NV(p),mr0,*pr); |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
if ( *pr ) |
if ( *pr ) |
(*pr)->sugar = p->sugar; |
(*pr)->sugar = p->sugar; |
} |
} |
} |
} |
|
|
void _mulmd(vl,mod,p1,p2,pr) |
void divsmdc(vl,mod,p,c,pr) |
VL vl; |
VL vl; |
int mod; |
int mod; |
DP p1,p2,*pr; |
|
{ |
|
MP m; |
|
DP s,t,u; |
|
|
|
if ( !p1 || !p2 ) |
|
*pr = 0; |
|
else { |
|
for ( m = BDY(p2), s = 0; m; m = NEXT(m) ) { |
|
_mulmdm(vl,mod,p1,m,&t); _addmd(vl,mod,s,t,&u); s = u; |
|
} |
|
*pr = s; |
|
} |
|
} |
|
|
|
void _mulmdm(vl,mod,p,m0,pr) |
|
VL vl; |
|
int mod; |
|
DP p; |
DP p; |
MP m0; |
P c; |
DP *pr; |
DP *pr; |
{ |
{ |
MP m,mr,mr0; |
MP m,mr,mr0; |
DL d; |
|
int c,n,r; |
|
|
|
if ( !p ) |
if ( !c ) |
|
error("disvsdc : division by 0"); |
|
else if ( !p ) |
*pr = 0; |
*pr = 0; |
else { |
else { |
for ( mr0 = 0, m = BDY(p), c = ITOS(C(m0)), d = m0->dl, n = NV(p); |
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
m; m = NEXT(m) ) { |
NEXTMP(mr0,mr); divsmp(vl,mod,C(m),c,&C(mr)); mr->dl = m->dl; |
NEXTMP(mr0,mr); |
|
C(mr) = STOI(dmar(ITOS(C(m)),c,0,mod)); |
|
adddl(n,m->dl,d,&mr->dl); |
|
} |
} |
NEXT(mr) = 0; MKDPM(NV(p),mr0,*pr); |
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr); |
if ( *pr ) |
if ( *pr ) |
(*pr)->sugar = p->sugar + m0->dl->td; |
(*pr)->sugar = p->sugar; |
} |
} |
} |
} |
|
|
|
|
} |
} |
} |
} |
|
|
void _dp_red_mod(p1,p2,mod,rp) |
|
DP p1,p2; |
|
int mod; |
|
DP *rp; |
|
{ |
|
int i,n; |
|
DL d1,d2,d; |
|
MP m; |
|
DP t,s; |
|
int c,c1; |
|
|
|
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
|
NEWDL(d,n); d->td = d1->td - d2->td; |
|
for ( i = 0; i < n; i++ ) |
|
d->d[i] = d1->d[i]-d2->d[i]; |
|
c = invm(ITOS(BDY(p2)->c),mod); c1 = dmar(c,ITOS(BDY(p1)->c),0,mod); |
|
NEWMP(m); m->dl = d; m->c = STOI(mod-c1); NEXT(m) = 0; |
|
MKDP(n,m,s); s->sugar = d->td; |
|
_mulmd(CO,mod,p2,s,&t); _addmd(CO,mod,p1,t,rp); |
|
} |
|
|
|
void _dp_mod(p,mod,subst,rp) |
void _dp_mod(p,mod,subst,rp) |
DP p; |
DP p; |
int mod; |
int mod; |
|
|
} |
} |
} |
} |
|
|
void _dp_sp_mod(p1,p2,mod,rp) |
void _dp_monic(p,mod,rp) |
DP p1,p2; |
DP p; |
int mod; |
int mod; |
DP *rp; |
DP *rp; |
{ |
{ |
int i,n,td; |
MP m,mr,mr0; |
int *w; |
int c,c1; |
DL d1,d2,d; |
NODE tn; |
MP m; |
|
DP t,s,u; |
|
|
|
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
if ( !p ) |
w = (int *)ALLOCA(n*sizeof(int)); |
*rp = 0; |
for ( i = 0, td = 0; i < n; i++ ) { |
else { |
w[i] = MAX(d1->d[i],d2->d[i]); td += w[i]; |
c = invm(ITOS(BDY(p)->c),mod); |
|
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) { |
|
c1 = dmar(ITOS(m->c),c,0,mod); |
|
NEXTMP(mr0,mr); mr->c = STOI(c1); mr->dl = m->dl; |
|
} |
|
NEXT(mr) = 0; MKDP(p->nv,mr0,*rp); (*rp)->sugar = p->sugar; |
} |
} |
NEWDL(d,n); d->td = td - d1->td; |
|
for ( i = 0; i < n; i++ ) |
|
d->d[i] = w[i] - d1->d[i]; |
|
NEWMP(m); m->dl = d; m->c = BDY(p2)->c; NEXT(m) = 0; |
|
MKDP(n,m,s); s->sugar = d->td; _mulmd(CO,mod,p1,s,&t); |
|
NEWDL(d,n); d->td = td - d2->td; |
|
for ( i = 0; i < n; i++ ) |
|
d->d[i] = w[i] - d2->d[i]; |
|
NEWMP(m); m->dl = d; m->c = STOI(mod - ITOS(BDY(p1)->c)); NEXT(m) = 0; |
|
MKDP(n,m,s); s->sugar = d->td; _mulmd(CO,mod,p2,s,&u); |
|
_addmd(CO,mod,t,u,rp); |
|
} |
|
|
|
void _dp_sp_component_mod(p1,p2,mod,f1,f2) |
|
DP p1,p2; |
|
int mod; |
|
DP *f1,*f2; |
|
{ |
|
int i,n,td; |
|
int *w; |
|
DL d1,d2,d; |
|
MP m; |
|
DP t,s,u; |
|
|
|
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
|
w = (int *)ALLOCA(n*sizeof(int)); |
|
for ( i = 0, td = 0; i < n; i++ ) { |
|
w[i] = MAX(d1->d[i],d2->d[i]); td += w[i]; |
|
} |
|
NEWDL(d,n); d->td = td - d1->td; |
|
for ( i = 0; i < n; i++ ) |
|
d->d[i] = w[i] - d1->d[i]; |
|
NEWMP(m); m->dl = d; m->c = BDY(p2)->c; NEXT(m) = 0; |
|
MKDP(n,m,s); s->sugar = d->td; _mulmd(CO,mod,p1,s,f1); |
|
NEWDL(d,n); d->td = td - d2->td; |
|
for ( i = 0; i < n; i++ ) |
|
d->d[i] = w[i] - d2->d[i]; |
|
NEWMP(m); m->dl = d; m->c = BDY(p1)->c; NEXT(m) = 0; |
|
MKDP(n,m,s); s->sugar = d->td; _mulmd(CO,mod,p2,s,f2); |
|
} |
} |
|
|
void _printdp(d) |
void _printdp(d) |