version 1.31, 2020/07/07 08:04:30 |
version 1.37, 2020/10/06 06:31:19 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2018/engine/nd.c,v 1.30 2020/07/03 03:37:59 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2018/engine/nd.c,v 1.36 2020/09/27 04:35:04 noro Exp $ */ |
|
|
#include "nd.h" |
#include "nd.h" |
|
|
Line 18 NM _nm_free_list; |
|
Line 18 NM _nm_free_list; |
|
ND _nd_free_list; |
ND _nd_free_list; |
ND_pairs _ndp_free_list; |
ND_pairs _ndp_free_list; |
NODE nd_hcf; |
NODE nd_hcf; |
int Nsyz; |
int Nsyz,Nsamesig; |
|
|
Obj nd_top_weight; |
Obj nd_top_weight; |
|
|
Line 1223 void print_sig(SIG s) |
|
Line 1223 void print_sig(SIG s) |
|
fprintf(asir_out,">>*e%d",s->pos); |
fprintf(asir_out,">>*e%d",s->pos); |
} |
} |
|
|
|
// assuming increasing order wrt signature |
|
|
INLINE int ndl_find_reducer_s(UINT *dg,SIG sig) |
INLINE int ndl_find_reducer_s(UINT *dg,SIG sig) |
{ |
{ |
RHist r; |
RHist r; |
Line 1237 INLINE int ndl_find_reducer_s(UINT *dg,SIG sig) |
|
Line 1239 INLINE int ndl_find_reducer_s(UINT *dg,SIG sig) |
|
tmp = (UINT *)MALLOC(wpd*sizeof(UINT)); |
tmp = (UINT *)MALLOC(wpd*sizeof(UINT)); |
} |
} |
d = ndl_hash_value(dg); |
d = ndl_hash_value(dg); |
|
#if 1 |
for ( r = nd_red[d], k = 0; r; r = NEXT(r), k++ ) { |
for ( r = nd_red[d], k = 0; r; r = NEXT(r), k++ ) { |
if ( ndl_equal(dg,DL(r)) ) { |
if ( ndl_equal(dg,DL(r)) ) { |
return r->index; |
return r->index; |
} |
} |
} |
} |
|
#endif |
singular = 0; |
singular = 0; |
for ( i = 0; i < nd_psn; i++ ) { |
for ( i = 0; i < nd_psn; i++ ) { |
r = nd_psh[i]; |
r = nd_psh[i]; |
Line 2477 get_eg(&eg2); add_eg(&eg_update,&eg1,&eg2); |
|
Line 2481 get_eg(&eg2); add_eg(&eg_update,&eg1,&eg2); |
|
} |
} |
if ( DP_Print ) { printf("."); fflush(stdout); } |
if ( DP_Print ) { printf("."); fflush(stdout); } |
FREENDP(l); |
FREENDP(l); |
} |
} |
} |
} |
conv_ilist(nd_demand,0,g,indp); |
conv_ilist(nd_demand,0,g,indp); |
if ( !checkonly && DP_Print ) { printf("nd_gb done. Number of nd_add=%d\n",Nnd_add); fflush(stdout); } |
if ( !checkonly && DP_Print ) { printf("nd_gb done. Number of nd_add=%d\n",Nnd_add); fflush(stdout); } |
print_eg("update",&eg_update); |
|
return g; |
if ( DP_Print ) |
|
print_eg("update",&eg_update); |
|
return g; |
} |
} |
|
|
ND_pairs update_pairs_s(ND_pairs d,int t,NODE *syz); |
ND_pairs update_pairs_s(ND_pairs d,int t,NODE *syz); |
Line 2713 get_eg(&eg2); add_eg(&eg_remove,&eg1,&eg2); |
|
Line 2719 get_eg(&eg2); add_eg(&eg_remove,&eg1,&eg2); |
|
} |
} |
g = conv_ilist_s(nd_demand,0,indp); |
g = conv_ilist_s(nd_demand,0,indp); |
if ( DP_Print ) { |
if ( DP_Print ) { |
printf("\nnd_sba done. nd_add=%d,Nsyz=%d,Nredundant=%d\n",Nnd_add,Nsyz,Nredundant); |
printf("\nnd_sba done. nd_add=%d,Nsyz=%d,Nsamesig=%d,Nredundant=%d\n",Nnd_add,Nsyz,Nsamesig,Nredundant); |
fflush(stdout); |
fflush(stdout); |
print_eg("create",&eg_create); |
print_eg("create",&eg_create); |
print_eg("merge",&eg_merge); |
print_eg("merge",&eg_merge); |
Line 3307 ND_pairs merge_pairs_s(ND_pairs p1,ND_pairs p2) |
|
Line 3313 ND_pairs merge_pairs_s(ND_pairs p1,ND_pairs p2) |
|
r->next = q2; r = q2; q2 = q2->next; |
r->next = q2; r = q2; q2 = q2->next; |
} else { |
} else { |
ret = DL_COMPARE(q1->lcm,q2->lcm); |
ret = DL_COMPARE(q1->lcm,q2->lcm); |
|
Nsamesig++; |
if ( ret < 0 ) { |
if ( ret < 0 ) { |
r->next = q1; r = q1; q1 = q1->next; |
r->next = q1; r = q1; q1 = q1->next; |
q2 = q2->next; |
q2 = q2->next; |
Line 3691 ND_pairs nd_minsugarp_s( ND_pairs d, ND_pairs *prest ) |
|
Line 3698 ND_pairs nd_minsugarp_s( ND_pairs d, ND_pairs *prest ) |
|
int msugar; |
int msugar; |
ND_pairs t,last; |
ND_pairs t,last; |
|
|
#if 1 |
|
for ( msugar = SG(d), t = d; t; t = NEXT(t) ) |
for ( msugar = SG(d), t = d; t; t = NEXT(t) ) |
if ( SG(t) == msugar ) last = t; |
if ( SG(t) == msugar ) last = t; |
#else |
|
msugar = (d->sig->dl->td)+nd_sba_hm[d->sig->pos]->td; |
|
for ( t = d; t; t = NEXT(t) ) |
|
if ( ((t->sig->dl->td)+nd_sba_hm[t->sig->pos]->td) == msugar ) last = t; |
|
#endif |
|
*prest = last->next; |
*prest = last->next; |
last->next = 0; |
last->next = 0; |
return d; |
return d; |
Line 4272 void nd_sba(LIST f,LIST v,int m,int homo,int retdp,int |
|
Line 4273 void nd_sba(LIST f,LIST v,int m,int homo,int retdp,int |
|
nd_module = 0; |
nd_module = 0; |
nd_demand = 0; |
nd_demand = 0; |
parse_nd_option(current_option); |
parse_nd_option(current_option); |
|
Nsamesig = 0; |
if ( DP_Multiple ) |
if ( DP_Multiple ) |
nd_scale = ((double)DP_Multiple)/(double)(Denominator?Denominator:1); |
nd_scale = ((double)DP_Multiple)/(double)(Denominator?Denominator:1); |
get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc); |
get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc); |
Line 4343 void nd_sba(LIST f,LIST v,int m,int homo,int retdp,int |
|
Line 4344 void nd_sba(LIST f,LIST v,int m,int homo,int retdp,int |
|
for ( r0 = 0, t = x; t; t = NEXT(t) ) { |
for ( r0 = 0, t = x; t; t = NEXT(t) ) { |
NEXTNODE(r0,r); |
NEXTNODE(r0,r); |
if ( retdp ) BDY(r) = ndvtodp(m,BDY(t)); |
if ( retdp ) BDY(r) = ndvtodp(m,BDY(t)); |
BDY(r) = ndvtop(m,CO,vv,BDY(t)); |
else BDY(r) = ndvtop(m,CO,vv,BDY(t)); |
} |
} |
if ( r0 ) NEXT(r) = 0; |
if ( r0 ) NEXT(r) = 0; |
MKLIST(*rp,r0); |
MKLIST(*rp,r0); |
Line 4864 DL ndltodl(int n,UINT *ndl) |
|
Line 4865 DL ndltodl(int n,UINT *ndl) |
|
int i,j,l,s,ord_l; |
int i,j,l,s,ord_l; |
struct order_pair *op; |
struct order_pair *op; |
|
|
NEWDL(dl,n); |
NEWDL_NOINIT(dl,n); |
dl->td = TD(ndl); |
dl->td = TD(ndl); |
d = dl->d; |
d = dl->d; |
if ( nd_blockmask ) { |
if ( nd_blockmask ) { |
Line 10881 int nd_symbolic_preproc_s(PGeoBucket bucket,int trace, |
|
Line 10882 int nd_symbolic_preproc_s(PGeoBucket bucket,int trace, |
|
|
|
NODE nd_sba_f4(int m,int **indp) |
NODE nd_sba_f4(int m,int **indp) |
{ |
{ |
int i,nh,stat,index,f4red; |
int i,nh,stat,index,f4red,f4step; |
NODE r,g,tn0,tn,node; |
int col,rank,len,k,j,a,sugar,nbase,psugar,ms; |
ND_pairs d,l,t,ll0,ll,lh; |
NODE r,g,rp0,nflist; |
LIST l0,l1; |
ND_pairs d,l,t; |
ND spol,red; |
ND h,nf; |
NDV nf,redv; |
NDV nfv; |
NM s0,s; |
union oNDC hc; |
NODE rp0,srp0,nflist; |
UINT *s0vect; |
int nsp,nred,col,rank,len,k,j,a,i1s,i2s; |
|
UINT c; |
UINT c; |
UINT **spmat; |
|
UINT *s0vect,*svect,*p,*v; |
|
int *colstat; |
|
IndArray *imat; |
|
int *rhead; |
|
int spcol,sprow; |
|
int sugar,sugarh; |
|
int nbase; |
|
PGeoBucket bucket; |
PGeoBucket bucket; |
struct oEGT eg0,eg1,eg_f4; |
|
Z i1,i2,sugarq; |
|
NODE *syzlist; |
NODE *syzlist; |
|
SIG sig; |
|
struct oEGT eg0,eg1,eg_f4; |
|
struct oEGT eg2,eg_update,eg_remove,eg_large,eg_nf,eg_nfzero; |
|
|
Nf4_red=0; |
Nf4_red=0; |
d = 0; |
d = 0; |
Line 10912 NODE nd_sba_f4(int m,int **indp) |
|
Line 10905 NODE nd_sba_f4(int m,int **indp) |
|
} |
} |
nd_nbase = nd_psn; |
nd_nbase = nd_psn; |
f4red = 1; |
f4red = 1; |
|
psugar = 0; |
|
f4step = 0; |
while ( d ) { |
while ( d ) { |
l = nd_minsugarp_s(d,&d); |
for ( t = d, ms = SG(d); t; t = NEXT(t) ) |
if ( !l ) continue; |
if ( SG(t) < ms ) ms = SG(t); |
sugar = nd_sugarweight?l->sugar2:SG(l); |
if ( ms == psugar && f4step >= 2 ) { |
if ( MaxDeg > 0 && sugar > MaxDeg ) break; |
again: |
bucket = create_pbucket(); |
l = d; d = d->next; |
stat = nd_sp_f4(m,0,l,bucket); |
if ( small_lcm(l) ) { |
if ( !stat ) { |
if ( DP_Print ) fprintf(asir_out,"M"); |
for ( t = l; NEXT(t); t = NEXT(t) ); |
continue; |
NEXT(t) = d; d = l; |
} |
d = nd_reconstruct(0,d); |
sig = l->sig; |
continue; |
stat = nd_sp(m,0,l,&h); |
} |
if ( !stat ) { |
if ( bucket->m < 0 ) continue; |
NEXT(l) = d; d = l; |
col = nd_symbolic_preproc_s(bucket,0,&s0vect,&rp0); |
d = nd_reconstruct(0,d); |
if ( !col ) { |
goto again; |
for ( t = l; NEXT(t); t = NEXT(t) ); |
} |
NEXT(t) = d; d = l; |
get_eg(&eg1); |
d = nd_reconstruct(0,d); |
#if USE_GEOBUCKET |
continue; |
stat = m?nd_nf_pbucket_s(m,h,nd_ps,!Top,&nf):nd_nf_s(m,0,h,nd_ps,!Top,&nf); |
} |
#else |
if ( DP_Print ) fprintf(asir_out,"sugar=%d,",sugar); |
stat = nd_nf_s(m,0,h,nd_ps,!Top,&nf); |
l = remove_large_lcm(l); |
#endif |
nflist = nd_f4_red_s(m,l,0,s0vect,col,rp0,syzlist); |
get_eg(&eg2); |
/* adding new bases */ |
if ( !stat ) { |
for ( r = nflist; r; r = NEXT(r) ) { |
NEXT(l) = d; d = l; |
#if 0 |
d = nd_reconstruct(0,d); |
ND tmp,tmpred; |
goto again; |
SIG sig; |
} else if ( stat == -1 ) { |
|
if ( DP_Print ) { printf("S"); fflush(stdout); } |
nf = (NDV)BDY(r); |
FREENDP(l); |
sig = nf->sig; |
} else if ( nf ) { |
tmp = ndvtond(m,nf); |
if ( DP_Print ) { printf("+"); fflush(stdout); } |
stat = nd_nf_s(m,0,tmp,nd_ps,!Top,&tmpred); |
add_eg(&eg_nf,&eg1,&eg2); |
#if 0 |
hc = HCU(nf); |
if ( stat < 0 ) { |
nd_removecont(m,nf); |
// top reducible |
nfv = ndtondv(m,nf); nd_free(nf); |
if ( DP_Print ) { fprintf(asir_out,"S"); fflush(asir_out); } |
nh = ndv_newps(m,nfv,0); |
} else if ( tmpred ) { |
|
#else |
|
if ( tmpred ) { |
|
#endif |
|
nf = ndtondv(m,tmpred); |
|
ndv_removecont(m,nf); |
|
nh = ndv_newps(m,nf,0); |
|
d = update_pairs_s(d,nh,syzlist); |
d = update_pairs_s(d,nh,syzlist); |
nd_sba_pos[sig->pos] = append_one(nd_sba_pos[sig->pos],nh); |
nd_sba_pos[sig->pos] = append_one(nd_sba_pos[sig->pos],nh); |
|
FREENDP(l); |
} else { |
} else { |
|
add_eg(&eg_nfzero,&eg1,&eg2); |
|
// syzygy |
|
get_eg(&eg1); |
|
d = remove_spair_s(d,sig); |
|
get_eg(&eg2); add_eg(&eg_remove,&eg1,&eg2); |
syzlist[sig->pos] = insert_sig(syzlist[sig->pos],sig); |
syzlist[sig->pos] = insert_sig(syzlist[sig->pos],sig); |
} |
if ( DP_Print ) { printf("."); fflush(stdout); } |
#else |
FREENDP(l); |
nf = (NDV)BDY(r); |
} |
ndv_removecont(m,nf); |
} else { |
nh = ndv_newps(m,nf,0); |
if ( ms != psugar ) f4step = 1; |
d = update_pairs_s(d,nh,syzlist); |
else f4step++; |
nd_sba_pos[nf->sig->pos] = append_one(nd_sba_pos[nf->sig->pos],nh); |
again2: |
#endif |
psugar = ms; |
|
l = nd_minsugarp_s(d,&d); |
|
sugar = nd_sugarweight?d->sugar2:SG(d); |
|
bucket = create_pbucket(); |
|
stat = nd_sp_f4(m,0,l,bucket); |
|
if ( !stat ) { |
|
for ( t = l; NEXT(t); t = NEXT(t) ); |
|
NEXT(t) = d; d = l; |
|
d = nd_reconstruct(0,d); |
|
goto again2; |
|
} |
|
if ( bucket->m < 0 ) continue; |
|
col = nd_symbolic_preproc_s(bucket,0,&s0vect,&rp0); |
|
if ( !col ) { |
|
for ( t = l; NEXT(t); t = NEXT(t) ) |
|
; |
|
NEXT(t) = d; d = l; |
|
d = nd_reconstruct(0,d); |
|
goto again2; |
|
} |
|
if ( DP_Print ) fprintf(asir_out,"\nsugar=%d,",psugar); |
|
nflist = nd_f4_red_s(m,l,0,s0vect,col,rp0,syzlist); |
|
/* adding new bases */ |
|
for ( r = nflist; r; r = NEXT(r) ) { |
|
nfv = (NDV)BDY(r); |
|
ndv_removecont(m,nfv); |
|
nh = ndv_newps(m,nfv,0); |
|
d = update_pairs_s(d,nh,syzlist); |
|
nd_sba_pos[nfv->sig->pos] = append_one(nd_sba_pos[nfv->sig->pos],nh); |
|
} |
|
for ( i = 0; i < nd_nbase; i++ ) |
|
for ( r = syzlist[i]; r; r = NEXT(r) ) |
|
d = remove_spair_s(d,(SIG)BDY(r)); |
|
d = remove_large_lcm(d); |
|
if ( DP_Print ) { |
|
fprintf(asir_out,"f4red=%d,gblen=%d",f4red,nd_psn); fflush(asir_out); |
|
} |
|
f4red++; |
} |
} |
for ( i = 0; i < nd_nbase; i++ ) |
|
for ( r = syzlist[i]; r; r = NEXT(r) ) |
|
d = remove_spair_s(d,(SIG)BDY(r)); |
|
if ( DP_Print ) { |
|
fprintf(asir_out,"f4red=%d,gblen=%d\n",f4red,length(g)); fflush(asir_out); |
|
} |
|
f4red++; |
|
if ( nd_f4red && f4red > nd_f4red ) break; |
|
if ( nd_rank0 && !nflist ) break; |
|
} |
} |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"number of red=%d,",Nf4_red); |
fprintf(asir_out,"\nnumber of red=%d,",Nf4_red); |
} |
} |
g = conv_ilist_s(nd_demand,0,indp); |
g = conv_ilist_s(nd_demand,0,indp); |
return g; |
return g; |