version 1.25, 2003/08/07 08:46:50 |
version 1.30, 2003/08/12 09:07:19 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.24 2003/08/05 08:06:21 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.29 2003/08/11 07:37:08 noro Exp $ */ |
|
|
#include "ca.h" |
#include "ca.h" |
#include "inline.h" |
#include "inline.h" |
|
|
#define INLINE |
#define INLINE |
#endif |
#endif |
|
|
|
#define USE_GEOBUCKET 1 |
|
|
#define REDTAB_LEN 32003 |
#define REDTAB_LEN 32003 |
|
|
typedef struct oPGeoBucket { |
typedef struct oPGeoBucket { |
int m; |
int m; |
struct oND *body[32]; |
struct oND *body[32]; |
|
int len[32]; |
} *PGeoBucket; |
} *PGeoBucket; |
|
|
typedef struct oND { |
typedef struct oND { |
Line 122 if(!(r)){(c)=(r)=(s);}else{NEXT(c)=(s);(c)=(s);} |
|
Line 125 if(!(r)){(c)=(r)=(s);}else{NEXT(c)=(s);(c)=(s);} |
|
#define NEXTND_pairs(r,c) \ |
#define NEXTND_pairs(r,c) \ |
if(!(r)){NEWND_pairs(r);(c)=(r);}else{NEWND_pairs(NEXT(c));(c)=NEXT(c);} |
if(!(r)){NEWND_pairs(r);(c)=(r);}else{NEWND_pairs(NEXT(c));(c)=NEXT(c);} |
|
|
|
int nd_check_candidate(NODE input,NODE cand); |
void nd_removecont(int mod,ND p); |
void nd_removecont(int mod,ND p); |
void nd_removecont2(ND p1,ND p2); |
void nd_removecont2(ND p1,ND p2); |
void ndv_removecont(int mod,NDV p); |
void ndv_removecont(int mod,NDV p); |
Line 130 void ndv_mul_c_q(NDV p,Q mul); |
|
Line 134 void ndv_mul_c_q(NDV p,Q mul); |
|
void nd_mul_c_q(ND p,Q mul); |
void nd_mul_c_q(ND p,Q mul); |
ND normalize_pbucket(int mod,PGeoBucket g); |
ND normalize_pbucket(int mod,PGeoBucket g); |
int head_pbucket(int mod,PGeoBucket g); |
int head_pbucket(int mod,PGeoBucket g); |
|
int head_pbucket_q(PGeoBucket g); |
void add_pbucket(int mod,PGeoBucket g,ND d,int l); |
void add_pbucket(int mod,PGeoBucket g,ND d,int l); |
void free_pbucket(PGeoBucket b); |
void free_pbucket(PGeoBucket b); |
|
void mulq_pbucket(PGeoBucket g,Q c); |
PGeoBucket create_pbucket(); |
PGeoBucket create_pbucket(); |
ND nd_remove_head(ND p); |
ND nd_remove_head(ND p); |
|
|
void GC_gcollect(); |
void GC_gcollect(); |
NODE append_one(NODE,int); |
NODE append_one(NODE,int); |
|
NODE nd_reducebase(NODE x); |
|
|
void removecont_array(Q *c,int n); |
void removecont_array(Q *c,int n); |
ND_pairs crit_B( ND_pairs d, int s ); |
ND_pairs crit_B( ND_pairs d, int s ); |
Line 154 ND_pairs crit_F( ND_pairs d1 ); |
|
Line 161 ND_pairs crit_F( ND_pairs d1 ); |
|
ND_pairs crit_M( ND_pairs d1 ); |
ND_pairs crit_M( ND_pairs d1 ); |
ND_pairs nd_newpairs( NODE g, int t ); |
ND_pairs nd_newpairs( NODE g, int t ); |
ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t); |
ND_pairs update_pairs( ND_pairs d, NODE /* of index */ g, int t); |
NODE nd_gb(int m); |
NODE nd_gb(int m,int checkonly); |
NODE nd_gb_trace(int m); |
NODE nd_gb_trace(int m); |
void nd_free_private_storage(); |
void nd_free_private_storage(); |
void _NM_alloc(); |
void _NM_alloc(); |
void _ND_alloc(); |
void _ND_alloc(); |
int ndl_td(unsigned int *d); |
int ndl_td(unsigned int *d); |
int ndl_dehomogenize(unsigned int *p); |
int ndl_dehomogenize(unsigned int *p); |
ND nd_add(int mod,ND p1,ND p2); |
ND nd_add(int mod,ND p1,ND p2,int *cancel); |
ND nd_add_q(ND p1,ND p2); |
ND nd_add_q(ND p1,ND p2,int *cancel); |
ND nd_mul_nm(int mod,ND p,NM m0); |
ND nd_mul_nm(int mod,ND p,NM m0); |
ND nd_mul_ind_nm(int mod,int index,NM m0); |
ND nd_mul_ind_nm(int mod,int index,NM m0); |
int nd_sp(int mod,ND_pairs p,ND *nf); |
int nd_sp(int mod,ND_pairs p,ND *nf); |
int nd_find_reducer(ND g); |
int nd_find_reducer(ND g); |
int nd_find_reducer_direct(ND g,NDV *ps,int len); |
int nd_find_reducer_direct(ND g,NDV *ps,int len); |
int nd_nf(int mod,ND g,int full,ND *nf); |
int nd_nf(int mod,ND g,int full,ND *nf); |
|
int nd_nf_pbucket(int mod,ND g,int full,ND *nf); |
|
int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full,ND *rp); |
|
int nd_nf_direct_pbucket(int mod,ND g,NDV *ps,int len,int full,ND *rp); |
ND nd_reduce(ND p1,ND p2); |
ND nd_reduce(ND p1,ND p2); |
ND nd_reduce_special(ND p1,ND p2); |
ND nd_reduce_special(ND p1,ND p2); |
NODE nd_reduceall(int m,NODE f); |
NODE nd_reduceall(int m,NODE f); |
|
int nd_gbcheck(int m,NODE f); |
|
int nd_membercheck(int m,NODE f); |
void nd_free(ND p); |
void nd_free(ND p); |
void ndv_free(NDV p); |
void ndv_free(NDV p); |
void ndl_print(unsigned int *dl); |
void ndl_print(unsigned int *dl); |
Line 249 void _NDP_alloc() |
|
Line 261 void _NDP_alloc() |
|
} |
} |
} |
} |
|
|
INLINE nd_length(ND p) |
INLINE int nd_length(ND p) |
{ |
{ |
NM m; |
NM m; |
int i; |
int i; |
Line 749 INLINE int nd_find_reducer(ND g) |
|
Line 761 INLINE int nd_find_reducer(ND g) |
|
return r->index; |
return r->index; |
} |
} |
} |
} |
|
|
if ( Reverse ) |
if ( Reverse ) |
for ( i = nd_psn-1; i >= 0; i-- ) { |
for ( i = nd_psn-1; i >= 0; i-- ) { |
r = nd_psh[i]; |
r = nd_psh[i]; |
Line 795 INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len |
|
Line 806 INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len |
|
return -1; |
return -1; |
} |
} |
|
|
ND nd_add(int mod,ND p1,ND p2) |
ND nd_add(int mod,ND p1,ND p2,int *cancel) |
{ |
{ |
int n,c; |
int n,c; |
int t; |
int t,can; |
ND r; |
ND r; |
NM m1,m2,mr0,mr,s; |
NM m1,m2,mr0,mr,s; |
|
|
if ( !p1 ) |
if ( !p1 ) { |
|
*cancel = 0; |
return p2; |
return p2; |
else if ( !p2 ) |
} else if ( !p2 ) { |
|
*cancel = 0; |
return p1; |
return p1; |
else if ( !mod ) |
} else if ( !mod ) |
return nd_add_q(p1,p2); |
return nd_add_q(p1,p2,cancel); |
else { |
else { |
|
can = 0; |
for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) { |
for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) { |
if ( TD(m1) > TD(m2) ) |
if ( TD(m1) > TD(m2) ) |
c = 1; |
c = 1; |
Line 823 ND nd_add(int mod,ND p1,ND p2) |
|
Line 837 ND nd_add(int mod,ND p1,ND p2) |
|
t += mod; |
t += mod; |
s = m1; m1 = NEXT(m1); |
s = m1; m1 = NEXT(m1); |
if ( t ) { |
if ( t ) { |
|
can++; |
NEXTNM2(mr0,mr,s); CM(mr) = (t); |
NEXTNM2(mr0,mr,s); CM(mr) = (t); |
} else { |
} else { |
|
can += 2; |
FREENM(s); |
FREENM(s); |
} |
} |
s = m2; m2 = NEXT(m2); FREENM(s); |
s = m2; m2 = NEXT(m2); FREENM(s); |
Line 837 ND nd_add(int mod,ND p1,ND p2) |
|
Line 853 ND nd_add(int mod,ND p1,ND p2) |
|
break; |
break; |
} |
} |
} |
} |
|
*cancel = can; |
if ( !mr0 ) |
if ( !mr0 ) |
if ( m1 ) |
if ( m1 ) |
mr0 = m1; |
mr0 = m1; |
Line 857 ND nd_add(int mod,ND p1,ND p2) |
|
Line 874 ND nd_add(int mod,ND p1,ND p2) |
|
} |
} |
} |
} |
|
|
ND nd_add_q(ND p1,ND p2) |
ND nd_add_q(ND p1,ND p2,int *cancel) |
{ |
{ |
int n,c; |
int n,c,can; |
ND r; |
ND r; |
NM m1,m2,mr0,mr,s; |
NM m1,m2,mr0,mr,s; |
Q t; |
Q t; |
|
|
if ( !p1 ) |
if ( !p1 ) { |
|
*cancel = 0; |
return p2; |
return p2; |
else if ( !p2 ) |
} else if ( !p2 ) { |
|
*cancel = 0; |
return p1; |
return p1; |
else { |
} else { |
|
can = 0; |
for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) { |
for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) { |
if ( TD(m1) > TD(m2) ) |
if ( TD(m1) > TD(m2) ) |
c = 1; |
c = 1; |
Line 881 ND nd_add_q(ND p1,ND p2) |
|
Line 901 ND nd_add_q(ND p1,ND p2) |
|
addq(CQ(m1),CQ(m2),&t); |
addq(CQ(m1),CQ(m2),&t); |
s = m1; m1 = NEXT(m1); |
s = m1; m1 = NEXT(m1); |
if ( t ) { |
if ( t ) { |
|
can++; |
NEXTNM2(mr0,mr,s); CQ(mr) = (t); |
NEXTNM2(mr0,mr,s); CQ(mr) = (t); |
} else { |
} else { |
|
can += 2; |
FREENM(s); |
FREENM(s); |
} |
} |
s = m2; m2 = NEXT(m2); FREENM(s); |
s = m2; m2 = NEXT(m2); FREENM(s); |
Line 895 ND nd_add_q(ND p1,ND p2) |
|
Line 917 ND nd_add_q(ND p1,ND p2) |
|
break; |
break; |
} |
} |
} |
} |
|
*cancel = can; |
if ( !mr0 ) |
if ( !mr0 ) |
if ( m1 ) |
if ( m1 ) |
mr0 = m1; |
mr0 = m1; |
Line 915 ND nd_add_q(ND p1,ND p2) |
|
Line 938 ND nd_add_q(ND p1,ND p2) |
|
} |
} |
} |
} |
|
|
#if 1 |
|
/* 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,int full,ND *rp) |
{ |
{ |
Line 923 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 945 int nd_nf(int mod,ND g,int full,ND *rp) |
|
NM m,mrd,tail; |
NM m,mrd,tail; |
NM mul; |
NM mul; |
int n,sugar,psugar,sugar0,stat,index; |
int n,sugar,psugar,sugar0,stat,index; |
int c,c1,c2; |
int c,c1,c2,dummy; |
RHist h; |
RHist h; |
NDV p,red; |
NDV p,red; |
Q cg,cred,gcd; |
Q cg,cred,gcd; |
Line 964 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 986 int nd_nf(int mod,ND g,int full,ND *rp) |
|
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); |
} |
} |
g = nd_add(mod,g,ndv_mul_nm(mod,p,mul)); |
g = nd_add(mod,g,ndv_mul_nm(mod,p,mul),&dummy); |
sugar = MAX(sugar,SG(p)+TD(mul)); |
sugar = MAX(sugar,SG(p)+TD(mul)); |
if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) { |
if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) { |
nd_removecont2(d,g); |
nd_removecont2(d,g); |
|
|
*rp = d; |
*rp = d; |
return 1; |
return 1; |
} |
} |
#else |
|
int nd_nf(int mod,ND g,int full,ND *rp) |
int nd_nf_pbucket(int mod,ND g,int full,ND *rp) |
{ |
{ |
int hindex,index; |
int hindex,index; |
NDV p; |
NDV p; |
Line 1006 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 1028 int nd_nf(int mod,ND g,int full,ND *rp) |
|
int sugar,psugar,n,h_reducible; |
int sugar,psugar,n,h_reducible; |
PGeoBucket bucket; |
PGeoBucket bucket; |
int c,c1,c2; |
int c,c1,c2; |
Q cg,cred,gcd; |
Q cg,cred,gcd,zzz; |
RHist h; |
RHist h; |
|
double hmag,gmag; |
|
|
if ( !g ) { |
if ( !g ) { |
*rp = 0; |
*rp = 0; |
Line 1015 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 1038 int nd_nf(int mod,ND g,int full,ND *rp) |
|
} |
} |
sugar = SG(g); |
sugar = SG(g); |
n = NV(g); |
n = NV(g); |
|
if ( !mod ) |
|
hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
bucket = create_pbucket(); |
bucket = create_pbucket(); |
add_pbucket(mod,bucket,g,nd_length(g)); |
add_pbucket(mod,bucket,g,nd_length(g)); |
d = 0; |
d = 0; |
mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int)); |
mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int)); |
while ( 1 ) { |
while ( 1 ) { |
hindex = head_pbucket(mod,bucket); |
hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket); |
if ( hindex < 0 ) { |
if ( hindex < 0 ) { |
if ( d ) |
if ( d ) |
SG(d) = sugar; |
SG(d) = sugar; |
Line 1034 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 1059 int nd_nf(int mod,ND g,int full,ND *rp) |
|
ndl_sub(HDL(g),DL(h),DL(mul)); |
ndl_sub(HDL(g),DL(h),DL(mul)); |
TD(mul) = HTD(g)-TD(h); |
TD(mul) = HTD(g)-TD(h); |
if ( ndl_check_bound2(index,DL(mul)) ) { |
if ( ndl_check_bound2(index,DL(mul)) ) { |
free_pbucket(bucket); |
|
nd_free(d); |
nd_free(d); |
|
free_pbucket(bucket); |
*rp = 0; |
*rp = 0; |
return 0; |
return 0; |
} |
} |
Line 1047 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 1072 int nd_nf(int mod,ND g,int full,ND *rp) |
|
p = nd_psq[index]; |
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); |
|
mulq_pbucket(bucket,cred); |
|
g = bucket->body[hindex]; |
|
gmag = (double)p_mag((P)HCQ(g)); |
} |
} |
red = ndv_mul_nm(mod,p,mul); |
red = ndv_mul_nm(mod,p,mul); |
bucket->body[hindex] = nd_remove_head(g); |
bucket->body[hindex] = nd_remove_head(g); |
|
bucket->len[hindex]--; |
red = nd_remove_head(red); |
red = nd_remove_head(red); |
add_pbucket(mod,bucket,red,LEN(p)); |
add_pbucket(mod,bucket,red,LEN(p)-1); |
sugar = MAX(sugar,SG(p)+TD(mul)); |
sugar = MAX(sugar,SG(p)+TD(mul)); |
|
if ( !mod && hmag && (gmag > hmag) ) { |
|
g = normalize_pbucket(mod,bucket); |
|
if ( !g ) { |
|
if ( d ) |
|
SG(d) = sugar; |
|
*rp = d; |
|
return 1; |
|
} |
|
nd_removecont2(d,g); |
|
hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
|
add_pbucket(mod,bucket,g,nd_length(g)-1); |
|
} |
} else if ( !full ) { |
} else if ( !full ) { |
g = normalize_pbucket(mod,bucket); |
g = normalize_pbucket(mod,bucket); |
if ( g ) |
if ( g ) |
Line 1068 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 1109 int nd_nf(int mod,ND g,int full,ND *rp) |
|
FREEND(g); g = 0; |
FREEND(g); g = 0; |
} |
} |
bucket->body[hindex] = g; |
bucket->body[hindex] = g; |
|
bucket->len[hindex]--; |
NEXT(m) = 0; |
NEXT(m) = 0; |
if ( d ) { |
if ( d ) { |
for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) ); |
for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) ); |
Line 1078 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 1120 int nd_nf(int mod,ND g,int full,ND *rp) |
|
} |
} |
} |
} |
} |
} |
#endif |
|
|
|
int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full,ND *rp) |
int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full,ND *rp) |
{ |
{ |
Line 1086 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full |
|
Line 1127 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full |
|
NM m,mrd,tail; |
NM m,mrd,tail; |
NM mul; |
NM mul; |
int n,sugar,psugar,sugar0,stat,index; |
int n,sugar,psugar,sugar0,stat,index; |
int c,c1,c2; |
int c,c1,c2,dummy; |
RHist h; |
RHist h; |
NDV p,red; |
NDV p,red; |
Q cg,cred,gcd; |
Q cg,cred,gcd; |
Line 1125 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full |
|
Line 1166 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full |
|
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); |
} |
} |
g = nd_add(mod,g,ndv_mul_nm(mod,p,mul)); |
g = nd_add(mod,g,ndv_mul_nm(mod,p,mul),&dummy); |
sugar = MAX(sugar,SG(p)+TD(mul)); |
sugar = MAX(sugar,SG(p)+TD(mul)); |
if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) { |
if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) { |
nd_removecont2(d,g); |
nd_removecont2(d,g); |
Line 1156 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full |
|
Line 1197 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full |
|
return 1; |
return 1; |
} |
} |
|
|
|
int nd_nf_direct_pbucket(int mod,ND g,NDV *ps,int len,int full,ND *rp) |
|
{ |
|
int hindex,index; |
|
NDV p; |
|
ND u,d,red; |
|
NODE l; |
|
NM mul,m,mrd; |
|
int sugar,psugar,n,h_reducible; |
|
PGeoBucket bucket; |
|
int c,c1,c2; |
|
Q cg,cred,gcd,zzz; |
|
RHist h; |
|
double hmag,gmag; |
|
|
|
if ( !g ) { |
|
*rp = 0; |
|
return 1; |
|
} |
|
sugar = SG(g); |
|
n = NV(g); |
|
#if 0 |
|
if ( !mod ) |
|
hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
|
#else |
|
/* XXX */ |
|
hmag = 0; |
|
#endif |
|
bucket = create_pbucket(); |
|
add_pbucket(mod,bucket,g,nd_length(g)); |
|
d = 0; |
|
mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(unsigned int)); |
|
while ( 1 ) { |
|
hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket); |
|
if ( hindex < 0 ) { |
|
if ( d ) |
|
SG(d) = sugar; |
|
*rp = d; |
|
return 1; |
|
} |
|
g = bucket->body[hindex]; |
|
index = nd_find_reducer_direct(g,ps,len); |
|
if ( index >= 0 ) { |
|
p = ps[index]; |
|
ndl_sub(HDL(g),HDL(p),DL(mul)); |
|
TD(mul) = HTD(g)-HTD(p); |
|
if ( ndl_check_bound2_direct(HDL(p),DL(mul)) ) { |
|
nd_free(d); |
|
free_pbucket(bucket); |
|
*rp = 0; |
|
return 0; |
|
} |
|
if ( mod ) { |
|
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
|
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
|
} else { |
|
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
|
chsgnq(cg,&CQ(mul)); |
|
nd_mul_c_q(d,cred); |
|
mulq_pbucket(bucket,cred); |
|
g = bucket->body[hindex]; |
|
gmag = (double)p_mag((P)HCQ(g)); |
|
} |
|
red = ndv_mul_nm(mod,p,mul); |
|
bucket->body[hindex] = nd_remove_head(g); |
|
bucket->len[hindex]--; |
|
red = nd_remove_head(red); |
|
add_pbucket(mod,bucket,red,LEN(p)-1); |
|
sugar = MAX(sugar,SG(p)+TD(mul)); |
|
if ( !mod && hmag && (gmag > hmag) ) { |
|
g = normalize_pbucket(mod,bucket); |
|
if ( !g ) { |
|
if ( d ) |
|
SG(d) = sugar; |
|
*rp = d; |
|
return 1; |
|
} |
|
nd_removecont2(d,g); |
|
hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
|
add_pbucket(mod,bucket,g,nd_length(g)-1); |
|
} |
|
} else if ( !full ) { |
|
g = normalize_pbucket(mod,bucket); |
|
if ( g ) |
|
SG(g) = sugar; |
|
*rp = g; |
|
return 1; |
|
} else { |
|
m = BDY(g); |
|
if ( NEXT(m) ) { |
|
BDY(g) = NEXT(m); NEXT(m) = 0; |
|
} else { |
|
FREEND(g); g = 0; |
|
} |
|
bucket->body[hindex] = g; |
|
bucket->len[hindex]--; |
|
NEXT(m) = 0; |
|
if ( d ) { |
|
for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) ); |
|
NEXT(mrd) = m; |
|
} else { |
|
MKND(n,m,d); |
|
} |
|
} |
|
} |
|
} |
|
|
|
/* input : list of DP, cand : list of DP */ |
|
|
|
int nd_check_candidate(NODE input,NODE cand) |
|
{ |
|
int n,i,stat; |
|
ND nf,d; |
|
NODE t; |
|
|
|
nd_setup(0,cand); |
|
|
|
/* membercheck : list is a subset of Id(cand) ? */ |
|
for ( t = input; t; t = NEXT(t) ) { |
|
d = dptond(0,(DP)BDY(t)); |
|
stat = nd_nf_direct(0,d,nd_psq,n,0,&nf); |
|
if ( !stat ) |
|
nd_reconstruct_direct(0,nd_psq,n); |
|
else if ( nf ) |
|
return 0; |
|
} |
|
/* gbcheck : cand is a GB of Id(cand) ? */ |
|
if ( !nd_gb(0,1) ) |
|
return 0; |
|
/* XXX */ |
|
return 1; |
|
} |
|
|
ND nd_remove_head(ND p) |
ND nd_remove_head(ND p) |
{ |
{ |
NM m; |
NM m; |
Line 1182 PGeoBucket create_pbucket() |
|
Line 1355 PGeoBucket create_pbucket() |
|
void free_pbucket(PGeoBucket b) { |
void free_pbucket(PGeoBucket b) { |
int i; |
int i; |
|
|
for ( i = 0; i < b->m; i++ ) |
for ( i = 0; i <= b->m; i++ ) |
if ( b->body[i] ) { |
if ( b->body[i] ) { |
nd_free(b->body[i]); |
nd_free(b->body[i]); |
b->body[i] = 0; |
b->body[i] = 0; |
|
b->len[i] = 0; |
} |
} |
GC_free(b); |
GC_free(b); |
} |
} |
|
|
void add_pbucket(int mod,PGeoBucket g,ND d,int l) |
void add_pbucket(int mod,PGeoBucket g,ND d,int l) |
{ |
{ |
int k,m; |
int i,k,m,cancel; |
|
|
for ( k = 0, m = 1; l > m; k++, m <<= 2 ); |
for ( k = 0, m = 1; l > m; k++, m <<= 1 ); |
/* 4^(k-1) < l <= 4^k */ |
/* 2^(k-1) < l <= 2^k (=m) */ |
d = nd_add(mod,g->body[k],d); |
d = nd_add(mod,g->body[k],d,&cancel); |
for ( ; d && nd_length(d) > 1<<(2*k); k++ ) { |
l = g->len[k]+l-cancel; |
|
for ( ; d && l > m; k++, m <<= 1 ) { |
g->body[k] = 0; |
g->body[k] = 0; |
d = nd_add(mod,g->body[k+1],d); |
g->len[k] = 0; |
|
d = nd_add(mod,g->body[k+1],d,&cancel); |
|
l = g->len[k+1]+l-cancel; |
} |
} |
g->body[k] = d; |
g->body[k] = d; |
|
g->len[k] = l; |
g->m = MAX(g->m,k); |
g->m = MAX(g->m,k); |
} |
} |
|
|
|
void mulq_pbucket(PGeoBucket g,Q c) |
|
{ |
|
int k; |
|
|
|
for ( k = 0; k <= g->m; k++ ) |
|
nd_mul_c_q(g->body[k],c); |
|
} |
|
|
/* XXX not completed */ |
/* XXX not completed */ |
int head_pbucket(int mod,PGeoBucket g) |
int head_pbucket(int mod,PGeoBucket g) |
{ |
{ |
Line 1235 int head_pbucket(int mod,PGeoBucket g) |
|
Line 1421 int head_pbucket(int mod,PGeoBucket g) |
|
if ( c > 0 ) { |
if ( c > 0 ) { |
if ( sum ) |
if ( sum ) |
HCM(gj) = sum; |
HCM(gj) = sum; |
else |
else { |
g->body[j] = nd_remove_head(gj); |
g->body[j] = nd_remove_head(gj); |
|
g->len[j]--; |
|
} |
j = i; |
j = i; |
gj = g->body[j]; |
gj = g->body[j]; |
dj = HDL(gj); |
dj = HDL(gj); |
Line 1246 int head_pbucket(int mod,PGeoBucket g) |
|
Line 1434 int head_pbucket(int mod,PGeoBucket g) |
|
if ( sum < 0 ) |
if ( sum < 0 ) |
sum += mod; |
sum += mod; |
g->body[i] = nd_remove_head(gi); |
g->body[i] = nd_remove_head(gi); |
|
g->len[i]--; |
} |
} |
} |
} |
} |
} |
Line 1254 int head_pbucket(int mod,PGeoBucket g) |
|
Line 1443 int head_pbucket(int mod,PGeoBucket g) |
|
else if ( sum ) { |
else if ( sum ) { |
HCM(gj) = sum; |
HCM(gj) = sum; |
return j; |
return j; |
} else |
} else { |
g->body[j] = nd_remove_head(gj); |
g->body[j] = nd_remove_head(gj); |
|
g->len[j]--; |
|
} |
} |
} |
} |
} |
|
|
|
int head_pbucket_q(PGeoBucket g) |
|
{ |
|
int j,i,c,k,nv; |
|
Q sum,t; |
|
unsigned int *di,*dj; |
|
ND gi,gj; |
|
|
|
k = g->m; |
|
while ( 1 ) { |
|
j = -1; |
|
for ( i = 0; i <= k; i++ ) { |
|
if ( !(gi = g->body[i]) ) |
|
continue; |
|
if ( j < 0 ) { |
|
j = i; |
|
gj = g->body[j]; |
|
dj = HDL(gj); |
|
sum = HCQ(gj); |
|
} else { |
|
di = HDL(gi); |
|
nv = NV(gi); |
|
if ( HTD(gi) > HTD(gj) ) |
|
c = 1; |
|
else if ( HTD(gi) < HTD(gj) ) |
|
c = -1; |
|
else |
|
c = ndl_compare(di,dj); |
|
if ( c > 0 ) { |
|
if ( sum ) |
|
HCQ(gj) = sum; |
|
else { |
|
g->body[j] = nd_remove_head(gj); |
|
g->len[j]--; |
|
} |
|
j = i; |
|
gj = g->body[j]; |
|
dj = HDL(gj); |
|
sum = HCQ(gj); |
|
} else if ( c == 0 ) { |
|
addq(sum,HCQ(gi),&t); |
|
sum = t; |
|
g->body[i] = nd_remove_head(gi); |
|
g->len[i]--; |
|
} |
|
} |
|
} |
|
if ( j < 0 ) |
|
return -1; |
|
else if ( sum ) { |
|
HCQ(gj) = sum; |
|
return j; |
|
} else { |
|
g->body[j] = nd_remove_head(gj); |
|
g->len[j]--; |
|
} |
|
} |
|
} |
|
|
ND normalize_pbucket(int mod,PGeoBucket g) |
ND normalize_pbucket(int mod,PGeoBucket g) |
{ |
{ |
int i; |
int i,dummy; |
ND r,t; |
ND r,t; |
|
|
r = 0; |
r = 0; |
for ( i = 0; i <= g->m; i++ ) |
for ( i = 0; i <= g->m; i++ ) { |
r = nd_add(mod,r,g->body[i]); |
r = nd_add(mod,r,g->body[i],&dummy); |
|
g->body[i] = 0; |
|
g->len[i] = 0; |
|
} |
|
g->m = -1; |
return r; |
return r; |
} |
} |
|
|
NODE nd_gb(int m) |
/* return value = 0 => input is not a GB */ |
|
|
|
NODE nd_gb(int m,int checkonly) |
{ |
{ |
int i,nh,sugar,stat; |
int i,nh,sugar,stat; |
NODE r,g,t; |
NODE r,g,t; |
|
|
d = nd_reconstruct(m,0,d); |
d = nd_reconstruct(m,0,d); |
goto again; |
goto again; |
} |
} |
stat = nd_nf(m,h,!Top,&nf); |
stat = m?nd_nf_pbucket(m,h,!Top,&nf):nd_nf(m,h,!Top,&nf); |
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; |
} else if ( nf ) { |
} else if ( nf ) { |
|
if ( checkonly ) return 0; |
printf("+"); fflush(stdout); |
printf("+"); fflush(stdout); |
nh = nd_newps(m,nf); |
nh = nd_newps(m,nf); |
d = update_pairs(d,g,nh); |
d = update_pairs(d,g,nh); |
|
|
d = nd_reconstruct(m,1,d); |
d = nd_reconstruct(m,1,d); |
goto again; |
goto again; |
} |
} |
stat = nd_nf(m,h,!Top,&nf); |
stat = nd_nf_pbucket(m,h,!Top,&nf); |
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); |
|
|
if ( nfq ) { |
if ( nfq ) { |
printf("+"); fflush(stdout); |
printf("+"); fflush(stdout); |
nh = nd_newps_trace(m,nf,nfq); |
nh = nd_newps_trace(m,nf,nfq); |
|
/* failure; m|HC(nfq) */ |
|
if ( nf < 0 ) return 0; |
d = update_pairs(d,g,nh); |
d = update_pairs(d,g,nh); |
g = update_base(g,nh); |
g = update_base(g,nh); |
} else { |
} else { |
Line 1761 int nd_newps_trace(int mod,ND nf,ND nfq) |
|
Line 2019 int nd_newps_trace(int mod,ND nf,ND nfq) |
|
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 ( !rem(NM(HCQ(nfq)),mod) ) return -1; |
nd_removecont(mod,nf); |
nd_removecont(mod,nf); |
nd_ps[nd_psn] = ndtondv(mod,nf); |
nd_ps[nd_psn] = ndtondv(mod,nf); |
|
|
Line 1912 void nd_gr(LIST f,LIST v,int m,struct order_spec *ord, |
|
Line 2171 void nd_gr(LIST f,LIST v,int m,struct order_spec *ord, |
|
} |
} |
if ( fd0 ) NEXT(fd) = 0; |
if ( fd0 ) NEXT(fd) = 0; |
nd_setup(m,fd0); |
nd_setup(m,fd0); |
x = nd_gb(m); |
x = nd_gb(m,0); |
fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n", |
fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n", |
nd_found,nd_notfirst,nd_create); |
nd_found,nd_notfirst,nd_create); |
x = nd_reduceall(m,x); |
x = nd_reduceall(m,x); |
Line 1934 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o |
|
Line 2193 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o |
|
{ |
{ |
struct order_spec ord1; |
struct order_spec ord1; |
VL fv,vv,vc; |
VL fv,vv,vc; |
NODE fd,fd0,r,r0,t,x,s,xx,t0; |
NODE fd,fd0,in0,in,r,r0,t,s,cand; |
DP a,b,c,h; |
DP a,b,c,h; |
NDV *w; |
P p; |
int len,i,j; |
|
|
|
get_vars((Obj)f,&fv); pltovl(v,&vv); |
get_vars((Obj)f,&fv); pltovl(v,&vv); |
nd_nvar = length(vv); |
nd_nvar = length(vv); |
Line 1951 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o |
|
Line 2209 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o |
|
case 1: is_rlex = 0; break; |
case 1: is_rlex = 0; break; |
default: error("nd_gr : unsupported order"); |
default: error("nd_gr : unsupported order"); |
} |
} |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
for ( fd0 = 0, in0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
ptod(CO,vv,(P)BDY(t),&c); |
ptod(CO,vv,(P)BDY(t),&c); |
if ( c ) { |
if ( c ) { |
dp_homo(c,&h); NEXTNODE(fd0,fd); BDY(fd) = (pointer)h; |
dp_homo(c,&h); NEXTNODE(fd0,fd); BDY(fd) = (pointer)h; |
|
NEXTNODE(in0,in); BDY(in) = (pointer)c; |
} |
} |
} |
} |
if ( fd0 ) NEXT(fd) = 0; |
if ( fd0 ) NEXT(fd) = 0; |
|
if ( in0 ) NEXT(in) = 0; |
initd(&ord1); |
initd(&ord1); |
nd_nvar++; |
nd_nvar++; |
nd_setup_trace(m,fd0); |
|
x = nd_gb_trace(m); |
|
|
|
/* dehomogenization */ |
|
for ( t = x; t; t = NEXT(t) ) |
|
ndv_dehomogenize((NDV)BDY(t)); |
|
nd_nvar--; |
|
nd_setup_parameters(); |
|
initd(ord); |
|
len = length(x); |
|
w = (NDV *)ALLOCA(len*sizeof(NDV)); |
|
for ( i = 0, t = x; i < len; i++, t = NEXT(t) ) w[i] = BDY(t); |
|
for ( i = 0; i < len; i++ ) { |
|
for ( j = 0; j < i; j++ ) { |
|
if ( w[i] && w[j] ) |
|
if ( ndl_reducible(HDL(w[i]),HDL(w[j])) ) w[i] = 0; |
|
else if ( ndl_reducible(HDL(w[j]),HDL(w[i])) ) w[j] = 0; |
|
} |
|
} |
|
for ( i = len-1, t0 = 0; i >= 0; i-- ) { |
|
if ( w[i] ) { NEXTNODE(t0,t); BDY(t) = (pointer)w[i]; } |
|
} |
|
NEXT(t) = 0; x = t0; |
|
} else { |
} else { |
switch ( ord->ord.simple ) { |
switch ( ord->ord.simple ) { |
case 0: is_rlex = 1; break; |
case 0: is_rlex = 1; break; |
Line 1996 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o |
|
Line 2233 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o |
|
} |
} |
} |
} |
if ( fd0 ) NEXT(fd) = 0; |
if ( fd0 ) NEXT(fd) = 0; |
/* setup over GF(m) */ |
in0 = fd0; |
|
} |
|
do { |
nd_setup_trace(m,fd0); |
nd_setup_trace(m,fd0); |
x = nd_gb_trace(m); |
cand = nd_gb_trace(m); |
|
if ( !cand ) continue; |
|
if ( homo ) { |
|
/* dehomogenization */ |
|
for ( t = cand; t; t = NEXT(t) ) |
|
ndv_dehomogenize((NDV)BDY(t)); |
|
nd_nvar--; |
|
nd_setup_parameters(); |
|
initd(ord); |
|
cand = nd_reducebase(cand); |
|
} |
|
fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n", |
|
nd_found,nd_notfirst,nd_create); |
|
cand = nd_reduceall(0,cand); |
|
initd(ord); |
|
for ( r0 = 0; cand; cand = NEXT(cand) ) { |
|
NEXTNODE(r0,r); |
|
BDY(r) = (pointer)ndvtodp(0,(NDV)BDY(cand)); |
|
} |
|
if ( r0 ) NEXT(r) = 0; |
|
cand = r0; |
|
} while ( !nd_check_candidate(in0,cand) ); |
|
/* dp->p */ |
|
for ( r = cand; r; r = NEXT(r) ) { |
|
dtop(CO,vv,BDY(r),&p); |
|
BDY(r) = (pointer)p; |
} |
} |
fprintf(asir_out,"found=%d,notfirst=%d,create=%d\n", |
MKLIST(*rp,cand); |
nd_found,nd_notfirst,nd_create); |
|
x = nd_reduceall(0,x); |
|
for ( r0 = 0; x; x = NEXT(x) ) { |
|
NEXTNODE(r0,r); |
|
a = ndvtodp(0,(NDV)BDY(x)); |
|
dtop(CO,vv,a,(P *)&BDY(r)); |
|
} |
|
if ( r0 ) NEXT(r) = 0; |
|
MKLIST(*rp,r0); |
|
} |
} |
|
|
void dltondl(int n,DL dl,unsigned int *r) |
void dltondl(int n,DL dl,unsigned int *r) |
Line 2599 int nd_sp(int mod,ND_pairs p,ND *rp) |
|
Line 2854 int nd_sp(int mod,ND_pairs p,ND *rp) |
|
NDV p1,p2; |
NDV p1,p2; |
ND t1,t2; |
ND t1,t2; |
unsigned int *lcm; |
unsigned int *lcm; |
int td; |
int td,dummy; |
|
|
if ( mod ) { |
if ( mod ) { |
p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2]; |
p1 = nd_ps[p->i1]; p2 = nd_ps[p->i2]; |
Line 2624 int nd_sp(int mod,ND_pairs p,ND *rp) |
|
Line 2879 int nd_sp(int mod,ND_pairs p,ND *rp) |
|
return 0; |
return 0; |
} |
} |
t2 = ndv_mul_nm(mod,p2,m); |
t2 = ndv_mul_nm(mod,p2,m); |
*rp = nd_add(mod,t1,t2); |
*rp = nd_add(mod,t1,t2,&dummy); |
FREENM(m); |
FREENM(m); |
return 1; |
return 1; |
} |
} |
Line 2879 int nd_equal(ND a,ND b) |
|
Line 3134 int nd_equal(ND a,ND b) |
|
} |
} |
if ( !ma && !mb ) return 1; |
if ( !ma && !mb ) return 1; |
else return 0; |
else return 0; |
|
} |
|
|
|
NODE nd_reducebase(NODE x) |
|
{ |
|
int len,i,j; |
|
NDV *w; |
|
NODE t,t0; |
|
|
|
len = length(x); |
|
w = (NDV *)ALLOCA(len*sizeof(NDV)); |
|
for ( i = 0, t = x; i < len; i++, t = NEXT(t) ) w[i] = BDY(t); |
|
for ( i = 0; i < len; i++ ) { |
|
for ( j = 0; j < i; j++ ) { |
|
if ( w[i] && w[j] ) |
|
if ( ndl_reducible(HDL(w[i]),HDL(w[j])) ) w[i] = 0; |
|
else if ( ndl_reducible(HDL(w[j]),HDL(w[i])) ) w[j] = 0; |
|
} |
|
} |
|
for ( i = len-1, t0 = 0; i >= 0; i-- ) { |
|
if ( w[i] ) { NEXTNODE(t0,t); BDY(t) = (pointer)w[i]; } |
|
} |
|
NEXT(t) = 0; x = t0; |
|
return x; |
} |
} |