version 1.27, 2003/08/10 01:31:24 |
version 1.32, 2003/08/19 04:38:09 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.26 2003/08/07 09:47:08 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.31 2003/08/13 03:13:22 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 { |
Line 21 typedef struct oPGeoBucket { |
|
Line 23 typedef struct oPGeoBucket { |
|
typedef struct oND { |
typedef struct oND { |
struct oNM *body; |
struct oNM *body; |
int nv; |
int nv; |
|
int len; |
int sugar; |
int sugar; |
} *ND; |
} *ND; |
|
|
typedef struct oNDV { |
typedef struct oNDV { |
struct oNMV *body; |
struct oNMV *body; |
int nv; |
int nv; |
int sugar; |
|
int len; |
int len; |
|
int sugar; |
} *NDV; |
} *NDV; |
|
|
typedef struct oNM { |
typedef struct oNM { |
Line 64 typedef struct oND_pairs { |
|
Line 67 typedef struct oND_pairs { |
|
unsigned int lcm[1]; |
unsigned int lcm[1]; |
} *ND_pairs; |
} *ND_pairs; |
|
|
|
int (*nm_compare_generic)(NM a,NM b); |
|
int (*nmv_compare_generic)(NMV a,NMV b); |
|
|
double nd_scale=2; |
double nd_scale=2; |
static unsigned int **nd_bound; |
static unsigned int **nd_bound; |
int nd_nvar; |
int nd_nvar; |
int is_rlex; |
int nd_isrlex; |
int nd_epw,nd_bpe,nd_wpd; |
int nd_epw,nd_bpe,nd_wpd; |
unsigned int nd_mask[32]; |
unsigned int nd_mask[32]; |
unsigned int nd_mask0,nd_mask1; |
unsigned int nd_mask0,nd_mask1; |
|
|
int nd_found,nd_create,nd_notfirst; |
int nd_found,nd_create,nd_notfirst; |
int nm_adv; |
int nm_adv; |
int nmv_adv; |
int nmv_adv; |
|
int nd_degcompat; |
|
|
extern int Top,Reverse; |
extern int Top,Reverse; |
|
|
Line 102 extern int Top,Reverse; |
|
Line 109 extern int Top,Reverse; |
|
#define SG(a) ((a)->sugar) |
#define SG(a) ((a)->sugar) |
#define LEN(a) ((a)->len) |
#define LEN(a) ((a)->len) |
|
|
|
#define NM_COMPARE(m1,m2)\ |
|
nd_degcompat?(TD(m1)>TD(m2)?1\ |
|
:(TD(m1)<TD(m2)?-1:ndl_compare(DL(m1),DL(m2))))\ |
|
:(*nm_compare_generic)(m1,m2) |
#define NM_ADV(m) (m = (NM)(((char *)m)+nm_adv)) |
#define NM_ADV(m) (m = (NM)(((char *)m)+nm_adv)) |
#define NEWRHist(r) \ |
#define NEWRHist(r) \ |
((r)=(RHist)MALLOC(sizeof(struct oRHist)+(nd_wpd-1)*sizeof(unsigned int))) |
((r)=(RHist)MALLOC(sizeof(struct oRHist)+(nd_wpd-1)*sizeof(unsigned int))) |
#define NEWND_pairs(m) if(!_ndp_free_list)_NDP_alloc(); (m)=_ndp_free_list; _ndp_free_list = NEXT(_ndp_free_list) |
#define NEWND_pairs(m) if(!_ndp_free_list)_NDP_alloc(); (m)=_ndp_free_list; _ndp_free_list = NEXT(_ndp_free_list) |
#define NEWNM(m) if(!_nm_free_list)_NM_alloc(); (m)=_nm_free_list; _nm_free_list = NEXT(_nm_free_list) |
#define NEWNM(m) if(!_nm_free_list)_NM_alloc(); (m)=_nm_free_list; _nm_free_list = NEXT(_nm_free_list) |
#define MKND(n,m,d) if(!_nd_free_list)_ND_alloc(); (d)=_nd_free_list; _nd_free_list = (ND)BDY(_nd_free_list); (d)->nv=(n); BDY(d)=(m) |
#define MKND(n,m,len,d) if(!_nd_free_list)_ND_alloc(); (d)=_nd_free_list; _nd_free_list = (ND)BDY(_nd_free_list); NV(d)=(n); LEN(d)=(len); BDY(d)=(m) |
|
|
#define NEXTRHist(r,c) \ |
#define NEXTRHist(r,c) \ |
if(!(r)){NEWRHist(r);(c)=(r);}else{NEWRHist(NEXT(c));(c)=NEXT(c);} |
if(!(r)){NEWRHist(r);(c)=(r);}else{NEWRHist(NEXT(c));(c)=NEXT(c);} |
Line 122 if(!(r)){(c)=(r)=(s);}else{NEXT(c)=(s);(c)=(s);} |
|
Line 133 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);} |
|
|
|
void nd_init_ord(struct order_spec *spec); |
int nd_check_candidate(NODE input,NODE cand); |
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); |
Line 132 void nd_mul_c_q(ND p,Q mul); |
|
Line 144 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); |
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); |
void free_pbucket(PGeoBucket b); |
void free_pbucket(PGeoBucket b); |
void mulq_pbucket(PGeoBucket g,Q c); |
void mulq_pbucket(PGeoBucket g,Q c); |
PGeoBucket create_pbucket(); |
PGeoBucket create_pbucket(); |
Line 173 int nd_sp(int mod,ND_pairs p,ND *nf); |
|
Line 185 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); |
Line 255 void _NDP_alloc() |
|
Line 270 void _NDP_alloc() |
|
} |
} |
} |
} |
|
|
INLINE nd_length(ND p) |
INLINE int nd_length(ND p) |
{ |
{ |
NM m; |
NM m; |
int i; |
int i; |
Line 338 int ndl_dehomogenize(unsigned int *d) |
|
Line 353 int ndl_dehomogenize(unsigned int *d) |
|
{ |
{ |
unsigned int mask; |
unsigned int mask; |
unsigned int h; |
unsigned int h; |
int i; |
int i,bits; |
|
|
if ( is_rlex ) { |
if ( nd_isrlex ) { |
if ( nd_bpe == 32 ) { |
if ( nd_bpe == 32 ) { |
h = d[0]; |
h = d[0]; |
for ( i = 1; i < nd_wpd; i++ ) |
for ( i = 1; i < nd_wpd; i++ ) |
Line 348 int ndl_dehomogenize(unsigned int *d) |
|
Line 363 int ndl_dehomogenize(unsigned int *d) |
|
d[i-1] = 0; |
d[i-1] = 0; |
return h; |
return h; |
} else { |
} else { |
mask = (1<<(nd_epw*nd_bpe))-1; |
bits = nd_epw*nd_bpe; |
|
mask = bits==32?0xffffffff:((1<<(nd_epw*nd_bpe))-1); |
h = (d[0]>>((nd_epw-1)*nd_bpe))&nd_mask0; |
h = (d[0]>>((nd_epw-1)*nd_bpe))&nd_mask0; |
for ( i = 0; i < nd_wpd; i++ ) |
for ( i = 0; i < nd_wpd; i++ ) |
d[i] = ((d[i]<<nd_bpe)&mask) |
d[i] = ((d[i]<<nd_bpe)&mask) |
Line 447 INLINE int ndl_compare(unsigned int *d1,unsigned int * |
|
Line 463 INLINE int ndl_compare(unsigned int *d1,unsigned int * |
|
|
|
for ( i = 0; i < nd_wpd; i++, d1++, d2++ ) |
for ( i = 0; i < nd_wpd; i++, d1++, d2++ ) |
if ( *d1 > *d2 ) |
if ( *d1 > *d2 ) |
return is_rlex ? -1 : 1; |
return nd_isrlex ? -1 : 1; |
else if ( *d1 < *d2 ) |
else if ( *d1 < *d2 ) |
return is_rlex ? 1 : -1; |
return nd_isrlex ? 1 : -1; |
return 0; |
return 0; |
} |
} |
|
|
Line 755 INLINE int nd_find_reducer(ND g) |
|
Line 771 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 779 INLINE int nd_find_reducer(ND g) |
|
Line 794 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 i; |
|
NDV r; |
NDV r; |
|
RHist s; |
|
int d,k,i; |
|
|
if ( Reverse ) |
if ( Reverse ) |
for ( i = len-1; i >= 0; i-- ) { |
for ( i = len-1; i >= 0; i-- ) { |
Line 804 INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len |
|
Line 820 INLINE int nd_find_reducer_direct(ND g,NDV *ps,int len |
|
ND nd_add(int mod,ND p1,ND p2) |
ND nd_add(int mod,ND p1,ND p2) |
{ |
{ |
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; |
|
|
Line 815 ND nd_add(int mod,ND p1,ND p2) |
|
Line 831 ND nd_add(int mod,ND p1,ND p2) |
|
else if ( !mod ) |
else if ( !mod ) |
return nd_add_q(p1,p2); |
return nd_add_q(p1,p2); |
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) ) |
c = NM_COMPARE(m1,m2); |
c = 1; |
|
else if ( TD(m1) < TD(m2) ) |
|
c = -1; |
|
else |
|
c = ndl_compare(DL(m1),DL(m2)); |
|
switch ( c ) { |
switch ( c ) { |
case 0: |
case 0: |
t = ((CM(m1))+(CM(m2))) - mod; |
t = ((CM(m1))+(CM(m2))) - mod; |
Line 829 ND nd_add(int mod,ND p1,ND p2) |
|
Line 841 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 858 ND nd_add(int mod,ND p1,ND p2) |
|
Line 872 ND nd_add(int mod,ND p1,ND p2) |
|
NEXT(mr) = 0; |
NEXT(mr) = 0; |
BDY(p1) = mr0; |
BDY(p1) = mr0; |
SG(p1) = MAX(SG(p1),SG(p2)); |
SG(p1) = MAX(SG(p1),SG(p2)); |
|
LEN(p1) = LEN(p1)+LEN(p2)-can; |
FREEND(p2); |
FREEND(p2); |
return p1; |
return p1; |
} |
} |
Line 865 ND nd_add(int mod,ND p1,ND p2) |
|
Line 880 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 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; |
Line 875 ND nd_add_q(ND p1,ND p2) |
|
Line 890 ND nd_add_q(ND p1,ND p2) |
|
else if ( !p2 ) |
else if ( !p2 ) |
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) ) |
c = NM_COMPARE(m1,m2); |
c = 1; |
|
else if ( TD(m1) < TD(m2) ) |
|
c = -1; |
|
else |
|
c = ndl_compare(DL(m1),DL(m2)); |
|
switch ( c ) { |
switch ( c ) { |
case 0: |
case 0: |
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 916 ND nd_add_q(ND p1,ND p2) |
|
Line 929 ND nd_add_q(ND p1,ND p2) |
|
NEXT(mr) = 0; |
NEXT(mr) = 0; |
BDY(p1) = mr0; |
BDY(p1) = mr0; |
SG(p1) = MAX(SG(p1),SG(p2)); |
SG(p1) = MAX(SG(p1),SG(p2)); |
|
LEN(p1) = LEN(p1)+LEN(p2)-can; |
FREEND(p2); |
FREEND(p2); |
return p1; |
return p1; |
} |
} |
} |
} |
|
|
#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 929 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 942 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; |
|
|
m = BDY(g); |
m = BDY(g); |
if ( NEXT(m) ) { |
if ( NEXT(m) ) { |
BDY(g) = NEXT(m); NEXT(m) = 0; |
BDY(g) = NEXT(m); NEXT(m) = 0; |
|
LEN(g)--; |
} else { |
} else { |
FREEND(g); g = 0; |
FREEND(g); g = 0; |
} |
} |
if ( d ) { |
if ( d ) { |
NEXT(tail)=m; |
NEXT(tail)=m; |
tail=m; |
tail=m; |
|
LEN(d)++; |
} else { |
} else { |
MKND(n,m,d); |
MKND(n,m,1,d); |
tail = BDY(d); |
tail = BDY(d); |
} |
} |
} |
} |
|
|
*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; |
ND u,d,red; |
ND u,d,red; |
NODE l; |
NODE l; |
NM mul,m,mrd; |
NM mul,m,mrd,tail; |
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,zzz; |
Q cg,cred,gcd,zzz; |
RHist h; |
RHist h; |
|
double hmag,gmag; |
|
|
if ( !g ) { |
if ( !g ) { |
*rp = 0; |
*rp = 0; |
Line 1021 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 1037 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); |
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 ) { |
Line 1056 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 1074 int nd_nf(int mod,ND g,int full,ND *rp) |
|
nd_mul_c_q(d,cred); |
nd_mul_c_q(d,cred); |
mulq_pbucket(bucket,cred); |
mulq_pbucket(bucket,cred); |
g = bucket->body[hindex]; |
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); |
red = nd_remove_head(red); |
red = nd_remove_head(red); |
add_pbucket(mod,bucket,red,LEN(p)-1); |
add_pbucket(mod,bucket,red); |
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); |
|
} |
} else if ( !full ) { |
} else if ( !full ) { |
g = normalize_pbucket(mod,bucket); |
g = normalize_pbucket(mod,bucket); |
if ( g ) |
if ( g ) |
Line 1072 int nd_nf(int mod,ND g,int full,ND *rp) |
|
Line 1103 int nd_nf(int mod,ND g,int full,ND *rp) |
|
m = BDY(g); |
m = BDY(g); |
if ( NEXT(m) ) { |
if ( NEXT(m) ) { |
BDY(g) = NEXT(m); NEXT(m) = 0; |
BDY(g) = NEXT(m); NEXT(m) = 0; |
|
LEN(g)--; |
} else { |
} else { |
FREEND(g); g = 0; |
FREEND(g); g = 0; |
} |
} |
bucket->body[hindex] = g; |
bucket->body[hindex] = g; |
NEXT(m) = 0; |
NEXT(m) = 0; |
if ( d ) { |
if ( d ) { |
for ( mrd = BDY(d); NEXT(mrd); mrd = NEXT(mrd) ); |
NEXT(tail)=m; |
NEXT(mrd) = m; |
tail=m; |
|
LEN(d)++; |
} else { |
} else { |
MKND(n,m,d); |
MKND(n,m,1,d); |
|
tail = BDY(d); |
} |
} |
} |
} |
} |
} |
} |
} |
#endif |
|
|
|
/* 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; |
|
} |
|
|
|
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) |
{ |
{ |
ND d; |
ND d; |
Line 1172 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full |
|
Line 1179 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full |
|
m = BDY(g); |
m = BDY(g); |
if ( NEXT(m) ) { |
if ( NEXT(m) ) { |
BDY(g) = NEXT(m); NEXT(m) = 0; |
BDY(g) = NEXT(m); NEXT(m) = 0; |
|
LEN(g)--; |
} else { |
} else { |
FREEND(g); g = 0; |
FREEND(g); g = 0; |
} |
} |
if ( d ) { |
if ( d ) { |
NEXT(tail)=m; |
NEXT(tail)=m; |
tail=m; |
tail=m; |
|
LEN(d)++; |
} else { |
} else { |
MKND(n,m,d); |
MKND(n,m,1,d); |
tail = BDY(d); |
tail = BDY(d); |
} |
} |
} |
} |
Line 1190 int nd_nf_direct(int mod,ND g,NDV *ps,int len,int full |
|
Line 1199 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,tail; |
|
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); |
|
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); |
|
red = nd_remove_head(red); |
|
add_pbucket(mod,bucket,red); |
|
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); |
|
} |
|
} 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; |
|
LEN(g)--; |
|
} else { |
|
FREEND(g); g = 0; |
|
} |
|
bucket->body[hindex] = g; |
|
NEXT(m) = 0; |
|
if ( d ) { |
|
NEXT(tail)=m; |
|
tail=m; |
|
LEN(d)++; |
|
} else { |
|
MKND(n,m,1,d); |
|
tail = BDY(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); |
|
n = length(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 1198 ND nd_remove_head(ND p) |
|
Line 1341 ND nd_remove_head(ND p) |
|
if ( !NEXT(m) ) { |
if ( !NEXT(m) ) { |
FREEND(p); |
FREEND(p); |
p = 0; |
p = 0; |
} else |
} else { |
BDY(p) = NEXT(m); |
BDY(p) = NEXT(m); |
|
LEN(p)--; |
|
} |
FREENM(m); |
FREENM(m); |
return p; |
return p; |
} |
} |
Line 1224 void free_pbucket(PGeoBucket b) { |
|
Line 1369 void free_pbucket(PGeoBucket b) { |
|
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 k,m; |
int l,i,k,m; |
|
|
for ( k = 0, m = 1; l > m; k++, m <<= 2 ); |
if ( !d ) |
/* 4^(k-1) < l <= 4^k */ |
return; |
|
l = LEN(d); |
|
for ( k = 0, m = 1; l > m; k++, m <<= 1 ); |
|
/* 2^(k-1) < l <= 2^k (=m) */ |
d = nd_add(mod,g->body[k],d); |
d = nd_add(mod,g->body[k],d); |
for ( ; d && nd_length(d) > 1<<(2*k); k++ ) { |
for ( ; d && LEN(d) > m; k++, m <<= 1 ) { |
g->body[k] = 0; |
g->body[k] = 0; |
d = nd_add(mod,g->body[k+1],d); |
d = nd_add(mod,g->body[k+1],d); |
} |
} |
Line 1268 int head_pbucket(int mod,PGeoBucket g) |
|
Line 1416 int head_pbucket(int mod,PGeoBucket g) |
|
} else { |
} else { |
di = HDL(gi); |
di = HDL(gi); |
nv = NV(gi); |
nv = NV(gi); |
if ( HTD(gi) > HTD(gj) ) |
c = NM_COMPARE(BDY(gi),BDY(gj)); |
c = 1; |
|
else if ( HTD(gi) < HTD(gj) ) |
|
c = -1; |
|
else |
|
c = ndl_compare(di,dj); |
|
if ( c > 0 ) { |
if ( c > 0 ) { |
if ( sum ) |
if ( sum ) |
HCM(gj) = sum; |
HCM(gj) = sum; |
Line 1322 int head_pbucket_q(PGeoBucket g) |
|
Line 1465 int head_pbucket_q(PGeoBucket g) |
|
} else { |
} else { |
di = HDL(gi); |
di = HDL(gi); |
nv = NV(gi); |
nv = NV(gi); |
if ( HTD(gi) > HTD(gj) ) |
c = NM_COMPARE(BDY(gi),BDY(gj)); |
c = 1; |
|
else if ( HTD(gi) < HTD(gj) ) |
|
c = -1; |
|
else |
|
c = ndl_compare(di,dj); |
|
if ( c > 0 ) { |
if ( c > 0 ) { |
if ( sum ) |
if ( sum ) |
HCQ(gj) = sum; |
HCQ(gj) = sum; |
Line 1360 ND normalize_pbucket(int mod,PGeoBucket g) |
|
Line 1498 ND normalize_pbucket(int mod,PGeoBucket g) |
|
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]); |
|
g->body[i] = 0; |
|
} |
|
g->m = -1; |
return r; |
return r; |
} |
} |
|
|
|
|
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); |
|
|
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); |
Line 1480 int ndv_compare(NDV *p1,NDV *p2) |
|
Line 1621 int ndv_compare(NDV *p1,NDV *p2) |
|
{ |
{ |
int td1,td2; |
int td1,td2; |
|
|
td1 = HTD(*p1); td2 = HTD(*p2); |
if ( nd_degcompat ) { |
if ( td1 > td2 ) return 1; |
td1 = HTD(*p1); td2 = HTD(*p2); |
else if ( td1 < td2 ) return -1; |
if ( td1 > td2 ) return 1; |
else return ndl_compare(HDL(*p1),HDL(*p2)); |
else if ( td1 < td2 ) return -1; |
|
else return ndl_compare(HDL(*p1),HDL(*p2)); |
|
} else |
|
return (*nmv_compare_generic)(BDY(*p1),BDY(*p2)); |
} |
} |
|
|
int ndv_compare_rev(NDV *p1,NDV *p2) |
int ndv_compare_rev(NDV *p1,NDV *p2) |
Line 1789 ND_pairs nd_minp( ND_pairs d, ND_pairs *prest ) |
|
Line 1933 ND_pairs nd_minp( ND_pairs d, ND_pairs *prest ) |
|
c = ndl_compare(p->lcm,lcm); |
c = ndl_compare(p->lcm,lcm); |
if ( c < 0 ) |
if ( c < 0 ) |
goto find; |
goto find; |
#if 0 |
|
else if ( c == 0 ) { |
|
tlen = nd_psl[p->i1]+nd_psl[p->i2]; |
|
if ( tlen < len ) |
|
goto find; |
|
} |
|
#endif |
|
} |
} |
} |
} |
continue; |
continue; |
Line 1994 void nd_gr(LIST f,LIST v,int m,struct order_spec *ord, |
|
Line 2131 void nd_gr(LIST f,LIST v,int m,struct order_spec *ord, |
|
|
|
get_vars((Obj)f,&fv); pltovl(v,&vv); |
get_vars((Obj)f,&fv); pltovl(v,&vv); |
nd_nvar = length(vv); |
nd_nvar = length(vv); |
if ( ord->id ) |
nd_init_ord(ord); |
error("nd_gr : unsupported order"); |
/* XXX for DP */ |
switch ( ord->ord.simple ) { |
|
case 0: |
|
is_rlex = 1; |
|
break; |
|
case 1: |
|
is_rlex = 0; |
|
break; |
|
default: |
|
error("nd_gr : unsupported order"); |
|
} |
|
initd(ord); |
initd(ord); |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
ptod(CO,vv,(P)BDY(t),&b); |
ptod(CO,vv,(P)BDY(t),&b); |
Line 2041 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o |
|
Line 2168 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o |
|
|
|
get_vars((Obj)f,&fv); pltovl(v,&vv); |
get_vars((Obj)f,&fv); pltovl(v,&vv); |
nd_nvar = length(vv); |
nd_nvar = length(vv); |
if ( ord->id ) |
|
error("nd_gr : unsupported order"); |
|
initd(ord); |
initd(ord); |
if ( homo ) { |
if ( homo ) { |
homogenize_order(ord,nd_nvar,&ord1); |
homogenize_order(ord,nd_nvar,&ord1); |
switch ( ord1.ord.simple ) { |
|
case 0: is_rlex = 1; break; |
|
case 1: is_rlex = 0; break; |
|
default: error("nd_gr : unsupported order"); |
|
} |
|
for ( fd0 = 0, in0 = 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 ) { |
Line 2060 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o |
|
Line 2180 void nd_gr_trace(LIST f,LIST v,int m,int homo,struct o |
|
} |
} |
if ( fd0 ) NEXT(fd) = 0; |
if ( fd0 ) NEXT(fd) = 0; |
if ( in0 ) NEXT(in) = 0; |
if ( in0 ) NEXT(in) = 0; |
|
nd_init_ord(&ord1); |
initd(&ord1); |
initd(&ord1); |
nd_nvar++; |
nd_nvar++; |
} else { |
} else { |
switch ( ord->ord.simple ) { |
switch ( ord->ord.simple ) { |
case 0: is_rlex = 1; break; |
case 0: nd_isrlex = 1; nd_degcompat = 1; break; |
case 1: is_rlex = 0; break; |
case 1: nd_isrlex = 0; nd_degcompat = 1; 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, t = BDY(f); t; t = NEXT(t) ) { |
Line 2116 void dltondl(int n,DL dl,unsigned int *r) |
|
Line 2237 void dltondl(int n,DL dl,unsigned int *r) |
|
|
|
d = dl->d; |
d = dl->d; |
bzero(r,nd_wpd*sizeof(unsigned int)); |
bzero(r,nd_wpd*sizeof(unsigned int)); |
if ( is_rlex ) |
if ( nd_isrlex ) |
for ( i = 0; i < n; i++ ) |
for ( i = 0; i < n; i++ ) |
r[(n-1-i)/nd_epw] |= (d[i]<<((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)); |
r[(n-1-i)/nd_epw] |= (d[i]<<((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)); |
else |
else |
Line 2133 DL ndltodl(int n,int td,unsigned int *ndl) |
|
Line 2254 DL ndltodl(int n,int td,unsigned int *ndl) |
|
NEWDL(dl,n); |
NEWDL(dl,n); |
TD(dl) = td; |
TD(dl) = td; |
d = dl->d; |
d = dl->d; |
if ( is_rlex ) |
if ( nd_isrlex ) |
for ( i = 0; i < n; i++ ) |
for ( i = 0; i < n; i++ ) |
d[i] = (ndl[(n-1-i)/nd_epw]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)) |
d[i] = (ndl[(n-1-i)/nd_epw]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)) |
&((1<<nd_bpe)-1); |
&((1<<nd_bpe)-1); |
Line 2149 ND dptond(int mod,DP p) |
|
Line 2270 ND dptond(int mod,DP p) |
|
ND d; |
ND d; |
NM m0,m; |
NM m0,m; |
MP t; |
MP t; |
int n; |
int n,l; |
|
|
if ( !p ) |
if ( !p ) |
return 0; |
return 0; |
n = NV(p); |
n = NV(p); |
m0 = 0; |
m0 = 0; |
for ( t = BDY(p); t; t = NEXT(t) ) { |
for ( t = BDY(p), l = 0; t; t = NEXT(t), l++ ) { |
NEXTNM(m0,m); |
NEXTNM(m0,m); |
if ( mod ) |
if ( mod ) |
CM(m) = ITOS(C(t)); |
CM(m) = ITOS(C(t)); |
Line 2165 ND dptond(int mod,DP p) |
|
Line 2286 ND dptond(int mod,DP p) |
|
dltondl(n,DL(t),DL(m)); |
dltondl(n,DL(t),DL(m)); |
} |
} |
NEXT(m) = 0; |
NEXT(m) = 0; |
MKND(n,m0,d); |
MKND(n,m0,l,d); |
NV(d) = n; |
|
SG(d) = SG(p); |
SG(d) = SG(p); |
return d; |
return d; |
} |
} |
Line 2203 void ndl_print(unsigned int *dl) |
|
Line 2323 void ndl_print(unsigned int *dl) |
|
|
|
n = nd_nvar; |
n = nd_nvar; |
printf("<<"); |
printf("<<"); |
if ( is_rlex ) |
if ( nd_isrlex ) |
for ( i = 0; i < n; i++ ) |
for ( i = 0; i < n; i++ ) |
printf(i==n-1?"%d":"%d,", |
printf(i==n-1?"%d":"%d,", |
(dl[(n-1-i)/nd_epw]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)) |
(dl[(n-1-i)/nd_epw]>>((nd_epw-((n-1-i)%nd_epw)-1)*nd_bpe)) |
Line 2621 void nd_reconstruct_direct(int mod,NDV *ps,int len) |
|
Line 2741 void nd_reconstruct_direct(int mod,NDV *ps,int len) |
|
if ( mod != 0 ) |
if ( mod != 0 ) |
for ( i = len-1; i >= 0; i-- ) |
for ( i = len-1; i >= 0; i-- ) |
ndv_realloc(ps[i],obpe,oadv); |
ndv_realloc(ps[i],obpe,oadv); |
|
for ( i = 0; i < REDTAB_LEN; i++ ) { |
|
for ( mr0 = 0, r = nd_red[i]; r; r = NEXT(r) ) { |
|
NEXTRHist(mr0,mr); |
|
mr->index = r->index; |
|
SG(mr) = SG(r); |
|
TD(mr) = TD(r); |
|
ndl_dup(obpe,DL(r),DL(mr)); |
|
} |
|
if ( mr0 ) NEXT(mr) = 0; |
|
nd_red[i] = mr0; |
|
} |
prev_nm_free_list = 0; |
prev_nm_free_list = 0; |
prev_ndp_free_list = 0; |
prev_ndp_free_list = 0; |
GC_gcollect(); |
GC_gcollect(); |
Line 2636 void ndl_dup(int obpe,unsigned int *d,unsigned int *r) |
|
Line 2767 void ndl_dup(int obpe,unsigned int *d,unsigned int *r) |
|
cbpe = nd_bpe; |
cbpe = nd_bpe; |
for ( i = 0; i < nd_wpd; i++ ) |
for ( i = 0; i < nd_wpd; i++ ) |
r[i] = 0; |
r[i] = 0; |
if ( is_rlex ) |
if ( nd_isrlex ) |
for ( i = 0; i < n; i++ ) { |
for ( i = 0; i < n; i++ ) { |
ei = (d[(n-1-i)/oepw]>>((oepw-((n-1-i)%oepw)-1)*obpe)) |
ei = (d[(n-1-i)/oepw]>>((oepw-((n-1-i)%oepw)-1)*obpe)) |
&((1<<obpe)-1); |
&((1<<obpe)-1); |
Line 2684 ND nd_copy(ND p) |
|
Line 2815 ND nd_copy(ND p) |
|
ndl_copy(DL(m),DL(mr)); |
ndl_copy(DL(m),DL(mr)); |
} |
} |
NEXT(mr) = 0; |
NEXT(mr) = 0; |
MKND(NV(p),mr0,r); |
MKND(NV(p),mr0,LEN(p),r); |
SG(r) = SG(p); |
SG(r) = SG(p); |
return r; |
return r; |
} |
} |
Line 2791 ND ndv_mul_nm(int mod,NDV p,NM m0) |
|
Line 2922 ND ndv_mul_nm(int mod,NDV p,NM m0) |
|
} |
} |
} |
} |
NEXT(mr) = 0; |
NEXT(mr) = 0; |
MKND(NV(p),mr0,r); |
MKND(NV(p),mr0,len,r); |
SG(r) = SG(p) + td; |
SG(r) = SG(p) + td; |
return r; |
return r; |
} |
} |
Line 2836 NDV ndtondv(int mod,ND p) |
|
Line 2967 NDV ndtondv(int mod,ND p) |
|
|
|
if ( !p ) |
if ( !p ) |
return 0; |
return 0; |
len = nd_length(p); |
len = LEN(p); |
if ( mod ) |
if ( mod ) |
m0 = m = (NMV)MALLOC_ATOMIC(len*nmv_adv); |
m0 = m = (NMV)MALLOC_ATOMIC(len*nmv_adv); |
else |
else |
Line 2869 ND ndvtond(int mod,NDV p) |
|
Line 3000 ND ndvtond(int mod,NDV p) |
|
CQ(m) = CQ(t); |
CQ(m) = CQ(t); |
} |
} |
NEXT(m) = 0; |
NEXT(m) = 0; |
MKND(NV(p),m0,d); |
MKND(NV(p),m0,len,d); |
SG(d) = SG(p); |
SG(d) = SG(p); |
return d; |
return d; |
} |
} |
Line 3000 NODE nd_reducebase(NODE x) |
|
Line 3131 NODE nd_reducebase(NODE x) |
|
NEXT(t) = 0; x = t0; |
NEXT(t) = 0; x = t0; |
return x; |
return x; |
} |
} |
|
|
|
void nd_init_ord(struct order_spec *ord) |
|
{ |
|
if ( ord->id ) |
|
error("nd_gr : unsupported order"); |
|
nd_degcompat = 0; |
|
switch ( ord->ord.simple ) { |
|
case 0: |
|
nd_degcompat = 1; |
|
nd_isrlex = 1; |
|
break; |
|
case 1: |
|
nd_degcompat = 1; |
|
nd_isrlex = 0; |
|
break; |
|
default: |
|
error("nd_gr : unsupported order"); |
|
} |
|
} |
|
|