version 1.52, 2003/08/27 02:21:16 |
version 1.53, 2003/08/29 07:37:30 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.51 2003/08/27 01:53:29 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.52 2003/08/27 02:21:16 noro Exp $ */ |
|
|
#include "ca.h" |
#include "ca.h" |
#include "inline.h" |
#include "inline.h" |
Line 109 static ND _nd_free_list; |
|
Line 109 static ND _nd_free_list; |
|
static ND_pairs _ndp_free_list; |
static ND_pairs _ndp_free_list; |
|
|
static NDV *nd_ps; |
static NDV *nd_ps; |
static NDV *nd_psq; |
static NDV *nd_ps_trace; |
static RHist *nd_psh; |
static RHist *nd_psh; |
static int nd_psn,nd_pslen; |
static int nd_psn,nd_pslen; |
|
|
Line 239 INLINE int ndl_hash_value(unsigned int *d); |
|
Line 239 INLINE int ndl_hash_value(unsigned int *d); |
|
/* normal forms */ |
/* normal forms */ |
INLINE int nd_find_reducer(ND g); |
INLINE int nd_find_reducer(ND g); |
INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len); |
INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len); |
int nd_sp(int mod,ND_pairs p,ND *nf); |
int nd_sp(int mod,int trace,ND_pairs p,ND *nf); |
int nd_nf(int mod,ND g,int full,ND *nf); |
int nd_nf(int mod,ND g,NDV *ps,int full,ND *nf); |
int nd_nf_pbucket(int mod,ND g,int full,ND *nf); |
int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *nf); |
int nd_nf_direct(int mod,ND g,BaseSet base,int full,ND *rp); |
int nd_nf_direct(int mod,ND g,BaseSet base,int full,ND *rp); |
|
|
/* finalizers */ |
/* finalizers */ |
Line 1038 ND nd_add_q(ND p1,ND p2) |
|
Line 1038 ND nd_add_q(ND p1,ND p2) |
|
} |
} |
|
|
/* ret=1 : success, ret=0 : overflow */ |
/* ret=1 : success, ret=0 : overflow */ |
int nd_nf(int mod,ND g,int full,ND *rp) |
int nd_nf(int mod,ND g,NDV *ps,int full,ND *rp) |
{ |
{ |
ND d; |
ND d; |
NM m,mrd,tail; |
NM m,mrd,tail; |
Line 1068 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 1068 int nd_nf(int mod,ND g,int full,ND *rp) |
|
nd_free(g); nd_free(d); |
nd_free(g); nd_free(d); |
return 0; |
return 0; |
} |
} |
|
p = ps[index]; |
if ( mod ) { |
if ( mod ) { |
p = nd_ps[index]; |
|
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
} else { |
} else { |
p = nd_psq[index]; |
|
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
chsgnq(cg,&CQ(mul)); |
chsgnq(cg,&CQ(mul)); |
nd_mul_c_q(d,cred); nd_mul_c_q(g,cred); |
nd_mul_c_q(d,cred); nd_mul_c_q(g,cred); |
Line 1106 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 1105 int nd_nf(int mod,ND g,int full,ND *rp) |
|
return 1; |
return 1; |
} |
} |
|
|
int nd_nf_pbucket(int mod,ND g,int full,ND *rp) |
int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp) |
{ |
{ |
int hindex,index; |
int hindex,index; |
NDV p; |
NDV p; |
Line 1149 int nd_nf_pbucket(int mod,ND g,int full,ND *rp) |
|
Line 1148 int nd_nf_pbucket(int mod,ND g,int full,ND *rp) |
|
*rp = 0; |
*rp = 0; |
return 0; |
return 0; |
} |
} |
|
p = ps[index]; |
if ( mod ) { |
if ( mod ) { |
p = nd_ps[index]; |
|
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
} else { |
} else { |
p = nd_psq[index]; |
|
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
chsgnq(cg,&CQ(mul)); |
chsgnq(cg,&CQ(mul)); |
nd_mul_c_q(d,cred); |
nd_mul_c_q(d,cred); |
Line 1301 int nd_check_candidate(NODE input,NODE cand) |
|
Line 1299 int nd_check_candidate(NODE input,NODE cand) |
|
for ( t = input; t; t = NEXT(t) ) { |
for ( t = input; t; t = NEXT(t) ) { |
again: |
again: |
d = dptond(0,(DP)BDY(t)); |
d = dptond(0,(DP)BDY(t)); |
stat = nd_nf(0,d,0,&nf); |
stat = nd_nf(0,d,nd_ps,0,&nf); |
if ( !stat ) { |
if ( !stat ) { |
nd_reconstruct(0,0,0); |
nd_reconstruct(0,0,0); |
goto again; |
goto again; |
|
|
sugar = SG(l); |
sugar = SG(l); |
fprintf(asir_out,"%d",sugar); |
fprintf(asir_out,"%d",sugar); |
} |
} |
stat = nd_sp(m,l,&h); |
stat = nd_sp(m,0,l,&h); |
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
d = nd_reconstruct(m,0,d); |
d = nd_reconstruct(m,0,d); |
goto again; |
goto again; |
} |
} |
#if USE_GEOBUCKET |
#if USE_GEOBUCKET |
stat = m?nd_nf_pbucket(m,h,!Top,&nf):nd_nf(m,h,!Top,&nf); |
stat = m?nd_nf_pbucket(m,h,nd_ps,!Top,&nf):nd_nf(m,h,nd_ps,!Top,&nf); |
#else |
#else |
stat = nd_nf(m,h,!Top,&nf); |
stat = nd_nf(m,h,nd_ps,!Top,&nf); |
#endif |
#endif |
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
|
|
} else if ( nf ) { |
} else if ( nf ) { |
if ( checkonly ) return 0; |
if ( checkonly ) return 0; |
printf("+"); fflush(stdout); |
printf("+"); fflush(stdout); |
nh = m?nd_newps(m,nf,0):nd_newps(m,0,nf); |
nh = nd_newps(m,nf,0); |
d = update_pairs(d,g,nh); |
d = update_pairs(d,g,nh); |
g = update_base(g,nh); |
g = update_base(g,nh); |
FREENDP(l); |
FREENDP(l); |
|
|
FREENDP(l); |
FREENDP(l); |
} |
} |
} |
} |
if ( m ) |
for ( t = g; t; t = NEXT(t) ) BDY(t) = (pointer)nd_ps[(int)BDY(t)]; |
for ( t = g; t; t = NEXT(t) ) BDY(t) = (pointer)nd_ps[(int)BDY(t)]; |
|
else |
|
for ( t = g; t; t = NEXT(t) ) BDY(t) = (pointer)nd_psq[(int)BDY(t)]; |
|
return g; |
return g; |
} |
} |
|
|
|
|
sugar = SG(l); |
sugar = SG(l); |
fprintf(asir_out,"%d",sugar); |
fprintf(asir_out,"%d",sugar); |
} |
} |
stat = nd_sp(m,l,&h); |
stat = nd_sp(m,0,l,&h); |
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
d = nd_reconstruct(m,1,d); |
d = nd_reconstruct(m,1,d); |
goto again; |
goto again; |
} |
} |
#if USE_GEOBUCKET |
#if USE_GEOBUCKET |
stat = nd_nf_pbucket(m,h,!Top,&nf); |
stat = nd_nf_pbucket(m,h,nd_ps,!Top,&nf); |
#else |
#else |
stat = nd_nf(m,h,!Top,&nf); |
stat = nd_nf(m,h,nd_ps,!Top,&nf); |
#endif |
#endif |
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
|
|
goto again; |
goto again; |
} else if ( nf ) { |
} else if ( nf ) { |
/* overflow does not occur */ |
/* overflow does not occur */ |
nd_sp(0,l,&h); |
nd_sp(0,1,l,&h); |
nd_nf(0,h,!Top,&nfq); |
nd_nf(0,h,nd_ps_trace,!Top,&nfq); |
if ( nfq ) { |
if ( nfq ) { |
printf("+"); fflush(stdout); |
printf("+"); fflush(stdout); |
nh = nd_newps(m,nf,nfq); |
nh = nd_newps(m,nf,nfq); |
|
|
FREENDP(l); |
FREENDP(l); |
} |
} |
for ( t = g; t; t = NEXT(t) ) |
for ( t = g; t; t = NEXT(t) ) |
BDY(t) = (pointer)nd_psq[(int)BDY(t)]; |
BDY(t) = (pointer)nd_ps_trace[(int)BDY(t)]; |
return g; |
return g; |
} |
} |
|
|
Line 1899 int nd_newps(int mod,ND a,ND aq) |
|
Line 1894 int nd_newps(int mod,ND a,ND aq) |
|
RHist r; |
RHist r; |
NDV b; |
NDV b; |
|
|
|
if ( aq ) { |
|
/* trace lifting */ |
|
if ( !rem(NM(HCQ(aq)),mod) ) |
|
return -1; |
|
} |
if ( nd_psn == nd_pslen ) { |
if ( nd_psn == nd_pslen ) { |
nd_pslen *= 2; |
nd_pslen *= 2; |
nd_ps = (NDV *)REALLOC((char *)nd_ps,nd_pslen*sizeof(NDV)); |
nd_ps = (NDV *)REALLOC((char *)nd_ps,nd_pslen*sizeof(NDV)); |
nd_psq = (NDV *)REALLOC((char *)nd_psq,nd_pslen*sizeof(NDV)); |
nd_ps_trace = (NDV *)REALLOC((char *)nd_ps_trace,nd_pslen*sizeof(NDV)); |
nd_psh = (RHist *)REALLOC((char *)nd_psh,nd_pslen*sizeof(RHist)); |
nd_psh = (RHist *)REALLOC((char *)nd_psh,nd_pslen*sizeof(RHist)); |
nd_bound = (unsigned int **) |
nd_bound = (unsigned int **) |
REALLOC((char *)nd_bound,nd_pslen*sizeof(unsigned int *)); |
REALLOC((char *)nd_bound,nd_pslen*sizeof(unsigned int *)); |
} |
} |
if ( a && aq ) { |
|
/* trace lifting */ |
|
if ( !rem(NM(HCQ(aq)),mod) ) |
|
return -1; |
|
} |
|
NEWRHist(r); nd_psh[nd_psn] = r; |
NEWRHist(r); nd_psh[nd_psn] = r; |
|
nd_removecont(mod,a); nd_ps[nd_psn] = ndtondv(mod,a); |
if ( aq ) { |
if ( aq ) { |
nd_removecont(0,aq); |
nd_removecont(0,aq); nd_ps_trace[nd_psn] = ndtondv(0,aq); |
nd_psq[nd_psn] = ndtondv(0,aq); |
nd_bound[nd_psn] = ndv_compute_bound(nd_ps_trace[nd_psn]); |
nd_bound[nd_psn] = ndv_compute_bound(nd_psq[nd_psn]); |
|
SG(r) = SG(aq); ndl_copy(HDL(aq),DL(r)); |
SG(r) = SG(aq); ndl_copy(HDL(aq),DL(r)); |
|
nd_free(a); nd_free(aq); |
|
} else { |
|
nd_bound[nd_psn] = ndv_compute_bound(nd_ps[nd_psn]); |
|
SG(r) = SG(a); ndl_copy(HDL(a),DL(r)); |
|
nd_free(a); |
} |
} |
if ( a ) { |
|
nd_removecont(mod,a); |
|
nd_ps[nd_psn] = ndtondv(mod,a); |
|
if ( !aq ) { |
|
nd_bound[nd_psn] = ndv_compute_bound(nd_ps[nd_psn]); |
|
SG(r) = SG(a); ndl_copy(HDL(a),DL(r)); |
|
} |
|
} |
|
nd_free(a); nd_free(aq); |
|
return nd_psn++; |
return nd_psn++; |
} |
} |
|
|
Line 1943 void nd_setup(int mod,int trace,NODE f) |
|
Line 1934 void nd_setup(int mod,int trace,NODE f) |
|
|
|
nd_psn = length(f); nd_pslen = 2*nd_psn; |
nd_psn = length(f); nd_pslen = 2*nd_psn; |
nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
nd_psq = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist)); |
nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist)); |
nd_bound = (unsigned int **)MALLOC(nd_pslen*sizeof(unsigned int *)); |
nd_bound = (unsigned int **)MALLOC(nd_pslen*sizeof(unsigned int *)); |
for ( max = 0, i = 0, s = f; i < nd_psn; i++, s = NEXT(s) ) { |
for ( max = 0, i = 0, s = f; i < nd_psn; i++, s = NEXT(s) ) { |
Line 1969 void nd_setup(int mod,int trace,NODE f) |
|
Line 1960 void nd_setup(int mod,int trace,NODE f) |
|
a = dptondv(mod,(DP)BDY(f)); ndv_removecont(mod,a); |
a = dptondv(mod,(DP)BDY(f)); ndv_removecont(mod,a); |
SG(r) = HTD(a); ndl_copy(HDL(a),DL(r)); |
SG(r) = HTD(a); ndl_copy(HDL(a),DL(r)); |
|
|
|
nd_ps[i] = a; |
if ( trace ) { |
if ( trace ) { |
nd_ps[i] = a; |
|
a = dptondv(0,(DP)BDY(f)); ndv_removecont(0,a); |
a = dptondv(0,(DP)BDY(f)); ndv_removecont(0,a); |
nd_psq[i] = a; |
nd_ps_trace[i] = a; |
} else { |
|
if ( mod ) nd_ps[i] = a; |
|
else nd_psq[i] = a; |
|
} |
} |
nd_psh[i] = r; |
nd_psh[i] = r; |
} |
} |
Line 2607 ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d) |
|
Line 2595 ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d) |
|
prev_ndp_free_list = _ndp_free_list; |
prev_ndp_free_list = _ndp_free_list; |
_nm_free_list = 0; |
_nm_free_list = 0; |
_ndp_free_list = 0; |
_ndp_free_list = 0; |
if ( mod != 0 ) |
for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_ps[i],obpe,oadv,oepos); |
for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_ps[i],obpe,oadv,oepos); |
if ( trace ) |
if ( !mod || trace ) |
for ( i = nd_psn-1; i >= 0; i-- ) |
for ( i = nd_psn-1; i >= 0; i-- ) ndv_realloc(nd_psq[i],obpe,oadv,oepos); |
ndv_realloc(nd_ps_trace[i],obpe,oadv,oepos); |
s0 = 0; |
s0 = 0; |
for ( t = d; t; t = NEXT(t) ) { |
for ( t = d; t; t = NEXT(t) ) { |
NEXTND_pairs(s0,s); |
NEXTND_pairs(s0,s); |
Line 2747 ND nd_copy(ND p) |
|
Line 2735 ND nd_copy(ND p) |
|
} |
} |
} |
} |
|
|
int nd_sp(int mod,ND_pairs p,ND *rp) |
int nd_sp(int mod,int trace,ND_pairs p,ND *rp) |
{ |
{ |
NM m; |
NM m; |
NDV p1,p2; |
NDV p1,p2; |
Line 2755 int nd_sp(int mod,ND_pairs p,ND *rp) |
|
Line 2743 int nd_sp(int mod,ND_pairs p,ND *rp) |
|
unsigned int *lcm; |
unsigned int *lcm; |
int td; |
int td; |
|
|
if ( mod ) { |
if ( trace ) { |
p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2]; |
p1 = nd_ps_trace[p->i1]; p2 = nd_ps_trace[p->i2]; |
} else { |
} else { |
p1 = nd_psq[p->i1]; p2 = nd_psq[p->i2]; |
p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2]; |
} |
} |
lcm = LCM(p); |
lcm = LCM(p); |
NEWNM(m); |
NEWNM(m); |