version 1.4, 2018/09/25 07:36:01 |
version 1.30, 2020/07/03 03:37:59 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2018/engine/nd.c,v 1.3 2018/09/24 22:26:43 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2018/engine/nd.c,v 1.29 2020/07/02 09:24:17 noro Exp $ */ |
|
|
#include "nd.h" |
#include "nd.h" |
|
|
struct oEGT eg_search; |
int Nnd_add,Nf4_red; |
|
struct oEGT eg_search,f4_symb,f4_conv,f4_elim1,f4_elim2; |
|
|
int diag_period = 6; |
int diag_period = 6; |
int weight_check = 1; |
int weight_check = 1; |
int (*ndl_compare_function)(UINT *a1,UINT *a2); |
int (*ndl_compare_function)(UINT *a1,UINT *a2); |
|
/* for general module order */ |
|
int (*ndl_base_compare_function)(UINT *a1,UINT *a2); |
|
int (*dl_base_compare_function)(int nv,DL a,DL b); |
|
int nd_base_ordtype; |
int nd_dcomp; |
int nd_dcomp; |
int nd_rref2; |
int nd_rref2; |
NM _nm_free_list; |
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; |
|
|
Obj nd_top_weight; |
Obj nd_top_weight; |
|
|
Line 44 static NDV *nd_ps_trace; |
|
Line 50 static NDV *nd_ps_trace; |
|
static NDV *nd_ps_sym; |
static NDV *nd_ps_sym; |
static NDV *nd_ps_trace_sym; |
static NDV *nd_ps_trace_sym; |
static RHist *nd_psh; |
static RHist *nd_psh; |
static int nd_psn,nd_pslen; |
static int nd_psn,nd_pslen,nd_nbase; |
static RHist *nd_red; |
static RHist *nd_red; |
static int *nd_work_vector; |
static int *nd_work_vector; |
static int **nd_matrix; |
static int **nd_matrix; |
Line 54 static int nd_worb_len; |
|
Line 60 static int nd_worb_len; |
|
static int nd_found,nd_create,nd_notfirst; |
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_module_ordtype,nd_mpos,nd_pot_nelim; |
static int nd_module_rank,nd_poly_weight_len; |
static int nd_module_rank,nd_poly_weight_len; |
static int *nd_poly_weight,*nd_module_weight; |
static int *nd_poly_weight,*nd_module_weight; |
static NODE nd_tracelist; |
static NODE nd_tracelist; |
Line 65 static NODE nd_nzlist,nd_check_splist; |
|
Line 71 static NODE nd_nzlist,nd_check_splist; |
|
static int nd_splist; |
static int nd_splist; |
static int *nd_sugarweight; |
static int *nd_sugarweight; |
static int nd_f4red,nd_rank0,nd_last_nonzero; |
static int nd_f4red,nd_rank0,nd_last_nonzero; |
|
static DL *nd_sba_hm; |
|
static NODE *nd_sba_pos; |
|
|
NumberField get_numberfield(); |
NumberField get_numberfield(); |
UINT *nd_det_compute_bound(NDV **dm,int n,int j); |
UINT *nd_det_compute_bound(NDV **dm,int n,int j); |
Line 77 NDV pltondv(VL vl,VL dvl,LIST p); |
|
Line 85 NDV pltondv(VL vl,VL dvl,LIST p); |
|
void pltozpl(LIST l,Q *cont,LIST *pp); |
void pltozpl(LIST l,Q *cont,LIST *pp); |
void ndl_max(UINT *d1,unsigned *d2,UINT *d); |
void ndl_max(UINT *d1,unsigned *d2,UINT *d); |
void nmtodp(int mod,NM m,DP *r); |
void nmtodp(int mod,NM m,DP *r); |
|
void ndltodp(UINT *d,DP *r); |
NODE reverse_node(NODE n); |
NODE reverse_node(NODE n); |
P ndc_div(int mod,union oNDC a,union oNDC b); |
P ndc_div(int mod,union oNDC a,union oNDC b); |
P ndctop(int mod,union oNDC c); |
P ndctop(int mod,union oNDC c); |
Line 86 void parse_nd_option(NODE opt); |
|
Line 95 void parse_nd_option(NODE opt); |
|
void dltondl(int n,DL dl,UINT *r); |
void dltondl(int n,DL dl,UINT *r); |
DP ndvtodp(int mod,NDV p); |
DP ndvtodp(int mod,NDV p); |
DP ndtodp(int mod,ND p); |
DP ndtodp(int mod,ND p); |
|
DPM ndvtodpm(int mod,NDV p); |
|
NDV dpmtondv(int mod,DPM p); |
|
int dpm_getdeg(DPM p,int *rank); |
|
void dpm_ptozp(DPM p,Z *cont,DPM *r); |
|
int compdmm(int nv,DMM a,DMM b); |
|
|
void Pdp_set_weight(NODE,VECT *); |
void Pdp_set_weight(NODE,VECT *); |
void Pox_cmo_rpc(NODE,Obj *); |
void Pox_cmo_rpc(NODE,Obj *); |
Line 469 int ndl_weight(UINT *d) |
|
Line 483 int ndl_weight(UINT *d) |
|
for ( j = 0; j < nd_epw; j++, u>>=nd_bpe ) |
for ( j = 0; j < nd_epw; j++, u>>=nd_bpe ) |
t += (u&nd_mask0); |
t += (u&nd_mask0); |
} |
} |
if ( nd_module && current_module_weight_vector && MPOS(d) ) |
if ( nd_module && nd_module_rank && MPOS(d) ) |
t += current_module_weight_vector[MPOS(d)]; |
t += nd_module_weight[MPOS(d)-1]; |
|
for ( i = nd_exporigin; i < nd_wpd; i++ ) |
|
if ( d[i] && !t ) |
|
printf("afo\n"); |
return t; |
return t; |
} |
} |
|
|
Line 485 int ndl_weight2(UINT *d) |
|
Line 502 int ndl_weight2(UINT *d) |
|
u = GET_EXP(d,i); |
u = GET_EXP(d,i); |
t += nd_sugarweight[i]*u; |
t += nd_sugarweight[i]*u; |
} |
} |
if ( nd_module && current_module_weight_vector && MPOS(d) ) |
if ( nd_module && nd_module_rank && MPOS(d) ) |
t += current_module_weight_vector[MPOS(d)]; |
t += nd_module_weight[MPOS(d)-1]; |
return t; |
return t; |
} |
} |
|
|
Line 514 void ndl_weight_mask(UINT *d) |
|
Line 531 void ndl_weight_mask(UINT *d) |
|
} |
} |
} |
} |
|
|
|
int ndl_glex_compare(UINT *d1,UINT *d2) |
|
{ |
|
if ( TD(d1) > TD(d2) ) return 1; |
|
else if ( TD(d1) < TD(d2) ) return -1; |
|
else return ndl_lex_compare(d1,d2); |
|
} |
|
|
int ndl_lex_compare(UINT *d1,UINT *d2) |
int ndl_lex_compare(UINT *d1,UINT *d2) |
{ |
{ |
int i; |
int i; |
Line 566 int ndl_matrix_compare(UINT *d1,UINT *d2) |
|
Line 590 int ndl_matrix_compare(UINT *d1,UINT *d2) |
|
Z t1; |
Z t1; |
Z t,t2; |
Z t,t2; |
|
|
for ( j = 0; j < nd_nvar; j++ ) |
for ( j = 0; j < nd_nvar; j++ ) |
nd_work_vector[j] = GET_EXP(d1,j)-GET_EXP(d2,j); |
nd_work_vector[j] = GET_EXP(d1,j)-GET_EXP(d2,j); |
if ( nd_top_weight ) { |
if ( nd_top_weight ) { |
if ( OID(nd_top_weight) == O_VECT ) { |
if ( OID(nd_top_weight) == O_VECT ) { |
mat = (Z **)&BDY((VECT)nd_top_weight); |
mat = (Z **)&BDY((VECT)nd_top_weight); |
row = 1; |
row = 1; |
} else { |
} else { |
mat = (Z **)BDY((MAT)nd_top_weight); |
mat = (Z **)BDY((MAT)nd_top_weight); |
row = ((MAT)nd_top_weight)->row; |
row = ((MAT)nd_top_weight)->row; |
} |
} |
for ( i = 0; i < row; i++ ) { |
for ( i = 0; i < row; i++ ) { |
w = mat[i]; |
w = mat[i]; |
for ( j = 0, t = 0; j < nd_nvar; j++ ) { |
for ( j = 0, t = 0; j < nd_nvar; j++ ) { |
STOQ(nd_work_vector[j],t1); |
STOZ(nd_work_vector[j],t1); |
mulz(w[j],t1,&t2); |
mulz(w[j],t1,&t2); |
addz(t,t2,&t1); |
addz(t,t2,&t1); |
t = t1; |
t = t1; |
} |
} |
if ( t ) { |
if ( t ) { |
s = sgnz(t); |
s = sgnz(t); |
if ( s > 0 ) return 1; |
|
else if ( s < 0 ) return -1; |
|
} |
|
} |
|
} |
|
for ( i = 0; i < nd_matrix_len; i++ ) { |
|
v = nd_matrix[i]; |
|
for ( j = 0, s = 0; j < nd_nvar; j++ ) |
|
s += v[j]*nd_work_vector[j]; |
|
if ( s > 0 ) return 1; |
if ( s > 0 ) return 1; |
else if ( s < 0 ) return -1; |
else if ( s < 0 ) return -1; |
|
} |
} |
} |
|
} |
|
for ( i = 0; i < nd_matrix_len; i++ ) { |
|
v = nd_matrix[i]; |
|
for ( j = 0, s = 0; j < nd_nvar; j++ ) |
|
s += v[j]*nd_work_vector[j]; |
|
if ( s > 0 ) return 1; |
|
else if ( s < 0 ) return -1; |
|
} |
if ( !ndl_equal(d1,d2) ) |
if ( !ndl_equal(d1,d2) ) |
error("afo"); |
error("ndl_matrix_compare : invalid matrix"); |
return 0; |
return 0; |
} |
} |
|
|
int ndl_composite_compare(UINT *d1,UINT *d2) |
int ndl_composite_compare(UINT *d1,UINT *d2) |
Line 683 int ndl_ww_lex_compare(UINT *d1,UINT *d2) |
|
Line 707 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) |
// common function for module glex and grlex comparison |
|
int ndl_module_glex_compare(UINT *d1,UINT *d2) |
{ |
{ |
int s,j; |
int c; |
|
|
if ( nd_nvar != nd_poly_weight_len ) |
switch ( nd_module_ordtype ) { |
error("invalid module weight : the length of polynomial weight != the number of variables"); |
case 0: |
s = 0; |
if ( TD(d1) > TD(d2) ) return 1; |
for ( j = 0; j < nd_nvar; j++ ) |
else if ( TD(d1) < TD(d2) ) return -1; |
s += (GET_EXP(d1,j)-GET_EXP(d2,j))*nd_poly_weight[j]; |
else if ( (c = ndl_lex_compare(d1,d2)) != 0 ) return c; |
if ( MPOS(d1) >= 1 && MPOS(d2) >= 1 ) { |
else if ( MPOS(d1) < MPOS(d2) ) return 1; |
s += nd_module_weight[MPOS(d1)-1]-nd_module_weight[MPOS(d2)-1]; |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
} |
else return 0; |
if ( s > 0 ) return 1; |
break; |
else if ( s < 0 ) return -1; |
|
else return 0; |
|
} |
|
|
|
int ndl_module_grlex_compare(UINT *d1,UINT *d2) |
case 1: |
{ |
if ( nd_pot_nelim && MPOS(d1)>=nd_pot_nelim+1 && MPOS(d2) >= nd_pot_nelim+1 ) { |
int i,c; |
if ( TD(d1) > TD(d2) ) return 1; |
|
else if ( TD(d1) < TD(d2) ) return -1; |
|
if ( (c = ndl_lex_compare(d1,d2)) != 0 ) return c; |
|
if ( MPOS(d1) < MPOS(d2) ) return 1; |
|
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
|
} |
|
if ( MPOS(d1) < MPOS(d2) ) return 1; |
|
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
|
else if ( TD(d1) > TD(d2) ) return 1; |
|
else if ( TD(d1) < TD(d2) ) return -1; |
|
else return ndl_lex_compare(d1,d2); |
|
break; |
|
|
if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c; |
case 2: // weight -> POT |
if ( nd_ispot ) { |
if ( TD(d1) > TD(d2) ) return 1; |
if ( nd_pot_nelim && MPOS(d1)>=nd_pot_nelim+1 && MPOS(d2) >= nd_pot_nelim+1 ) { |
else if ( TD(d1) < TD(d2) ) return -1; |
if ( TD(d1) > TD(d2) ) return 1; |
else if ( MPOS(d1) < MPOS(d2) ) return 1; |
else if ( TD(d1) < TD(d2) ) return -1; |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
if ( (c = ndl_lex_compare(d1,d2)) != 0 ) return c; |
else return ndl_lex_compare(d1,d2); |
if ( MPOS(d1) < MPOS(d2) ) return 1; |
break; |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
|
return 0; |
|
} |
|
if ( MPOS(d1) < MPOS(d2) ) return 1; |
|
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
|
} |
|
if ( TD(d1) > TD(d2) ) return 1; |
|
else if ( TD(d1) < TD(d2) ) return -1; |
|
if ( (c = ndl_lex_compare(d1,d2)) != 0 ) return c; |
|
if ( !nd_ispot ) { |
|
if ( MPOS(d1) < MPOS(d2) ) return 1; |
|
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
|
} |
|
return 0; |
|
} |
|
|
|
int ndl_module_glex_compare(UINT *d1,UINT *d2) |
default: |
{ |
error("ndl_module_glex_compare : invalid module_ordtype"); |
int i,c; |
return 0; |
|
} |
if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c; |
|
if ( nd_ispot ) { |
|
if ( MPOS(d1) < MPOS(d2) ) return 1; |
|
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
|
} |
|
if ( TD(d1) > TD(d2) ) return 1; |
|
else if ( TD(d1) < TD(d2) ) return -1; |
|
if ( (c = ndl_lex_compare(d1,d2)) != 0 ) return c; |
|
if ( !nd_ispot ) { |
|
if ( MPOS(d1) < MPOS(d2) ) return 1; |
|
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
|
} |
|
return 0; |
|
} |
} |
|
|
int ndl_module_lex_compare(UINT *d1,UINT *d2) |
// common for module comparison |
|
int ndl_module_compare(UINT *d1,UINT *d2) |
{ |
{ |
int i,c; |
int c; |
|
|
if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c; |
switch ( nd_module_ordtype ) { |
if ( nd_ispot ) { |
case 0: |
if ( MPOS(d1) < MPOS(d2) ) return 1; |
if ( (c = (*ndl_base_compare_function)(d1,d2)) != 0 ) return c; |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
} |
else if ( MPOS(d1) < MPOS(d2) ) return 1; |
if ( (c = ndl_lex_compare(d1,d2)) != 0 ) return c; |
else return 0; |
if ( !nd_ispot ) { |
break; |
if ( MPOS(d1) < MPOS(d2) ) return 1; |
|
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
|
} |
|
return 0; |
|
} |
|
|
|
int ndl_module_block_compare(UINT *d1,UINT *d2) |
case 1: |
{ |
if ( MPOS(d1) < MPOS(d2) ) return 1; |
int i,c; |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
|
else return (*ndl_base_compare_function)(d1,d2); |
|
break; |
|
|
if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c; |
case 2: // weight -> POT |
if ( nd_ispot ) { |
if ( TD(d1) > TD(d2) ) return 1; |
if ( MPOS(d1) < MPOS(d2) ) return 1; |
else if ( TD(d1) < TD(d2) ) return -1; |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
else if ( MPOS(d1) < MPOS(d2) ) return 1; |
} |
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
if ( (c = ndl_block_compare(d1,d2)) != 0 ) return c; |
else return (*ndl_base_compare_function)(d1,d2); |
if ( !nd_ispot ) { |
break; |
if ( MPOS(d1) < MPOS(d2) ) return 1; |
|
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
|
} |
|
return 0; |
|
} |
|
|
|
int ndl_module_matrix_compare(UINT *d1,UINT *d2) |
default: |
{ |
error("ndl_module_compare : invalid module_ordtype"); |
int i,c; |
return 0; |
|
} |
if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c; |
|
if ( nd_ispot ) { |
|
if ( MPOS(d1) < MPOS(d2) ) return 1; |
|
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
|
} |
|
if ( (c = ndl_matrix_compare(d1,d2)) != 0 ) return c; |
|
if ( !nd_ispot ) { |
|
if ( MPOS(d1) < MPOS(d2) ) return 1; |
|
else if ( MPOS(d1) > MPOS(d2) ) return -1; |
|
} |
|
return 0; |
|
} |
} |
|
|
int ndl_module_composite_compare(UINT *d1,UINT *d2) |
extern DMMstack dmm_stack; |
|
void _addtodl(int n,DL d1,DL d2); |
|
int _eqdl(int n,DL d1,DL d2); |
|
|
|
int ndl_module_schreyer_compare(UINT *m1,UINT *m2) |
{ |
{ |
int i,c; |
int pos1,pos2,t,j; |
|
DMM *in; |
|
DMMstack s; |
|
static DL d1=0; |
|
static DL d2=0; |
|
static int dlen=0; |
|
|
if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c; |
pos1 = MPOS(m1); pos2 = MPOS(m2); |
if ( nd_ispot ) { |
if ( pos1 == pos2 ) return (*ndl_base_compare_function)(m1,m2); |
if ( MPOS(d1) > MPOS(d2) ) return 1; |
if ( nd_nvar > dlen ) { |
else if ( MPOS(d1) < MPOS(d2) ) return -1; |
NEWDL(d1,nd_nvar); |
|
NEWDL(d2,nd_nvar); |
|
dlen = nd_nvar; |
|
} |
|
d1->td = TD(m1); |
|
for ( j = 0; j < nd_nvar; j++ ) d1->d[j] = GET_EXP(m1,j); |
|
d2->td = TD(m2); |
|
for ( j = 0; j < nd_nvar; j++ ) d2->d[j] = GET_EXP(m2,j); |
|
for ( s = dmm_stack; s; s = NEXT(s) ) { |
|
in = s->in; |
|
_addtodl(nd_nvar,in[pos1]->dl,d1); |
|
_addtodl(nd_nvar,in[pos2]->dl,d2); |
|
if ( in[pos1]->pos == in[pos2]->pos && _eqdl(nd_nvar,d1,d2)) { |
|
if ( pos1 < pos2 ) return 1; |
|
else if ( pos1 > pos2 ) return -1; |
|
else return 0; |
} |
} |
if ( (c = ndl_composite_compare(d1,d2)) != 0 ) return c; |
pos1 = in[pos1]->pos; |
if ( !nd_ispot ) { |
pos2 = in[pos2]->pos; |
if ( MPOS(d1) > MPOS(d2) ) return 1; |
if ( pos1 == pos2 ) return (*dl_base_compare_function)(nd_nvar,d1,d2); |
else if ( MPOS(d1) < MPOS(d2) ) return -1; |
} |
} |
// comparison by the bottom order |
return 0; |
LAST: |
|
switch ( nd_base_ordtype ) { |
|
case 0: |
|
t = (*dl_base_compare_function)(nd_nvar,d1,d2); |
|
if ( t ) return t; |
|
else if ( pos1 < pos2 ) return 1; |
|
else if ( pos1 > pos2 ) return -1; |
|
else return 0; |
|
break; |
|
case 1: |
|
if ( pos1 < pos2 ) return 1; |
|
else if ( pos1 > pos2 ) return -1; |
|
else return (*dl_base_compare_function)(nd_nvar,d1,d2); |
|
break; |
|
case 2: |
|
if ( d1->td > d2->td ) return 1; |
|
else if ( d1->td < d2->td ) return -1; |
|
else if ( pos1 < pos2 ) return 1; |
|
else if ( pos1 > pos2 ) return -1; |
|
else return (*dl_base_compare_function)(nd_nvar,d1,d2); |
|
break; |
|
default: |
|
error("ndl_schreyer_compare : invalid base ordtype"); |
|
return 0; |
|
} |
} |
} |
|
|
INLINE int ndl_equal(UINT *d1,UINT *d2) |
INLINE int ndl_equal(UINT *d1,UINT *d2) |
Line 1125 int ndl_check_bound2(int index,UINT *d2) |
|
Line 1160 int ndl_check_bound2(int index,UINT *d2) |
|
INLINE int ndl_hash_value(UINT *d) |
INLINE int ndl_hash_value(UINT *d) |
{ |
{ |
int i; |
int i; |
int r; |
UINT r; |
|
|
r = 0; |
r = 0; |
for ( i = 0; i < nd_wpd; i++ ) |
for ( i = 0; i < nd_wpd; i++ ) |
r = ((r<<16)+d[i])%REDTAB_LEN; |
r = (r*1511+d[i]); |
|
r %= REDTAB_LEN; |
return r; |
return r; |
} |
} |
|
|
Line 1167 INLINE int ndl_find_reducer(UINT *dg) |
|
Line 1203 INLINE int ndl_find_reducer(UINT *dg) |
|
return -1; |
return -1; |
} |
} |
|
|
|
// ret=0,...,nd_psn-1 => reducer found |
|
// ret=nd_psn => reducer not found |
|
// ret=-1 => singular top reducible |
|
|
|
int comp_sig(SIG s1,SIG s2); |
|
void _ndltodl(UINT *ndl,DL dl); |
|
|
|
void print_sig(SIG s) |
|
{ |
|
int i; |
|
|
|
fprintf(asir_out,"<<"); |
|
for ( i = 0; i < nd_nvar; i++ ) { |
|
fprintf(asir_out,"%d",s->dl->d[i]); |
|
if ( i != nd_nvar-1 ) fprintf(asir_out,","); |
|
} |
|
fprintf(asir_out,">>*e%d",s->pos); |
|
} |
|
|
|
INLINE int ndl_find_reducer_s(UINT *dg,SIG sig) |
|
{ |
|
RHist r; |
|
int i,singular,ret,d,k; |
|
static int wpd,nvar; |
|
static SIG quo; |
|
static UINT *tmp; |
|
|
|
if ( !quo || nvar != nd_nvar ) NEWSIG(quo); |
|
if ( wpd != nd_wpd ) { |
|
wpd = nd_wpd; |
|
tmp = (UINT *)MALLOC(wpd*sizeof(UINT)); |
|
} |
|
d = ndl_hash_value(dg); |
|
for ( r = nd_red[d], k = 0; r; r = NEXT(r), k++ ) { |
|
if ( ndl_equal(dg,DL(r)) ) { |
|
return r->index; |
|
} |
|
} |
|
singular = 0; |
|
for ( i = 0; i < nd_psn; i++ ) { |
|
r = nd_psh[i]; |
|
if ( ndl_reducible(dg,DL(r)) ) { |
|
ndl_sub(dg,DL(r),tmp); |
|
_ndltodl(tmp,DL(quo)); |
|
_addtodl(nd_nvar,DL(nd_psh[i]->sig),DL(quo)); |
|
quo->pos = nd_psh[i]->sig->pos; |
|
ret = comp_sig(sig,quo); |
|
if ( ret > 0 ) { singular = 0; break; } |
|
if ( ret == 0 ) { fprintf(asir_out,"s"); fflush(asir_out); singular = 1; } |
|
} |
|
} |
|
if ( singular ) return -1; |
|
else if ( i < nd_psn ) |
|
nd_append_red(dg,i); |
|
return i; |
|
} |
|
|
ND nd_merge(ND p1,ND p2) |
ND nd_merge(ND p1,ND p2) |
{ |
{ |
int n,c; |
int n,c; |
Line 1216 ND nd_add(int mod,ND p1,ND p2) |
|
Line 1309 ND nd_add(int mod,ND p1,ND p2) |
|
ND r; |
ND r; |
NM m1,m2,mr0,mr,s; |
NM m1,m2,mr0,mr,s; |
|
|
|
Nnd_add++; |
if ( !p1 ) return p2; |
if ( !p1 ) return p2; |
else if ( !p2 ) return p1; |
else if ( !p2 ) return p1; |
else if ( mod == -1 ) return nd_add_sf(p1,p2); |
else if ( mod == -1 ) return nd_add_sf(p1,p2); |
Line 1412 ND nd_reduce2(int mod,ND d,ND g,NDV p,NM mul,NDC dn,Ob |
|
Line 1506 ND nd_reduce2(int mod,ND d,ND g,NDV p,NM mul,NDC dn,Ob |
|
} |
} |
*divp = (Obj)credp; |
*divp = (Obj)credp; |
} else { |
} else { |
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
igcd_cofactor(HCZ(g),HCZ(p),&gcd,&cg,&cred); |
chsgnz(cg,&CQ(mul)); |
chsgnz(cg,&CZ(mul)); |
nd_mul_c_q(d,(P)cred); nd_mul_c_q(g,(P)cred); |
nd_mul_c_q(d,(P)cred); nd_mul_c_q(g,(P)cred); |
if ( dn ) { |
if ( dn ) { |
mulz(dn->z,cred,&tq); dn->z = tq; |
mulz(dn->z,cred,&tq); dn->z = tq; |
Line 1424 ND nd_reduce2(int mod,ND d,ND g,NDV p,NM mul,NDC dn,Ob |
|
Line 1518 ND nd_reduce2(int mod,ND d,ND g,NDV p,NM mul,NDC dn,Ob |
|
} |
} |
|
|
/* ret=1 : success, ret=0 : overflow */ |
/* ret=1 : success, ret=0 : overflow */ |
int nd_nf(int mod,ND d,ND g,NDV *ps,int full,NDC dn,ND *rp) |
int nd_nf(int mod,ND d,ND g,NDV *ps,int full,ND *rp) |
{ |
{ |
NM m,mrd,tail; |
NM m,mrd,tail; |
NM mul; |
NM mul; |
Line 1443 int nd_nf(int mod,ND d,ND g,NDV *ps,int full,NDC dn,ND |
|
Line 1537 int nd_nf(int mod,ND d,ND g,NDV *ps,int full,NDC dn,ND |
|
union oNDC hg; |
union oNDC hg; |
P cont; |
P cont; |
|
|
if ( dn ) { |
|
if ( mod ) |
|
dn->m = 1; |
|
else if ( nd_vc ) |
|
dn->r = (R)ONE; |
|
else |
|
dn->z = ONE; |
|
} |
|
if ( !g ) { |
if ( !g ) { |
*rp = d; |
*rp = d; |
return 1; |
return 1; |
Line 1473 int nd_nf(int mod,ND d,ND g,NDV *ps,int full,NDC dn,ND |
|
Line 1559 int nd_nf(int mod,ND d,ND g,NDV *ps,int full,NDC dn,ND |
|
} |
} |
p = nd_demand ? ndv_load(index) : ps[index]; |
p = nd_demand ? ndv_load(index) : ps[index]; |
/* d+g -> div*(d+g)+mul*p */ |
/* d+g -> div*(d+g)+mul*p */ |
g = nd_reduce2(mod,d,g,p,mul,dn,&div); |
g = nd_reduce2(mod,d,g,p,mul,0,&div); |
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
/* Trace=[div,index,mul,ONE] */ |
/* Trace=[div,index,mul,ONE] */ |
STOQ(index,iq); |
STOZ(index,iq); |
nmtodp(mod,mul,&dmul); |
nmtodp(mod,mul,&dmul); |
node = mknode(4,div,iq,dmul,ONE); |
node = mknode(4,div,iq,dmul,ONE); |
} |
} |
Line 1484 int nd_nf(int mod,ND d,ND g,NDV *ps,int full,NDC dn,ND |
|
Line 1570 int nd_nf(int mod,ND d,ND g,NDV *ps,int full,NDC dn,ND |
|
if ( !mod && g && !nd_vc && ((double)(p_mag(HCP(g))) > hmag) ) { |
if ( !mod && g && !nd_vc && ((double)(p_mag(HCP(g))) > hmag) ) { |
hg = HCU(g); |
hg = HCU(g); |
nd_removecont2(d,g); |
nd_removecont2(d,g); |
if ( dn || nd_gentrace ) { |
if ( nd_gentrace ) { |
/* overwrite cont : Trace=[div,index,mul,cont] */ |
/* overwrite cont : Trace=[div,index,mul,cont] */ |
|
/* exact division */ |
cont = ndc_div(mod,hg,HCU(g)); |
cont = ndc_div(mod,hg,HCU(g)); |
if ( dn ) { |
|
if ( nd_vc ) { |
|
divr(nd_vc,(Obj)dn->r,(Obj)cont,&tr); |
|
reductr(nd_vc,(Obj)tr,&tr1); dn->r = (R)tr1; |
|
} else divz(dn->z,(Z)cont,&dn->z); |
|
} |
|
if ( nd_gentrace && !UNIQ(cont) ) ARG3(node) = (pointer)cont; |
if ( nd_gentrace && !UNIQ(cont) ) ARG3(node) = (pointer)cont; |
} |
} |
hmag = ((double)p_mag(HCP(g)))*nd_scale; |
hmag = ((double)p_mag(HCP(g)))*nd_scale; |
Line 1521 int nd_nf(int mod,ND d,ND g,NDV *ps,int full,NDC dn,ND |
|
Line 1602 int nd_nf(int mod,ND d,ND g,NDV *ps,int full,NDC dn,ND |
|
return 1; |
return 1; |
} |
} |
|
|
|
// ret=1 => success |
|
// ret=0 => overflow |
|
// ret=-1 => singular top reducible |
|
|
|
int nd_nf_s(int mod,ND d,ND g,NDV *ps,int full,ND *rp) |
|
{ |
|
NM m,mrd,tail; |
|
NM mul; |
|
int n,sugar,psugar,sugar0,stat,index; |
|
int c,c1,c2,dummy; |
|
RHist h; |
|
NDV p,red; |
|
Q cg,cred,gcd,tq,qq; |
|
Z iq; |
|
DP dmul; |
|
NODE node; |
|
LIST hist; |
|
double hmag; |
|
P tp,tp1; |
|
Obj tr,tr1,div; |
|
union oNDC hg; |
|
P cont; |
|
SIG sig; |
|
|
|
if ( !g ) { |
|
*rp = d; |
|
return 1; |
|
} |
|
if ( !mod ) hmag = ((double)p_mag(HCP(g)))*nd_scale; |
|
|
|
sugar0 = sugar = SG(g); |
|
n = NV(g); |
|
mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); |
|
if ( d ) |
|
for ( tail = BDY(d); NEXT(tail); tail = NEXT(tail) ); |
|
sig = g->sig; |
|
for ( ; g; ) { |
|
index = ndl_find_reducer_s(HDL(g),sig); |
|
if ( index >= 0 && index < nd_psn ) { |
|
// reducer found |
|
h = nd_psh[index]; |
|
ndl_sub(HDL(g),DL(h),DL(mul)); |
|
if ( ndl_check_bound2(index,DL(mul)) ) { |
|
nd_free(g); nd_free(d); |
|
return 0; |
|
} |
|
p = ps[index]; |
|
/* d+g -> div*(d+g)+mul*p */ |
|
g = nd_reduce2(mod,d,g,p,mul,0,&div); |
|
sugar = MAX(sugar,SG(p)+TD(DL(mul))); |
|
if ( !mod && g && ((double)(p_mag(HCP(g))) > hmag) ) { |
|
hg = HCU(g); |
|
nd_removecont2(d,g); |
|
hmag = ((double)p_mag(HCP(g)))*nd_scale; |
|
} |
|
} else if ( index == -1 ) { |
|
// singular top reducible |
|
return -1; |
|
} else if ( !full ) { |
|
*rp = g; |
|
g->sig = sig; |
|
return 1; |
|
} else { |
|
m = BDY(g); |
|
if ( NEXT(m) ) { |
|
BDY(g) = NEXT(m); NEXT(m) = 0; LEN(g)--; |
|
} else { |
|
FREEND(g); g = 0; |
|
} |
|
if ( d ) { |
|
NEXT(tail)=m; tail=m; LEN(d)++; |
|
} else { |
|
MKND(n,m,1,d); tail = BDY(d); |
|
} |
|
} |
|
} |
|
if ( d ) { |
|
SG(d) = sugar; |
|
d->sig = sig; |
|
} |
|
*rp = d; |
|
return 1; |
|
} |
|
|
int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp) |
int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp) |
{ |
{ |
int hindex,index; |
int hindex,index; |
Line 1543 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
Line 1708 int nd_nf_pbucket(int mod,ND g,NDV *ps,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; |
if ( !mod ) hmag = ((double)p_mag((P)HCZ(g)))*nd_scale; |
bucket = create_pbucket(); |
bucket = create_pbucket(); |
add_pbucket(mod,bucket,g); |
add_pbucket(mod,bucket,g); |
d = 0; |
d = 0; |
Line 1586 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
Line 1751 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
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 { |
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
igcd_cofactor(HCZ(g),HCZ(p),&gcd,&cg,&cred); |
chsgnz(cg,&CQ(mul)); |
chsgnz(cg,&CZ(mul)); |
nd_mul_c_q(d,(P)cred); |
nd_mul_c_q(d,(P)cred); |
mulq_pbucket(bucket,cred); |
mulq_pbucket(bucket,cred); |
g = bucket->body[hindex]; |
g = bucket->body[hindex]; |
gmag = (double)p_mag((P)HCQ(g)); |
gmag = (double)p_mag((P)HCZ(g)); |
} |
} |
red = ndv_mul_nm(mod,mul,p); |
red = ndv_mul_nm(mod,mul,p); |
bucket->body[hindex] = nd_remove_head(g); |
bucket->body[hindex] = nd_remove_head(g); |
Line 1607 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
Line 1772 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
return 1; |
return 1; |
} |
} |
nd_removecont2(d,g); |
nd_removecont2(d,g); |
hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
hmag = ((double)p_mag((P)HCZ(g)))*nd_scale; |
add_pbucket(mod,bucket,g); |
add_pbucket(mod,bucket,g); |
} |
} |
} else if ( !full ) { |
} else if ( !full ) { |
Line 1633 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
Line 1798 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
} |
} |
} |
} |
|
|
|
int nd_nf_pbucket_s(int mod,ND g,NDV *ps,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; |
|
Z cg,cred,gcd,zzz; |
|
RHist h; |
|
double hmag,gmag; |
|
int count = 0; |
|
int hcount = 0; |
|
SIG sig; |
|
|
|
if ( !g ) { |
|
*rp = 0; |
|
return 1; |
|
} |
|
sugar = SG(g); |
|
n = NV(g); |
|
if ( !mod ) hmag = ((double)p_mag((P)HCZ(g)))*nd_scale; |
|
bucket = create_pbucket(); |
|
add_pbucket(mod,bucket,g); |
|
d = 0; |
|
mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); |
|
sig = g->sig; |
|
while ( 1 ) { |
|
if ( mod > 0 || mod == -1 ) |
|
hindex = head_pbucket(mod,bucket); |
|
else if ( mod == -2 ) |
|
hindex = head_pbucket_lf(bucket); |
|
else |
|
hindex = head_pbucket_q(bucket); |
|
if ( hindex < 0 ) { |
|
if ( DP_Print > 3 ) printf("(%d %d)",count,hcount); |
|
if ( d ) { |
|
SG(d) = sugar; |
|
d->sig = sig; |
|
} |
|
*rp = d; |
|
return 1; |
|
} |
|
g = bucket->body[hindex]; |
|
index = ndl_find_reducer_s(HDL(g),sig); |
|
if ( index >= 0 && index < nd_psn ) { |
|
count++; |
|
if ( !d ) hcount++; |
|
h = nd_psh[index]; |
|
ndl_sub(HDL(g),DL(h),DL(mul)); |
|
if ( ndl_check_bound2(index,DL(mul)) ) { |
|
nd_free(d); |
|
free_pbucket(bucket); |
|
*rp = 0; |
|
return 0; |
|
} |
|
p = ps[index]; |
|
if ( mod == -1 ) |
|
CM(mul) = _mulsf(_invsf(HCM(p)),_chsgnsf(HCM(g))); |
|
else if ( mod == -2 ) { |
|
Z inv,t; |
|
divlf(ONE,HCZ(p),&inv); |
|
chsgnlf(HCZ(g),&t); |
|
mullf(inv,t,&CZ(mul)); |
|
} else if ( mod ) { |
|
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
|
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
|
} else { |
|
igcd_cofactor(HCZ(g),HCZ(p),&gcd,&cg,&cred); |
|
chsgnz(cg,&CZ(mul)); |
|
nd_mul_c_q(d,(P)cred); |
|
mulq_pbucket(bucket,cred); |
|
g = bucket->body[hindex]; |
|
gmag = (double)p_mag((P)HCZ(g)); |
|
} |
|
red = ndv_mul_nm(mod,mul,p); |
|
bucket->body[hindex] = nd_remove_head(g); |
|
red = nd_remove_head(red); |
|
add_pbucket(mod,bucket,red); |
|
psugar = SG(p)+TD(DL(mul)); |
|
sugar = MAX(sugar,psugar); |
|
if ( !mod && hmag && (gmag > hmag) ) { |
|
g = normalize_pbucket(mod,bucket); |
|
if ( !g ) { |
|
if ( d ) { |
|
SG(d) = sugar; |
|
d->sig = sig; |
|
} |
|
*rp = d; |
|
return 1; |
|
} |
|
nd_removecont2(d,g); |
|
hmag = ((double)p_mag((P)HCZ(g)))*nd_scale; |
|
add_pbucket(mod,bucket,g); |
|
} |
|
} else if ( index == -1 ) { |
|
// singular top reducible |
|
return -1; |
|
} else if ( !full ) { |
|
g = normalize_pbucket(mod,bucket); |
|
if ( g ) { |
|
SG(g) = sugar; |
|
g->sig = sig; |
|
} |
|
*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 NDV, cand : list of NDV */ |
/* input : list of NDV, cand : list of NDV */ |
|
|
int ndv_check_membership(int m,NODE input,int obpe,int oadv,EPOS oepos,NODE cand) |
int ndv_check_membership(int m,NODE input,int obpe,int oadv,EPOS oepos,NODE cand) |
Line 1645 int ndv_check_membership(int m,NODE input,int obpe,int |
|
Line 1936 int ndv_check_membership(int m,NODE input,int obpe,int |
|
Z q; |
Z q; |
LIST list; |
LIST list; |
|
|
ndv_setup(m,0,cand,nd_gentrace?1:0,1); |
ndv_setup(m,0,cand,nd_gentrace?1:0,1,0); |
n = length(cand); |
n = length(cand); |
|
|
if ( nd_gentrace ) { nd_alltracelist = 0; nd_tracelist = 0; } |
if ( nd_gentrace ) { nd_alltracelist = 0; nd_tracelist = 0; } |
|
|
if ( m == -2 ) ndv_mod(m,r); |
if ( m == -2 ) ndv_mod(m,r); |
#endif |
#endif |
d = ndvtond(m,r); |
d = ndvtond(m,r); |
stat = nd_nf(m,0,d,nd_ps,0,0,&nf); |
stat = nd_nf(m,0,d,nd_ps,0,&nf); |
if ( !stat ) { |
if ( !stat ) { |
nd_reconstruct(0,0); |
nd_reconstruct(0,0); |
goto again; |
goto again; |
|
|
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
nd_tracelist = reverse_node(nd_tracelist); |
nd_tracelist = reverse_node(nd_tracelist); |
MKLIST(list,nd_tracelist); |
MKLIST(list,nd_tracelist); |
STOQ(i,q); s = mknode(2,q,list); MKLIST(list,s); |
STOZ(i,q); s = mknode(2,q,list); MKLIST(list,s); |
MKNODE(s,list,nd_alltracelist); |
MKNODE(s,list,nd_alltracelist); |
nd_alltracelist = s; nd_tracelist = 0; |
nd_alltracelist = s; nd_tracelist = 0; |
} |
} |
Line 1868 int head_pbucket_q(PGeoBucket g) |
|
Line 2159 int head_pbucket_q(PGeoBucket g) |
|
if ( j < 0 ) { |
if ( j < 0 ) { |
j = i; |
j = i; |
gj = g->body[j]; |
gj = g->body[j]; |
sum = HCQ(gj); |
sum = HCZ(gj); |
} else { |
} else { |
nv = NV(gi); |
nv = NV(gi); |
c = DL_COMPARE(HDL(gi),HDL(gj)); |
c = DL_COMPARE(HDL(gi),HDL(gj)); |
if ( c > 0 ) { |
if ( c > 0 ) { |
if ( sum ) HCQ(gj) = sum; |
if ( sum ) HCZ(gj) = sum; |
else g->body[j] = nd_remove_head(gj); |
else g->body[j] = nd_remove_head(gj); |
j = i; |
j = i; |
gj = g->body[j]; |
gj = g->body[j]; |
sum = HCQ(gj); |
sum = HCZ(gj); |
} else if ( c == 0 ) { |
} else if ( c == 0 ) { |
addz(sum,HCQ(gi),&t); |
addz(sum,HCZ(gi),&t); |
sum = t; |
sum = t; |
g->body[i] = nd_remove_head(gi); |
g->body[i] = nd_remove_head(gi); |
} |
} |
Line 1887 int head_pbucket_q(PGeoBucket g) |
|
Line 2178 int head_pbucket_q(PGeoBucket g) |
|
} |
} |
if ( j < 0 ) return -1; |
if ( j < 0 ) return -1; |
else if ( sum ) { |
else if ( sum ) { |
HCQ(gj) = sum; |
HCZ(gj) = sum; |
return j; |
return j; |
} else |
} else |
g->body[j] = nd_remove_head(gj); |
g->body[j] = nd_remove_head(gj); |
Line 2012 void register_hcf(NDV p) |
|
Line 2303 void register_hcf(NDV p) |
|
|
|
int do_diagonalize(int sugar,int m) |
int do_diagonalize(int sugar,int m) |
{ |
{ |
int i,nh,stat; |
int i,nh,stat; |
NODE r,g,t; |
NODE r,g,t; |
ND h,nf,s,head; |
ND h,nf,s,head; |
NDV nfv; |
NDV nfv; |
Q q; |
Q q; |
P nm,nmp,dn,mnp,dnp,cont,cont1; |
P nm,nmp,dn,mnp,dnp,cont,cont1; |
union oNDC hc; |
union oNDC hc; |
NODE node; |
NODE node; |
LIST l; |
LIST l; |
Z iq; |
Z iq; |
|
|
for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) { |
for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) { |
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
/* Trace = [1,index,1,1] */ |
/* Trace = [1,index,1,1] */ |
STOQ(i,iq); node = mknode(4,ONE,iq,ONE,ONE); |
STOZ(i,iq); node = mknode(4,ONE,iq,ONE,ONE); |
MKLIST(l,node); MKNODE(nd_tracelist,l,0); |
MKLIST(l,node); MKNODE(nd_tracelist,l,0); |
} |
|
if ( nd_demand ) |
|
nfv = ndv_load(i); |
|
else |
|
nfv = nd_ps[i]; |
|
s = ndvtond(m,nfv); |
|
s = nd_separate_head(s,&head); |
|
stat = nd_nf(m,head,s,nd_ps,1,0,&nf); |
|
if ( !stat ) return 0; |
|
ndv_free(nfv); |
|
hc = HCU(nf); nd_removecont(m,nf); |
|
cont = ndc_div(m,hc,HCU(nf)); |
|
if ( nd_gentrace ) finalize_tracelist(i,cont); |
|
nfv = ndtondv(m,nf); |
|
nd_free(nf); |
|
nd_bound[i] = ndv_compute_bound(nfv); |
|
if ( !m ) register_hcf(nfv); |
|
if ( nd_demand ) { |
|
ndv_save(nfv,i); |
|
ndv_free(nfv); |
|
} else |
|
nd_ps[i] = nfv; |
|
} |
} |
return 1; |
if ( nd_demand ) |
|
nfv = ndv_load(i); |
|
else |
|
nfv = nd_ps[i]; |
|
s = ndvtond(m,nfv); |
|
s = nd_separate_head(s,&head); |
|
stat = nd_nf(m,head,s,nd_ps,1,&nf); |
|
if ( !stat ) return 0; |
|
ndv_free(nfv); |
|
hc = HCU(nf); nd_removecont(m,nf); |
|
/* exact division */ |
|
cont = ndc_div(m,hc,HCU(nf)); |
|
if ( nd_gentrace ) finalize_tracelist(i,cont); |
|
nfv = ndtondv(m,nf); |
|
nd_free(nf); |
|
nd_bound[i] = ndv_compute_bound(nfv); |
|
if ( !m ) register_hcf(nfv); |
|
if ( nd_demand ) { |
|
ndv_save(nfv,i); |
|
ndv_free(nfv); |
|
} else |
|
nd_ps[i] = nfv; |
|
} |
|
return 1; |
} |
} |
|
|
LIST compute_splist() |
LIST compute_splist() |
Line 2069 LIST compute_splist() |
|
Line 2361 LIST compute_splist() |
|
} |
} |
for ( t = d, tn0 = 0; t; t = NEXT(t) ) { |
for ( t = d, tn0 = 0; t; t = NEXT(t) ) { |
NEXTNODE(tn0,tn); |
NEXTNODE(tn0,tn); |
STOQ(t->i1,i1); STOQ(t->i2,i2); |
STOZ(t->i1,i1); STOZ(t->i2,i2); |
node = mknode(2,i1,i2); MKLIST(l0,node); |
node = mknode(2,i1,i2); MKLIST(l0,node); |
BDY(tn) = l0; |
BDY(tn) = l0; |
} |
} |
Line 2081 LIST compute_splist() |
|
Line 2373 LIST compute_splist() |
|
|
|
NODE nd_gb(int m,int ishomo,int checkonly,int gensyz,int **indp) |
NODE nd_gb(int m,int ishomo,int checkonly,int gensyz,int **indp) |
{ |
{ |
int i,nh,sugar,stat; |
int i,nh,sugar,stat; |
NODE r,g,t; |
NODE r,g,t; |
ND_pairs d; |
ND_pairs d; |
ND_pairs l; |
ND_pairs l; |
ND h,nf,s,head,nf1; |
ND h,nf,s,head,nf1; |
NDV nfv; |
NDV nfv; |
Z q; |
Z q; |
union oNDC dn,hc; |
union oNDC dn,hc; |
int diag_count = 0; |
int diag_count = 0; |
P cont; |
P cont; |
LIST list; |
LIST list; |
|
struct oEGT eg1,eg2,eg_update; |
|
|
g = 0; d = 0; |
init_eg(&eg_update); |
for ( i = 0; i < nd_psn; i++ ) { |
Nnd_add = 0; |
d = update_pairs(d,g,i,gensyz); |
g = 0; d = 0; |
g = update_base(g,i); |
for ( i = 0; i < nd_psn; i++ ) { |
} |
d = update_pairs(d,g,i,gensyz); |
sugar = 0; |
g = update_base(g,i); |
while ( d ) { |
} |
|
sugar = 0; |
|
while ( d ) { |
again: |
again: |
l = nd_minp(d,&d); |
l = nd_minp(d,&d); |
if ( MaxDeg > 0 && SG(l) > MaxDeg ) break; |
if ( MaxDeg > 0 && SG(l) > MaxDeg ) break; |
if ( SG(l) != sugar ) { |
if ( SG(l) != sugar ) { |
if ( ishomo ) { |
if ( ishomo ) { |
diag_count = 0; |
diag_count = 0; |
stat = do_diagonalize(sugar,m); |
stat = do_diagonalize(sugar,m); |
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(0,d); |
|
goto again; |
|
} |
|
} |
|
sugar = SG(l); |
|
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
|
} |
|
stat = nd_sp(m,0,l,&h); |
|
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
d = nd_reconstruct(0,d); |
d = nd_reconstruct(0,d); |
goto again; |
goto again; |
} |
} |
|
} |
|
sugar = SG(l); |
|
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
|
} |
|
stat = nd_sp(m,0,l,&h); |
|
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(0,d); |
|
goto again; |
|
} |
#if USE_GEOBUCKET |
#if USE_GEOBUCKET |
stat = (m&&!nd_gentrace)?nd_nf_pbucket(m,h,nd_ps,!Top,&nf) |
stat = (m&&!nd_gentrace)?nd_nf_pbucket(m,h,nd_ps,!Top,&nf) |
:nd_nf(m,0,h,nd_ps,!Top,0,&nf); |
:nd_nf(m,0,h,nd_ps,!Top,&nf); |
#else |
#else |
stat = nd_nf(m,0,h,nd_ps,!Top,0,&nf); |
stat = nd_nf(m,0,h,nd_ps,!Top,&nf); |
#endif |
#endif |
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
d = nd_reconstruct(0,d); |
d = nd_reconstruct(0,d); |
goto again; |
goto again; |
} else if ( nf ) { |
} else if ( nf ) { |
if ( checkonly || gensyz ) return 0; |
if ( checkonly || gensyz ) return 0; |
if ( nd_newelim ) { |
if ( nd_newelim ) { |
if ( nd_module ) { |
if ( nd_module ) { |
if ( MPOS(HDL(nf)) > 1 ) return 0; |
if ( MPOS(HDL(nf)) > 1 ) return 0; |
} else if ( !(HDL(nf)[nd_exporigin] & nd_mask[0]) ) return 0; |
} else if ( !(HDL(nf)[nd_exporigin] & nd_mask[0]) ) return 0; |
} |
} |
if ( DP_Print ) { printf("+"); fflush(stdout); } |
if ( DP_Print ) { printf("+"); fflush(stdout); } |
hc = HCU(nf); |
hc = HCU(nf); |
nd_removecont(m,nf); |
nd_removecont(m,nf); |
if ( !m && nd_nalg ) { |
if ( !m && nd_nalg ) { |
nd_monic(0,&nf); |
nd_monic(0,&nf); |
nd_removecont(m,nf); |
nd_removecont(m,nf); |
} |
} |
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
|
/* exact division */ |
cont = ndc_div(m,hc,HCU(nf)); |
cont = ndc_div(m,hc,HCU(nf)); |
if ( m || !UNIQ(cont) ) { |
if ( m || !UNIQ(cont) ) { |
t = mknode(4,NULLP,NULLP,NULLP,cont); |
t = mknode(4,NULLP,NULLP,NULLP,cont); |
MKLIST(list,t); MKNODE(t,list,nd_tracelist); |
MKLIST(list,t); MKNODE(t,list,nd_tracelist); |
nd_tracelist = t; |
nd_tracelist = t; |
} |
} |
} |
|
nfv = ndtondv(m,nf); nd_free(nf); |
|
nh = ndv_newps(m,nfv,0,0); |
|
if ( !m && (ishomo && ++diag_count == diag_period) ) { |
|
diag_count = 0; |
|
stat = do_diagonalize(sugar,m); |
|
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(1,d); |
|
goto again; |
|
} |
|
} |
|
d = update_pairs(d,g,nh,0); |
|
g = update_base(g,nh); |
|
FREENDP(l); |
|
} else { |
|
if ( nd_gentrace && gensyz ) { |
|
nd_tracelist = reverse_node(nd_tracelist); |
|
MKLIST(list,nd_tracelist); |
|
STOQ(-1,q); t = mknode(2,q,list); MKLIST(list,t); |
|
MKNODE(t,list,nd_alltracelist); |
|
nd_alltracelist = t; nd_tracelist = 0; |
|
} |
} |
if ( DP_Print ) { printf("."); fflush(stdout); } |
nfv = ndtondv(m,nf); nd_free(nf); |
FREENDP(l); |
nh = ndv_newps(m,nfv,0); |
|
if ( !m && (ishomo && ++diag_count == diag_period) ) { |
|
diag_count = 0; |
|
stat = do_diagonalize(sugar,m); |
|
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(1,d); |
|
goto again; |
} |
} |
} |
} |
conv_ilist(nd_demand,0,g,indp); |
get_eg(&eg1); |
if ( !checkonly && DP_Print ) { printf("nd_gb done.\n"); fflush(stdout); } |
d = update_pairs(d,g,nh,0); |
|
get_eg(&eg2); add_eg(&eg_update,&eg1,&eg2); |
|
g = update_base(g,nh); |
|
FREENDP(l); |
|
} else { |
|
if ( nd_gentrace && gensyz ) { |
|
nd_tracelist = reverse_node(nd_tracelist); |
|
MKLIST(list,nd_tracelist); |
|
STOZ(-1,q); t = mknode(2,q,list); MKLIST(list,t); |
|
MKNODE(t,list,nd_alltracelist); |
|
nd_alltracelist = t; nd_tracelist = 0; |
|
} |
|
if ( DP_Print ) { printf("."); fflush(stdout); } |
|
FREENDP(l); |
|
} |
|
} |
|
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); } |
|
print_eg("update",&eg_update); |
return g; |
return g; |
} |
} |
|
|
|
ND_pairs update_pairs_s(ND_pairs d,int t,NODE *syz); |
|
ND_pairs nd_newpairs_s(int t ,NODE *syz); |
|
|
|
int nd_nf_pbucket_s(int mod,ND g,NDV *ps,int full,ND *nf); |
|
int nd_nf_s(int mod,ND d,ND g,NDV *ps,int full,ND *nf); |
|
|
|
void _copydl(int n,DL d1,DL d2); |
|
void _subfromdl(int n,DL d1,DL d2); |
|
extern int (*cmpdl)(int n,DL d1,DL d2); |
|
|
|
NODE insert_sig(NODE l,SIG s) |
|
{ |
|
int pos; |
|
DL sig; |
|
struct oNODE root; |
|
NODE p,prev,r; |
|
SIG t; |
|
|
|
pos = s->pos; sig = DL(s); |
|
root.next = l; prev = &root; |
|
for ( p = l; p; p = p->next ) { |
|
t = (SIG)p->body; |
|
if ( t->pos == pos ) { |
|
if ( _dl_redble(DL(t),sig,nd_nvar) ) |
|
return root.next; |
|
else if ( _dl_redble(sig,DL(t),nd_nvar) ) |
|
// remove p |
|
prev->next = p->next; |
|
} else |
|
prev = p; |
|
} |
|
NEWNODE(r); r->body = (pointer)s; r->next = 0; |
|
for ( p = &root; p->next; p = p->next ); |
|
p->next = r; |
|
// r->next = root.next; |
|
// return r; |
|
return root.next; |
|
} |
|
|
|
ND_pairs remove_spair_s(ND_pairs d,SIG sig) |
|
{ |
|
struct oND_pairs root; |
|
ND_pairs prev,p; |
|
SIG spsig; |
|
|
|
root.next = d; |
|
prev = &root; p = d; |
|
while ( p ) { |
|
spsig = p->sig; |
|
if ( sig->pos == spsig->pos && _dl_redble(DL(sig),DL(spsig),nd_nvar) ) { |
|
// remove p |
|
prev->next = p->next; |
|
Nsyz++; |
|
} else |
|
prev = p; |
|
p = p->next; |
|
} |
|
return (ND_pairs)root.next; |
|
} |
|
|
|
int _dl_redble_ext(DL,DL,DL,int); |
|
|
|
int small_lcm(ND_pairs l) |
|
{ |
|
SIG sig; |
|
int i; |
|
NODE t; |
|
static DL lcm,mul,quo; |
|
static int nvar; |
|
|
|
if ( nvar < nd_nvar ) { |
|
nvar = nd_nvar; NEWDL(lcm,nvar); NEWDL(quo,nvar); NEWDL(mul,nvar); |
|
} |
|
sig = l->sig; |
|
_ndltodl(l->lcm,lcm); |
|
#if 0 |
|
for ( i = 0; i < nd_psn; i++ ) { |
|
if ( sig->pos == nd_psh[i]->sig->pos && |
|
_dl_redble_ext(DL(nd_psh[i]->sig),DL(sig),quo,nd_nvar) ) { |
|
_ndltodl(DL(nd_psh[i]),mul); |
|
_addtodl(nd_nvar,quo,mul); |
|
if ( (*cmpdl)(nd_nvar,lcm,mul) > 0 ) |
|
break; |
|
} |
|
} |
|
if ( i < nd_psn ) return 1; |
|
else return 0; |
|
#else |
|
for ( t = nd_sba_pos[sig->pos]; t; t = t->next ) { |
|
i = (long)BDY(t); |
|
if ( _dl_redble_ext(DL(nd_psh[i]->sig),DL(sig),quo,nd_nvar) ) { |
|
_ndltodl(DL(nd_psh[i]),mul); |
|
_addtodl(nd_nvar,quo,mul); |
|
if ( (*cmpdl)(nd_nvar,lcm,mul) > 0 ) |
|
break; |
|
} |
|
} |
|
if ( t ) return 1; |
|
else return 0; |
|
#endif |
|
} |
|
|
|
ND_pairs remove_large_lcm(ND_pairs d) |
|
{ |
|
struct oND_pairs root; |
|
ND_pairs prev,p; |
|
|
|
root.next = d; |
|
prev = &root; p = d; |
|
while ( p ) { |
|
if ( small_lcm(p) ) { |
|
// remove p |
|
prev->next = p->next; |
|
} else |
|
prev = p; |
|
p = p->next; |
|
} |
|
return (ND_pairs)root.next; |
|
} |
|
|
|
struct oEGT eg_create,eg_newpairs,eg_merge; |
|
|
|
NODE conv_ilist_s(int demand,int trace,int **indp); |
|
|
|
NODE nd_sba_buch(int m,int ishomo,int **indp) |
|
{ |
|
int i,j,nh,sugar,stat; |
|
NODE r,t,g; |
|
ND_pairs d; |
|
ND_pairs l; |
|
ND h,nf,s,head,nf1; |
|
NDV nfv; |
|
Z q; |
|
union oNDC dn,hc; |
|
P cont; |
|
LIST list; |
|
SIG sig; |
|
NODE *syzlist; |
|
int Nredundant; |
|
DL lcm,quo,mul; |
|
struct oEGT eg1,eg2,eg_update,eg_remove,eg_large; |
|
|
|
init_eg(&eg_remove); |
|
syzlist = (NODE *)MALLOC(nd_psn*sizeof(NODE)); |
|
Nsyz = 0; |
|
Nnd_add = 0; |
|
Nredundant = 0; |
|
d = 0; |
|
for ( i = 0; i < nd_psn; i++ ) { |
|
d = update_pairs_s(d,i,syzlist); |
|
} |
|
for ( i = 0; i < nd_psn; i++ ) |
|
for ( j = i+1; j < nd_psn; j++ ) { |
|
NEWSIG(sig); sig->pos = j; |
|
_copydl(nd_nvar,nd_sba_hm[i],sig->dl); |
|
syzlist[sig->pos] = insert_sig(syzlist[sig->pos],sig); |
|
} |
|
sugar = 0; |
|
NEWDL(lcm,nd_nvar); NEWDL(quo,nd_nvar); NEWDL(mul,nd_nvar); |
|
init_eg(&eg_create); |
|
init_eg(&eg_merge); |
|
init_eg(&eg_large); |
|
while ( d ) { |
|
again: |
|
if ( DP_Print ) { |
|
int len; |
|
ND_pairs td; |
|
for ( td = d, len=0; td; td = td->next, len++) |
|
; |
|
if ( !(len%100) ) fprintf(asir_out,"(%d)",len); |
|
} |
|
l = d; d = d->next; |
|
if ( small_lcm(l) ) { |
|
if ( DP_Print ) fprintf(asir_out,"M"); |
|
Nredundant++; |
|
continue; |
|
} |
|
if ( SG(l) != sugar ) { |
|
sugar = SG(l); |
|
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
|
} |
|
sig = l->sig; |
|
stat = nd_sp(m,0,l,&h); |
|
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(0,d); |
|
goto again; |
|
} |
|
#if USE_GEOBUCKET |
|
stat = m?nd_nf_pbucket_s(m,h,nd_ps,!Top,&nf):nd_nf_s(m,0,h,nd_ps,!Top,&nf); |
|
#else |
|
stat = nd_nf_s(m,0,h,nd_ps,!Top,&nf); |
|
#endif |
|
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(0,d); |
|
goto again; |
|
} else if ( stat == -1 ) { |
|
if ( DP_Print ) { printf("S"); fflush(stdout); } |
|
FREENDP(l); |
|
} else if ( nf ) { |
|
if ( DP_Print ) { printf("+"); fflush(stdout); } |
|
hc = HCU(nf); |
|
nd_removecont(m,nf); |
|
nfv = ndtondv(m,nf); nd_free(nf); |
|
nh = ndv_newps(m,nfv,0); |
|
|
|
d = update_pairs_s(d,nh,syzlist); |
|
nd_sba_pos[sig->pos] = append_one(nd_sba_pos[sig->pos],nh); |
|
FREENDP(l); |
|
} else { |
|
// 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); |
|
if ( DP_Print ) { printf("."); fflush(stdout); } |
|
FREENDP(l); |
|
} |
|
} |
|
g = conv_ilist_s(nd_demand,0,indp); |
|
if ( DP_Print ) { |
|
printf("\nnd_sba done. nd_add=%d,Nsyz=%d,Nredundant=%d\n",Nnd_add,Nsyz,Nredundant); |
|
fflush(stdout); |
|
print_eg("create",&eg_create); |
|
print_eg("merge",&eg_merge); |
|
print_eg("remove",&eg_remove); |
|
printf("\n"); |
|
} |
|
return g; |
|
} |
|
|
/* splist = [[i1,i2],...] */ |
/* splist = [[i1,i2],...] */ |
|
|
int check_splist(int m,NODE splist) |
int check_splist(int m,NODE splist) |
Line 2196 int check_splist(int m,NODE splist) |
|
Line 2727 int check_splist(int m,NODE splist) |
|
|
|
for ( d = 0, t = splist; t; t = NEXT(t) ) { |
for ( d = 0, t = splist; t; t = NEXT(t) ) { |
p = BDY((LIST)BDY(t)); |
p = BDY((LIST)BDY(t)); |
NEXTND_pairs(d,r); |
NEXTND_pairs(d,r); |
r->i1 = QTOS((Q)ARG0(p)); r->i2 = QTOS((Q)ARG1(p)); |
r->i1 = ZTOS((Q)ARG0(p)); r->i2 = ZTOS((Q)ARG1(p)); |
ndl_lcm(DL(nd_psh[r->i1]),DL(nd_psh[r->i2]),r->lcm); |
ndl_lcm(DL(nd_psh[r->i1]),DL(nd_psh[r->i2]),r->lcm); |
SG(r) = TD(LCM(r)); /* XXX */ |
SG(r) = TD(LCM(r)); /* XXX */ |
} |
} |
if ( d ) NEXT(r) = 0; |
if ( d ) NEXT(r) = 0; |
|
|
while ( d ) { |
while ( d ) { |
again: |
again: |
l = nd_minp(d,&d); |
l = nd_minp(d,&d); |
stat = nd_sp(m,0,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(0,d); |
d = nd_reconstruct(0,d); |
goto again; |
goto again; |
} |
|
stat = nd_nf(m,0,h,nd_ps,!Top,0,&nf); |
|
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(0,d); |
|
goto again; |
|
} else if ( nf ) return 0; |
|
if ( DP_Print) { printf("."); fflush(stdout); } |
|
} |
} |
|
stat = nd_nf(m,0,h,nd_ps,!Top,&nf); |
|
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(0,d); |
|
goto again; |
|
} else if ( nf ) return 0; |
|
if ( DP_Print) { printf("."); fflush(stdout); } |
|
} |
if ( DP_Print) { printf("done.\n"); fflush(stdout); } |
if ( DP_Print) { printf("done.\n"); fflush(stdout); } |
return 1; |
return 1; |
} |
} |
|
|
int check_splist_f4(int m,NODE splist) |
int check_splist_f4(int m,NODE splist) |
{ |
{ |
UINT *s0vect; |
UINT *s0vect; |
PGeoBucket bucket; |
PGeoBucket bucket; |
NODE p,rp0,t; |
NODE p,rp0,t; |
ND_pairs d,r,l,ll; |
ND_pairs d,r,l,ll; |
int col,stat; |
int col,stat; |
|
|
for ( d = 0, t = splist; t; t = NEXT(t) ) { |
for ( d = 0, t = splist; t; t = NEXT(t) ) { |
p = BDY((LIST)BDY(t)); |
p = BDY((LIST)BDY(t)); |
NEXTND_pairs(d,r); |
NEXTND_pairs(d,r); |
r->i1 = QTOS((Q)ARG0(p)); r->i2 = QTOS((Q)ARG1(p)); |
r->i1 = ZTOS((Q)ARG0(p)); r->i2 = ZTOS((Q)ARG1(p)); |
ndl_lcm(DL(nd_psh[r->i1]),DL(nd_psh[r->i2]),r->lcm); |
ndl_lcm(DL(nd_psh[r->i1]),DL(nd_psh[r->i2]),r->lcm); |
SG(r) = TD(LCM(r)); /* XXX */ |
SG(r) = TD(LCM(r)); /* XXX */ |
} |
} |
if ( d ) NEXT(r) = 0; |
if ( d ) NEXT(r) = 0; |
|
|
while ( d ) { |
while ( d ) { |
l = nd_minsugarp(d,&d); |
l = nd_minsugarp(d,&d); |
bucket = create_pbucket(); |
bucket = create_pbucket(); |
stat = nd_sp_f4(m,0,l,bucket); |
stat = nd_sp_f4(m,0,l,bucket); |
if ( !stat ) { |
if ( !stat ) { |
for ( ll = l; NEXT(ll); ll = NEXT(ll) ); |
for ( ll = l; NEXT(ll); ll = NEXT(ll) ); |
NEXT(ll) = d; d = l; |
NEXT(ll) = d; d = l; |
d = nd_reconstruct(0,d); |
d = nd_reconstruct(0,d); |
continue; |
continue; |
} |
|
if ( bucket->m < 0 ) continue; |
|
col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0); |
|
if ( !col ) { |
|
for ( ll = l; NEXT(ll); ll = NEXT(ll) ); |
|
NEXT(ll) = d; d = l; |
|
d = nd_reconstruct(0,d); |
|
continue; |
|
} |
|
if ( nd_f4_red(m,l,0,s0vect,col,rp0,0) ) return 0; |
|
} |
} |
return 1; |
if ( bucket->m < 0 ) continue; |
|
col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0); |
|
if ( !col ) { |
|
for ( ll = l; NEXT(ll); ll = NEXT(ll) ); |
|
NEXT(ll) = d; d = l; |
|
d = nd_reconstruct(0,d); |
|
continue; |
|
} |
|
if ( nd_f4_red(m,l,0,s0vect,col,rp0,0) ) return 0; |
|
} |
|
return 1; |
} |
} |
|
|
int do_diagonalize_trace(int sugar,int m) |
int do_diagonalize_trace(int sugar,int m) |
{ |
{ |
int i,nh,stat; |
int i,nh,stat; |
NODE r,g,t; |
NODE r,g,t; |
ND h,nf,nfq,s,head; |
ND h,nf,nfq,s,head; |
NDV nfv,nfqv; |
NDV nfv,nfqv; |
Q q,den,num; |
Q q,den,num; |
union oNDC hc; |
union oNDC hc; |
NODE node; |
NODE node; |
LIST l; |
LIST l; |
Z iq; |
Z iq; |
P cont,cont1; |
P cont,cont1; |
|
|
for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) { |
for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) { |
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
/* Trace = [1,index,1,1] */ |
/* Trace = [1,index,1,1] */ |
STOQ(i,iq); node = mknode(4,ONE,iq,ONE,ONE); |
STOZ(i,iq); node = mknode(4,ONE,iq,ONE,ONE); |
MKLIST(l,node); MKNODE(nd_tracelist,l,0); |
MKLIST(l,node); MKNODE(nd_tracelist,l,0); |
} |
} |
/* for nd_ps */ |
/* for nd_ps */ |
s = ndvtond(m,nd_ps[i]); |
s = ndvtond(m,nd_ps[i]); |
s = nd_separate_head(s,&head); |
s = nd_separate_head(s,&head); |
stat = nd_nf_pbucket(m,s,nd_ps,1,&nf); |
stat = nd_nf_pbucket(m,s,nd_ps,1,&nf); |
if ( !stat ) return 0; |
if ( !stat ) return 0; |
nf = nd_add(m,head,nf); |
nf = nd_add(m,head,nf); |
ndv_free(nd_ps[i]); |
ndv_free(nd_ps[i]); |
nd_ps[i] = ndtondv(m,nf); |
nd_ps[i] = ndtondv(m,nf); |
nd_free(nf); |
nd_free(nf); |
|
|
/* for nd_ps_trace */ |
/* for nd_ps_trace */ |
if ( nd_demand ) |
if ( nd_demand ) |
nfv = ndv_load(i); |
nfv = ndv_load(i); |
else |
else |
nfv = nd_ps_trace[i]; |
nfv = nd_ps_trace[i]; |
s = ndvtond(0,nfv); |
s = ndvtond(0,nfv); |
s = nd_separate_head(s,&head); |
s = nd_separate_head(s,&head); |
stat = nd_nf(0,head,s,nd_ps_trace,1,0,&nf); |
stat = nd_nf(0,head,s,nd_ps_trace,1,&nf); |
if ( !stat ) return 0; |
if ( !stat ) return 0; |
ndv_free(nfv); |
ndv_free(nfv); |
hc = HCU(nf); nd_removecont(0,nf); |
hc = HCU(nf); nd_removecont(0,nf); |
|
/* exact division */ |
cont = ndc_div(0,hc,HCU(nf)); |
cont = ndc_div(0,hc,HCU(nf)); |
if ( nd_gentrace ) finalize_tracelist(i,cont); |
if ( nd_gentrace ) finalize_tracelist(i,cont); |
nfv = ndtondv(0,nf); |
nfv = ndtondv(0,nf); |
nd_free(nf); |
nd_free(nf); |
nd_bound[i] = ndv_compute_bound(nfv); |
nd_bound[i] = ndv_compute_bound(nfv); |
register_hcf(nfv); |
register_hcf(nfv); |
if ( nd_demand ) { |
if ( nd_demand ) { |
ndv_save(nfv,i); |
ndv_save(nfv,i); |
ndv_free(nfv); |
ndv_free(nfv); |
} else |
} else |
nd_ps_trace[i] = nfv; |
nd_ps_trace[i] = nfv; |
} |
} |
return 1; |
return 1; |
} |
} |
|
|
static struct oEGT eg_invdalg; |
static struct oEGT eg_invdalg; |
Line 2335 void nd_subst_vector(VL vl,P p,NODE subst,P *r) |
|
Line 2867 void nd_subst_vector(VL vl,P p,NODE subst,P *r) |
|
|
|
NODE nd_gb_trace(int m,int ishomo,int **indp) |
NODE nd_gb_trace(int m,int ishomo,int **indp) |
{ |
{ |
int i,nh,sugar,stat; |
int i,nh,sugar,stat; |
NODE r,g,t; |
NODE r,g,t; |
ND_pairs d; |
ND_pairs d; |
ND_pairs l; |
ND_pairs l; |
ND h,nf,nfq,s,head; |
ND h,nf,nfq,s,head; |
NDV nfv,nfqv; |
NDV nfv,nfqv; |
Z q,den,num; |
Z q,den,num; |
P hc; |
P hc; |
union oNDC dn,hnfq; |
union oNDC dn,hnfq; |
struct oEGT eg_monic,egm0,egm1; |
struct oEGT eg_monic,egm0,egm1; |
int diag_count = 0; |
int diag_count = 0; |
P cont; |
P cont; |
LIST list; |
LIST list; |
|
|
init_eg(&eg_monic); |
init_eg(&eg_monic); |
init_eg(&eg_invdalg); |
init_eg(&eg_invdalg); |
init_eg(&eg_le); |
init_eg(&eg_le); |
g = 0; d = 0; |
g = 0; d = 0; |
for ( i = 0; i < nd_psn; i++ ) { |
for ( i = 0; i < nd_psn; i++ ) { |
d = update_pairs(d,g,i,0); |
d = update_pairs(d,g,i,0); |
g = update_base(g,i); |
g = update_base(g,i); |
} |
} |
sugar = 0; |
sugar = 0; |
while ( d ) { |
while ( d ) { |
again: |
again: |
l = nd_minp(d,&d); |
l = nd_minp(d,&d); |
if ( MaxDeg > 0 && SG(l) > MaxDeg ) break; |
if ( MaxDeg > 0 && SG(l) > MaxDeg ) break; |
if ( SG(l) != sugar ) { |
if ( SG(l) != sugar ) { |
#if 1 |
#if 1 |
if ( ishomo ) { |
if ( ishomo ) { |
if ( DP_Print > 2 ) fprintf(asir_out,"|"); |
if ( DP_Print > 2 ) fprintf(asir_out,"|"); |
stat = do_diagonalize_trace(sugar,m); |
stat = do_diagonalize_trace(sugar,m); |
if ( DP_Print > 2 ) fprintf(asir_out,"|"); |
if ( DP_Print > 2 ) fprintf(asir_out,"|"); |
diag_count = 0; |
diag_count = 0; |
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(1,d); |
|
goto again; |
|
} |
|
} |
|
#endif |
|
sugar = SG(l); |
|
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
|
} |
|
stat = nd_sp(m,0,l,&h); |
|
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
d = nd_reconstruct(1,d); |
d = nd_reconstruct(1,d); |
goto again; |
goto again; |
} |
} |
|
} |
|
#endif |
|
sugar = SG(l); |
|
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
|
} |
|
stat = nd_sp(m,0,l,&h); |
|
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(1,d); |
|
goto again; |
|
} |
#if USE_GEOBUCKET |
#if USE_GEOBUCKET |
stat = nd_nf_pbucket(m,h,nd_ps,!Top,&nf); |
stat = nd_nf_pbucket(m,h,nd_ps,!Top,&nf); |
#else |
#else |
stat = nd_nf(m,0,h,nd_ps,!Top,0,&nf); |
stat = nd_nf(m,0,h,nd_ps,!Top,&nf); |
#endif |
#endif |
if ( !stat ) { |
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(1,d); |
|
goto again; |
|
} else if ( nf ) { |
|
if ( nd_demand ) { |
|
nfqv = ndv_load(nd_psn); |
|
nfq = ndvtond(0,nfqv); |
|
} else |
|
nfq = 0; |
|
if ( !nfq ) { |
|
if ( !nd_sp(0,1,l,&h) || !nd_nf(0,0,h,nd_ps_trace,!Top,&nfq) ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(1,d); |
|
goto again; |
|
} |
|
} |
|
if ( nfq ) { |
|
/* m|HC(nfq) => failure */ |
|
if ( nd_vc ) { |
|
nd_subst_vector(nd_vc,HCP(nfq),nd_subst,&hc); q = (Z)hc; |
|
} else |
|
q = HCZ(nfq); |
|
if ( !remqi((Q)q,m) ) return 0; |
|
|
|
if ( DP_Print ) { printf("+"); fflush(stdout); } |
|
hnfq = HCU(nfq); |
|
if ( nd_nalg ) { |
|
/* m|DN(HC(nf)^(-1)) => failure */ |
|
get_eg(&egm0); |
|
if ( !nd_monic(m,&nfq) ) return 0; |
|
get_eg(&egm1); add_eg(&eg_monic,&egm0,&egm1); |
|
nd_removecont(0,nfq); nfqv = ndtondv(0,nfq); nd_free(nfq); |
|
nfv = ndv_dup(0,nfqv); ndv_mod(m,nfv); nd_free(nf); |
|
} else { |
|
nd_removecont(0,nfq); nfqv = ndtondv(0,nfq); nd_free(nfq); |
|
nd_removecont(m,nf); nfv = ndtondv(m,nf); nd_free(nf); |
|
} |
|
if ( nd_gentrace ) { |
|
/* exact division */ |
|
cont = ndc_div(0,hnfq,HCU(nfqv)); |
|
if ( !UNIQ(cont) ) { |
|
t = mknode(4,NULLP,NULLP,NULLP,cont); |
|
MKLIST(list,t); MKNODE(t,list,nd_tracelist); |
|
nd_tracelist = t; |
|
} |
|
} |
|
nh = ndv_newps(0,nfv,nfqv); |
|
if ( ishomo && ++diag_count == diag_period ) { |
|
diag_count = 0; |
|
if ( DP_Print > 2 ) fprintf(asir_out,"|"); |
|
stat = do_diagonalize_trace(sugar,m); |
|
if ( DP_Print > 2 ) fprintf(asir_out,"|"); |
|
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
d = nd_reconstruct(1,d); |
d = nd_reconstruct(1,d); |
goto again; |
goto again; |
} else if ( nf ) { |
} |
if ( nd_demand ) { |
|
nfqv = ndv_load(nd_psn); |
|
nfq = ndvtond(0,nfqv); |
|
} else |
|
nfq = 0; |
|
if ( !nfq ) { |
|
if ( !nd_sp(0,1,l,&h) || !nd_nf(0,0,h,nd_ps_trace,!Top,0,&nfq) ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(1,d); |
|
goto again; |
|
} |
|
} |
|
if ( nfq ) { |
|
/* m|HC(nfq) => failure */ |
|
if ( nd_vc ) { |
|
nd_subst_vector(nd_vc,HCP(nfq),nd_subst,&hc); q = (Z)hc; |
|
} else |
|
q = HCQ(nfq); |
|
if ( !remqi((Q)q,m) ) return 0; |
|
|
|
if ( DP_Print ) { printf("+"); fflush(stdout); } |
|
hnfq = HCU(nfq); |
|
if ( nd_nalg ) { |
|
/* m|DN(HC(nf)^(-1)) => failure */ |
|
get_eg(&egm0); |
|
if ( !nd_monic(m,&nfq) ) return 0; |
|
get_eg(&egm1); add_eg(&eg_monic,&egm0,&egm1); |
|
nd_removecont(0,nfq); nfqv = ndtondv(0,nfq); nd_free(nfq); |
|
nfv = ndv_dup(0,nfqv); ndv_mod(m,nfv); nd_free(nf); |
|
} else { |
|
nd_removecont(0,nfq); nfqv = ndtondv(0,nfq); nd_free(nfq); |
|
nd_removecont(m,nf); nfv = ndtondv(m,nf); nd_free(nf); |
|
} |
|
if ( nd_gentrace ) { |
|
cont = ndc_div(0,hnfq,HCU(nfqv)); |
|
if ( !UNIQ(cont) ) { |
|
t = mknode(4,NULLP,NULLP,NULLP,cont); |
|
MKLIST(list,t); MKNODE(t,list,nd_tracelist); |
|
nd_tracelist = t; |
|
} |
|
} |
|
nh = ndv_newps(0,nfv,nfqv,0); |
|
if ( ishomo && ++diag_count == diag_period ) { |
|
diag_count = 0; |
|
if ( DP_Print > 2 ) fprintf(asir_out,"|"); |
|
stat = do_diagonalize_trace(sugar,m); |
|
if ( DP_Print > 2 ) fprintf(asir_out,"|"); |
|
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(1,d); |
|
goto again; |
|
} |
|
} |
|
d = update_pairs(d,g,nh,0); |
|
g = update_base(g,nh); |
|
} else { |
|
if ( DP_Print ) { printf("*"); fflush(stdout); } |
|
} |
|
} else { |
|
if ( DP_Print ) { printf("."); fflush(stdout); } |
|
} |
} |
FREENDP(l); |
d = update_pairs(d,g,nh,0); |
|
g = update_base(g,nh); |
|
} else { |
|
if ( DP_Print ) { printf("*"); fflush(stdout); } |
|
} |
|
} else { |
|
if ( DP_Print ) { printf("."); fflush(stdout); } |
} |
} |
if ( nd_nalg ) { |
FREENDP(l); |
if ( DP_Print ) { |
} |
print_eg("monic",&eg_monic); |
if ( nd_nalg ) { |
print_eg("invdalg",&eg_invdalg); |
if ( DP_Print ) { |
print_eg("le",&eg_le); |
print_eg("monic",&eg_monic); |
} |
print_eg("invdalg",&eg_invdalg); |
|
print_eg("le",&eg_le); |
} |
} |
|
} |
conv_ilist(nd_demand,1,g,indp); |
conv_ilist(nd_demand,1,g,indp); |
if ( DP_Print ) { printf("nd_gb_trace done.\n"); fflush(stdout); } |
if ( DP_Print ) { printf("nd_gb_trace done.\n"); fflush(stdout); } |
return g; |
return g; |
} |
} |
|
|
int ndv_compare(NDV *p1,NDV *p2) |
int ndv_compare(NDV *p1,NDV *p2) |
Line 2506 NODE ndv_reduceall(int m,NODE f) |
|
Line 3039 NODE ndv_reduceall(int m,NODE f) |
|
|
|
if ( nd_nora ) return f; |
if ( nd_nora ) return f; |
n = length(f); |
n = length(f); |
ndv_setup(m,0,f,0,1); |
ndv_setup(m,0,f,0,1,0); |
perm = (int *)MALLOC(n*sizeof(int)); |
perm = (int *)MALLOC(n*sizeof(int)); |
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
for ( t = nd_tracelist, i = 0; i < n; i++, t = NEXT(t) ) |
for ( t = nd_tracelist, i = 0; i < n; i++, t = NEXT(t) ) |
perm[i] = QTOS((Q)ARG1(BDY((LIST)BDY(t)))); |
perm[i] = ZTOS((Q)ARG1(BDY((LIST)BDY(t)))); |
} |
} |
for ( i = 0; i < n; ) { |
for ( i = 0; i < n; ) { |
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
/* Trace = [1,index,1,1] */ |
/* Trace = [1,index,1,1] */ |
STOQ(i,iq); node = mknode(4,ONE,iq,ONE,ONE); |
STOZ(i,iq); node = mknode(4,ONE,iq,ONE,ONE); |
MKLIST(l,node); MKNODE(nd_tracelist,l,0); |
MKLIST(l,node); MKNODE(nd_tracelist,l,0); |
} |
} |
g = ndvtond(m,nd_ps[i]); |
g = ndvtond(m,nd_ps[i]); |
g = nd_separate_head(g,&head); |
g = nd_separate_head(g,&head); |
stat = nd_nf(m,head,g,nd_ps,1,0,&nf); |
stat = nd_nf(m,head,g,nd_ps,1,&nf); |
if ( !stat ) |
if ( !stat ) |
nd_reconstruct(0,0); |
nd_reconstruct(0,0); |
else { |
else { |
Line 2529 NODE ndv_reduceall(int m,NODE f) |
|
Line 3062 NODE ndv_reduceall(int m,NODE f) |
|
hc = HCU(nf); nd_removecont(m,nf); |
hc = HCU(nf); nd_removecont(m,nf); |
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
for ( t = nd_tracelist; t; t = NEXT(t) ) { |
for ( t = nd_tracelist; t; t = NEXT(t) ) { |
jq = ARG1(BDY((LIST)BDY(t))); j = QTOS(jq); |
jq = ARG1(BDY((LIST)BDY(t))); j = ZTOS(jq); |
STOQ(perm[j],jq); ARG1(BDY((LIST)BDY(t))) = jq; |
STOZ(perm[j],jq); ARG1(BDY((LIST)BDY(t))) = jq; |
} |
} |
|
/* exact division */ |
cont = ndc_div(m,hc,HCU(nf)); |
cont = ndc_div(m,hc,HCU(nf)); |
finalize_tracelist(perm[i],cont); |
finalize_tracelist(perm[i],cont); |
} |
} |
Line 2599 ND_pairs update_pairs( ND_pairs d, NODE /* of index */ |
|
Line 3133 ND_pairs update_pairs( ND_pairs d, NODE /* of index */ |
|
} |
} |
} |
} |
|
|
|
ND_pairs merge_pairs_s(ND_pairs d,ND_pairs d1); |
|
|
|
ND_pairs update_pairs_s( ND_pairs d, int t,NODE *syz) |
|
{ |
|
ND_pairs d1; |
|
struct oEGT eg1,eg2,eg3; |
|
|
|
if ( !t ) return d; |
|
get_eg(&eg1); |
|
d1 = nd_newpairs_s(t,syz); |
|
get_eg(&eg2); add_eg(&eg_create,&eg1,&eg2); |
|
d = merge_pairs_s(d,d1); |
|
get_eg(&eg3); add_eg(&eg_merge,&eg2,&eg3); |
|
return d; |
|
} |
|
|
ND_pairs nd_newpairs( NODE g, int t ) |
ND_pairs nd_newpairs( NODE g, int t ) |
{ |
{ |
NODE h; |
NODE h; |
Line 2609 ND_pairs nd_newpairs( NODE g, int t ) |
|
Line 3158 ND_pairs nd_newpairs( NODE g, int t ) |
|
|
|
dl = DL(nd_psh[t]); |
dl = DL(nd_psh[t]); |
ts = SG(nd_psh[t]) - TD(dl); |
ts = SG(nd_psh[t]) - TD(dl); |
if ( nd_module && nd_intersect && (MPOS(dl) > 1) ) return 0; |
if ( nd_module && nd_intersect && (MPOS(dl) > nd_intersect) ) return 0; |
for ( r0 = 0, h = g; h; h = NEXT(h) ) { |
for ( r0 = 0, h = g; h; h = NEXT(h) ) { |
if ( nd_module && (MPOS(DL(nd_psh[(long)BDY(h)])) != MPOS(dl)) ) |
if ( nd_module && (MPOS(DL(nd_psh[(long)BDY(h)])) != MPOS(dl)) ) |
continue; |
continue; |
Line 2637 ND_pairs nd_newpairs( NODE g, int t ) |
|
Line 3186 ND_pairs nd_newpairs( NODE g, int t ) |
|
return r0; |
return r0; |
} |
} |
|
|
|
int comp_sig(SIG s1,SIG s2) |
|
{ |
|
#if 0 |
|
if ( s1->pos > s2->pos ) return 1; |
|
else if ( s1->pos < s2->pos ) return -1; |
|
else return (*cmpdl)(nd_nvar,s1->dl,s2->dl); |
|
#else |
|
static DL m1,m2; |
|
static int nvar; |
|
int ret; |
|
|
|
if ( nvar != nd_nvar ) { |
|
nvar = nd_nvar; NEWDL(m1,nvar); NEWDL(m2,nvar); |
|
} |
|
// _ndltodl(DL(nd_psh[s1->pos]),m1); |
|
// _ndltodl(DL(nd_psh[s2->pos]),m2); |
|
_copydl(nd_nvar,nd_sba_hm[s1->pos],m1); |
|
_copydl(nd_nvar,nd_sba_hm[s2->pos],m2); |
|
_addtodl(nd_nvar,s1->dl,m1); |
|
_addtodl(nd_nvar,s2->dl,m2); |
|
ret = (*cmpdl)(nd_nvar,m1,m2); |
|
if ( ret != 0 ) return ret; |
|
else if ( s1->pos > s2->pos ) return 1; |
|
else if ( s1->pos < s2->pos ) return -1; |
|
else return 0; |
|
#endif |
|
} |
|
|
|
int _create_spair_s(int i1,int i2,ND_pairs sp,SIG sig1,SIG sig2) |
|
{ |
|
int ret,s1,s2; |
|
RHist p1,p2; |
|
static int wpd; |
|
static UINT *lcm; |
|
|
|
sp->i1 = i1; |
|
sp->i2 = i2; |
|
p1 = nd_psh[i1]; |
|
p2 = nd_psh[i2]; |
|
ndl_lcm(DL(p1),DL(p2),sp->lcm); |
|
s1 = SG(p1)-TD(DL(p1)); |
|
s2 = SG(p2)-TD(DL(p2)); |
|
SG(sp) = MAX(s1,s2) + TD(sp->lcm); |
|
|
|
if ( wpd != nd_wpd ) { |
|
wpd = nd_wpd; |
|
lcm = (UINT *)MALLOC(wpd*sizeof(UINT)); |
|
} |
|
// DL(sig1) <- sp->lcm |
|
// DL(sig1) -= DL(p1) |
|
// DL(sig1) += DL(p1->sig) |
|
ndl_sub(sp->lcm,DL(p1),lcm); |
|
_ndltodl(lcm,DL(sig1)); |
|
_addtodl(nd_nvar,DL(p1->sig),DL(sig1)); |
|
sig1->pos = p1->sig->pos; |
|
|
|
// DL(sig2) <- sp->lcm |
|
// DL(sig2) -= DL(p2) |
|
// DL(sig2) += DL(p2->sig) |
|
ndl_sub(sp->lcm,DL(p2),lcm); |
|
_ndltodl(lcm,DL(sig2)); |
|
_addtodl(nd_nvar,DL(p2->sig),DL(sig2)); |
|
sig2->pos = p2->sig->pos; |
|
|
|
ret = comp_sig(sig1,sig2); |
|
if ( ret == 0 ) return 0; |
|
else if ( ret > 0 ) sp->sig = sig1; |
|
else sp->sig = sig2; |
|
return 1; |
|
} |
|
|
|
SIG dup_sig(SIG sig) |
|
{ |
|
SIG r; |
|
|
|
if ( !sig ) return 0; |
|
else { |
|
NEWSIG(r); |
|
_copydl(nd_nvar,DL(sig),DL(r)); |
|
r->pos = sig->pos; |
|
return r; |
|
} |
|
} |
|
|
|
void dup_ND_pairs(ND_pairs to,ND_pairs from) |
|
{ |
|
to->i1 = from->i1; |
|
to->i2 = from->i2; |
|
to->sugar = from->sugar; |
|
to->sugar2 = from->sugar2; |
|
ndl_copy(from->lcm,to->lcm); |
|
to->sig = dup_sig(from->sig); |
|
} |
|
|
|
ND_pairs merge_pairs_s(ND_pairs p1,ND_pairs p2) |
|
{ |
|
struct oND_pairs root; |
|
ND_pairs q1,q2,r0,r; |
|
int ret; |
|
|
|
r = &root; |
|
for ( q1 = p1, q2 = p2; q1 != 0 && q2 != 0; ) { |
|
ret = comp_sig(q1->sig,q2->sig); |
|
if ( ret < 0 ) { |
|
r->next = q1; r = q1; q1 = q1->next; |
|
} else if ( ret > 0 ) { |
|
r->next = q2; r = q2; q2 = q2->next; |
|
} else { |
|
ret = DL_COMPARE(q1->lcm,q2->lcm); |
|
if ( ret < 0 ) { |
|
r->next = q1; r = q1; q1 = q1->next; |
|
q2 = q2->next; |
|
} else { |
|
r->next = q2; r = q2; q2 = q2->next; |
|
q1 = q1->next; |
|
} |
|
} |
|
} |
|
if ( q1 ) { |
|
r->next = q1; |
|
} else { |
|
r->next = q2; |
|
} |
|
return root.next; |
|
} |
|
|
|
ND_pairs insert_pair_s(ND_pairs l,ND_pairs s) |
|
{ |
|
ND_pairs p,prev; |
|
int ret; |
|
|
|
for ( p = l, prev = 0; p != 0; prev = p, p = p->next ) { |
|
if ( (ret = comp_sig(s->sig,p->sig)) <= 0 ) |
|
break; |
|
} |
|
if ( ret == 0 ) { |
|
ret = DL_COMPARE(s->lcm,p->lcm); |
|
if ( ret < 0 ) { |
|
// replace p with s |
|
s->next = p->next; |
|
if ( prev == 0 ) { |
|
return s; |
|
} else { |
|
prev->next = s; |
|
return l; |
|
} |
|
} else |
|
return l; |
|
} else { |
|
// insert s between prev and p |
|
s->next = p; |
|
if ( prev == 0 ) { |
|
return s; |
|
} else { |
|
prev->next = s; |
|
return l; |
|
} |
|
} |
|
} |
|
|
|
INLINE int __dl_redble(DL d1,DL d2,int nvar) |
|
{ |
|
int i; |
|
|
|
if ( d1->td > d2->td ) |
|
return 0; |
|
for ( i = nvar-1; i >= 0; i-- ) |
|
if ( d1->d[i] > d2->d[i] ) |
|
break; |
|
if ( i >= 0 ) |
|
return 0; |
|
else |
|
return 1; |
|
} |
|
|
|
ND_pairs nd_newpairs_s(int t, NODE *syz) |
|
{ |
|
NODE h,s; |
|
UINT *dl; |
|
int ts,ret,i; |
|
ND_pairs r,r0,_sp,sp; |
|
SIG spsig,tsig; |
|
static int nvar; |
|
static SIG _sig1,_sig2; |
|
struct oEGT eg1,eg2,eg3,eg4; |
|
|
|
NEWND_pairs(_sp); |
|
if ( !_sig1 || nvar != nd_nvar ) { |
|
nvar = nd_nvar; NEWSIG(_sig1); NEWSIG(_sig2); |
|
} |
|
r0 = 0; |
|
for ( i = 0; i < t; i++ ) { |
|
ret = _create_spair_s(i,t,_sp,_sig1,_sig2); |
|
if ( ret ) { |
|
spsig = _sp->sig; |
|
for ( s = syz[spsig->pos]; s; s = s->next ) { |
|
tsig = (SIG)s->body; |
|
if ( _dl_redble(DL(tsig),DL(spsig),nd_nvar) ) |
|
break; |
|
} |
|
if ( s == 0 ) { |
|
NEWND_pairs(sp); |
|
dup_ND_pairs(sp,_sp); |
|
r0 = insert_pair_s(r0,sp); |
|
} else |
|
Nsyz++; |
|
} |
|
} |
|
return r0; |
|
} |
|
|
/* ipair = [i1,i2],[i1,i2],... */ |
/* ipair = [i1,i2],[i1,i2],... */ |
ND_pairs nd_ipairtospair(NODE ipair) |
ND_pairs nd_ipairtospair(NODE ipair) |
{ |
{ |
Line 2647 ND_pairs nd_ipairtospair(NODE ipair) |
|
Line 3407 ND_pairs nd_ipairtospair(NODE ipair) |
|
for ( r0 = 0, t = ipair; t; t = NEXT(t) ) { |
for ( r0 = 0, t = ipair; t; t = NEXT(t) ) { |
NEXTND_pairs(r0,r); |
NEXTND_pairs(r0,r); |
tn = BDY((LIST)BDY(t)); |
tn = BDY((LIST)BDY(t)); |
r->i1 = QTOS((Q)ARG0(tn)); |
r->i1 = ZTOS((Q)ARG0(tn)); |
r->i2 = QTOS((Q)ARG1(tn)); |
r->i2 = ZTOS((Q)ARG1(tn)); |
ndl_lcm(DL(nd_psh[r->i1]),DL(nd_psh[r->i2]),r->lcm); |
ndl_lcm(DL(nd_psh[r->i1]),DL(nd_psh[r->i2]),r->lcm); |
s1 = SG(nd_psh[r->i1])-TD(DL(nd_psh[r->i1])); |
s1 = SG(nd_psh[r->i1])-TD(DL(nd_psh[r->i1])); |
s2 = SG(nd_psh[r->i2])-TD(DL(nd_psh[r->i2])); |
s2 = SG(nd_psh[r->i2])-TD(DL(nd_psh[r->i2])); |
Line 2914 ND_pairs nd_minsugarp( ND_pairs d, ND_pairs *prest ) |
|
Line 3674 ND_pairs nd_minsugarp( ND_pairs d, ND_pairs *prest ) |
|
return dm0; |
return dm0; |
} |
} |
|
|
|
ND_pairs nd_minsugarp_s( ND_pairs d, ND_pairs *prest ) |
|
{ |
|
int msugar; |
|
ND_pairs t,last; |
|
|
|
#if 0 |
|
for ( msugar = SG(d), t = d; t; t = NEXT(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; |
|
last->next = 0; |
|
return d; |
|
} |
|
|
int nd_tdeg(NDV c) |
int nd_tdeg(NDV c) |
{ |
{ |
int wmax = 0; |
int wmax = 0; |
Line 2926 int nd_tdeg(NDV c) |
|
Line 3704 int nd_tdeg(NDV c) |
|
return wmax; |
return wmax; |
} |
} |
|
|
int ndv_newps(int m,NDV a,NDV aq,int f4) |
int ndv_newps(int m,NDV a,NDV aq) |
{ |
{ |
int len; |
int len; |
RHist r; |
RHist r; |
Line 2962 int ndv_newps(int m,NDV a,NDV aq,int f4) |
|
Line 3740 int ndv_newps(int m,NDV a,NDV aq,int f4) |
|
SG(r) = nd_tdeg(aq); |
SG(r) = nd_tdeg(aq); |
#endif |
#endif |
ndl_copy(HDL(aq),DL(r)); |
ndl_copy(HDL(aq),DL(r)); |
|
r->sig = dup_sig(aq->sig); |
} else { |
} else { |
if ( !m ) register_hcf(a); |
if ( !m ) register_hcf(a); |
nd_bound[nd_psn] = ndv_compute_bound(a); |
nd_bound[nd_psn] = ndv_compute_bound(a); |
Line 2971 int ndv_newps(int m,NDV a,NDV aq,int f4) |
|
Line 3750 int ndv_newps(int m,NDV a,NDV aq,int f4) |
|
SG(r) = nd_tdeg(a); |
SG(r) = nd_tdeg(a); |
#endif |
#endif |
ndl_copy(HDL(a),DL(r)); |
ndl_copy(HDL(a),DL(r)); |
|
r->sig = dup_sig(a->sig); |
} |
} |
if ( nd_demand ) { |
if ( nd_demand ) { |
if ( aq ) { |
if ( aq ) { |
Line 2987 int ndv_newps(int m,NDV a,NDV aq,int f4) |
|
Line 3767 int ndv_newps(int m,NDV a,NDV aq,int f4) |
|
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
/* reverse the tracelist and append it to alltracelist */ |
/* reverse the tracelist and append it to alltracelist */ |
nd_tracelist = reverse_node(nd_tracelist); MKLIST(l,nd_tracelist); |
nd_tracelist = reverse_node(nd_tracelist); MKLIST(l,nd_tracelist); |
STOQ(nd_psn,iq); tn = mknode(2,iq,l); MKLIST(l,tn); |
STOZ(nd_psn,iq); tn = mknode(2,iq,l); MKLIST(l,tn); |
MKNODE(tn,l,nd_alltracelist); nd_alltracelist = tn; nd_tracelist = 0; |
MKNODE(tn,l,nd_alltracelist); nd_alltracelist = tn; nd_tracelist = 0; |
} |
} |
return nd_psn++; |
return nd_psn++; |
Line 2996 int ndv_newps(int m,NDV a,NDV aq,int f4) |
|
Line 3776 int ndv_newps(int m,NDV a,NDV aq,int f4) |
|
/* nd_tracelist = [[0,index,div],...,[nd_psn-1,index,div]] */ |
/* nd_tracelist = [[0,index,div],...,[nd_psn-1,index,div]] */ |
/* return 1 if success, 0 if failure (HC(a mod p)) */ |
/* return 1 if success, 0 if failure (HC(a mod p)) */ |
|
|
int ndv_setup(int mod,int trace,NODE f,int dont_sort,int dont_removecont) |
int ndv_setup(int mod,int trace,NODE f,int dont_sort,int dont_removecont,int sba) |
{ |
{ |
int i,j,td,len,max; |
int i,j,td,len,max; |
NODE s,s0,f0,tn; |
NODE s,s0,f0,tn; |
UINT *d; |
UINT *d; |
RHist r; |
RHist r; |
NDVI w; |
NDVI w; |
NDV a,am; |
NDV a,am; |
union oNDC hc; |
union oNDC hc; |
NODE node; |
NODE node; |
P hcp; |
P hcp; |
Z iq,jq; |
Z iq,jq; |
LIST l; |
LIST l; |
|
|
nd_found = 0; nd_notfirst = 0; nd_create = 0; |
nd_found = 0; nd_notfirst = 0; nd_create = 0; |
/* initialize the tracelist */ |
/* initialize the tracelist */ |
nd_tracelist = 0; |
nd_tracelist = 0; |
|
|
for ( nd_psn = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) nd_psn++; |
for ( nd_psn = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) nd_psn++; |
w = (NDVI)MALLOC(nd_psn*sizeof(struct oNDVI)); |
w = (NDVI)MALLOC(nd_psn*sizeof(struct oNDVI)); |
for ( i = j = 0, s = f; s; s = NEXT(s), j++ ) |
for ( i = j = 0, s = f; s; s = NEXT(s), j++ ) |
if ( BDY(s) ) { w[i].p = BDY(s); w[i].i = j; i++; } |
if ( BDY(s) ) { w[i].p = BDY(s); w[i].i = j; i++; } |
if ( !dont_sort ) { |
if ( !dont_sort ) { |
/* XXX heuristic */ |
/* XXX heuristic */ |
if ( !nd_ord->id && (nd_ord->ord.simple<2) ) |
if ( !sba && !nd_ord->id && (nd_ord->ord.simple<2) ) |
qsort(w,nd_psn,sizeof(struct oNDVI), |
qsort(w,nd_psn,sizeof(struct oNDVI), |
(int (*)(const void *,const void *))ndvi_compare_rev); |
(int (*)(const void *,const void *))ndvi_compare_rev); |
else |
|
qsort(w,nd_psn,sizeof(struct oNDVI), |
|
(int (*)(const void *,const void *))ndvi_compare); |
|
} |
|
nd_pslen = 2*nd_psn; |
|
nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
|
nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
|
nd_ps_sym = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
|
nd_ps_trace_sym = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
|
nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist)); |
|
nd_bound = (UINT **)MALLOC(nd_pslen*sizeof(UINT *)); |
|
nd_hcf = 0; |
|
|
|
if ( trace && nd_vc ) |
|
makesubst(nd_vc,&nd_subst); |
|
else |
else |
nd_subst = 0; |
qsort(w,nd_psn,sizeof(struct oNDVI), |
|
(int (*)(const void *,const void *))ndvi_compare); |
|
} |
|
nd_pslen = 2*nd_psn; |
|
nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
|
nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
|
nd_ps_sym = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
|
nd_ps_trace_sym = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
|
nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist)); |
|
nd_bound = (UINT **)MALLOC(nd_pslen*sizeof(UINT *)); |
|
nd_hcf = 0; |
|
|
if ( !nd_red ) |
if ( trace && nd_vc ) |
nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist)); |
makesubst(nd_vc,&nd_subst); |
for ( i = 0; i < REDTAB_LEN; i++ ) nd_red[i] = 0; |
else |
for ( i = 0; i < nd_psn; i++ ) { |
nd_subst = 0; |
hc = HCU(w[i].p); |
|
if ( trace ) { |
if ( !nd_red ) |
if ( mod == -2 ) { |
nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist)); |
/* over a large finite field */ |
for ( i = 0; i < REDTAB_LEN; i++ ) nd_red[i] = 0; |
/* trace = small modulus */ |
for ( i = 0; i < nd_psn; i++ ) { |
a = nd_ps_trace[i] = ndv_dup(-2,w[i].p); |
hc = HCU(w[i].p); |
ndv_mod(-2,a); |
if ( trace ) { |
if ( !dont_removecont) ndv_removecont(-2,a); |
if ( mod == -2 ) { |
am = nd_ps[i] = ndv_dup(trace,w[i].p); |
/* over a large finite field */ |
ndv_mod(trace,am); |
/* trace = small modulus */ |
if ( DL_COMPARE(HDL(am),HDL(a)) ) |
a = nd_ps_trace[i] = ndv_dup(-2,w[i].p); |
return 0; |
ndv_mod(-2,a); |
ndv_removecont(trace,am); |
if ( !dont_removecont) ndv_removecont(-2,a); |
} else { |
am = nd_ps[i] = ndv_dup(trace,w[i].p); |
a = nd_ps_trace[i] = ndv_dup(0,w[i].p); |
ndv_mod(trace,am); |
if ( !dont_removecont) ndv_removecont(0,a); |
if ( DL_COMPARE(HDL(am),HDL(a)) ) |
register_hcf(a); |
return 0; |
am = nd_ps[i] = ndv_dup(mod,a); |
ndv_removecont(trace,am); |
ndv_mod(mod,am); |
} else { |
if ( DL_COMPARE(HDL(am),HDL(a)) ) |
a = nd_ps_trace[i] = ndv_dup(0,w[i].p); |
return 0; |
if ( !dont_removecont) ndv_removecont(0,a); |
ndv_removecont(mod,am); |
register_hcf(a); |
} |
am = nd_ps[i] = ndv_dup(mod,a); |
} else { |
ndv_mod(mod,am); |
a = nd_ps[i] = ndv_dup(mod,w[i].p); |
if ( DL_COMPARE(HDL(am),HDL(a)) ) |
if ( mod || !dont_removecont ) ndv_removecont(mod,a); |
return 0; |
if ( !mod ) register_hcf(a); |
ndv_removecont(mod,am); |
} |
} |
if ( nd_gentrace ) { |
} else { |
STOQ(i,iq); STOQ(w[i].i,jq); node = mknode(3,iq,jq,ONE); |
a = nd_ps[i] = ndv_dup(mod,w[i].p); |
|
if ( mod || !dont_removecont ) ndv_removecont(mod,a); |
|
if ( !mod ) register_hcf(a); |
|
} |
|
if ( nd_gentrace ) { |
|
STOZ(i,iq); STOZ(w[i].i,jq); node = mknode(3,iq,jq,ONE); |
|
/* exact division */ |
if ( !dont_removecont ) |
if ( !dont_removecont ) |
ARG2(node) = (pointer)ndc_div(trace?0:mod,hc,HCU(a)); |
ARG2(node) = (pointer)ndc_div(trace?0:mod,hc,HCU(a)); |
MKLIST(l,node); NEXTNODE(nd_tracelist,tn); BDY(tn) = l; |
MKLIST(l,node); NEXTNODE(nd_tracelist,tn); BDY(tn) = l; |
} |
|
NEWRHist(r); SG(r) = HTD(a); ndl_copy(HDL(a),DL(r)); |
|
nd_bound[i] = ndv_compute_bound(a); |
|
nd_psh[i] = r; |
|
if ( nd_demand ) { |
|
if ( trace ) { |
|
ndv_save(nd_ps_trace[i],i); |
|
nd_ps_sym[i] = ndv_symbolic(mod,nd_ps_trace[i]); |
|
nd_ps_trace_sym[i] = ndv_symbolic(mod,nd_ps_trace[i]); |
|
nd_ps_trace[i] = 0; |
|
} else { |
|
ndv_save(nd_ps[i],i); |
|
nd_ps_sym[i] = ndv_symbolic(mod,nd_ps[i]); |
|
nd_ps[i] = 0; |
|
} |
|
} |
|
} |
} |
if ( nd_gentrace && nd_tracelist ) NEXT(tn) = 0; |
NEWRHist(r); SG(r) = HTD(a); ndl_copy(HDL(a),DL(r)); |
return 1; |
nd_bound[i] = ndv_compute_bound(a); |
|
nd_psh[i] = r; |
|
if ( nd_demand ) { |
|
if ( trace ) { |
|
ndv_save(nd_ps_trace[i],i); |
|
nd_ps_sym[i] = ndv_symbolic(mod,nd_ps_trace[i]); |
|
nd_ps_trace_sym[i] = ndv_symbolic(mod,nd_ps_trace[i]); |
|
nd_ps_trace[i] = 0; |
|
} else { |
|
ndv_save(nd_ps[i],i); |
|
nd_ps_sym[i] = ndv_symbolic(mod,nd_ps[i]); |
|
nd_ps[i] = 0; |
|
} |
|
} |
|
} |
|
if ( sba ) { |
|
nd_sba_hm = (DL *)MALLOC(nd_psn*sizeof(DL)); |
|
// setup signatures |
|
for ( i = 0; i < nd_psn; i++ ) { |
|
SIG sig; |
|
|
|
NEWSIG(sig); sig->pos = i; |
|
nd_ps[i]->sig = sig; |
|
if ( nd_demand ) nd_ps_sym[i]->sig = sig; |
|
nd_psh[i]->sig = sig; |
|
if ( trace ) { |
|
nd_ps_trace[i]->sig = sig; |
|
if ( nd_demand ) nd_ps_trace_sym[i]->sig = sig; |
|
} |
|
NEWDL(nd_sba_hm[i],nd_nvar); |
|
_ndltodl(DL(nd_psh[i]),nd_sba_hm[i]); |
|
} |
|
nd_sba_pos = (NODE *)MALLOC(nd_psn*sizeof(NODE)); |
|
for ( i = 0; i < nd_psn; i++ ) { |
|
j = nd_psh[i]->sig->pos; |
|
nd_sba_pos[j] = append_one(nd_sba_pos[j],i); |
|
} |
|
} |
|
if ( nd_gentrace && nd_tracelist ) NEXT(tn) = 0; |
|
return 1; |
} |
} |
|
|
struct order_spec *append_block(struct order_spec *spec, |
struct order_spec *append_block(struct order_spec *spec, |
Line 3227 void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int |
|
Line 4031 void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int |
|
int *perm; |
int *perm; |
EPOS oepos; |
EPOS oepos; |
int obpe,oadv,ompos,cbpe; |
int obpe,oadv,ompos,cbpe; |
|
VECT hvect; |
|
|
nd_module = 0; |
nd_module = 0; |
if ( !m && Demand ) nd_demand = 1; |
if ( !m && Demand ) nd_demand = 1; |
Line 3270 void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int |
|
Line 4075 void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int |
|
for ( t = BDY(f), max = 1; t; t = NEXT(t) ) |
for ( t = BDY(f), max = 1; t; t = NEXT(t) ) |
for ( tv = vv; tv; tv = NEXT(tv) ) { |
for ( tv = vv; tv; tv = NEXT(tv) ) { |
if ( nd_module ) { |
if ( nd_module ) { |
s = BDY((LIST)BDY(t)); |
if ( OID(BDY(t)) == O_DPM ) { |
trank = length(s); |
e = dpm_getdeg((DPM)BDY(t),&trank); |
mrank = MAX(mrank,trank); |
max = MAX(e,max); |
for ( ; s; s = NEXT(s) ) { |
mrank = MAX(mrank,trank); |
e = getdeg(tv->v,(P)BDY(s)); |
} else { |
max = MAX(e,max); |
s = BDY((LIST)BDY(t)); |
|
trank = length(s); |
|
mrank = MAX(mrank,trank); |
|
for ( ; s; s = NEXT(s) ) { |
|
e = getdeg(tv->v,(P)BDY(s)); |
|
max = MAX(e,max); |
|
} |
} |
} |
} else { |
} else { |
e = getdeg(tv->v,(P)BDY(t)); |
e = getdeg(tv->v,(P)BDY(t)); |
Line 3287 void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int |
|
Line 4098 void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int |
|
ishomo = 1; |
ishomo = 1; |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
if ( nd_module ) { |
if ( nd_module ) { |
if ( !m && !nd_gentrace ) pltozpl((LIST)BDY(t),&dmy,&zpl); |
if ( OID(BDY(t)) == O_DPM ) { |
else zpl = (LIST)BDY(t); |
Z cont; |
|
DPM zdpm; |
|
|
|
if ( !m && !nd_gentrace ) dpm_ptozp((DPM)BDY(t),&cont,&zdpm); |
|
else zdpm = (DPM)BDY(t); |
|
b = (pointer)dpmtondv(m,zdpm); |
|
} else { |
|
if ( !m && !nd_gentrace ) pltozpl((LIST)BDY(t),&dmy,&zpl); |
|
else zpl = (LIST)BDY(t); |
b = (pointer)pltondv(CO,vv,zpl); |
b = (pointer)pltondv(CO,vv,zpl); |
|
} |
} else { |
} else { |
if ( !m && !nd_gentrace ) ptozp((P)BDY(t),1,&dmy,&zp); |
if ( !m && !nd_gentrace ) ptozp((P)BDY(t),1,&dmy,&zp); |
else zp = (P)BDY(t); |
else zp = (P)BDY(t); |
Line 3315 void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int |
|
Line 4135 void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int |
|
ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos,ompos); |
ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos,ompos); |
} |
} |
|
|
ndv_setup(m,0,fd0,(nd_gbblock||nd_splist||nd_check_splist)?1:0,0); |
ndv_setup(m,0,fd0,(nd_gbblock||nd_splist||nd_check_splist)?1:0,0,0); |
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
MKLIST(l1,nd_tracelist); MKNODE(nd_alltracelist,l1,0); |
MKLIST(l1,nd_tracelist); MKNODE(nd_alltracelist,l1,0); |
} |
} |
Line 3337 void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int |
|
Line 4157 void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int |
|
if ( !x ) { |
if ( !x ) { |
*rp = 0; return; |
*rp = 0; return; |
} |
} |
|
if ( nd_gentrace ) { |
|
MKVECT(hvect,nd_psn); |
|
for ( i = 0; i < nd_psn; i++ ) |
|
ndltodp(nd_psh[i]->dl,(DP *)&BDY(hvect)[i]); |
|
} |
if ( !ishomo && homo ) { |
if ( !ishomo && homo ) { |
/* dehomogenization */ |
/* dehomogenization */ |
for ( t = x; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord); |
for ( t = x; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord); |
Line 3346 void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int |
|
Line 4171 void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int |
|
nd_demand = 0; |
nd_demand = 0; |
if ( nd_module && nd_intersect ) { |
if ( nd_module && nd_intersect ) { |
for ( j = nd_psn-1, x = 0; j >= 0; j-- ) |
for ( j = nd_psn-1, x = 0; j >= 0; j-- ) |
if ( MPOS(DL(nd_psh[j])) > 1 ) { |
if ( MPOS(DL(nd_psh[j])) > nd_intersect ) { |
MKNODE(xx,(pointer)((unsigned long)j),x); x = xx; |
MKNODE(xx,(pointer)((unsigned long)j),x); x = xx; |
} |
} |
conv_ilist(nd_demand,0,x,0); |
conv_ilist(nd_demand,0,x,0); |
Line 3370 void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int |
|
Line 4195 void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int |
|
nd_setup_parameters(nd_nvar,0); |
nd_setup_parameters(nd_nvar,0); |
FINAL: |
FINAL: |
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 ( nd_module ) BDY(r) = ndvtopl(m,CO,vv,BDY(t),mrank); |
if ( nd_module ) { |
else if ( retdp ) BDY(r) = ndvtodp(m,BDY(t)); |
if ( retdp ) BDY(r) = ndvtodpm(m,BDY(t)); |
else BDY(r) = ndvtop(m,CO,vv,BDY(t)); |
else BDY(r) = ndvtopl(m,CO,vv,BDY(t),mrank); |
|
} else if ( retdp ) BDY(r) = ndvtodp(m,BDY(t)); |
|
else BDY(r) = ndvtop(m,CO,vv,BDY(t)); |
} |
} |
if ( r0 ) NEXT(r) = 0; |
if ( r0 ) NEXT(r) = 0; |
if ( !m && nd_nalg ) |
if ( !m && nd_nalg ) |
|
|
MKLIST(*rp,r0); |
MKLIST(*rp,r0); |
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
if ( f4 ) { |
if ( f4 ) { |
STOQ(16,bpe); |
STOZ(16,bpe); |
STOQ(nd_last_nonzero,last_nonzero); |
STOZ(nd_last_nonzero,last_nonzero); |
tr = mknode(5,*rp,(!ishomo&&homo)?ONE:0,BDY(nzlist),bpe,last_nonzero); MKLIST(*rp,tr); |
tr = mknode(6,*rp,(!ishomo&&homo)?ONE:0,BDY(nzlist),bpe,last_nonzero,hvect); MKLIST(*rp,tr); |
|
|
} else { |
} else { |
tl1 = reverse_node(tl1); tl2 = reverse_node(tl2); |
tl1 = reverse_node(tl1); tl2 = reverse_node(tl2); |
tl3 = reverse_node(tl3); |
tl3 = reverse_node(tl3); |
|
|
for ( t = tl2; t; t = NEXT(t) ) { |
for ( t = tl2; t; t = NEXT(t) ) { |
/* s = [i,[*,j,*,*],...] */ |
/* s = [i,[*,j,*,*],...] */ |
s = BDY((LIST)BDY(t)); |
s = BDY((LIST)BDY(t)); |
j = perm[QTOS((Q)ARG0(s))]; STOQ(j,jq); ARG0(s) = (pointer)jq; |
j = perm[ZTOS((Q)ARG0(s))]; STOZ(j,jq); ARG0(s) = (pointer)jq; |
for ( s = BDY((LIST)ARG1(s)); s; s = NEXT(s) ) { |
for ( s = BDY((LIST)ARG1(s)); s; s = NEXT(s) ) { |
j = perm[QTOS((Q)ARG1(BDY((LIST)BDY(s))))]; STOQ(j,jq); |
j = perm[ZTOS((Q)ARG1(BDY((LIST)BDY(s))))]; STOZ(j,jq); |
ARG1(BDY((LIST)BDY(s))) = (pointer)jq; |
ARG1(BDY((LIST)BDY(s))) = (pointer)jq; |
} |
} |
} |
} |
for ( j = length(x)-1, t = 0; j >= 0; j-- ) { |
for ( j = length(x)-1, t = 0; j >= 0; j-- ) { |
STOQ(perm[j],jq); MKNODE(s,jq,t); t = s; |
STOZ(perm[j],jq); MKNODE(s,jq,t); t = s; |
} |
} |
MKLIST(l1,tl1); MKLIST(l2,tl2); MKLIST(l3,t); MKLIST(l4,tl3); |
MKLIST(l1,tl1); MKLIST(l2,tl2); MKLIST(l3,t); MKLIST(l4,tl3); |
MKLIST(l5,tl4); |
MKLIST(l5,tl4); |
STOQ(nd_bpe,bpe); |
STOZ(nd_bpe,bpe); |
tr = mknode(8,*rp,(!ishomo&&homo)?ONE:0,l1,l2,l3,l4,l5,bpe); MKLIST(*rp,tr); |
tr = mknode(9,*rp,(!ishomo&&homo)?ONE:0,l1,l2,l3,l4,l5,bpe,hvect); MKLIST(*rp,tr); |
} |
} |
} |
} |
#if 0 |
#if 0 |
|
|
#endif |
#endif |
} |
} |
|
|
|
NODE nd_sba_f4(int m,int **indp); |
|
|
|
void nd_sba(LIST f,LIST v,int m,int homo,int retdp,int f4,struct order_spec *ord,LIST *rp) |
|
{ |
|
VL tv,fv,vv,vc,av; |
|
NODE fd,fd0,r,r0,t,x,s,xx; |
|
int e,max,nvar,i; |
|
NDV b; |
|
int ishomo,nalg,wmax,len; |
|
NMV a; |
|
P p,zp; |
|
Q dmy; |
|
struct order_spec *ord1; |
|
int j; |
|
int *perm; |
|
EPOS oepos; |
|
int obpe,oadv,ompos,cbpe; |
|
struct oEGT eg0,eg1,egconv; |
|
|
|
nd_module = 0; |
|
nd_demand = 0; |
|
parse_nd_option(current_option); |
|
|
|
if ( DP_Multiple ) |
|
nd_scale = ((double)DP_Multiple)/(double)(Denominator?Denominator:1); |
|
get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc); |
|
if ( m && nd_vc ) |
|
error("nd_sba : computation over Fp(X) is unsupported. Use dp_gr_mod_main()."); |
|
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
|
switch ( ord->id ) { |
|
case 1: |
|
if ( ord->nv != nvar ) |
|
error("nd_sba : invalid order specification"); |
|
break; |
|
default: |
|
break; |
|
} |
|
nd_nalg = 0; |
|
nd_init_ord(ord); |
|
// for SIG comparison |
|
initd(ord); |
|
for ( t = BDY(f), max = 1; t; t = NEXT(t) ) { |
|
for ( tv = vv; tv; tv = NEXT(tv) ) { |
|
e = getdeg(tv->v,(P)BDY(t)); |
|
max = MAX(e,max); |
|
} |
|
} |
|
nd_setup_parameters(nvar,max); |
|
obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos; ompos = nd_mpos; |
|
ishomo = 1; |
|
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
|
if ( !m ) ptozp((P)BDY(t),1,&dmy,&zp); |
|
else zp = (P)BDY(t); |
|
b = (pointer)ptondv(CO,vv,zp); |
|
if ( ishomo ) |
|
ishomo = ishomo && ndv_ishomo(b); |
|
if ( m ) ndv_mod(m,b); |
|
if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; } |
|
} |
|
if ( fd0 ) NEXT(fd) = 0; |
|
|
|
if ( !ishomo && homo ) { |
|
for ( t = fd0, wmax = max; t; t = NEXT(t) ) { |
|
b = (NDV)BDY(t); len = LEN(b); |
|
for ( a = BDY(b), i = 0; i < len; i++, NMV_ADV(a) ) |
|
wmax = MAX(TD(DL(a)),wmax); |
|
} |
|
homogenize_order(ord,nvar,&ord1); |
|
nd_init_ord(ord1); |
|
nd_setup_parameters(nvar+1,nd_nzlist?0:wmax); |
|
for ( t = fd0; t; t = NEXT(t) ) |
|
ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos,ompos); |
|
} |
|
|
|
ndv_setup(m,0,fd0,0,0,1); |
|
x = f4 ? nd_sba_f4(m,&perm) : nd_sba_buch(m,ishomo || homo,&perm); |
|
if ( !x ) { |
|
*rp = 0; return; |
|
} |
|
if ( !ishomo && homo ) { |
|
/* dehomogenization */ |
|
for ( t = x; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord); |
|
nd_init_ord(ord); |
|
nd_setup_parameters(nvar,0); |
|
} |
|
nd_demand = 0; |
|
x = ndv_reducebase(x,perm); |
|
x = ndv_reduceall(m,x); |
|
nd_setup_parameters(nd_nvar,0); |
|
get_eg(&eg0); |
|
for ( r0 = 0, t = x; t; t = NEXT(t) ) { |
|
NEXTNODE(r0,r); |
|
if ( retdp ) BDY(r) = ndvtodp(m,BDY(t)); |
|
BDY(r) = ndvtop(m,CO,vv,BDY(t)); |
|
} |
|
if ( r0 ) NEXT(r) = 0; |
|
MKLIST(*rp,r0); |
|
get_eg(&eg1); init_eg(&egconv); add_eg(&egconv,&eg0,&eg1); |
|
print_eg("conv",&egconv); fprintf(asir_out,"\n"); |
|
} |
|
|
void nd_gr_postproc(LIST f,LIST v,int m,struct order_spec *ord,int do_check,LIST *rp) |
void nd_gr_postproc(LIST f,LIST v,int m,struct order_spec *ord,int do_check,LIST *rp) |
{ |
{ |
VL tv,fv,vv,vc,av; |
VL tv,fv,vv,vc,av; |
Line 3471 void nd_gr_postproc(LIST f,LIST v,int m,struct order_s |
|
Line 4398 void nd_gr_postproc(LIST f,LIST v,int m,struct order_s |
|
if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; } |
if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; } |
} |
} |
if ( fd0 ) NEXT(fd) = 0; |
if ( fd0 ) NEXT(fd) = 0; |
ndv_setup(m,0,fd0,0,1); |
ndv_setup(m,0,fd0,0,1,0); |
for ( x = 0, i = 0; i < nd_psn; i++ ) |
for ( x = 0, i = 0; i < nd_psn; i++ ) |
x = update_base(x,i); |
x = update_base(x,i); |
if ( do_check ) { |
if ( do_check ) { |
Line 3512 NDV recompute_trace(NODE ti,NDV *p,int mod) |
|
Line 4439 NDV recompute_trace(NODE ti,NDV *p,int mod) |
|
NODE sj; |
NODE sj; |
NDV red; |
NDV red; |
Obj mj; |
Obj mj; |
static int afo=0; |
|
|
|
afo++; |
|
mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); |
mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); |
CM(mul) = 1; |
CM(mul) = 1; |
tail = 0; |
tail = 0; |
for ( i = 0, d = r = 0; ti; ti = NEXT(ti), i++ ) { |
for ( i = 0, d = r = 0; ti; ti = NEXT(ti), i++ ) { |
sj = BDY((LIST)BDY(ti)); |
sj = BDY((LIST)BDY(ti)); |
if ( ARG0(sj) ) { |
if ( ARG0(sj) ) { |
red = p[QTOS((Q)ARG1(sj))]; |
red = p[ZTOS((Q)ARG1(sj))]; |
mj = (Obj)ARG2(sj); |
mj = (Obj)ARG2(sj); |
if ( OID(mj) != O_DP ) ndl_zero(DL(mul)); |
if ( OID(mj) != O_DP ) ndl_zero(DL(mul)); |
else dltondl(nd_nvar,BDY((DP)mj)->dl,DL(mul)); |
else dltondl(nd_nvar,BDY((DP)mj)->dl,DL(mul)); |
Line 3590 void nd_gr_recompute_trace(LIST f,LIST v,int m,struct |
|
Line 4515 void nd_gr_recompute_trace(LIST f,LIST v,int m,struct |
|
break; |
break; |
} |
} |
nd_init_ord(ord); |
nd_init_ord(ord); |
nd_bpe = QTOS((Q)ARG7(BDY(tlist))); |
nd_bpe = ZTOS((Q)ARG7(BDY(tlist))); |
nd_setup_parameters(nvar,0); |
nd_setup_parameters(nvar,0); |
|
|
len = length(BDY(f)); |
len = length(BDY(f)); |
Line 3610 void nd_gr_recompute_trace(LIST f,LIST v,int m,struct |
|
Line 4535 void nd_gr_recompute_trace(LIST f,LIST v,int m,struct |
|
trace = NEXT(permtrace); |
trace = NEXT(permtrace); |
|
|
for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) { |
for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) { |
j = QTOS((Q)ARG0(BDY((LIST)BDY(t)))); |
j = ZTOS((Q)ARG0(BDY((LIST)BDY(t)))); |
if ( j > i ) i = j; |
if ( j > i ) i = j; |
} |
} |
n = i+1; |
n = i+1; |
pb = (NDV *)MALLOC(n*sizeof(NDV *)); |
pb = (NDV *)MALLOC(n*sizeof(NDV *)); |
for ( t = perm, i = 0; t; t = NEXT(t), i++ ) { |
for ( t = perm, i = 0; t; t = NEXT(t), i++ ) { |
ti = BDY((LIST)BDY(t)); |
ti = BDY((LIST)BDY(t)); |
pb[QTOS((Q)ARG0(ti))] = db[QTOS((Q)ARG1(ti))]; |
pb[ZTOS((Q)ARG0(ti))] = db[ZTOS((Q)ARG1(ti))]; |
} |
} |
for ( t = trace; t; t = NEXT(t) ) { |
for ( t = trace; t; t = NEXT(t) ) { |
ti = BDY((LIST)BDY(t)); |
ti = BDY((LIST)BDY(t)); |
pb[QTOS((Q)ARG0(ti))] = recompute_trace(BDY((LIST)ARG1(ti)),pb,m); |
pb[ZTOS((Q)ARG0(ti))] = recompute_trace(BDY((LIST)ARG1(ti)),pb,m); |
if ( !pb[QTOS((Q)ARG0(ti))] ) { *rp = 0; return; } |
if ( !pb[ZTOS((Q)ARG0(ti))] ) { *rp = 0; return; } |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"."); fflush(asir_out); |
fprintf(asir_out,"."); fflush(asir_out); |
} |
} |
} |
} |
for ( t = intred; t; t = NEXT(t) ) { |
for ( t = intred; t; t = NEXT(t) ) { |
ti = BDY((LIST)BDY(t)); |
ti = BDY((LIST)BDY(t)); |
pb[QTOS((Q)ARG0(ti))] = recompute_trace(BDY((LIST)ARG1(ti)),pb,m); |
pb[ZTOS((Q)ARG0(ti))] = recompute_trace(BDY((LIST)ARG1(ti)),pb,m); |
if ( !pb[QTOS((Q)ARG0(ti))] ) { *rp = 0; return; } |
if ( !pb[ZTOS((Q)ARG0(ti))] ) { *rp = 0; return; } |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"*"); fflush(asir_out); |
fprintf(asir_out,"*"); fflush(asir_out); |
} |
} |
} |
} |
for ( r0 = 0, t = ind; t; t = NEXT(t) ) { |
for ( r0 = 0, t = ind; t; t = NEXT(t) ) { |
NEXTNODE(r0,r); |
NEXTNODE(r0,r); |
b = pb[QTOS((Q)BDY(t))]; |
b = pb[ZTOS((Q)BDY(t))]; |
ndv_mul_c(m,b,invm(HCM(b),m)); |
ndv_mul_c(m,b,invm(HCM(b),m)); |
#if 0 |
#if 0 |
BDY(r) = ndvtop(m,CO,vv,pb[QTOS((Q)BDY(t))]); |
BDY(r) = ndvtop(m,CO,vv,pb[ZTOS((Q)BDY(t))]); |
#else |
#else |
BDY(r) = ndvtodp(m,pb[QTOS((Q)BDY(t))]); |
BDY(r) = ndvtodp(m,pb[ZTOS((Q)BDY(t))]); |
#endif |
#endif |
} |
} |
if ( r0 ) NEXT(r) = 0; |
if ( r0 ) NEXT(r) = 0; |
Line 3650 void nd_gr_recompute_trace(LIST f,LIST v,int m,struct |
|
Line 4575 void nd_gr_recompute_trace(LIST f,LIST v,int m,struct |
|
if ( DP_Print ) fprintf(asir_out,"\n"); |
if ( DP_Print ) fprintf(asir_out,"\n"); |
} |
} |
|
|
void nd_gr_trace(LIST f,LIST v,int trace,int homo,int f4,struct order_spec *ord,LIST *rp) |
void nd_gr_trace(LIST f,LIST v,int trace,int homo,int retdp,int f4,struct order_spec *ord,LIST *rp) |
{ |
{ |
VL tv,fv,vv,vc,av; |
VL tv,fv,vv,vc,av; |
NODE fd,fd0,in0,in,r,r0,t,s,cand,alist; |
NODE fd,fd0,in0,in,r,r0,t,s,cand,alist; |
Line 3673 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
Line 4598 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
int *perm; |
int *perm; |
int j,ret; |
int j,ret; |
Z jq,bpe; |
Z jq,bpe; |
|
VECT hvect; |
|
|
nd_module = 0; |
nd_module = 0; |
nd_lf = 0; |
nd_lf = 0; |
Line 3727 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
Line 4653 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
for ( t = BDY(f), max = 1; t; t = NEXT(t) ) |
for ( t = BDY(f), max = 1; t; t = NEXT(t) ) |
for ( tv = vv; tv; tv = NEXT(tv) ) { |
for ( tv = vv; tv; tv = NEXT(tv) ) { |
if ( nd_module ) { |
if ( nd_module ) { |
|
if ( OID(BDY(t)) == O_DPM ) { |
|
e = dpm_getdeg((DPM)BDY(t),&trank); |
|
max = MAX(e,max); |
|
mrank = MAX(mrank,trank); |
|
} else { |
s = BDY((LIST)BDY(t)); |
s = BDY((LIST)BDY(t)); |
trank = length(s); |
trank = length(s); |
mrank = MAX(mrank,trank); |
mrank = MAX(mrank,trank); |
Line 3734 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
Line 4665 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
e = getdeg(tv->v,(P)BDY(s)); |
e = getdeg(tv->v,(P)BDY(s)); |
max = MAX(e,max); |
max = MAX(e,max); |
} |
} |
|
} |
} else { |
} else { |
e = getdeg(tv->v,(P)BDY(t)); |
e = getdeg(tv->v,(P)BDY(t)); |
max = MAX(e,max); |
max = MAX(e,max); |
Line 3744 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
Line 4676 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
ishomo = 1; |
ishomo = 1; |
for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
if ( nd_module ) { |
if ( nd_module ) { |
if ( !nd_gentrace ) pltozpl((LIST)BDY(t),&dmy,&zpl); |
if ( OID(BDY(t)) == O_DPM ) { |
else zpl = (LIST)BDY(t); |
Z cont; |
|
DPM zdpm; |
|
|
|
if ( !nd_gentrace ) dpm_ptozp((DPM)BDY(t),&cont,&zdpm); |
|
else zdpm = (DPM)BDY(t); |
|
c = (pointer)dpmtondv(m,zdpm); |
|
} else { |
|
if ( !nd_gentrace ) pltozpl((LIST)BDY(t),&dmy,&zpl); |
|
else zpl = (LIST)BDY(t); |
c = (pointer)pltondv(CO,vv,zpl); |
c = (pointer)pltondv(CO,vv,zpl); |
|
} |
} else { |
} else { |
if ( !nd_gentrace ) ptozp((P)BDY(t),1,&dmy,&zp); |
if ( !nd_gentrace ) ptozp((P)BDY(t),1,&dmy,&zp); |
else zp = (P)BDY(t); |
else zp = (P)BDY(t); |
c = (pointer)ptondv(CO,vv,zp); |
c = (pointer)ptondv(CO,vv,zp); |
} |
} |
if ( ishomo ) |
if ( ishomo ) |
ishomo = ishomo && ndv_ishomo(c); |
ishomo = ishomo && ndv_ishomo(c); |
Line 3778 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
Line 4719 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
tl1 = tl2 = tl3 = tl4 = 0; |
tl1 = tl2 = tl3 = tl4 = 0; |
if ( Demand ) |
if ( Demand ) |
nd_demand = 1; |
nd_demand = 1; |
ret = ndv_setup(m,1,fd0,nd_gbblock?1:0,0); |
ret = ndv_setup(m,1,fd0,nd_gbblock?1:0,0,0); |
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
MKLIST(l1,nd_tracelist); MKNODE(nd_alltracelist,l1,0); |
MKLIST(l1,nd_tracelist); MKNODE(nd_alltracelist,l1,0); |
} |
} |
Line 3790 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
Line 4731 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
else m = get_lprime(++mindex); |
else m = get_lprime(++mindex); |
continue; |
continue; |
} |
} |
|
if ( nd_gentrace ) { |
|
MKVECT(hvect,nd_psn); |
|
for ( i = 0; i < nd_psn; i++ ) |
|
ndltodp(nd_psh[i]->dl,(DP *)&BDY(hvect)[i]); |
|
} |
if ( !ishomo && homo ) { |
if ( !ishomo && homo ) { |
/* dehomogenization */ |
/* dehomogenization */ |
for ( t = cand; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord); |
for ( t = cand; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord); |
Line 3837 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
Line 4783 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
} |
} |
get_eg(&eg1); init_eg(&eg_check); add_eg(&eg_check,&eg0,&eg1); |
get_eg(&eg1); init_eg(&eg_check); add_eg(&eg_check,&eg0,&eg1); |
if ( DP_Print ) |
if ( DP_Print ) |
fprintf(asir_out,"check=%.3fsec,",eg_check.exectime+eg_check.gctime); |
fprintf(asir_out,"check=%.3fsec\n",eg_check.exectime); |
/* dp->p */ |
/* dp->p */ |
nd_bpe = cbpe; |
nd_bpe = cbpe; |
nd_setup_parameters(nd_nvar,0); |
nd_setup_parameters(nd_nvar,0); |
for ( r = cand; r; r = NEXT(r) ) { |
for ( r = cand; r; r = NEXT(r) ) { |
if ( nd_module ) BDY(r) = ndvtopl(0,CO,vv,BDY(r),mrank); |
if ( nd_module ) { |
else BDY(r) = (pointer)ndvtop(0,CO,vv,BDY(r)); |
if ( retdp ) BDY(r) = ndvtodpm(0,BDY(r)); |
|
else BDY(r) = ndvtopl(0,CO,vv,BDY(r),mrank); |
|
} else if ( retdp ) BDY(r) = ndvtodp(0,BDY(r)); |
|
else BDY(r) = (pointer)ndvtop(0,CO,vv,BDY(r)); |
} |
} |
if ( nd_nalg ) |
if ( nd_nalg ) |
cand = postprocess_algcoef(av,alist,cand); |
cand = postprocess_algcoef(av,alist,cand); |
Line 3855 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
Line 4804 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
for ( t = tl2; t; t = NEXT(t) ) { |
for ( t = tl2; t; t = NEXT(t) ) { |
/* s = [i,[*,j,*,*],...] */ |
/* s = [i,[*,j,*,*],...] */ |
s = BDY((LIST)BDY(t)); |
s = BDY((LIST)BDY(t)); |
j = perm[QTOS((Q)ARG0(s))]; STOQ(j,jq); ARG0(s) = (pointer)jq; |
j = perm[ZTOS((Q)ARG0(s))]; STOZ(j,jq); ARG0(s) = (pointer)jq; |
for ( s = BDY((LIST)ARG1(s)); s; s = NEXT(s) ) { |
for ( s = BDY((LIST)ARG1(s)); s; s = NEXT(s) ) { |
j = perm[QTOS((Q)ARG1(BDY((LIST)BDY(s))))]; STOQ(j,jq); |
j = perm[ZTOS((Q)ARG1(BDY((LIST)BDY(s))))]; STOZ(j,jq); |
ARG1(BDY((LIST)BDY(s))) = (pointer)jq; |
ARG1(BDY((LIST)BDY(s))) = (pointer)jq; |
} |
} |
} |
} |
for ( j = length(cand)-1, t = 0; j >= 0; j-- ) { |
for ( j = length(cand)-1, t = 0; j >= 0; j-- ) { |
STOQ(perm[j],jq); MKNODE(s,jq,t); t = s; |
STOZ(perm[j],jq); MKNODE(s,jq,t); t = s; |
} |
} |
MKLIST(l1,tl1); MKLIST(l2,tl2); MKLIST(l3,t); MKLIST(l4,tl3); |
MKLIST(l1,tl1); MKLIST(l2,tl2); MKLIST(l3,t); MKLIST(l4,tl3); |
MKLIST(l5,tl4); |
MKLIST(l5,tl4); |
STOQ(nd_bpe,bpe); |
STOZ(nd_bpe,bpe); |
tr = mknode(8,*rp,(!ishomo&&homo)?ONE:0,l1,l2,l3,l4,l5,bpe); MKLIST(*rp,tr); |
tr = mknode(9,*rp,(!ishomo&&homo)?ONE:0,l1,l2,l3,l4,l5,bpe,hvect); MKLIST(*rp,tr); |
} |
} |
} |
} |
|
|
Line 3919 DL ndltodl(int n,UINT *ndl) |
|
Line 4868 DL ndltodl(int n,UINT *ndl) |
|
return dl; |
return dl; |
} |
} |
|
|
|
void _ndltodl(UINT *ndl,DL dl) |
|
{ |
|
int *d; |
|
int i,j,l,s,ord_l,n; |
|
struct order_pair *op; |
|
|
|
n = nd_nvar; |
|
dl->td = TD(ndl); |
|
d = dl->d; |
|
if ( nd_blockmask ) { |
|
l = nd_blockmask->n; |
|
op = nd_blockmask->order_pair; |
|
for ( j = 0, s = 0; j < l; j++ ) { |
|
ord_l = op[j].length; |
|
for ( i = 0; i < ord_l; i++, s++ ) d[s] = GET_EXP(ndl,s); |
|
} |
|
} else { |
|
for ( i = 0; i < n; i++ ) d[i] = GET_EXP(ndl,i); |
|
} |
|
} |
|
|
void nmtodp(int mod,NM m,DP *r) |
void nmtodp(int mod,NM m,DP *r) |
{ |
{ |
DP dp; |
DP dp; |
Line 3931 void nmtodp(int mod,NM m,DP *r) |
|
Line 4901 void nmtodp(int mod,NM m,DP *r) |
|
*r = dp; |
*r = dp; |
} |
} |
|
|
|
void ndltodp(UINT *d,DP *r) |
|
{ |
|
DP dp; |
|
MP mr; |
|
|
|
NEWMP(mr); |
|
mr->dl = ndltodl(nd_nvar,d); |
|
mr->c = (Obj)ONE; |
|
NEXT(mr) = 0; MKDP(nd_nvar,mr,dp); dp->sugar = mr->dl->td; |
|
*r = dp; |
|
} |
|
|
void ndl_print(UINT *dl) |
void ndl_print(UINT *dl) |
{ |
{ |
int n; |
int n; |
Line 3964 void nd_print(ND p) |
|
Line 4946 void nd_print(ND p) |
|
else { |
else { |
for ( m = BDY(p); m; m = NEXT(m) ) { |
for ( m = BDY(p); m; m = NEXT(m) ) { |
if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m))); |
if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m))); |
else printf("+%d*",CM(m)); |
else printf("+%ld*",CM(m)); |
ndl_print(DL(m)); |
ndl_print(DL(m)); |
} |
} |
printf("\n"); |
printf("\n"); |
Line 3980 void nd_print_q(ND p) |
|
Line 4962 void nd_print_q(ND p) |
|
else { |
else { |
for ( m = BDY(p); m; m = NEXT(m) ) { |
for ( m = BDY(p); m; m = NEXT(m) ) { |
printf("+"); |
printf("+"); |
printexpr(CO,(Obj)CQ(m)); |
printexpr(CO,(Obj)CZ(m)); |
printf("*"); |
printf("*"); |
ndl_print(DL(m)); |
ndl_print(DL(m)); |
} |
} |
Line 4014 void nd_removecont(int mod,ND p) |
|
Line 4996 void nd_removecont(int mod,ND p) |
|
w = (Z *)MALLOC(n*sizeof(Q)); |
w = (Z *)MALLOC(n*sizeof(Q)); |
v.len = n; |
v.len = n; |
v.body = (pointer *)w; |
v.body = (pointer *)w; |
for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m); |
for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CZ(m); |
removecont_array((P *)w,n,1); |
removecont_array((P *)w,n,1); |
for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CQ(m) = w[i]; |
for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CZ(m) = w[i]; |
} |
} |
} |
} |
|
|
Line 4035 void nd_removecont2(ND p1,ND p2) |
|
Line 5017 void nd_removecont2(ND p1,ND p2) |
|
v.body = (pointer *)w; |
v.body = (pointer *)w; |
i = 0; |
i = 0; |
if ( p1 ) |
if ( p1 ) |
for ( m = BDY(p1); i < n1; m = NEXT(m), i++ ) w[i] = CQ(m); |
for ( m = BDY(p1); i < n1; m = NEXT(m), i++ ) w[i] = CZ(m); |
if ( p2 ) |
if ( p2 ) |
for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CQ(m); |
for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CZ(m); |
removecont_array((P *)w,n,1); |
removecont_array((P *)w,n,1); |
i = 0; |
i = 0; |
if ( p1 ) |
if ( p1 ) |
for ( m = BDY(p1); i < n1; m = NEXT(m), i++ ) CQ(m) = w[i]; |
for ( m = BDY(p1); i < n1; m = NEXT(m), i++ ) CZ(m) = w[i]; |
if ( p2 ) |
if ( p2 ) |
for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CQ(m) = w[i]; |
for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CZ(m) = w[i]; |
} |
} |
|
|
void ndv_removecont(int mod,NDV p) |
void ndv_removecont(int mod,NDV p) |
Line 4095 void ndv_homogenize(NDV p,int obpe,int oadv,EPOS oepos |
|
Line 5077 void ndv_homogenize(NDV p,int obpe,int oadv,EPOS oepos |
|
NMV m,mr0,mr,t; |
NMV m,mr0,mr,t; |
|
|
len = p->len; |
len = p->len; |
for ( m = BDY(p), i = 0, max = 1; i < len; NMV_OADV(m), i++ ) |
for ( m = BDY(p), i = 0, max = 0; i < len; NMV_OADV(m), i++ ) |
max = MAX(max,TD(DL(m))); |
max = MAX(max,TD(DL(m))); |
mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p); |
mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p); |
m = (NMV)((char *)mr0+(len-1)*oadv); |
m = (NMV)((char *)mr0+(len-1)*oadv); |
Line 4103 void ndv_homogenize(NDV p,int obpe,int oadv,EPOS oepos |
|
Line 5085 void ndv_homogenize(NDV p,int obpe,int oadv,EPOS oepos |
|
t = (NMV)MALLOC(nmv_adv); |
t = (NMV)MALLOC(nmv_adv); |
for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) { |
for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) { |
ndl_homogenize(DL(m),DL(t),obpe,oepos,ompos,max); |
ndl_homogenize(DL(m),DL(t),obpe,oepos,ompos,max); |
CQ(mr) = CQ(m); |
CZ(mr) = CZ(m); |
ndl_copy(DL(t),DL(mr)); |
ndl_copy(DL(t),DL(mr)); |
} |
} |
NV(p)++; |
NV(p)++; |
Line 4128 void ndv_dehomogenize(NDV p,struct order_spec *ord) |
|
Line 5110 void ndv_dehomogenize(NDV p,struct order_spec *ord) |
|
if ( newwpd != nd_wpd ) { |
if ( newwpd != nd_wpd ) { |
newadv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(newwpd-1)*sizeof(UINT)); |
newadv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(newwpd-1)*sizeof(UINT)); |
for ( m = r = BDY(p), i = 0; i < len; NMV_ADV(m), NDV_NADV(r), i++ ) { |
for ( m = r = BDY(p), i = 0; i < len; NMV_ADV(m), NDV_NADV(r), i++ ) { |
CQ(r) = CQ(m); |
CZ(r) = CZ(m); |
if ( nd_module ) pos = MPOS(DL(m)); |
if ( nd_module ) pos = MPOS(DL(m)); |
for ( j = 0; j < newexporigin; j++ ) DL(r)[j] = DL(m)[j]; |
for ( j = 0; j < newexporigin; j++ ) DL(r)[j] = DL(m)[j]; |
adj = nd_exporigin-newexporigin; |
adj = nd_exporigin-newexporigin; |
Line 4219 void removecont_array_q(Z *c,int n) |
|
Line 5201 void removecont_array_q(Z *c,int n) |
|
v.id = O_VECT; v.len = n; v.body = (pointer *)r; |
v.id = O_VECT; v.len = n; v.body = (pointer *)r; |
gcdvz(&v,&d1); |
gcdvz(&v,&d1); |
gcdz(d0,d1,&gcd); |
gcdz(d0,d1,&gcd); |
divz(d0,gcd,&a); |
/* exact division */ |
|
divsz(d0,gcd,&a); |
for ( i = 0; i < n; i++ ) { |
for ( i = 0; i < n; i++ ) { |
mulz(a,q[i],&u); |
mulz(a,q[i],&u); |
if ( r[i] ) { |
if ( r[i] ) { |
divz(r[i],gcd,&u1); |
/* exact division */ |
|
divsz(r[i],gcd,&u1); |
addz(u,u1,&q[i]); |
addz(u,u1,&q[i]); |
} else |
} else |
q[i] = u; |
q[i] = u; |
Line 4238 void mpz_removecont_array(mpz_t *c,int n) |
|
Line 5222 void mpz_removecont_array(mpz_t *c,int n) |
|
{ |
{ |
mpz_t d0,a,u,u1,gcd; |
mpz_t d0,a,u,u1,gcd; |
int i,j; |
int i,j; |
mpz_t *q,*r; |
static mpz_t *q,*r; |
|
static int c_len = 0; |
|
|
for ( i = 0; i < n; i++ ) |
for ( i = 0; i < n; i++ ) |
if ( mpz_sgn(c[i]) ) break; |
if ( mpz_sgn(c[i]) ) break; |
if ( i == n ) return; |
if ( i == n ) return; |
gcdv_mpz_estimate(d0,c,n); |
gcdv_mpz_estimate(d0,c,n); |
q = (mpz_t *)MALLOC(n*sizeof(mpz_t)); |
if ( n > c_len ) { |
r = (mpz_t *)MALLOC(n*sizeof(mpz_t)); |
q = (mpz_t *)MALLOC(n*sizeof(mpz_t)); |
|
r = (mpz_t *)MALLOC(n*sizeof(mpz_t)); |
|
c_len = n; |
|
} |
for ( i = 0; i < n; i++ ) { |
for ( i = 0; i < n; i++ ) { |
mpz_init(q[i]); mpz_init(r[i]); |
mpz_init(q[i]); mpz_init(r[i]); |
mpz_fdiv_qr(q[i],r[i],c[i],d0); |
mpz_fdiv_qr(q[i],r[i],c[i],d0); |
Line 4417 UINT *nd_compute_bound(ND p) |
|
Line 5405 UINT *nd_compute_bound(ND p) |
|
int nd_get_exporigin(struct order_spec *ord) |
int nd_get_exporigin(struct order_spec *ord) |
{ |
{ |
switch ( ord->id ) { |
switch ( ord->id ) { |
case 0: case 2: case 256: case 258: |
case 0: case 2: case 256: case 258: case 300: |
return 1+nd_module; |
return 1+nd_module; |
case 1: case 257: |
case 1: case 257: |
/* block order */ |
/* block order */ |
Line 4553 ND_pairs nd_reconstruct(int trace,ND_pairs d) |
|
Line 5541 ND_pairs nd_reconstruct(int trace,ND_pairs d) |
|
NEXTND_pairs(s0,s); |
NEXTND_pairs(s0,s); |
s->i1 = t->i1; |
s->i1 = t->i1; |
s->i2 = t->i2; |
s->i2 = t->i2; |
|
s->sig = t->sig; |
SG(s) = SG(t); |
SG(s) = SG(t); |
ndl_reconstruct(LCM(t),LCM(s),obpe,oepos); |
ndl_reconstruct(LCM(t),LCM(s),obpe,oepos); |
} |
} |
Line 4571 ND_pairs nd_reconstruct(int trace,ND_pairs d) |
|
Line 5560 ND_pairs nd_reconstruct(int trace,ND_pairs d) |
|
h = ndl_hash_value(DL(mr)); |
h = ndl_hash_value(DL(mr)); |
NEXT(mr) = nd_red[h]; |
NEXT(mr) = nd_red[h]; |
nd_red[h] = mr; |
nd_red[h] = mr; |
|
mr->sig = r->sig; |
} |
} |
for ( i = 0; i < REDTAB_LEN; i++ ) old_red[i] = 0; |
for ( i = 0; i < REDTAB_LEN; i++ ) old_red[i] = 0; |
old_red = 0; |
old_red = 0; |
for ( i = 0; i < nd_psn; i++ ) { |
for ( i = 0; i < nd_psn; i++ ) { |
NEWRHist(r); SG(r) = SG(nd_psh[i]); |
NEWRHist(r); SG(r) = SG(nd_psh[i]); |
ndl_reconstruct(DL(nd_psh[i]),DL(r),obpe,oepos); |
ndl_reconstruct(DL(nd_psh[i]),DL(r),obpe,oepos); |
|
r->sig = nd_psh[i]->sig; |
nd_psh[i] = r; |
nd_psh[i] = r; |
} |
} |
if ( s0 ) NEXT(s) = 0; |
if ( s0 ) NEXT(s) = 0; |
Line 4588 ND_pairs nd_reconstruct(int trace,ND_pairs d) |
|
Line 5579 ND_pairs nd_reconstruct(int trace,ND_pairs d) |
|
return s0; |
return s0; |
} |
} |
|
|
|
void nd_reconstruct_s(int trace,ND_pairs *d) |
|
{ |
|
int i,obpe,oadv,h; |
|
static NM prev_nm_free_list; |
|
static ND_pairs prev_ndp_free_list; |
|
RHist mr0,mr; |
|
RHist r; |
|
RHist *old_red; |
|
ND_pairs s0,s,t; |
|
EPOS oepos; |
|
|
|
obpe = nd_bpe; |
|
oadv = nmv_adv; |
|
oepos = nd_epos; |
|
if ( obpe < 2 ) nd_bpe = 2; |
|
else if ( obpe < 3 ) nd_bpe = 3; |
|
else if ( obpe < 4 ) nd_bpe = 4; |
|
else if ( obpe < 5 ) nd_bpe = 5; |
|
else if ( obpe < 6 ) nd_bpe = 6; |
|
else if ( obpe < 8 ) nd_bpe = 8; |
|
else if ( obpe < 10 ) nd_bpe = 10; |
|
else if ( obpe < 16 ) nd_bpe = 16; |
|
else if ( obpe < 32 ) nd_bpe = 32; |
|
else error("nd_reconstruct_s : exponent too large"); |
|
|
|
nd_setup_parameters(nd_nvar,0); |
|
prev_nm_free_list = _nm_free_list; |
|
prev_ndp_free_list = _ndp_free_list; |
|
_nm_free_list = 0; |
|
_ndp_free_list = 0; |
|
for ( i = nd_psn-1; i >= 0; i-- ) { |
|
ndv_realloc(nd_ps[i],obpe,oadv,oepos); |
|
ndv_realloc(nd_ps_sym[i],obpe,oadv,oepos); |
|
} |
|
if ( trace ) |
|
for ( i = nd_psn-1; i >= 0; i-- ) { |
|
ndv_realloc(nd_ps_trace[i],obpe,oadv,oepos); |
|
ndv_realloc(nd_ps_trace_sym[i],obpe,oadv,oepos); |
|
} |
|
|
|
for ( i = 0; i < nd_nbase; i++ ) { |
|
s0 = 0; |
|
for ( t = d[i]; t; t = NEXT(t) ) { |
|
NEXTND_pairs(s0,s); |
|
s->i1 = t->i1; |
|
s->i2 = t->i2; |
|
s->sig = t->sig; |
|
SG(s) = SG(t); |
|
ndl_reconstruct(LCM(t),LCM(s),obpe,oepos); |
|
} |
|
d[i] = s0; |
|
} |
|
|
|
old_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist)); |
|
for ( i = 0; i < REDTAB_LEN; i++ ) { |
|
old_red[i] = nd_red[i]; |
|
nd_red[i] = 0; |
|
} |
|
for ( i = 0; i < REDTAB_LEN; i++ ) |
|
for ( r = old_red[i]; r; r = NEXT(r) ) { |
|
NEWRHist(mr); |
|
mr->index = r->index; |
|
SG(mr) = SG(r); |
|
ndl_reconstruct(DL(r),DL(mr),obpe,oepos); |
|
h = ndl_hash_value(DL(mr)); |
|
NEXT(mr) = nd_red[h]; |
|
nd_red[h] = mr; |
|
mr->sig = r->sig; |
|
} |
|
for ( i = 0; i < REDTAB_LEN; i++ ) old_red[i] = 0; |
|
old_red = 0; |
|
for ( i = 0; i < nd_psn; i++ ) { |
|
NEWRHist(r); SG(r) = SG(nd_psh[i]); |
|
ndl_reconstruct(DL(nd_psh[i]),DL(r),obpe,oepos); |
|
r->sig = nd_psh[i]->sig; |
|
nd_psh[i] = r; |
|
} |
|
if ( s0 ) NEXT(s) = 0; |
|
prev_nm_free_list = 0; |
|
prev_ndp_free_list = 0; |
|
#if 0 |
|
GC_gcollect(); |
|
#endif |
|
} |
|
|
void ndl_reconstruct(UINT *d,UINT *r,int obpe,EPOS oepos) |
void ndl_reconstruct(UINT *d,UINT *r,int obpe,EPOS oepos) |
{ |
{ |
int n,i,ei,oepw,omask0,j,s,ord_l,l; |
int n,i,ei,oepw,omask0,j,s,ord_l,l; |
Line 4684 int nd_sp(int mod,int trace,ND_pairs p,ND *rp) |
|
Line 5760 int nd_sp(int mod,int trace,ND_pairs p,ND *rp) |
|
divsp(nd_vc,HCP(p2),gp,&CP(m1)); |
divsp(nd_vc,HCP(p2),gp,&CP(m1)); |
divsp(nd_vc,HCP(p1),gp,&tp); chsgnp(tp,&CP(m2)); |
divsp(nd_vc,HCP(p1),gp,&tp); chsgnp(tp,&CP(m2)); |
} else { |
} else { |
igcd_cofactor(HCQ(p1),HCQ(p2),&g,&t,&CQ(m1)); chsgnz(t,&CQ(m2)); |
igcd_cofactor(HCZ(p1),HCZ(p2),&g,&t,&CZ(m1)); chsgnz(t,&CZ(m2)); |
} |
} |
t1 = ndv_mul_nm(mod,m1,p1); t2 = ndv_mul_nm(mod,m2,p2); |
t1 = ndv_mul_nm(mod,m1,p1); t2 = ndv_mul_nm(mod,m2,p2); |
*rp = nd_add(mod,t1,t2); |
*rp = nd_add(mod,t1,t2); |
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
/* nd_tracelist is initialized */ |
/* nd_tracelist is initialized */ |
STOQ(p->i1,iq); nmtodp(mod,m1,&d); node = mknode(4,ONE,iq,d,ONE); |
STOZ(p->i1,iq); nmtodp(mod,m1,&d); node = mknode(4,ONE,iq,d,ONE); |
MKLIST(hist,node); MKNODE(nd_tracelist,hist,0); |
MKLIST(hist,node); MKNODE(nd_tracelist,hist,0); |
STOQ(p->i2,iq); nmtodp(mod,m2,&d); node = mknode(4,ONE,iq,d,ONE); |
STOZ(p->i2,iq); nmtodp(mod,m2,&d); node = mknode(4,ONE,iq,d,ONE); |
MKLIST(hist,node); MKNODE(node,hist,nd_tracelist); |
MKLIST(hist,node); MKNODE(node,hist,nd_tracelist); |
nd_tracelist = node; |
nd_tracelist = node; |
} |
} |
|
if ( *rp ) |
|
(*rp)->sig = p->sig; |
FREENM(m1); FREENM(m2); |
FREENM(m1); FREENM(m2); |
return 1; |
return 1; |
} |
} |
Line 4739 void ndv_mul_c_q(NDV p,Z mul) |
|
Line 5817 void ndv_mul_c_q(NDV p,Z mul) |
|
if ( !p ) return; |
if ( !p ) return; |
len = LEN(p); |
len = LEN(p); |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
mulz(CQ(m),mul,&c); CQ(m) = c; |
mulz(CZ(m),mul,&c); CZ(m) = c; |
} |
} |
} |
} |
|
|
Line 4805 void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *ta |
|
Line 5883 void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *ta |
|
} else if ( nd_vc ) |
} else if ( nd_vc ) |
mulp(nd_vc,CP(m0),CP(m1),&CP(m)); |
mulp(nd_vc,CP(m0),CP(m1),&CP(m)); |
else |
else |
mulz(CQ(m0),CQ(m1),&CQ(m)); |
mulz(CZ(m0),CZ(m1),&CZ(m)); |
for ( i = 0; i < nd_wpd; i++ ) d[i] = 0; |
for ( i = 0; i < nd_wpd; i++ ) d[i] = 0; |
homo = n&1 ? 1 : 0; |
homo = n&1 ? 1 : 0; |
if ( homo ) { |
if ( homo ) { |
Line 4862 void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *ta |
|
Line 5940 void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *ta |
|
} else if ( nd_vc ) |
} else if ( nd_vc ) |
mulp(nd_vc,CP(tab[u]),(P)q,&CP(tab[u])); |
mulp(nd_vc,CP(tab[u]),(P)q,&CP(tab[u])); |
else { |
else { |
mulz(CQ(tab[u]),q,&q1); CQ(tab[u]) = q1; |
mulz(CZ(tab[u]),q,&q1); CZ(tab[u]) = q1; |
} |
} |
} |
} |
} |
} |
Line 4876 void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *ta |
|
Line 5954 void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *ta |
|
} else if ( nd_vc ) |
} else if ( nd_vc ) |
mulp(nd_vc,CP(tab[u]),(P)q,&CP(t)); |
mulp(nd_vc,CP(tab[u]),(P)q,&CP(t)); |
else |
else |
mulz(CQ(tab[u]),q,&CQ(t)); |
mulz(CZ(tab[u]),q,&CZ(t)); |
*p = t; |
*p = t; |
} |
} |
} |
} |
Line 5016 ND nd_quo(int mod,PGeoBucket bucket,NDV d) |
|
Line 6094 ND nd_quo(int mod,PGeoBucket bucket,NDV d) |
|
DMAR(c1,c2,0,mod,c); CM(mq) = c; |
DMAR(c1,c2,0,mod,c); CM(mq) = c; |
CM(tm) = mod-c; |
CM(tm) = mod-c; |
} else { |
} else { |
divsz(HCQ(p),HCQ(d),&CQ(mq)); |
divsz(HCZ(p),HCZ(d),&CZ(mq)); |
chsgnz(CQ(mq),&CQ(tm)); |
chsgnz(CZ(mq),&CZ(tm)); |
} |
} |
t = ndv_mul_nmv_trunc(mod,tm,d,HDL(d)); |
t = ndv_mul_nmv_trunc(mod,tm,d,HDL(d)); |
bucket->body[hindex] = nd_remove_head(p); |
bucket->body[hindex] = nd_remove_head(p); |
Line 5049 void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos) |
|
Line 6127 void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos) |
|
mr = (NMV)((char *)mr0+(len-1)*nmv_adv); |
mr = (NMV)((char *)mr0+(len-1)*nmv_adv); |
t = (NMV)MALLOC(nmv_adv); |
t = (NMV)MALLOC(nmv_adv); |
for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) { |
for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) { |
CQ(t) = CQ(m); |
CZ(t) = CZ(m); |
for ( k = 0; k < nd_wpd; k++ ) DL(t)[k] = 0; |
for ( k = 0; k < nd_wpd; k++ ) DL(t)[k] = 0; |
ndl_reconstruct(DL(m),DL(t),obpe,oepos); |
ndl_reconstruct(DL(m),DL(t),obpe,oepos); |
CQ(mr) = CQ(t); |
CZ(mr) = CZ(t); |
ndl_copy(DL(t),DL(mr)); |
ndl_copy(DL(t),DL(mr)); |
} |
} |
BDY(p) = mr0; |
BDY(p) = mr0; |
Line 5070 NDV ndv_dup_realloc(NDV p,int obpe,int oadv,EPOS oepos |
|
Line 6148 NDV ndv_dup_realloc(NDV p,int obpe,int oadv,EPOS oepos |
|
for ( i = 0; i < len; i++, NMV_OADV(m), NMV_ADV(mr) ) { |
for ( i = 0; i < len; i++, NMV_OADV(m), NMV_ADV(mr) ) { |
ndl_zero(DL(mr)); |
ndl_zero(DL(mr)); |
ndl_reconstruct(DL(m),DL(mr),obpe,oepos); |
ndl_reconstruct(DL(m),DL(mr),obpe,oepos); |
CQ(mr) = CQ(m); |
CZ(mr) = CZ(m); |
} |
} |
MKNDV(NV(p),mr0,len,r); |
MKNDV(NV(p),mr0,len,r); |
SG(r) = SG(p); |
SG(r) = SG(p); |
|
r->sig = p->sig; |
return r; |
return r; |
} |
} |
|
|
Line 5090 NDV ndv_dup(int mod,NDV p) |
|
Line 6169 NDV ndv_dup(int mod,NDV p) |
|
m0 = m = (NMV)((mod>0 || mod==-1)?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv)); |
m0 = m = (NMV)((mod>0 || mod==-1)?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv)); |
for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t), NMV_ADV(m) ) { |
for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t), NMV_ADV(m) ) { |
ndl_copy(DL(t),DL(m)); |
ndl_copy(DL(t),DL(m)); |
CQ(m) = CQ(t); |
CZ(m) = CZ(t); |
} |
} |
MKNDV(NV(p),m0,len,d); |
MKNDV(NV(p),m0,len,d); |
SG(d) = SG(p); |
SG(d) = SG(p); |
Line 5108 NDV ndv_symbolic(int mod,NDV p) |
|
Line 6187 NDV ndv_symbolic(int mod,NDV p) |
|
m0 = m = (NMV)((mod>0||mod==-1)?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv)); |
m0 = m = (NMV)((mod>0||mod==-1)?MALLOC_ATOMIC(len*nmv_adv):MALLOC(len*nmv_adv)); |
for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t), NMV_ADV(m) ) { |
for ( t = BDY(p), i = 0; i < len; i++, NMV_ADV(t), NMV_ADV(m) ) { |
ndl_copy(DL(t),DL(m)); |
ndl_copy(DL(t),DL(m)); |
CQ(m) = ONE; |
CZ(m) = ONE; |
} |
} |
MKNDV(NV(p),m0,len,d); |
MKNDV(NV(p),m0,len,d); |
SG(d) = SG(p); |
SG(d) = SG(p); |
Line 5124 ND nd_dup(ND p) |
|
Line 6203 ND nd_dup(ND p) |
|
for ( m0 = 0, t = BDY(p); t; t = NEXT(t) ) { |
for ( m0 = 0, t = BDY(p); t; t = NEXT(t) ) { |
NEXTNM(m0,m); |
NEXTNM(m0,m); |
ndl_copy(DL(t),DL(m)); |
ndl_copy(DL(t),DL(m)); |
CQ(m) = CQ(t); |
CZ(m) = CZ(t); |
} |
} |
if ( m0 ) NEXT(m) = 0; |
if ( m0 ) NEXT(m) = 0; |
MKND(NV(p),m0,LEN(p),d); |
MKND(NV(p),m0,LEN(p),d); |
Line 5173 void ndv_mod(int mod,NDV p) |
|
Line 6252 void ndv_mod(int mod,NDV p) |
|
nd_subst_vector(nd_vc,CP(t),nd_subst,&cp); |
nd_subst_vector(nd_vc,CP(t),nd_subst,&cp); |
c = (Z)cp; |
c = (Z)cp; |
} else |
} else |
c = CQ(t); |
c = CZ(t); |
r = remqi((Q)c,mod); |
r = remqi((Q)c,mod); |
if ( r ) { |
if ( r ) { |
CM(d) = r; |
CM(d) = r; |
Line 5195 NDV ptondv(VL vl,VL dvl,P p) |
|
Line 6274 NDV ptondv(VL vl,VL dvl,P p) |
|
|
|
void pltozpl(LIST l,Q *cont,LIST *pp) |
void pltozpl(LIST l,Q *cont,LIST *pp) |
{ |
{ |
NODE nd,nd1; |
NODE nd,nd1; |
int n; |
int n; |
P *pl; |
P *pl; |
Q *cl; |
Q *cl; |
int i; |
int i; |
P dmy; |
P dmy; |
Z dvr; |
Z dvr,inv; |
LIST r; |
LIST r; |
|
|
nd = BDY(l); n = length(nd); |
nd = BDY(l); n = length(nd); |
pl = (P *)MALLOC(n*sizeof(P)); |
pl = (P *)MALLOC(n*sizeof(P)); |
cl = (Q *)MALLOC(n*sizeof(P)); |
cl = (Q *)MALLOC(n*sizeof(Q)); |
for ( i = 0; i < n; i++, nd = NEXT(nd) ) |
for ( i = 0; i < n; i++, nd = NEXT(nd) ) { |
ptozp((P)BDY(nd),1,&cl[i],&dmy); |
ptozp((P)BDY(nd),1,&cl[i],&dmy); |
qltozl(cl,n,&dvr); |
} |
nd = BDY(l); |
qltozl(cl,n,&dvr); |
for ( i = 0; i < n; i++, nd = NEXT(nd) ) { |
divz(ONE,dvr,&inv); |
divsp(CO,(P)BDY(nd),(P)dvr,&pl[i]); |
nd = BDY(l); |
} |
for ( i = 0; i < n; i++, nd = NEXT(nd) ) |
nd = 0; |
divsp(CO,(P)BDY(nd),(P)dvr,&pl[i]); |
for ( i = n-1; i >= 0; i-- ) { |
nd = 0; |
MKNODE(nd1,pl[i],nd); nd = nd1; |
for ( i = n-1; i >= 0; i-- ) { |
} |
MKNODE(nd1,pl[i],nd); nd = nd1; |
MKLIST(r,nd); |
} |
*pp = r; |
MKLIST(r,nd); |
|
*pp = r; |
} |
} |
|
|
/* (a1,a2,...,an) -> a1*e(1)+...+an*e(n) */ |
/* (a1,a2,...,an) -> a1*e(1)+...+an*e(n) */ |
Line 5266 ND ptond(VL vl,VL dvl,P p) |
|
Line 6346 ND ptond(VL vl,VL dvl,P p) |
|
ndl_zero(DL(m)); |
ndl_zero(DL(m)); |
if ( !INT((Q)p) ) |
if ( !INT((Q)p) ) |
error("ptond : input must be integer-coefficient"); |
error("ptond : input must be integer-coefficient"); |
CQ(m) = (Z)p; |
CZ(m) = (Z)p; |
NEXT(m) = 0; |
NEXT(m) = 0; |
MKND(nd_nvar,m,1,r); |
MKND(nd_nvar,m,1,r); |
SG(r) = 0; |
SG(r) = 0; |
Line 5287 ND ptond(VL vl,VL dvl,P p) |
|
Line 6367 ND ptond(VL vl,VL dvl,P p) |
|
} else { |
} else { |
NEWNM(m0); d = DL(m0); |
NEWNM(m0); d = DL(m0); |
for ( j = k-1, s = 0; j >= 0; j-- ) { |
for ( j = k-1, s = 0; j >= 0; j-- ) { |
ndl_zero(d); e = QTOS(DEG(w[j])); PUT_EXP(d,i,e); |
ndl_zero(d); e = ZTOS(DEG(w[j])); PUT_EXP(d,i,e); |
TD(d) = MUL_WEIGHT(e,i); |
TD(d) = MUL_WEIGHT(e,i); |
if ( nd_blockmask) ndl_weight_mask(d); |
if ( nd_blockmask) ndl_weight_mask(d); |
if ( nd_module ) MPOS(d) = 0; |
if ( nd_module ) MPOS(d) = 0; |
Line 5325 P ndvtop(int mod,VL vl,VL dvl,NDV p) |
|
Line 6405 P ndvtop(int mod,VL vl,VL dvl,NDV p) |
|
} else if ( mod == -2 ) { |
} else if ( mod == -2 ) { |
c = (P)CZ(m); |
c = (P)CZ(m); |
} else if ( mod > 0 ) { |
} else if ( mod > 0 ) { |
STOQ(CM(m),q); c = (P)q; |
STOZ(CM(m),q); c = (P)q; |
} else |
} else |
c = CP(m); |
c = CP(m); |
d = DL(m); |
d = DL(m); |
for ( i = 0, t = c, tvl = dvl; i < n; tvl = NEXT(tvl), i++ ) { |
for ( i = 0, t = c, tvl = dvl; i < n; tvl = NEXT(tvl), i++ ) { |
MKV(tvl->v,r); e = GET_EXP(d,i); STOQ(e,q); |
MKV(tvl->v,r); e = GET_EXP(d,i); STOZ(e,q); |
pwrp(vl,r,q,&u); mulp(vl,t,u,&w); t = w; |
pwrp(vl,r,q,&u); mulp(vl,t,u,&w); t = w; |
} |
} |
addp(vl,s,t,&u); s = u; |
addp(vl,s,t,&u); s = u; |
Line 5364 LIST ndvtopl(int mod,VL vl,VL dvl,NDV p,int rank) |
|
Line 6444 LIST ndvtopl(int mod,VL vl,VL dvl,NDV p,int rank) |
|
if ( mod == -1 ) { |
if ( mod == -1 ) { |
e = IFTOF(CM(m)); MKGFS(e,gfs); c = (P)gfs; |
e = IFTOF(CM(m)); MKGFS(e,gfs); c = (P)gfs; |
} else if ( mod ) { |
} else if ( mod ) { |
STOQ(CM(m),q); c = (P)q; |
STOZ(CM(m),q); c = (P)q; |
} else |
} else |
c = CP(m); |
c = CP(m); |
d = DL(m); |
d = DL(m); |
for ( i = 0, t = c, tvl = dvl; i < n; tvl = NEXT(tvl), i++ ) { |
for ( i = 0, t = c, tvl = dvl; i < n; tvl = NEXT(tvl), i++ ) { |
MKV(tvl->v,r); e = GET_EXP(d,i); STOQ(e,q); |
MKV(tvl->v,r); e = GET_EXP(d,i); STOZ(e,q); |
pwrp(vl,r,q,&u); mulp(vl,t,u,&w); t = w; |
pwrp(vl,r,q,&u); mulp(vl,t,u,&w); t = w; |
} |
} |
addp(vl,a[MPOS(d)],t,&u); a[MPOS(d)] = u; |
addp(vl,a[MPOS(d)],t,&u); a[MPOS(d)] = u; |
Line 5401 NDV ndtondv(int mod,ND p) |
|
Line 6481 NDV ndtondv(int mod,ND p) |
|
#endif |
#endif |
for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) { |
for ( t = BDY(p), i = 0; t; t = NEXT(t), i++, NMV_ADV(m) ) { |
ndl_copy(DL(t),DL(m)); |
ndl_copy(DL(t),DL(m)); |
CQ(m) = CQ(t); |
CZ(m) = CZ(t); |
} |
} |
MKNDV(NV(p),m0,len,d); |
MKNDV(NV(p),m0,len,d); |
SG(d) = SG(p); |
SG(d) = SG(p); |
|
d->sig = p->sig; |
return d; |
return d; |
} |
} |
|
|
|
static int dmm_comp_nv; |
|
|
|
int dmm_comp(DMM *a,DMM *b) |
|
{ |
|
return -compdmm(dmm_comp_nv,*a,*b); |
|
} |
|
|
|
void dmm_sort_by_ord(DMM *a,int len,int nv) |
|
{ |
|
dmm_comp_nv = nv; |
|
qsort(a,len,sizeof(DMM),(int (*)(const void *,const void *))dmm_comp); |
|
} |
|
|
|
void dpm_sort(DPM p,DPM *rp) |
|
{ |
|
DMM t,t1; |
|
int len,i,n; |
|
DMM *a; |
|
DPM d; |
|
|
|
if ( !p ) *rp = 0; |
|
for ( t = BDY(p), len = 0; t; t = NEXT(t), len++ ); |
|
a = (DMM *)MALLOC(len*sizeof(DMM)); |
|
for ( i = 0, t = BDY(p); i < len; i++, t = NEXT(t) ) a[i] = t; |
|
n = p->nv; |
|
dmm_sort_by_ord(a,len,n); |
|
t = 0; |
|
for ( i = len-1; i >= 0; i-- ) { |
|
NEWDMM(t1); |
|
t1->c = a[i]->c; |
|
t1->dl = a[i]->dl; |
|
t1->pos = a[i]->pos; |
|
t1->next = t; |
|
t = t1; |
|
} |
|
MKDPM(n,t,d); |
|
SG(d) = SG(p); |
|
*rp = d; |
|
} |
|
|
|
int dpm_comp(DPM *a,DPM *b) |
|
{ |
|
return -compdpm(CO,*a,*b); |
|
} |
|
|
|
NODE dpm_sort_list(NODE l) |
|
{ |
|
int i,len; |
|
NODE t,t1; |
|
DPM *a; |
|
|
|
len = length(l); |
|
a = (DPM *)MALLOC(len*sizeof(DPM)); |
|
for ( t = l, i = 0; i < len; i++, t = NEXT(t) ) a[i] = (DPM)BDY(t); |
|
qsort(a,len,sizeof(DPM),(int (*)(const void *,const void *))dpm_comp); |
|
t = 0; |
|
for ( i = len-1; i >= 0; i-- ) { |
|
MKNODE(t1,(pointer)a[i],t); t = t1; |
|
} |
|
return t; |
|
} |
|
|
|
int nmv_comp(NMV a,NMV b) |
|
{ |
|
int t; |
|
t = DL_COMPARE(a->dl,b->dl); |
|
return -t; |
|
} |
|
|
|
NDV dpmtondv(int mod,DPM p) |
|
{ |
|
NDV d; |
|
NMV m,m0; |
|
DMM t; |
|
DMM *a; |
|
int i,len,n; |
|
|
|
if ( !p ) return 0; |
|
for ( t = BDY(p), len = 0; t; t = NEXT(t), len++ ); |
|
a = (DMM *)MALLOC(len*sizeof(DMM)); |
|
for ( i = 0, t = BDY(p); i < len; i++, t = NEXT(t) ) a[i] = t; |
|
n = p->nv; |
|
dmm_sort_by_ord(a,len,n); |
|
if ( mod > 0 || mod == -1 ) |
|
m0 = m = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(len*nmv_adv); |
|
else |
|
m0 = m = MALLOC(len*nmv_adv); |
|
#if 0 |
|
ndv_alloc += nmv_adv*len; |
|
#endif |
|
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
|
dltondl(n,a[i]->dl,DL(m)); |
|
MPOS(DL(m)) = a[i]->pos; |
|
TD(DL(m)) = ndl_weight(DL(m)); |
|
CZ(m) = (Z)a[i]->c; |
|
} |
|
qsort(m0,len,nmv_adv,(int (*)(const void *,const void *))nmv_comp); |
|
MKNDV(NV(p),m0,len,d); |
|
SG(d) = SG(p); |
|
return d; |
|
} |
|
|
ND ndvtond(int mod,NDV p) |
ND ndvtond(int mod,NDV p) |
{ |
{ |
ND d; |
ND d; |
Line 5421 ND ndvtond(int mod,NDV p) |
|
Line 6604 ND ndvtond(int mod,NDV p) |
|
for ( t = BDY(p), i = 0; i < len; NMV_ADV(t), i++ ) { |
for ( t = BDY(p), i = 0; i < len; NMV_ADV(t), i++ ) { |
NEXTNM(m0,m); |
NEXTNM(m0,m); |
ndl_copy(DL(t),DL(m)); |
ndl_copy(DL(t),DL(m)); |
CQ(m) = CQ(t); |
CZ(m) = CZ(t); |
} |
} |
NEXT(m) = 0; |
NEXT(m) = 0; |
MKND(NV(p),m0,len,d); |
MKND(NV(p),m0,len,d); |
SG(d) = SG(p); |
SG(d) = SG(p); |
|
d->sig = p->sig; |
return d; |
return d; |
} |
} |
|
|
Line 5450 DP ndvtodp(int mod,NDV p) |
|
Line 6634 DP ndvtodp(int mod,NDV p) |
|
return d; |
return d; |
} |
} |
|
|
|
DPM ndvtodpm(int mod,NDV p) |
|
{ |
|
DMM m,m0; |
|
DPM d; |
|
NMV t; |
|
int i,len; |
|
|
|
if ( !p ) return 0; |
|
m0 = 0; |
|
len = p->len; |
|
for ( t = BDY(p), i = 0; i < len; NMV_ADV(t), i++ ) { |
|
NEXTDMM(m0,m); |
|
m->dl = ndltodl(nd_nvar,DL(t)); |
|
m->c = (Obj)ndctop(mod,t->c); |
|
m->pos = MPOS(DL(t)); |
|
} |
|
NEXT(m) = 0; |
|
MKDPM(nd_nvar,m0,d); |
|
SG(d) = SG(p); |
|
return d; |
|
} |
|
|
|
|
DP ndtodp(int mod,ND p) |
DP ndtodp(int mod,ND p) |
{ |
{ |
MP m,m0; |
MP m,m0; |
Line 5481 void ndv_print(NDV p) |
|
Line 6688 void ndv_print(NDV p) |
|
len = LEN(p); |
len = LEN(p); |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m))); |
if ( CM(m) & 0x80000000 ) printf("+@_%d*",IFTOF(CM(m))); |
else printf("+%d*",CM(m)); |
else printf("+%ld*",CM(m)); |
ndl_print(DL(m)); |
ndl_print(DL(m)); |
} |
} |
printf("\n"); |
printf("\n"); |
Line 5498 void ndv_print_q(NDV p) |
|
Line 6705 void ndv_print_q(NDV p) |
|
len = LEN(p); |
len = LEN(p); |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
printf("+"); |
printf("+"); |
printexpr(CO,(Obj)CQ(m)); |
printexpr(CO,(Obj)CZ(m)); |
printf("*"); |
printf("*"); |
ndl_print(DL(m)); |
ndl_print(DL(m)); |
} |
} |
Line 5537 NODE ndv_reducebase(NODE x,int *perm) |
|
Line 6744 NODE ndv_reducebase(NODE x,int *perm) |
|
|
|
/* XXX incomplete */ |
/* XXX incomplete */ |
|
|
|
extern DMMstack dmm_stack; |
|
int ndl_module_schreyer_compare(UINT *a,UINT *b); |
|
|
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 ) { |
if ( nd_module ) { |
nd_dcomp = -1; |
nd_dcomp = -1; |
nd_ispot = ord->ispot; |
nd_module_ordtype = ord->module_ordtype; |
nd_pot_nelim = ord->pot_nelim; |
nd_pot_nelim = ord->pot_nelim; |
nd_poly_weight_len = ord->nv; |
nd_poly_weight_len = ord->nv; |
nd_poly_weight = ord->top_weight; |
nd_poly_weight = ord->top_weight; |
Line 5606 void nd_init_ord(struct order_spec *ord) |
|
Line 6816 void nd_init_ord(struct order_spec *ord) |
|
case 256: |
case 256: |
switch ( ord->ord.simple ) { |
switch ( ord->ord.simple ) { |
case 0: |
case 0: |
|
nd_dcomp = 0; |
nd_isrlex = 1; |
nd_isrlex = 1; |
ndl_compare_function = ndl_module_grlex_compare; |
ndl_compare_function = ndl_module_glex_compare; |
break; |
break; |
case 1: |
case 1: |
|
nd_dcomp = 0; |
nd_isrlex = 0; |
nd_isrlex = 0; |
ndl_compare_function = ndl_module_glex_compare; |
ndl_compare_function = ndl_module_glex_compare; |
break; |
break; |
case 2: |
case 2: |
|
nd_dcomp = 0; |
nd_isrlex = 0; |
nd_isrlex = 0; |
ndl_compare_function = ndl_module_lex_compare; |
ndl_compare_function = ndl_module_compare; |
|
ndl_base_compare_function = ndl_lex_compare; |
break; |
break; |
default: |
default: |
error("nd_gr : unsupported order"); |
error("nd_init_ord : unsupported order"); |
} |
} |
break; |
break; |
case 257: |
case 257: |
/* block order */ |
/* block order */ |
nd_isrlex = 0; |
nd_isrlex = 0; |
ndl_compare_function = ndl_module_block_compare; |
ndl_compare_function = ndl_module_compare; |
|
ndl_base_compare_function = ndl_block_compare; |
break; |
break; |
case 258: |
case 258: |
/* matrix order */ |
/* matrix order */ |
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; |
ndl_compare_function = ndl_module_matrix_compare; |
ndl_compare_function = ndl_module_compare; |
|
ndl_base_compare_function = ndl_matrix_compare; |
break; |
break; |
case 259: |
case 259: |
/* composite order */ |
/* composite order */ |
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; |
ndl_compare_function = ndl_module_composite_compare; |
ndl_compare_function = ndl_module_compare; |
|
ndl_base_compare_function = ndl_composite_compare; |
break; |
break; |
|
case 300: |
|
/* schreyer order */ |
|
if ( ord->base->id != 256 ) |
|
error("nd_init_ord : unsupported base order"); |
|
ndl_compare_function = ndl_module_schreyer_compare; |
|
dmm_stack = ord->dmmstack; |
|
switch ( ord->base->ord.simple ) { |
|
case 0: |
|
nd_isrlex = 1; |
|
ndl_base_compare_function = ndl_glex_compare; |
|
dl_base_compare_function = cmpdl_revgradlex; |
|
break; |
|
case 1: |
|
nd_isrlex = 0; |
|
ndl_base_compare_function = ndl_glex_compare; |
|
dl_base_compare_function = cmpdl_gradlex; |
|
break; |
|
case 2: |
|
nd_isrlex = 0; |
|
ndl_base_compare_function = ndl_lex_compare; |
|
dl_base_compare_function = cmpdl_lex; |
|
break; |
|
default: |
|
error("nd_init_ord : unsupported order"); |
|
} |
|
break; |
} |
} |
nd_ord = ord; |
nd_ord = ord; |
} |
} |
Line 5675 EPOS nd_create_epos(struct order_spec *ord) |
|
Line 6918 EPOS nd_create_epos(struct order_spec *ord) |
|
|
|
epos = (EPOS)MALLOC_ATOMIC(nd_nvar*sizeof(struct oEPOS)); |
epos = (EPOS)MALLOC_ATOMIC(nd_nvar*sizeof(struct oEPOS)); |
switch ( ord->id ) { |
switch ( ord->id ) { |
case 0: case 256: |
case 0: case 256: case 300: |
if ( nd_isrlex ) { |
if ( nd_isrlex ) { |
for ( i = 0; i < nd_nvar; i++ ) { |
for ( i = 0; i < nd_nvar; i++ ) { |
epos[i].i = nd_exporigin + (nd_nvar-1-i)/nd_epw; |
epos[i].i = nd_exporigin + (nd_nvar-1-i)/nd_epw; |
Line 5778 void nd_nf_p(Obj f,LIST g,LIST v,int m,struct order_sp |
|
Line 7021 void nd_nf_p(Obj f,LIST g,LIST v,int m,struct order_sp |
|
ndf = (pointer)ndvtond(m,ndvf); |
ndf = (pointer)ndvtond(m,ndvf); |
|
|
/* dont sort, dont removecont */ |
/* dont sort, dont removecont */ |
ndv_setup(m,0,in0,1,1); |
ndv_setup(m,0,in0,1,1,0); |
nd_scale=2; |
nd_scale=2; |
stat = nd_nf(m,0,ndf,nd_ps,1,0,&nf); |
stat = nd_nf(m,0,ndf,nd_ps,1,&nf); |
if ( !stat ) |
if ( !stat ) |
error("nd_nf_p : exponent too large"); |
error("nd_nf_p : exponent too large"); |
if ( nd_module ) *rp = (Obj)ndvtopl(m,CO,vv,ndtondv(m,nf),mrank); |
if ( nd_module ) *rp = (Obj)ndvtopl(m,CO,vv,ndtondv(m,nf),mrank); |
Line 5803 int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r) |
|
Line 7046 int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r) |
|
return i; |
return i; |
} |
} |
|
|
#if defined(__GNUC__) && SIZEOF_LONG==8 |
|
|
|
#define MOD128(a,c,m) ((a)=(((c)!=0||((a)>=(m)))?(((((U128)(c))<<64)+(a))%(m)):(a))) |
|
|
|
int nd_to_vect64(int mod,UINT *s0,int n,ND d,U64 *r) |
|
{ |
|
NM m; |
|
UINT *t,*s; |
|
int i; |
|
|
|
for ( i = 0; i < n; i++ ) r[i] = 0; |
|
for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) { |
|
t = DL(m); |
|
for ( ; !ndl_equal(t,s); s += nd_wpd, i++ ); |
|
r[i] = (U64)CM(m); |
|
} |
|
for ( i = 0; !r[i]; i++ ); |
|
return i; |
|
} |
|
#endif |
|
|
|
int nd_to_vect_q(UINT *s0,int n,ND d,Z *r) |
int nd_to_vect_q(UINT *s0,int n,ND d,Z *r) |
{ |
{ |
NM m; |
NM m; |
Line 5834 int nd_to_vect_q(UINT *s0,int n,ND d,Z *r) |
|
Line 7056 int nd_to_vect_q(UINT *s0,int n,ND d,Z *r) |
|
for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) { |
for ( i = 0, s = s0, m = BDY(d); m; m = NEXT(m) ) { |
t = DL(m); |
t = DL(m); |
for ( ; !ndl_equal(t,s); s += nd_wpd, i++ ); |
for ( ; !ndl_equal(t,s); s += nd_wpd, i++ ); |
dupz(CQ(m),&r[i]); |
r[i] = CZ(m); |
} |
} |
for ( i = 0; !r[i]; i++ ); |
for ( i = 0; !r[i]; i++ ); |
return i; |
return i; |
Line 5912 Z *nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_p |
|
Line 7134 Z *nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_p |
|
for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) { |
for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) { |
ndl_add(d,DL(mr),t); |
ndl_add(d,DL(mr),t); |
for ( ; !ndl_equal(t,s); s += nd_wpd, i++ ); |
for ( ; !ndl_equal(t,s); s += nd_wpd, i++ ); |
r[i] = CQ(mr); |
r[i] = CZ(mr); |
} |
} |
return r; |
return r; |
} |
} |
|
|
IndArray nm_ind_pair_to_vect_compress(int trace,UINT *s0,int n,int *s0hash,NM_ind_pair pair) |
IndArray nm_ind_pair_to_vect_compress(int trace,UINT *s0,int n,NM_ind_pair pair,int start) |
{ |
{ |
NM m; |
NM m; |
NMV mr; |
NMV mr; |
UINT *d,*t,*s; |
UINT *d,*t,*s,*u; |
NDV p; |
NDV p; |
unsigned char *ivc; |
unsigned char *ivc; |
unsigned short *ivs; |
unsigned short *ivs; |
UINT *v,*ivi,*s0v; |
UINT *v,*ivi,*s0v; |
int i,j,len,prev,diff,cdiff,h; |
int i,j,len,prev,diff,cdiff,h,st,ed,md,c; |
IndArray r; |
IndArray r; |
struct oEGT eg0,eg1; |
|
|
|
m = pair->mul; |
m = pair->mul; |
d = DL(m); |
d = DL(m); |
Line 5940 struct oEGT eg0,eg1; |
|
Line 7161 struct oEGT eg0,eg1; |
|
len = LEN(p); |
len = LEN(p); |
t = (UINT *)MALLOC(nd_wpd*sizeof(UINT)); |
t = (UINT *)MALLOC(nd_wpd*sizeof(UINT)); |
v = (unsigned int *)MALLOC(len*sizeof(unsigned int)); |
v = (unsigned int *)MALLOC(len*sizeof(unsigned int)); |
get_eg(&eg0); |
for ( prev = start, mr = BDY(p), j = 0; j < len; j++, NMV_ADV(mr) ) { |
for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) { |
ndl_add(d,DL(mr),t); |
ndl_add(d,DL(mr),t); |
st = prev; |
h = ndl_hash_value(t); |
ed = n; |
for ( ; h != s0hash[i] || !ndl_equal(t,s); s += nd_wpd, i++ ); |
while ( ed > st ) { |
v[j] = i; |
md = (st+ed)/2; |
|
u = s0+md*nd_wpd; |
|
c = DL_COMPARE(u,t); |
|
if ( c == 0 ) break; |
|
else if ( c > 0 ) st = md; |
|
else ed = md; |
|
} |
|
prev = v[j] = md; |
} |
} |
get_eg(&eg1); add_eg(&eg_search,&eg0,&eg1); |
|
r = (IndArray)MALLOC(sizeof(struct oIndArray)); |
r = (IndArray)MALLOC(sizeof(struct oIndArray)); |
r->head = v[0]; |
r->head = v[0]; |
diff = 0; |
diff = 0; |
Line 5990 void expand_array(Z *svect,Z *cvect,int n) |
|
Line 7217 void expand_array(Z *svect,Z *cvect,int n) |
|
if ( svect[i] ) svect[i] = cvect[j++]; |
if ( svect[i] ) svect[i] = cvect[j++]; |
} |
} |
|
|
#if 1 |
#if 0 |
int ndv_reduce_vect_q(Z *svect,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred) |
int ndv_reduce_vect_q(Z *svect,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred) |
{ |
{ |
int i,j,k,len,pos,prev,nz; |
int i,j,k,len,pos,prev,nz; |
Line 6020 int ndv_reduce_vect_q(Z *svect,int trace,int col,IndAr |
|
Line 7247 int ndv_reduce_vect_q(Z *svect,int trace,int col,IndAr |
|
redv = nd_demand?ndv_load(rp0[i]->index) |
redv = nd_demand?ndv_load(rp0[i]->index) |
:(trace?nd_ps_trace[rp0[i]->index]:nd_ps[rp0[i]->index]); |
:(trace?nd_ps_trace[rp0[i]->index]:nd_ps[rp0[i]->index]); |
len = LEN(redv); mr = BDY(redv); |
len = LEN(redv); mr = BDY(redv); |
igcd_cofactor(svect[k],CQ(mr),&gcd,&cs,&cr); |
igcd_cofactor(svect[k],CZ(mr),&gcd,&cs,&cr); |
chsgnz(cs,&mcs); |
chsgnz(cs,&mcs); |
if ( !UNIQ(cr) ) { |
if ( !UNIQ(cr) ) { |
for ( j = 0; j < col; j++ ) { |
for ( j = 0; j < col; j++ ) { |
Line 6033 int ndv_reduce_vect_q(Z *svect,int trace,int col,IndAr |
|
Line 7260 int ndv_reduce_vect_q(Z *svect,int trace,int col,IndAr |
|
ivc = ivect->index.c; |
ivc = ivect->index.c; |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
pos = prev+ivc[j]; prev = pos; |
pos = prev+ivc[j]; prev = pos; |
muladdtoz(CQ(mr),mcs,&svect[pos]); |
muladdtoz(CZ(mr),mcs,&svect[pos]); |
} |
} |
break; |
break; |
case 2: |
case 2: |
ivs = ivect->index.s; |
ivs = ivect->index.s; |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
pos = prev+ivs[j]; prev = pos; |
pos = prev+ivs[j]; prev = pos; |
muladdtoz(CQ(mr),mcs,&svect[pos]); |
muladdtoz(CZ(mr),mcs,&svect[pos]); |
} |
} |
break; |
break; |
case 4: |
case 4: |
ivi = ivect->index.i; |
ivi = ivect->index.i; |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
pos = prev+ivi[j]; prev = pos; |
pos = prev+ivi[j]; prev = pos; |
muladdtoz(CQ(mr),mcs,&svect[pos]); |
muladdtoz(CZ(mr),mcs,&svect[pos]); |
} |
} |
break; |
break; |
} |
} |
Line 6070 int ndv_reduce_vect_q(Z *svect,int trace,int col,IndAr |
|
Line 7297 int ndv_reduce_vect_q(Z *svect,int trace,int col,IndAr |
|
return maxrs; |
return maxrs; |
} |
} |
#else |
#else |
|
|
/* direct mpz version */ |
/* direct mpz version */ |
int ndv_reduce_vect_q(Z *svect0,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred) |
int ndv_reduce_vect_q(Z *svect0,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred) |
{ |
{ |
int i,j,k,len,pos,prev; |
int i,j,k,len,pos,prev; |
mpz_t *svect; |
|
mpz_t cs,cr,gcd; |
mpz_t cs,cr,gcd; |
IndArray ivect; |
IndArray ivect; |
unsigned char *ivc; |
unsigned char *ivc; |
Line 6086 int ndv_reduce_vect_q(Z *svect0,int trace,int col,IndA |
|
Line 7313 int ndv_reduce_vect_q(Z *svect0,int trace,int col,IndA |
|
int maxrs; |
int maxrs; |
double hmag; |
double hmag; |
int l; |
int l; |
|
static mpz_t *svect; |
|
static int svect_len=0; |
|
|
maxrs = 0; |
maxrs = 0; |
for ( i = 0; i < col && !svect0[i]; i++ ); |
for ( i = 0; i < col && !svect0[i]; i++ ); |
if ( i == col ) return maxrs; |
if ( i == col ) return maxrs; |
hmag = p_mag((P)svect0[i])*nd_scale; |
hmag = p_mag((P)svect0[i])*nd_scale; |
svect = (mpz_t *)MALLOC(col*sizeof(mpz_t)); |
if ( col > svect_len ) { |
|
svect = (mpz_t *)MALLOC(col*sizeof(mpz_t)); |
|
svect_len = col; |
|
} |
for ( i = 0; i < col; i++ ) { |
for ( i = 0; i < col; i++ ) { |
mpz_init(svect[i]); |
mpz_init(svect[i]); |
if ( svect0[i] ) |
if ( svect0[i] ) |
Line 6108 int ndv_reduce_vect_q(Z *svect0,int trace,int col,IndA |
|
Line 7340 int ndv_reduce_vect_q(Z *svect0,int trace,int col,IndA |
|
redv = nd_demand?ndv_load(rp0[i]->index) |
redv = nd_demand?ndv_load(rp0[i]->index) |
:(trace?nd_ps_trace[rp0[i]->index]:nd_ps[rp0[i]->index]); |
:(trace?nd_ps_trace[rp0[i]->index]:nd_ps[rp0[i]->index]); |
len = LEN(redv); mr = BDY(redv); |
len = LEN(redv); mr = BDY(redv); |
mpz_gcd(gcd,svect[k],BDY(CQ(mr))); |
mpz_gcd(gcd,svect[k],BDY(CZ(mr))); |
mpz_div(cs,svect[k],gcd); |
mpz_div(cs,svect[k],gcd); |
mpz_div(cr,BDY(CQ(mr)),gcd); |
mpz_div(cr,BDY(CZ(mr)),gcd); |
mpz_neg(cs,cs); |
mpz_neg(cs,cs); |
for ( j = 0; j < col; j++ ) |
if ( MUNIMPZ(cr) ) |
mpz_mul(svect[j],svect[j],cr); |
for ( j = 0; j < col; j++ ) mpz_neg(svect[j],svect[j]); |
|
else if ( !UNIMPZ(cr) ) |
|
for ( j = 0; j < col; j++ ) { |
|
if ( mpz_sgn(svect[j]) ) mpz_mul(svect[j],svect[j],cr); |
|
} |
mpz_set_ui(svect[k],0); |
mpz_set_ui(svect[k],0); |
prev = k; |
prev = k; |
switch ( ivect->width ) { |
switch ( ivect->width ) { |
Line 6121 int ndv_reduce_vect_q(Z *svect0,int trace,int col,IndA |
|
Line 7357 int ndv_reduce_vect_q(Z *svect0,int trace,int col,IndA |
|
ivc = ivect->index.c; |
ivc = ivect->index.c; |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
pos = prev+ivc[j]; prev = pos; |
pos = prev+ivc[j]; prev = pos; |
mpz_addmul(svect[pos],BDY(CQ(mr)),cs); |
mpz_addmul(svect[pos],BDY(CZ(mr)),cs); |
} |
} |
break; |
break; |
case 2: |
case 2: |
ivs = ivect->index.s; |
ivs = ivect->index.s; |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
pos = prev+ivs[j]; prev = pos; |
pos = prev+ivs[j]; prev = pos; |
mpz_addmul(svect[pos],BDY(CQ(mr)),cs); |
mpz_addmul(svect[pos],BDY(CZ(mr)),cs); |
} |
} |
break; |
break; |
case 4: |
case 4: |
ivi = ivect->index.i; |
ivi = ivect->index.i; |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
pos = prev+ivi[j]; prev = pos; |
pos = prev+ivi[j]; prev = pos; |
mpz_addmul(svect[pos],BDY(CQ(mr)),cs); |
mpz_addmul(svect[pos],BDY(CZ(mr)),cs); |
} |
} |
break; |
break; |
} |
} |
Line 6227 int ndv_reduce_vect(int m,UINT *svect,int col,IndArray |
|
Line 7463 int ndv_reduce_vect(int m,UINT *svect,int col,IndArray |
|
return maxrs; |
return maxrs; |
} |
} |
|
|
#if defined(__GNUC__) && SIZEOF_LONG==8 |
|
|
|
int ndv_reduce_vect64(int m,U64 *svect,U64 *cvect,int col,IndArray *imat,NM_ind_pair *rp0,int nred) |
|
{ |
|
int i,j,k,len,pos,prev; |
|
U64 a,c,c1,c2; |
|
IndArray ivect; |
|
unsigned char *ivc; |
|
unsigned short *ivs; |
|
unsigned int *ivi; |
|
NDV redv; |
|
NMV mr; |
|
NODE rp; |
|
int maxrs; |
|
|
|
for ( i = 0; i < col; i++ ) cvect[i] = 0; |
|
maxrs = 0; |
|
for ( i = 0; i < nred; i++ ) { |
|
ivect = imat[i]; |
|
k = ivect->head; |
|
a = svect[k]; c = cvect[k]; |
|
MOD128(a,c,m); |
|
svect[k] = a; cvect[k] = 0; |
|
if ( (c = svect[k]) != 0 ) { |
|
maxrs = MAX(maxrs,rp0[i]->sugar); |
|
c = m-c; redv = nd_ps[rp0[i]->index]; |
|
len = LEN(redv); mr = BDY(redv); |
|
svect[k] = 0; prev = k; |
|
switch ( ivect->width ) { |
|
case 1: |
|
ivc = ivect->index.c; |
|
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
|
pos = prev+ivc[j]; c1 = CM(mr); prev = pos; |
|
if ( c1 ) { |
|
c2 = svect[pos]+c1*c; |
|
if ( c2 < svect[pos] ) cvect[pos]++; |
|
svect[pos] = c2; |
|
} |
|
} |
|
break; |
|
case 2: |
|
ivs = ivect->index.s; |
|
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
|
pos = prev+ivs[j]; c1 = CM(mr); prev = pos; |
|
if ( c1 ) { |
|
c2 = svect[pos]+c1*c; |
|
if ( c2 < svect[pos] ) cvect[pos]++; |
|
svect[pos] = c2; |
|
} |
|
} |
|
break; |
|
case 4: |
|
ivi = ivect->index.i; |
|
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
|
pos = prev+ivi[j]; c1 = CM(mr); prev = pos; |
|
if ( c1 ) { |
|
c2 = svect[pos]+c1*c; |
|
if ( c2 < svect[pos] ) cvect[pos]++; |
|
svect[pos] = c2; |
|
} |
|
} |
|
break; |
|
} |
|
} |
|
} |
|
for ( i = 0; i < col; i++ ) { |
|
a = svect[i]; c = cvect[i]; MOD128(a,c,m); svect[i] = a; |
|
} |
|
return maxrs; |
|
} |
|
#endif |
|
|
|
int ndv_reduce_vect_sf(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred) |
int ndv_reduce_vect_sf(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred) |
{ |
{ |
int i,j,k,len,pos,prev; |
int i,j,k,len,pos,prev; |
Line 6556 NDV vect_to_ndv(UINT *vect,int spcol,int col,int *rhea |
|
Line 7720 NDV vect_to_ndv(UINT *vect,int spcol,int col,int *rhea |
|
} |
} |
} |
} |
|
|
#if defined(__GNUC__) && SIZEOF_LONG==8 |
|
NDV vect64_to_ndv(U64 *vect,int spcol,int col,int *rhead,UINT *s0vect) |
|
{ |
|
int j,k,len; |
|
UINT *p; |
|
UINT c; |
|
NDV r; |
|
NMV mr0,mr; |
|
|
|
for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++; |
|
if ( !len ) return 0; |
|
else { |
|
mr0 = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(nmv_adv*len); |
|
#if 0 |
|
ndv_alloc += nmv_adv*len; |
|
#endif |
|
mr = mr0; |
|
p = s0vect; |
|
for ( j = k = 0; j < col; j++, p += nd_wpd ) |
|
if ( !rhead[j] ) { |
|
if ( (c = (UINT)vect[k++]) != 0 ) { |
|
ndl_copy(p,DL(mr)); CM(mr) = c; NMV_ADV(mr); |
|
} |
|
} |
|
MKNDV(nd_nvar,mr0,len,r); |
|
return r; |
|
} |
|
} |
|
#endif |
|
|
|
NDV vect_to_ndv_2(unsigned long *vect,int col,UINT *s0vect) |
NDV vect_to_ndv_2(unsigned long *vect,int col,UINT *s0vect) |
{ |
{ |
int j,k,len; |
int j,k,len; |
Line 6612 NDV vect_to_ndv_2(unsigned long *vect,int col,UINT *s0 |
|
Line 7746 NDV vect_to_ndv_2(unsigned long *vect,int col,UINT *s0 |
|
|
|
NDV vect_to_ndv_q(Z *vect,int spcol,int col,int *rhead,UINT *s0vect) |
NDV vect_to_ndv_q(Z *vect,int spcol,int col,int *rhead,UINT *s0vect) |
{ |
{ |
int j,k,len; |
int j,k,len; |
UINT *p; |
UINT *p; |
Z c; |
Z c; |
NDV r; |
NDV r; |
NMV mr0,mr; |
NMV mr0,mr; |
|
|
for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++; |
for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++; |
if ( !len ) return 0; |
if ( !len ) return 0; |
else { |
else { |
mr0 = (NMV)MALLOC(nmv_adv*len); |
mr0 = (NMV)MALLOC(nmv_adv*len); |
#if 0 |
#if 0 |
ndv_alloc += nmv_adv*len; |
ndv_alloc += nmv_adv*len; |
#endif |
#endif |
mr = mr0; |
mr = mr0; |
p = s0vect; |
p = s0vect; |
for ( j = k = 0; j < col; j++, p += nd_wpd ) |
for ( j = k = 0; j < col; j++, p += nd_wpd ) { |
if ( !rhead[j] ) { |
if ( !rhead[j] ) { |
if ( (c = vect[k++]) != 0 ) { |
if ( (c = vect[k++]) != 0 ) { |
if ( !INT(c) ) |
if ( !INT(c) ) |
error("afo"); |
error("vect_to_ndv_q : components must be integers"); |
ndl_copy(p,DL(mr)); CQ(mr) = c; NMV_ADV(mr); |
ndl_copy(p,DL(mr)); CZ(mr) = c; NMV_ADV(mr); |
} |
} |
} |
} |
MKNDV(nd_nvar,mr0,len,r); |
|
return r; |
|
} |
} |
|
MKNDV(nd_nvar,mr0,len,r); |
|
return r; |
|
} |
} |
} |
|
|
NDV vect_to_ndv_lf(mpz_t *vect,int spcol,int col,int *rhead,UINT *s0vect) |
NDV vect_to_ndv_lf(mpz_t *vect,int spcol,int col,int *rhead,UINT *s0vect) |
Line 6691 NDV plain_vect_to_ndv_q(Z *vect,int col,UINT *s0vect) |
|
Line 7826 NDV plain_vect_to_ndv_q(Z *vect,int col,UINT *s0vect) |
|
for ( j = k = 0; j < col; j++, p += nd_wpd, k++ ) |
for ( j = k = 0; j < col; j++, p += nd_wpd, k++ ) |
if ( (c = vect[k]) != 0 ) { |
if ( (c = vect[k]) != 0 ) { |
if ( !INT(c) ) |
if ( !INT(c) ) |
error("afo"); |
error("plain_vect_to_ndv_q : components must be integers"); |
ndl_copy(p,DL(mr)); CQ(mr) = c; NMV_ADV(mr); |
ndl_copy(p,DL(mr)); CZ(mr) = c; NMV_ADV(mr); |
} |
} |
MKNDV(nd_nvar,mr0,len,r); |
MKNDV(nd_nvar,mr0,len,r); |
return r; |
return r; |
Line 6726 int nd_symbolic_preproc(PGeoBucket bucket,int trace,UI |
|
Line 7861 int nd_symbolic_preproc(PGeoBucket bucket,int trace,UI |
|
NM_ind_pair pair; |
NM_ind_pair pair; |
ND red; |
ND red; |
NDV *ps; |
NDV *ps; |
static int afo; |
|
|
|
s0 = 0; rp0 = 0; col = 0; |
s0 = 0; rp0 = 0; col = 0; |
if ( nd_demand ) |
if ( nd_demand ) |
Line 6747 int nd_symbolic_preproc(PGeoBucket bucket,int trace,UI |
|
Line 7881 int nd_symbolic_preproc(PGeoBucket bucket,int trace,UI |
|
if ( ndl_check_bound2(index,DL(mul)) ) |
if ( ndl_check_bound2(index,DL(mul)) ) |
return 0; |
return 0; |
sugar = TD(DL(mul))+SG(ps[index]); |
sugar = TD(DL(mul))+SG(ps[index]); |
MKNM_ind_pair(pair,mul,index,sugar); |
MKNM_ind_pair(pair,mul,index,sugar,0); |
red = ndv_mul_nm_symbolic(mul,ps[index]); |
red = ndv_mul_nm_symbolic(mul,ps[index]); |
add_pbucket_symbolic(bucket,nd_remove_head(red)); |
add_pbucket_symbolic(bucket,nd_remove_head(red)); |
NEXTNODE(rp0,rp); BDY(rp) = (pointer)pair; |
NEXTNODE(rp0,rp); BDY(rp) = (pointer)pair; |
Line 6795 NODE nd_f4(int m,int checkonly,int **indp) |
|
Line 7929 NODE nd_f4(int m,int checkonly,int **indp) |
|
PGeoBucket bucket; |
PGeoBucket bucket; |
struct oEGT eg0,eg1,eg_f4; |
struct oEGT eg0,eg1,eg_f4; |
Z i1,i2,sugarq; |
Z i1,i2,sugarq; |
|
|
|
init_eg(&f4_symb); init_eg(&f4_conv); init_eg(&f4_conv); init_eg(&f4_elim1); init_eg(&f4_elim2); |
#if 0 |
#if 0 |
ndv_alloc = 0; |
ndv_alloc = 0; |
#endif |
#endif |
|
Nf4_red=0; |
g = 0; d = 0; |
g = 0; d = 0; |
for ( i = 0; i < nd_psn; i++ ) { |
for ( i = 0; i < nd_psn; i++ ) { |
d = update_pairs(d,g,i,0); |
d = update_pairs(d,g,i,0); |
Line 6814 NODE nd_f4(int m,int checkonly,int **indp) |
|
Line 7951 NODE nd_f4(int m,int checkonly,int **indp) |
|
if ( MaxDeg > 0 && sugar > MaxDeg ) break; |
if ( MaxDeg > 0 && sugar > MaxDeg ) break; |
if ( nzlist_t ) { |
if ( nzlist_t ) { |
node = BDY((LIST)BDY(nzlist_t)); |
node = BDY((LIST)BDY(nzlist_t)); |
sugarh = QTOS((Q)ARG0(node)); |
sugarh = ZTOS((Q)ARG0(node)); |
tn = BDY((LIST)ARG1(node)); |
tn = BDY((LIST)ARG1(node)); |
if ( !tn ) { |
if ( !tn ) { |
nzlist_t = NEXT(nzlist_t); |
nzlist_t = NEXT(nzlist_t); |
Line 6839 NODE nd_f4(int m,int checkonly,int **indp) |
|
Line 7976 NODE nd_f4(int m,int checkonly,int **indp) |
|
d = nd_reconstruct(0,d); |
d = nd_reconstruct(0,d); |
continue; |
continue; |
} |
} |
get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1); |
get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1); add_eg(&f4_symb,&eg0,&eg1); |
if ( DP_Print ) |
if ( DP_Print ) |
fprintf(asir_out,"\nsugar=%d,symb=%.3fsec,", |
fprintf(asir_out,"sugar=%d,symb=%.3fsec,", |
sugar,eg_f4.exectime+eg_f4.gctime); |
sugar,eg_f4.exectime); |
nflist = nd_f4_red(m,nd_nzlist?lh:l,0,s0vect,col,rp0,nd_gentrace?&ll:0); |
nflist = nd_f4_red(m,nd_nzlist?lh:l,0,s0vect,col,rp0,nd_gentrace?&ll:0); |
if ( checkonly && nflist ) return 0; |
if ( checkonly && nflist ) return 0; |
/* adding new bases */ |
/* adding new bases */ |
Line 6858 NODE nd_f4(int m,int checkonly,int **indp) |
|
Line 7995 NODE nd_f4(int m,int checkonly,int **indp) |
|
nd_removecont(m,nf1); |
nd_removecont(m,nf1); |
nf = ndtondv(m,nf1); |
nf = ndtondv(m,nf1); |
} |
} |
nh = ndv_newps(m,nf,0,1); |
nh = ndv_newps(m,nf,0); |
d = update_pairs(d,g,nh,0); |
d = update_pairs(d,g,nh,0); |
g = update_base(g,nh); |
g = update_base(g,nh); |
} |
} |
Line 6868 NODE nd_f4(int m,int checkonly,int **indp) |
|
Line 8005 NODE nd_f4(int m,int checkonly,int **indp) |
|
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
for ( t = ll, tn0 = 0; t; t = NEXT(t) ) { |
for ( t = ll, tn0 = 0; t; t = NEXT(t) ) { |
NEXTNODE(tn0,tn); |
NEXTNODE(tn0,tn); |
STOQ(t->i1,i1); STOQ(t->i2,i2); |
STOZ(t->i1,i1); STOZ(t->i2,i2); |
node = mknode(2,i1,i2); MKLIST(l0,node); |
node = mknode(2,i1,i2); MKLIST(l0,node); |
BDY(tn) = l0; |
BDY(tn) = l0; |
} |
} |
if ( tn0 ) NEXT(tn) = 0; MKLIST(l0,tn0); |
if ( tn0 ) NEXT(tn) = 0; MKLIST(l0,tn0); |
STOQ(sugar,sugarq); node = mknode(2,sugarq,l0); MKLIST(l1,node); |
STOZ(sugar,sugarq); node = mknode(2,sugarq,l0); MKLIST(l1,node); |
MKNODE(node,l1,nzlist); nzlist = node; |
MKNODE(node,l1,nzlist); nzlist = node; |
} |
} |
if ( nd_nzlist ) nzlist_t = NEXT(nzlist_t); |
if ( nd_nzlist ) nzlist_t = NEXT(nzlist_t); |
Line 6888 NODE nd_f4(int m,int checkonly,int **indp) |
|
Line 8025 NODE nd_f4(int m,int checkonly,int **indp) |
|
#if 0 |
#if 0 |
fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc); |
fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc); |
#endif |
#endif |
|
if ( DP_Print ) { |
|
fprintf(asir_out,"number of red=%d,",Nf4_red); |
|
fprintf(asir_out,"symb=%.3fsec,conv=%.3fsec,elim1=%.3fsec,elim2=%.3fsec\n", |
|
f4_symb.exectime,f4_conv.exectime,f4_elim1.exectime,f4_elim2.exectime); |
|
} |
conv_ilist(nd_demand,0,g,indp); |
conv_ilist(nd_demand,0,g,indp); |
return g; |
return g; |
} |
} |
Line 6942 NODE nd_f4_trace(int m,int **indp) |
|
Line 8084 NODE nd_f4_trace(int m,int **indp) |
|
get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1); |
get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1); |
if ( DP_Print ) |
if ( DP_Print ) |
fprintf(asir_out,"\nsugar=%d,symb=%.3fsec,", |
fprintf(asir_out,"\nsugar=%d,symb=%.3fsec,", |
sugar,eg_f4.exectime+eg_f4.gctime); |
sugar,eg_f4.exectime); |
nflist = nd_f4_red(m,l,0,s0vect,col,rp0,&l0); |
nflist = nd_f4_red(m,l,0,s0vect,col,rp0,&l0); |
if ( !l0 ) continue; |
if ( !l0 ) continue; |
l = l0; |
l = l0; |
Line 6969 NODE nd_f4_trace(int m,int **indp) |
|
Line 8111 NODE nd_f4_trace(int m,int **indp) |
|
for ( r = nflist; r; r = NEXT(r) ) { |
for ( r = nflist; r; r = NEXT(r) ) { |
nfqv = (NDV)BDY(r); |
nfqv = (NDV)BDY(r); |
ndv_removecont(0,nfqv); |
ndv_removecont(0,nfqv); |
if ( !remqi((Q)HCQ(nfqv),m) ) return 0; |
if ( !remqi((Q)HCZ(nfqv),m) ) return 0; |
if ( nd_nalg ) { |
if ( nd_nalg ) { |
ND nf1; |
ND nf1; |
|
|
Line 6981 NODE nd_f4_trace(int m,int **indp) |
|
Line 8123 NODE nd_f4_trace(int m,int **indp) |
|
nfv = ndv_dup(0,nfqv); |
nfv = ndv_dup(0,nfqv); |
ndv_mod(m,nfv); |
ndv_mod(m,nfv); |
ndv_removecont(m,nfv); |
ndv_removecont(m,nfv); |
nh = ndv_newps(0,nfv,nfqv,1); |
nh = ndv_newps(0,nfv,nfqv); |
d = update_pairs(d,g,nh,0); |
d = update_pairs(d,g,nh,0); |
g = update_base(g,nh); |
g = update_base(g,nh); |
} |
} |
Line 7111 NODE nd_f4_red_2(ND_pairs sp0,UINT *s0vect,int col,NOD |
|
Line 8253 NODE nd_f4_red_2(ND_pairs sp0,UINT *s0vect,int col,NOD |
|
unsigned long *v; |
unsigned long *v; |
|
|
get_eg(&eg0); |
get_eg(&eg0); |
init_eg(&eg_search); |
|
for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ ); |
for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ ); |
nred = length(rp0); |
nred = length(rp0); |
mat = alloc_matrix(nsp,col); |
mat = alloc_matrix(nsp,col); |
Line 7156 init_eg(&eg_search); |
|
Line 8297 init_eg(&eg_search); |
|
init_eg(&eg_elim2); add_eg(&eg_elim2,&eg1,&eg2); |
init_eg(&eg_elim2); add_eg(&eg_elim2,&eg1,&eg2); |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"elim1=%.3fsec,elim2=%.3fsec,", |
fprintf(asir_out,"elim1=%.3fsec,elim2=%.3fsec,", |
eg_elim1.exectime+eg_elim1.gctime,eg_elim2.exectime+eg_elim2.gctime); |
eg_elim1.exectime,eg_elim2.exectime); |
fflush(asir_out); |
fflush(asir_out); |
} |
} |
return r0; |
return r0; |
Line 7166 init_eg(&eg_search); |
|
Line 8307 init_eg(&eg_search); |
|
NODE nd_f4_red(int m,ND_pairs sp0,int trace,UINT *s0vect,int col,NODE rp0,ND_pairs *nz) |
NODE nd_f4_red(int m,ND_pairs sp0,int trace,UINT *s0vect,int col,NODE rp0,ND_pairs *nz) |
{ |
{ |
IndArray *imat; |
IndArray *imat; |
int nsp,nred,i; |
int nsp,nred,i,start; |
int *rhead; |
int *rhead; |
NODE r0,rp; |
NODE r0,rp; |
ND_pairs sp; |
ND_pairs sp; |
NM_ind_pair *rvect; |
NM_ind_pair *rvect; |
UINT *s; |
UINT *s; |
int *s0hash; |
int *s0hash; |
|
struct oEGT eg0,eg1,eg_conv; |
|
|
if ( m == 2 && nd_rref2 ) |
if ( m == 2 && nd_rref2 ) |
return nd_f4_red_2(sp0,s0vect,col,rp0,nz); |
return nd_f4_red_2(sp0,s0vect,col,rp0,nz); |
|
|
init_eg(&eg_search); |
|
for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ ); |
for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ ); |
nred = length(rp0); |
nred = length(rp0); |
imat = (IndArray *)MALLOC(nred*sizeof(IndArray)); |
imat = (IndArray *)MALLOC(nred*sizeof(IndArray)); |
Line 7185 init_eg(&eg_search); |
|
Line 8326 init_eg(&eg_search); |
|
for ( i = 0; i < col; i++ ) rhead[i] = 0; |
for ( i = 0; i < col; i++ ) rhead[i] = 0; |
|
|
/* construction of index arrays */ |
/* construction of index arrays */ |
|
get_eg(&eg0); |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"%dx%d,",nsp+nred,col); |
fprintf(asir_out,"%dx%d,",nsp+nred,col); |
|
fflush(asir_out); |
} |
} |
rvect = (NM_ind_pair *)MALLOC(nred*sizeof(NM_ind_pair)); |
rvect = (NM_ind_pair *)MALLOC(nred*sizeof(NM_ind_pair)); |
s0hash = (int *)MALLOC(col*sizeof(int)); |
for ( start = 0, rp = rp0, i = 0; rp; i++, rp = NEXT(rp) ) { |
for ( i = 0, s = s0vect; i < col; i++, s += nd_wpd ) |
|
s0hash[i] = ndl_hash_value(s); |
|
for ( rp = rp0, i = 0; rp; i++, rp = NEXT(rp) ) { |
|
rvect[i] = (NM_ind_pair)BDY(rp); |
rvect[i] = (NM_ind_pair)BDY(rp); |
imat[i] = nm_ind_pair_to_vect_compress(trace,s0vect,col,s0hash,rvect[i]); |
imat[i] = nm_ind_pair_to_vect_compress(trace,s0vect,col,rvect[i],start); |
rhead[imat[i]->head] = 1; |
rhead[imat[i]->head] = 1; |
|
start = imat[i]->head; |
} |
} |
|
get_eg(&eg1); init_eg(&eg_conv); add_eg(&eg_conv,&eg0,&eg1); add_eg(&f4_conv,&eg0,&eg1); |
|
if ( DP_Print ) { |
|
fprintf(asir_out,"conv=%.3fsec,",eg_conv.exectime); |
|
fflush(asir_out); |
|
} |
if ( m > 0 ) |
if ( m > 0 ) |
#if defined(__GNUC__) && SIZEOF_LONG==8 |
#if SIZEOF_LONG==8 |
r0 = nd_f4_red_mod64_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz); |
r0 = nd_f4_red_mod64_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz); |
#else |
#else |
r0 = nd_f4_red_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz); |
r0 = nd_f4_red_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz); |
Line 7209 init_eg(&eg_search); |
|
Line 8355 init_eg(&eg_search); |
|
r0 = nd_f4_red_lf_main(m,sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred); |
r0 = nd_f4_red_lf_main(m,sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred); |
else |
else |
r0 = nd_f4_red_q_main(sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred); |
r0 = nd_f4_red_q_main(sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred); |
#if 0 |
|
if ( DP_Print ) print_eg("search",&eg_search); |
|
#endif |
|
return r0; |
return r0; |
} |
} |
|
|
Line 7262 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
Line 8405 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
} |
} |
get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1); |
get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1); |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"elim1=%.3fsec,",eg_f4_1.exectime+eg_f4_1.gctime); |
fprintf(asir_out,"elim1=%.3fsec,",eg_f4_1.exectime); |
fflush(asir_out); |
fflush(asir_out); |
} |
} |
/* free index arrays */ |
/* free index arrays */ |
Line 7287 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
Line 8430 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); |
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); |
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"elim2=%.3fsec,",eg_f4_2.exectime+eg_f4_2.gctime); |
fprintf(asir_out,"elim2=%.3fsec,",eg_f4_2.exectime); |
fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ", |
fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ", |
nsp,nred,sprow,spcol,rank); |
nsp,nred,sprow,spcol,rank); |
fprintf(asir_out,"%.3fsec,",eg_f4.exectime+eg_f4.gctime); |
fprintf(asir_out,"%.3fsec,",eg_f4.exectime); |
} |
} |
if ( nz ) { |
if ( nz ) { |
for ( i = 0; i < rank-1; i++ ) NEXT(spactive[i]) = spactive[i+1]; |
for ( i = 0; i < rank-1; i++ ) NEXT(spactive[i]) = spactive[i+1]; |
Line 7303 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
Line 8446 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
return r0; |
return r0; |
} |
} |
|
|
#if defined(__GNUC__) && SIZEOF_LONG==8 |
|
/* for Fp, 2^15=<p<2^29 */ |
|
|
|
NODE nd_f4_red_mod64_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col, |
|
NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred,ND_pairs *nz) |
|
{ |
|
int spcol,sprow,a; |
|
int i,j,k,l,rank; |
|
NODE r0,r; |
|
ND_pairs sp; |
|
ND spol; |
|
U64 **spmat; |
|
U64 *svect,*cvect; |
|
U64 *v; |
|
int *colstat; |
|
struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2; |
|
int maxrs; |
|
int *spsugar; |
|
ND_pairs *spactive; |
|
|
|
spcol = col-nred; |
|
get_eg(&eg0); |
|
/* elimination (1st step) */ |
|
spmat = (U64 **)MALLOC(nsp*sizeof(U64 *)); |
|
svect = (U64 *)MALLOC(col*sizeof(U64)); |
|
cvect = (U64 *)MALLOC(col*sizeof(U64)); |
|
spsugar = (int *)MALLOC(nsp*sizeof(int)); |
|
spactive = !nz?0:(ND_pairs *)MALLOC(nsp*sizeof(ND_pairs)); |
|
for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) { |
|
nd_sp(m,0,sp,&spol); |
|
if ( !spol ) continue; |
|
nd_to_vect64(m,s0vect,col,spol,svect); |
|
maxrs = ndv_reduce_vect64(m,svect,cvect,col,imat,rvect,nred); |
|
for ( i = 0; i < col; i++ ) if ( svect[i] ) break; |
|
if ( i < col ) { |
|
spmat[sprow] = v = (U64 *)MALLOC_ATOMIC(spcol*sizeof(U64)); |
|
for ( j = k = 0; j < col; j++ ) |
|
if ( !rhead[j] ) v[k++] = (UINT)svect[j]; |
|
spsugar[sprow] = MAX(maxrs,SG(spol)); |
|
if ( nz ) |
|
spactive[sprow] = sp; |
|
sprow++; |
|
} |
|
nd_free(spol); |
|
} |
|
get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1); |
|
if ( DP_Print ) { |
|
fprintf(asir_out,"elim1=%.3fsec,",eg_f4_1.exectime+eg_f4_1.gctime); |
|
fflush(asir_out); |
|
} |
|
/* free index arrays */ |
|
for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c); |
|
|
|
/* elimination (2nd step) */ |
|
colstat = (int *)MALLOC(spcol*sizeof(int)); |
|
rank = nd_gauss_elim_mod64(spmat,spsugar,spactive,sprow,spcol,m,colstat); |
|
r0 = 0; |
|
for ( i = 0; i < rank; i++ ) { |
|
NEXTNODE(r0,r); BDY(r) = |
|
(pointer)vect64_to_ndv(spmat[i],spcol,col,rhead,s0vect); |
|
SG((NDV)BDY(r)) = spsugar[i]; |
|
GCFREE(spmat[i]); |
|
} |
|
if ( r0 ) NEXT(r) = 0; |
|
|
|
for ( ; i < sprow; i++ ) GCFREE(spmat[i]); |
|
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); |
|
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
|
if ( DP_Print ) { |
|
fprintf(asir_out,"elim2=%.3fsec,",eg_f4_2.exectime+eg_f4_2.gctime); |
|
fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ", |
|
nsp,nred,sprow,spcol,rank); |
|
fprintf(asir_out,"%.3fsec,",eg_f4.exectime+eg_f4.gctime); |
|
} |
|
if ( nz ) { |
|
for ( i = 0; i < rank-1; i++ ) NEXT(spactive[i]) = spactive[i+1]; |
|
if ( rank > 0 ) { |
|
NEXT(spactive[rank-1]) = 0; |
|
*nz = spactive[0]; |
|
} else |
|
*nz = 0; |
|
} |
|
return r0; |
|
} |
|
#endif |
|
|
|
/* for small finite fields */ |
/* for small finite fields */ |
|
|
NODE nd_f4_red_sf_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col, |
NODE nd_f4_red_sf_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col, |
Line 7433 NODE nd_f4_red_sf_main(int m,ND_pairs sp0,int nsp,UINT |
|
Line 8491 NODE nd_f4_red_sf_main(int m,ND_pairs sp0,int nsp,UINT |
|
} |
} |
get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1); |
get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1); |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"elim1=%.3fsec,",eg_f4_1.exectime+eg_f4_1.gctime); |
fprintf(asir_out,"elim1=%.3fsec,",eg_f4_1.exectime); |
fflush(asir_out); |
fflush(asir_out); |
} |
} |
/* free index arrays */ |
/* free index arrays */ |
Line 7455 NODE nd_f4_red_sf_main(int m,ND_pairs sp0,int nsp,UINT |
|
Line 8513 NODE nd_f4_red_sf_main(int m,ND_pairs sp0,int nsp,UINT |
|
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); |
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); |
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"elim2=%.3fsec,",eg_f4_2.exectime+eg_f4_2.gctime); |
fprintf(asir_out,"elim2=%.3fsec,",eg_f4_2.exectime); |
fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ", |
fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ", |
nsp,nred,sprow,spcol,rank); |
nsp,nred,sprow,spcol,rank); |
fprintf(asir_out,"%.3fsec,",eg_f4.exectime+eg_f4.gctime); |
fprintf(asir_out,"%.3fsec,",eg_f4.exectime); |
} |
} |
if ( nz ) { |
if ( nz ) { |
for ( i = 0; i < rank-1; i++ ) NEXT(spactive[i]) = spactive[i+1]; |
for ( i = 0; i < rank-1; i++ ) NEXT(spactive[i]) = spactive[i+1]; |
Line 7510 NODE nd_f4_red_lf_main(int m,ND_pairs sp0,int nsp,int |
|
Line 8568 NODE nd_f4_red_lf_main(int m,ND_pairs sp0,int nsp,int |
|
} |
} |
get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1); |
get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1); |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"elim1=%.3fsec,",eg_f4_1.exectime+eg_f4_1.gctime); |
fprintf(asir_out,"elim1=%.3fsec,",eg_f4_1.exectime); |
fflush(asir_out); |
fflush(asir_out); |
} |
} |
/* free index arrays */ |
/* free index arrays */ |
Line 7545 NODE nd_f4_red_lf_main(int m,ND_pairs sp0,int nsp,int |
|
Line 8603 NODE nd_f4_red_lf_main(int m,ND_pairs sp0,int nsp,int |
|
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); |
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); |
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"elim2=%.3fsec,",eg_f4_2.exectime+eg_f4_2.gctime); |
fprintf(asir_out,"elim2=%.3fsec,",eg_f4_2.exectime); |
fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ", |
fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ", |
nsp,nred,sprow,spcol,rank); |
nsp,nred,sprow,spcol,rank); |
fprintf(asir_out,"%.3fsec,",eg_f4.exectime+eg_f4.gctime); |
fprintf(asir_out,"%.3fsec,",eg_f4.exectime); |
} |
} |
return r0; |
return r0; |
} |
} |
Line 7592 NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,int trace,U |
|
Line 8650 NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,int trace,U |
|
} |
} |
get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1); |
get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1); |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"elim1=%.3fsec,",eg_f4_1.exectime+eg_f4_1.gctime); |
fprintf(asir_out,"elim1=%.3fsec,",eg_f4_1.exectime); |
fflush(asir_out); |
fflush(asir_out); |
} |
} |
/* free index arrays */ |
/* free index arrays */ |
Line 7626 NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,int trace,U |
|
Line 8684 NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,int trace,U |
|
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); |
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); |
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"elim2=%.3fsec,",eg_f4_2.exectime+eg_f4_2.gctime); |
fprintf(asir_out,"elim2=%.3fsec,",eg_f4_2.exectime); |
fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ", |
fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ", |
nsp,nred,sprow,spcol,rank); |
nsp,nred,sprow,spcol,rank); |
fprintf(asir_out,"%.3fsec,",eg_f4.exectime+eg_f4.gctime); |
fprintf(asir_out,"%.3fsec,",eg_f4.exectime); |
} |
} |
return r0; |
return r0; |
} |
} |
Line 7800 int nd_gauss_elim_mod(UINT **mat0,int *sugar,ND_pairs |
|
Line 8858 int nd_gauss_elim_mod(UINT **mat0,int *sugar,ND_pairs |
|
return rank; |
return rank; |
} |
} |
|
|
#if defined(__GNUC__) && SIZEOF_LONG==8 |
|
|
|
int nd_gauss_elim_mod64(U64 **mat,int *sugar,ND_pairs *spactive,int row,int col,int md,int *colstat) |
|
{ |
|
int i,j,k,l,rank,s; |
|
U64 inv; |
|
U64 a; |
|
UINT c; |
|
U64 *t,*pivot,*pk; |
|
UINT *ck; |
|
UINT **cmat; |
|
UINT *ct; |
|
ND_pairs pair; |
|
|
|
cmat = (UINT **)MALLOC(row*sizeof(UINT *)); |
|
for ( i = 0; i < row; i++ ) { |
|
cmat[i] = MALLOC_ATOMIC(col*sizeof(UINT)); |
|
bzero(cmat[i],col*sizeof(UINT)); |
|
} |
|
|
|
for ( rank = 0, j = 0; j < col; j++ ) { |
|
for ( i = rank; i < row; i++ ) { |
|
a = mat[i][j]; c = cmat[i][j]; |
|
MOD128(a,c,md); |
|
mat[i][j] = a; cmat[i][j] = 0; |
|
} |
|
for ( i = rank; i < row; i++ ) |
|
if ( mat[i][j] ) |
|
break; |
|
if ( i == row ) { |
|
colstat[j] = 0; |
|
continue; |
|
} else |
|
colstat[j] = 1; |
|
if ( i != rank ) { |
|
t = mat[i]; mat[i] = mat[rank]; mat[rank] = t; |
|
ct = cmat[i]; cmat[i] = cmat[rank]; cmat[rank] = ct; |
|
s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s; |
|
if ( spactive ) { |
|
pair = spactive[i]; spactive[i] = spactive[rank]; |
|
spactive[rank] = pair; |
|
} |
|
} |
|
/* column j is normalized */ |
|
s = sugar[rank]; |
|
inv = invm((UINT)mat[rank][j],md); |
|
/* normalize pivot row */ |
|
for ( k = j, pk = mat[rank]+j, ck = cmat[rank]+j; k < col; k++, pk++, ck++ ) { |
|
a = *pk; c = *ck; MOD128(a,c,md); *pk = (a*inv)%md; *ck = 0; |
|
} |
|
for ( i = rank+1; i < row; i++ ) { |
|
if ( (a = mat[i][j]) != 0 ) { |
|
sugar[i] = MAX(sugar[i],s); |
|
red_by_vect64(md,mat[i]+j,cmat[i]+j,mat[rank]+j,(int)(md-a),col-j); |
|
} |
|
} |
|
rank++; |
|
} |
|
for ( j = col-1, l = rank-1; j >= 0; j-- ) |
|
if ( colstat[j] ) { |
|
for ( k = j, pk = mat[l]+j, ck = cmat[l]+j; k < col; k++, pk++, ck++ ) { |
|
a = *pk; c = *ck; MOD128(a,c,md); *pk = a; *ck = 0; |
|
} |
|
s = sugar[l]; |
|
for ( i = 0; i < l; i++ ) { |
|
a = mat[i][j]; c = cmat[i][j]; MOD128(a,c,md); mat[i][j] = a; cmat[i][j] = 0; |
|
if ( a ) { |
|
sugar[i] = MAX(sugar[i],s); |
|
red_by_vect64(md,mat[i]+j,cmat[i]+j,mat[l]+j,(int)(md-a),col-j); |
|
} |
|
} |
|
l--; |
|
} |
|
for ( i = 0; i < row; i++ ) GCFREE(cmat[i]); |
|
GCFREE(cmat); |
|
return rank; |
|
} |
|
#endif |
|
|
|
int nd_gauss_elim_sf(UINT **mat0,int *sugar,int row,int col,int md,int *colstat) |
int nd_gauss_elim_sf(UINT **mat0,int *sugar,int row,int col,int md,int *colstat) |
{ |
{ |
int i,j,k,l,inv,a,rank,s; |
int i,j,k,l,inv,a,rank,s; |
Line 7941 int ndv_ishomo(NDV p) |
|
Line 8921 int ndv_ishomo(NDV p) |
|
h = TD(DL(m)); |
h = TD(DL(m)); |
NMV_ADV(m); |
NMV_ADV(m); |
for ( len--; len; len--, NMV_ADV(m) ) |
for ( len--; len; len--, NMV_ADV(m) ) |
if ( TD(DL(m)) != h ) return 0; |
if ( TD(DL(m)) != h ) { |
|
return 0; |
|
} |
return 1; |
return 1; |
} |
} |
|
|
Line 7970 void ndv_save(NDV p,int index) |
|
Line 8952 void ndv_save(NDV p,int index) |
|
write_int(s,(unsigned int *)&len); |
write_int(s,(unsigned int *)&len); |
|
|
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { |
saveobj(s,(Obj)CQ(m)); |
saveobj(s,(Obj)CZ(m)); |
dl = DL(m); |
dl = DL(m); |
td = TD(dl); |
td = TD(dl); |
write_int(s,(unsigned int *)&td); |
write_int(s,(unsigned int *)&td); |
Line 8036 NDV ndv_load(int index) |
|
Line 9018 NDV ndv_load(int index) |
|
|
|
m0 = m = MALLOC(len*nmv_adv); |
m0 = m = MALLOC(len*nmv_adv); |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
loadobj(s,&obj); CQ(m) = (Z)obj; |
loadobj(s,&obj); CZ(m) = (Z)obj; |
dl = DL(m); |
dl = DL(m); |
ndl_zero(dl); |
ndl_zero(dl); |
read_int(s,(unsigned int *)&td); TD(dl) = td; |
read_int(s,(unsigned int *)&td); TD(dl) = td; |
Line 8135 void nd_det(int mod,MAT f,P *rp) |
|
Line 9117 void nd_det(int mod,MAT f,P *rp) |
|
for ( j = 0; j < n; j++ ) { |
for ( j = 0; j < n; j++ ) { |
if ( !m[i][j] ) continue; |
if ( !m[i][j] ) continue; |
lgp(m[i][j],&nm,&dn); |
lgp(m[i][j],&nm,&dn); |
gcdz(dn0,dn,&gn); divz(dn0,gn,&qn); mulz(qn,dn,&dn0); |
gcdz(dn0,dn,&gn); divsz(dn0,gn,&qn); mulz(qn,dn,&dn0); |
} |
} |
if ( !UNIZ(dn0) ) { |
if ( !UNIZ(dn0) ) { |
ds = dn0; |
ds = dn0; |
Line 8272 ND ndv_mul_nmv_trunc(int mod,NMV m0,NDV p,UINT *d) |
|
Line 9254 ND ndv_mul_nmv_trunc(int mod,NMV m0,NDV p,UINT *d) |
|
} |
} |
} |
} |
} else { |
} else { |
q = CQ(m0); |
q = CZ(m0); |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
ndl_add(DL(m),d0,DL(tnm)); |
ndl_add(DL(m),d0,DL(tnm)); |
if ( ndl_reducible(DL(tnm),d) ) { |
if ( ndl_reducible(DL(tnm),d) ) { |
NEXTNM(mr0,mr); |
NEXTNM(mr0,mr); |
mulz(CQ(m),q,&CQ(mr)); |
mulz(CZ(m),q,&CZ(mr)); |
ndl_copy(DL(tnm),DL(mr)); |
ndl_copy(DL(tnm),DL(mr)); |
} |
} |
} |
} |
Line 8406 int nd_monic(int mod,ND *p) |
|
Line 9388 int nd_monic(int mod,ND *p) |
|
is_lc = 1; |
is_lc = 1; |
while ( 1 ) { |
while ( 1 ) { |
NEWMP(mp0); mp = mp0; |
NEWMP(mp0); mp = mp0; |
mp->c = (Obj)CQ(m); |
mp->c = (Obj)CZ(m); |
mp->dl = nd_separate_d(DL(m),DL(ma)); |
mp->dl = nd_separate_d(DL(m),DL(ma)); |
NEWNM(mb); |
NEWNM(mb); |
for ( m = NEXT(m); m; m = NEXT(m) ) { |
for ( m = NEXT(m); m; m = NEXT(m) ) { |
alg = nd_separate_d(DL(m),DL(mb)); |
alg = nd_separate_d(DL(m),DL(mb)); |
if ( !ndl_equal(DL(ma),DL(mb)) ) |
if ( !ndl_equal(DL(ma),DL(mb)) ) |
break; |
break; |
NEXTMP(mp0,mp); mp->c = (Obj)CQ(m); mp->dl = alg; |
NEXTMP(mp0,mp); mp->c = (Obj)CZ(m); mp->dl = alg; |
} |
} |
NEXT(mp) = 0; |
NEXT(mp) = 0; |
MKDP(nd_nalg,mp0,nm); |
MKDP(nd_nalg,mp0,nm); |
Line 8446 int nd_monic(int mod,ND *p) |
|
Line 9428 int nd_monic(int mod,ND *p) |
|
/* l = lcm(denoms) */ |
/* l = lcm(denoms) */ |
l = ln; |
l = ln; |
for ( mr0 = 0, m = ma0; m; m = NEXT(m) ) { |
for ( mr0 = 0, m = ma0; m; m = NEXT(m) ) { |
divz(l,CA(m)->dn,&mul); |
divsz(l,CA(m)->dn,&mul); |
for ( mp = BDY(CA(m)->nm); mp; mp = NEXT(mp) ) { |
for ( mp = BDY(CA(m)->nm); mp; mp = NEXT(mp) ) { |
NEXTNM(mr0,mr); |
NEXTNM(mr0,mr); |
mulz((Z)mp->c,mul,&CQ(mr)); |
mulz((Z)mp->c,mul,&CZ(mr)); |
dl = mp->dl; |
dl = mp->dl; |
td = TD(DL(m)); |
td = TD(DL(m)); |
ndl_copy(DL(m),DL(mr)); |
ndl_copy(DL(m),DL(mr)); |
Line 8489 P ndc_div(int mod,union oNDC a,union oNDC b) |
|
Line 9471 P ndc_div(int mod,union oNDC a,union oNDC b) |
|
int inv,t; |
int inv,t; |
|
|
if ( mod == -1 ) c.m = _mulsf(a.m,_invsf(b.m)); |
if ( mod == -1 ) c.m = _mulsf(a.m,_invsf(b.m)); |
else if ( mod == -2 ) divlf(a.gz,b.gz,&c.gz); |
else if ( mod == -2 ) divlf(a.z,b.z,&c.z); |
else if ( mod ) { |
else if ( mod ) { |
inv = invm(b.m,mod); |
inv = invm(b.m,mod); |
DMAR(a.m,inv,0,mod,t); c.m = t; |
DMAR(a.m,inv,0,mod,t); c.m = t; |
Line 8509 P ndctop(int mod,union oNDC c) |
|
Line 9491 P ndctop(int mod,union oNDC c) |
|
if ( mod == -1 ) { |
if ( mod == -1 ) { |
e = IFTOF(c.m); MKGFS(e,gfs); return (P)gfs; |
e = IFTOF(c.m); MKGFS(e,gfs); return (P)gfs; |
} else if ( mod == -2 ) { |
} else if ( mod == -2 ) { |
q = c.gz; return (P)q; |
q = c.z; return (P)q; |
} else if ( mod > 0 ) { |
} else if ( mod > 0 ) { |
STOQ(c.m,q); return (P)q; |
STOZ(c.m,q); return (P)q; |
} else |
} else |
return (P)c.p; |
return (P)c.p; |
} |
} |
Line 8529 void finalize_tracelist(int i,P cont) |
|
Line 9511 void finalize_tracelist(int i,P cont) |
|
MKLIST(l,node); MKNODE(node,l,nd_tracelist); |
MKLIST(l,node); MKNODE(node,l,nd_tracelist); |
nd_tracelist = node; |
nd_tracelist = node; |
} |
} |
STOQ(i,iq); |
STOZ(i,iq); |
nd_tracelist = reverse_node(nd_tracelist); |
nd_tracelist = reverse_node(nd_tracelist); |
MKLIST(l,nd_tracelist); |
MKLIST(l,nd_tracelist); |
node = mknode(2,iq,l); MKLIST(l,node); |
node = mknode(2,iq,l); MKLIST(l,node); |
Line 8552 void conv_ilist(int demand,int trace,NODE g,int **indp |
|
Line 9534 void conv_ilist(int demand,int trace,NODE g,int **indp |
|
if ( indp ) *indp = ind; |
if ( indp ) *indp = ind; |
} |
} |
|
|
|
NODE conv_ilist_s(int demand,int trace,int **indp) |
|
{ |
|
int n,i,j; |
|
int *ind; |
|
NODE g0,g; |
|
|
|
n = nd_psn; |
|
ind = (int *)MALLOC(n*sizeof(int)); |
|
g0 = 0; |
|
for ( i = 0; i < n; i++ ) { |
|
ind[i] = i; |
|
NEXTNODE(g0,g); |
|
BDY(g) = (pointer)(demand?ndv_load(i):(trace?nd_ps_trace[i]:nd_ps[i])); |
|
} |
|
if ( g0 ) NEXT(g) = 0; |
|
if ( indp ) *indp = ind; |
|
return g0; |
|
} |
|
|
void parse_nd_option(NODE opt) |
void parse_nd_option(NODE opt) |
{ |
{ |
NODE t,p,u; |
NODE t,p,u; |
Line 8581 void parse_nd_option(NODE opt) |
|
Line 9582 void parse_nd_option(NODE opt) |
|
nd_gbblock = MALLOC((2*length(u)+1)*sizeof(int)); |
nd_gbblock = MALLOC((2*length(u)+1)*sizeof(int)); |
for ( i = 0; u; u = NEXT(u) ) { |
for ( i = 0; u; u = NEXT(u) ) { |
p = BDY((LIST)BDY(u)); |
p = BDY((LIST)BDY(u)); |
s = nd_gbblock[i++] = QTOS((Q)BDY(p)); |
s = nd_gbblock[i++] = ZTOS((Q)BDY(p)); |
nd_gbblock[i++] = s+QTOS((Q)BDY(NEXT(p)))-1; |
nd_gbblock[i++] = s+ZTOS((Q)BDY(NEXT(p)))-1; |
} |
} |
nd_gbblock[i] = -1; |
nd_gbblock[i] = -1; |
} else |
} else |
Line 8591 void parse_nd_option(NODE opt) |
|
Line 9592 void parse_nd_option(NODE opt) |
|
nd_newelim = value?1:0; |
nd_newelim = value?1:0; |
else if ( !strcmp(key,"intersect") ) |
else if ( !strcmp(key,"intersect") ) |
nd_intersect = value?1:0; |
nd_intersect = value?1:0; |
|
else if ( !strcmp(key,"syzgen") ) |
|
nd_intersect = ZTOS((Q)value); |
else if ( !strcmp(key,"lf") ) |
else if ( !strcmp(key,"lf") ) |
nd_lf = value?1:0; |
nd_lf = value?1:0; |
else if ( !strcmp(key,"trace") ) { |
else if ( !strcmp(key,"trace") ) { |
if ( value ) { |
if ( value ) { |
u = BDY((LIST)value); |
u = BDY((LIST)value); |
nd_nzlist = BDY((LIST)ARG2(u)); |
nd_nzlist = BDY((LIST)ARG2(u)); |
nd_bpe = QTOS((Q)ARG3(u)); |
nd_bpe = ZTOS((Q)ARG3(u)); |
} |
} |
} else if ( !strcmp(key,"f4red") ) { |
} else if ( !strcmp(key,"f4red") ) { |
nd_f4red = QTOS((Q)value); |
nd_f4red = ZTOS((Q)value); |
} else if ( !strcmp(key,"rank0") ) { |
} else if ( !strcmp(key,"rank0") ) { |
nd_rank0 = value?1:0; |
nd_rank0 = value?1:0; |
} else if ( !strcmp(key,"splist") ) { |
} else if ( !strcmp(key,"splist") ) { |
Line 8612 void parse_nd_option(NODE opt) |
|
Line 9615 void parse_nd_option(NODE opt) |
|
n = length(u); |
n = length(u); |
nd_sugarweight = MALLOC(n*sizeof(int)); |
nd_sugarweight = MALLOC(n*sizeof(int)); |
for ( i = 0; i < n; i++, u = NEXT(u) ) |
for ( i = 0; i < n; i++, u = NEXT(u) ) |
nd_sugarweight[i] = QTOS((Q)BDY(u)); |
nd_sugarweight[i] = ZTOS((Q)BDY(u)); |
} |
} |
} |
} |
} |
} |
Line 8636 ND mdptond(DP d) |
|
Line 9639 ND mdptond(DP d) |
|
else { |
else { |
NEWNM(m); |
NEWNM(m); |
dltondl(NV(d),BDY(d)->dl,DL(m)); |
dltondl(NV(d),BDY(d)->dl,DL(m)); |
CQ(m) = (Z)BDY(d)->c; |
CZ(m) = (Z)BDY(d)->c; |
NEXT(m) = 0; |
NEXT(m) = 0; |
MKND(NV(d),m,1,r); |
MKND(NV(d),m,1,r); |
} |
} |
Line 8701 ND *btog(NODE ti,ND **p,int nb,int mod) |
|
Line 9704 ND *btog(NODE ti,ND **p,int nb,int mod) |
|
s = BDY((LIST)BDY(t)); |
s = BDY((LIST)BDY(t)); |
if ( ARG0(s) ) { |
if ( ARG0(s) ) { |
m = mdptond((DP)ARG2(s)); |
m = mdptond((DP)ARG2(s)); |
ptomp(mod,(P)HCQ(m),&c); |
ptomp(mod,(P)HCZ(m),&c); |
if ( (ci = ((MQ)c)->cont) != 0 ) { |
if ( (ci = ((MQ)c)->cont) != 0 ) { |
HCM(m) = ci; |
HCM(m) = ci; |
pi = p[QTOS((Q)ARG1(s))]; |
pi = p[ZTOS((Q)ARG1(s))]; |
for ( i = 0; i < nb; i++ ) { |
for ( i = 0; i < nb; i++ ) { |
tp = nd_mul_nm(mod,BDY(m),pi[i]); |
tp = nd_mul_nm(mod,BDY(m),pi[i]); |
add_pbucket(mod,r[i],tp); |
add_pbucket(mod,r[i],tp); |
Line 8742 ND *btog_lf(NODE ti,ND **p,int nb) |
|
Line 9745 ND *btog_lf(NODE ti,ND **p,int nb) |
|
s = BDY((LIST)BDY(t)); |
s = BDY((LIST)BDY(t)); |
if ( ARG0(s) ) { |
if ( ARG0(s) ) { |
m = mdptond((DP)ARG2(s)); |
m = mdptond((DP)ARG2(s)); |
simp_ff((Obj)HCQ(m),(Obj *)&lm); |
simp_ff((Obj)HCZ(m),(Obj *)&lm); |
if ( lm ) { |
if ( lm ) { |
lmtolf(lm,&lf); HCZ(m) = lf; |
lmtolf(lm,&lf); HCZ(m) = lf; |
pi = p[QTOS((Q)ARG1(s))]; |
pi = p[ZTOS((Q)ARG1(s))]; |
for ( i = 0; i < nb; i++ ) { |
for ( i = 0; i < nb; i++ ) { |
tp = nd_mul_nm_lf(BDY(m),pi[i]); |
tp = nd_mul_nm_lf(BDY(m),pi[i]); |
add_pbucket(-2,r[i],tp); |
add_pbucket(-2,r[i],tp); |
Line 8777 ND btog_one(NODE ti,ND *p,int nb,int mod) |
|
Line 9780 ND btog_one(NODE ti,ND *p,int nb,int mod) |
|
s = BDY((LIST)BDY(t)); |
s = BDY((LIST)BDY(t)); |
if ( ARG0(s) ) { |
if ( ARG0(s) ) { |
m = mdptond((DP)ARG2(s)); |
m = mdptond((DP)ARG2(s)); |
ptomp(mod,(P)HCQ(m),&c); |
ptomp(mod,(P)HCZ(m),&c); |
if ( (ci = ((MQ)c)->cont) != 0 ) { |
if ( (ci = ((MQ)c)->cont) != 0 ) { |
HCM(m) = ci; |
HCM(m) = ci; |
pi = p[j=QTOS((Q)ARG1(s))]; |
pi = p[j=ZTOS((Q)ARG1(s))]; |
if ( !pi ) { |
if ( !pi ) { |
pi = nd_load_mod(j); |
pi = nd_load_mod(j); |
tp = nd_mul_nm(mod,BDY(m),pi); |
tp = nd_mul_nm(mod,BDY(m),pi); |
Line 8832 MAT nd_btog(LIST f,LIST v,int mod,struct order_spec *o |
|
Line 9835 MAT nd_btog(LIST f,LIST v,int mod,struct order_spec *o |
|
} |
} |
nd_init_ord(ord); |
nd_init_ord(ord); |
#if 0 |
#if 0 |
nd_bpe = QTOS((Q)ARG7(BDY(tlist))); |
nd_bpe = ZTOS((Q)ARG7(BDY(tlist))); |
#else |
#else |
nd_bpe = 32; |
nd_bpe = 32; |
#endif |
#endif |
Line 8842 MAT nd_btog(LIST f,LIST v,int mod,struct order_spec *o |
|
Line 9845 MAT nd_btog(LIST f,LIST v,int mod,struct order_spec *o |
|
ind = BDY((LIST)ARG4(BDY(tlist))); |
ind = BDY((LIST)ARG4(BDY(tlist))); |
perm = BDY((LIST)BDY(permtrace)); trace =NEXT(permtrace); |
perm = BDY((LIST)BDY(permtrace)); trace =NEXT(permtrace); |
for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) { |
for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) { |
j = QTOS((Q)BDY(BDY((LIST)BDY(t)))); |
j = ZTOS((Q)BDY(BDY((LIST)BDY(t)))); |
if ( j > i ) i = j; |
if ( j > i ) i = j; |
} |
} |
n = i+1; |
n = i+1; |
Line 8850 MAT nd_btog(LIST f,LIST v,int mod,struct order_spec *o |
|
Line 9853 MAT nd_btog(LIST f,LIST v,int mod,struct order_spec *o |
|
p = (ND **)MALLOC(n*sizeof(ND *)); |
p = (ND **)MALLOC(n*sizeof(ND *)); |
for ( t = perm, i = 0; t; t = NEXT(t), i++ ) { |
for ( t = perm, i = 0; t; t = NEXT(t), i++ ) { |
pi = BDY((LIST)BDY(t)); |
pi = BDY((LIST)BDY(t)); |
pi0 = QTOS((Q)ARG0(pi)); pi1 = QTOS((Q)ARG1(pi)); |
pi0 = ZTOS((Q)ARG0(pi)); pi1 = ZTOS((Q)ARG1(pi)); |
p[pi0] = c = (ND *)MALLOC(nb*sizeof(ND)); |
p[pi0] = c = (ND *)MALLOC(nb*sizeof(ND)); |
ptomp(mod,(P)ARG2(pi),&inv); |
ptomp(mod,(P)ARG2(pi),&inv); |
((MQ)inv)->cont = invm(((MQ)inv)->cont,mod); |
((MQ)inv)->cont = invm(((MQ)inv)->cont,mod); |
Line 8861 MAT nd_btog(LIST f,LIST v,int mod,struct order_spec *o |
|
Line 9864 MAT nd_btog(LIST f,LIST v,int mod,struct order_spec *o |
|
for ( t = trace,i=0; t; t = NEXT(t), i++ ) { |
for ( t = trace,i=0; t; t = NEXT(t), i++ ) { |
printf("%d ",i); fflush(stdout); |
printf("%d ",i); fflush(stdout); |
ti = BDY((LIST)BDY(t)); |
ti = BDY((LIST)BDY(t)); |
p[j=QTOS((Q)ARG0(ti))] = btog(BDY((LIST)ARG1(ti)),p,nb,mod); |
p[j=ZTOS((Q)ARG0(ti))] = btog(BDY((LIST)ARG1(ti)),p,nb,mod); |
} |
} |
for ( t = intred, i=0; t; t = NEXT(t), i++ ) { |
for ( t = intred, i=0; t; t = NEXT(t), i++ ) { |
printf("%d ",i); fflush(stdout); |
printf("%d ",i); fflush(stdout); |
ti = BDY((LIST)BDY(t)); |
ti = BDY((LIST)BDY(t)); |
p[j=QTOS((Q)ARG0(ti))] = btog(BDY((LIST)ARG1(ti)),p,nb,mod); |
p[j=ZTOS((Q)ARG0(ti))] = btog(BDY((LIST)ARG1(ti)),p,nb,mod); |
} |
} |
m = length(ind); |
m = length(ind); |
MKMAT(mat,nb,m); |
MKMAT(mat,nb,m); |
for ( j = 0, t = ind; j < m; j++, t = NEXT(t) ) |
for ( j = 0, t = ind; j < m; j++, t = NEXT(t) ) |
for ( i = 0, c = p[QTOS((Q)BDY(t))]; i < nb; i++ ) |
for ( i = 0, c = p[ZTOS((Q)BDY(t))]; i < nb; i++ ) |
BDY(mat)[i][j] = ndtodp(mod,c[i]); |
BDY(mat)[i][j] = ndtodp(mod,c[i]); |
return mat; |
return mat; |
} |
} |
Line 8901 MAT nd_btog_lf(LIST f,LIST v,struct order_spec *ord,LI |
|
Line 9904 MAT nd_btog_lf(LIST f,LIST v,struct order_spec *ord,LI |
|
} |
} |
nd_init_ord(ord); |
nd_init_ord(ord); |
#if 0 |
#if 0 |
nd_bpe = QTOS((Q)ARG7(BDY(tlist))); |
nd_bpe = ZTOS((Q)ARG7(BDY(tlist))); |
#else |
#else |
nd_bpe = 32; |
nd_bpe = 32; |
#endif |
#endif |
Line 8911 MAT nd_btog_lf(LIST f,LIST v,struct order_spec *ord,LI |
|
Line 9914 MAT nd_btog_lf(LIST f,LIST v,struct order_spec *ord,LI |
|
ind = BDY((LIST)ARG4(BDY(tlist))); |
ind = BDY((LIST)ARG4(BDY(tlist))); |
perm = BDY((LIST)BDY(permtrace)); trace =NEXT(permtrace); |
perm = BDY((LIST)BDY(permtrace)); trace =NEXT(permtrace); |
for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) { |
for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) { |
j = QTOS((Q)BDY(BDY((LIST)BDY(t)))); |
j = ZTOS((Q)BDY(BDY((LIST)BDY(t)))); |
if ( j > i ) i = j; |
if ( j > i ) i = j; |
} |
} |
n = i+1; |
n = i+1; |
Line 8919 MAT nd_btog_lf(LIST f,LIST v,struct order_spec *ord,LI |
|
Line 9922 MAT nd_btog_lf(LIST f,LIST v,struct order_spec *ord,LI |
|
p = (ND **)MALLOC(n*sizeof(ND *)); |
p = (ND **)MALLOC(n*sizeof(ND *)); |
for ( t = perm, i = 0; t; t = NEXT(t), i++ ) { |
for ( t = perm, i = 0; t; t = NEXT(t), i++ ) { |
pi = BDY((LIST)BDY(t)); |
pi = BDY((LIST)BDY(t)); |
pi0 = QTOS((Q)ARG0(pi)); pi1 = QTOS((Q)ARG1(pi)); |
pi0 = ZTOS((Q)ARG0(pi)); pi1 = ZTOS((Q)ARG1(pi)); |
p[pi0] = c = (ND *)MALLOC(nb*sizeof(ND)); |
p[pi0] = c = (ND *)MALLOC(nb*sizeof(ND)); |
simp_ff((Obj)ARG2(pi),(Obj *)&lm); lmtolf(lm,&lf); invz(lf,current_mod_lf,&inv); |
simp_ff((Obj)ARG2(pi),(Obj *)&lm); lmtolf(lm,&lf); invz(lf,current_mod_lf,&inv); |
u = ptond(CO,vv,(P)ONE); |
u = ptond(CO,vv,(P)ONE); |
Line 8929 MAT nd_btog_lf(LIST f,LIST v,struct order_spec *ord,LI |
|
Line 9932 MAT nd_btog_lf(LIST f,LIST v,struct order_spec *ord,LI |
|
for ( t = trace,i=0; t; t = NEXT(t), i++ ) { |
for ( t = trace,i=0; t; t = NEXT(t), i++ ) { |
printf("%d ",i); fflush(stdout); |
printf("%d ",i); fflush(stdout); |
ti = BDY((LIST)BDY(t)); |
ti = BDY((LIST)BDY(t)); |
p[j=QTOS((Q)ARG0(ti))] = btog_lf(BDY((LIST)ARG1(ti)),p,nb); |
p[j=ZTOS((Q)ARG0(ti))] = btog_lf(BDY((LIST)ARG1(ti)),p,nb); |
} |
} |
for ( t = intred, i=0; t; t = NEXT(t), i++ ) { |
for ( t = intred, i=0; t; t = NEXT(t), i++ ) { |
printf("%d ",i); fflush(stdout); |
printf("%d ",i); fflush(stdout); |
ti = BDY((LIST)BDY(t)); |
ti = BDY((LIST)BDY(t)); |
p[j=QTOS((Q)ARG0(ti))] = btog_lf(BDY((LIST)ARG1(ti)),p,nb); |
p[j=ZTOS((Q)ARG0(ti))] = btog_lf(BDY((LIST)ARG1(ti)),p,nb); |
} |
} |
m = length(ind); |
m = length(ind); |
MKMAT(mat,nb,m); |
MKMAT(mat,nb,m); |
for ( j = 0, t = ind; j < m; j++, t = NEXT(t) ) |
for ( j = 0, t = ind; j < m; j++, t = NEXT(t) ) |
for ( i = 0, c = p[QTOS((Q)BDY(t))]; i < nb; i++ ) |
for ( i = 0, c = p[ZTOS((Q)BDY(t))]; i < nb; i++ ) |
BDY(mat)[i][j] = ndtodp(-2,c[i]); |
BDY(mat)[i][j] = ndtodp(-2,c[i]); |
return mat; |
return mat; |
} |
} |
Line 8972 VECT nd_btog_one(LIST f,LIST v,int mod,struct order_sp |
|
Line 9975 VECT nd_btog_one(LIST f,LIST v,int mod,struct order_sp |
|
} |
} |
nd_init_ord(ord); |
nd_init_ord(ord); |
#if 0 |
#if 0 |
nd_bpe = QTOS((Q)ARG7(BDY(tlist))); |
nd_bpe = ZTOS((Q)ARG7(BDY(tlist))); |
#else |
#else |
nd_bpe = 32; |
nd_bpe = 32; |
#endif |
#endif |
Line 8982 VECT nd_btog_one(LIST f,LIST v,int mod,struct order_sp |
|
Line 9985 VECT nd_btog_one(LIST f,LIST v,int mod,struct order_sp |
|
ind = BDY((LIST)ARG4(BDY(tlist))); |
ind = BDY((LIST)ARG4(BDY(tlist))); |
perm = BDY((LIST)BDY(permtrace)); trace =NEXT(permtrace); |
perm = BDY((LIST)BDY(permtrace)); trace =NEXT(permtrace); |
for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) { |
for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) { |
j = QTOS((Q)BDY(BDY((LIST)BDY(t)))); |
j = ZTOS((Q)BDY(BDY((LIST)BDY(t)))); |
if ( j > i ) i = j; |
if ( j > i ) i = j; |
} |
} |
n = i+1; |
n = i+1; |
Line 8990 VECT nd_btog_one(LIST f,LIST v,int mod,struct order_sp |
|
Line 9993 VECT nd_btog_one(LIST f,LIST v,int mod,struct order_sp |
|
p = (ND *)MALLOC(n*sizeof(ND *)); |
p = (ND *)MALLOC(n*sizeof(ND *)); |
for ( t = perm, i = 0; t; t = NEXT(t), i++ ) { |
for ( t = perm, i = 0; t; t = NEXT(t), i++ ) { |
pi = BDY((LIST)BDY(t)); |
pi = BDY((LIST)BDY(t)); |
pi0 = QTOS((Q)ARG0(pi)); pi1 = QTOS((Q)ARG1(pi)); |
pi0 = ZTOS((Q)ARG0(pi)); pi1 = ZTOS((Q)ARG1(pi)); |
if ( pi1 == pos ) { |
if ( pi1 == pos ) { |
ptomp(mod,(P)ARG2(pi),&inv); |
ptomp(mod,(P)ARG2(pi),&inv); |
((MQ)inv)->cont = invm(((MQ)inv)->cont,mod); |
((MQ)inv)->cont = invm(((MQ)inv)->cont,mod); |
Line 9002 VECT nd_btog_one(LIST f,LIST v,int mod,struct order_sp |
|
Line 10005 VECT nd_btog_one(LIST f,LIST v,int mod,struct order_sp |
|
for ( t = trace,i=0; t; t = NEXT(t), i++ ) { |
for ( t = trace,i=0; t; t = NEXT(t), i++ ) { |
printf("%d ",i); fflush(stdout); |
printf("%d ",i); fflush(stdout); |
ti = BDY((LIST)BDY(t)); |
ti = BDY((LIST)BDY(t)); |
p[j=QTOS((Q)ARG0(ti))] = btog_one(BDY((LIST)ARG1(ti)),p,nb,mod); |
p[j=ZTOS((Q)ARG0(ti))] = btog_one(BDY((LIST)ARG1(ti)),p,nb,mod); |
if ( Demand ) { |
if ( Demand ) { |
nd_save_mod(p[j],j); nd_free(p[j]); p[j] = 0; |
nd_save_mod(p[j],j); nd_free(p[j]); p[j] = 0; |
} |
} |
Line 9010 VECT nd_btog_one(LIST f,LIST v,int mod,struct order_sp |
|
Line 10013 VECT nd_btog_one(LIST f,LIST v,int mod,struct order_sp |
|
for ( t = intred, i=0; t; t = NEXT(t), i++ ) { |
for ( t = intred, i=0; t; t = NEXT(t), i++ ) { |
printf("%d ",i); fflush(stdout); |
printf("%d ",i); fflush(stdout); |
ti = BDY((LIST)BDY(t)); |
ti = BDY((LIST)BDY(t)); |
p[j=QTOS((Q)ARG0(ti))] = btog_one(BDY((LIST)ARG1(ti)),p,nb,mod); |
p[j=ZTOS((Q)ARG0(ti))] = btog_one(BDY((LIST)ARG1(ti)),p,nb,mod); |
if ( Demand ) { |
if ( Demand ) { |
nd_save_mod(p[j],j); nd_free(p[j]); p[j] = 0; |
nd_save_mod(p[j],j); nd_free(p[j]); p[j] = 0; |
} |
} |
Line 9018 VECT nd_btog_one(LIST f,LIST v,int mod,struct order_sp |
|
Line 10021 VECT nd_btog_one(LIST f,LIST v,int mod,struct order_sp |
|
m = length(ind); |
m = length(ind); |
MKVECT(vect,m); |
MKVECT(vect,m); |
for ( j = 0, t = ind; j < m; j++, t = NEXT(t) ) { |
for ( j = 0, t = ind; j < m; j++, t = NEXT(t) ) { |
u = p[QTOS((Q)BDY(t))]; |
u = p[ZTOS((Q)BDY(t))]; |
if ( !u ) { |
if ( !u ) { |
u = nd_load_mod(QTOS((Q)BDY(t))); |
u = nd_load_mod(ZTOS((Q)BDY(t))); |
BDY(vect)[j] = ndtodp(mod,u); |
BDY(vect)[j] = ndtodp(mod,u); |
nd_free(u); |
nd_free(u); |
} else |
} else |
Line 9146 void nd_f4_lf_trace(LIST f,LIST v,int trace,int homo,s |
|
Line 10149 void nd_f4_lf_trace(LIST f,LIST v,int trace,int homo,s |
|
ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos,ompos); |
ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos,ompos); |
} |
} |
if ( MaxDeg > 0 ) nocheck = 1; |
if ( MaxDeg > 0 ) nocheck = 1; |
ret = ndv_setup(-2,m,fd0,nd_gbblock?1:0,0); |
ret = ndv_setup(-2,m,fd0,nd_gbblock?1:0,0,0); |
if ( ret ) |
if ( ret ) |
cand = nd_f4_lf_trace_main(m,&perm); |
cand = nd_f4_lf_trace_main(m,&perm); |
if ( !ret || !cand ) { |
if ( !ret || !cand ) { |
Line 9172 void nd_f4_lf_trace(LIST f,LIST v,int trace,int homo,s |
|
Line 10175 void nd_f4_lf_trace(LIST f,LIST v,int trace,int homo,s |
|
} |
} |
get_eg(&eg1); init_eg(&eg_check); add_eg(&eg_check,&eg0,&eg1); |
get_eg(&eg1); init_eg(&eg_check); add_eg(&eg_check,&eg0,&eg1); |
if ( DP_Print ) |
if ( DP_Print ) |
fprintf(asir_out,"check=%.3fsec\n",eg_check.exectime+eg_check.gctime); |
fprintf(asir_out,"check=%.3fsec\n",eg_check.exectime); |
/* dp->p */ |
/* dp->p */ |
nd_bpe = cbpe; |
nd_bpe = cbpe; |
nd_setup_parameters(nd_nvar,0); |
nd_setup_parameters(nd_nvar,0); |
Line 9232 NODE nd_f4_lf_trace_main(int m,int **indp) |
|
Line 10235 NODE nd_f4_lf_trace_main(int m,int **indp) |
|
} |
} |
get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1); |
get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1); |
if ( DP_Print ) |
if ( DP_Print ) |
fprintf(asir_out,"\nsugar=%d,symb=%.3fsec,", |
fprintf(asir_out,"\nsugar=%d,symb=%.3fsec,",sugar,eg_f4.exectime); |
sugar,eg_f4.exectime+eg_f4.gctime); |
|
nflist = nd_f4_red(m,l,0,s0vect,col,rp0,&l0); |
nflist = nd_f4_red(m,l,0,s0vect,col,rp0,&l0); |
if ( !l0 ) continue; |
if ( !l0 ) continue; |
l = l0; |
l = l0; |
Line 9263 NODE nd_f4_lf_trace_main(int m,int **indp) |
|
Line 10265 NODE nd_f4_lf_trace_main(int m,int **indp) |
|
if ( DL_COMPARE(HDL(nfv),HDL(nfqv)) ) return 0; |
if ( DL_COMPARE(HDL(nfv),HDL(nfqv)) ) return 0; |
ndv_removecont(m,nfv); |
ndv_removecont(m,nfv); |
ndv_removecont(-2,nfqv); |
ndv_removecont(-2,nfqv); |
nh = ndv_newps(-2,nfv,nfqv,1); |
nh = ndv_newps(-2,nfv,nfqv); |
d = update_pairs(d,g,nh,0); |
d = update_pairs(d,g,nh,0); |
g = update_base(g,nh); |
g = update_base(g,nh); |
} |
} |
Line 9273 NODE nd_f4_lf_trace_main(int m,int **indp) |
|
Line 10275 NODE nd_f4_lf_trace_main(int m,int **indp) |
|
return g; |
return g; |
} |
} |
|
|
|
#if SIZEOF_LONG==8 |
|
|
|
NDV vect64_to_ndv(mp_limb_t *vect,int spcol,int col,int *rhead,UINT *s0vect) |
|
{ |
|
int j,k,len; |
|
UINT *p; |
|
UINT c; |
|
NDV r; |
|
NMV mr0,mr; |
|
|
|
for ( j = 0, len = 0; j < spcol; j++ ) if ( vect[j] ) len++; |
|
if ( !len ) return 0; |
|
else { |
|
mr0 = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(nmv_adv*len); |
|
#if 0 |
|
ndv_alloc += nmv_adv*len; |
|
#endif |
|
mr = mr0; |
|
p = s0vect; |
|
for ( j = k = 0; j < col; j++, p += nd_wpd ) |
|
if ( !rhead[j] ) { |
|
if ( (c = (UINT)vect[k++]) != 0 ) { |
|
ndl_copy(p,DL(mr)); CM(mr) = c; NMV_ADV(mr); |
|
} |
|
} |
|
MKNDV(nd_nvar,mr0,len,r); |
|
return r; |
|
} |
|
} |
|
|
|
NDV vect64_to_ndv_s(mp_limb_t *vect,int col,UINT *s0vect) |
|
{ |
|
int j,k,len; |
|
UINT *p; |
|
UINT c; |
|
NDV r; |
|
NMV mr0,mr; |
|
|
|
for ( j = 0, len = 0; j < col; j++ ) if ( vect[j] ) len++; |
|
if ( !len ) return 0; |
|
else { |
|
mr0 = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(nmv_adv*len); |
|
mr = mr0; |
|
p = s0vect; |
|
for ( j = k = 0; j < col; j++, p += nd_wpd ) |
|
if ( (c = (UINT)vect[k++]) != 0 ) { |
|
ndl_copy(p,DL(mr)); CM(mr) = c; NMV_ADV(mr); |
|
} |
|
MKNDV(nd_nvar,mr0,len,r); |
|
return r; |
|
} |
|
} |
|
|
|
int nd_to_vect64(int mod,UINT *s0,int n,ND d,mp_limb_t *r) |
|
{ |
|
NM m; |
|
UINT *t,*s,*u; |
|
int i,st,ed,md,prev,c; |
|
|
|
for ( i = 0; i < n; i++ ) r[i] = 0; |
|
prev = 0; |
|
for ( i = 0, m = BDY(d); m; m = NEXT(m) ) { |
|
t = DL(m); |
|
st = prev; |
|
ed = n; |
|
while ( ed > st ) { |
|
md = (st+ed)/2; |
|
u = s0+md*nd_wpd; |
|
c = DL_COMPARE(u,t); |
|
if ( c == 0 ) break; |
|
else if ( c > 0 ) st = md; |
|
else ed = md; |
|
} |
|
r[md] = (mp_limb_t)CM(m); |
|
prev = md; |
|
} |
|
for ( i = 0; !r[i]; i++ ); |
|
return i; |
|
} |
|
|
|
#define MOD128(a,c,m) ((a)=(((c)!=0||((a)>=(m)))?(((((U128)(c))<<64)+(a))%(m)):(a))) |
|
|
|
int ndv_reduce_vect64(int m,mp_limb_t *svect,mp_limb_t *cvect,int col,IndArray *imat,NM_ind_pair *rp0,int nred,SIG sig) |
|
{ |
|
int i,j,k,len,pos,prev; |
|
mp_limb_t a,c,c1,c2; |
|
IndArray ivect; |
|
unsigned char *ivc; |
|
unsigned short *ivs; |
|
unsigned int *ivi; |
|
NDV redv; |
|
NMV mr; |
|
NODE rp; |
|
int maxrs; |
|
|
|
for ( i = 0; i < col; i++ ) cvect[i] = 0; |
|
maxrs = 0; |
|
for ( i = 0; i < nred; i++ ) { |
|
ivect = imat[i]; |
|
k = ivect->head; |
|
a = svect[k]; c = cvect[k]; |
|
MOD128(a,c,m); |
|
svect[k] = a; cvect[k] = 0; |
|
if ( (c = svect[k]) != 0 && (sig == 0 || comp_sig(sig,rp0[i]->sig) > 0 ) ) { |
|
Nf4_red++; |
|
maxrs = MAX(maxrs,rp0[i]->sugar); |
|
c = m-c; redv = nd_ps[rp0[i]->index]; |
|
len = LEN(redv); mr = BDY(redv); |
|
svect[k] = 0; prev = k; |
|
switch ( ivect->width ) { |
|
case 1: |
|
ivc = ivect->index.c; |
|
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
|
pos = prev+ivc[j]; c1 = CM(mr); prev = pos; |
|
c2 = svect[pos]+c1*c; |
|
if ( c2 < svect[pos] ) cvect[pos]++; |
|
svect[pos] = c2; |
|
} |
|
break; |
|
case 2: |
|
ivs = ivect->index.s; |
|
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
|
pos = prev+ivs[j]; c1 = CM(mr); prev = pos; |
|
c2 = svect[pos]+c1*c; |
|
if ( c2 < svect[pos] ) cvect[pos]++; |
|
svect[pos] = c2; |
|
} |
|
break; |
|
case 4: |
|
ivi = ivect->index.i; |
|
for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { |
|
pos = prev+ivi[j]; c1 = CM(mr); prev = pos; |
|
c2 = svect[pos]+c1*c; |
|
if ( c2 < svect[pos] ) cvect[pos]++; |
|
svect[pos] = c2; |
|
} |
|
break; |
|
} |
|
} |
|
} |
|
for ( i = 0; i < col; i++ ) { |
|
a = svect[i]; c = cvect[i]; MOD128(a,c,m); svect[i] = a; |
|
} |
|
return maxrs; |
|
} |
|
|
|
/* for Fp, 2^15=<p<2^29 */ |
|
|
|
NODE nd_f4_red_mod64_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col, |
|
NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred,ND_pairs *nz) |
|
{ |
|
int spcol,sprow,a; |
|
int i,j,k,l,rank; |
|
NODE r0,r; |
|
ND_pairs sp; |
|
ND spol; |
|
mp_limb_t **spmat; |
|
mp_limb_t *svect,*cvect; |
|
mp_limb_t *v; |
|
int *colstat; |
|
struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2; |
|
int maxrs; |
|
int *spsugar; |
|
ND_pairs *spactive; |
|
|
|
spcol = col-nred; |
|
get_eg(&eg0); |
|
/* elimination (1st step) */ |
|
spmat = (mp_limb_t **)MALLOC(nsp*sizeof(mp_limb_t *)); |
|
svect = (mp_limb_t *)MALLOC(col*sizeof(mp_limb_t)); |
|
cvect = (mp_limb_t *)MALLOC(col*sizeof(mp_limb_t)); |
|
spsugar = (int *)MALLOC(nsp*sizeof(int)); |
|
spactive = !nz?0:(ND_pairs *)MALLOC(nsp*sizeof(ND_pairs)); |
|
for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) { |
|
nd_sp(m,0,sp,&spol); |
|
if ( !spol ) continue; |
|
nd_to_vect64(m,s0vect,col,spol,svect); |
|
maxrs = ndv_reduce_vect64(m,svect,cvect,col,imat,rvect,nred,0); |
|
for ( i = 0; i < col; i++ ) if ( svect[i] ) break; |
|
if ( i < col ) { |
|
spmat[sprow] = v = (mp_limb_t *)MALLOC_ATOMIC(spcol*sizeof(mp_limb_t)); |
|
for ( j = k = 0; j < col; j++ ) |
|
if ( !rhead[j] ) v[k++] = (UINT)svect[j]; |
|
spsugar[sprow] = MAX(maxrs,SG(spol)); |
|
if ( nz ) |
|
spactive[sprow] = sp; |
|
sprow++; |
|
} |
|
nd_free(spol); |
|
} |
|
get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1); add_eg(&f4_elim1,&eg0,&eg1); |
|
if ( DP_Print ) { |
|
fprintf(asir_out,"elim1=%.3fsec,",eg_f4_1.exectime); |
|
fflush(asir_out); |
|
} |
|
/* free index arrays */ |
|
for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c); |
|
|
|
/* elimination (2nd step) */ |
|
colstat = (int *)MALLOC(spcol*sizeof(int)); |
|
rank = nd_gauss_elim_mod64(spmat,spsugar,spactive,sprow,spcol,m,colstat); |
|
r0 = 0; |
|
for ( i = 0; i < rank; i++ ) { |
|
NEXTNODE(r0,r); BDY(r) = |
|
(pointer)vect64_to_ndv(spmat[i],spcol,col,rhead,s0vect); |
|
SG((NDV)BDY(r)) = spsugar[i]; |
|
GCFREE(spmat[i]); |
|
} |
|
if ( r0 ) NEXT(r) = 0; |
|
|
|
for ( ; i < sprow; i++ ) GCFREE(spmat[i]); |
|
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); add_eg(&f4_elim2,&eg1,&eg2); |
|
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
|
if ( DP_Print ) { |
|
fprintf(asir_out,"elim2=%.3fsec,",eg_f4_2.exectime); |
|
fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ", |
|
nsp,nred,sprow,spcol,rank); |
|
fprintf(asir_out,"%.3fsec,",eg_f4.exectime); |
|
} |
|
if ( nz ) { |
|
for ( i = 0; i < rank-1; i++ ) NEXT(spactive[i]) = spactive[i+1]; |
|
if ( rank > 0 ) { |
|
NEXT(spactive[rank-1]) = 0; |
|
*nz = spactive[0]; |
|
} else |
|
*nz = 0; |
|
} |
|
return r0; |
|
} |
|
|
|
int nd_gauss_elim_mod64(mp_limb_t **mat,int *sugar,ND_pairs *spactive,int row,int col,int md,int *colstat) |
|
{ |
|
int i,j,k,l,rank,s; |
|
mp_limb_t inv; |
|
mp_limb_t a; |
|
UINT c; |
|
mp_limb_t *t,*pivot,*pk; |
|
UINT *ck; |
|
UINT **cmat; |
|
UINT *ct; |
|
ND_pairs pair; |
|
|
|
cmat = (UINT **)MALLOC(row*sizeof(UINT *)); |
|
for ( i = 0; i < row; i++ ) { |
|
cmat[i] = MALLOC_ATOMIC(col*sizeof(UINT)); |
|
bzero(cmat[i],col*sizeof(UINT)); |
|
} |
|
|
|
for ( rank = 0, j = 0; j < col; j++ ) { |
|
for ( i = rank; i < row; i++ ) { |
|
a = mat[i][j]; c = cmat[i][j]; |
|
MOD128(a,c,md); |
|
mat[i][j] = a; cmat[i][j] = 0; |
|
} |
|
for ( i = rank; i < row; i++ ) |
|
if ( mat[i][j] ) |
|
break; |
|
if ( i == row ) { |
|
colstat[j] = 0; |
|
continue; |
|
} else |
|
colstat[j] = 1; |
|
if ( i != rank ) { |
|
t = mat[i]; mat[i] = mat[rank]; mat[rank] = t; |
|
ct = cmat[i]; cmat[i] = cmat[rank]; cmat[rank] = ct; |
|
s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s; |
|
if ( spactive ) { |
|
pair = spactive[i]; spactive[i] = spactive[rank]; |
|
spactive[rank] = pair; |
|
} |
|
} |
|
/* column j is normalized */ |
|
s = sugar[rank]; |
|
inv = invm((UINT)mat[rank][j],md); |
|
/* normalize pivot row */ |
|
for ( k = j, pk = mat[rank]+j, ck = cmat[rank]+j; k < col; k++, pk++, ck++ ) { |
|
a = *pk; c = *ck; MOD128(a,c,md); *pk = (a*inv)%md; *ck = 0; |
|
} |
|
for ( i = rank+1; i < row; i++ ) { |
|
if ( (a = mat[i][j]) != 0 ) { |
|
sugar[i] = MAX(sugar[i],s); |
|
red_by_vect64(md,mat[i]+j,cmat[i]+j,mat[rank]+j,(int)(md-a),col-j); |
|
Nf4_red++; |
|
} |
|
} |
|
rank++; |
|
} |
|
for ( j = col-1, l = rank-1; j >= 0; j-- ) |
|
if ( colstat[j] ) { |
|
for ( k = j, pk = mat[l]+j, ck = cmat[l]+j; k < col; k++, pk++, ck++ ) { |
|
a = *pk; c = *ck; MOD128(a,c,md); *pk = a; *ck = 0; |
|
} |
|
s = sugar[l]; |
|
for ( i = 0; i < l; i++ ) { |
|
a = mat[i][j]; c = cmat[i][j]; MOD128(a,c,md); mat[i][j] = a; cmat[i][j] = 0; |
|
if ( a ) { |
|
sugar[i] = MAX(sugar[i],s); |
|
red_by_vect64(md,mat[i]+j,cmat[i]+j,mat[l]+j,(int)(md-a),col-j); |
|
Nf4_red++; |
|
} |
|
} |
|
l--; |
|
} |
|
for ( i = 0; i < row; i++ ) GCFREE(cmat[i]); |
|
GCFREE(cmat); |
|
return rank; |
|
} |
|
#endif |
|
|
|
int nd_gauss_elim_mod64_s(mp_limb_t **mat,int *sugar,ND_pairs *spactive,int row,int col,int md,int *colstat,SIG *sig) |
|
{ |
|
int i,j,k,l,rank,s,imin; |
|
mp_limb_t inv; |
|
mp_limb_t a; |
|
UINT c; |
|
mp_limb_t *t,*pivot,*pk; |
|
UINT *ck; |
|
UINT **cmat; |
|
UINT *ct; |
|
ND_pairs pair; |
|
SIG sg; |
|
|
|
cmat = (UINT **)MALLOC(row*sizeof(UINT *)); |
|
for ( i = 0; i < row; i++ ) { |
|
cmat[i] = MALLOC_ATOMIC(col*sizeof(UINT)); |
|
bzero(cmat[i],col*sizeof(UINT)); |
|
} |
|
|
|
for ( rank = 0, j = 0; j < col; j++ ) { |
|
for ( i = rank; i < row; i++ ) { |
|
a = mat[i][j]; c = cmat[i][j]; |
|
MOD128(a,c,md); |
|
mat[i][j] = a; cmat[i][j] = 0; |
|
} |
|
imin = -1; |
|
for ( i = rank; i < row; i++ ) |
|
if ( mat[i][j] && (imin < 0 || comp_sig(sig[imin],sig[i]) > 0) ) imin = i; |
|
if ( imin == -1 ) { |
|
colstat[j] = 0; |
|
continue; |
|
} else |
|
colstat[j] = 1; |
|
if ( imin != rank ) { |
|
t = mat[imin]; mat[imin] = mat[rank]; mat[rank] = t; |
|
ct = cmat[imin]; cmat[imin] = cmat[rank]; cmat[rank] = ct; |
|
s = sugar[imin]; sugar[imin] = sugar[rank]; sugar[rank] = s; |
|
sg = sig[imin]; sig[imin] = sig[rank]; sig[rank] = sg; |
|
if ( spactive ) { |
|
pair = spactive[imin]; spactive[imin] = spactive[rank]; |
|
spactive[rank] = pair; |
|
} |
|
} |
|
/* column j is normalized */ |
|
s = sugar[rank]; |
|
inv = invm((UINT)mat[rank][j],md); |
|
/* normalize pivot row */ |
|
for ( k = j, pk = mat[rank]+j, ck = cmat[rank]+j; k < col; k++, pk++, ck++ ) { |
|
a = *pk; c = *ck; MOD128(a,c,md); *pk = (a*inv)%md; *ck = 0; |
|
} |
|
for ( i = rank+1; i < row; i++ ) { |
|
if ( (a = mat[i][j]) != 0 ) { |
|
sugar[i] = MAX(sugar[i],s); |
|
red_by_vect64(md,mat[i]+j,cmat[i]+j,mat[rank]+j,(int)(md-a),col-j); |
|
Nf4_red++; |
|
} |
|
} |
|
rank++; |
|
} |
|
#if 1 |
|
for ( j = col-1, l = rank-1; j >= 0; j-- ) |
|
if ( colstat[j] ) { |
|
for ( k = j, pk = mat[l]+j, ck = cmat[l]+j; k < col; k++, pk++, ck++ ) { |
|
a = *pk; c = *ck; MOD128(a,c,md); *pk = a; *ck = 0; |
|
} |
|
s = sugar[l]; |
|
for ( i = 0; i < l; i++ ) { |
|
a = mat[i][j]; c = cmat[i][j]; MOD128(a,c,md); mat[i][j] = a; cmat[i][j] = 0; |
|
if ( a && comp_sig(sig[i],sig[l]) > 0 ) { |
|
sugar[i] = MAX(sugar[i],s); |
|
red_by_vect64(md,mat[i]+j,cmat[i]+j,mat[l]+j,(int)(md-a),col-j); |
|
Nf4_red++; |
|
} |
|
} |
|
l--; |
|
} |
|
#endif |
|
for ( i = 0; i < row; i++ ) GCFREE(cmat[i]); |
|
GCFREE(cmat); |
|
return rank; |
|
} |
|
|
|
NODE nd_f4_red_mod64_main_s(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col, |
|
NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred,NODE *syzlistp) |
|
{ |
|
int spcol,sprow,a; |
|
int i,j,k,l,rank; |
|
NODE r0,r; |
|
ND_pairs sp; |
|
ND spol; |
|
mp_limb_t **spmat; |
|
mp_limb_t *svect,*cvect; |
|
mp_limb_t *v; |
|
int *colstat; |
|
struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2; |
|
int maxrs; |
|
int *spsugar; |
|
ND_pairs *spactive; |
|
SIG *spsig; |
|
|
|
get_eg(&eg0); |
|
/* elimination (1st step) */ |
|
spmat = (mp_limb_t **)MALLOC(nsp*sizeof(mp_limb_t *)); |
|
cvect = (mp_limb_t *)MALLOC(col*sizeof(mp_limb_t)); |
|
spsugar = (int *)MALLOC(nsp*sizeof(int)); |
|
spsig = (SIG *)MALLOC(nsp*sizeof(SIG)); |
|
for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) { |
|
nd_sp(m,0,sp,&spol); |
|
if ( !spol ) { |
|
syzlistp[sp->sig->pos] = insert_sig(syzlistp[sp->sig->pos],sp->sig); |
|
continue; |
|
} |
|
svect = (mp_limb_t *)MALLOC(col*sizeof(mp_limb_t)); |
|
nd_to_vect64(m,s0vect,col,spol,svect); |
|
maxrs = ndv_reduce_vect64(m,svect,cvect,col,imat,rvect,nred,spol->sig); |
|
for ( i = 0; i < col; i++ ) if ( svect[i] ) break; |
|
if ( i < col ) { |
|
spmat[sprow] = svect; |
|
spsugar[sprow] = MAX(maxrs,SG(spol)); |
|
spsig[sprow] = sp->sig; |
|
sprow++; |
|
} else { |
|
syzlistp[sp->sig->pos] = insert_sig(syzlistp[sp->sig->pos],sp->sig); |
|
} |
|
nd_free(spol); |
|
} |
|
get_eg(&eg1); init_eg(&eg_f4_1); add_eg(&eg_f4_1,&eg0,&eg1); add_eg(&f4_elim1,&eg0,&eg1); |
|
if ( DP_Print ) { |
|
fprintf(asir_out,"elim1=%.3fsec,",eg_f4_1.exectime); |
|
fflush(asir_out); |
|
} |
|
/* free index arrays */ |
|
for ( i = 0; i < nred; i++ ) GCFREE(imat[i]->index.c); |
|
|
|
/* elimination (2nd step) */ |
|
colstat = (int *)MALLOC(col*sizeof(int)); |
|
rank = nd_gauss_elim_mod64_s(spmat,spsugar,0,sprow,col,m,colstat,spsig); |
|
r0 = 0; |
|
for ( i = 0; i < rank; i++ ) { |
|
NEXTNODE(r0,r); |
|
BDY(r) = vect64_to_ndv_s(spmat[i],col,s0vect); |
|
SG((NDV)BDY(r)) = spsugar[i]; |
|
((NDV)BDY(r))->sig = spsig[i]; |
|
GCFREE(spmat[i]); |
|
} |
|
if ( r0 ) NEXT(r) = 0; |
|
|
|
for ( ; i < sprow; i++ ) { |
|
GCFREE(spmat[i]); |
|
syzlistp[spsig[i]->pos] = insert_sig(syzlistp[spsig[i]->pos],spsig[i]); |
|
} |
|
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); add_eg(&f4_elim2,&eg1,&eg2); |
|
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
|
if ( DP_Print ) { |
|
fprintf(asir_out,"elim2=%.3fsec,",eg_f4_2.exectime); |
|
fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ", |
|
nsp,nred,sprow,col,rank); |
|
fprintf(asir_out,"%.3fsec,",eg_f4.exectime); |
|
} |
|
return r0; |
|
} |
|
|
|
NODE nd_f4_red_s(int m,ND_pairs sp0,int trace,UINT *s0vect,int col,NODE rp0,NODE *syzlistp) |
|
{ |
|
IndArray *imat; |
|
int nsp,nred,i,start; |
|
int *rhead; |
|
NODE r0,rp; |
|
ND_pairs sp; |
|
NM_ind_pair *rvect; |
|
UINT *s; |
|
int *s0hash; |
|
struct oEGT eg0,eg1,eg_conv; |
|
|
|
for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ ); |
|
nred = length(rp0); |
|
imat = (IndArray *)MALLOC(nred*sizeof(IndArray)); |
|
rhead = (int *)MALLOC(col*sizeof(int)); |
|
for ( i = 0; i < col; i++ ) rhead[i] = 0; |
|
|
|
/* construction of index arrays */ |
|
get_eg(&eg0); |
|
if ( DP_Print ) { |
|
fprintf(asir_out,"%dx%d,",nsp+nred,col); |
|
fflush(asir_out); |
|
} |
|
rvect = (NM_ind_pair *)MALLOC(nred*sizeof(NM_ind_pair)); |
|
for ( start = 0, rp = rp0, i = 0; rp; i++, rp = NEXT(rp) ) { |
|
rvect[i] = (NM_ind_pair)BDY(rp); |
|
imat[i] = nm_ind_pair_to_vect_compress(trace,s0vect,col,rvect[i],start); |
|
rhead[imat[i]->head] = 1; |
|
start = imat[i]->head; |
|
} |
|
get_eg(&eg1); init_eg(&eg_conv); add_eg(&eg_conv,&eg0,&eg1); add_eg(&f4_conv,&eg0,&eg1); |
|
if ( DP_Print ) { |
|
fprintf(asir_out,"conv=%.3fsec,",eg_conv.exectime); |
|
fflush(asir_out); |
|
} |
|
if ( m > 0 ) |
|
r0 = nd_f4_red_mod64_main_s(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,syzlistp); |
|
else |
|
// r0 = nd_f4_red_q_main_s(sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred); |
|
error("nd_f4_red_q_main_s : not implemented yet"); |
|
return r0; |
|
} |
|
|
|
INLINE int ndl_find_reducer_minsig(UINT *dg) |
|
{ |
|
RHist r; |
|
int i,singular,ret,d,k,imin; |
|
SIG t; |
|
static int wpd,nvar; |
|
static SIG quo,quomin; |
|
static UINT *tmp; |
|
|
|
if ( !quo || nvar != nd_nvar ) { NEWSIG(quo); NEWSIG(quomin); } |
|
if ( wpd != nd_wpd ) { |
|
wpd = nd_wpd; |
|
tmp = (UINT *)MALLOC(wpd*sizeof(UINT)); |
|
} |
|
#if 0 |
|
d = ndl_hash_value(dg); |
|
for ( r = nd_red[d], k = 0; r; r = NEXT(r), k++ ) { |
|
if ( ndl_equal(dg,DL(r)) ) { |
|
return r->index; |
|
} |
|
} |
|
#endif |
|
imin = -1; |
|
for ( i = 0; i < nd_psn; i++ ) { |
|
r = nd_psh[i]; |
|
if ( ndl_reducible(dg,DL(r)) ) { |
|
ndl_sub(dg,DL(r),tmp); |
|
_ndltodl(tmp,DL(quo)); |
|
_addtodl(nd_nvar,DL(nd_psh[i]->sig),DL(quo)); |
|
quo->pos = nd_psh[i]->sig->pos; |
|
if ( imin < 0 || comp_sig(quomin,quo) > 0 ) { |
|
t = quo; quo = quomin; quomin = t; |
|
imin = i; |
|
} |
|
} |
|
} |
|
if ( imin == -1 ) return nd_psn; |
|
else { |
|
#if 0 |
|
nd_append_red(dg,i); |
|
#endif |
|
return imin; |
|
} |
|
} |
|
|
|
int nd_symbolic_preproc_s(PGeoBucket bucket,int trace,UINT **s0vect,NODE *r) |
|
{ |
|
NODE rp0,rp; |
|
NM mul,head,s0,s; |
|
int index,col,i,sugar; |
|
RHist h; |
|
UINT *s0v,*p; |
|
NM_ind_pair pair; |
|
ND red; |
|
NDV *ps; |
|
SIG sig; |
|
|
|
s0 = 0; rp0 = 0; col = 0; |
|
if ( nd_demand ) |
|
ps = trace?nd_ps_trace_sym:nd_ps_sym; |
|
else |
|
ps = trace?nd_ps_trace:nd_ps; |
|
while ( 1 ) { |
|
head = remove_head_pbucket_symbolic(bucket); |
|
if ( !head ) break; |
|
if ( !s0 ) s0 = head; |
|
else NEXT(s) = head; |
|
s = head; |
|
index = ndl_find_reducer_minsig(DL(head)); |
|
if ( index >= 0 && index < nd_psn ) { |
|
h = nd_psh[index]; |
|
NEWNM(mul); |
|
ndl_sub(DL(head),DL(h),DL(mul)); |
|
if ( ndl_check_bound2(index,DL(mul)) ) |
|
return 0; |
|
sugar = TD(DL(mul))+SG(ps[index]); |
|
NEWSIG(sig); |
|
_ndltodl(DL(mul),DL(sig)); |
|
_addtodl(nd_nvar,DL(nd_psh[index]->sig),DL(sig)); |
|
sig->pos = nd_psh[index]->sig->pos; |
|
MKNM_ind_pair(pair,mul,index,sugar,sig); |
|
red = ndv_mul_nm_symbolic(mul,ps[index]); |
|
add_pbucket_symbolic(bucket,nd_remove_head(red)); |
|
NEXTNODE(rp0,rp); BDY(rp) = (pointer)pair; |
|
} |
|
col++; |
|
} |
|
if ( rp0 ) NEXT(rp) = 0; |
|
NEXT(s) = 0; |
|
s0v = (UINT *)MALLOC_ATOMIC(col*nd_wpd*sizeof(UINT)); |
|
for ( i = 0, p = s0v, s = s0; i < col; |
|
i++, p += nd_wpd, s = NEXT(s) ) ndl_copy(DL(s),p); |
|
*s0vect = s0v; |
|
*r = rp0; |
|
|
|
return col; |
|
} |
|
|
|
NODE nd_sba_f4(int m,int **indp) |
|
{ |
|
int i,nh,stat,index,f4red; |
|
NODE r,g,tn0,tn,node; |
|
ND_pairs d,l,t,ll0,ll,lh; |
|
LIST l0,l1; |
|
ND spol,red; |
|
NDV nf,redv; |
|
NM s0,s; |
|
NODE rp0,srp0,nflist; |
|
int nsp,nred,col,rank,len,k,j,a,i1s,i2s; |
|
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; |
|
struct oEGT eg0,eg1,eg_f4; |
|
Z i1,i2,sugarq; |
|
NODE *syzlist; |
|
|
|
Nf4_red=0; |
|
d = 0; |
|
syzlist = (NODE *)MALLOC(nd_psn*sizeof(NODE)); |
|
for ( i = 0; i < nd_psn; i++ ) { |
|
d = update_pairs_s(d,i,syzlist); |
|
} |
|
nd_nbase = nd_psn; |
|
f4red = 1; |
|
while ( d ) { |
|
l = nd_minsugarp_s(d,&d); |
|
if ( !l ) continue; |
|
sugar = nd_sugarweight?l->sugar2:SG(l); |
|
if ( MaxDeg > 0 && sugar > MaxDeg ) break; |
|
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); |
|
continue; |
|
} |
|
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); |
|
continue; |
|
} |
|
if ( DP_Print ) fprintf(asir_out,"sugar=%d,",sugar); |
|
l = remove_large_lcm(l); |
|
nflist = nd_f4_red_s(m,l,0,s0vect,col,rp0,syzlist); |
|
/* adding new bases */ |
|
for ( r = nflist; r; r = NEXT(r) ) { |
|
ND tmp,tmpred; |
|
SIG sig; |
|
|
|
nf = (NDV)BDY(r); |
|
sig = nf->sig; |
|
tmp = ndvtond(m,nf); |
|
stat = nd_nf_s(m,0,tmp,nd_ps,!Top,&tmpred); |
|
if ( stat < 0 ) { |
|
// top reducible |
|
if ( DP_Print ) { fprintf(asir_out,"S"); fflush(asir_out); } |
|
} else if ( tmpred ) { |
|
nf = ndtondv(m,tmpred); |
|
ndv_removecont(m,nf); |
|
nh = ndv_newps(m,nf,0); |
|
d = update_pairs_s(d,nh,syzlist); |
|
nd_sba_pos[sig->pos] = append_one(nd_sba_pos[sig->pos],nh); |
|
} else { |
|
syzlist[sig->pos] = insert_sig(syzlist[sig->pos],sig); |
|
} |
|
} |
|
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 ) { |
|
fprintf(asir_out,"number of red=%d,",Nf4_red); |
|
} |
|
g = conv_ilist_s(nd_demand,0,indp); |
|
return g; |
|
} |