version 1.2, 2000/05/29 08:54:46 |
version 1.5, 2000/08/21 08:31:27 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/distm.c,v 1.1.1.1 1999/12/03 07:39:08 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@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.4 2000/07/13 05:09:01 noro Exp $ |
|
*/ |
#include "ca.h" |
#include "ca.h" |
#include "inline.h" |
#include "inline.h" |
|
|
|
|
DP r,t,t1; |
DP r,t,t1; |
P c,c0,c1,cc; |
P c,c0,c1,cc; |
DL d,d0,d1; |
DL d,d0,d1; |
int i,j,a,b,k,l,n2,s,min,h; |
int i,j,a,b,k,l,n2,s,min; |
static int *tab; |
static int *tab; |
static int tablen; |
static int tablen; |
|
|
|
|
if ( n & 1 ) { |
if ( n & 1 ) { |
/* homogenized computation; dx-xd=h^2 */ |
/* homogenized computation; dx-xd=h^2 */ |
/* offset of h-degree */ |
/* offset of h-degree */ |
NEWDL(d,n); d->d[n-1] = d0->d[n-1]+d1->d[n-1]; d->td = d->d[n-1]; |
NEWDL(d,n); |
NEWMP(mr); mr->c = (P)ONEM; mr->dl = d; |
d->td = d->d[n-1] = d0->d[n-1]+d1->d[n-1]; |
MKDP(n,mr,r); r->sugar = d->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); |
|
|
for ( i = 0; i < n2; i++ ) { |
if ( min+1 > tablen ) { |
a = d0->d[i]; b = d1->d[n2+i]; |
if ( tab ) GC_free(tab); |
k = d0->d[n2+i]; l = d1->d[i]; |
tab = (int *)MALLOC((min+1)*sizeof(int)); |
/* degree of xi^a*(Di^k*xi^l)*Di^b */ |
tablen = min+1; |
h = a+k+l+b; |
} |
/* compute xi^a*(Di^k*xi^l)*Di^b */ |
mkwcm(k,l,mod,tab); |
min = MIN(k,l); |
if ( n & 1 ) |
|
|
if ( min+1 > tablen ) { |
|
if ( tab ) GC_free(tab); |
|
tab = (int *)MALLOC((min+1)*sizeof(int)); |
|
tablen = min+1; |
|
} |
|
mkwcm(k,l,mod,tab); |
|
for ( mr0 = 0, j = 0; j <= min; j++ ) { |
for ( mr0 = 0, j = 0; j <= min; j++ ) { |
NEXTMP(mr0,mr); |
NEXTMP(mr0,mr); NEWDL(d,n); |
NEWDL(d,n); |
|
d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
d->td = h; |
d->td = s; |
d->d[n-1] = h-(d->d[i]+d->d[n2+i]); |
d->d[n-1] = s-(d->d[i]+d->d[n2+i]); |
STOMQ(tab[j],mq); mr->c = (P)mq; |
STOMQ(tab[j],mq); mr->c = (P)mq; mr->dl = d; |
mr->dl = d; |
|
} |
} |
bzero(tab,(min+1)*sizeof(int)); |
else |
if ( mr0 ) |
|
NEXT(mr) = 0; |
|
MKDP(n,mr0,t); |
|
if ( t ) |
|
t->sugar = h; |
|
comm_mulmd(vl,mod,r,t,&t1); r = t1; |
|
} |
|
} else |
|
for ( i = 0, r = (DP)ONEM; i < n2; i++ ) { |
|
a = d0->d[i]; b = d1->d[n2+i]; |
|
k = d0->d[n2+i]; l = d1->d[i]; |
|
/* 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); |
|
for ( mr0 = 0, s = 0, j = 0; j <= min; j++ ) { |
for ( mr0 = 0, s = 0, j = 0; j <= min; j++ ) { |
NEXTMP(mr0,mr); |
NEXTMP(mr0,mr); NEWDL(d,n); |
NEWDL(d,n); |
|
d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
d->td = d->d[i]+d->d[n2+i]; /* XXX */ |
d->td = d->d[i]+d->d[n2+i]; /* XXX */ |
s = MAX(s,d->td); /* XXX */ |
s = MAX(s,d->td); /* XXX */ |
STOMQ(tab[j],mq); mr->c = (P)mq; |
STOMQ(tab[j],mq); mr->c = (P)mq; mr->dl = d; |
mr->dl = d; |
|
} |
} |
bzero(tab,(min+1)*sizeof(int)); |
bzero(tab,(min+1)*sizeof(int)); |
if ( mr0 ) |
if ( mr0 ) |
NEXT(mr) = 0; |
NEXT(mr) = 0; |
MKDP(n,mr0,t); |
MKDP(n,mr0,t); |
if ( t ) |
if ( t ) |
t->sugar = s; |
t->sugar = s; |
comm_mulmd(vl,mod,r,t,&t1); r = t1; |
comm_mulmd(vl,mod,r,t,&t1); r = t1; |
} |
} |
mulmdc(vl,mod,r,c,pr); |
mulmdc(vl,mod,r,c,pr); |
} |
} |
} |
} |
|
|
} |
} |
} |
} |
|
|
#define MKDPM(n,m,d) (NEWDP(d),(d)->nv=(n),BDY(d)=(m)) |
|
|
|
void _mdtop(vl,mod,dvl,p,pr) |
void _mdtop(vl,mod,dvl,p,pr) |
VL vl,dvl; |
VL vl,dvl; |
int mod; |
int mod; |
|
|
NEXT(mr) = m2; |
NEXT(mr) = m2; |
else |
else |
NEXT(mr) = 0; |
NEXT(mr) = 0; |
MKDPM(NV(p1),mr0,*pr); |
MKDP(NV(p1),mr0,*pr); |
if ( *pr ) |
if ( *pr ) |
(*pr)->sugar = MAX(p1->sugar,p2->sugar); |
(*pr)->sugar = MAX(p1->sugar,p2->sugar); |
} |
} |
|
|
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); C(mr) = STOI(mod - ITOS(C(m))); 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; |
} |
} |
|
|
C(mr) = STOI(dmar(ITOS(C(m)),c,0,mod)); |
C(mr) = STOI(dmar(ITOS(C(m)),c,0,mod)); |
adddl(n,m->dl,d,&mr->dl); |
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 + m0->dl->td; |
} |
} |
|
|
d0 = m0->dl; d1 = m1->dl; |
d0 = m0->dl; d1 = m1->dl; |
n2 = n>>1; |
n2 = n>>1; |
|
|
if ( n & 1 ) { |
NEWDL(d,n); |
|
if ( n & 1 ) |
/* offset of h-degree */ |
/* offset of h-degree */ |
NEWDL(d,n); d->d[n-1] = d0->d[n-1]+d1->d[n-1]; d->td = d->d[n-1]; |
d->td = d->d[n-1] = d0->d[n-1]+d1->d[n-1]; |
NEWMP(mr); mr->c = STOI(c); mr->dl = d; |
else |
MKDPM(n,mr,r); r->sugar = d->d[n-1]; |
d->td = 0; |
|
NEWMP(mr); mr->c = STOI(c); mr->dl = d; NEXT(mr) = 0; |
|
MKDP(n,mr,r); r->sugar = d->td; |
|
|
/* homogenized computation; dx-xd=h^2 */ |
/* homogenized computation; dx-xd=h^2 */ |
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 */ |
h = a+k+l+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); |
|
|
if ( min+1 > tablen ) { |
if ( min+1 > tablen ) { |
if ( tab ) GC_free(tab); |
if ( tab ) GC_free(tab); |
tab = (int *)MALLOC((min+1)*sizeof(int)); |
tab = (int *)MALLOC((min+1)*sizeof(int)); |
tablen = min+1; |
tablen = min+1; |
} |
} |
mkwcm(k,l,mod,tab); |
mkwcm(k,l,mod,tab); |
|
if ( n & 1 ) |
for ( mr0 = 0, j = 0; j <= min; j++ ) { |
for ( mr0 = 0, j = 0; j <= min; j++ ) { |
NEXTMP(mr0,mr); |
NEXTMP(mr0,mr); NEWDL(d,n); |
NEWDL(d,n); |
|
d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
d->td = h; |
d->td = s; |
d->d[n-1] = h-(d->d[i]+d->d[n2+i]); |
d->d[n-1] = s-(d->d[i]+d->d[n2+i]); |
mr->c = STOI(tab[j]); |
mr->c = STOI(tab[j]); mr->dl = d; |
mr->dl = d; |
|
} |
} |
bzero(tab,(min+1)*sizeof(int)); |
else |
if ( mr0 ) |
|
NEXT(mr) = 0; |
|
MKDP(n,mr0,t); |
|
if ( t ) |
|
t->sugar = h; |
|
_comm_mulmd(vl,mod,r,t,&t1); r = t1; |
|
} |
|
} else { |
|
NEWDL(d,n); d->td = 0; |
|
NEWMP(mr); mr->c = STOI(c); mr->dl = d; |
|
MKDPM(n,mr,r); r->sugar = 0; |
|
|
|
for ( i = 0; i < n2; i++ ) { |
|
a = d0->d[i]; b = d1->d[n2+i]; |
|
k = d0->d[n2+i]; l = d1->d[i]; |
|
/* 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); |
|
for ( mr0 = 0, s = 0, j = 0; j <= min; j++ ) { |
for ( mr0 = 0, s = 0, j = 0; j <= min; j++ ) { |
NEXTMP(mr0,mr); |
NEXTMP(mr0,mr); NEWDL(d,n); |
NEWDL(d,n); |
|
d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
d->d[i] = l-j+a; d->d[n2+i] = k-j+b; |
d->td = d->d[i]+d->d[n2+i]; /* XXX */ |
d->td = d->d[i]+d->d[n2+i]; /* XXX */ |
s = MAX(s,d->td); /* XXX */ |
s = MAX(s,d->td); /* XXX */ |
mr->c = STOI(tab[j]); |
mr->c = STOI(tab[j]); mr->dl = d; |
mr->dl = d; |
|
} |
} |
bzero(tab,(min+1)*sizeof(int)); |
bzero(tab,(min+1)*sizeof(int)); |
if ( mr0 ) |
if ( mr0 ) |
NEXT(mr) = 0; |
NEXT(mr) = 0; |
MKDP(n,mr0,t); |
MKDP(n,mr0,t); |
if ( t ) |
if ( t ) |
t->sugar = s; |
t->sugar = s; |
_comm_mulmd(vl,mod,r,t,&t1); r = t1; |
_comm_mulmd(vl,mod,r,t,&t1); r = t1; |
} |
|
} |
} |
*pr = r; |
*pr = r; |
} |
} |