version 1.51, 2006/03/16 10:08:20 |
version 1.59, 2009/03/25 07:06:30 |
|
|
* 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/builtin/array.c,v 1.50 2006/01/05 00:21:20 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/array.c,v 1.58 2009/03/03 10:04:10 ohara Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "base.h" |
#include "base.h" |
|
|
|
|
#include <sys/types.h> |
#include <sys/types.h> |
#include <sys/stat.h> |
#include <sys/stat.h> |
|
#if !defined(_MSC_VER) |
#include <unistd.h> |
#include <unistd.h> |
|
#endif |
|
|
#define F4_INTRAT_PERIOD 8 |
#define F4_INTRAT_PERIOD 8 |
|
|
|
|
void Pmat(); |
void Pmat(); |
void Pmatc(); |
void Pmatc(); |
void Pnd_det(); |
void Pnd_det(); |
|
void Plu_mat(); |
|
void Pmat_col(); |
|
|
struct ftab array_tab[] = { |
struct ftab array_tab[] = { |
|
{"lu_mat",Plu_mat,1}, |
{"solve_by_lu_gfmmat",Psolve_by_lu_gfmmat,4}, |
{"solve_by_lu_gfmmat",Psolve_by_lu_gfmmat,4}, |
{"lu_gfmmat",Plu_gfmmat,2}, |
{"lu_gfmmat",Plu_gfmmat,2}, |
{"mat_to_gfmmat",Pmat_to_gfmmat,2}, |
{"mat_to_gfmmat",Pmat_to_gfmmat,2}, |
Line 138 struct ftab array_tab[] = { |
|
Line 143 struct ftab array_tab[] = { |
|
{"nbpoly_up2",Pnbpoly_up2,2}, |
{"nbpoly_up2",Pnbpoly_up2,2}, |
{"mat_swap_row_destructive",Pmat_swap_row_destructive,3}, |
{"mat_swap_row_destructive",Pmat_swap_row_destructive,3}, |
{"mat_swap_col_destructive",Pmat_swap_col_destructive,3}, |
{"mat_swap_col_destructive",Pmat_swap_col_destructive,3}, |
|
{"mat_col",Pmat_col,2}, |
{0,0,0}, |
{0,0,0}, |
}; |
}; |
|
|
Line 389 void Pnewvect(NODE arg,VECT *rp) |
|
Line 395 void Pnewvect(NODE arg,VECT *rp) |
|
if ( argc(arg) == 2 ) { |
if ( argc(arg) == 2 ) { |
list = (LIST)ARG1(arg); |
list = (LIST)ARG1(arg); |
asir_assert(list,O_LIST,"newvect"); |
asir_assert(list,O_LIST,"newvect"); |
|
#if 0 |
for ( r = 0, tn = BDY(list); tn; r++, tn = NEXT(tn) ); |
for ( r = 0, tn = BDY(list); tn; r++, tn = NEXT(tn) ); |
if ( r > len ) { |
if ( r > len ) { |
*rp = vect; |
*rp = vect; |
return; |
return; |
} |
} |
|
#endif |
for ( i = 0, tn = BDY(list), vb = BDY(vect); tn; i++, tn = NEXT(tn) ) |
for ( i = 0, tn = BDY(list), vb = BDY(vect); tn; i++, tn = NEXT(tn) ) |
vb[i] = (pointer)BDY(tn); |
vb[i] = (pointer)BDY(tn); |
} |
} |
Line 455 void Pnewbytearray(NODE arg,BYTEARRAY *rp) |
|
Line 463 void Pnewbytearray(NODE arg,BYTEARRAY *rp) |
|
|
|
ac = argc(arg); |
ac = argc(arg); |
if ( ac == 1 ) { |
if ( ac == 1 ) { |
/* ARG0(arg) must be a filename */ |
if ( !OID((Obj)ARG0(arg)) ) error("newbytearray : invalid argument"); |
asir_assert(ARG0(arg),O_STR,"newbytearray"); |
switch ( OID((Obj)ARG0(arg)) ) { |
fname = BDY((STRING)ARG0(arg)); |
case O_STR: |
fp = fopen(fname,"rb"); |
fname = BDY((STRING)ARG0(arg)); |
if ( !fp ) error("newbytearray : fopen failed"); |
fp = fopen(fname,"rb"); |
if ( stat(fname,&sbuf) < 0 ) error("newbytearray : stat failed"); |
if ( !fp ) error("newbytearray : fopen failed"); |
len = sbuf.st_size; |
if ( stat(fname,&sbuf) < 0 ) |
MKBYTEARRAY(array,len); |
error("newbytearray : stat failed"); |
fread(BDY(array),len,sizeof(char),fp); |
len = sbuf.st_size; |
|
MKBYTEARRAY(array,len); |
|
fread(BDY(array),len,sizeof(char),fp); |
|
break; |
|
case O_N: |
|
if ( !RATN(ARG0(arg)) ) |
|
error("newbytearray : invalid argument"); |
|
len = QTOS((Q)ARG0(arg)); |
|
if ( len < 0 ) |
|
error("newbytearray : invalid size"); |
|
MKBYTEARRAY(array,len); |
|
break; |
|
default: |
|
error("newbytearray : invalid argument"); |
|
} |
} else if ( ac == 2 ) { |
} else if ( ac == 2 ) { |
asir_assert(ARG0(arg),O_N,"newbytearray"); |
asir_assert(ARG0(arg),O_N,"newbytearray"); |
len = QTOS((Q)ARG0(arg)); |
len = QTOS((Q)ARG0(arg)); |
|
|
} |
} |
} |
} |
|
|
|
/* XXX broken */ |
|
int lu_dec_cr(MAT mat,MAT lu,Q *dn,int **perm) |
|
{ |
|
Q **a0,**b; |
|
Q *aiq; |
|
N **a; |
|
N *ai; |
|
Q q,q1,dn2,a1,q0,bik; |
|
MAT m; |
|
unsigned int md; |
|
int n,ind,i,j,rank,t,inv,t1,ret,min,k; |
|
int **w; |
|
int *wi,*rinfo0,*rinfo; |
|
N m1,m2,m3,u,s; |
|
|
|
a0 = (Q **)mat->body; |
|
n = mat->row; |
|
if ( n != mat->col ) |
|
error("lu_dec_cr : non-square matrix"); |
|
w = (int **)almat(n,n); |
|
MKMAT(m,n,n); |
|
a = (N **)m->body; |
|
UTON(1,m1); |
|
rinfo0 = 0; |
|
ind = 0; |
|
while ( 1 ) { |
|
md = get_lprime(ind); |
|
/* mat mod md */ |
|
for ( i = 0; i < n; i++ ) |
|
for ( j = 0, aiq = a0[i], wi = w[i]; j < n; j++ ) |
|
if ( q = aiq[j] ) { |
|
t = rem(NM(q),md); |
|
if ( t && SGN(q) < 0 ) |
|
t = (md - t) % md; |
|
wi[j] = t; |
|
} else |
|
wi[j] = 0; |
|
|
|
if ( !lu_mod((unsigned int **)w,n,md,&rinfo) ) continue; |
|
printf("."); fflush(stdout); |
|
if ( !rinfo0 ) |
|
*perm = rinfo0 = rinfo; |
|
else { |
|
for ( i = 0; i < n; i++ ) |
|
if ( rinfo[i] != rinfo0[i] ) break; |
|
if ( i < n ) continue; |
|
} |
|
if ( UNIN(m1) ) { |
|
for ( i = 0; i < n; i++ ) |
|
for ( j = 0, ai = a[i], wi = w[i]; j < n; j++ ) { |
|
UTON(wi[j],u); ai[j] = u; |
|
} |
|
UTON(md,m1); |
|
} else { |
|
inv = invm(rem(m1,md),md); |
|
UTON(md,m2); muln(m1,m2,&m3); |
|
for ( i = 0; i < n; i++ ) |
|
for ( j = 0, ai = a[i], wi = w[i]; j < n; j++ ) |
|
if ( ai[i] ) { |
|
/* f3 = f1+m1*(m1 mod m2)^(-1)*(f2 - f1 mod m2) */ |
|
t = rem(ai[j],md); |
|
if ( wi[j] >= t ) |
|
t = wi[j]-t; |
|
else |
|
t = md-(t-wi[j]); |
|
DMAR(t,inv,0,md,t1) |
|
UTON(t1,u); |
|
muln(m1,u,&s); |
|
addn(ai[j],s,&u); ai[j] = u; |
|
} else if ( wi[j] ) { |
|
/* f3 = m1*(m1 mod m2)^(-1)*f2 */ |
|
DMAR(wi[j],inv,0,md,t) |
|
UTON(t,u); |
|
muln(m1,u,&s); ai[j] = s; |
|
} |
|
m1 = m3; |
|
} |
|
if ( (++ind%8) == 0 ) { |
|
ret = intmtoratm(m,m1,lu,dn); |
|
if ( ret ) { |
|
b = (Q **)lu->body; |
|
mulq(*dn,*dn,&dn2); |
|
for ( i = 0; i < n; i++ ) { |
|
for ( j = 0; j < n; j++ ) { |
|
q = 0; |
|
min = MIN(i,j); |
|
for ( k = 0; k <= min; k++ ) { |
|
bik = k==i ? *dn : b[i][k]; |
|
mulq(bik,b[k][j],&q0); |
|
addq(q,q0,&q1); q = q1; |
|
} |
|
mulq(a0[rinfo0[i]][j],dn2,&q1); |
|
if ( cmpq(q,q1) ) break; |
|
} |
|
if ( j < n ) break; |
|
} |
|
if ( i == n ) |
|
return; |
|
} |
|
} |
|
} |
|
} |
|
|
|
int nmat(N **m,int n) |
|
{ |
|
int i,j; |
|
|
|
for ( i = 0; i < n; i++ ) { |
|
for ( j = 0; j < n; j++ ) { |
|
printn(m[i][j]); printf(" "); |
|
} |
|
printf("\n"); |
|
} |
|
} |
|
|
int generic_gauss_elim_hensel(MAT mat,MAT *nmmat,Q *dn,int **rindp,int **cindp) |
int generic_gauss_elim_hensel(MAT mat,MAT *nmmat,Q *dn,int **rindp,int **cindp) |
{ |
{ |
MAT bmat,xmat; |
MAT bmat,xmat; |
Line 1282 int generic_gauss_elim_hensel(MAT mat,MAT *nmmat,Q *dn |
|
Line 1419 int generic_gauss_elim_hensel(MAT mat,MAT *nmmat,Q *dn |
|
} else |
} else |
wi[j] = 0; |
wi[j] = 0; |
|
|
if ( DP_Print ) { |
if ( DP_Print > 3 ) { |
fprintf(asir_out,"LU decomposition.."); fflush(asir_out); |
fprintf(asir_out,"LU decomposition.."); fflush(asir_out); |
} |
} |
rank = find_lhs_and_lu_mod((unsigned int **)w,row,col,md,&rinfo,&cinfo); |
rank = find_lhs_and_lu_mod((unsigned int **)w,row,col,md,&rinfo,&cinfo); |
if ( DP_Print ) { |
if ( DP_Print > 3 ) { |
fprintf(asir_out,"done.\n"); fflush(asir_out); |
fprintf(asir_out,"done.\n"); fflush(asir_out); |
} |
} |
a = (Q **)almat_pointer(rank,rank); /* lhs mat */ |
a = (Q **)almat_pointer(rank,rank); /* lhs mat */ |
Line 1325 int generic_gauss_elim_hensel(MAT mat,MAT *nmmat,Q *dn |
|
Line 1462 int generic_gauss_elim_hensel(MAT mat,MAT *nmmat,Q *dn |
|
wx = (int *)MALLOC_ATOMIC(wxsize*sizeof(int)); |
wx = (int *)MALLOC_ATOMIC(wxsize*sizeof(int)); |
for ( i = 0; i < wxsize; i++ ) wx[i] = 0; |
for ( i = 0; i < wxsize; i++ ) wx[i] = 0; |
for ( q = ONE, count = 0; ; ) { |
for ( q = ONE, count = 0; ; ) { |
if ( DP_Print ) |
if ( DP_Print > 3 ) |
fprintf(stderr,"o"); |
fprintf(stderr,"o"); |
/* wc = -b mod md */ |
/* wc = -b mod md */ |
get_eg(&tmp0); |
get_eg(&tmp0); |
Line 1425 int generic_gauss_elim_hensel(MAT mat,MAT *nmmat,Q *dn |
|
Line 1562 int generic_gauss_elim_hensel(MAT mat,MAT *nmmat,Q *dn |
|
} |
} |
} |
} |
|
|
int generic_gauss_elim_hensel_dalg(MAT mat,MAT *nmmat,Q *dn,int **rindp,int **cindp) |
int generic_gauss_elim_hensel_dalg(MAT mat,DP *mb,MAT *nmmat,Q *dn,int **rindp,int **cindp) |
{ |
{ |
MAT bmat,xmat; |
MAT bmat,xmat; |
Q **a0,**a,**b,**x,**nm; |
Q **a0,**a,**b,**x,**nm; |
Line 1449 int generic_gauss_elim_hensel_dalg(MAT mat,MAT *nmmat, |
|
Line 1586 int generic_gauss_elim_hensel_dalg(MAT mat,MAT *nmmat, |
|
N wn; |
N wn; |
Q wq; |
Q wq; |
NumberField nf; |
NumberField nf; |
DP *mb; |
|
DP m; |
DP m; |
int col1; |
int col1; |
|
|
nf = get_numberfield(); |
|
mb = nf->mb; |
|
a0 = (Q **)mat->body; |
a0 = (Q **)mat->body; |
row = mat->row; col = mat->col; |
row = mat->row; col = mat->col; |
w = (int **)almat(row,col); |
w = (int **)almat(row,col); |
Line 1946 void red_by_compress(int m,unsigned int *p,unsigned in |
|
Line 2080 void red_by_compress(int m,unsigned int *p,unsigned in |
|
|
|
void red_by_vect(int m,unsigned int *p,unsigned int *r,unsigned int hc,int len) |
void red_by_vect(int m,unsigned int *p,unsigned int *r,unsigned int hc,int len) |
{ |
{ |
register unsigned int up,lo; |
unsigned int up,lo,dmy; |
unsigned int dmy; |
|
|
|
*p++ = 0; r++; len--; |
*p++ = 0; r++; len--; |
for ( ; len; len--, r++, p++ ) |
for ( ; len; len--, r++, p++ ) |
Line 2199 int find_lhs_and_lu_mod(unsigned int **a,int row,int c |
|
Line 2332 int find_lhs_and_lu_mod(unsigned int **a,int row,int c |
|
return d; |
return d; |
} |
} |
|
|
|
int lu_mod(unsigned int **a,int n,unsigned int md,int **rinfo) |
|
{ |
|
int i,j,k; |
|
int *rp; |
|
unsigned int *t,*pivot; |
|
unsigned int inv,m; |
|
|
|
*rinfo = rp = (int *)MALLOC_ATOMIC(n*sizeof(int)); |
|
for ( i = 0; i < n; i++ ) rp[i] = i; |
|
for ( k = 0; k < n; k++ ) { |
|
for ( i = k; i < n && !a[i][k]; i++ ); |
|
if ( i == n ) return 0; |
|
if ( i != k ) { |
|
j = rp[i]; rp[i] = rp[k]; rp[k] = j; |
|
t = a[i]; a[i] = a[k]; a[k] = t; |
|
} |
|
pivot = a[k]; |
|
inv = invm(pivot[k],md); |
|
for ( i = k+1; i < n; i++ ) { |
|
t = a[i]; |
|
if ( m = t[k] ) { |
|
DMAR(inv,m,0,md,t[k]) |
|
for ( j = k+1, m = md - t[k]; j < n; j++ ) |
|
if ( pivot[j] ) { |
|
unsigned int tj; |
|
DMAR(m,pivot[j],t[j],md,tj) |
|
t[j] = tj; |
|
} |
|
} |
|
} |
|
} |
|
return 1; |
|
} |
|
|
/* |
/* |
Input |
Input |
a : n x n matrix; a result of LU-decomposition |
a : n x n matrix; a result of LU-decomposition |
Line 2462 void solve_by_lu_gfmmat(GFMMAT lu,unsigned int md, |
|
Line 2629 void solve_by_lu_gfmmat(GFMMAT lu,unsigned int md, |
|
} |
} |
} |
} |
|
|
|
void Plu_mat(NODE arg,LIST *rp) |
|
{ |
|
MAT m,lu; |
|
Q dn; |
|
Q *v; |
|
int n,i; |
|
int *iperm; |
|
VECT perm; |
|
NODE n0; |
|
|
|
asir_assert(ARG0(arg),O_MAT,"lu_mat"); |
|
m = (MAT)ARG0(arg); |
|
n = m->row; |
|
MKMAT(lu,n,n); |
|
lu_dec_cr(m,lu,&dn,&iperm); |
|
MKVECT(perm,n); |
|
for ( i = 0, v = (Q *)perm->body; i < n; i++ ) |
|
STOQ(iperm[i],v[i]); |
|
n0 = mknode(3,lu,dn,perm); |
|
MKLIST(*rp,n0); |
|
} |
|
|
void Plu_gfmmat(NODE arg,LIST *rp) |
void Plu_gfmmat(NODE arg,LIST *rp) |
{ |
{ |
MAT m; |
MAT m; |
Line 2473 void Plu_gfmmat(NODE arg,LIST *rp) |
|
Line 2662 void Plu_gfmmat(NODE arg,LIST *rp) |
|
VECT perm; |
VECT perm; |
NODE n0; |
NODE n0; |
|
|
asir_assert(ARG0(arg),O_MAT,"mat_to_gfmmat"); |
asir_assert(ARG0(arg),O_MAT,"lu_gfmmat"); |
asir_assert(ARG1(arg),O_N,"mat_to_gfmmat"); |
asir_assert(ARG1(arg),O_N,"lu_gfmmat"); |
m = (MAT)ARG0(arg); md = (unsigned int)QTOS((Q)ARG1(arg)); |
m = (MAT)ARG0(arg); md = (unsigned int)QTOS((Q)ARG1(arg)); |
mat_to_gfmmat(m,md,&mm); |
mat_to_gfmmat(m,md,&mm); |
row = m->row; |
row = m->row; |
Line 3265 void Pnd_det(NODE arg,P *rp) |
|
Line 3454 void Pnd_det(NODE arg,P *rp) |
|
nd_det(0,ARG0(arg),rp); |
nd_det(0,ARG0(arg),rp); |
else |
else |
nd_det(QTOS((Q)ARG1(arg)),ARG0(arg),rp); |
nd_det(QTOS((Q)ARG1(arg)),ARG0(arg),rp); |
|
} |
|
|
|
void Pmat_col(NODE arg,P *rp) |
|
{ |
|
int i,j,n; |
|
pointer t; |
|
MAT mat; |
|
VECT vect; |
|
|
|
asir_assert(ARG0(arg),O_MAT,"mat_col"); |
|
asir_assert(ARG1(arg),O_N,"mat_col"); |
|
mat = (MAT)ARG0(arg); |
|
j = QTOS((Q)ARG1(arg)); |
|
if ( j < 0 || j >= mat->col) { |
|
error("mat_col : Out of range"); |
|
} |
|
n = mat->row; |
|
MKVECT(vect,n); |
|
for(i=0; i<n; i++) { |
|
BDY(vect)[i] = BDY(mat)[i][j]; |
|
} |
|
*rp = vect; |
} |
} |