version 1.13, 2001/06/07 05:14:48 |
version 1.17, 2001/09/10 05:55:13 |
|
|
* 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.12 2001/06/07 04:54:38 noro Exp $ |
* $OpenXM$ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "base.h" |
#include "base.h" |
Line 67 void mat_to_gfmmat(MAT,unsigned int,GFMMAT *); |
|
Line 67 void mat_to_gfmmat(MAT,unsigned int,GFMMAT *); |
|
|
|
int generic_gauss_elim_mod(int **,int,int,int,int *); |
int generic_gauss_elim_mod(int **,int,int,int,int *); |
int generic_gauss_elim(MAT ,MAT *,Q *,int **,int **); |
int generic_gauss_elim(MAT ,MAT *,Q *,int **,int **); |
|
void reduce_sp_by_red_mod_compress (int *,CDP *,int *,int,int,int); |
|
|
int gauss_elim_mod(int **,int,int,int); |
int gauss_elim_mod(int **,int,int,int); |
int gauss_elim_mod1(int **,int,int,int); |
int gauss_elim_mod1(int **,int,int,int); |
Line 90 void Px962_irredpoly_up2(); |
|
Line 91 void Px962_irredpoly_up2(); |
|
void Pirredpoly_up2(); |
void Pirredpoly_up2(); |
void Pnbpoly_up2(); |
void Pnbpoly_up2(); |
void Pqsort(); |
void Pqsort(); |
|
void Pexponent_vector(); |
|
|
struct ftab array_tab[] = { |
struct ftab array_tab[] = { |
{"solve_by_lu_gfmmat",Psolve_by_lu_gfmmat,4}, |
{"solve_by_lu_gfmmat",Psolve_by_lu_gfmmat,4}, |
Line 97 struct ftab array_tab[] = { |
|
Line 99 struct ftab array_tab[] = { |
|
{"mat_to_gfmmat",Pmat_to_gfmmat,2}, |
{"mat_to_gfmmat",Pmat_to_gfmmat,2}, |
{"generic_gauss_elim_mod",Pgeneric_gauss_elim_mod,2}, |
{"generic_gauss_elim_mod",Pgeneric_gauss_elim_mod,2}, |
{"newvect",Pnewvect,-2}, |
{"newvect",Pnewvect,-2}, |
|
{"vector",Pnewvect,-2}, |
|
{"exponent_vector",Pexponent_vector,-99999999}, |
{"newmat",Pnewmat,-3}, |
{"newmat",Pnewmat,-3}, |
|
{"matrix",Pnewmat,-3}, |
{"newbytearray",Pnewbytearray,-2}, |
{"newbytearray",Pnewbytearray,-2}, |
{"sepmat_destructive",Psepmat_destructive,2}, |
{"sepmat_destructive",Psepmat_destructive,2}, |
{"sepvect",Psepvect,2}, |
{"sepvect",Psepvect,2}, |
|
|
*rp = vect; |
*rp = vect; |
} |
} |
|
|
|
void Pexponent_vector(arg,rp) |
|
NODE arg; |
|
DP *rp; |
|
{ |
|
nodetod(arg,rp); |
|
} |
|
|
void Pnewbytearray(arg,rp) |
void Pnewbytearray(arg,rp) |
NODE arg; |
NODE arg; |
BYTEARRAY *rp; |
BYTEARRAY *rp; |
|
|
ONE_STEP1 ONE_STEP1 ONE_STEP1 ONE_STEP1 |
ONE_STEP1 ONE_STEP1 ONE_STEP1 ONE_STEP1 |
ONE_STEP1 ONE_STEP1 ONE_STEP1 ONE_STEP1 |
ONE_STEP1 ONE_STEP1 ONE_STEP1 ONE_STEP1 |
} |
} |
for ( ; k >= 0; k-- ) { |
for ( ; k > 0; k-- ) { |
if ( zzz = *s ) { DMAR(zzz,hc,*tj,md,*tj) } tj++; s++; |
if ( zzz = *s ) { DMAR(zzz,hc,*tj,md,*tj) } tj++; s++; |
} |
} |
} |
} |
|
|
hc = md-hc; |
hc = md-hc; |
s = redmat[i]+j; |
s = redmat[i]+j; |
tj = sp+j; |
tj = sp+j; |
for ( k = col-j; k >= 0; k-- ) { |
for ( k = col-j; k > 0; k-- ) { |
if ( zzz = *s ) { DMAR(zzz,hc,*tj,md,*tj) } tj++; s++; |
if ( zzz = *s ) { DMAR(zzz,hc,*tj,md,*tj) } tj++; s++; |
} |
} |
} |
} |
} |
} |
} |
} |
|
|
|
/* |
|
rlist : reducers list |
|
ht(BDY(rlist)) < ht(BDY(NEXT(rlist)) < ... w.r.t. the term order |
|
*/ |
|
|
|
void reduce_reducers_mod_compress(rlist,nred,at,col,md,redmatp,indredp) |
|
NODE rlist; |
|
int nred; |
|
DL *at; |
|
int col,md; |
|
CDP **redmatp; |
|
int **indredp; |
|
{ |
|
CDP *redmat; |
|
CDP t; |
|
int *indred,*w; |
|
int i,k; |
|
NODE r; |
|
|
|
*redmatp = redmat = (CDP *)CALLOC(nred,sizeof(CDP)); |
|
*indredp = indred = (int *)CALLOC(nred,sizeof(int)); |
|
w = (int *)CALLOC(col,sizeof(int)); |
|
|
|
_dpmod_to_vect_compress(BDY(rlist),at,&redmat[0]); |
|
indred[0] = redmat[0]->body[0].index; |
|
|
|
for ( i = 1, r = NEXT(rlist); i < nred; i++, r = NEXT(r) ) { |
|
bzero(w,col*sizeof(int)); |
|
_dpmod_to_vect(BDY(r),at,w); |
|
reduce_sp_by_red_mod_compress(w,redmat,indred,i,col,md); |
|
compress_vect(w,col,&redmat[i]); |
|
indred[i] = redmat[i]->body[0].index; |
|
} |
|
} |
|
|
|
/* |
|
mat[i] : compressed reducers (i=0,...,nred-1) |
|
mat[0] < mat[1] < ... < mat[nred-1] w.r.t the term order |
|
*/ |
|
|
|
void reduce_sp_by_red_mod_compress (sp,redmat,ind,nred,col,md) |
|
int *sp; |
|
CDP *redmat; |
|
int *ind; |
|
int nred,col; |
|
int md; |
|
{ |
|
int i,j,k,hc,c,len; |
|
int *tj; |
|
CDP ri; |
|
|
|
/* reduce the spolys by redmat */ |
|
for ( i = nred-1; i >= 0; i-- ) { |
|
/* reduce sp by redmat[i] */ |
|
if ( hc = sp[ind[i]] ) { |
|
/* sp = sp-hc*redmat[i] */ |
|
hc = md-hc; |
|
ri = redmat[i]; |
|
len = ri->len; |
|
for ( k = 0; k < len; k++ ) { |
|
j = ri->body[k].index; |
|
c = ri->body[k].c; |
|
tj = sp+j; |
|
#if 1 |
|
DMAR(c,hc,*tj,md,*tj); |
|
#else |
|
*tj = ((hc*c)+(*tj))%md; |
|
#endif |
|
} |
|
} |
|
} |
|
} |
|
|
#define ONE_STEP2 if ( zzz = *pk ) { DMAR(zzz,a,*tk,md,*tk) } pk++; tk++; |
#define ONE_STEP2 if ( zzz = *pk ) { DMAR(zzz,a,*tk,md,*tk) } pk++; tk++; |
|
|
int generic_gauss_elim_mod(mat,row,col,md,colstat) |
int generic_gauss_elim_mod(mat,row,col,md,colstat) |
|
|
ONE_STEP2 ONE_STEP2 ONE_STEP2 ONE_STEP2 |
ONE_STEP2 ONE_STEP2 ONE_STEP2 ONE_STEP2 |
ONE_STEP2 ONE_STEP2 ONE_STEP2 ONE_STEP2 |
ONE_STEP2 ONE_STEP2 ONE_STEP2 ONE_STEP2 |
} |
} |
for ( ; k >= 0; k -- ) { |
for ( ; k > 0; k -- ) { |
if ( zzz = *pk ) { DMAR(zzz,a,*tk,md,*tk) } pk++; tk++; |
if ( zzz = *pk ) { DMAR(zzz,a,*tk,md,*tk) } pk++; tk++; |
} |
} |
} |
} |
|
|
ONE_STEP2 ONE_STEP2 ONE_STEP2 ONE_STEP2 |
ONE_STEP2 ONE_STEP2 ONE_STEP2 ONE_STEP2 |
ONE_STEP2 ONE_STEP2 ONE_STEP2 ONE_STEP2 |
ONE_STEP2 ONE_STEP2 ONE_STEP2 ONE_STEP2 |
} |
} |
for ( ; k >= 0; k -- ) { |
for ( ; k > 0; k -- ) { |
if ( zzz = *pk ) { DMAR(zzz,a,*tk,md,*tk) } pk++; tk++; |
if ( zzz = *pk ) { DMAR(zzz,a,*tk,md,*tk) } pk++; tk++; |
} |
} |
} |
} |