version 1.11, 2001/10/09 01:36:11 |
version 1.14, 2009/03/16 16:43:02 |
|
|
* 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.10 2001/09/17 01:18:35 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/engine/_distm.c,v 1.13 2002/07/24 07:38:55 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "inline.h" |
#include "inline.h" |
|
|
|
|
/* fprintf(stderr,"DL_alloc : %d \n",++DL_alloc_count); */ |
/* fprintf(stderr,"DL_alloc : %d \n",++DL_alloc_count); */ |
dl_len = (current_dl_length+1); |
dl_len = (current_dl_length+1); |
#if defined(LONG_IS_64BIT) |
#if SIZEOF_LONG == 8 |
if ( dl_len & 1 ) |
if ( dl_len & 1 ) |
dl_len += 1; |
dl_len += 1; |
#endif |
#endif |
p = (int *)GC_malloc(128*dl_len*sizeof(int)); |
|
for ( i = 0; i < 128; i++, p += dl_len ) { |
for ( i = 0; i < 128; i++, p += dl_len ) { |
|
p = (int *)GC_malloc(dl_len*sizeof(int)); |
*(DL *)p = _dl_free_list; |
*(DL *)p = _dl_free_list; |
_dl_free_list = (DL)p; |
_dl_free_list = (DL)p; |
} |
} |
|
|
static int MP_alloc_count; |
static int MP_alloc_count; |
|
|
/* fprintf(stderr,"MP_alloc : %d \n",++MP_alloc_count); */ |
/* fprintf(stderr,"MP_alloc : %d \n",++MP_alloc_count); */ |
p = (MP)GC_malloc(1024*sizeof(struct oMP)); |
|
for ( i = 0; i < 1024; i++ ) { |
for ( i = 0; i < 1024; i++ ) { |
p[i].next = _mp_free_list; _mp_free_list = &p[i]; |
p = (MP)GC_malloc(sizeof(struct oMP)); |
|
p->next = _mp_free_list; _mp_free_list = p; |
} |
} |
} |
} |
|
|
Line 107 void _DP_alloc() |
|
Line 107 void _DP_alloc() |
|
static int DP_alloc_count; |
static int DP_alloc_count; |
|
|
/* fprintf(stderr,"DP_alloc : %d \n",++DP_alloc_count); */ |
/* fprintf(stderr,"DP_alloc : %d \n",++DP_alloc_count); */ |
p = (DP)GC_malloc(1024*sizeof(struct oDP)); |
|
for ( i = 0; i < 1024; i++ ) { |
for ( i = 0; i < 1024; i++ ) { |
p[i].body = (MP)_dp_free_list; _dp_free_list = &p[i]; |
p = (DP)GC_malloc(sizeof(struct oDP)); |
|
p->body = (MP)_dp_free_list; _dp_free_list = p; |
} |
} |
} |
} |
|
|
Line 363 void _weyl_mulmmm_dup(int mod,MP m0,MP m1,int n,struct |
|
Line 363 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 385 void _weyl_mulmmm_dup(int mod,MP m0,MP m1,int n,struct |
|
Line 388 void _weyl_mulmmm_dup(int mod,MP m0,MP m1,int n,struct |
|
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 395 void _weyl_mulmmm_dup(int mod,MP m0,MP m1,int n,struct |
|
Line 396 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]; |
} |
} |
Line 879 void _weyl_mulmm_dup(VL vl,MP m0,MP m1,int n,struct cd |
|
Line 880 void _weyl_mulmm_dup(VL vl,MP m0,MP m1,int n,struct cd |
|
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 901 void _weyl_mulmm_dup(VL vl,MP m0,MP m1,int n,struct cd |
|
Line 905 void _weyl_mulmm_dup(VL vl,MP m0,MP m1,int n,struct cd |
|
tab = (struct cdl *)MALLOC(tablen*sizeof(struct cdl)); |
tab = (struct cdl *)MALLOC(tablen*sizeof(struct cdl)); |
ctab = (Q *)MALLOC(tablen*sizeof(P)); |
ctab = (Q *)MALLOC(tablen*sizeof(P)); |
} |
} |
/* 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); |
mkwc(k,l,ctab); |
mkwc(k,l,ctab); |
Line 911 void _weyl_mulmm_dup(VL vl,MP m0,MP m1,int n,struct cd |
|
Line 913 void _weyl_mulmm_dup(VL vl,MP m0,MP m1,int n,struct cd |
|
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 = (P)ctab[j]; |
tab[j].c = (P)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 = (P)ctab[j]; |
tab[j].c = (P)ctab[j]; |
} |
} |