File: [local] / OpenXM_contrib2 / asir2000 / engine / distm.c (download)
Revision 1.7, Tue Dec 5 06:59:16 2000 UTC (23 years, 9 months ago) by noro
Branch: MAIN
Changes since 1.6: +1 -417
lines
Files related to distributed polynomial computation are now being
restructured.
|
/*
* 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.7 2000/12/05 06:59:16 noro Exp $
*/
#include "ca.h"
#include "inline.h"
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)
VL vl,dvl;
int mod;
P p;
DP *pr;
{
P t;
ptomp(mod,p,&t);
mptomd(vl,mod,dvl,t,pr);
}
void mptomd(vl,mod,dvl,p,pr)
VL vl,dvl;
int mod;
P p;
DP *pr;
{
int n,i;
VL tvl;
V v;
DL d;
MP m;
DCP dc;
DP r,s,t,u;
P x,c;
if ( !p )
*pr = 0;
else {
for ( n = 0, tvl = dvl; tvl; tvl = NEXT(tvl), n++ );
if ( NUM(p) ) {
NEWDL(d,n);
NEWMP(m); m->dl = d; C(m) = p; NEXT(m) = 0; MKDP(n,m,*pr);
} else {
for ( i = 0, tvl = dvl, v = VR(p);
tvl && tvl->v != v; tvl = NEXT(tvl), i++ );
if ( !tvl ) {
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);
mulmdc(vl,mod,t,c,&r); addmd(vl,mod,r,s,&t); s = t;
}
*pr = s;
} else {
for ( dc = DC(p), s = 0; dc; dc = NEXT(dc) ) {
mptomd(vl,mod,dvl,COEF(dc),&t);
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);
comm_mulmd(vl,mod,t,u,&r); addmd(vl,mod,r,s,&t); s = t;
}
*pr = s;
}
}
}
}
void mdtop(vl,mod,dvl,p,pr)
VL vl,dvl;
int mod;
DP p;
P *pr;
{
int n,i;
DL d;
MP m;
P r,s,t,u,w;
Q q;
VL tvl;
if ( !p )
*pr = 0;
else {
for ( n = p->nv, m = BDY(p), s = 0; m; m = NEXT(m) ) {
for ( i = 0, t = 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 addmd(vl,mod,p1,p2,pr)
VL vl;
int mod;
DP p1,p2,*pr;
{
int n;
MP m1,m2,mr,mr0;
P t;
int tmp;
MQ q;
if ( !p1 )
*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:
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,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)
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;
else {
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
NEXTMP(mr0,mr); chsgnmp(mod,C(m),&C(mr)); mr->dl = m->dl;
}
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
if ( *pr )
(*pr)->sugar = p->sugar;
}
}
void mulmd(vl,mod,p1,p2,pr)
VL vl;
int mod;
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;
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(p1), l1 = 0; m; m = NEXT(m), l1++ );
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;
}
}
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)
VL vl;
int mod;
DP p;
MP m0;
DP *pr;
{
MP m,mr,mr0;
P c;
DL d;
int n,t;
MQ q;
if ( !p )
*pr = 0;
else {
for ( mr0 = 0, m = BDY(p), c = C(m0), d = m0->dl, n = NV(p);
m; m = NEXT(m) ) {
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));
adddl(n,m->dl,d,&mr->dl);
}
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
if ( *pr )
(*pr)->sugar = p->sugar + m0->dl->td;
}
}
void weyl_mulmdm(vl,mod,p,m0,pr)
VL vl;
int mod;
DP p;
MP m0;
DP *pr;
{
DP r,t,t1;
MP m;
int n,l,i;
static MP *w;
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 weyl_mulmmm(vl,mod,m0,m1,n,pr)
VL vl;
int mod;
MP m0,m1;
int n;
DP *pr;
{
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 ( !m0 || !m1 )
*pr = 0;
else {
c0 = C(m0); c1 = C(m1);
mulmp(vl,mod,c0,c1,&c);
d0 = m0->dl; d1 = m1->dl;
n2 = n>>1;
if ( n & 1 ) {
/* 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);
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)
VL vl;
int mod;
DP p;
P c;
DP *pr;
{
MP m,mr,mr0;
int t;
MQ q;
if ( !p || !c )
*pr = 0;
else {
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
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; MKDP(NV(p),mr0,*pr);
if ( *pr )
(*pr)->sugar = p->sugar;
}
}
void divsmdc(vl,mod,p,c,pr)
VL vl;
int mod;
DP p;
P c;
DP *pr;
{
MP m,mr,mr0;
if ( !c )
error("disvsdc : division by 0");
else if ( !p )
*pr = 0;
else {
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;
}
NEXT(mr) = 0; MKDP(NV(p),mr0,*pr);
if ( *pr )
(*pr)->sugar = p->sugar;
}
}
void _dtop_mod(vl,dvl,p,pr)
VL vl,dvl;
DP p;
P *pr;
{
int n,i;
DL d;
MP m;
P r,s,t,u,w;
Q q;
VL tvl;
if ( !p )
*pr = 0;
else {
for ( n = p->nv, m = BDY(p), s = 0; m; m = NEXT(m) ) {
i = ITOS(m->c); STOQ(i,q); t = (P)q;
for ( i = 0, d = m->dl, tvl = dvl;
i < n; tvl = NEXT(tvl), i++ ) {
MKV(tvl->v,r); STOQ(d->d[i],q); pwrp(vl,r,q,&u);
mulp(vl,t,u,&w); t = w;
}
addp(vl,s,t,&u); s = u;
}
*pr = s;
}
}
void _dp_mod(p,mod,subst,rp)
DP p;
int mod;
NODE subst;
DP *rp;
{
MP m,mr,mr0;
P t,s;
NODE tn;
if ( !p )
*rp = 0;
else {
for ( mr0 = 0, m = BDY(p); m; m = NEXT(m) ) {
for ( tn = subst, s = 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 = 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 _dp_monic(p,mod,rp)
DP p;
int mod;
DP *rp;
{
MP m,mr,mr0;
int c,c1;
NODE tn;
if ( !p )
*rp = 0;
else {
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;
}
}
void _printdp(d)
DP d;
{
int n,i;
MP m;
DL dl;
if ( !d ) {
printf("0"); return;
}
for ( n = d->nv, m = BDY(d); m; m = NEXT(m) ) {
printf("%d*<<",ITOS(m->c));
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("+");
}
}