=================================================================== RCS file: /home/cvs/OpenXM_contrib2/asir2000/engine/nd.c,v retrieving revision 1.212 retrieving revision 1.247 diff -u -p -r1.212 -r1.247 --- OpenXM_contrib2/asir2000/engine/nd.c 2013/09/27 02:35:15 1.212 +++ OpenXM_contrib2/asir2000/engine/nd.c 2018/07/28 00:45:55 1.247 @@ -1,4 +1,4 @@ -/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.211 2013/09/26 08:55:11 noro Exp $ */ +/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.246 2018/04/20 06:24:56 noro Exp $ */ #include "nd.h" @@ -8,11 +8,14 @@ int diag_period = 6; int weight_check = 1; int (*ndl_compare_function)(UINT *a1,UINT *a2); int nd_dcomp; +int nd_rref2; NM _nm_free_list; ND _nd_free_list; ND_pairs _ndp_free_list; NODE nd_hcf; +Obj nd_top_weight; + static NODE nd_subst; static VL nd_vc; static int nd_ntrans; @@ -37,7 +40,10 @@ static UINT nd_mask[32]; static UINT nd_mask0,nd_mask1; static NDV *nd_ps; +static NDV *nd_ps_gz; static NDV *nd_ps_trace; +static NDV *nd_ps_sym; +static NDV *nd_ps_trace_sym; static RHist *nd_psh; static int nd_psn,nd_pslen; static RHist *nd_red; @@ -50,12 +56,16 @@ static int nd_found,nd_create,nd_notfirst; static int nmv_adv; static int nd_demand; static int nd_module,nd_ispot,nd_mpos,nd_pot_nelim; +static int nd_module_rank,nd_poly_weight_len; +static int *nd_poly_weight,*nd_module_weight; static NODE nd_tracelist; static NODE nd_alltracelist; -static int nd_gentrace,nd_gensyz,nd_nora,nd_newelim,nd_intersect; +static int nd_gentrace,nd_gensyz,nd_nora,nd_newelim,nd_intersect,nd_lf; static int *nd_gbblock; static NODE nd_nzlist,nd_check_splist; static int nd_splist; +static int *nd_sugarweight; +static int nd_f4red,nd_rank0,nd_last_nonzero; NumberField get_numberfield(); UINT *nd_det_compute_bound(NDV **dm,int n,int j); @@ -77,9 +87,40 @@ void parse_nd_option(NODE opt); void dltondl(int n,DL dl,UINT *r); DP ndvtodp(int mod,NDV p); DP ndtodp(int mod,ND p); +NDV ndvtondvgz(NDV p); +NDV ndvgztondv(NDV p); +ND ndtondgz(ND p); +ND ndgztond(ND p); -extern int Denominator,DP_Multiple; +void Pdp_set_weight(NODE,VECT *); +void Pox_cmo_rpc(NODE,Obj *); +ND nd_add_lf(ND p1,ND p2); +void nd_mul_c_lf(ND p,GZ mul); +void ndv_mul_c_lf(NDV p,GZ mul); +NODE nd_f4_red_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); +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); +NODE nd_f4_red_lf_main(int m,ND_pairs sp0,int nsp,int trace,UINT *s0vect,int col, + NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred); +int nd_gauss_elim_lf(mpz_t **mat0,int *sugar,int row,int col,int *colstat); +NODE nd_f4_lf_trace_main(int m,int **indp); +void nd_f4_lf_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp); + +extern int lf_lazy; +extern GZ current_mod_lf; + +extern int Denominator,DP_Multiple,MaxDeg; + +#define BLEN (8*sizeof(unsigned long)) + +typedef struct matrix { + int row,col; + unsigned long **a; +} *matrix; + + void nd_free_private_storage() { _nm_free_list = 0; @@ -100,6 +141,20 @@ void _NM_alloc() } } +matrix alloc_matrix(int row,int col) +{ + unsigned long **a; + int i,len,blen; + matrix mat; + + mat = (matrix)MALLOC(sizeof(struct matrix)); + mat->row = row; + mat->col = col; + mat->a = a = (unsigned long **)MALLOC(row*sizeof(unsigned long *)); + return mat; +} + + void _ND_alloc() { ND p; @@ -136,6 +191,8 @@ INLINE int nd_length(ND p) } } +extern int dp_negative_weight; + INLINE int ndl_reducible(UINT *d1,UINT *d2) { UINT u1,u2; @@ -143,7 +200,7 @@ INLINE int ndl_reducible(UINT *d1,UINT *d2) if ( nd_module && (MPOS(d1) != MPOS(d2)) ) return 0; - if ( TD(d1) < TD(d2) ) return 0; + if ( !dp_negative_weight && TD(d1) < TD(d2) ) return 0; #if USE_UNROLL switch ( nd_bpe ) { case 3: @@ -422,6 +479,22 @@ int ndl_weight(UINT *d) return t; } +/* for sugarweight */ + +int ndl_weight2(UINT *d) +{ + int t,u; + int i,j; + + for ( i = 0, t = 0; i < nd_nvar; i++ ) { + u = GET_EXP(d,i); + t += nd_sugarweight[i]*u; + } + if ( nd_module && current_module_weight_vector && MPOS(d) ) + t += current_module_weight_vector[MPOS(d)]; + return t; +} + void ndl_weight_mask(UINT *d) { UINT t,u; @@ -490,11 +563,37 @@ int ndl_block_compare(UINT *d1,UINT *d2) int ndl_matrix_compare(UINT *d1,UINT *d2) { - int i,j,s; + int i,j,s,row; int *v; + Q **mat; + Q *w; + Q t,t1,t2; for ( j = 0; j < nd_nvar; j++ ) nd_work_vector[j] = GET_EXP(d1,j)-GET_EXP(d2,j); + if ( nd_top_weight ) { + if ( OID(nd_top_weight) == O_VECT ) { + mat = (Q **)&BDY((VECT)nd_top_weight); + row = 1; + } else { + mat = (Q **)BDY((MAT)nd_top_weight); + row = ((MAT)nd_top_weight)->row; + } + for ( i = 0; i < row; i++ ) { + w = (Q *)mat[i]; + for ( j = 0, t = 0; j < nd_nvar; j++ ) { + STOQ(nd_work_vector[j],t1); + mulq(w[j],t1,&t2); + addq(t,t2,&t1); + t = t1; + } + if ( t ) { + s = SGN(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++ ) @@ -502,6 +601,8 @@ int ndl_matrix_compare(UINT *d1,UINT *d2) if ( s > 0 ) return 1; else if ( s < 0 ) return -1; } + if ( !ndl_equal(d1,d2) ) + error("afo"); return 0; } @@ -555,6 +656,7 @@ int ndl_composite_compare(UINT *d1,UINT *d2) else if ( nd_work_vector[j] < 0 ) return -1; break; case 2: + end = start+len; for ( j = start; j < end; j++ ) if ( nd_work_vector[j] > 0 ) return 1; else if ( nd_work_vector[j] < 0 ) return -1; @@ -584,19 +686,37 @@ int ndl_ww_lex_compare(UINT *d1,UINT *d2) return ndl_lex_compare(d1,d2); } +int ndl_module_weight_compare(UINT *d1,UINT *d2) +{ + int s,j; + + if ( nd_nvar != nd_poly_weight_len ) + error("invalid module weight : the length of polynomial weight != the number of variables"); + s = 0; + for ( j = 0; j < nd_nvar; j++ ) + s += (GET_EXP(d1,j)-GET_EXP(d2,j))*nd_poly_weight[j]; + if ( MPOS(d1) >= 1 && MPOS(d2) >= 1 ) { + s += nd_module_weight[MPOS(d1)-1]-nd_module_weight[MPOS(d2)-1]; + } + if ( s > 0 ) return 1; + else if ( s < 0 ) return -1; + else return 0; +} + int ndl_module_grlex_compare(UINT *d1,UINT *d2) { int i,c; + if ( nd_module_rank && (c = ndl_module_weight_compare(d1,d2)) ) return c; if ( nd_ispot ) { - if ( nd_pot_nelim && MPOS(d1)>=nd_pot_nelim+1 && MPOS(d2) >= nd_pot_nelim+1 ) { + if ( nd_pot_nelim && MPOS(d1)>=nd_pot_nelim+1 && MPOS(d2) >= nd_pot_nelim+1 ) { if ( TD(d1) > TD(d2) ) return 1; else if ( TD(d1) < TD(d2) ) return -1; if ( c = ndl_lex_compare(d1,d2) ) return c; if ( MPOS(d1) < MPOS(d2) ) return 1; 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; } @@ -614,6 +734,7 @@ int ndl_module_glex_compare(UINT *d1,UINT *d2) { int i,c; + 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; @@ -632,6 +753,7 @@ int ndl_module_lex_compare(UINT *d1,UINT *d2) { int i,c; + 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; @@ -648,6 +770,7 @@ int ndl_module_block_compare(UINT *d1,UINT *d2) { int i,c; + 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; @@ -664,6 +787,7 @@ int ndl_module_matrix_compare(UINT *d1,UINT *d2) { int i,c; + 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; @@ -680,6 +804,7 @@ int ndl_module_composite_compare(UINT *d1,UINT *d2) { int i,c; + 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; @@ -1097,6 +1222,7 @@ ND nd_add(int mod,ND p1,ND p2) if ( !p1 ) return p2; else if ( !p2 ) return p1; else if ( mod == -1 ) return nd_add_sf(p1,p2); + else if ( mod == -2 ) return nd_add_lf(p1,p2); else if ( !mod ) return nd_add_q(p1,p2); else { can = 0; @@ -1257,6 +1383,7 @@ ND nd_add_sf(ND p1,ND p2) } } + ND nd_reduce2(int mod,ND d,ND g,NDV p,NM mul,NDC dn,Obj *divp) { int c,c1,c2; @@ -1267,6 +1394,12 @@ ND nd_reduce2(int mod,ND d,ND g,NDV p,NM mul,NDC dn,Ob if ( mod == -1 ) { CM(mul) = _mulsf(_invsf(HCM(p)),_chsgnsf(HCM(g))); *divp = (Obj)ONE; + } else if ( mod == -2 ) { + GZ inv,t; + divlf(ONEGZ,HCZ(p),&inv); + chsgnlf(HCZ(g),&t); + mullf(inv,t,&CZ(mul)); + *divp = (Obj)ONE; } else if ( mod ) { c1 = invm(HCM(p),mod); c2 = mod-HCM(g); DMAR(c1,c2,0,mod,c); CM(mul) = c; @@ -1328,7 +1461,7 @@ int nd_nf(int mod,ND d,ND g,NDV *ps,int full,NDC dn,ND sugar0 = sugar = SG(g); n = NV(g); - mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); + mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); if ( d ) for ( tail = BDY(d); NEXT(tail); tail = NEXT(tail) ); for ( ; g; ) { @@ -1416,9 +1549,14 @@ int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp bucket = create_pbucket(); add_pbucket(mod,bucket,g); d = 0; - mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); + mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); while ( 1 ) { - hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket); + 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; @@ -1441,7 +1579,12 @@ int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp p = ps[index]; if ( mod == -1 ) CM(mul) = _mulsf(_invsf(HCM(p)),_chsgnsf(HCM(g))); - else if ( mod ) { + else if ( mod == -2 ) { + GZ inv,t; + divlf(ONEGZ,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 { @@ -1507,28 +1650,32 @@ int ndv_check_membership(int m,NODE input,int obpe,int ndv_setup(m,0,cand,nd_gentrace?1:0,1); n = length(cand); - if ( nd_gentrace ) { nd_alltracelist = 0; nd_tracelist = 0; } + if ( nd_gentrace ) { nd_alltracelist = 0; nd_tracelist = 0; } /* membercheck : list is a subset of Id(cand) ? */ for ( t = input, i = 0; t; t = NEXT(t), i++ ) { again: - nd_tracelist = 0; + nd_tracelist = 0; if ( nd_bpe > obpe ) r = ndv_dup_realloc((NDV)BDY(t),obpe,oadv,oepos); else r = (NDV)BDY(t); +#if 0 + // moved to nd_f4_lf_trace() + if ( m == -2 ) ndv_mod(m,r); +#endif d = ndvtond(m,r); stat = nd_nf(m,0,d,nd_ps,0,0,&nf); if ( !stat ) { nd_reconstruct(0,0); goto again; } else if ( nf ) return 0; - if ( nd_gentrace ) { - nd_tracelist = reverse_node(nd_tracelist); - MKLIST(list,nd_tracelist); - STOQ(i,q); s = mknode(2,q,list); MKLIST(list,s); - MKNODE(s,list,nd_alltracelist); - nd_alltracelist = s; nd_tracelist = 0; - } + if ( nd_gentrace ) { + nd_tracelist = reverse_node(nd_tracelist); + MKLIST(list,nd_tracelist); + STOQ(i,q); s = mknode(2,q,list); MKLIST(list,s); + MKNODE(s,list,nd_alltracelist); + nd_alltracelist = s; nd_tracelist = 0; + } if ( DP_Print ) { printf("."); fflush(stdout); } } if ( DP_Print ) { printf("\n"); } @@ -1749,6 +1896,46 @@ int head_pbucket_q(PGeoBucket g) } } +int head_pbucket_lf(PGeoBucket g) +{ + int j,i,c,k,nv; + GZ sum,t; + ND gi,gj; + + k = g->m; + while ( 1 ) { + j = -1; + for ( i = 0; i <= k; i++ ) { + if ( !(gi = g->body[i]) ) continue; + if ( j < 0 ) { + j = i; + gj = g->body[j]; + sum = HCZ(gj); + } else { + nv = NV(gi); + c = DL_COMPARE(HDL(gi),HDL(gj)); + if ( c > 0 ) { + if ( sum ) HCZ(gj) = sum; + else g->body[j] = nd_remove_head(gj); + j = i; + gj = g->body[j]; + sum = HCZ(gj); + } else if ( c == 0 ) { + addlf(sum,HCZ(gi),&t); + sum = t; + g->body[i] = nd_remove_head(gi); + } + } + } + if ( j < 0 ) return -1; + else if ( sum ) { + HCZ(gj) = sum; + return j; + } else + g->body[j] = nd_remove_head(gj); + } +} + ND normalize_pbucket(int mod,PGeoBucket g) { int i; @@ -1855,7 +2042,7 @@ int do_diagonalize(int sugar,int m) ndv_free(nfv); hc = HCU(nf); nd_removecont(m,nf); cont = ndc_div(m,hc,HCU(nf)); - if ( nd_gentrace ) finalize_tracelist(i,cont); + if ( nd_gentrace ) finalize_tracelist(i,cont); nfv = ndtondv(m,nf); nd_free(nf); nd_bound[i] = ndv_compute_bound(nfv); @@ -1871,25 +2058,25 @@ int do_diagonalize(int sugar,int m) LIST compute_splist() { - NODE g,tn0,tn,node; - LIST l0; - ND_pairs d,t; - int i; - Q i1,i2; + NODE g,tn0,tn,node; + LIST l0; + ND_pairs d,t; + int i; + Q i1,i2; g = 0; d = 0; for ( i = 0; i < nd_psn; i++ ) { d = update_pairs(d,g,i,0); g = update_base(g,i); } - for ( t = d, tn0 = 0; t; t = NEXT(t) ) { - NEXTNODE(tn0,tn); + for ( t = d, tn0 = 0; t; t = NEXT(t) ) { + NEXTNODE(tn0,tn); STOQ(t->i1,i1); STOQ(t->i2,i2); node = mknode(2,i1,i2); MKLIST(l0,node); - BDY(tn) = l0; - } - if ( tn0 ) NEXT(tn) = 0; MKLIST(l0,tn0); - return l0; + BDY(tn) = l0; + } + if ( tn0 ) NEXT(tn) = 0; MKLIST(l0,tn0); + return l0; } /* return value = 0 => input is not a GB */ @@ -1917,6 +2104,7 @@ NODE nd_gb(int m,int ishomo,int checkonly,int gensyz,i while ( d ) { again: l = nd_minp(d,&d); + if ( MaxDeg > 0 && SG(l) > MaxDeg ) break; if ( SG(l) != sugar ) { if ( ishomo ) { diag_count = 0; @@ -1948,11 +2136,11 @@ again: goto again; } else if ( nf ) { if ( checkonly || gensyz ) return 0; - if ( nd_newelim ) { - if ( nd_module ) { - if ( MPOS(HDL(nf)) > 1 ) return 0; - } else if ( !(HDL(nf)[nd_exporigin] & nd_mask[0]) ) return 0; - } + if ( nd_newelim ) { + if ( nd_module ) { + if ( MPOS(HDL(nf)) > 1 ) return 0; + } else if ( !(HDL(nf)[nd_exporigin] & nd_mask[0]) ) return 0; + } if ( DP_Print ) { printf("+"); fflush(stdout); } hc = HCU(nf); nd_removecont(m,nf); @@ -1961,15 +2149,15 @@ again: nd_removecont(m,nf); } if ( nd_gentrace ) { - cont = ndc_div(m,hc,HCU(nf)); - if ( m || !UNIQ(cont) ) { + cont = ndc_div(m,hc,HCU(nf)); + if ( m || !UNIQ(cont) ) { t = mknode(4,NULLP,NULLP,NULLP,cont); 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); + nh = ndv_newps(m,nfv,0,0); if ( !m && (ishomo && ++diag_count == diag_period) ) { diag_count = 0; stat = do_diagonalize(sugar,m); @@ -1983,18 +2171,18 @@ again: g = update_base(g,nh); FREENDP(l); } else { - if ( nd_gentrace && gensyz ) { + if ( nd_gentrace && gensyz ) { nd_tracelist = reverse_node(nd_tracelist); - MKLIST(list,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; - } + nd_alltracelist = t; nd_tracelist = 0; + } if ( DP_Print ) { printf("."); fflush(stdout); } FREENDP(l); } } - conv_ilist(nd_demand,0,g,indp); + conv_ilist(nd_demand,0,g,indp); if ( !checkonly && DP_Print ) { printf("nd_gb done.\n"); fflush(stdout); } return g; } @@ -2003,19 +2191,19 @@ again: int check_splist(int m,NODE splist) { - NODE t,p; - ND_pairs d,r,l; - int stat; - ND h,nf; + NODE t,p; + ND_pairs d,r,l; + int stat; + ND h,nf; - for ( d = 0, t = splist; t; t = NEXT(t) ) { - p = BDY((LIST)BDY(t)); + for ( d = 0, t = splist; t; t = NEXT(t) ) { + p = BDY((LIST)BDY(t)); NEXTND_pairs(d,r); r->i1 = QTOS((Q)ARG0(p)); r->i2 = QTOS((Q)ARG1(p)); ndl_lcm(DL(nd_psh[r->i1]),DL(nd_psh[r->i2]),r->lcm); - SG(r) = TD(LCM(r)); /* XXX */ - } - if ( d ) NEXT(r) = 0; + SG(r) = TD(LCM(r)); /* XXX */ + } + if ( d ) NEXT(r) = 0; while ( d ) { again: @@ -2032,12 +2220,52 @@ again: d = nd_reconstruct(0,d); goto again; } else if ( nf ) return 0; - if ( DP_Print) { printf("."); fflush(stdout); } + if ( DP_Print) { printf("."); fflush(stdout); } } - if ( DP_Print) { printf("done.\n"); fflush(stdout); } - return 1; + if ( DP_Print) { printf("done.\n"); fflush(stdout); } + return 1; } +int check_splist_f4(int m,NODE splist) +{ + UINT *s0vect; + PGeoBucket bucket; + NODE p,rp0,t; + ND_pairs d,r,l,ll; + int col,stat; + + for ( d = 0, t = splist; t; t = NEXT(t) ) { + p = BDY((LIST)BDY(t)); + NEXTND_pairs(d,r); + r->i1 = QTOS((Q)ARG0(p)); r->i2 = QTOS((Q)ARG1(p)); + ndl_lcm(DL(nd_psh[r->i1]),DL(nd_psh[r->i2]),r->lcm); + SG(r) = TD(LCM(r)); /* XXX */ + } + if ( d ) NEXT(r) = 0; + + while ( d ) { + l = nd_minsugarp(d,&d); + bucket = create_pbucket(); + stat = nd_sp_f4(m,0,l,bucket); + if ( !stat ) { + for ( ll = l; NEXT(ll); ll = NEXT(ll) ); + NEXT(ll) = d; d = l; + d = nd_reconstruct(0,d); + 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; +} + int do_diagonalize_trace(int sugar,int m) { int i,nh,stat; @@ -2078,7 +2306,7 @@ int do_diagonalize_trace(int sugar,int m) if ( !stat ) return 0; ndv_free(nfv); hc = HCU(nf); nd_removecont(0,nf); - cont = ndc_div(0,hc,HCU(nf)); + cont = ndc_div(0,hc,HCU(nf)); if ( nd_gentrace ) finalize_tracelist(i,cont); nfv = ndtondv(0,nf); nd_free(nf); @@ -2135,6 +2363,7 @@ NODE nd_gb_trace(int m,int ishomo,int **indp) while ( d ) { again: l = nd_minp(d,&d); + if ( MaxDeg > 0 && SG(l) > MaxDeg ) break; if ( SG(l) != sugar ) { #if 1 if ( ishomo ) { @@ -2202,14 +2431,14 @@ again: nd_removecont(m,nf); nfv = ndtondv(m,nf); nd_free(nf); } if ( nd_gentrace ) { - cont = ndc_div(0,hnfq,HCU(nfqv)); - if ( !UNIQ(cont) ) { + 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; - } + nd_tracelist = t; + } } - nh = ndv_newps(0,nfv,nfqv); + nh = ndv_newps(0,nfv,nfqv,0); if ( ishomo && ++diag_count == diag_period ) { diag_count = 0; if ( DP_Print > 2 ) fprintf(asir_out,"|"); @@ -2232,11 +2461,13 @@ again: FREENDP(l); } if ( nd_nalg ) { - print_eg("monic",&eg_monic); - print_eg("invdalg",&eg_invdalg); - print_eg("le",&eg_le); + if ( DP_Print ) { + 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); } return g; } @@ -2269,8 +2500,8 @@ NODE ndv_reduceall(int m,NODE f) union oNDC dn; Q q,num,den; NODE node; - LIST l; - Q iq,jq; + LIST l; + Q iq,jq; int *perm; union oNDC hc; P cont,cont1; @@ -2278,11 +2509,11 @@ NODE ndv_reduceall(int m,NODE f) if ( nd_nora ) return f; n = length(f); ndv_setup(m,0,f,0,1); - perm = (int *)MALLOC(n*sizeof(int)); - if ( nd_gentrace ) { - for ( t = nd_tracelist, i = 0; i < n; i++, t = NEXT(t) ) - perm[i] = QTOS((Q)ARG1(BDY((LIST)BDY(t)))); - } + perm = (int *)MALLOC(n*sizeof(int)); + if ( nd_gentrace ) { + for ( t = nd_tracelist, i = 0; i < n; i++, t = NEXT(t) ) + perm[i] = QTOS((Q)ARG1(BDY((LIST)BDY(t)))); + } for ( i = 0; i < n; ) { if ( nd_gentrace ) { /* Trace = [1,index,1,1] */ @@ -2299,7 +2530,7 @@ NODE ndv_reduceall(int m,NODE f) ndv_free(nd_ps[i]); hc = HCU(nf); nd_removecont(m,nf); 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); STOQ(perm[j],jq); ARG1(BDY((LIST)BDY(t))) = jq; } @@ -2314,12 +2545,12 @@ NODE ndv_reduceall(int m,NODE f) if ( DP_Print ) { printf("\n"); } for ( a0 = 0, i = 0; i < n; i++ ) { NEXTNODE(a0,a); - if ( !nd_gentrace ) BDY(a) = (pointer)nd_ps[i]; - else { - for ( j = 0; j < n; j++ ) if ( perm[j] == i ) break; - BDY(a) = (pointer)nd_ps[j]; - } + if ( !nd_gentrace ) BDY(a) = (pointer)nd_ps[i]; + else { + for ( j = 0; j < n; j++ ) if ( perm[j] == i ) break; + BDY(a) = (pointer)nd_ps[j]; } + } NEXT(a) = 0; return a0; } @@ -2329,18 +2560,18 @@ ND_pairs update_pairs( ND_pairs d, NODE /* of index */ ND_pairs d1,nd,cur,head,prev,remove; if ( !g ) return d; - /* for testing */ - if ( gensyz && nd_gensyz == 2 ) { - d1 = nd_newpairs(g,t); - if ( !d ) - return d1; - else { - nd = d; - while ( NEXT(nd) ) nd = NEXT(nd); - NEXT(nd) = d1; - return d; - } - } + /* for testing */ + if ( gensyz && nd_gensyz == 2 ) { + d1 = nd_newpairs(g,t); + if ( !d ) + return d1; + else { + nd = d; + while ( NEXT(nd) ) nd = NEXT(nd); + NEXT(nd) = d1; + return d; + } + } d = crit_B(d,t); d1 = nd_newpairs(g,t); d1 = crit_M(d1); @@ -2380,31 +2611,58 @@ ND_pairs nd_newpairs( NODE g, int t ) dl = DL(nd_psh[t]); ts = SG(nd_psh[t]) - TD(dl); - if ( nd_module && nd_intersect && (MPOS(dl) > 1) ) return 0; + if ( nd_module && nd_intersect && (MPOS(dl) > 1) ) return 0; for ( r0 = 0, h = g; h; h = NEXT(h) ) { if ( nd_module && (MPOS(DL(nd_psh[(long)BDY(h)])) != MPOS(dl)) ) continue; - if ( nd_gbblock ) { - t0 = (long)BDY(h); - for ( i = 0; nd_gbblock[i] >= 0; i += 2 ) { - min = nd_gbblock[i]; max = nd_gbblock[i+1]; - if ( t0 >= min && t0 <= max && t >= min && t <= max ) - break; - } - if ( nd_gbblock[i] >= 0 ) - continue; - } + if ( nd_gbblock ) { + t0 = (long)BDY(h); + for ( i = 0; nd_gbblock[i] >= 0; i += 2 ) { + min = nd_gbblock[i]; max = nd_gbblock[i+1]; + if ( t0 >= min && t0 <= max && t >= min && t <= max ) + break; + } + if ( nd_gbblock[i] >= 0 ) + continue; + } NEXTND_pairs(r0,r); r->i1 = (long)BDY(h); r->i2 = t; ndl_lcm(DL(nd_psh[r->i1]),dl,r->lcm); s = SG(nd_psh[r->i1])-TD(DL(nd_psh[r->i1])); SG(r) = MAX(s,ts) + TD(LCM(r)); + /* experimental */ + if ( nd_sugarweight ) + r->sugar2 = ndl_weight2(r->lcm); } if ( r0 ) NEXT(r) = 0; return r0; } +/* ipair = [i1,i2],[i1,i2],... */ +ND_pairs nd_ipairtospair(NODE ipair) +{ + int s1,s2; + NODE tn,t; + ND_pairs r,r0; + + for ( r0 = 0, t = ipair; t; t = NEXT(t) ) { + NEXTND_pairs(r0,r); + tn = BDY((LIST)BDY(t)); + r->i1 = QTOS((Q)ARG0(tn)); + r->i2 = QTOS((Q)ARG1(tn)); + 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])); + s2 = SG(nd_psh[r->i2])-TD(DL(nd_psh[r->i2])); + SG(r) = MAX(s1,s2) + TD(LCM(r)); + /* experimental */ + if ( nd_sugarweight ) + r->sugar2 = ndl_weight2(r->lcm); + } + if ( r0 ) NEXT(r) = 0; + return r0; +} + /* kokokara */ ND_pairs crit_B( ND_pairs d, int s ) @@ -2417,7 +2675,7 @@ ND_pairs crit_B( ND_pairs d, int s ) t = DL(nd_psh[s]); prev = 0; head = cur = d; - lcm = (UINT *)ALLOCA(nd_wpd*sizeof(UINT)); + lcm = (UINT *)MALLOC(nd_wpd*sizeof(UINT)); while ( cur ) { tl = cur->lcm; if ( ndl_reducible(tl,t) ) { @@ -2585,13 +2843,22 @@ ND_pairs nd_minp( ND_pairs d, ND_pairs *prest ) NEXT(m) = 0; return m; } - s = SG(m); if ( !NoSugar ) { - for ( ml = 0, l = m; p; p = NEXT(l = p) ) - if ( (SG(p) < s) - || ((SG(p) == s) && (DL_COMPARE(LCM(p),LCM(m)) < 0)) ) { - ml = l; m = p; s = SG(m); - } + if ( nd_sugarweight ) { + s = m->sugar2; + for ( ml = 0, l = m; p; p = NEXT(l = p) ) + if ( (p->sugar2 < s) + || ((p->sugar2 == s) && (DL_COMPARE(LCM(p),LCM(m)) < 0)) ) { + ml = l; m = p; s = m->sugar2; + } + } else { + s = SG(m); + for ( ml = 0, l = m; p; p = NEXT(l = p) ) + if ( (SG(p) < s) + || ((SG(p) == s) && (DL_COMPARE(LCM(p),LCM(m)) < 0)) ) { + ml = l; m = p; s = SG(m); + } + } } else { for ( ml = 0, l = m; p; p = NEXT(l = p) ) if ( DL_COMPARE(LCM(p),LCM(m)) < 0 ) { @@ -2612,28 +2879,57 @@ ND_pairs nd_minsugarp( ND_pairs d, ND_pairs *prest ) int msugar,i; ND_pairs t,dm0,dm,dr0,dr; - for ( msugar = SG(d), t = NEXT(d); t; t = NEXT(t) ) - if ( SG(t) < msugar ) msugar = SG(t); - dm0 = 0; dr0 = 0; - for ( i = 0, t = d; t; t = NEXT(t) ) - if ( i < nd_f4_nsp && SG(t) == msugar ) { - if ( dm0 ) NEXT(dm) = t; - else dm0 = t; - dm = t; - i++; - } else { - if ( dr0 ) NEXT(dr) = t; - else dr0 = t; - dr = t; - } + if ( nd_sugarweight ) { + for ( msugar = d->sugar2, t = NEXT(d); t; t = NEXT(t) ) + if ( t->sugar2 < msugar ) msugar = t->sugar2; + dm0 = 0; dr0 = 0; + for ( i = 0, t = d; t; t = NEXT(t) ) + if ( i < nd_f4_nsp && t->sugar2 == msugar ) { + if ( dm0 ) NEXT(dm) = t; + else dm0 = t; + dm = t; + i++; + } else { + if ( dr0 ) NEXT(dr) = t; + else dr0 = t; + dr = t; + } + } else { + for ( msugar = SG(d), t = NEXT(d); t; t = NEXT(t) ) + if ( SG(t) < msugar ) msugar = SG(t); + dm0 = 0; dr0 = 0; + for ( i = 0, t = d; t; t = NEXT(t) ) + if ( i < nd_f4_nsp && SG(t) == msugar ) { + if ( dm0 ) NEXT(dm) = t; + else dm0 = t; + dm = t; + i++; + } else { + if ( dr0 ) NEXT(dr) = t; + else dr0 = t; + dr = t; + } + } NEXT(dm) = 0; if ( dr0 ) NEXT(dr) = 0; *prest = dr0; return dm0; } -int ndv_newps(int m,NDV a,NDV aq) +int nd_tdeg(NDV c) { + int wmax = 0; + int i,len; + NMV a; + + len = LEN(c); + for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) ) + wmax = MAX(TD(DL(a)),wmax); + return wmax; +} + +int ndv_newps(int m,NDV a,NDV aq,int f4) +{ int len; RHist r; NDV b; @@ -2644,29 +2940,52 @@ int ndv_newps(int m,NDV a,NDV aq) if ( nd_psn == nd_pslen ) { nd_pslen *= 2; nd_ps = (NDV *)REALLOC((char *)nd_ps,nd_pslen*sizeof(NDV)); + nd_ps_gz = (NDV *)REALLOC((char *)nd_ps_gz,nd_pslen*sizeof(NDV)); nd_ps_trace = (NDV *)REALLOC((char *)nd_ps_trace,nd_pslen*sizeof(NDV)); nd_psh = (RHist *)REALLOC((char *)nd_psh,nd_pslen*sizeof(RHist)); nd_bound = (UINT **) REALLOC((char *)nd_bound,nd_pslen*sizeof(UINT *)); + nd_ps_sym = (NDV *)REALLOC((char *)nd_ps_sym,nd_pslen*sizeof(NDV)); + nd_ps_trace_sym = (NDV *)REALLOC((char *)nd_ps_trace_sym,nd_pslen*sizeof(NDV)); } NEWRHist(r); nd_psh[nd_psn] = r; nd_ps[nd_psn] = a; if ( aq ) { nd_ps_trace[nd_psn] = aq; - register_hcf(aq); + if ( !m ) { + if ( !nd_vc ) nd_ps_gz[nd_psn] = ndvtondvgz(aq); + register_hcf(aq); + } else if ( m == -2 ) { + /* do nothing */ + } else + error("ndv_newps : invalud modulus"); nd_bound[nd_psn] = ndv_compute_bound(aq); - SG(r) = SG(aq); ndl_copy(HDL(aq),DL(r)); +#if 1 + SG(r) = SG(aq); +#else + SG(r) = nd_tdeg(aq); +#endif + ndl_copy(HDL(aq),DL(r)); } else { if ( !m ) register_hcf(a); nd_bound[nd_psn] = ndv_compute_bound(a); - SG(r) = SG(a); ndl_copy(HDL(a),DL(r)); +#if 1 + SG(r) = SG(a); +#else + SG(r) = nd_tdeg(a); +#endif + ndl_copy(HDL(a),DL(r)); + if ( !m && !nd_vc ) nd_ps_gz[nd_psn] = ndvtondvgz(a); } if ( nd_demand ) { if ( aq ) { ndv_save(nd_ps_trace[nd_psn],nd_psn); + nd_ps_sym[nd_psn] = ndv_symbolic(m,nd_ps_trace[nd_psn]); + nd_ps_trace_sym[nd_psn] = ndv_symbolic(m,nd_ps_trace[nd_psn]); nd_ps_trace[nd_psn] = 0; } else { ndv_save(nd_ps[nd_psn],nd_psn); + nd_ps_sym[nd_psn] = ndv_symbolic(m,nd_ps[nd_psn]); nd_ps[nd_psn] = 0; } } @@ -2701,7 +3020,7 @@ int ndv_setup(int mod,int trace,NODE f,int dont_sort,i nd_tracelist = 0; for ( nd_psn = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) nd_psn++; - w = (NDVI)ALLOCA(nd_psn*sizeof(struct oNDVI)); + w = (NDVI)MALLOC(nd_psn*sizeof(struct oNDVI)); 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 ( !dont_sort ) { @@ -2715,7 +3034,10 @@ int ndv_setup(int mod,int trace,NODE f,int dont_sort,i } nd_pslen = 2*nd_psn; nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); + nd_ps_gz = (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; @@ -2731,22 +3053,37 @@ int ndv_setup(int mod,int trace,NODE f,int dont_sort,i for ( i = 0; i < nd_psn; i++ ) { hc = HCU(w[i].p); if ( trace ) { - a = nd_ps_trace[i] = ndv_dup(0,w[i].p); - if ( !dont_removecont) ndv_removecont(0,a); - register_hcf(a); - am = nd_ps[i] = ndv_dup(mod,a); - ndv_mod(mod,am); - if ( DL_COMPARE(HDL(am),HDL(a)) ) - return 0; - ndv_removecont(mod,am); + if ( mod == -2 ) { + /* over a large finite field */ + /* trace = small modulus */ + a = nd_ps_trace[i] = ndv_dup(-2,w[i].p); + ndv_mod(-2,a); + if ( !dont_removecont) ndv_removecont(-2,a); + am = nd_ps[i] = ndv_dup(trace,w[i].p); + ndv_mod(trace,am); + if ( DL_COMPARE(HDL(am),HDL(a)) ) + return 0; + ndv_removecont(trace,am); + } else { + a = nd_ps_trace[i] = ndv_dup(0,w[i].p); + if ( !nd_vc ) nd_ps_gz[i] = ndvtondvgz(a); + if ( !dont_removecont) ndv_removecont(0,a); + register_hcf(a); + am = nd_ps[i] = ndv_dup(mod,a); + ndv_mod(mod,am); + if ( DL_COMPARE(HDL(am),HDL(a)) ) + return 0; + ndv_removecont(mod,am); + } } else { a = nd_ps[i] = ndv_dup(mod,w[i].p); + if ( !mod && !nd_vc ) nd_ps_gz[i] = ndvtondvgz(a); if ( mod || !dont_removecont ) ndv_removecont(mod,a); if ( !mod ) register_hcf(a); } if ( nd_gentrace ) { STOQ(i,iq); STOQ(w[i].i,jq); node = mknode(3,iq,jq,ONE); - if ( !dont_removecont ) + if ( !dont_removecont ) ARG2(node) = (pointer)ndc_div(trace?0:mod,hc,HCU(a)); MKLIST(l,node); NEXTNODE(nd_tracelist,tn); BDY(tn) = l; } @@ -2756,9 +3093,12 @@ int ndv_setup(int mod,int trace,NODE f,int dont_sort,i 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; } } @@ -2788,7 +3128,7 @@ void preprocess_algcoef(VL vv,VL av,struct order_spec LIST f1,f2; struct order_spec *current_spec; VECT obj,obj0; - Obj tmp; + VECT tmp; for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++); for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++); @@ -2802,19 +3142,19 @@ void preprocess_algcoef(VL vv,VL av,struct order_spec /* simplification, making polynomials monic */ setfield_dalg(alist); - obj_algtodalg(f,&f1); + obj_algtodalg((Obj)f,(Obj *)&f1); for ( t = BDY(f); t; t = NEXT(t) ) { initd(ord); ptod(vv,vv,(P)BDY(t),&d); hc = (DAlg)BDY(d)->c; if ( NID(hc) == N_DA ) { invdalg(hc,&inv); for ( m = BDY(d); m; m = NEXT(m) ) { - muldalg(inv,(DAlg)m->c,&da); m->c = (P)da; + muldalg(inv,(DAlg)m->c,&da); m->c = (Obj)da; } } - initd(ord); dtop(vv,vv,d,&poly); BDY(f) = (pointer)poly; + initd(ord); dtop(vv,vv,d,(Obj *)&poly); BDY(f) = (pointer)poly; } - obj_dalgtoalg(f1,&f); + obj_dalgtoalg((Obj)f1,(Obj *)&f); /* append alg vars to the var list */ for ( tv = vv; NEXT(tv); tv = NEXT(tv) ); @@ -2831,7 +3171,7 @@ void preprocess_algcoef(VL vv,VL av,struct order_spec } MKLIST(f1,t); *alistp = alist; - algobjtorat(f1,f1p); + algobjtorat((Obj)f1,(Obj *)f1p); /* creating a new weight vector */ prev_weight_vector_obj = obj0 = current_dl_weight_vector_obj; @@ -2852,7 +3192,8 @@ NODE postprocess_algcoef(VL av,NODE alist,NODE r) NODE s,t,u0,u; P p; VL tv; - Obj obj,tmp; + Obj obj; + VECT tmp; NODE arg; u0 = 0; @@ -2879,7 +3220,7 @@ void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int int e,max,nvar,i; NDV b; int ishomo,nalg,mrank,trank,wmax,len; - NMV a; + NMV a; Alg alpha,dp; P p,zp; Q dmy; @@ -2889,8 +3230,8 @@ void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int struct order_spec *ord1; NODE tr,tl1,tl2,tl3,tl4,nzlist; LIST l1,l2,l3,l4,l5; - int j; - Q jq,bpe; + int j; + Q jq,bpe,last_nonzero; int *perm; EPOS oepos; int obpe,oadv,ompos,cbpe; @@ -2906,6 +3247,8 @@ void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int ndv_alloc = 0; #endif get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc); + if ( m && nd_vc ) + error("nd_{gr,f4} : 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: @@ -2952,12 +3295,12 @@ void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int ishomo = 1; for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { if ( nd_module ) { - if ( !m && !nd_gentrace ) pltozpl((LIST)BDY(t),&dmy,&zpl); - else zpl = (LIST)BDY(t); + if ( !m && !nd_gentrace ) pltozpl((LIST)BDY(t),&dmy,&zpl); + else zpl = (LIST)BDY(t); b = (pointer)pltondv(CO,vv,zpl); } else { - if ( !m && !nd_gentrace ) ptozp((P)BDY(t),1,&dmy,&zp); - else zp = (P)BDY(t); + if ( !m && !nd_gentrace ) ptozp((P)BDY(t),1,&dmy,&zp); + else zp = (P)BDY(t); b = (pointer)ptondv(CO,vv,zp); } if ( ishomo ) @@ -2967,7 +3310,7 @@ void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int } if ( fd0 ) NEXT(fd) = 0; - if ( !ishomo && homo ) { + 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) ) @@ -2975,7 +3318,7 @@ void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int } homogenize_order(ord,nvar,&ord1); nd_init_ord(ord1); - nd_setup_parameters(nvar+1,wmax); + 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); } @@ -2984,34 +3327,39 @@ void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int if ( nd_gentrace ) { MKLIST(l1,nd_tracelist); MKNODE(nd_alltracelist,l1,0); } - if ( nd_splist ) { - *rp = compute_splist(); - return; - } - if ( nd_check_splist ) { - if ( check_splist(m,nd_check_splist) ) *rp = (LIST)ONE; - else *rp = 0; - return; - } - x = f4?nd_f4(m,&perm):nd_gb(m,ishomo || homo,0,0,&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); - } + if ( nd_splist ) { + *rp = compute_splist(); + return; + } + if ( nd_check_splist ) { + if ( f4 ) { + if ( check_splist_f4(m,nd_check_splist) ) *rp = (LIST)ONE; + else *rp = 0; + } else { + if ( check_splist(m,nd_check_splist) ) *rp = (LIST)ONE; + else *rp = 0; + } + return; + } + x = f4?nd_f4(m,0,&perm):nd_gb(m,ishomo || homo,0,0,&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; - if ( nd_module && nd_intersect ) { - for ( j = nd_psn-1, x = 0; j >= 0; j-- ) - if ( MPOS(DL(nd_psh[j])) > 1 ) { - MKNODE(xx,(pointer)j,x); x = xx; - } - conv_ilist(nd_demand,0,x,0); - goto FINAL; - } + if ( nd_module && nd_intersect ) { + for ( j = nd_psn-1, x = 0; j >= 0; j-- ) + if ( MPOS(DL(nd_psh[j])) > 1 ) { + MKNODE(xx,(pointer)j,x); x = xx; + } + conv_ilist(nd_demand,0,x,0); + goto FINAL; + } if ( nd_gentrace && f4 ) { nzlist = nd_alltracelist; } x = ndv_reducebase(x,perm); if ( nd_gentrace && !f4 ) { tl1 = nd_alltracelist; nd_alltracelist = 0; } @@ -3022,7 +3370,7 @@ void nd_gr(LIST f,LIST v,int m,int homo,int retdp,int ndv_check_membership(m,fd0,obpe,oadv,oepos,x); tl3 = nd_alltracelist; nd_alltracelist = 0; if ( nd_gensyz ) { - nd_gb(m,0,1,1,0); + nd_gb(m,0,1,1,0); tl4 = nd_alltracelist; nd_alltracelist = 0; } else tl4 = 0; } @@ -3033,16 +3381,18 @@ FINAL: NEXTNODE(r0,r); if ( nd_module ) 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)); + else BDY(r) = ndvtop(m,CO,vv,BDY(t)); } if ( r0 ) NEXT(r) = 0; if ( !m && nd_nalg ) r0 = postprocess_algcoef(av,alist,r0); MKLIST(*rp,r0); if ( nd_gentrace ) { - if ( f4 ) { + if ( f4 ) { STOQ(16,bpe); - tr = mknode(4,*rp,(!ishomo&&homo)?ONE:0,BDY(nzlist),bpe); MKLIST(*rp,tr); + STOQ(nd_last_nonzero,last_nonzero); + tr = mknode(5,*rp,(!ishomo&&homo)?ONE:0,BDY(nzlist),bpe,last_nonzero); MKLIST(*rp,tr); + } else { tl1 = reverse_node(tl1); tl2 = reverse_node(tl2); tl3 = reverse_node(tl3); @@ -3140,11 +3490,11 @@ void nd_gr_postproc(LIST f,LIST v,int m,struct order_s } } else { #if 0 - /* bug ? */ + /* bug ? */ for ( t = x; t; t = NEXT(t) ) BDY(t) = (pointer)nd_ps[(long)BDY(t)]; #else - conv_ilist(0,0,x,&perm); + conv_ilist(0,0,x,&perm); #endif } x = ndv_reducebase(x,perm); @@ -3164,50 +3514,58 @@ void nd_gr_recompute_trace(LIST f,LIST v,int m,struct NDV recompute_trace(NODE ti,NDV *p,int mod) { - int c,c1,c2,i; - NM mul,m,tail; - ND d,r,rm; - NODE sj; - NDV red; - Obj mj; - static int afo=0; + int c,c1,c2,i; + NM mul,m,tail; + ND d,r,rm; + NODE sj; + NDV red; + Obj mj; + static int afo=0; - afo++; - mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); - CM(mul) = 1; - tail = 0; - for ( i = 0, d = r = 0; ti; ti = NEXT(ti), i++ ) { - sj = BDY((LIST)BDY(ti)); - if ( ARG0(sj) ) { - red = p[QTOS((Q)ARG1(sj))]; - mj = (Obj)ARG2(sj); - if ( OID(mj) != O_DP ) ndl_zero(DL(mul)); - else dltondl(nd_nvar,BDY((DP)mj)->dl,DL(mul)); - rm = ndv_mul_nm(mod,mul,red); - if ( !r ) r = rm; - else { - for ( m = BDY(r); m && !ndl_equal(m->dl,BDY(rm)->dl); m = NEXT(m), LEN(r)-- ) { - if ( d ) { - NEXT(tail) = m; tail = m; LEN(d)++; - } else { - MKND(nd_nvar,m,1,d); tail = BDY(d); - } - } - if ( !m ) return 0; /* failure */ - else { - BDY(r) = m; - c1 = invm(HCM(rm),mod); c2 = mod-HCM(r); - DMAR(c1,c2,0,mod,c); - nd_mul_c(mod,rm,c); - r = nd_add(mod,r,rm); - } - } - } - } - if ( tail ) NEXT(tail) = 0; - d = nd_add(mod,d,r); - nd_mul_c(mod,d,invm(HCM(d),mod)); - return ndtondv(mod,d); + afo++; + mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); + CM(mul) = 1; + tail = 0; + for ( i = 0, d = r = 0; ti; ti = NEXT(ti), i++ ) { + sj = BDY((LIST)BDY(ti)); + if ( ARG0(sj) ) { + red = p[QTOS((Q)ARG1(sj))]; + mj = (Obj)ARG2(sj); + if ( OID(mj) != O_DP ) ndl_zero(DL(mul)); + else dltondl(nd_nvar,BDY((DP)mj)->dl,DL(mul)); + rm = ndv_mul_nm(mod,mul,red); + if ( !r ) r = rm; + else { + for ( m = BDY(r); m && !ndl_equal(m->dl,BDY(rm)->dl); m = NEXT(m), LEN(r)-- ) { + if ( d ) { + NEXT(tail) = m; tail = m; LEN(d)++; + } else { + MKND(nd_nvar,m,1,d); tail = BDY(d); + } + } + if ( !m ) return 0; /* failure */ + else { + BDY(r) = m; + if ( mod > 0 || mod == -1 ) { + c1 = invm(HCM(rm),mod); c2 = mod-HCM(r); + DMAR(c1,c2,0,mod,c); + nd_mul_c(mod,rm,c); + } else { + GZ t,u; + + chsgnlf(HCZ(r),&t); + divlf(t,HCZ(rm),&u); + nd_mul_c_lf(rm,u); + } + r = nd_add(mod,r,rm); + } + } + } + } + if ( tail ) NEXT(tail) = 0; + d = nd_add(mod,d,r); + nd_mul_c(mod,d,invm(HCM(d),mod)); + return ndtondv(mod,d); } void nd_gr_recompute_trace(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,LIST *rp) @@ -3224,9 +3582,9 @@ void nd_gr_recompute_trace(LIST f,LIST v,int m,struct Obj obj; NumberField nf; struct order_spec *ord1; - NODE permtrace,intred,ind,perm,trace,ti; - int len,n,j; - NDV *db,*pb; + NODE permtrace,intred,ind,perm,trace,ti; + int len,n,j; + NDV *db,*pb; parse_nd_option(current_option); get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc); @@ -3240,54 +3598,54 @@ void nd_gr_recompute_trace(LIST f,LIST v,int m,struct break; } nd_init_ord(ord); - nd_bpe = QTOS((Q)ARG7(BDY(tlist))); + nd_bpe = QTOS((Q)ARG7(BDY(tlist))); nd_setup_parameters(nvar,0); - len = length(BDY(f)); - db = (NDV *)MALLOC(len*sizeof(NDV *)); - for ( i = 0, t = BDY(f); t; i++, t = NEXT(t) ) { - ptozp((P)BDY(t),1,&dmy,&zp); - b = ptondv(CO,vv,zp); + len = length(BDY(f)); + db = (NDV *)MALLOC(len*sizeof(NDV *)); + for ( i = 0, t = BDY(f); t; i++, t = NEXT(t) ) { + ptozp((P)BDY(t),1,&dmy,&zp); + b = ptondv(CO,vv,zp); ndv_mod(m,b); - ndv_mul_c(m,b,invm(HCM(b),m)); - db[i] = b; + ndv_mul_c(m,b,invm(HCM(b),m)); + db[i] = b; } - permtrace = BDY((LIST)ARG2(BDY(tlist))); - intred = BDY((LIST)ARG3(BDY(tlist))); - ind = BDY((LIST)ARG4(BDY(tlist))); - perm = BDY((LIST)ARG0(permtrace)); - trace = NEXT(permtrace); + permtrace = BDY((LIST)ARG2(BDY(tlist))); + intred = BDY((LIST)ARG3(BDY(tlist))); + ind = BDY((LIST)ARG4(BDY(tlist))); + perm = BDY((LIST)ARG0(permtrace)); + trace = NEXT(permtrace); - for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) { - j = QTOS((Q)ARG0(BDY((LIST)BDY(t)))); - if ( j > i ) i = j; - } - n = i+1; - pb = (NDV *)MALLOC(n*sizeof(NDV *)); - for ( t = perm, i = 0; t; t = NEXT(t), i++ ) { - ti = BDY((LIST)BDY(t)); - pb[QTOS((Q)ARG0(ti))] = db[QTOS((Q)ARG1(ti))]; - } - for ( t = trace; t; t = NEXT(t) ) { - ti = BDY((LIST)BDY(t)); - pb[QTOS((Q)ARG0(ti))] = recompute_trace(BDY((LIST)ARG1(ti)),pb,m); - if ( !pb[QTOS((Q)ARG0(ti))] ) { *rp = 0; return; } - if ( DP_Print ) { - fprintf(asir_out,"."); fflush(asir_out); - } - } - for ( t = intred; t; t = NEXT(t) ) { - ti = BDY((LIST)BDY(t)); - pb[QTOS((Q)ARG0(ti))] = recompute_trace(BDY((LIST)ARG1(ti)),pb,m); - if ( !pb[QTOS((Q)ARG0(ti))] ) { *rp = 0; return; } - if ( DP_Print ) { - fprintf(asir_out,"*"); fflush(asir_out); - } - } + for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) { + j = QTOS((Q)ARG0(BDY((LIST)BDY(t)))); + if ( j > i ) i = j; + } + n = i+1; + pb = (NDV *)MALLOC(n*sizeof(NDV *)); + for ( t = perm, i = 0; t; t = NEXT(t), i++ ) { + ti = BDY((LIST)BDY(t)); + pb[QTOS((Q)ARG0(ti))] = db[QTOS((Q)ARG1(ti))]; + } + for ( t = trace; t; t = NEXT(t) ) { + ti = BDY((LIST)BDY(t)); + pb[QTOS((Q)ARG0(ti))] = recompute_trace(BDY((LIST)ARG1(ti)),pb,m); + if ( !pb[QTOS((Q)ARG0(ti))] ) { *rp = 0; return; } + if ( DP_Print ) { + fprintf(asir_out,"."); fflush(asir_out); + } + } + for ( t = intred; t; t = NEXT(t) ) { + ti = BDY((LIST)BDY(t)); + pb[QTOS((Q)ARG0(ti))] = recompute_trace(BDY((LIST)ARG1(ti)),pb,m); + if ( !pb[QTOS((Q)ARG0(ti))] ) { *rp = 0; return; } + if ( DP_Print ) { + fprintf(asir_out,"*"); fflush(asir_out); + } + } for ( r0 = 0, t = ind; t; t = NEXT(t) ) { NEXTNODE(r0,r); - b = pb[QTOS((Q)BDY(t))]; + b = pb[QTOS((Q)BDY(t))]; ndv_mul_c(m,b,invm(HCM(b),m)); #if 0 BDY(r) = ndvtop(m,CO,vv,pb[QTOS((Q)BDY(t))]); @@ -3325,7 +3683,15 @@ void nd_gr_trace(LIST f,LIST v,int trace,int homo,int Q jq,bpe; nd_module = 0; + nd_lf = 0; parse_nd_option(current_option); + if ( nd_lf ) { + if ( f4 ) + nd_f4_lf_trace(f,v,trace,homo,ord,rp); + else + error("nd_gr_trace is not implemented yet over a large finite field"); + return; + } if ( DP_Multiple ) nd_scale = ((double)DP_Multiple)/(double)(Denominator?Denominator:1); @@ -3386,12 +3752,12 @@ void nd_gr_trace(LIST f,LIST v,int trace,int homo,int ishomo = 1; for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { if ( nd_module ) { - if ( !nd_gentrace ) pltozpl((LIST)BDY(t),&dmy,&zpl); - else zpl = (LIST)BDY(t); + if ( !nd_gentrace ) pltozpl((LIST)BDY(t),&dmy,&zpl); + else zpl = (LIST)BDY(t); c = (pointer)pltondv(CO,vv,zpl); } else { - if ( !nd_gentrace ) ptozp((P)BDY(t),1,&dmy,&zp); - else zp = (P)BDY(t); + if ( !nd_gentrace ) ptozp((P)BDY(t),1,&dmy,&zp); + else zp = (P)BDY(t); c = (pointer)ptondv(CO,vv,zp); } if ( ishomo ) @@ -3415,8 +3781,9 @@ void nd_gr_trace(LIST f,LIST v,int trace,int homo,int for ( t = fd0; t; t = NEXT(t) ) ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos,ompos); } + if ( MaxDeg > 0 ) nocheck = 1; while ( 1 ) { - tl1 = tl2 = tl3 = tl4 = 0; + tl1 = tl2 = tl3 = tl4 = 0; if ( Demand ) nd_demand = 1; ret = ndv_setup(m,1,fd0,nd_gbblock?1:0,0); @@ -3448,15 +3815,18 @@ void nd_gr_trace(LIST f,LIST v,int trace,int homo,int break; if ( ret = ndv_check_membership(0,in0,obpe,oadv,oepos,cand) ) { if ( nd_gentrace ) { - tl3 = nd_alltracelist; nd_alltracelist = 0; - } else tl3 = 0; + tl3 = nd_alltracelist; nd_alltracelist = 0; + } else tl3 = 0; /* gbcheck : cand is a GB of Id(cand) ? */ - ret = nd_gb(0,0,1,nd_gensyz?1:0,0)!=0; + if ( nd_vc || nd_gentrace || nd_gensyz ) + ret = nd_gb(0,0,1,nd_gensyz?1:0,0)!=0; + else + ret = nd_f4(0,1,0)!=0; if ( nd_gentrace && nd_gensyz ) { - tl4 = nd_alltracelist; nd_alltracelist = 0; - } else tl4 = 0; - } - if ( ret ) break; + tl4 = nd_alltracelist; nd_alltracelist = 0; + } else tl4 = 0; + } + if ( ret ) break; else if ( trace > 1 ) { /* failure */ *rp = 0; return; @@ -3475,7 +3845,7 @@ 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); if ( DP_Print ) - fprintf(asir_out,"check=%fsec\n",eg_check.exectime+eg_check.gctime); + fprintf(asir_out,"check=%.3fsec,",eg_check.exectime+eg_check.gctime); /* dp->p */ nd_bpe = cbpe; nd_setup_parameters(nd_nvar,0); @@ -3488,23 +3858,23 @@ void nd_gr_trace(LIST f,LIST v,int trace,int homo,int MKLIST(*rp,cand); if ( nd_gentrace ) { tl1 = reverse_node(tl1); tl2 = reverse_node(tl2); - tl3 = reverse_node(tl3); - /* tl2 = [[i,[[*,j,*,*],...]],...] */ + tl3 = reverse_node(tl3); + /* tl2 = [[i,[[*,j,*,*],...]],...] */ for ( t = tl2; t; t = NEXT(t) ) { - /* s = [i,[*,j,*,*],...] */ + /* s = [i,[*,j,*,*],...] */ s = BDY((LIST)BDY(t)); j = perm[QTOS((Q)ARG0(s))]; STOQ(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); - ARG1(BDY((LIST)BDY(s))) = (pointer)jq; + ARG1(BDY((LIST)BDY(s))) = (pointer)jq; } - } - for ( j = length(cand)-1, t = 0; j >= 0; j-- ) { - STOQ(perm[j],jq); MKNODE(s,jq,t); t = s; - } + } + for ( j = length(cand)-1, t = 0; j >= 0; j-- ) { + STOQ(perm[j],jq); MKNODE(s,jq,t); t = s; + } MKLIST(l1,tl1); MKLIST(l2,tl2); MKLIST(l3,t); MKLIST(l4,tl3); - MKLIST(l5,tl4); - STOQ(nd_bpe,bpe); + MKLIST(l5,tl4); + STOQ(nd_bpe,bpe); tr = mknode(8,*rp,(!ishomo&&homo)?ONE:0,l1,l2,l3,l4,l5,bpe); MKLIST(*rp,tr); } } @@ -3564,7 +3934,7 @@ void nmtodp(int mod,NM m,DP *r) NEWMP(mr); mr->dl = ndltodl(nd_nvar,DL(m)); - mr->c = ndctop(mod,m->c); + mr->c = (Obj)ndctop(mod,m->c); NEXT(mr) = 0; MKDP(nd_nvar,mr,dp); dp->sugar = mr->dl->td; *r = dp; } @@ -3589,7 +3959,7 @@ void ndl_print(UINT *dl) for ( i = 0; i < n; i++ ) printf(i==n-1?"%d":"%d,",GET_EXP(dl,i)); } printf(">>"); - if ( MPOS(dl) ) + if ( nd_module && MPOS(dl) ) printf("*e%d",MPOS(dl)); } @@ -3644,10 +4014,14 @@ void nd_removecont(int mod,ND p) N q,r; if ( mod == -1 ) nd_mul_c(mod,p,_invsf(HCM(p))); - else if ( mod ) nd_mul_c(mod,p,invm(HCM(p),mod)); + else if ( mod == -2 ) { + GZ inv; + divlf(ONEGZ,HCZ(p),&inv); + nd_mul_c_lf(p,inv); + } else if ( mod ) nd_mul_c(mod,p,invm(HCM(p),mod)); else { for ( m = BDY(p), n = 0; m; m = NEXT(m), n++ ); - w = (Q *)ALLOCA(n*sizeof(Q)); + w = (Q *)MALLOC(n*sizeof(Q)); v.len = n; v.body = (pointer *)w; for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m); @@ -3668,7 +4042,7 @@ void nd_removecont2(ND p1,ND p2) n1 = nd_length(p1); n2 = nd_length(p2); n = n1+n2; - w = (Q *)ALLOCA(n*sizeof(Q)); + w = (Q *)MALLOC(n*sizeof(Q)); v.len = n; v.body = (pointer *)w; i = 0; @@ -3695,12 +4069,16 @@ void ndv_removecont(int mod,NDV p) if ( mod == -1 ) ndv_mul_c(mod,p,_invsf(HCM(p))); - else if ( mod ) + else if ( mod == -2 ) { + GZ inv; + divlf(ONEGZ,HCZ(p),&inv); + ndv_mul_c_lf(p,inv); + } else if ( mod ) ndv_mul_c(mod,p,invm(HCM(p),mod)); else { len = p->len; - w = (P *)ALLOCA(len*sizeof(P)); - c = (Q *)ALLOCA(len*sizeof(Q)); + w = (P *)MALLOC(len*sizeof(P)); + c = (Q *)MALLOC(len*sizeof(Q)); for ( m = BDY(p), all_p = 1, i = 0; i < len; NMV_ADV(m), i++ ) { ptozp(CP(m),1,&c[i],&w[i]); all_p = all_p && !NUM(w[i]); @@ -3734,7 +4112,7 @@ void ndv_homogenize(NDV p,int obpe,int oadv,EPOS oepos mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p); m = (NMV)((char *)mr0+(len-1)*oadv); mr = (NMV)((char *)mr0+(len-1)*nmv_adv); - t = (NMV)ALLOCA(nmv_adv); + t = (NMV)MALLOC(nmv_adv); for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) { ndl_homogenize(DL(m),DL(t),obpe,oepos,ompos,max); CQ(mr) = CQ(m); @@ -3782,8 +4160,8 @@ void nd_heu_nezgcdnpz(VL vl,P *pl,int m,int full,P *pr NODE l; P h,gcd,t; - tpl = (P *)ALLOCA(m*sizeof(P)); - tpl1 = (P *)ALLOCA(m*sizeof(P)); + tpl = (P *)MALLOC(m*sizeof(P)); + tpl1 = (P *)MALLOC(m*sizeof(P)); bcopy(pl,tpl,m*sizeof(P)); gcd = (P)ONE; for ( l = nd_hcf; l; l = NEXT(l) ) { @@ -3819,8 +4197,8 @@ void removecont_array(P *p,int n,int full) if ( all_q ) { removecont_array_q((Q *)p,n); } else { - c = (Q *)ALLOCA(n*sizeof(Q)); - w = (P *)ALLOCA(n*sizeof(P)); + c = (Q *)MALLOC(n*sizeof(Q)); + w = (P *)MALLOC(n*sizeof(P)); for ( i = 0; i < n; i++ ) { ptozp(p[i],1,&c[i],&w[i]); } @@ -3840,8 +4218,8 @@ void removecont_array_q(Q *c,int n) N qn,rn,gn; Q *q,*r; - q = (Q *)ALLOCA(n*sizeof(Q)); - r = (Q *)ALLOCA(n*sizeof(Q)); + q = (Q *)MALLOC(n*sizeof(Q)); + r = (Q *)MALLOC(n*sizeof(Q)); v.id = O_VECT; v.len = n; v.body = (pointer *)c; igcdv_estimate(&v,&d0); for ( i = 0; i < n; i++ ) { @@ -3883,6 +4261,18 @@ void nd_mul_c(int mod,ND p,int mul) } } +void nd_mul_c_lf(ND p,GZ mul) +{ + NM m; + GZ c; + + if ( !p ) return; + if ( UNIGZ(mul) ) return; + for ( m = BDY(p); m; m = NEXT(m) ) { + mullf(CZ(m),mul,&c); CZ(m) = c; + } +} + void nd_mul_c_q(ND p,P mul) { NM m; @@ -3947,8 +4337,8 @@ UINT *ndv_compute_bound(NDV p) if ( !p ) return 0; - d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT)); - d2 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT)); + d1 = (UINT *)MALLOC(nd_wpd*sizeof(UINT)); + d2 = (UINT *)MALLOC(nd_wpd*sizeof(UINT)); len = LEN(p); m = BDY(p); ndl_copy(DL(m),d1); NMV_ADV(m); for ( i = 1; i < len; i++, NMV_ADV(m) ) { @@ -3976,8 +4366,8 @@ UINT *nd_compute_bound(ND p) if ( !p ) return 0; - d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT)); - d2 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT)); + d1 = (UINT *)MALLOC(nd_wpd*sizeof(UINT)); + d2 = (UINT *)MALLOC(nd_wpd*sizeof(UINT)); len = LEN(p); m = BDY(p); ndl_copy(DL(m),d1); m = NEXT(m); for ( m = NEXT(m); m; m = NEXT(m) ) { @@ -4010,7 +4400,11 @@ int nd_get_exporigin(struct order_spec *ord) /* module d[0]:weight d[1]:w0,...,d[nd_exporigin-2]:w(n-1) */ return ord->ord.block.length+1+nd_module; case 3: case 259: +#if 0 error("nd_get_exporigin : composite order is not supported yet."); +#else + return 1+nd_module; +#endif } } @@ -4035,9 +4429,9 @@ void nd_setup_parameters(int nvar,int max) { } if ( !do_weyl && weight_check && (current_dl_weight_vector || nd_matrix) ) { UINT t; - int st; + int st; int *v; - /* t = max(weights) */ + /* t = max(weights) */ t = 0; if ( current_dl_weight_vector ) for ( i = 0, t = 0; i < nd_nvar; i++ ) { @@ -4049,7 +4443,7 @@ void nd_setup_parameters(int nvar,int max) { for ( j = 0, v = nd_matrix[i]; j < nd_nvar; j++ ) { if ( (st=v[j]) < 0 ) st = -st; if ( t < st ) t = st; - } + } /* i = bitsize of t */ for ( i = 0; t; t >>=1, i++ ); /* i += bitsize of nd_nvar */ @@ -4117,10 +4511,16 @@ ND_pairs nd_reconstruct(int trace,ND_pairs d) 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); + 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); + ndv_realloc(nd_ps_gz[i],obpe,oadv,oepos); + } if ( trace ) - for ( i = nd_psn-1; i >= 0; i-- ) + 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); + } s0 = 0; for ( t = d; t; t = NEXT(t) ) { NEXTND_pairs(s0,s); @@ -4130,7 +4530,7 @@ ND_pairs nd_reconstruct(int trace,ND_pairs d) ndl_reconstruct(LCM(t),LCM(s),obpe,oepos); } - old_red = (RHist *)ALLOCA(REDTAB_LEN*sizeof(RHist)); + 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; @@ -4247,8 +4647,10 @@ int nd_sp(int mod,int trace,ND_pairs p,ND *rp) if ( mod == -1 ) { CM(m1) = HCM(p2); CM(m2) = _chsgnsf(HCM(p1)); - } else if ( mod ) { + } else if ( mod > 0 ) { CM(m1) = HCM(p2); CM(m2) = mod-HCM(p1); + } else if ( mod == -2 ) { + CZ(m1) = HCZ(p2); chsgnlf(HCZ(p1),&CZ(m2)); } else if ( nd_vc ) { ezgcdpz(nd_vc,HCP(p1),HCP(p2),&gp); divsp(nd_vc,HCP(p2),gp,&CP(m1)); @@ -4286,6 +4688,19 @@ void ndv_mul_c(int mod,NDV p,int mul) } } +void ndv_mul_c_lf(NDV p,GZ mul) +{ + NMV m; + GZ c; + int len,i; + + if ( !p ) return; + len = LEN(p); + for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { + mullf(CZ(m),mul,&c); CZ(m) = c; + } +} + void ndv_mul_c_q(NDV p,Q mul) { NMV m; @@ -4312,8 +4727,8 @@ ND weyl_ndv_mul_nm(int mod,NM m0,NDV p) { d0 = DL(m0); l = LEN(p); for ( i = 0, tlen = 1; i < n2; i++ ) tlen *= (GET_EXP(d0,n2+i)+1); - tab = (NM *)ALLOCA(tlen*sizeof(NM)); - psum = (NM *)ALLOCA(tlen*sizeof(NM)); + tab = (NM *)MALLOC(tlen*sizeof(NM)); + psum = (NM *)MALLOC(tlen*sizeof(NM)); for ( i = 0; i < tlen; i++ ) psum[i] = 0; m1 = (NMV)(((char *)BDY(p))+nmv_adv*(l-1)); for ( i = l-1; i >= 0; i--, NMV_PREV(m1) ) { @@ -4360,7 +4775,7 @@ void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *ta c0 = CM(m0); c1 = CM(m1); DMAR(c0,c1,0,mod,c); CM(m) = c; } else if ( nd_vc ) mulp(nd_vc,CP(m0),CP(m1),&CP(m)); - else + else mulq(CQ(m0),CQ(m1),&CQ(m)); for ( i = 0; i < nd_wpd; i++ ) d[i] = 0; homo = n&1 ? 1 : 0; @@ -4391,10 +4806,10 @@ void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *ta } min = MIN(k,l); if ( mod ) { - ctab = (UINT *)ALLOCA((min+1)*sizeof(UINT)); + ctab = (UINT *)MALLOC((min+1)*sizeof(UINT)); mkwcm(k,l,mod,ctab); } else { - ctab_q = (Q *)ALLOCA((min+1)*sizeof(Q)); + ctab_q = (Q *)MALLOC((min+1)*sizeof(Q)); mkwc(k,l,ctab_q); } for ( j = min; j >= 0; j-- ) { @@ -4417,7 +4832,7 @@ void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *ta c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(tab[u]) = c1; } else if ( nd_vc ) mulp(nd_vc,CP(tab[u]),(P)q,&CP(tab[u])); - else { + else { mulq(CQ(tab[u]),q,&q1); CQ(tab[u]) = q1; } } @@ -4431,7 +4846,7 @@ void weyl_mul_nm_nmv(int n,int mod,NM m0,NMV m1,NM *ta c0 = CM(tab[u]); DMAR(c0,c,0,mod,c1); CM(t) = c1; } else if ( nd_vc ) mulp(nd_vc,CP(tab[u]),(P)q,&CP(t)); - else + else mulq(CQ(tab[u]),q,&CQ(t)); *p = t; } @@ -4492,7 +4907,7 @@ ND ndv_mul_nm(int mod,NM m0,NDV p) if ( !p ) return 0; else if ( do_weyl ) - if ( mod == -1 ) + if ( mod < 0 ) error("ndv_mul_nm : not implemented (weyl)"); else return weyl_ndv_mul_nm(mod,m0,p); @@ -4509,6 +4924,14 @@ ND ndv_mul_nm(int mod,NM m0,NDV p) CM(mr) = _mulsf(CM(m),c); ndl_add(DL(m),d,DL(mr)); } + } else if ( mod == -2 ) { + GZ cl; + cl = CZ(m0); + for ( i = 0; i < len; i++, NMV_ADV(m) ) { + NEXTNM(mr0,mr); + mullf(CZ(m),cl,&CZ(mr)); + ndl_add(DL(m),d,DL(mr)); + } } else if ( mod ) { c = CM(m0); for ( i = 0; i < len; i++, NMV_ADV(m) ) { @@ -4546,9 +4969,14 @@ ND nd_quo(int mod,PGeoBucket bucket,NDV d) else { nv = NV(d); mq0 = 0; - tm = (NMV)ALLOCA(nmv_adv); + tm = (NMV)MALLOC(nmv_adv); while ( 1 ) { - hindex = mod?head_pbucket(mod,bucket):head_pbucket_q(bucket); + 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 ) break; p = bucket->body[hindex]; NEXTNM(mq0,mq); @@ -4591,7 +5019,7 @@ void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos) mr0 = nmv_adv>oadv?(NMV)REALLOC(BDY(p),len*nmv_adv):BDY(p); m = (NMV)((char *)mr0+(len-1)*oadv); mr = (NMV)((char *)mr0+(len-1)*nmv_adv); - t = (NMV)ALLOCA(nmv_adv); + t = (NMV)MALLOC(nmv_adv); for ( i = 0; i < len; i++, NMV_OPREV(m), NMV_PREV(mr) ) { CQ(t) = CQ(m); for ( k = 0; k < nd_wpd; k++ ) DL(t)[k] = 0; @@ -4631,7 +5059,7 @@ NDV ndv_dup(int mod,NDV p) if ( !p ) return 0; len = LEN(p); - m0 = m = (NMV)(mod?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) ) { ndl_copy(DL(t),DL(m)); CQ(m) = CQ(t); @@ -4641,6 +5069,48 @@ NDV ndv_dup(int mod,NDV p) return d; } +NDV ndvtondvgz(NDV p) +{ + NDV r; + int len,i; + NMV t; + + r = ndv_dup(0,p); + len = LEN(p); + for ( t = BDY(r), i = 0; i < len; i++, NMV_ADV(t) ) CZ(t) = ztogz(CQ(t)); + return r; +} + +NDV ndvgztondv(NDV p) +{ + NDV r; + int len,i; + NMV t; + + r = ndv_dup(0,p); + len = LEN(p); + for ( t = BDY(r), i = 0; i < len; i++, NMV_ADV(t) ) CQ(t) = gztoz(CZ(t)); + return r; +} + +NDV ndv_symbolic(int mod,NDV p) +{ + NDV d; + NMV t,m,m0; + int i,len; + + if ( !p ) return 0; + len = LEN(p); + 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) ) { + ndl_copy(DL(t),DL(m)); + CQ(m) = ONE; + } + MKNDV(NV(p),m0,len,d); + SG(d) = SG(p); + return d; +} + ND nd_dup(ND p) { ND d; @@ -4658,6 +5128,28 @@ ND nd_dup(ND p) return d; } +ND ndtondgz(ND p) +{ + ND r; + NM t; + + r = nd_dup(p); + for ( t = BDY(r); t; t = NEXT(t) ) CZ(t) = ztogz(CQ(t)); + return r; +} + + +ND ndgztond(ND p) +{ + ND r; + NM t; + + r = nd_dup(p); + for ( t = BDY(r); t; t = NEXT(t) ) CQ(t) = gztoz(CZ(t)); + return r; +} + + /* XXX if p->len == 0 then it represents 0 */ void ndv_mod(int mod,NDV p) @@ -4675,12 +5167,24 @@ void ndv_mod(int mod,NDV p) if ( mod == -1 ) for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) { simp_ff((Obj)CP(t),&gfs); - r = FTOIF(CONT((GFS)gfs)); - CM(d) = r; - ndl_copy(DL(t),DL(d)); - NMV_ADV(d); - dlen++; + if ( gfs ) { + r = FTOIF(CONT((GFS)gfs)); + CM(d) = r; + ndl_copy(DL(t),DL(d)); + NMV_ADV(d); + dlen++; + } } + else if ( mod == -2 ) + for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) { + simp_ff((Obj)CP(t),&gfs); + if ( gfs ) { + lmtolf(gfs,&CZ(d)); + ndl_copy(DL(t),DL(d)); + NMV_ADV(d); + dlen++; + } + } else for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) { if ( nd_vc ) { @@ -4728,8 +5232,8 @@ void pltozpl(LIST l,Q *cont,LIST *pp) LIST r; nd = BDY(l); n = length(nd); - pl = (P *)ALLOCA(n*sizeof(P)); - cl = (Q *)ALLOCA(n*sizeof(P)); + pl = (P *)MALLOC(n*sizeof(P)); + cl = (Q *)MALLOC(n*sizeof(P)); for ( i = 0; i < n; i++, nd = NEXT(nd) ) ptozp((P)BDY(nd),1,&cl[i],&dmy); qltozl(cl,n,&dvr); @@ -4794,7 +5298,7 @@ ND ptond(VL vl,VL dvl,P p) return r; } else { for ( dc = DC(p), k = 0; dc; dc = NEXT(dc), k++ ); - w = (DCP *)ALLOCA(k*sizeof(DCP)); + w = (DCP *)MALLOC(k*sizeof(DCP)); for ( dc = DC(p), j = 0; j < k; dc = NEXT(dc), j++ ) w[j] = dc; for ( i = 0, tvl = dvl, v = VR(p); tvl && tvl->v != v; tvl = NEXT(tvl), i++ ); @@ -4842,8 +5346,10 @@ P ndvtop(int mod,VL vl,VL dvl,NDV p) m = (NMV)(((char *)BDY(p))+nmv_adv*(len-1)); for ( j = len-1, s = 0; j >= 0; j--, NMV_PREV(m) ) { if ( mod == -1 ) { - e = IFTOF(CM(m)); MKGFS(e,gfs); c = (P)gfs; - } else if ( mod ) { + e = IFTOF(CM(m)); MKGFS(e,gfs); c = (P)gfs; + } else if ( mod == -2 ) { + c = (P)gztoz(CZ(m)); + } else if ( mod > 0 ) { STOQ(CM(m),q); c = (P)q; } else c = CP(m); @@ -4874,7 +5380,7 @@ LIST ndvtopl(int mod,VL vl,VL dvl,NDV p,int rank) if ( !p ) return 0; else { - a = (P *)ALLOCA((rank+1)*sizeof(P)); + a = (P *)MALLOC((rank+1)*sizeof(P)); for ( i = 0; i <= rank; i++ ) a[i] = 0; len = LEN(p); n = NV(p); @@ -4911,7 +5417,7 @@ NDV ndtondv(int mod,ND p) if ( !p ) return 0; len = LEN(p); - if ( mod ) + if ( mod > 0 || mod == -1 ) m0 = m = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(len*nmv_adv); else m0 = m = MALLOC(len*nmv_adv); @@ -4951,7 +5457,7 @@ ND ndvtond(int mod,NDV p) DP ndvtodp(int mod,NDV p) { MP m,m0; - DP d; + DP d; NMV t; int i,len; @@ -4960,11 +5466,11 @@ DP ndvtodp(int mod,NDV p) len = p->len; for ( t = BDY(p), i = 0; i < len; NMV_ADV(t), i++ ) { NEXTMP(m0,m); - m->dl = ndltodl(nd_nvar,DL(t)); - m->c = ndctop(mod,t->c); + m->dl = ndltodl(nd_nvar,DL(t)); + m->c = (Obj)ndctop(mod,t->c); } NEXT(m) = 0; - MKDP(nd_nvar,m0,d); + MKDP(nd_nvar,m0,d); SG(d) = SG(p); return d; } @@ -4972,7 +5478,7 @@ DP ndvtodp(int mod,NDV p) DP ndtodp(int mod,ND p) { MP m,m0; - DP d; + DP d; NM t; int i,len; @@ -4981,11 +5487,11 @@ DP ndtodp(int mod,ND p) len = p->len; for ( t = BDY(p); t; t = NEXT(t) ) { NEXTMP(m0,m); - m->dl = ndltodl(nd_nvar,DL(t)); - m->c = ndctop(mod,t->c); + m->dl = ndltodl(nd_nvar,DL(t)); + m->c = (Obj)ndctop(mod,t->c); } NEXT(m) = 0; - MKDP(nd_nvar,m0,d); + MKDP(nd_nvar,m0,d); SG(d) = SG(p); return d; } @@ -5032,7 +5538,7 @@ NODE ndv_reducebase(NODE x,int *perm) NODE t,t0; len = length(x); - w = (NDVI)ALLOCA(len*sizeof(struct oNDVI)); + w = (NDVI)MALLOC(len*sizeof(struct oNDVI)); for ( i = 0, t = x; i < len; i++, t = NEXT(t) ) { w[i].p = BDY(t); w[i].i = perm[i]; } @@ -5057,9 +5563,18 @@ NODE ndv_reducebase(NODE x,int *perm) void nd_init_ord(struct order_spec *ord) { - nd_module = (ord->id >= 256); - nd_matrix = 0; - nd_matrix_len = 0; + nd_module = (ord->id >= 256); + if ( nd_module ) { + nd_dcomp = -1; + nd_ispot = ord->ispot; + nd_pot_nelim = ord->pot_nelim; + nd_poly_weight_len = ord->nv; + nd_poly_weight = ord->top_weight; + nd_module_rank = ord->module_rank; + nd_module_weight = ord->module_top_weight; + } + nd_matrix = 0; + nd_matrix_len = 0; switch ( ord->id ) { case 0: switch ( ord->ord.simple ) { @@ -5113,9 +5628,6 @@ void nd_init_ord(struct order_spec *ord) /* module order */ case 256: - nd_ispot = ord->ispot; - nd_pot_nelim = ord->pot_nelim; - nd_dcomp = -1; switch ( ord->ord.simple ) { case 0: nd_isrlex = 1; @@ -5135,17 +5647,11 @@ void nd_init_ord(struct order_spec *ord) break; case 257: /* block order */ - nd_ispot = ord->ispot; - nd_pot_nelim = ord->pot_nelim; - nd_dcomp = -1; nd_isrlex = 0; ndl_compare_function = ndl_module_block_compare; break; case 258: /* matrix order */ - nd_ispot = ord->ispot; - nd_pot_nelim = ord->pot_nelim; - nd_dcomp = -1; nd_isrlex = 0; nd_matrix_len = ord->ord.matrix.row; nd_matrix = ord->ord.matrix.matrix; @@ -5153,9 +5659,6 @@ void nd_init_ord(struct order_spec *ord) break; case 259: /* composite order */ - nd_ispot = ord->ispot; - nd_pot_nelim = ord->pot_nelim; - nd_dcomp = -1; nd_isrlex = 0; nd_worb_len = ord->ord.composite.length; nd_worb = ord->ord.composite.w_or_b; @@ -5267,13 +5770,13 @@ void nd_nf_p(Obj f,LIST g,LIST v,int m,struct order_sp /* max=65536 implies nd_bpe=32 */ max = 65536; - nd_module = 0; - /* nd_module will be set if ord is a module ordering */ + nd_module = 0; + /* nd_module will be set if ord is a module ordering */ nd_init_ord(ord); nd_setup_parameters(nvar,max); if ( nd_module && OID(f) != O_LIST ) error("nd_nf_p : the first argument must be a list"); - if ( nd_module ) mrank = length(BDY((LIST)f)); + if ( nd_module ) mrank = length(BDY((LIST)f)); /* conversion to ndv */ for ( in0 = 0, t = BDY(g); t; t = NEXT(t) ) { NEXTNODE(in0,in); @@ -5324,6 +5827,27 @@ int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r) 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,Q *r) { NM m; @@ -5340,6 +5864,60 @@ int nd_to_vect_q(UINT *s0,int n,ND d,Q *r) return i; } +int nd_to_vect_lf(UINT *s0,int n,ND d,mpz_t *r) +{ + NM m; + UINT *t,*s; + int i; + + for ( i = 0; i < n; i++ ) { mpz_init(r[i]); mpz_set_ui(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++ ); + mpz_set(r[i],BDY(CZ(m))); + } + for ( i = 0; !mpz_sgn(r[i]); i++ ); + return i; +} + +unsigned long *nd_to_vect_2(UINT *s0,int n,int *s0hash,ND p) +{ + NM m; + unsigned long *v; + int i,j,h,size; + UINT *s,*t; + + size = sizeof(unsigned long)*(n+BLEN-1)/BLEN; + v = (unsigned long *)MALLOC_ATOMIC_IGNORE_OFF_PAGE(size); + bzero(v,size); + for ( i = j = 0, s = s0, m = BDY(p); m; j++, m = NEXT(m) ) { + t = DL(m); + h = ndl_hash_value(t); + for ( ; h != s0hash[i] || !ndl_equal(t,s); s += nd_wpd, i++ ); + v[i/BLEN] |= 1L <<(i%BLEN); + } + return v; +} + +int nd_nm_to_vect_2(UINT *s0,int n,int *s0hash,NDV p,NM m,unsigned long *v) +{ + NMV mr; + UINT *d,*t,*s; + int i,j,len,h,head; + + d = DL(m); + len = LEN(p); + t = (UINT *)MALLOC(nd_wpd*sizeof(UINT)); + for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) { + ndl_add(d,DL(mr),t); + h = ndl_hash_value(t); + for ( ; h != s0hash[i] || !ndl_equal(t,s); s += nd_wpd, i++ ); + if ( j == 0 ) head = i; + v[i/BLEN] |= 1L <<(i%BLEN); + } + return head; +} + Q *nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_pair pair) { NM m; @@ -5354,7 +5932,7 @@ Q *nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_p p = nd_ps[pair->index]; len = LEN(p); r = (Q *)CALLOC(n,sizeof(Q)); - t = (UINT *)ALLOCA(nd_wpd*sizeof(UINT)); + t = (UINT *)MALLOC(nd_wpd*sizeof(UINT)); for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) { ndl_add(d,DL(mr),t); for ( ; !ndl_equal(t,s); s += nd_wpd, i++ ); @@ -5363,7 +5941,7 @@ Q *nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_p return r; } -IndArray nm_ind_pair_to_vect_compress(int mod,UINT *s0,int n,int *s0hash,NM_ind_pair pair) +IndArray nm_ind_pair_to_vect_compress(int trace,UINT *s0,int n,int *s0hash,NM_ind_pair pair) { NM m; NMV mr; @@ -5378,14 +5956,18 @@ struct oEGT eg0,eg1; m = pair->mul; d = DL(m); - p = nd_ps[pair->index]; + if ( trace ) + p = nd_demand?nd_ps_trace_sym[pair->index]:nd_ps_trace[pair->index]; + else + p = nd_demand?nd_ps_sym[pair->index]:nd_ps[pair->index]; + len = LEN(p); - t = (UINT *)ALLOCA(nd_wpd*sizeof(UINT)); - v = (unsigned int *)ALLOCA(len*sizeof(unsigned int)); + t = (UINT *)MALLOC(nd_wpd*sizeof(UINT)); + v = (unsigned int *)MALLOC(len*sizeof(unsigned int)); get_eg(&eg0); for ( i = j = 0, s = s0, mr = BDY(p); j < len; j++, NMV_ADV(mr) ) { ndl_add(d,DL(mr),t); - h = ndl_hash_value(t); + h = ndl_hash_value(t); for ( ; h != s0hash[i] || !ndl_equal(t,s); s += nd_wpd, i++ ); v[j] = i; } @@ -5451,13 +6033,14 @@ int ndv_reduce_vect_q(Q *svect,int trace,int col,IndAr for ( i = 0; i < col && !svect[i]; i++ ); if ( i == col ) return maxrs; hmag = p_mag((P)svect[i])*nd_scale; - cvect = (Q *)ALLOCA(col*sizeof(Q)); + cvect = (Q *)MALLOC(col*sizeof(Q)); for ( i = 0; i < nred; i++ ) { ivect = imat[i]; k = ivect->head; if ( svect[k] ) { maxrs = MAX(maxrs,rp0[i]->sugar); - redv = trace?nd_ps_trace[rp0[i]->index]:nd_ps[rp0[i]->index]; + redv = nd_demand?ndv_load(rp0[i]->index) + :(trace?nd_ps_trace[rp0[i]->index]:nd_ps[rp0[i]->index]); len = LEN(redv); mr = BDY(redv); igcd_cofactor(svect[k],CQ(mr),&gcd,&cs,&cr); chsgnq(cs,&mcs); @@ -5509,6 +6092,87 @@ int ndv_reduce_vect_q(Q *svect,int trace,int col,IndAr return maxrs; } +int ndv_reduce_vect_gz(GZ *gvect,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred) +{ + int i,j,k,l,len,pos,prev,nz; + GZ cs,mcs,c1,c2,cr,gcd,t; + IndArray ivect; + unsigned char *ivc; + unsigned short *ivs; + unsigned int *ivi; + NDV redv; + NMV mr; + NODE rp; + int maxrs; + double hmag; + struct oVECT v; + + maxrs = 0; + for ( i = 0; i < col && !gvect[i]; i++ ); + if ( i == col ) return maxrs; + hmag = (double)n_bits_gz(gvect[i])*nd_scale; + for ( i = 0; i < nred; i++ ) { + ivect = imat[i]; + k = ivect->head; + if ( gvect[k] ) { + maxrs = MAX(maxrs,rp0[i]->sugar); + redv = nd_ps_gz[rp0[i]->index]; + len = LEN(redv); mr = BDY(redv); + gcdgz(gvect[k],CZ(mr),&gcd); + divsgz(gvect[k],gcd,&cs); + divsgz(CZ(mr),gcd,&cr); + chsgngz(cs,&mcs); + if ( !UNIGZ(cr) ) { + for ( j = 0; j < col; j++ ) { + mulgz(gvect[j],cr,&c1); gvect[j] = c1; + } + } + gvect[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]; prev = pos; + mulgz(CZ(mr),mcs,&c2); addgz(gvect[pos],c2,&t); gvect[pos] = t; + } + break; + case 2: + ivs = ivect->index.s; + for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { + pos = prev+ivs[j]; prev = pos; + mulgz(CZ(mr),mcs,&c2); addgz(gvect[pos],c2,&t); gvect[pos] = t; + } + break; + case 4: + ivi = ivect->index.i; + for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { + pos = prev+ivi[j]; prev = pos; + mulgz(CZ(mr),mcs,&c2); addgz(gvect[pos],c2,&t); gvect[pos] = t; + } + break; + } + for ( j = k+1; j < col && !gvect[j]; j++ ); + if ( j == col ) break; + if ( hmag && ((double)n_bits_gz(gvect[j]) > hmag) ) { + v.len = col; v.body = (pointer)gvect; gcdvgz(&v,&gcd); +#if 1 + for ( l = 0; l < col; l++ ) { divsgz(gvect[l],gcd,&t); gvect[l] = t; } +#endif + hmag = (double)n_bits_gz(gvect[j])*nd_scale; + } + } + } + for ( j = 0; j < col && !gvect[j]; j++ ); + if ( j < col ) { + v.len = col; v.body = (pointer)gvect; gcdvgz(&v,&gcd); + for ( l = 0; l < col; l++ ) { divsgz(gvect[l],gcd,&t); gvect[l] = t; } + } + if ( DP_Print ) { + fprintf(asir_out,"-"); fflush(asir_out); + } + return maxrs; +} + int ndv_reduce_vect(int m,UINT *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred) { int i,j,k,len,pos,prev; @@ -5535,31 +6199,39 @@ int ndv_reduce_vect(int m,UINT *svect,int col,IndArray 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); c2 = svect[pos]; - prev = pos; - DMA(c1,c,c2,up,lo); - if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3; - } else svect[pos] = lo; + pos = prev+ivc[j]; c1 = CM(mr); prev = pos; + if ( c1 ) { + c2 = svect[pos]; + DMA(c1,c,c2,up,lo); + if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3; + } else svect[pos] = lo; + } } 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); c2 = svect[pos]; + pos = prev+ivs[j]; c1 = CM(mr); prev = pos; - DMA(c1,c,c2,up,lo); - if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3; - } else svect[pos] = lo; + if ( c1 ) { + c2 = svect[pos]; + DMA(c1,c,c2,up,lo); + if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3; + } else svect[pos] = lo; + } } 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); c2 = svect[pos]; + pos = prev+ivi[j]; c1 = CM(mr); prev = pos; - DMA(c1,c,c2,up,lo); - if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3; - } else svect[pos] = lo; + if ( c1 ) { + c2 = svect[pos]; + DMA(c1,c,c2,up,lo); + if ( up ) { DSAB(m,up,lo,dmy,c3); svect[pos] = c3; + } else svect[pos] = lo; + } } break; } @@ -5570,6 +6242,78 @@ int ndv_reduce_vect(int m,UINT *svect,int col,IndArray 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] ) { + 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 i,j,k,len,pos,prev; @@ -5586,7 +6330,7 @@ int ndv_reduce_vect_sf(int m,UINT *svect,int col,IndAr maxrs = 0; for ( i = 0; i < nred; i++ ) { ivect = imat[i]; - k = ivect->head; svect[k] %= m; + k = ivect->head; if ( c = svect[k] ) { maxrs = MAX(maxrs,rp0[i]->sugar); c = _chsgnsf(c); redv = nd_ps[rp0[i]->index]; @@ -5620,6 +6364,185 @@ int ndv_reduce_vect_sf(int m,UINT *svect,int col,IndAr return maxrs; } +ND nd_add_lf(ND p1,ND p2) +{ + int n,c,can; + ND r; + NM m1,m2,mr0,mr,s; + GZ t; + + if ( !p1 ) return p2; + else if ( !p2 ) return p1; + else { + can = 0; + for ( n = NV(p1), m1 = BDY(p1), m2 = BDY(p2), mr0 = 0; m1 && m2; ) { + c = DL_COMPARE(DL(m1),DL(m2)); + switch ( c ) { + case 0: + addlf(CZ(m1),CZ(m2),&t); + s = m1; m1 = NEXT(m1); + if ( t ) { + can++; NEXTNM2(mr0,mr,s); CZ(mr) = (t); + } else { + can += 2; FREENM(s); + } + s = m2; m2 = NEXT(m2); FREENM(s); + break; + case 1: + s = m1; m1 = NEXT(m1); NEXTNM2(mr0,mr,s); + break; + case -1: + s = m2; m2 = NEXT(m2); NEXTNM2(mr0,mr,s); + break; + } + } + if ( !mr0 ) + if ( m1 ) mr0 = m1; + else if ( m2 ) mr0 = m2; + else return 0; + else if ( m1 ) NEXT(mr) = m1; + else if ( m2 ) NEXT(mr) = m2; + else NEXT(mr) = 0; + BDY(p1) = mr0; + SG(p1) = MAX(SG(p1),SG(p2)); + LEN(p1) = LEN(p1)+LEN(p2)-can; + FREEND(p2); + return p1; + } +} + +int ndv_reduce_vect_lf(mpz_t *svect,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred) +{ + int i,j,k,len,pos,prev; + mpz_t c,mc,c1; + IndArray ivect; + unsigned char *ivc; + unsigned short *ivs; + unsigned int *ivi; + NDV redv; + NMV mr; + NODE rp; + int maxrs; + + maxrs = 0; + lf_lazy = 1; + for ( i = 0; i < nred; i++ ) { + ivect = imat[i]; + k = ivect->head; + mpz_mod(svect[k],svect[k],BDY(current_mod_lf)); + if ( mpz_sgn(svect[k]) ) { + maxrs = MAX(maxrs,rp0[i]->sugar); + mpz_neg(svect[k],svect[k]); + redv = trace?nd_ps_trace[rp0[i]->index]:nd_ps[rp0[i]->index]; + len = LEN(redv); mr = BDY(redv); + 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]; prev = pos; + mpz_addmul(svect[pos],svect[k],BDY(CZ(mr))); + } + break; + case 2: + ivs = ivect->index.s; + for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { + pos = prev+ivs[j]; prev = pos; + mpz_addmul(svect[pos],svect[k],BDY(CZ(mr))); + } + break; + case 4: + ivi = ivect->index.i; + for ( j = 1, NMV_ADV(mr); j < len; j++, NMV_ADV(mr) ) { + pos = prev+ivi[j]; prev = pos; + mpz_addmul(svect[pos],svect[k],BDY(CZ(mr))); + } + break; + } + mpz_set_ui(svect[k],0); + } + } + lf_lazy=0; + for ( i = 0; i < col; i++ ) { + mpz_mod(svect[i],svect[i],BDY(current_mod_lf)); + } + return maxrs; +} + +int nd_gauss_elim_lf(mpz_t **mat0,int *sugar,int row,int col,int *colstat) +{ + int i,j,k,l,rank,s; + mpz_t a,a1,inv; + mpz_t *t,*pivot,*pk; + mpz_t **mat; + struct oEGT eg0,eg1,eg_forward,eg_mod,eg_back; + int size,size1; + + mpz_init(inv); + mpz_init(a); + mat = (mpz_t **)mat0; + size = 0; + for ( rank = 0, j = 0; j < col; j++ ) { + for ( i = rank; i < row; i++ ) { + mpz_mod(mat[i][j],mat[i][j],BDY(current_mod_lf)); + } + for ( i = rank; i < row; i++ ) + if ( mpz_sgn(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; + s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s; + } + pivot = mat[rank]; + s = sugar[rank]; + mpz_invert(inv,pivot[j],BDY(current_mod_lf)); + for ( k = j, pk = pivot+k; k < col; k++, pk++ ) + if ( mpz_sgn(*pk) ) { + mpz_mul(a,*pk,inv); mpz_mod(*pk,a,BDY(current_mod_lf)); + } + for ( i = rank+1; i < row; i++ ) { + t = mat[i]; + if ( mpz_sgn(t[j]) ) { + sugar[i] = MAX(sugar[i],s); + mpz_neg(a,t[j]); + red_by_vect_lf(t+j,pivot+j,a,col-j); + } + } + rank++; + } + for ( j = col-1, l = rank-1; j >= 0; j-- ) + if ( colstat[j] ) { + pivot = mat[l]; + s = sugar[l]; + for ( k = j; k < col; k++ ) + mpz_mod(pivot[k],pivot[k],BDY(current_mod_lf)); + for ( i = 0; i < l; i++ ) { + t = mat[i]; + if ( mpz_sgn(t[j]) ) { + sugar[i] = MAX(sugar[i],s); + mpz_neg(a,t[j]); + red_by_vect_lf(t+j,pivot+j,a,col-j); + } + } + l--; + } + for ( j = 0, l = 0; l < rank; j++ ) + if ( colstat[j] ) { + t = mat[l]; + for ( k = j; k < col; k++ ) { + mpz_mod(t[k],t[k],BDY(current_mod_lf)); + } + l++; + } + return rank; +} + + NDV vect_to_ndv(UINT *vect,int spcol,int col,int *rhead,UINT *s0vect) { int j,k,len; @@ -5648,6 +6571,58 @@ 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++] ) { + 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) +{ + int j,k,len; + UINT *p; + NDV r; + NMV mr0,mr; + + for ( j = 0, len = 0; j < col; j++ ) if ( vect[j/BLEN] & (1L<<(j%BLEN)) ) len++; + if ( !len ) return 0; + else { + mr0 = (NMV)MALLOC_ATOMIC_IGNORE_OFF_PAGE(nmv_adv*len); + mr = mr0; + p = s0vect; + for ( j = 0; j < col; j++, p += nd_wpd ) + if ( vect[j/BLEN] & (1L<<(j%BLEN)) ) { + ndl_copy(p,DL(mr)); CM(mr) = 1; NMV_ADV(mr); + } + MKNDV(nd_nvar,mr0,len,r); + return r; + } +} + /* for preprocessed vector */ NDV vect_to_ndv_q(Q *vect,int spcol,int col,int *rhead,UINT *s0vect) @@ -5680,6 +6655,63 @@ NDV vect_to_ndv_q(Q *vect,int spcol,int col,int *rhead } } +NDV vect_to_ndv_gz(GZ *vect,int spcol,int col,int *rhead,UINT *s0vect) +{ + int j,k,len; + UINT *p; + GZ 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(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 = vect[k++] ) { + ndl_copy(p,DL(mr)); CZ(mr) = c; NMV_ADV(mr); + } + } + MKNDV(nd_nvar,mr0,len,r); + return r; + } +} + +NDV vect_to_ndv_lf(mpz_t *vect,int spcol,int col,int *rhead,UINT *s0vect) +{ + int j,k,len; + UINT *p; + mpz_t c; + NDV r; + NMV mr0,mr; + + for ( j = 0, len = 0; j < spcol; j++ ) if ( mpz_sgn(vect[j]) ) len++; + if ( !len ) return 0; + else { + mr0 = (NMV)MALLOC(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] ) { + c[0] = vect[k++][0]; + if ( mpz_sgn(c) ) { + ndl_copy(p,DL(mr)); MPZTOGZ(c,CZ(mr)); NMV_ADV(mr); + } + } + MKNDV(nd_nvar,mr0,len,r); + return r; + } +} + /* for plain vector */ NDV plain_vect_to_ndv_q(Q *vect,int col,UINT *s0vect) @@ -5737,9 +6769,13 @@ int nd_symbolic_preproc(PGeoBucket bucket,int trace,UI NM_ind_pair pair; ND red; NDV *ps; + static int afo; s0 = 0; rp0 = 0; col = 0; - ps = trace?nd_ps_trace:nd_ps; + 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; @@ -5751,7 +6787,8 @@ int nd_symbolic_preproc(PGeoBucket bucket,int trace,UI h = nd_psh[index]; NEWNM(mul); ndl_sub(DL(head),DL(h),DL(mul)); - if ( ndl_check_bound2(index,DL(mul)) ) return 0; + if ( ndl_check_bound2(index,DL(mul)) ) + return 0; sugar = TD(DL(mul))+SG(ps[index]); MKNM_ind_pair(pair,mul,index,sugar); red = ndv_mul_nm_symbolic(mul,ps[index]); @@ -5770,16 +6807,25 @@ int nd_symbolic_preproc(PGeoBucket bucket,int trace,UI return col; } -NODE nd_f4(int m,int **indp) +void print_ndp(ND_pairs l) { - int i,nh,stat,index; + ND_pairs t; + + for ( t = l; t; t = NEXT(t) ) + printf("[%d,%d] ",t->i1,t->i2); + printf("\n"); +} + +NODE nd_f4(int m,int checkonly,int **indp) +{ + int i,nh,stat,index,f4red; NODE r,g,tn0,tn,node; - ND_pairs d,l,t,ll0,ll; - LIST l0,l1; + ND_pairs d,l,t,ll0,ll,lh; + LIST l0,l1; ND spol,red; NDV nf,redv; NM s0,s; - NODE rp0,srp0,nflist,nzlist; + NODE rp0,srp0,nflist,nzlist,nzlist_t; int nsp,nred,col,rank,len,k,j,a,i1s,i2s; UINT c; UINT **spmat; @@ -5788,7 +6834,7 @@ NODE nd_f4(int m,int **indp) IndArray *imat; int *rhead; int spcol,sprow; - int sugar; + int sugar,sugarh; PGeoBucket bucket; struct oEGT eg0,eg1,eg_f4; Q i1,i2,sugarq; @@ -5800,31 +6846,25 @@ NODE nd_f4(int m,int **indp) d = update_pairs(d,g,i,0); g = update_base(g,i); } - nzlist = 0; + nzlist = 0; + nzlist_t = nd_nzlist; + f4red = 1; + nd_last_nonzero = 0; while ( d ) { get_eg(&eg0); l = nd_minsugarp(d,&d); - sugar = SG(l); - if ( nd_nzlist ) { - for ( tn = nd_nzlist; tn; tn = NEXT(tn) ) { - node = BDY((LIST)BDY(tn)); - if ( QTOS((Q)ARG0(node)) == sugar ) break; + sugar = nd_sugarweight?l->sugar2:SG(l); + if ( MaxDeg > 0 && sugar > MaxDeg ) break; + if ( nzlist_t ) { + node = BDY((LIST)BDY(nzlist_t)); + sugarh = QTOS((Q)ARG0(node)); + tn = BDY((LIST)ARG1(node)); + if ( !tn ) { + nzlist_t = NEXT(nzlist_t); + continue; } - if ( !tn ) error("nd_f4 : inconsistent non-zero list"); - for ( t = l, ll0 = 0; t; t = NEXT(t) ) { - for ( tn = BDY((LIST)ARG1(node)); tn; tn = NEXT(tn) ) { - i1s = QTOS((Q)ARG0(BDY((LIST)BDY(tn)))); - i2s = QTOS((Q)ARG1(BDY((LIST)BDY(tn)))); - if ( t->i1 == i1s && t->i2 == i2s ) break; - } - if ( tn ) { - if ( !ll0 ) ll0 = t; - else NEXT(ll) = t; - ll = t; - } - } - if ( ll0 ) NEXT(ll) = 0; - l = ll0; + /* tn = [[i1,i2],...] */ + lh = nd_ipairtospair(tn); } bucket = create_pbucket(); stat = nd_sp_f4(m,0,l,bucket); @@ -5844,10 +6884,12 @@ NODE nd_f4(int m,int **indp) } get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1); if ( DP_Print ) - fprintf(asir_out,"sugar=%d,symb=%fsec,", + fprintf(asir_out,"sugar=%d,symb=%.3fsec,", sugar,eg_f4.exectime+eg_f4.gctime); - nflist = nd_f4_red(m,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; /* adding new bases */ + if ( nflist ) nd_last_nonzero = f4red; for ( r = nflist; r; r = NEXT(r) ) { nf = (NDV)BDY(r); ndv_removecont(m,nf); @@ -5859,30 +6901,37 @@ NODE nd_f4(int m,int **indp) nd_removecont(m,nf1); nf = ndtondv(m,nf1); } - nh = ndv_newps(m,nf,0); + nh = ndv_newps(m,nf,0,1); d = update_pairs(d,g,nh,0); g = update_base(g,nh); } + if ( DP_Print ) { + fprintf(asir_out,"f4red=%d,gblen=%d\n",f4red,length(g)); fflush(asir_out); + } if ( nd_gentrace ) { - for ( t = ll, tn0 = 0; t; t = NEXT(t) ) { - NEXTNODE(tn0,tn); + for ( t = ll, tn0 = 0; t; t = NEXT(t) ) { + NEXTNODE(tn0,tn); STOQ(t->i1,i1); STOQ(t->i2,i2); node = mknode(2,i1,i2); MKLIST(l0,node); - BDY(tn) = l0; - } - if ( tn0 ) NEXT(tn) = 0; MKLIST(l0,tn0); + BDY(tn) = l0; + } + if ( tn0 ) NEXT(tn) = 0; MKLIST(l0,tn0); STOQ(sugar,sugarq); node = mknode(2,sugarq,l0); MKLIST(l1,node); MKNODE(node,l1,nzlist); nzlist = node; } + if ( nd_nzlist ) nzlist_t = NEXT(nzlist_t); + f4red++; + if ( nd_f4red && f4red > nd_f4red ) break; + if ( nd_rank0 && !nflist ) break; } if ( nd_gentrace ) { - MKLIST(l0,reverse_node(nzlist)); + MKLIST(l0,reverse_node(nzlist)); MKNODE(nd_alltracelist,l0,0); } #if 0 fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc); #endif - conv_ilist(0,0,g,indp); + conv_ilist(nd_demand,0,g,indp); return g; } @@ -5916,6 +6965,7 @@ NODE nd_f4_trace(int m,int **indp) get_eg(&eg0); l = nd_minsugarp(d,&d); sugar = SG(l); + if ( MaxDeg > 0 && sugar > MaxDeg ) break; bucket = create_pbucket(); stat = nd_sp_f4(m,0,l,bucket); if ( !stat ) { @@ -5934,7 +6984,7 @@ NODE nd_f4_trace(int m,int **indp) } get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1); if ( DP_Print ) - fprintf(asir_out,"sugar=%d,symb=%fsec,", + fprintf(asir_out,"sugar=%d,symb=%.3fsec,", sugar,eg_f4.exectime+eg_f4.gctime); nflist = nd_f4_red(m,l,0,s0vect,col,rp0,&l0); if ( !l0 ) continue; @@ -5974,7 +7024,7 @@ NODE nd_f4_trace(int m,int **indp) nfv = ndv_dup(0,nfqv); ndv_mod(m,nfv); ndv_removecont(m,nfv); - nh = ndv_newps(0,nfv,nfqv); + nh = ndv_newps(0,nfv,nfqv,1); d = update_pairs(d,g,nh,0); g = update_base(g,nh); } @@ -5982,113 +7032,180 @@ NODE nd_f4_trace(int m,int **indp) #if 0 fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc); #endif - conv_ilist(0,1,g,indp); + conv_ilist(nd_demand,1,g,indp); return g; } -NODE nd_f4_pseudo_trace(int m,int **indp) +int rref(matrix mat,int *sugar) { - int i,nh,stat,index; - NODE r,g; - ND_pairs d,l,l0,t; - ND spol,red; - NDV nf,redv,nfqv,nfv; - NM s0,s; - NODE rp0,srp0,nflist; - int nsp,nred,col,rank,len,k,j,a; - UINT c; - UINT **spmat; - UINT *s0vect,*svect,*p,*v; - int *colstat; - IndArray *imat; - int *rhead; - int spcol,sprow; - int sugar; - PGeoBucket bucket; - struct oEGT eg0,eg1,eg_f4; + int row,col,i,j,k,l,s,wcol,wj; + unsigned long bj; + unsigned long **a; + unsigned long *ai,*ak,*as,*t; + int *pivot; - g = 0; d = 0; - for ( i = 0; i < nd_psn; i++ ) { - d = update_pairs(d,g,i,0); - g = update_base(g,i); + row = mat->row; + col = mat->col; + a = mat->a; + wcol = (col+BLEN-1)/BLEN; + pivot = (int *)MALLOC_ATOMIC(row*sizeof(int)); + i = 0; + for ( j = 0; j < col; j++ ) { + wj = j/BLEN; bj = 1L<<(j%BLEN); + for ( k = i; k < row; k++ ) + if ( a[k][wj] & bj ) break; + if ( k == row ) continue; + pivot[i] = j; + if ( k != i ) { + t = a[i]; a[i] = a[k]; a[k] = t; + s = sugar[i]; sugar[i] = sugar[k]; sugar[k] = s; + } + ai = a[i]; + for ( k = i+1; k < row; k++ ) { + ak = a[k]; + if ( ak[wj] & bj ) { + for ( l = wj; l < wcol; l++ ) + ak[l] ^= ai[l]; + sugar[k] = MAX(sugar[k],sugar[i]); } - while ( d ) { - get_eg(&eg0); - l = nd_minsugarp(d,&d); - sugar = SG(l); - 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(1,d); - continue; - } - if ( bucket->m < 0 ) continue; - col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0); - if ( !col ) { - for ( t = l; NEXT(t); t = NEXT(t) ); - NEXT(t) = d; d = l; - d = nd_reconstruct(1,d); - continue; - } - get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1); - if ( DP_Print ) - fprintf(asir_out,"sugar=%d,symb=%fsec,", - sugar,eg_f4.exectime+eg_f4.gctime); - nflist = nd_f4_red(m,l,0,s0vect,col,rp0,&l0); - if ( !l0 ) continue; - l = l0; + } + i++; + } + for ( k = i-1; k >= 0; k-- ) { + j = pivot[k]; wj = j/BLEN; bj = 1L<<(j%BLEN); + ak = a[k]; + for ( s = 0; s < k; s++ ) { + as = a[s]; + if ( as[wj] & bj ) { + for ( l = wj; l < wcol; l++ ) + as[l] ^= ak[l]; + sugar[s] = MAX(sugar[s],sugar[k]); + } + } + } + return i; +} - /* over Q */ - while ( 1 ) { - bucket = create_pbucket(); - stat = nd_sp_f4(0,1,l,bucket); - if ( !stat ) { - for ( t = l; NEXT(t); t = NEXT(t) ); - NEXT(t) = d; d = l; - d = nd_reconstruct(1,d); - continue; - } - if ( bucket->m < 0 ) continue; - col = nd_symbolic_preproc(bucket,1,&s0vect,&rp0); - if ( !col ) { - for ( t = l; NEXT(t); t = NEXT(t) ); - NEXT(t) = d; d = l; - d = nd_reconstruct(1,d); - continue; - } - nflist = nd_f4_red(0,l,1,s0vect,col,rp0,0); - } +void print_matrix(matrix mat) +{ + int row,col,i,j; + unsigned long *ai; - /* adding new bases */ - for ( r = nflist; r; r = NEXT(r) ) { - nfqv = (NDV)BDY(r); - ndv_removecont(0,nfqv); - if ( !rem(NM(HCQ(nfqv)),m) ) return 0; - if ( nd_nalg ) { - ND nf1; + row = mat->row; + col = mat->col; + printf("%d x %d\n",row,col); + for ( i = 0; i < row; i++ ) { + ai = mat->a[i]; + for ( j = 0; j < col; j++ ) { + if ( ai[j/BLEN] & (1L<<(j%BLEN)) ) putchar('1'); + else putchar('0'); + } + putchar('\n'); + } +} - nf1 = ndvtond(m,nfqv); - nd_monic(0,&nf1); - nd_removecont(0,nf1); - nfqv = ndtondv(0,nf1); nd_free(nf1); - } - nfv = ndv_dup(0,nfqv); - ndv_mod(m,nfv); - ndv_removecont(m,nfv); - nh = ndv_newps(0,nfv,nfqv); - d = update_pairs(d,g,nh,0); - g = update_base(g,nh); - } +NDV vect_to_ndv_2(unsigned long *vect,int col,UINT *s0vect); + +void red_by_vect_2(matrix mat,int *sugar,unsigned long *v,int rhead,int rsugar) +{ + int row,col,wcol,wj,i,j; + unsigned long bj; + unsigned long *ai; + unsigned long **a; + int len; + int *pos; + + row = mat->row; + col = mat->col; + wcol = (col+BLEN-1)/BLEN; + pos = (int *)MALLOC(wcol*sizeof(int)); + bzero(pos,wcol*sizeof(int)); + for ( i = j = 0; i < wcol; i++ ) + if ( v[i] ) pos[j++] = i;; + len = j; + wj = rhead/BLEN; + bj = 1L<a; + for ( i = 0; i < row; i++ ) { + ai = a[i]; + if ( ai[wj]&bj ) { + for ( j = 0; j < len; j++ ) + ai[pos[j]] ^= v[pos[j]]; + sugar[i] = MAX(sugar[i],rsugar); + } + } +} + +NODE nd_f4_red_2(ND_pairs sp0,UINT *s0vect,int col,NODE rp0,ND_pairs *nz) +{ + int nsp,nred,i,i0,k,rank,row; + NODE r0,rp; + ND_pairs sp; + ND spol; + NM_ind_pair rt; + int *s0hash; + UINT *s; + int *pivot,*sugar,*head; + matrix mat; + NM m; + NODE r; + struct oEGT eg0,eg1,eg2,eg_elim1,eg_elim2; + int rhead,rsugar,size; + unsigned long *v; + + get_eg(&eg0); +init_eg(&eg_search); + for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ ); + nred = length(rp0); + mat = alloc_matrix(nsp,col); + s0hash = (int *)MALLOC(col*sizeof(int)); + for ( i = 0, s = s0vect; i < col; i++, s += nd_wpd ) + s0hash[i] = ndl_hash_value(s); + + sugar = (int *)MALLOC(nsp*sizeof(int)); + for ( i = 0, sp = sp0; sp; sp = NEXT(sp) ) { + nd_sp(2,0,sp,&spol); + if ( spol ) { + mat->a[i] = nd_to_vect_2(s0vect,col,s0hash,spol); + sugar[i] = SG(spol); + i++; } -#if 0 - fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc); -#endif - conv_ilist(0,1,g,indp); - return g; + } + mat->row = i; + if ( DP_Print ) { + fprintf(asir_out,"%dx%d,",mat->row,mat->col); fflush(asir_out); + } + size = ((col+BLEN-1)/BLEN)*sizeof(unsigned long); + v = CALLOC((col+BLEN-1)/BLEN,sizeof(unsigned long)); + for ( rp = rp0, i = 0; rp; rp = NEXT(rp), i++ ) { + rt = (NM_ind_pair)BDY(rp); + bzero(v,size); + rhead = nd_nm_to_vect_2(s0vect,col,s0hash,nd_ps[rt->index],rt->mul,v); + rsugar = SG(nd_ps[rt->index])+TD(DL(rt->mul)); + red_by_vect_2(mat,sugar,v,rhead,rsugar); + } + + get_eg(&eg1); + init_eg(&eg_elim1); add_eg(&eg_elim1,&eg0,&eg1); + rank = rref(mat,sugar); + + for ( i = 0, r0 = 0; i < rank; i++ ) { + NEXTNODE(r0,r); + BDY(r) = (pointer)vect_to_ndv_2(mat->a[i],col,s0vect); + SG((NDV)BDY(r)) = sugar[i]; + } + if ( r0 ) NEXT(r) = 0; + get_eg(&eg2); + init_eg(&eg_elim2); add_eg(&eg_elim2,&eg1,&eg2); + if ( DP_Print ) { + fprintf(asir_out,"elim1=%.3fsec,elim2=%.3fsec,", + eg_elim1.exectime+eg_elim1.gctime,eg_elim2.exectime+eg_elim2.gctime); + fflush(asir_out); + } + return r0; } + NODE nd_f4_red(int m,ND_pairs sp0,int trace,UINT *s0vect,int col,NODE rp0,ND_pairs *nz) { IndArray *imat; @@ -6100,31 +7217,53 @@ NODE nd_f4_red(int m,ND_pairs sp0,int trace,UINT *s0ve UINT *s; int *s0hash; + if ( m == 2 && nd_rref2 ) + return nd_f4_red_2(sp0,s0vect,col,rp0,nz); + init_eg(&eg_search); for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ ); nred = length(rp0); - imat = (IndArray *)ALLOCA(nred*sizeof(IndArray)); - rhead = (int *)ALLOCA(col*sizeof(int)); + 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 */ - rvect = (NM_ind_pair *)ALLOCA(nred*sizeof(NM_ind_pair)); - s0hash = (int *)ALLOCA(col*sizeof(int)); + if ( DP_Print ) { + fprintf(asir_out,"%dx%d,",nsp+nred,col); + } + rvect = (NM_ind_pair *)MALLOC(nred*sizeof(NM_ind_pair)); + s0hash = (int *)MALLOC(col*sizeof(int)); 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); - imat[i] = nm_ind_pair_to_vect_compress(m,s0vect,col,s0hash,rvect[i]); + imat[i] = nm_ind_pair_to_vect_compress(trace,s0vect,col,s0hash,rvect[i]); rhead[imat[i]->head] = 1; } - if ( m ) + if ( m > 0 ) +#if defined(__GNUC__) && SIZEOF_LONG==8 + r0 = nd_f4_red_mod64_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz); +#else r0 = nd_f4_red_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz); +#endif + else if ( m == -1 ) + r0 = nd_f4_red_sf_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz); + else if ( m == -2 ) + r0 = nd_f4_red_lf_main(m,sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred); else +#if defined(VISUAL) r0 = nd_f4_red_q_main(sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred); -print_eg("search",&eg_search); +#else + r0 = nd_f4_red_gz_main(sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred); +#endif +#if 0 + if ( DP_Print ) print_eg("search",&eg_search); +#endif return r0; } +/* for Fp, 2<=p<2^16 */ + NODE nd_f4_red_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) { @@ -6144,10 +7283,10 @@ NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s spcol = col-nred; get_eg(&eg0); /* elimination (1st step) */ - spmat = (int **)ALLOCA(nsp*sizeof(UINT *)); - svect = (UINT *)ALLOCA(col*sizeof(UINT)); - spsugar = (int *)ALLOCA(nsp*sizeof(UINT)); - spactive = !nz?0:(ND_pairs *)ALLOCA(nsp*sizeof(ND_pairs)); + spmat = (int **)MALLOC(nsp*sizeof(UINT *)); + svect = (UINT *)MALLOC(col*sizeof(UINT)); + 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; @@ -6170,42 +7309,203 @@ 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); if ( DP_Print ) { - fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime); + 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 *)ALLOCA(spcol*sizeof(int)); + colstat = (int *)MALLOC(spcol*sizeof(int)); if ( m == -1 ) rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat); else rank = nd_gauss_elim_mod(spmat,spsugar,spactive,sprow,spcol,m,colstat); r0 = 0; for ( i = 0; i < rank; i++ ) { -#if 0 NEXTNODE(r0,r); BDY(r) = (pointer)vect_to_ndv(spmat[i],spcol,col,rhead,s0vect); SG((NDV)BDY(r)) = spsugar[i]; GCFREE(spmat[i]); -#else + } + 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; +} + +#if defined(__GNUC__) && SIZEOF_LONG==8 +/* for Fp, 2^15=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)vect_to_ndv(spmat[rank-i-1],spcol,col,rhead,s0vect); - SG((NDV)BDY(r)) = spsugar[rank-i-1]; - GCFREE(spmat[rank-i-1]); + (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 */ + +NODE nd_f4_red_sf_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; + int **spmat; + UINT *svect,*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 = (int **)MALLOC(nsp*sizeof(UINT *)); + svect = (UINT *)MALLOC(col*sizeof(UINT)); + 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_vect(m,s0vect,col,spol,svect); + maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rvect,nred); + for ( i = 0; i < col; i++ ) if ( svect[i] ) break; + if ( i < col ) { + spmat[sprow] = v = (UINT *)MALLOC_ATOMIC(spcol*sizeof(UINT)); + for ( j = k = 0; j < col; j++ ) + if ( !rhead[j] ) v[k++] = 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_sf(spmat,spsugar,sprow,spcol,m,colstat); + r0 = 0; + for ( i = 0; i < rank; i++ ) { + NEXTNODE(r0,r); BDY(r) = + (pointer)vect_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=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime); - fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ", + 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,"%fsec\n",eg_f4.exectime+eg_f4.gctime); + 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]; @@ -6218,6 +7518,88 @@ NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s return r0; } +NODE nd_f4_red_lf_main(int m,ND_pairs sp0,int nsp,int trace,UINT *s0vect,int col, + NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred) +{ + int spcol,sprow,a; + int i,j,k,l,rank; + NODE r0,r; + ND_pairs sp; + ND spol; + mpz_t **spmat; + mpz_t *svect,*v; + int *colstat; + struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2; + int maxrs; + int *spsugar; + pointer *w; + + spcol = col-nred; + get_eg(&eg0); + /* elimination (1st step) */ + spmat = (mpz_t **)MALLOC(nsp*sizeof(mpz_t *)); + svect = (mpz_t *)MALLOC(col*sizeof(mpz_t)); + spsugar = (int *)MALLOC(nsp*sizeof(int)); + for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) { + nd_sp(m,trace,sp,&spol); + if ( !spol ) continue; + nd_to_vect_lf(s0vect,col,spol,svect); + maxrs = ndv_reduce_vect_lf(svect,trace,col,imat,rvect,nred); + for ( i = 0; i < col; i++ ) if ( mpz_sgn(svect[i]) ) break; + if ( i < col ) { + spmat[sprow] = v = (mpz_t *)MALLOC(spcol*sizeof(mpz_t)); + for ( j = k = 0; j < col; j++ ) + if ( !rhead[j] ) v[k++][0] = svect[j][0]; + spsugar[sprow] = MAX(maxrs,SG(spol)); + 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_lf(spmat,spsugar,sprow,spcol,colstat); + w = (pointer *)MALLOC(rank*sizeof(pointer)); + for ( i = 0; i < rank; i++ ) { +#if 0 + w[rank-i-1] = (pointer)vect_to_ndv_lf(spmat[i],spcol,col,rhead,s0vect); + SG((NDV)w[rank-i-1]) = spsugar[i]; +#else + w[i] = (pointer)vect_to_ndv_lf(spmat[i],spcol,col,rhead,s0vect); + SG((NDV)w[i]) = spsugar[i]; +#endif +/* GCFREE(spmat[i]); */ + + } +#if 0 + qsort(w,rank,sizeof(NDV), + (int (*)(const void *,const void *))ndv_compare); +#endif + r0 = 0; + for ( i = 0; i < rank; i++ ) { + NEXTNODE(r0,r); BDY(r) = w[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); + } + return r0; +} + #if 1 NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,int trace,UINT *s0vect,int col, NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred) @@ -6238,9 +7620,9 @@ NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,int trace,U spcol = col-nred; get_eg(&eg0); /* elimination (1st step) */ - spmat = (Q **)ALLOCA(nsp*sizeof(Q *)); - svect = (Q *)ALLOCA(col*sizeof(Q)); - spsugar = (int *)ALLOCA(nsp*sizeof(Q)); + spmat = (Q **)MALLOC(nsp*sizeof(Q *)); + svect = (Q *)MALLOC(col*sizeof(Q)); + spsugar = (int *)MALLOC(nsp*sizeof(int)); for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) { nd_sp(0,trace,sp,&spol); if ( !spol ) continue; @@ -6258,19 +7640,24 @@ 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); if ( DP_Print ) { - fprintf(asir_out,"elim1=%fsec,",eg_f4_1.exectime+eg_f4_1.gctime); + 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 *)ALLOCA(spcol*sizeof(int)); + colstat = (int *)MALLOC(spcol*sizeof(int)); rank = nd_gauss_elim_q(spmat,spsugar,sprow,spcol,colstat); - w = (pointer *)ALLOCA(rank*sizeof(pointer)); + w = (pointer *)MALLOC(rank*sizeof(pointer)); for ( i = 0; i < rank; i++ ) { +#if 0 w[rank-i-1] = (pointer)vect_to_ndv_q(spmat[i],spcol,col,rhead,s0vect); SG((NDV)w[rank-i-1]) = spsugar[i]; +#else + w[i] = (pointer)vect_to_ndv_q(spmat[i],spcol,col,rhead,s0vect); + SG((NDV)w[i]) = spsugar[i]; +#endif /* GCFREE(spmat[i]); */ } #if 0 @@ -6287,14 +7674,99 @@ 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); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); if ( DP_Print ) { - fprintf(asir_out,"elim2=%fsec\n",eg_f4_2.exectime+eg_f4_2.gctime); - fprintf(asir_out,"nsp=%d,nred=%d,spmat=(%d,%d),rank=%d ", + 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,"%fsec\n",eg_f4.exectime+eg_f4.gctime); + fprintf(asir_out,"%.3fsec,",eg_f4.exectime+eg_f4.gctime); } return r0; } + +NODE nd_f4_red_gz_main(ND_pairs sp0,int nsp,int trace,UINT *s0vect,int col, + NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred) +{ + int spcol,sprow,a; + int i,j,k,l,rank; + NODE r0,r; + ND_pairs sp; + ND spol; + GZ **spmat; + GZ *svect,*v; + int *colstat; + struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2; + int maxrs; + int *spsugar; + pointer *w; + + spcol = col-nred; + get_eg(&eg0); + /* elimination (1st step) */ + spmat = (GZ **)MALLOC(nsp*sizeof(GZ *)); + svect = (GZ *)MALLOC(col*sizeof(GZ)); + spsugar = (int *)MALLOC(nsp*sizeof(int)); + for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) { + nd_sp(0,trace,sp,&spol); + if ( !spol ) continue; + spol = ndtondgz(spol); + nd_to_vect_q(s0vect,col,spol,(Q *)svect); + maxrs = ndv_reduce_vect_gz(svect,trace,col,imat,rvect,nred); + for ( i = 0; i < col; i++ ) if ( svect[i] ) break; + if ( i < col ) { + spmat[sprow] = v = (GZ *)MALLOC(spcol*sizeof(GZ)); + for ( j = k = 0; j < col; j++ ) + if ( !rhead[j] ) v[k++] = svect[j]; + spsugar[sprow] = MAX(maxrs,SG(spol)); + 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_gz(spmat,spsugar,sprow,spcol,colstat); + w = (pointer *)MALLOC(rank*sizeof(pointer)); + for ( i = 0; i < rank; i++ ) { +#if 0 + w[rank-i-1] = (pointer)vect_to_ndv_gz(spmat[i],spcol,col,rhead,s0vect); + w[rank-i-1] = ndvgztondv(w[rank-i-1]); + SG((NDV)w[rank-i-1]) = spsugar[i]; #else + w[i] = (pointer)vect_to_ndv_gz(spmat[i],spcol,col,rhead,s0vect); + w[i] = ndvgztondv(w[i]); + SG((NDV)w[i]) = spsugar[i]; +#endif +/* GCFREE(spmat[i]); */ + + } +#if 0 + qsort(w,rank,sizeof(NDV), + (int (*)(const void *,const void *))ndv_compare); +#endif + r0 = 0; + for ( i = 0; i < rank; i++ ) { + NEXTNODE(r0,r); BDY(r) = w[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); + } + return r0; +} +#else void printm(Q **mat,int row,int col) { int i,j; @@ -6321,8 +7793,8 @@ NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vec row = nsp+nred; /* make the matrix */ - mat = (Q **)ALLOCA(row*sizeof(Q *)); - sugar = (int *)ALLOCA(row*sizeof(int)); + mat = (Q **)MALLOC(row*sizeof(Q *)); + sugar = (int *)MALLOC(row*sizeof(int)); for ( row = a = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) { nd_sp(0,0,sp,&spol); if ( !spol ) continue; @@ -6336,7 +7808,7 @@ NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vec sugar[row] = rvect[i]->sugar; } /* elimination */ - colstat = (int *)ALLOCA(col*sizeof(int)); + colstat = (int *)MALLOC(col*sizeof(int)); rank = nd_gauss_elim_q(mat,sugar,row,col,colstat); r0 = 0; for ( i = 0; i < rank; i++ ) { @@ -6428,198 +7900,36 @@ NDV nd_recv_ndv() } } -int ox_exec_f4_red(Q proc) +int nd_gauss_elim_q(Q **mat0,int *sugar,int row,int col,int *colstat) { - Obj obj; - STRING fname; - NODE arg; - int s; - extern int ox_need_conv,ox_file_io; + int i,j,t,c,rank,inv; + int *ci,*ri; + Q dn; + MAT m,nm; - MKSTR(fname,"nd_exec_f4_red"); - arg = mknode(2,proc,fname); - Pox_cmo_rpc(arg,&obj); - s = get_ox_server_id(QTOS(proc)); - nd_write = iofp[s].out; - nd_read = iofp[s].in; - ox_need_conv = ox_file_io = 0; - return s; -} - -#if 0 -NODE nd_f4_red_dist(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0,ND_pairs *nz) -{ - int nsp,nred; - int i,rank,s; - NODE rp,r0,r; - ND_pairs sp; - NM_ind_pair pair; - NMV nmv; - NM nm; - NDV nf; - Obj proc,dmy; - - ox_launch_main(0,0,&proc); - s = ox_exec_f4_red((Q)proc); - - nd_send_int(m); - nd_send_int(nd_nvar); - nd_send_int(nd_bpe); - nd_send_int(nd_wpd); - nd_send_int(nmv_adv); - - saveobj(nd_write,dp_current_spec->obj); fflush(nd_write); - - nd_send_int(nd_psn); - for ( i = 0; i < nd_psn; i++ ) nd_send_ndv(nd_ps[i]); - - for ( sp = sp0, nsp = 0; sp; sp = NEXT(sp), nsp++ ); - nd_send_int(nsp); - for ( i = 0, sp = sp0; i < nsp; i++, sp = NEXT(sp) ) { - nd_send_int(sp->i1); nd_send_int(sp->i2); - } - - nd_send_int(col); nd_send_intarray(s0vect,col*nd_wpd); - - nred = length(rp0); nd_send_int(nred); - for ( i = 0, rp = rp0; i < nred; i++, rp = NEXT(rp) ) { - pair = (NM_ind_pair)BDY(rp); - nd_send_int(pair->index); - nd_send_intarray(pair->mul->dl,nd_wpd); - } - fflush(nd_write); - rank = nd_recv_int(); - fprintf(asir_out,"rank=%d\n",rank); - r0 = 0; + NEWMAT(m); m->row = row; m->col = col; m->body = (pointer **)mat0; + rank = generic_gauss_elim(m,&nm,&dn,&ri,&ci); + for ( i = 0; i < row; i++ ) + for ( j = 0; j < col; j++ ) + mat0[i][j] = 0; + c = col-rank; for ( i = 0; i < rank; i++ ) { - nf = nd_recv_ndv(); - NEXTNODE(r0,r); BDY(r) = (pointer)nf; + mat0[i][ri[i]] = dn; + for ( j = 0; j < c; j++ ) + mat0[i][ci[j]] = (Q)BDY(nm)[i][j]; } - Pox_shutdown(mknode(1,proc),&dmy); - return r0; + return rank; } -/* server side */ - -void nd_exec_f4_red_dist() +int nd_gauss_elim_gz(GZ **mat0,int *sugar,int row,int col,int *colstat) { - int m,i,nsp,col,s0size,nred,spcol,j,k; - NM_ind_pair *rp0; - NDV nf; - UINT *s0vect; - IndArray *imat; - int *rhead; - int **spmat; - UINT *svect,*v; - ND_pairs *sp0; - int *colstat; - int a,sprow,rank; - struct order_spec *ord; - Obj ordspec; - ND spol; - int maxrs; - int *spsugar; - - nd_read = iofp[0].in; - nd_write = iofp[0].out; - m = nd_recv_int(); - nd_nvar = nd_recv_int(); - nd_bpe = nd_recv_int(); - nd_wpd = nd_recv_int(); - nmv_adv = nd_recv_int(); - - loadobj(nd_read,&ordspec); - create_order_spec(0,ordspec,&ord); - nd_init_ord(ord); - nd_setup_parameters(nd_nvar,0); - - nd_psn = nd_recv_int(); - nd_ps = (NDV *)MALLOC(nd_psn*sizeof(NDV)); - nd_bound = (UINT **)MALLOC(nd_psn*sizeof(UINT *)); - for ( i = 0; i < nd_psn; i++ ) { - nd_ps[i] = nd_recv_ndv(); - nd_bound[i] = ndv_compute_bound(nd_ps[i]); - } - - nsp = nd_recv_int(); - sp0 = (ND_pairs *)MALLOC(nsp*sizeof(ND_pairs)); - for ( i = 0; i < nsp; i++ ) { - NEWND_pairs(sp0[i]); - sp0[i]->i1 = nd_recv_int(); sp0[i]->i2 = nd_recv_int(); - ndl_lcm(HDL(nd_ps[sp0[i]->i1]),HDL(nd_ps[sp0[i]->i2]),LCM(sp0[i])); - } - - col = nd_recv_int(); - s0size = col*nd_wpd; - s0vect = (UINT *)MALLOC(s0size*sizeof(UINT)); - nd_recv_intarray(s0vect,s0size); - - nred = nd_recv_int(); - rp0 = (NM_ind_pair *)MALLOC(nred*sizeof(NM_ind_pair)); - for ( i = 0; i < nred; i++ ) { - rp0[i] = (NM_ind_pair)MALLOC(sizeof(struct oNM_ind_pair)); - rp0[i]->index = nd_recv_int(); - rp0[i]->mul = (NM)MALLOC(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); - nd_recv_intarray(rp0[i]->mul->dl,nd_wpd); - } - - spcol = col-nred; - 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 */ - for ( i = 0; i < nred; i++ ) { - imat[i] = nm_ind_pair_to_vect_compress(m,s0vect,col,rp0[i]); - rhead[imat[i]->head] = 1; - } - - /* elimination (1st step) */ - spmat = (int **)MALLOC(nsp*sizeof(UINT *)); - svect = (UINT *)MALLOC(col*sizeof(UINT)); - spsugar = (int *)ALLOCA(nsp*sizeof(UINT)); - for ( a = sprow = 0; a < nsp; a++ ) { - nd_sp(m,0,sp0[a],&spol); - if ( !spol ) continue; - nd_to_vect(m,s0vect,col,spol,svect); - if ( m == -1 ) - maxrs = ndv_reduce_vect_sf(m,svect,col,imat,rp0,nred); - else - maxrs = ndv_reduce_vect(m,svect,col,imat,rp0,nred); - for ( i = 0; i < col; i++ ) if ( svect[i] ) break; - if ( i < col ) { - spmat[sprow] = v = (UINT *)MALLOC(spcol*sizeof(UINT)); - for ( j = k = 0; j < col; j++ ) - if ( !rhead[j] ) v[k++] = svect[j]; - spsugar[sprow] = MAX(maxrs,SG(spol)); - sprow++; - } - nd_free(spol); - } - /* elimination (2nd step) */ - colstat = (int *)ALLOCA(spcol*sizeof(int)); - if ( m == -1 ) - rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat); - else - rank = nd_gauss_elim_mod(spmat,spsugar,0,sprow,spcol,m,colstat); - nd_send_int(rank); - for ( i = 0; i < rank; i++ ) { - nf = vect_to_ndv(spmat[i],spcol,col,rhead,s0vect); - nd_send_ndv(nf); - } - fflush(nd_write); -} -#endif - -int nd_gauss_elim_q(Q **mat0,int *sugar,int row,int col,int *colstat) -{ int i,j,t,c,rank,inv; int *ci,*ri; - Q dn; + GZ dn; MAT m,nm; NEWMAT(m); m->row = row; m->col = col; m->body = (pointer **)mat0; - rank = generic_gauss_elim(m,&nm,&dn,&ri,&ci); + rank = gz_generic_gauss_elim(m,&nm,&dn,&ri,&ci); for ( i = 0; i < row; i++ ) for ( j = 0; j < col; j++ ) mat0[i][j] = 0; @@ -6627,7 +7937,7 @@ int nd_gauss_elim_q(Q **mat0,int *sugar,int row,int co for ( i = 0; i < rank; i++ ) { mat0[i][ri[i]] = dn; for ( j = 0; j < c; j++ ) - mat0[i][ci[j]] = (Q)BDY(nm)[i][j]; + mat0[i][ci[j]] = (GZ)BDY(nm)[i][j]; } return rank; } @@ -6702,6 +8012,85 @@ int nd_gauss_elim_mod(int **mat0,int *sugar,ND_pairs * 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] ) { + 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(int **mat0,int *sugar,int row,int col,int md,int *colstat) { int i,j,k,l,inv,a,rank,s; @@ -6818,19 +8207,19 @@ void nd_save_mod(ND p,int index) sprintf(name,"%s/%d",Demand,index); s = fopen(name,"w"); if ( !p ) { - len = 0; - write_int(s,&len); - fclose(s); + len = 0; + write_int(s,&len); + fclose(s); return; } nv = NV(p); sugar = SG(p); len = LEN(p); write_int(s,&nv); write_int(s,&sugar); write_int(s,&len); - for ( m = BDY(p); m; m = NEXT(m) ) { - c = CM(m); write_int(s,&c); - write_intarray(s,DL(m),nd_wpd); - } + for ( m = BDY(p); m; m = NEXT(m) ) { + c = CM(m); write_int(s,&c); + write_intarray(s,DL(m),nd_wpd); + } fclose(s); } @@ -6883,28 +8272,28 @@ ND nd_load_mod(int index) FILE *s; char name[BUFSIZ]; int nv,sugar,len,i,c; - ND d; + ND d; NM m0,m; sprintf(name,"%s/%d",Demand,index); s = fopen(name,"r"); - /* if the file does not exist, it means p[index]=0 */ + /* if the file does not exist, it means p[index]=0 */ if ( !s ) return 0; read_int(s,&nv); - if ( !nv ) { fclose(s); return 0; } + if ( !nv ) { fclose(s); return 0; } read_int(s,&sugar); read_int(s,&len); - for ( m0 = 0, i = 0; i < len; i++ ) { - NEXTNM(m0,m); - read_int(s,&c); CM(m) = c; - read_intarray(s,DL(m),nd_wpd); - } - NEXT(m) = 0; + for ( m0 = 0, i = 0; i < len; i++ ) { + NEXTNM(m0,m); + read_int(s,&c); CM(m) = c; + read_intarray(s,DL(m),nd_wpd); + } + NEXT(m) = 0; MKND(nv,m0,len,d); SG(d) = sugar; - fclose(s); + fclose(s); return d; } @@ -6990,7 +8379,9 @@ void nd_det(int mod,MAT f,P *rp) if ( mod ) ndv_mod(mod,d); chsgnq(ONE,&mone); for ( j = 0, sgn = 1; j < n; j++ ) { - if ( DP_Print ) fprintf(stderr,".",j); + if ( DP_Print ) { + fprintf(asir_out,".",j); + } for ( i = j; i < n && !dm[i][j]; i++ ); if ( i == n ) { *rp = 0; @@ -7019,14 +8410,14 @@ void nd_det(int mod,MAT f,P *rp) nd_det_reconstruct(dm,n,j,d); for ( i = j+1, mj = dm[j], mjj = mj[j]; i < n; i++ ) { -/* if ( DP_Print ) fprintf(stderr," i=%d\n ",i); */ +/* if ( DP_Print ) fprintf(asir_out," i=%d\n ",i); */ mi = dm[i]; mij = mi[j]; if ( mod ) ndv_mul_c(mod,mij,mod-1); else ndv_mul_c_q(mij,mone); for ( k = j+1; k < n; k++ ) { -/* if ( DP_Print ) fprintf(stderr,"k=%d ",k); */ +/* if ( DP_Print ) fprintf(asir_out,"k=%d ",k); */ bucket = create_pbucket(); if ( mi[k] ) { nmv = BDY(mjj); len = LEN(mjj); @@ -7045,11 +8436,13 @@ void nd_det(int mod,MAT f,P *rp) u = nd_quo(mod,bucket,d); mi[k] = ndtondv(mod,u); } -/* if ( DP_Print ) fprintf(stderr,"\n",k); */ +/* if ( DP_Print ) fprintf(asir_out,"\n",k); */ } d = mjj; } - if ( DP_Print ) fprintf(stderr,"\n",k); + if ( DP_Print ) { + fprintf(asir_out,"\n",k); + } if ( sgn < 0 ) if ( mod ) ndv_mul_c(mod,d,mod-1); @@ -7224,14 +8617,14 @@ int nd_monic(int mod,ND *p) is_lc = 1; while ( 1 ) { NEWMP(mp0); mp = mp0; - mp->c = (P)CQ(m); + mp->c = (Obj)CQ(m); mp->dl = nd_separate_d(DL(m),DL(ma)); NEWNM(mb); for ( m = NEXT(m); m; m = NEXT(m) ) { alg = nd_separate_d(DL(m),DL(mb)); if ( !ndl_equal(DL(ma),DL(mb)) ) break; - NEXTMP(mp0,mp); mp->c = (P)CQ(m); mp->dl = alg; + NEXTMP(mp0,mp); mp->c = (Obj)CQ(m); mp->dl = alg; } NEXT(mp) = 0; MKDP(nd_nalg,mp0,nm); @@ -7307,6 +8700,7 @@ P ndc_div(int mod,union oNDC a,union oNDC b) int inv,t; if ( mod == -1 ) c.m = _mulsf(a.m,_invsf(b.m)); + else if ( mod == -2 ) divlf(a.z,b.z,&c.z); else if ( mod ) { inv = invm(b.m,mod); DMAR(a.m,inv,0,mod,t); c.m = t; @@ -7325,7 +8719,9 @@ P ndctop(int mod,union oNDC c) if ( mod == -1 ) { e = IFTOF(c.m); MKGFS(e,gfs); return (P)gfs; - } else if ( mod ) { + } else if ( mod == -2 ) { + q = gztoz(c.gz); return (P)q; + } else if ( mod > 0 ) { STOQ(c.m,q); return (P)q; } else return (P)c.p; @@ -7335,15 +8731,15 @@ P ndctop(int mod,union oNDC c) void finalize_tracelist(int i,P cont) { - LIST l; - NODE node; + LIST l; + NODE node; Q iq; - if ( !UNIQ(cont) ) { + if ( !UNIQ(cont) ) { node = mknode(4,NULLP,NULLP,NULLP,cont); MKLIST(l,node); MKNODE(node,l,nd_tracelist); - nd_tracelist = node; - } + nd_tracelist = node; + } STOQ(i,iq); nd_tracelist = reverse_node(nd_tracelist); MKLIST(l,nd_tracelist); @@ -7355,28 +8751,31 @@ void finalize_tracelist(int i,P cont) void conv_ilist(int demand,int trace,NODE g,int **indp) { int n,i,j; - int *ind; - NODE t; + int *ind; + NODE t; n = length(g); - ind = (int *)MALLOC(n*sizeof(int)); - for ( i = 0, t = g; i < n; i++, t = NEXT(t) ) { - j = (long)BDY(t); ind[i] = j; - BDY(t) = (pointer)(demand?ndv_load(j):(trace?nd_ps_trace[j]:nd_ps[j])); - } - if ( indp ) *indp = ind; + ind = (int *)MALLOC(n*sizeof(int)); + for ( i = 0, t = g; i < n; i++, t = NEXT(t) ) { + j = (long)BDY(t); ind[i] = j; + BDY(t) = (pointer)(demand?ndv_load(j):(trace?nd_ps_trace[j]:nd_ps[j])); + } + if ( indp ) *indp = ind; } void parse_nd_option(NODE opt) { NODE t,p,u; - int i,s; + int i,s,n; char *key; Obj value; nd_gentrace = 0; nd_gensyz = 0; nd_nora = 0; nd_gbblock = 0; - nd_newelim = 0; nd_intersect = 0; nd_nzlist = 0; - nd_splist = 0; nd_check_splist = 0; + nd_newelim = 0; nd_intersect = 0; nd_nzlist = 0; + nd_splist = 0; nd_check_splist = 0; + nd_sugarweight = 0; + nd_f4red =0; + nd_rank0 = 0; for ( t = opt; t; t = NEXT(t) ) { p = BDY((LIST)BDY(t)); key = BDY((STRING)BDY(p)); @@ -7388,34 +8787,50 @@ void parse_nd_option(NODE opt) else if ( !strcmp(key,"nora") ) nd_nora = value?1:0; else if ( !strcmp(key,"gbblock") ) { - if ( !value || OID(value) != O_LIST ) - error("nd_* : invalid value for gbblock option"); - u = BDY((LIST)value); - nd_gbblock = MALLOC((2*length(u)+1)*sizeof(int)); - for ( i = 0; u; u = NEXT(u) ) { - p = BDY((LIST)BDY(u)); - s = nd_gbblock[i++] = QTOS((Q)BDY(p)); - nd_gbblock[i++] = s+QTOS((Q)BDY(NEXT(p)))-1; - } - nd_gbblock[i] = -1; - } else if ( !strcmp(key,"newelim") ) + if ( value && OID(value) == O_LIST ) { + u = BDY((LIST)value); + nd_gbblock = MALLOC((2*length(u)+1)*sizeof(int)); + for ( i = 0; u; u = NEXT(u) ) { + p = BDY((LIST)BDY(u)); + s = nd_gbblock[i++] = QTOS((Q)BDY(p)); + nd_gbblock[i++] = s+QTOS((Q)BDY(NEXT(p)))-1; + } + nd_gbblock[i] = -1; + } else + nd_gbblock = 0; + } else if ( !strcmp(key,"newelim") ) nd_newelim = value?1:0; - else if ( !strcmp(key,"intersect") ) + else if ( !strcmp(key,"intersect") ) nd_intersect = value?1:0; - else if ( !strcmp(key,"trace") ) { - u = BDY((LIST)value); - nd_nzlist = BDY((LIST)ARG2(u)); - nd_bpe = QTOS((Q)ARG3(u)); - } else if ( !strcmp(key,"splist") ) + else if ( !strcmp(key,"lf") ) + nd_lf = value?1:0; + else if ( !strcmp(key,"trace") ) { + if ( value ) { + u = BDY((LIST)value); + nd_nzlist = BDY((LIST)ARG2(u)); + nd_bpe = QTOS((Q)ARG3(u)); + } + } else if ( !strcmp(key,"f4red") ) { + nd_f4red = QTOS((Q)value); + } else if ( !strcmp(key,"rank0") ) { + nd_rank0 = value?1:0; + } else if ( !strcmp(key,"splist") ) { nd_splist = value?1:0; - else if ( !strcmp(key,"check_splist") ) { - nd_check_splist = BDY((LIST)value); - } + } else if ( !strcmp(key,"check_splist") ) { + nd_check_splist = BDY((LIST)value); + } else if ( !strcmp(key,"sugarweight") ) { + u = BDY((LIST)value); + n = length(u); + nd_sugarweight = MALLOC(n*sizeof(int)); + for ( i = 0; i < n; i++, u = NEXT(u) ) + nd_sugarweight[i] = QTOS((Q)BDY(u)); } + } } ND mdptond(DP d); ND nd_mul_nm(int mod,NM m0,ND p); +ND nd_mul_nm_lf(NM m0,ND p); ND *btog(NODE ti,ND **p,int nb,int mod); ND btog_one(NODE ti,ND *p,int nb,int mod); MAT nd_btog(LIST f,LIST v,int m,struct order_spec *ord,LIST tlist,MAT *rp); @@ -7428,7 +8843,7 @@ ND mdptond(DP d) ND r; if ( OID(d) == 1 ) - r = ptond(CO,CO,(P)d); + r = ptond(CO,CO,(P)d); else { NEWNM(m); dltondl(NV(d),BDY(d)->dl,DL(m)); @@ -7452,14 +8867,35 @@ ND nd_mul_nm(int mod,NM m0,ND p) mr0 = 0; for ( tm = BDY(p); tm; tm = NEXT(tm) ) { NEXTNM(mr0,mr); - c = CM(tm); DMAR(c0,c,0,mod,c1); CM(mr) = c1; - ndl_add(d0,DL(tm),DL(mr)); + c = CM(tm); DMAR(c0,c,0,mod,c1); CM(mr) = c1; + ndl_add(d0,DL(tm),DL(mr)); } NEXT(mr) = 0; MKND(NV(p),mr0,LEN(p),r); return r; } +ND nd_mul_nm_lf(NM m0,ND p) +{ + UINT *d0; + GZ c0,c1,c; + NM tm,mr,mr0; + ND r; + + if ( !p ) return 0; + d0 = DL(m0); + c0 = CZ(m0); + mr0 = 0; + for ( tm = BDY(p); tm; tm = NEXT(tm) ) { + NEXTNM(mr0,mr); + c = CZ(tm); mullf(c0,CZ(tm),&c1); CZ(mr) = c1; + ndl_add(d0,DL(tm),DL(mr)); + } + NEXT(mr) = 0; + MKND(NV(p),mr0,LEN(p),r); + return r; +} + ND *btog(NODE ti,ND **p,int nb,int mod) { PGeoBucket *r; @@ -7471,34 +8907,73 @@ ND *btog(NODE ti,ND **p,int nb,int mod) r = (PGeoBucket *)MALLOC(nb*sizeof(PGeoBucket)); for ( i = 0; i < nb; i++ ) - r[i] = create_pbucket(); + r[i] = create_pbucket(); for ( t = ti; t; t = NEXT(t) ) { - s = BDY((LIST)BDY(t)); + s = BDY((LIST)BDY(t)); if ( ARG0(s) ) { - m = mdptond((DP)ARG2(s)); - ptomp(mod,(P)HCQ(m),&c); - if ( ci = ((MQ)c)->cont ) { - HCM(m) = ci; - pi = p[QTOS((Q)ARG1(s))]; - for ( i = 0; i < nb; i++ ) { - tp = nd_mul_nm(mod,BDY(m),pi[i]); - add_pbucket(mod,r[i],tp); - } - } - ci = 1; + m = mdptond((DP)ARG2(s)); + ptomp(mod,(P)HCQ(m),&c); + if ( ci = ((MQ)c)->cont ) { + HCM(m) = ci; + pi = p[QTOS((Q)ARG1(s))]; + for ( i = 0; i < nb; i++ ) { + tp = nd_mul_nm(mod,BDY(m),pi[i]); + add_pbucket(mod,r[i],tp); + } + } + ci = 1; } else { - ptomp(mod,(P)ARG3(s),&c); ci = ((MQ)c)->cont; - ci = invm(ci,mod); - } + ptomp(mod,(P)ARG3(s),&c); ci = ((MQ)c)->cont; + ci = invm(ci,mod); } + } rd = (ND *)MALLOC(nb*sizeof(ND)); for ( i = 0; i < nb; i++ ) - rd[i] = normalize_pbucket(mod,r[i]); + rd[i] = normalize_pbucket(mod,r[i]); if ( ci != 1 ) for ( i = 0; i < nb; i++ ) nd_mul_c(mod,rd[i],ci); return rd; } +/* YYY */ +ND *btog_lf(NODE ti,ND **p,int nb) +{ + PGeoBucket *r; + int i; + NODE t,s; + ND m,tp; + ND *pi,*rd; + LM lm; + GZ lf,c; + + r = (PGeoBucket *)MALLOC(nb*sizeof(PGeoBucket)); + for ( i = 0; i < nb; i++ ) + r[i] = create_pbucket(); + for ( t = ti; t; t = NEXT(t) ) { + s = BDY((LIST)BDY(t)); + if ( ARG0(s) ) { + m = mdptond((DP)ARG2(s)); + simp_ff((Obj)HCQ(m),&lm); + if ( lm ) { + lmtolf(lm,&lf); HCZ(m) = lf; + pi = p[QTOS((Q)ARG1(s))]; + for ( i = 0; i < nb; i++ ) { + tp = nd_mul_nm_lf(BDY(m),pi[i]); + add_pbucket(-2,r[i],tp); + } + } + c = ONEGZ; + } else { + simp_ff((Obj)ARG3(s),&lm); lmtolf(lm,&lf); invgz(lf,&c); + } + } + rd = (ND *)MALLOC(nb*sizeof(ND)); + for ( i = 0; i < nb; i++ ) + rd[i] = normalize_pbucket(-2,r[i]); + for ( i = 0; i < nb; i++ ) nd_mul_c_lf(rd[i],c); + return rd; +} + ND btog_one(NODE ti,ND *p,int nb,int mod) { PGeoBucket r; @@ -7510,35 +8985,37 @@ ND btog_one(NODE ti,ND *p,int nb,int mod) r = create_pbucket(); for ( t = ti; t; t = NEXT(t) ) { - s = BDY((LIST)BDY(t)); + s = BDY((LIST)BDY(t)); if ( ARG0(s) ) { - m = mdptond((DP)ARG2(s)); - ptomp(mod,(P)HCQ(m),&c); - if ( ci = ((MQ)c)->cont ) { - HCM(m) = ci; - pi = p[j=QTOS((Q)ARG1(s))]; - if ( !pi ) { - pi = nd_load_mod(j); - tp = nd_mul_nm(mod,BDY(m),pi); - nd_free(pi); - add_pbucket(mod,r,tp); - } else { - tp = nd_mul_nm(mod,BDY(m),pi); - add_pbucket(mod,r,tp); - } - } - ci = 1; + m = mdptond((DP)ARG2(s)); + ptomp(mod,(P)HCQ(m),&c); + if ( ci = ((MQ)c)->cont ) { + HCM(m) = ci; + pi = p[j=QTOS((Q)ARG1(s))]; + if ( !pi ) { + pi = nd_load_mod(j); + tp = nd_mul_nm(mod,BDY(m),pi); + nd_free(pi); + add_pbucket(mod,r,tp); } else { - ptomp(mod,(P)ARG3(s),&c); ci = ((MQ)c)->cont; - ci = invm(ci,mod); - } + tp = nd_mul_nm(mod,BDY(m),pi); + add_pbucket(mod,r,tp); + } + } + ci = 1; + } else { + ptomp(mod,(P)ARG3(s),&c); ci = ((MQ)c)->cont; + ci = invm(ci,mod); } + } rd = normalize_pbucket(mod,r); free_pbucket(r); if ( ci != 1 ) nd_mul_c(mod,rd,ci); return rd; } +MAT nd_btog_lf(LIST f,LIST v,struct order_spec *ord,LIST tlist,MAT *rp); + MAT nd_btog(LIST f,LIST v,int mod,struct order_spec *ord,LIST tlist,MAT *rp) { int i,j,n,m,nb,pi0,pi1,nvar; @@ -7550,6 +9027,9 @@ MAT nd_btog(LIST f,LIST v,int mod,struct order_spec *o P inv; MAT mat; + if ( mod == -2 ) + return nd_btog_lf(f,v,ord,tlist,rp); + parse_nd_option(current_option); get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc); for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); @@ -7573,43 +9053,108 @@ MAT nd_btog(LIST f,LIST v,int mod,struct order_spec *o ind = BDY((LIST)ARG4(BDY(tlist))); perm = BDY((LIST)BDY(permtrace)); trace =NEXT(permtrace); for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) { - j = QTOS((Q)BDY(BDY((LIST)BDY(t)))); - if ( j > i ) i = j; + j = QTOS((Q)BDY(BDY((LIST)BDY(t)))); + if ( j > i ) i = j; } n = i+1; nb = length(BDY(f)); p = (ND **)MALLOC(n*sizeof(ND *)); for ( t = perm, i = 0; t; t = NEXT(t), i++ ) { pi = BDY((LIST)BDY(t)); - pi0 = QTOS((Q)ARG0(pi)); pi1 = QTOS((Q)ARG1(pi)); - p[pi0] = c = (ND *)MALLOC(nb*sizeof(ND)); - ptomp(mod,(P)ARG2(pi),&inv); - u = ptond(CO,vv,(P)ONE); - HCM(u) = ((MQ)inv)->cont; - c[pi1] = u; + pi0 = QTOS((Q)ARG0(pi)); pi1 = QTOS((Q)ARG1(pi)); + p[pi0] = c = (ND *)MALLOC(nb*sizeof(ND)); + ptomp(mod,(P)ARG2(pi),&inv); + ((MQ)inv)->cont = invm(((MQ)inv)->cont,mod); + u = ptond(CO,vv,(P)ONE); + HCM(u) = ((MQ)inv)->cont; + c[pi1] = u; } 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)); p[j=QTOS((Q)ARG0(ti))] = btog(BDY((LIST)ARG1(ti)),p,nb,mod); - if ( j == 441 ) - printf("afo"); } 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)); p[j=QTOS((Q)ARG0(ti))] = btog(BDY((LIST)ARG1(ti)),p,nb,mod); - if ( j == 441 ) - printf("afo"); } m = length(ind); MKMAT(mat,nb,m); for ( j = 0, t = ind; j < m; j++, t = NEXT(t) ) for ( i = 0, c = p[QTOS((Q)BDY(t))]; i < nb; i++ ) - BDY(mat)[i][j] = ndtodp(mod,c[i]); + BDY(mat)[i][j] = ndtodp(mod,c[i]); return mat; } +MAT nd_btog_lf(LIST f,LIST v,struct order_spec *ord,LIST tlist,MAT *rp) +{ + int i,j,n,m,nb,pi0,pi1,nvar; + VL fv,tv,vv; + NODE permtrace,perm,trace,intred,ind,t,pi,ti; + ND **p; + ND *c; + ND u; + MAT mat; + LM lm; + GZ lf,inv; + + parse_nd_option(current_option); + get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc); + for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); + switch ( ord->id ) { + case 1: + if ( ord->nv != nvar ) + error("nd_check : invalid order specification"); + break; + default: + break; + } + nd_init_ord(ord); +#if 0 + nd_bpe = QTOS((Q)ARG7(BDY(tlist))); +#else + nd_bpe = 32; +#endif + nd_setup_parameters(nvar,0); + permtrace = BDY((LIST)ARG2(BDY(tlist))); + intred = BDY((LIST)ARG3(BDY(tlist))); + ind = BDY((LIST)ARG4(BDY(tlist))); + perm = BDY((LIST)BDY(permtrace)); trace =NEXT(permtrace); + for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) { + j = QTOS((Q)BDY(BDY((LIST)BDY(t)))); + if ( j > i ) i = j; + } + n = i+1; + nb = length(BDY(f)); + p = (ND **)MALLOC(n*sizeof(ND *)); + for ( t = perm, i = 0; t; t = NEXT(t), i++ ) { + pi = BDY((LIST)BDY(t)); + pi0 = QTOS((Q)ARG0(pi)); pi1 = QTOS((Q)ARG1(pi)); + p[pi0] = c = (ND *)MALLOC(nb*sizeof(ND)); + simp_ff((Obj)ARG2(pi),&lm); lmtolf(lm,&lf); invgz(lf,&inv); + u = ptond(CO,vv,(P)ONE); + HCZ(u) = inv; + c[pi1] = u; + } + for ( t = trace,i=0; t; t = NEXT(t), i++ ) { + printf("%d ",i); fflush(stdout); + ti = BDY((LIST)BDY(t)); + p[j=QTOS((Q)ARG0(ti))] = btog_lf(BDY((LIST)ARG1(ti)),p,nb); + } + for ( t = intred, i=0; t; t = NEXT(t), i++ ) { + printf("%d ",i); fflush(stdout); + ti = BDY((LIST)BDY(t)); + p[j=QTOS((Q)ARG0(ti))] = btog_lf(BDY((LIST)ARG1(ti)),p,nb); + } + m = length(ind); + MKMAT(mat,nb,m); + for ( j = 0, t = ind; j < m; j++, t = NEXT(t) ) + for ( i = 0, c = p[QTOS((Q)BDY(t))]; i < nb; i++ ) + BDY(mat)[i][j] = ndtodp(-2,c[i]); + return mat; +} + VECT nd_btog_one(LIST f,LIST v,int mod,struct order_spec *ord, LIST tlist,int pos,MAT *rp) { @@ -7622,6 +9167,9 @@ VECT nd_btog_one(LIST f,LIST v,int mod,struct order_sp P inv; VECT vect; + if ( mod == -2 ) + error("nd_btog_one : not implemented yet for a large finite field"); + parse_nd_option(current_option); get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc); for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); @@ -7645,48 +9193,293 @@ VECT nd_btog_one(LIST f,LIST v,int mod,struct order_sp ind = BDY((LIST)ARG4(BDY(tlist))); perm = BDY((LIST)BDY(permtrace)); trace =NEXT(permtrace); for ( i = length(perm)-1, t = trace; t; t = NEXT(t) ) { - j = QTOS((Q)BDY(BDY((LIST)BDY(t)))); - if ( j > i ) i = j; + j = QTOS((Q)BDY(BDY((LIST)BDY(t)))); + if ( j > i ) i = j; } n = i+1; nb = length(BDY(f)); p = (ND *)MALLOC(n*sizeof(ND *)); for ( t = perm, i = 0; t; t = NEXT(t), i++ ) { pi = BDY((LIST)BDY(t)); - pi0 = QTOS((Q)ARG0(pi)); pi1 = QTOS((Q)ARG1(pi)); - if ( pi1 == pos ) { - ptomp(mod,(P)ARG2(pi),&inv); - u = ptond(CO,vv,(P)ONE); - HCM(u) = ((MQ)inv)->cont; - p[pi0] = u; + pi0 = QTOS((Q)ARG0(pi)); pi1 = QTOS((Q)ARG1(pi)); + if ( pi1 == pos ) { + ptomp(mod,(P)ARG2(pi),&inv); + ((MQ)inv)->cont = invm(((MQ)inv)->cont,mod); + u = ptond(CO,vv,(P)ONE); + HCM(u) = ((MQ)inv)->cont; + p[pi0] = u; } } 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)); p[j=QTOS((Q)ARG0(ti))] = btog_one(BDY((LIST)ARG1(ti)),p,nb,mod); if ( Demand ) { nd_save_mod(p[j],j); nd_free(p[j]); p[j] = 0; - } } + } 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)); p[j=QTOS((Q)ARG0(ti))] = btog_one(BDY((LIST)ARG1(ti)),p,nb,mod); if ( Demand ) { nd_save_mod(p[j],j); nd_free(p[j]); p[j] = 0; - } } + } m = length(ind); MKVECT(vect,m); for ( j = 0, t = ind; j < m; j++, t = NEXT(t) ) { - u = p[QTOS((Q)BDY(t))]; - if ( !u ) { - u = nd_load_mod(QTOS((Q)BDY(t))); - BDY(vect)[j] = ndtodp(mod,u); - nd_free(u); - } else - BDY(vect)[j] = ndtodp(mod,u); + u = p[QTOS((Q)BDY(t))]; + if ( !u ) { + u = nd_load_mod(QTOS((Q)BDY(t))); + BDY(vect)[j] = ndtodp(mod,u); + nd_free(u); + } else + BDY(vect)[j] = ndtodp(mod,u); } return vect; } + +void ndv_print_lf(NDV p) +{ + NMV m; + int i,len; + + if ( !p ) printf("0\n"); + else { + len = LEN(p); + for ( m = BDY(p), i = 0; i < len; i++, NMV_ADV(m) ) { + printf("+"); + mpz_out_str(asir_out,10,BDY(CZ(m))); + printf("*"); + ndl_print(DL(m)); + } + printf("\n"); + } +} + +void nd_f4_lf_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp) +{ + VL tv,fv,vv,vc,av; + NODE fd,fd0,in0,in,r,r0,t,s,cand,alist; + int m,nocheck,nvar,mindex,e,max; + NDV c; + NMV a; + P p,zp; + Q dmy; + EPOS oepos; + int obpe,oadv,wmax,i,len,cbpe,ishomo,nalg,mrank,trank,ompos; + Alg alpha,dp; + P poly; + LIST f1,f2,zpl; + Obj obj; + NumberField nf; + struct order_spec *ord1; + struct oEGT eg_check,eg0,eg1; + NODE tr,tl1,tl2,tl3,tl4; + LIST l1,l2,l3,l4,l5; + int *perm; + int j,ret; + Q jq,bpe; + + nd_module = 0; + parse_nd_option(current_option); + get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc); + if ( nd_vc ) + error("nd_f4_lf_trace : computation over a rational function field is not implemented"); + for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); + switch ( ord->id ) { + case 1: + if ( ord->nv != nvar ) + error("nd_f4_lf_trace : invalid order specification"); + break; + default: + break; + } + + nd_ntrans = nvar; + nd_nalg = 0; + + nocheck = 0; + mindex = 0; + + /* do not use on-demand load/save */ + nd_demand = 0; + m = trace > 1 ? trace : get_lprime(mindex); + nd_init_ord(ord); + mrank = 0; + for ( t = BDY(f), max = 1; t; t = NEXT(t) ) + for ( tv = vv; tv; tv = NEXT(tv) ) { + if ( nd_module ) { + 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 { + 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; + /* XXX */ + for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { + if ( nd_module ) { + c = (pointer)pltondv(CO,vv,(LIST)BDY(t)); + } else { + c = (pointer)ptondv(CO,vv,(P)BDY(t)); + } + if ( ishomo ) + ishomo = ishomo && ndv_ishomo(c); + if ( c ) { + NEXTNODE(fd0,fd); BDY(fd) = (pointer)ndv_dup(0,c); + ndv_mod(-2,c); + NEXTNODE(in0,in); BDY(in) = (pointer)c; + } + } + if ( in0 ) NEXT(in) = 0; + if ( fd0 ) NEXT(fd) = 0; + if ( !ishomo && homo ) { + for ( t = in0, wmax = max; t; t = NEXT(t) ) { + c = (NDV)BDY(t); len = LEN(c); + for ( a = BDY(c), 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,wmax); + for ( t = fd0; t; t = NEXT(t) ) + ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos,ompos); + } + if ( MaxDeg > 0 ) nocheck = 1; + ret = ndv_setup(-2,m,fd0,nd_gbblock?1:0,0); + if ( ret ) + cand = nd_f4_lf_trace_main(m,&perm); + if ( !ret || !cand ) { + *rp = 0; return; + } + if ( !ishomo && homo ) { + /* dehomogenization */ + for ( t = cand; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord); + nd_init_ord(ord); + nd_setup_parameters(nvar,0); + } + cand = ndv_reducebase(cand,perm); + cand = ndv_reduceall(-2,cand); + cbpe = nd_bpe; + get_eg(&eg0); + if ( ret = ndv_check_membership(-2,in0,obpe,oadv,oepos,cand) ) { + /* gbcheck : cand is a GB of Id(cand) ? */ + ret = nd_f4(-2,0,0); + } + if ( !ret ) { + /* failure */ + *rp = 0; return; + } + get_eg(&eg1); init_eg(&eg_check); add_eg(&eg_check,&eg0,&eg1); + if ( DP_Print ) + fprintf(asir_out,"check=%.3fsec\n",eg_check.exectime+eg_check.gctime); + /* dp->p */ + nd_bpe = cbpe; + nd_setup_parameters(nd_nvar,0); + for ( r = cand; r; r = NEXT(r) ) { + if ( nd_module ) BDY(r) = ndvtopl(-2,CO,vv,BDY(r),mrank); + else BDY(r) = (pointer)ndvtop(-2,CO,vv,BDY(r)); + } + MKLIST(*rp,cand); +} + +NODE nd_f4_lf_trace_main(int m,int **indp) +{ + int i,nh,stat,index; + NODE r,rm,g; + ND_pairs d,l,l0,t; + ND spol,red; + NDV nf,redv,nfqv,nfv; + NM s0,s; + NODE rp0,srp0,nflist,nflist_lf; + int nsp,nred,col,rank,len,k,j,a; + UINT c; + UINT **spmat; + UINT *s0vect,*svect,*p,*v; + int *colstat; + IndArray *imat; + int *rhead; + int spcol,sprow; + int sugar; + PGeoBucket bucket; + struct oEGT eg0,eg1,eg_f4; + + g = 0; d = 0; + for ( i = 0; i < nd_psn; i++ ) { + d = update_pairs(d,g,i,0); + g = update_base(g,i); + } + while ( d ) { + get_eg(&eg0); + l = nd_minsugarp(d,&d); + sugar = 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(1,d); + continue; + } + if ( bucket->m < 0 ) continue; + col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0); + if ( !col ) { + for ( t = l; NEXT(t); t = NEXT(t) ); + NEXT(t) = d; d = l; + d = nd_reconstruct(1,d); + continue; + } + get_eg(&eg1); init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg1); + if ( DP_Print ) + fprintf(asir_out,"sugar=%d,symb=%.3fsec,", + sugar,eg_f4.exectime+eg_f4.gctime); + nflist = nd_f4_red(m,l,0,s0vect,col,rp0,&l0); + if ( !l0 ) continue; + l = l0; + + /* over LF */ + bucket = create_pbucket(); + stat = nd_sp_f4(-2,1,l,bucket); + if ( !stat ) { + for ( t = l; NEXT(t); t = NEXT(t) ); + NEXT(t) = d; d = l; + d = nd_reconstruct(1,d); + continue; + } + if ( bucket->m < 0 ) continue; + col = nd_symbolic_preproc(bucket,1,&s0vect,&rp0); + if ( !col ) { + for ( t = l; NEXT(t); t = NEXT(t) ); + NEXT(t) = d; d = l; + d = nd_reconstruct(1,d); + continue; + } + nflist_lf = nd_f4_red(-2,l,1,s0vect,col,rp0,0); + /* adding new bases */ + for ( rm = nflist, r = nflist_lf; r && rm; rm = NEXT(rm), r = NEXT(r) ) { + nfv = (NDV)BDY(rm); + nfqv = (NDV)BDY(r); + if ( DL_COMPARE(HDL(nfv),HDL(nfqv)) ) return 0; + ndv_removecont(m,nfv); + ndv_removecont(-2,nfqv); + nh = ndv_newps(-2,nfv,nfqv,1); + d = update_pairs(d,g,nh,0); + g = update_base(g,nh); + } + if ( r || rm ) return 0; + } + conv_ilist(nd_demand,1,g,indp); + return g; +} +