version 1.222, 2015/08/08 14:19:41 |
version 1.224, 2016/03/31 01:40:10 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.221 2015/03/15 19:31:30 ohara Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.223 2015/08/14 13:51:54 fujimoto Exp $ */ |
|
|
#include "nd.h" |
#include "nd.h" |
|
|
Line 56 static int nd_found,nd_create,nd_notfirst; |
|
Line 56 static int nd_found,nd_create,nd_notfirst; |
|
static int nmv_adv; |
static int nmv_adv; |
static int nd_demand; |
static int nd_demand; |
static int nd_module,nd_ispot,nd_mpos,nd_pot_nelim; |
static int nd_module,nd_ispot,nd_mpos,nd_pot_nelim; |
|
static int nd_module_rank,nd_poly_weight_len; |
|
static int *nd_poly_weight,*nd_module_weight; |
static NODE nd_tracelist; |
static NODE nd_tracelist; |
static NODE nd_alltracelist; |
static NODE nd_alltracelist; |
static int nd_gentrace,nd_gensyz,nd_nora,nd_newelim,nd_intersect; |
static int nd_gentrace,nd_gensyz,nd_nora,nd_newelim,nd_intersect; |
Line 647 int ndl_ww_lex_compare(UINT *d1,UINT *d2) |
|
Line 649 int ndl_ww_lex_compare(UINT *d1,UINT *d2) |
|
return ndl_lex_compare(d1,d2); |
return ndl_lex_compare(d1,d2); |
} |
} |
|
|
|
int ndl_module_weight_compare(UINT *d1,UINT *d2) |
|
{ |
|
int s,j; |
|
|
|
if ( nd_nvar != nd_poly_weight_len ) |
|
error("invalid module weight : the length of polynomial weight != the number of variables"); |
|
s = 0; |
|
for ( j = 0; j < nd_nvar; j++ ) |
|
s += (GET_EXP(d1,j)-GET_EXP(d2,j))*nd_poly_weight[j]; |
|
s += nd_module_weight[MPOS(d1)-1]-nd_module_weight[MPOS(d2)-1]; |
|
if ( s > 0 ) return 1; |
|
else if ( s < 0 ) return -1; |
|
else return 0; |
|
} |
|
|
int ndl_module_grlex_compare(UINT *d1,UINT *d2) |
int ndl_module_grlex_compare(UINT *d1,UINT *d2) |
{ |
{ |
int i,c; |
int i,c; |
|
|
|
if ( !MPOS(d1) || !MPOS(d2) ) { |
|
printf("afo\n"); |
|
} |
|
|
|
if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c; |
if ( nd_ispot ) { |
if ( nd_ispot ) { |
if ( nd_pot_nelim && MPOS(d1)>=nd_pot_nelim+1 && MPOS(d2) >= nd_pot_nelim+1 ) { |
if ( nd_pot_nelim && MPOS(d1)>=nd_pot_nelim+1 && MPOS(d2) >= nd_pot_nelim+1 ) { |
if ( TD(d1) > TD(d2) ) return 1; |
if ( TD(d1) > TD(d2) ) return 1; |
Line 677 int ndl_module_glex_compare(UINT *d1,UINT *d2) |
|
Line 699 int ndl_module_glex_compare(UINT *d1,UINT *d2) |
|
{ |
{ |
int i,c; |
int i,c; |
|
|
|
if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c; |
if ( nd_ispot ) { |
if ( nd_ispot ) { |
if ( MPOS(d1) < MPOS(d2) ) return 1; |
if ( MPOS(d1) < MPOS(d2) ) return 1; |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
Line 695 int ndl_module_lex_compare(UINT *d1,UINT *d2) |
|
Line 718 int ndl_module_lex_compare(UINT *d1,UINT *d2) |
|
{ |
{ |
int i,c; |
int i,c; |
|
|
|
if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c; |
if ( nd_ispot ) { |
if ( nd_ispot ) { |
if ( MPOS(d1) < MPOS(d2) ) return 1; |
if ( MPOS(d1) < MPOS(d2) ) return 1; |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
Line 711 int ndl_module_block_compare(UINT *d1,UINT *d2) |
|
Line 735 int ndl_module_block_compare(UINT *d1,UINT *d2) |
|
{ |
{ |
int i,c; |
int i,c; |
|
|
|
if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c; |
if ( nd_ispot ) { |
if ( nd_ispot ) { |
if ( MPOS(d1) < MPOS(d2) ) return 1; |
if ( MPOS(d1) < MPOS(d2) ) return 1; |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
Line 727 int ndl_module_matrix_compare(UINT *d1,UINT *d2) |
|
Line 752 int ndl_module_matrix_compare(UINT *d1,UINT *d2) |
|
{ |
{ |
int i,c; |
int i,c; |
|
|
|
if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c; |
if ( nd_ispot ) { |
if ( nd_ispot ) { |
if ( MPOS(d1) < MPOS(d2) ) return 1; |
if ( MPOS(d1) < MPOS(d2) ) return 1; |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
Line 743 int ndl_module_composite_compare(UINT *d1,UINT *d2) |
|
Line 769 int ndl_module_composite_compare(UINT *d1,UINT *d2) |
|
{ |
{ |
int i,c; |
int i,c; |
|
|
|
if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c; |
if ( nd_ispot ) { |
if ( nd_ispot ) { |
if ( MPOS(d1) > MPOS(d2) ) return 1; |
if ( MPOS(d1) > MPOS(d2) ) return 1; |
else if ( MPOS(d1) < MPOS(d2) ) return -1; |
else if ( MPOS(d1) < MPOS(d2) ) return -1; |
Line 5249 NODE ndv_reducebase(NODE x,int *perm) |
|
Line 5276 NODE ndv_reducebase(NODE x,int *perm) |
|
|
|
void nd_init_ord(struct order_spec *ord) |
void nd_init_ord(struct order_spec *ord) |
{ |
{ |
nd_module = (ord->id >= 256); |
nd_module = (ord->id >= 256); |
|
if ( nd_module ) { |
|
nd_dcomp = -1; |
|
nd_ispot = ord->ispot; |
|
nd_pot_nelim = ord->pot_nelim; |
|
nd_poly_weight_len = ord->nv; |
|
nd_poly_weight = ord->top_weight; |
|
nd_module_rank = ord->module_rank; |
|
nd_module_weight = ord->module_top_weight; |
|
} |
nd_matrix = 0; |
nd_matrix = 0; |
nd_matrix_len = 0; |
nd_matrix_len = 0; |
switch ( ord->id ) { |
switch ( ord->id ) { |
Line 5305 void nd_init_ord(struct order_spec *ord) |
|
Line 5341 void nd_init_ord(struct order_spec *ord) |
|
|
|
/* module order */ |
/* module order */ |
case 256: |
case 256: |
nd_ispot = ord->ispot; |
|
nd_pot_nelim = ord->pot_nelim; |
|
nd_dcomp = -1; |
|
switch ( ord->ord.simple ) { |
switch ( ord->ord.simple ) { |
case 0: |
case 0: |
nd_isrlex = 1; |
nd_isrlex = 1; |
Line 5327 void nd_init_ord(struct order_spec *ord) |
|
Line 5360 void nd_init_ord(struct order_spec *ord) |
|
break; |
break; |
case 257: |
case 257: |
/* block order */ |
/* block order */ |
nd_ispot = ord->ispot; |
|
nd_pot_nelim = ord->pot_nelim; |
|
nd_dcomp = -1; |
|
nd_isrlex = 0; |
nd_isrlex = 0; |
ndl_compare_function = ndl_module_block_compare; |
ndl_compare_function = ndl_module_block_compare; |
break; |
break; |
case 258: |
case 258: |
/* matrix order */ |
/* matrix order */ |
nd_ispot = ord->ispot; |
|
nd_pot_nelim = ord->pot_nelim; |
|
nd_dcomp = -1; |
|
nd_isrlex = 0; |
nd_isrlex = 0; |
nd_matrix_len = ord->ord.matrix.row; |
nd_matrix_len = ord->ord.matrix.row; |
nd_matrix = ord->ord.matrix.matrix; |
nd_matrix = ord->ord.matrix.matrix; |
Line 5345 void nd_init_ord(struct order_spec *ord) |
|
Line 5372 void nd_init_ord(struct order_spec *ord) |
|
break; |
break; |
case 259: |
case 259: |
/* composite order */ |
/* composite order */ |
nd_ispot = ord->ispot; |
|
nd_pot_nelim = ord->pot_nelim; |
|
nd_dcomp = -1; |
|
nd_isrlex = 0; |
nd_isrlex = 0; |
nd_worb_len = ord->ord.composite.length; |
nd_worb_len = ord->ord.composite.length; |
nd_worb = ord->ord.composite.w_or_b; |
nd_worb = ord->ord.composite.w_or_b; |
Line 6655 init_eg(&eg_search); |
|
Line 6679 init_eg(&eg_search); |
|
|
|
/* construction of index arrays */ |
/* construction of index arrays */ |
fprintf(stderr,"%dx%d,",nsp+nred,col); |
fprintf(stderr,"%dx%d,",nsp+nred,col); |
#if defined(__MINGW32__) || defined(__MINGW64__) |
|
fflush(stderr); |
|
#endif |
|
rvect = (NM_ind_pair *)ALLOCA(nred*sizeof(NM_ind_pair)); |
rvect = (NM_ind_pair *)ALLOCA(nred*sizeof(NM_ind_pair)); |
s0hash = (int *)ALLOCA(col*sizeof(int)); |
s0hash = (int *)ALLOCA(col*sizeof(int)); |
for ( i = 0, s = s0vect; i < col; i++, s += nd_wpd ) |
for ( i = 0, s = s0vect; i < col; i++, s += nd_wpd ) |
Line 7646 void nd_det(int mod,MAT f,P *rp) |
|
Line 7667 void nd_det(int mod,MAT f,P *rp) |
|
for ( j = 0, sgn = 1; j < n; j++ ) { |
for ( j = 0, sgn = 1; j < n; j++ ) { |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(stderr,".",j); |
fprintf(stderr,".",j); |
#if defined(__MINGW32__) || defined(__MINGW64__) |
|
fflush(stderr); |
|
#endif |
|
} |
} |
for ( i = j; i < n && !dm[i][j]; i++ ); |
for ( i = j; i < n && !dm[i][j]; i++ ); |
if ( i == n ) { |
if ( i == n ) { |
Line 7710 void nd_det(int mod,MAT f,P *rp) |
|
Line 7728 void nd_det(int mod,MAT f,P *rp) |
|
} |
} |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(stderr,"\n",k); |
fprintf(stderr,"\n",k); |
#if defined(__MINGW32__) || defined(__MINGW64__) |
|
fflush(stderr); |
|
#endif |
|
} |
} |
if ( sgn < 0 ) |
if ( sgn < 0 ) |
if ( mod ) |
if ( mod ) |