version 1.8, 2018/10/01 07:48:01 |
version 1.12, 2018/11/12 04:25:13 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2018/engine/nd.c,v 1.7 2018/10/01 05:49:06 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2018/engine/nd.c,v 1.11 2018/10/23 04:53:37 noro Exp $ */ |
|
|
#include "nd.h" |
#include "nd.h" |
|
|
struct oEGT eg_search; |
int Nnd_add,Nf4_red; |
|
struct oEGT eg_search,f4_symb,f4_conv,f4_elim1,f4_elim2; |
|
|
int diag_period = 6; |
int diag_period = 6; |
int weight_check = 1; |
int weight_check = 1; |
Line 1125 int ndl_check_bound2(int index,UINT *d2) |
|
Line 1126 int ndl_check_bound2(int index,UINT *d2) |
|
INLINE int ndl_hash_value(UINT *d) |
INLINE int ndl_hash_value(UINT *d) |
{ |
{ |
int i; |
int i; |
int r; |
UINT r; |
|
|
r = 0; |
r = 0; |
for ( i = 0; i < nd_wpd; i++ ) |
for ( i = 0; i < nd_wpd; i++ ) |
r = ((r<<16)+d[i])%REDTAB_LEN; |
r = (r*1511+d[i]); |
|
r %= REDTAB_LEN; |
return r; |
return r; |
} |
} |
|
|
Line 1216 ND nd_add(int mod,ND p1,ND p2) |
|
Line 1218 ND nd_add(int mod,ND p1,ND p2) |
|
ND r; |
ND r; |
NM m1,m2,mr0,mr,s; |
NM m1,m2,mr0,mr,s; |
|
|
|
Nnd_add++; |
if ( !p1 ) return p2; |
if ( !p1 ) return p2; |
else if ( !p2 ) return p1; |
else if ( !p2 ) return p1; |
else if ( mod == -1 ) return nd_add_sf(p1,p2); |
else if ( mod == -1 ) return nd_add_sf(p1,p2); |
Line 2081 NODE nd_gb(int m,int ishomo,int checkonly,int gensyz,i |
|
Line 2084 NODE nd_gb(int m,int ishomo,int checkonly,int gensyz,i |
|
P cont; |
P cont; |
LIST list; |
LIST list; |
|
|
|
Nnd_add = 0; |
g = 0; d = 0; |
g = 0; d = 0; |
for ( i = 0; i < nd_psn; i++ ) { |
for ( i = 0; i < nd_psn; i++ ) { |
d = update_pairs(d,g,i,gensyz); |
d = update_pairs(d,g,i,gensyz); |
|
|
} |
} |
} |
} |
conv_ilist(nd_demand,0,g,indp); |
conv_ilist(nd_demand,0,g,indp); |
if ( !checkonly && DP_Print ) { printf("nd_gb done.\n"); fflush(stdout); } |
if ( !checkonly && DP_Print ) { printf("nd_gb done. Number of nd_add=%d\n",Nnd_add); fflush(stdout); } |
return g; |
return g; |
} |
} |
|
|
Line 5889 Z *nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_p |
|
Line 5893 Z *nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_p |
|
return r; |
return r; |
} |
} |
|
|
IndArray nm_ind_pair_to_vect_compress(int trace,UINT *s0,int n,int *s0hash,NM_ind_pair pair) |
IndArray nm_ind_pair_to_vect_compress(int trace,UINT *s0,int n,NM_ind_pair pair,int start) |
{ |
{ |
NM m; |
NM m; |
NMV mr; |
NMV mr; |
UINT *d,*t,*s; |
UINT *d,*t,*s,*u; |
NDV p; |
NDV p; |
unsigned char *ivc; |
unsigned char *ivc; |
unsigned short *ivs; |
unsigned short *ivs; |
UINT *v,*ivi,*s0v; |
UINT *v,*ivi,*s0v; |
int i,j,len,prev,diff,cdiff,h; |
int i,j,len,prev,diff,cdiff,h,st,ed,md,c; |
IndArray r; |
IndArray r; |
struct oEGT eg0,eg1; |
|
|
|
m = pair->mul; |
m = pair->mul; |
d = DL(m); |
d = DL(m); |
Line 5912 struct oEGT eg0,eg1; |
|
Line 5915 struct oEGT eg0,eg1; |
|
len = LEN(p); |
len = LEN(p); |
t = (UINT *)MALLOC(nd_wpd*sizeof(UINT)); |
t = (UINT *)MALLOC(nd_wpd*sizeof(UINT)); |
v = (unsigned int *)MALLOC(len*sizeof(unsigned int)); |
v = (unsigned int *)MALLOC(len*sizeof(unsigned int)); |
get_eg(&eg0); |
for ( prev = start, mr = BDY(p), j = 0; j < len; j++, NMV_ADV(mr) ) { |
for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) { |
ndl_add(d,DL(mr),t); |
ndl_add(d,DL(mr),t); |
st = prev; |
h = ndl_hash_value(t); |
ed = n; |
for ( ; h != s0hash[i] || !ndl_equal(t,s); s += nd_wpd, i++ ); |
while ( ed > st ) { |
v[j] = i; |
md = (st+ed)/2; |
|
u = s0+md*nd_wpd; |
|
c = DL_COMPARE(u,t); |
|
if ( c == 0 ) break; |
|
else if ( c > 0 ) st = md; |
|
else ed = md; |
|
} |
|
prev = v[j] = md; |
} |
} |
get_eg(&eg1); add_eg(&eg_search,&eg0,&eg1); |
|
r = (IndArray)MALLOC(sizeof(struct oIndArray)); |
r = (IndArray)MALLOC(sizeof(struct oIndArray)); |
r->head = v[0]; |
r->head = v[0]; |
diff = 0; |
diff = 0; |
Line 6042 int ndv_reduce_vect_q(Z *svect,int trace,int col,IndAr |
|
Line 6051 int ndv_reduce_vect_q(Z *svect,int trace,int col,IndAr |
|
return maxrs; |
return maxrs; |
} |
} |
#else |
#else |
|
|
/* direct mpz version */ |
/* direct mpz version */ |
int ndv_reduce_vect_q(Z *svect0,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred) |
int ndv_reduce_vect_q(Z *svect0,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred) |
{ |
{ |
Line 6084 int ndv_reduce_vect_q(Z *svect0,int trace,int col,IndA |
|
Line 6094 int ndv_reduce_vect_q(Z *svect0,int trace,int col,IndA |
|
mpz_div(cs,svect[k],gcd); |
mpz_div(cs,svect[k],gcd); |
mpz_div(cr,BDY(CZ(mr)),gcd); |
mpz_div(cr,BDY(CZ(mr)),gcd); |
mpz_neg(cs,cs); |
mpz_neg(cs,cs); |
for ( j = 0; j < col; j++ ) |
if ( MUNIMPZ(cr) ) |
mpz_mul(svect[j],svect[j],cr); |
for ( j = 0; j < col; j++ ) mpz_neg(svect[j],svect[j]); |
|
else if ( !UNIMPZ(cr) ) |
|
for ( j = 0; j < col; j++ ) { |
|
if ( mpz_sgn(svect[j]) ) mpz_mul(svect[j],svect[j],cr); |
|
} |
mpz_set_ui(svect[k],0); |
mpz_set_ui(svect[k],0); |
prev = k; |
prev = k; |
switch ( ivect->width ) { |
switch ( ivect->width ) { |
Line 6665 NODE nd_f4(int m,int checkonly,int **indp) |
|
Line 6679 NODE nd_f4(int m,int checkonly,int **indp) |
|
PGeoBucket bucket; |
PGeoBucket bucket; |
struct oEGT eg0,eg1,eg_f4; |
struct oEGT eg0,eg1,eg_f4; |
Z i1,i2,sugarq; |
Z i1,i2,sugarq; |
|
|
|
init_eg(&f4_symb); init_eg(&f4_conv); init_eg(&f4_conv); init_eg(&f4_elim1); init_eg(&f4_elim2); |
#if 0 |
#if 0 |
ndv_alloc = 0; |
ndv_alloc = 0; |
#endif |
#endif |
|
Nf4_red=0; |
g = 0; d = 0; |
g = 0; d = 0; |
for ( i = 0; i < nd_psn; i++ ) { |
for ( i = 0; i < nd_psn; i++ ) { |
d = update_pairs(d,g,i,0); |
d = update_pairs(d,g,i,0); |
Line 6709 NODE nd_f4(int m,int checkonly,int **indp) |
|
Line 6726 NODE nd_f4(int m,int checkonly,int **indp) |
|
d = nd_reconstruct(0,d); |
d = nd_reconstruct(0,d); |
continue; |
continue; |
} |
} |
get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1); |
get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1); add_eg(&f4_symb,&eg0,&eg1); |
if ( DP_Print ) |
if ( DP_Print ) |
fprintf(asir_out,"sugar=%d,symb=%.3fsec,", |
fprintf(asir_out,"sugar=%d,symb=%.3fsec,", |
sugar,eg_f4.exectime); |
sugar,eg_f4.exectime); |
Line 6758 NODE nd_f4(int m,int checkonly,int **indp) |
|
Line 6775 NODE nd_f4(int m,int checkonly,int **indp) |
|
#if 0 |
#if 0 |
fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc); |
fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc); |
#endif |
#endif |
|
if ( DP_Print ) { |
|
fprintf(asir_out,"number of red=%d,",Nf4_red); |
|
fprintf(asir_out,"symb=%.3fsec,conv=%.3fsec,elim1=%.3fsec,elim2=%.3fsec\n", |
|
f4_symb.exectime,f4_conv.exectime,f4_elim1.exectime,f4_elim2.exectime); |
|
} |
conv_ilist(nd_demand,0,g,indp); |
conv_ilist(nd_demand,0,g,indp); |
return g; |
return g; |
} |
} |
Line 6981 NODE nd_f4_red_2(ND_pairs sp0,UINT *s0vect,int col,NOD |
|
Line 7003 NODE nd_f4_red_2(ND_pairs sp0,UINT *s0vect,int col,NOD |
|
unsigned long *v; |
unsigned long *v; |
|
|
get_eg(&eg0); |
get_eg(&eg0); |
init_eg(&eg_search); |
|
for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ ); |
for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ ); |
nred = length(rp0); |
nred = length(rp0); |
mat = alloc_matrix(nsp,col); |
mat = alloc_matrix(nsp,col); |
Line 7036 init_eg(&eg_search); |
|
Line 7057 init_eg(&eg_search); |
|
NODE nd_f4_red(int m,ND_pairs sp0,int trace,UINT *s0vect,int col,NODE rp0,ND_pairs *nz) |
NODE nd_f4_red(int m,ND_pairs sp0,int trace,UINT *s0vect,int col,NODE rp0,ND_pairs *nz) |
{ |
{ |
IndArray *imat; |
IndArray *imat; |
int nsp,nred,i; |
int nsp,nred,i,start; |
int *rhead; |
int *rhead; |
NODE r0,rp; |
NODE r0,rp; |
ND_pairs sp; |
ND_pairs sp; |
NM_ind_pair *rvect; |
NM_ind_pair *rvect; |
UINT *s; |
UINT *s; |
int *s0hash; |
int *s0hash; |
|
struct oEGT eg0,eg1,eg_conv; |
|
|
if ( m == 2 && nd_rref2 ) |
if ( m == 2 && nd_rref2 ) |
return nd_f4_red_2(sp0,s0vect,col,rp0,nz); |
return nd_f4_red_2(sp0,s0vect,col,rp0,nz); |
|
|
init_eg(&eg_search); |
|
for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ ); |
for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ ); |
nred = length(rp0); |
nred = length(rp0); |
imat = (IndArray *)MALLOC(nred*sizeof(IndArray)); |
imat = (IndArray *)MALLOC(nred*sizeof(IndArray)); |
Line 7055 init_eg(&eg_search); |
|
Line 7076 init_eg(&eg_search); |
|
for ( i = 0; i < col; i++ ) rhead[i] = 0; |
for ( i = 0; i < col; i++ ) rhead[i] = 0; |
|
|
/* construction of index arrays */ |
/* construction of index arrays */ |
|
get_eg(&eg0); |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"%dx%d,",nsp+nred,col); |
fprintf(asir_out,"%dx%d,",nsp+nred,col); |
|
fflush(asir_out); |
} |
} |
rvect = (NM_ind_pair *)MALLOC(nred*sizeof(NM_ind_pair)); |
rvect = (NM_ind_pair *)MALLOC(nred*sizeof(NM_ind_pair)); |
s0hash = (int *)MALLOC(col*sizeof(int)); |
for ( start = 0, rp = rp0, i = 0; rp; i++, rp = NEXT(rp) ) { |
for ( i = 0, s = s0vect; i < col; i++, s += nd_wpd ) |
|
s0hash[i] = ndl_hash_value(s); |
|
for ( rp = rp0, i = 0; rp; i++, rp = NEXT(rp) ) { |
|
rvect[i] = (NM_ind_pair)BDY(rp); |
rvect[i] = (NM_ind_pair)BDY(rp); |
imat[i] = nm_ind_pair_to_vect_compress(trace,s0vect,col,s0hash,rvect[i]); |
imat[i] = nm_ind_pair_to_vect_compress(trace,s0vect,col,rvect[i],start); |
rhead[imat[i]->head] = 1; |
rhead[imat[i]->head] = 1; |
|
start = imat[i]->head; |
} |
} |
|
get_eg(&eg1); init_eg(&eg_conv); add_eg(&eg_conv,&eg0,&eg1); add_eg(&f4_conv,&eg0,&eg1); |
|
if ( DP_Print ) { |
|
fprintf(asir_out,"conv=%.3fsec,",eg_conv.exectime); |
|
fflush(asir_out); |
|
} |
if ( m > 0 ) |
if ( m > 0 ) |
#if SIZEOF_LONG==8 |
#if SIZEOF_LONG==8 |
r0 = nd_f4_red_mod64_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz); |
r0 = nd_f4_red_mod64_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz); |
Line 7079 init_eg(&eg_search); |
|
Line 7105 init_eg(&eg_search); |
|
r0 = nd_f4_red_lf_main(m,sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred); |
r0 = nd_f4_red_lf_main(m,sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred); |
else |
else |
r0 = nd_f4_red_q_main(sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred); |
r0 = nd_f4_red_q_main(sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred); |
#if 0 |
|
if ( DP_Print ) print_eg("search",&eg_search); |
|
#endif |
|
return r0; |
return r0; |
} |
} |
|
|
Line 8196 P ndc_div(int mod,union oNDC a,union oNDC b) |
|
Line 8219 P ndc_div(int mod,union oNDC a,union oNDC b) |
|
int inv,t; |
int inv,t; |
|
|
if ( mod == -1 ) c.m = _mulsf(a.m,_invsf(b.m)); |
if ( mod == -1 ) c.m = _mulsf(a.m,_invsf(b.m)); |
else if ( mod == -2 ) divlf(a.gz,b.gz,&c.gz); |
else if ( mod == -2 ) divlf(a.z,b.z,&c.z); |
else if ( mod ) { |
else if ( mod ) { |
inv = invm(b.m,mod); |
inv = invm(b.m,mod); |
DMAR(a.m,inv,0,mod,t); c.m = t; |
DMAR(a.m,inv,0,mod,t); c.m = t; |
Line 8216 P ndctop(int mod,union oNDC c) |
|
Line 8239 P ndctop(int mod,union oNDC c) |
|
if ( mod == -1 ) { |
if ( mod == -1 ) { |
e = IFTOF(c.m); MKGFS(e,gfs); return (P)gfs; |
e = IFTOF(c.m); MKGFS(e,gfs); return (P)gfs; |
} else if ( mod == -2 ) { |
} else if ( mod == -2 ) { |
q = c.gz; return (P)q; |
q = c.z; return (P)q; |
} else if ( mod > 0 ) { |
} else if ( mod > 0 ) { |
STOZ(c.m,q); return (P)q; |
STOZ(c.m,q); return (P)q; |
} else |
} else |
Line 9012 NDV vect64_to_ndv(mp_limb_t *vect,int spcol,int col,in |
|
Line 9035 NDV vect64_to_ndv(mp_limb_t *vect,int spcol,int col,in |
|
int nd_to_vect64(int mod,UINT *s0,int n,ND d,mp_limb_t *r) |
int nd_to_vect64(int mod,UINT *s0,int n,ND d,mp_limb_t *r) |
{ |
{ |
NM m; |
NM m; |
UINT *t,*s; |
UINT *t,*s,*u; |
int i; |
int i,st,ed,md,prev,c; |
|
|
for ( i = 0; i < n; i++ ) r[i] = 0; |
for ( i = 0; i < n; i++ ) r[i] = 0; |
for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) { |
prev = 0; |
t = DL(m); |
for ( i = 0, m = BDY(d); m; m = NEXT(m) ) { |
for ( ; !ndl_equal(t,s); s += nd_wpd, i++ ); |
t = DL(m); |
r[i] = (mp_limb_t)CM(m); |
st = prev; |
|
ed = n; |
|
while ( ed > st ) { |
|
md = (st+ed)/2; |
|
u = s0+md*nd_wpd; |
|
c = DL_COMPARE(u,t); |
|
if ( c == 0 ) break; |
|
else if ( c > 0 ) st = md; |
|
else ed = md; |
|
} |
|
r[md] = (mp_limb_t)CM(m); |
|
prev = md; |
} |
} |
for ( i = 0; !r[i]; i++ ); |
for ( i = 0; !r[i]; i++ ); |
return i; |
return i; |
Line 9049 int ndv_reduce_vect64(int m,mp_limb_t *svect,mp_limb_t |
|
Line 9083 int ndv_reduce_vect64(int m,mp_limb_t *svect,mp_limb_t |
|
MOD128(a,c,m); |
MOD128(a,c,m); |
svect[k] = a; cvect[k] = 0; |
svect[k] = a; cvect[k] = 0; |
if ( (c = svect[k]) != 0 ) { |
if ( (c = svect[k]) != 0 ) { |
|
Nf4_red++; |
maxrs = MAX(maxrs,rp0[i]->sugar); |
maxrs = MAX(maxrs,rp0[i]->sugar); |
c = m-c; redv = nd_ps[rp0[i]->index]; |
c = m-c; redv = nd_ps[rp0[i]->index]; |
len = LEN(redv); mr = BDY(redv); |
len = LEN(redv); mr = BDY(redv); |
Line 9058 int ndv_reduce_vect64(int m,mp_limb_t *svect,mp_limb_t |
|
Line 9093 int ndv_reduce_vect64(int m,mp_limb_t *svect,mp_limb_t |
|
ivc = ivect->index.c; |
ivc = ivect->index.c; |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
pos = prev+ivc[j]; c1 = CM(mr); prev = pos; |
pos = prev+ivc[j]; c1 = CM(mr); prev = pos; |
if ( c1 ) { |
c2 = svect[pos]+c1*c; |
c2 = svect[pos]+c1*c; |
if ( c2 < svect[pos] ) cvect[pos]++; |
if ( c2 < svect[pos] ) cvect[pos]++; |
svect[pos] = c2; |
svect[pos] = c2; |
|
} |
|
} |
} |
break; |
break; |
case 2: |
case 2: |
ivs = ivect->index.s; |
ivs = ivect->index.s; |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
pos = prev+ivs[j]; c1 = CM(mr); prev = pos; |
pos = prev+ivs[j]; c1 = CM(mr); prev = pos; |
if ( c1 ) { |
c2 = svect[pos]+c1*c; |
c2 = svect[pos]+c1*c; |
if ( c2 < svect[pos] ) cvect[pos]++; |
if ( c2 < svect[pos] ) cvect[pos]++; |
svect[pos] = c2; |
svect[pos] = c2; |
|
} |
|
} |
} |
break; |
break; |
case 4: |
case 4: |
ivi = ivect->index.i; |
ivi = ivect->index.i; |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
pos = prev+ivi[j]; c1 = CM(mr); prev = pos; |
pos = prev+ivi[j]; c1 = CM(mr); prev = pos; |
if ( c1 ) { |
c2 = svect[pos]+c1*c; |
c2 = svect[pos]+c1*c; |
if ( c2 < svect[pos] ) cvect[pos]++; |
if ( c2 < svect[pos] ) cvect[pos]++; |
svect[pos] = c2; |
svect[pos] = c2; |
|
} |
|
} |
} |
break; |
break; |
} |
} |
Line 9140 NODE nd_f4_red_mod64_main(int m,ND_pairs sp0,int nsp,U |
|
Line 9169 NODE nd_f4_red_mod64_main(int m,ND_pairs sp0,int nsp,U |
|
} |
} |
nd_free(spol); |
nd_free(spol); |
} |
} |
get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1); |
get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1); add_eg(&f4_elim1,&eg0,&eg1); |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"elim1=%.3fsec,",eg_f4_1.exectime); |
fprintf(asir_out,"elim1=%.3fsec,",eg_f4_1.exectime); |
fflush(asir_out); |
fflush(asir_out); |
Line 9161 NODE nd_f4_red_mod64_main(int m,ND_pairs sp0,int nsp,U |
|
Line 9190 NODE nd_f4_red_mod64_main(int m,ND_pairs sp0,int nsp,U |
|
if ( r0 ) NEXT(r) = 0; |
if ( r0 ) NEXT(r) = 0; |
|
|
for ( ; i < sprow; i++ ) GCFREE(spmat[i]); |
for ( ; i < sprow; i++ ) GCFREE(spmat[i]); |
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); |
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); add_eg(&f4_elim2,&eg1,&eg2); |
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"elim2=%.3fsec,",eg_f4_2.exectime); |
fprintf(asir_out,"elim2=%.3fsec,",eg_f4_2.exectime); |
Line 9232 int nd_gauss_elim_mod64(mp_limb_t **mat,int *sugar,ND_ |
|
Line 9261 int nd_gauss_elim_mod64(mp_limb_t **mat,int *sugar,ND_ |
|
if ( (a = mat[i][j]) != 0 ) { |
if ( (a = mat[i][j]) != 0 ) { |
sugar[i] = MAX(sugar[i],s); |
sugar[i] = MAX(sugar[i],s); |
red_by_vect64(md,mat[i]+j,cmat[i]+j,mat[rank]+j,(int)(md-a),col-j); |
red_by_vect64(md,mat[i]+j,cmat[i]+j,mat[rank]+j,(int)(md-a),col-j); |
|
Nf4_red++; |
} |
} |
} |
} |
rank++; |
rank++; |
Line 9247 int nd_gauss_elim_mod64(mp_limb_t **mat,int *sugar,ND_ |
|
Line 9277 int nd_gauss_elim_mod64(mp_limb_t **mat,int *sugar,ND_ |
|
if ( a ) { |
if ( a ) { |
sugar[i] = MAX(sugar[i],s); |
sugar[i] = MAX(sugar[i],s); |
red_by_vect64(md,mat[i]+j,cmat[i]+j,mat[l]+j,(int)(md-a),col-j); |
red_by_vect64(md,mat[i]+j,cmat[i]+j,mat[l]+j,(int)(md-a),col-j); |
|
Nf4_red++; |
} |
} |
} |
} |
l--; |
l--; |