version 1.127, 2005/08/03 05:01:01 |
version 1.147, 2006/11/27 07:54:41 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.126 2005/02/09 14:30:47 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.146 2006/11/27 07:31:25 noro Exp $ */ |
|
|
#include "nd.h" |
#include "nd.h" |
|
|
|
int diag_period = 6; |
int (*ndl_compare_function)(UINT *a1,UINT *a2); |
int (*ndl_compare_function)(UINT *a1,UINT *a2); |
int nd_dcomp; |
int nd_dcomp; |
NM _nm_free_list; |
NM _nm_free_list; |
ND _nd_free_list; |
ND _nd_free_list; |
ND_pairs _ndp_free_list; |
ND_pairs _ndp_free_list; |
|
|
|
static NODE nd_subst; |
|
static VL nd_vc; |
static int nd_ntrans; |
static int nd_ntrans; |
static int nd_nalg; |
static int nd_nalg; |
#if 0 |
#if 0 |
Line 47 NumberField get_numberfield(); |
|
Line 50 NumberField get_numberfield(); |
|
UINT *nd_det_compute_bound(NDV **dm,int n,int j); |
UINT *nd_det_compute_bound(NDV **dm,int n,int j); |
void nd_det_reconstruct(NDV **dm,int n,int j,NDV d); |
void nd_det_reconstruct(NDV **dm,int n,int j,NDV d); |
int nd_monic(int m,ND *p); |
int nd_monic(int m,ND *p); |
|
NDV plain_vect_to_ndv_q(Q *mat,int col,UINT *s0vect); |
|
|
void nd_free_private_storage() |
void nd_free_private_storage() |
{ |
{ |
Line 974 ND nd_add(int mod,ND p1,ND p2) |
|
Line 978 ND nd_add(int mod,ND p1,ND p2) |
|
int nm_destructive_add_q(NM *m1,NM *m2,NM *mr0,NM *mr) |
int nm_destructive_add_q(NM *m1,NM *m2,NM *mr0,NM *mr) |
{ |
{ |
NM s; |
NM s; |
Q t; |
P t; |
int can; |
int can; |
|
|
addq(CQ(*m1),CQ(*m2),&t); |
addp(nd_vc,CP(*m1),CP(*m2),&t); |
s = *m1; *m1 = NEXT(*m1); |
s = *m1; *m1 = NEXT(*m1); |
if ( t ) { |
if ( t ) { |
can = 1; NEXTNM2(*mr0,*mr,s); CQ(*mr) = (t); |
can = 1; NEXTNM2(*mr0,*mr,s); CP(*mr) = (t); |
} else { |
} else { |
can = 2; FREENM(s); |
can = 2; FREENM(s); |
} |
} |
Line 993 ND nd_add_q(ND p1,ND p2) |
|
Line 997 ND nd_add_q(ND p1,ND p2) |
|
int n,c,can; |
int n,c,can; |
ND r; |
ND r; |
NM m1,m2,mr0,mr,s; |
NM m1,m2,mr0,mr,s; |
Q t; |
P t; |
|
|
if ( !p1 ) return p2; |
if ( !p1 ) return p2; |
else if ( !p2 ) return p1; |
else if ( !p2 ) return p1; |
Line 1006 ND nd_add_q(ND p1,ND p2) |
|
Line 1010 ND nd_add_q(ND p1,ND p2) |
|
#if defined(__x86_64__) |
#if defined(__x86_64__) |
can += nm_destructive_add_q(&m1,&m2,&mr0,&mr); |
can += nm_destructive_add_q(&m1,&m2,&mr0,&mr); |
#else |
#else |
addq(CQ(m1),CQ(m2),&t); |
addp(nd_vc,CP(m1),CP(m2),&t); |
s = m1; m1 = NEXT(m1); |
s = m1; m1 = NEXT(m1); |
if ( t ) { |
if ( t ) { |
can++; NEXTNM2(mr0,mr,s); CQ(mr) = (t); |
can++; NEXTNM2(mr0,mr,s); CP(mr) = (t); |
} else { |
} else { |
can += 2; FREENM(s); |
can += 2; FREENM(s); |
} |
} |
Line 1086 ND nd_add_sf(ND p1,ND p2) |
|
Line 1090 ND nd_add_sf(ND p1,ND p2) |
|
} |
} |
} |
} |
|
|
|
ND nd_reduce2(int mod,ND d,ND g,NDV p,NM mul,NDC dn) |
|
{ |
|
int c,c1,c2; |
|
Q cg,cred,gcd,tq; |
|
P cgp,credp,gcdp; |
|
Obj tr,tr1; |
|
|
|
if ( mod == -1 ) |
|
CM(mul) = _mulsf(_invsf(HCM(p)),_chsgnsf(HCM(g))); |
|
else if ( mod ) { |
|
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
|
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
|
} else if ( nd_vc ) { |
|
ezgcdpz(nd_vc,HCP(g),HCP(p),&gcdp); |
|
divsp(nd_vc,HCP(g),gcdp,&cgp); divsp(nd_vc,HCP(p),gcdp,&credp); |
|
chsgnp(cgp,&CP(mul)); |
|
nd_mul_c_q(d,credp); nd_mul_c_q(g,credp); |
|
if ( dn ) { |
|
mulr(nd_vc,(Obj)dn->r,(Obj)credp,&tr); |
|
reductr(nd_vc,tr,&tr1); dn->r = (R)tr1; |
|
} |
|
} else { |
|
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
|
chsgnq(cg,&CQ(mul)); |
|
nd_mul_c_q(d,(P)cred); nd_mul_c_q(g,(P)cred); |
|
if ( dn ) { |
|
mulq(dn->z,cred,&tq); dn->z = tq; |
|
} |
|
} |
|
return nd_add(mod,g,ndv_mul_nm(mod,mul,p)); |
|
} |
|
|
/* ret=1 : success, ret=0 : overflow */ |
/* ret=1 : success, ret=0 : overflow */ |
int nd_nf(int mod,ND g,NDV *ps,int full,NDC dn,ND *rp) |
int nd_nf(int mod,ND d,ND g,NDV *ps,int full,NDC dn,ND *rp) |
{ |
{ |
ND d; |
|
NM m,mrd,tail; |
NM m,mrd,tail; |
NM mul; |
NM mul; |
int n,sugar,psugar,sugar0,stat,index; |
int n,sugar,psugar,sugar0,stat,index; |
Line 1098 int nd_nf(int mod,ND g,NDV *ps,int full,NDC dn,ND *rp) |
|
Line 1133 int nd_nf(int mod,ND g,NDV *ps,int full,NDC dn,ND *rp) |
|
NDV p,red; |
NDV p,red; |
Q cg,cred,gcd,tq,qq; |
Q cg,cred,gcd,tq,qq; |
double hmag; |
double hmag; |
|
P tp,tp1; |
|
Obj tr,tr1; |
|
|
if ( dn ) { |
if ( dn ) { |
if ( mod ) |
if ( mod ) |
dn->m = 1; |
dn->m = 1; |
|
else if ( nd_vc ) |
|
dn->r = (R)ONE; |
else |
else |
dn->z = ONE; |
dn->z = ONE; |
} |
} |
if ( !g ) { |
if ( !g ) { |
*rp = 0; |
*rp = d; |
return 1; |
return 1; |
} |
} |
if ( !mod ) hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
if ( !mod ) hmag = ((double)p_mag(HCP(g)))*nd_scale; |
|
|
sugar0 = sugar = SG(g); |
sugar0 = sugar = SG(g); |
n = NV(g); |
n = NV(g); |
mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); |
mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); |
for ( d = 0; g; ) { |
if ( d ) |
|
for ( tail = BDY(d); NEXT(tail); tail = NEXT(tail) ); |
|
for ( ; g; ) { |
index = ndl_find_reducer(HDL(g)); |
index = ndl_find_reducer(HDL(g)); |
if ( index >= 0 ) { |
if ( index >= 0 ) { |
h = nd_psh[index]; |
h = nd_psh[index]; |
Line 1123 int nd_nf(int mod,ND g,NDV *ps,int full,NDC dn,ND *rp) |
|
Line 1164 int nd_nf(int mod,ND g,NDV *ps,int full,NDC dn,ND *rp) |
|
nd_free(g); nd_free(d); |
nd_free(g); nd_free(d); |
return 0; |
return 0; |
} |
} |
if ( nd_demand ) |
p = nd_demand ? ndv_load(index) : ps[index]; |
p = ndv_load(index); |
g = nd_reduce2(mod,d,g,p,mul,dn); |
else |
|
p = ps[index]; |
|
if ( mod == -1 ) |
|
CM(mul) = _mulsf(_invsf(HCM(p)),_chsgnsf(HCM(g))); |
|
else if ( mod ) { |
|
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
|
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
|
} else { |
|
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
|
chsgnq(cg,&CQ(mul)); |
|
nd_mul_c_q(d,cred); nd_mul_c_q(g,cred); |
|
if ( dn ) { |
|
mulq(dn->z,cred,&tq); dn->z = tq; |
|
} |
|
} |
|
g = nd_add(mod,g,ndv_mul_nm(mod,mul,p)); |
|
sugar = MAX(sugar,SG(p)+TD(DL(mul))); |
sugar = MAX(sugar,SG(p)+TD(DL(mul))); |
if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) { |
if ( !mod && g && ((double)(p_mag(HCP(g))) > hmag) ) { |
tq = HCQ(g); |
tp = HCP(g); |
nd_removecont2(d,g); |
nd_removecont2(d,g); |
if ( dn ) { |
if ( dn ) { |
divq(tq,HCQ(g),&qq); divq(dn->z,qq,&tq); dn->z = tq; |
if ( nd_vc ) { |
|
divsp(nd_vc,tp,HCP(g),&tp1); |
|
divr(nd_vc,(Obj)dn->r,(Obj)tp1,&tr); |
|
reductr(nd_vc,(Obj)tr,&tr1); dn->r = (R)tr1; |
|
} else { |
|
divq((Q)tp,HCQ(g),&qq); |
|
divq(dn->z,qq,&tq); dn->z = tq; |
|
} |
} |
} |
hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
hmag = ((double)p_mag(HCP(g)))*nd_scale; |
} |
} |
} else if ( !full ) { |
} else if ( !full ) { |
*rp = g; |
*rp = g; |
Line 1229 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
Line 1261 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
} else { |
} else { |
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
chsgnq(cg,&CQ(mul)); |
chsgnq(cg,&CQ(mul)); |
nd_mul_c_q(d,cred); |
nd_mul_c_q(d,(P)cred); |
mulq_pbucket(bucket,cred); |
mulq_pbucket(bucket,cred); |
g = bucket->body[hindex]; |
g = bucket->body[hindex]; |
gmag = (double)p_mag((P)HCQ(g)); |
gmag = (double)p_mag((P)HCQ(g)); |
Line 1284 int ndv_check_candidate(NODE input,int obpe,int oadv,E |
|
Line 1316 int ndv_check_candidate(NODE input,int obpe,int oadv,E |
|
NODE t,s; |
NODE t,s; |
union oNDC dn; |
union oNDC dn; |
|
|
ndv_setup(0,0,cand); |
ndv_setup(0,0,cand,0); |
n = length(cand); |
n = length(cand); |
|
|
/* membercheck : list is a subset of Id(cand) ? */ |
/* membercheck : list is a subset of Id(cand) ? */ |
|
|
else |
else |
r = (NDV)BDY(t); |
r = (NDV)BDY(t); |
d = ndvtond(0,r); |
d = ndvtond(0,r); |
stat = nd_nf(0,d,nd_ps,0,0,&nf); |
stat = nd_nf(0,0,d,nd_ps,0,0,&nf); |
if ( !stat ) { |
if ( !stat ) { |
nd_reconstruct(0,0); |
nd_reconstruct(0,0); |
goto again; |
goto again; |
Line 1402 void mulq_pbucket(PGeoBucket g,Q c) |
|
Line 1434 void mulq_pbucket(PGeoBucket g,Q c) |
|
int k; |
int k; |
|
|
for ( k = 0; k <= g->m; k++ ) |
for ( k = 0; k <= g->m; k++ ) |
nd_mul_c_q(g->body[k],c); |
nd_mul_c_q(g->body[k],(P)c); |
} |
} |
|
|
NM remove_head_pbucket_symbolic(PGeoBucket g) |
NM remove_head_pbucket_symbolic(PGeoBucket g) |
Line 1544 int do_diagonalize(int sugar,int m) |
|
Line 1576 int do_diagonalize(int sugar,int m) |
|
ND h,nf,s,head; |
ND h,nf,s,head; |
NDV nfv; |
NDV nfv; |
Q q,num,den; |
Q q,num,den; |
union oNDC dn; |
P nm,nmp,dn,mnp,dnp; |
|
|
for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) { |
for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) { |
if ( nd_demand ) |
if ( nd_demand ) |
Line 1553 int do_diagonalize(int sugar,int m) |
|
Line 1585 int do_diagonalize(int sugar,int m) |
|
nfv = nd_ps[i]; |
nfv = nd_ps[i]; |
s = ndvtond(m,nfv); |
s = ndvtond(m,nfv); |
s = nd_separate_head(s,&head); |
s = nd_separate_head(s,&head); |
stat = nd_nf(m,s,nd_ps,1,&dn,&nf); |
stat = nd_nf(m,head,s,nd_ps,1,0,&nf); |
if ( !stat ) return 0; |
if ( !stat ) return 0; |
if ( !m ) { |
|
NTOQ(NM(dn.z),SGN(dn.z),num); |
|
mulq(HCQ(head),num,&q); HCQ(head) = q; |
|
if ( DN(dn.z) ) { |
|
NTOQ(DN(dn.z),1,den); |
|
nd_mul_c_q(nf,den); |
|
} |
|
} |
|
nf = nd_add(m,head,nf); |
|
ndv_free(nfv); |
ndv_free(nfv); |
nd_removecont(m,nf); |
nd_removecont(m,nf); |
nfv = ndtondv(m,nf); |
nfv = ndtondv(m,nf); |
Line 1590 NODE nd_gb(int m,int ishomo,int checkonly) |
|
Line 1613 NODE nd_gb(int m,int ishomo,int checkonly) |
|
NDV nfv; |
NDV nfv; |
Q q,num,den; |
Q q,num,den; |
union oNDC dn; |
union oNDC dn; |
|
int diag_count = 0; |
|
|
g = 0; d = 0; |
g = 0; d = 0; |
for ( i = 0; i < nd_psn; i++ ) { |
for ( i = 0; i < nd_psn; i++ ) { |
|
|
l = nd_minp(d,&d); |
l = nd_minp(d,&d); |
if ( SG(l) != sugar ) { |
if ( SG(l) != sugar ) { |
if ( ishomo ) { |
if ( ishomo ) { |
|
diag_count = 0; |
stat = do_diagonalize(sugar,m); |
stat = do_diagonalize(sugar,m); |
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
|
|
goto again; |
goto again; |
} |
} |
#if USE_GEOBUCKET |
#if USE_GEOBUCKET |
stat = m?nd_nf_pbucket(m,h,nd_ps,!Top,&nf):nd_nf(m,h,nd_ps,!Top,0,&nf); |
stat = m?nd_nf_pbucket(m,h,nd_ps,!Top,&nf):nd_nf(m,0,h,nd_ps,!Top,0,&nf); |
#else |
#else |
stat = nd_nf(m,h,nd_ps,!Top,0,&nf); |
stat = nd_nf(m,0,h,nd_ps,!Top,0,&nf); |
#endif |
#endif |
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
|
|
} |
} |
nfv = ndtondv(m,nf); nd_free(nf); |
nfv = ndtondv(m,nf); nd_free(nf); |
nh = ndv_newps(m,nfv,0); |
nh = ndv_newps(m,nfv,0); |
|
if ( !m && (ishomo && ++diag_count == diag_period) ) { |
|
diag_count = 0; |
|
stat = do_diagonalize(sugar,m); |
|
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(1,d); |
|
goto again; |
|
} |
|
} |
d = update_pairs(d,g,nh); |
d = update_pairs(d,g,nh); |
g = update_base(g,nh); |
g = update_base(g,nh); |
FREENDP(l); |
FREENDP(l); |
Line 1661 int do_diagonalize_trace(int sugar,int m) |
|
Line 1695 int do_diagonalize_trace(int sugar,int m) |
|
ND h,nf,nfq,s,head; |
ND h,nf,nfq,s,head; |
NDV nfv,nfqv; |
NDV nfv,nfqv; |
Q q,den,num; |
Q q,den,num; |
union oNDC dn; |
|
|
|
for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) { |
for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) { |
/* for nd_ps */ |
/* for nd_ps */ |
Line 1681 int do_diagonalize_trace(int sugar,int m) |
|
Line 1714 int do_diagonalize_trace(int sugar,int m) |
|
nfv = nd_ps_trace[i]; |
nfv = nd_ps_trace[i]; |
s = ndvtond(0,nfv); |
s = ndvtond(0,nfv); |
s = nd_separate_head(s,&head); |
s = nd_separate_head(s,&head); |
stat = nd_nf(0,s,nd_ps_trace,1,&dn,&nf); |
stat = nd_nf(0,head,s,nd_ps_trace,1,0,&nf); |
if ( !stat ) return 0; |
if ( !stat ) return 0; |
NTOQ(NM(dn.z),SGN(dn.z),num); |
|
mulq(HCQ(head),num,&q); HCQ(head) = q; |
|
if ( DN(dn.z) ) { |
|
NTOQ(DN(dn.z),1,den); |
|
nd_mul_c_q(nf,den); |
|
} |
|
nf = nd_add(0,head,nf); |
|
ndv_free(nfv); |
ndv_free(nfv); |
nd_removecont(0,nf); |
nd_removecont(0,nf); |
nfv = ndtondv(0,nf); |
nfv = ndtondv(0,nf); |
Line 1707 int do_diagonalize_trace(int sugar,int m) |
|
Line 1733 int do_diagonalize_trace(int sugar,int m) |
|
static struct oEGT eg_invdalg; |
static struct oEGT eg_invdalg; |
struct oEGT eg_le; |
struct oEGT eg_le; |
|
|
|
void nd_subst_vector(VL vl,P p,NODE subst,P *r) |
|
{ |
|
NODE tn; |
|
P p1; |
|
|
|
for ( tn = subst; tn; tn = NEXT(NEXT(tn)) ) { |
|
substp(vl,p,BDY(tn),BDY(NEXT(tn)),&p1); p = p1; |
|
} |
|
*r = p; |
|
} |
|
|
NODE nd_gb_trace(int m,int ishomo) |
NODE nd_gb_trace(int m,int ishomo) |
{ |
{ |
int i,nh,sugar,stat; |
int i,nh,sugar,stat; |
Line 1716 NODE nd_gb_trace(int m,int ishomo) |
|
Line 1753 NODE nd_gb_trace(int m,int ishomo) |
|
ND h,nf,nfq,s,head; |
ND h,nf,nfq,s,head; |
NDV nfv,nfqv; |
NDV nfv,nfqv; |
Q q,den,num; |
Q q,den,num; |
|
P hc; |
union oNDC dn; |
union oNDC dn; |
struct oEGT eg_monic,egm0,egm1; |
struct oEGT eg_monic,egm0,egm1; |
|
int diag_count = 0; |
|
|
init_eg(&eg_monic); |
init_eg(&eg_monic); |
init_eg(&eg_invdalg); |
init_eg(&eg_invdalg); |
Line 1732 NODE nd_gb_trace(int m,int ishomo) |
|
Line 1771 NODE nd_gb_trace(int m,int ishomo) |
|
again: |
again: |
l = nd_minp(d,&d); |
l = nd_minp(d,&d); |
if ( SG(l) != sugar ) { |
if ( SG(l) != sugar ) { |
|
#if 1 |
if ( ishomo ) { |
if ( ishomo ) { |
stat = do_diagonalize_trace(sugar,m); |
stat = do_diagonalize_trace(sugar,m); |
|
diag_count = 0; |
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
d = nd_reconstruct(1,d); |
d = nd_reconstruct(1,d); |
goto again; |
goto again; |
} |
} |
} |
} |
|
#endif |
sugar = SG(l); |
sugar = SG(l); |
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
} |
} |
|
|
#if USE_GEOBUCKET |
#if USE_GEOBUCKET |
stat = nd_nf_pbucket(m,h,nd_ps,!Top,&nf); |
stat = nd_nf_pbucket(m,h,nd_ps,!Top,&nf); |
#else |
#else |
stat = nd_nf(m,h,nd_ps,!Top,0,&nf); |
stat = nd_nf(m,0,h,nd_ps,!Top,0,&nf); |
#endif |
#endif |
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
|
|
} else |
} else |
nfq = 0; |
nfq = 0; |
if ( !nfq ) { |
if ( !nfq ) { |
if ( !nd_sp(0,1,l,&h) || !nd_nf(0,h,nd_ps_trace,!Top,0,&nfq) ) { |
if ( !nd_sp(0,1,l,&h) || !nd_nf(0,0,h,nd_ps_trace,!Top,0,&nfq) ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
d = nd_reconstruct(1,d); |
d = nd_reconstruct(1,d); |
goto again; |
goto again; |
|
|
} |
} |
if ( nfq ) { |
if ( nfq ) { |
/* m|HC(nfq) => failure */ |
/* m|HC(nfq) => failure */ |
if ( !rem(NM(HCQ(nfq)),m) ) return 0; |
if ( nd_vc ) { |
|
nd_subst_vector(nd_vc,HCP(nfq),nd_subst,&hc); q = (Q)hc; |
|
} else |
|
q = HCQ(nfq); |
|
if ( !rem(NM(q),m) ) return 0; |
|
|
if ( DP_Print ) { printf("+"); fflush(stdout); } |
if ( DP_Print ) { printf("+"); fflush(stdout); } |
if ( nd_nalg ) { |
if ( nd_nalg ) { |
|
|
nd_removecont(m,nf); nfv = ndtondv(m,nf); nd_free(nf); |
nd_removecont(m,nf); nfv = ndtondv(m,nf); nd_free(nf); |
} |
} |
nh = ndv_newps(0,nfv,nfqv); |
nh = ndv_newps(0,nfv,nfqv); |
|
if ( ishomo && ++diag_count == diag_period ) { |
|
diag_count = 0; |
|
stat = do_diagonalize_trace(sugar,m); |
|
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(1,d); |
|
goto again; |
|
} |
|
} |
d = update_pairs(d,g,nh); |
d = update_pairs(d,g,nh); |
g = update_base(g,nh); |
g = update_base(g,nh); |
} else { |
} else { |
Line 1839 NODE ndv_reduceall(int m,NODE f) |
|
Line 1894 NODE ndv_reduceall(int m,NODE f) |
|
(int (*)(const void *,const void *))ndv_compare); |
(int (*)(const void *,const void *))ndv_compare); |
for ( t = f, i = 0; t; i++, t = NEXT(t) ) BDY(t) = (pointer)w[i]; |
for ( t = f, i = 0; t; i++, t = NEXT(t) ) BDY(t) = (pointer)w[i]; |
#endif |
#endif |
ndv_setup(m,0,f); |
ndv_setup(m,0,f,0); |
for ( i = 0; i < n; ) { |
for ( i = 0; i < n; ) { |
g = ndvtond(m,nd_ps[i]); |
g = ndvtond(m,nd_ps[i]); |
g = nd_separate_head(g,&head); |
g = nd_separate_head(g,&head); |
stat = nd_nf(m,g,nd_ps,1,&dn,&nf); |
stat = nd_nf(m,head,g,nd_ps,1,0,&nf); |
if ( !stat ) |
if ( !stat ) |
nd_reconstruct(0,0); |
nd_reconstruct(0,0); |
else { |
else { |
if ( DP_Print ) { printf("."); fflush(stdout); } |
if ( DP_Print ) { printf("."); fflush(stdout); } |
if ( !m ) { |
|
NTOQ(NM(dn.z),SGN(dn.z),num); |
|
mulq(HCQ(head),num,&q); HCQ(head) = q; |
|
if ( DN(dn.z) ) { |
|
NTOQ(DN(dn.z),1,den); |
|
nd_mul_c_q(nf,den); |
|
} |
|
} |
|
nf = nd_add(m,head,nf); |
|
ndv_free(nd_ps[i]); |
ndv_free(nd_ps[i]); |
nd_removecont(m,nf); |
nd_removecont(m,nf); |
nd_ps[i] = ndtondv(m,nf); nd_free(nf); |
nd_ps[i] = ndtondv(m,nf); nd_free(nf); |
Line 2179 int ndv_newps(int m,NDV a,NDV aq) |
|
Line 2225 int ndv_newps(int m,NDV a,NDV aq) |
|
return nd_psn++; |
return nd_psn++; |
} |
} |
|
|
void ndv_setup(int mod,int trace,NODE f) |
void ndv_setup(int mod,int trace,NODE f,int dont_sort) |
{ |
{ |
int i,j,td,len,max; |
int i,j,td,len,max; |
NODE s,s0,f0; |
NODE s,s0,f0; |
Line 2193 void ndv_setup(int mod,int trace,NODE f) |
|
Line 2239 void ndv_setup(int mod,int trace,NODE f) |
|
for ( nd_psn = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) nd_psn++; |
for ( nd_psn = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) nd_psn++; |
w = (NDV *)ALLOCA(nd_psn*sizeof(NDV)); |
w = (NDV *)ALLOCA(nd_psn*sizeof(NDV)); |
for ( i = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) w[i++] = BDY(s); |
for ( i = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) w[i++] = BDY(s); |
qsort(w,nd_psn,sizeof(NDV), |
if ( !dont_sort ) { |
(int (*)(const void *,const void *))ndv_compare); |
/* XXX heuristic */ |
|
if ( !nd_ord->id && (nd_ord->ord.simple<2) ) |
|
qsort(w,nd_psn,sizeof(NDV), |
|
(int (*)(const void *,const void *))ndv_compare_rev); |
|
else |
|
qsort(w,nd_psn,sizeof(NDV), |
|
(int (*)(const void *,const void *))ndv_compare); |
|
} |
nd_pslen = 2*nd_psn; |
nd_pslen = 2*nd_psn; |
nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist)); |
nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist)); |
nd_bound = (UINT **)MALLOC(nd_pslen*sizeof(UINT *)); |
nd_bound = (UINT **)MALLOC(nd_pslen*sizeof(UINT *)); |
|
|
|
if ( trace && nd_vc ) |
|
makesubst(nd_vc,&nd_subst); |
|
else |
|
nd_subst = 0; |
|
|
if ( !nd_red ) |
if ( !nd_red ) |
nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist)); |
nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist)); |
for ( i = 0; i < REDTAB_LEN; i++ ) nd_red[i] = 0; |
for ( i = 0; i < REDTAB_LEN; i++ ) nd_red[i] = 0; |
Line 2343 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
Line 2401 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
NDV b; |
NDV b; |
int ishomo,nalg; |
int ishomo,nalg; |
Alg alpha,dp; |
Alg alpha,dp; |
P p; |
P p,zp; |
|
Q dmy; |
LIST f1,f2; |
LIST f1,f2; |
Obj obj; |
Obj obj; |
NumberField nf; |
NumberField nf; |
Line 2355 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
Line 2414 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
#if 0 |
#if 0 |
ndv_alloc = 0; |
ndv_alloc = 0; |
#endif |
#endif |
get_vars((Obj)f,&fv); pltovl(v,&vv); |
get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
switch ( ord->id ) { |
switch ( ord->id ) { |
case 1: |
case 1: |
Line 2389 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
Line 2448 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
nd_setup_parameters(nvar,max); |
nd_setup_parameters(nvar,max); |
ishomo = 1; |
ishomo = 1; |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
b = (pointer)ptondv(CO,vv,(P)BDY(t)); |
ptozp((P)BDY(t),1,&dmy,&zp); |
|
b = (pointer)ptondv(CO,vv,zp); |
if ( ishomo ) |
if ( ishomo ) |
ishomo = ishomo && ndv_ishomo(b); |
ishomo = ishomo && ndv_ishomo(b); |
if ( m ) ndv_mod(m,b); |
if ( m ) ndv_mod(m,b); |
if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; } |
if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; } |
} |
} |
if ( fd0 ) NEXT(fd) = 0; |
if ( fd0 ) NEXT(fd) = 0; |
ndv_setup(m,0,fd0); |
ndv_setup(m,0,fd0,0); |
x = f4?nd_f4(m):nd_gb(m,ishomo,0); |
x = f4?nd_f4(m):nd_gb(m,ishomo,0); |
nd_demand = 0; |
nd_demand = 0; |
x = ndv_reducebase(x); |
x = ndv_reducebase(x); |
Line 2422 void nd_gr_postproc(LIST f,LIST v,int m,struct order_s |
|
Line 2482 void nd_gr_postproc(LIST f,LIST v,int m,struct order_s |
|
NDV b; |
NDV b; |
int ishomo,nalg; |
int ishomo,nalg; |
Alg alpha,dp; |
Alg alpha,dp; |
P p; |
P p,zp; |
|
Q dmy; |
LIST f1,f2; |
LIST f1,f2; |
Obj obj; |
Obj obj; |
NumberField nf; |
NumberField nf; |
struct order_spec *ord1; |
struct order_spec *ord1; |
|
|
get_vars((Obj)f,&fv); pltovl(v,&vv); |
get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
switch ( ord->id ) { |
switch ( ord->id ) { |
case 1: |
case 1: |
Line 2462 void nd_gr_postproc(LIST f,LIST v,int m,struct order_s |
|
Line 2523 void nd_gr_postproc(LIST f,LIST v,int m,struct order_s |
|
nd_setup_parameters(nvar,max); |
nd_setup_parameters(nvar,max); |
ishomo = 1; |
ishomo = 1; |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
b = (pointer)ptondv(CO,vv,(P)BDY(t)); |
ptozp((P)BDY(t),1,&dmy,&zp); |
|
b = (pointer)ptondv(CO,vv,zp); |
if ( ishomo ) |
if ( ishomo ) |
ishomo = ishomo && ndv_ishomo(b); |
ishomo = ishomo && ndv_ishomo(b); |
if ( m ) ndv_mod(m,b); |
if ( m ) ndv_mod(m,b); |
if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; } |
if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; } |
} |
} |
if ( fd0 ) NEXT(fd) = 0; |
if ( fd0 ) NEXT(fd) = 0; |
ndv_setup(m,0,fd0); |
ndv_setup(m,0,fd0,0); |
for ( x = 0, i = 0; i < nd_psn; i++ ) |
for ( x = 0, i = 0; i < nd_psn; i++ ) |
x = update_base(x,i); |
x = update_base(x,i); |
if ( do_check ) { |
if ( do_check ) { |
Line 2494 void nd_gr_postproc(LIST f,LIST v,int m,struct order_s |
|
Line 2556 void nd_gr_postproc(LIST f,LIST v,int m,struct order_s |
|
MKLIST(*rp,r0); |
MKLIST(*rp,r0); |
} |
} |
|
|
void nd_gr_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp) |
void nd_gr_trace(LIST f,LIST v,int trace,int homo,int f4,struct order_spec *ord,LIST *rp) |
{ |
{ |
VL tv,fv,vv,vc,av; |
VL tv,fv,vv,vc,av; |
NODE fd,fd0,in0,in,r,r0,t,s,cand,alist; |
NODE fd,fd0,in0,in,r,r0,t,s,cand,alist; |
int m,nocheck,nvar,mindex,e,max; |
int m,nocheck,nvar,mindex,e,max; |
NDV c; |
NDV c; |
NMV a; |
NMV a; |
P p; |
P p,zp; |
|
Q dmy; |
EPOS oepos; |
EPOS oepos; |
int obpe,oadv,wmax,i,len,cbpe,ishomo,nalg; |
int obpe,oadv,wmax,i,len,cbpe,ishomo,nalg; |
Alg alpha,dp; |
Alg alpha,dp; |
Line 2510 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
Line 2573 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
Obj obj; |
Obj obj; |
NumberField nf; |
NumberField nf; |
struct order_spec *ord1; |
struct order_spec *ord1; |
|
struct oEGT eg_check,eg0,eg1; |
|
|
get_vars((Obj)f,&fv); pltovl(v,&vv); |
get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
switch ( ord->id ) { |
switch ( ord->id ) { |
case 1: |
case 1: |
Line 2556 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
Line 2620 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos; |
obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos; |
ishomo = 1; |
ishomo = 1; |
for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
c = ptondv(CO,vv,(P)BDY(t)); |
ptozp((P)BDY(t),1,&dmy,&zp); |
|
c = (pointer)ptondv(CO,vv,zp); |
if ( ishomo ) |
if ( ishomo ) |
ishomo = ishomo && ndv_ishomo(c); |
ishomo = ishomo && ndv_ishomo(c); |
if ( c ) { |
if ( c ) { |
Line 2581 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
Line 2646 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
while ( 1 ) { |
while ( 1 ) { |
if ( Demand ) |
if ( Demand ) |
nd_demand = 1; |
nd_demand = 1; |
ndv_setup(m,1,fd0); |
ndv_setup(m,1,fd0,0); |
cand = nd_gb_trace(m,ishomo || homo); |
cand = f4?nd_f4_trace(m):nd_gb_trace(m,ishomo || homo); |
if ( !cand ) { |
if ( !cand ) { |
/* failure */ |
/* failure */ |
if ( trace > 1 ) { *rp = 0; return; } |
if ( trace > 1 ) { *rp = 0; return; } |
Line 2601 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
Line 2666 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
cbpe = nd_bpe; |
cbpe = nd_bpe; |
if ( nocheck ) |
if ( nocheck ) |
break; |
break; |
|
get_eg(&eg0); |
if ( ndv_check_candidate(in0,obpe,oadv,oepos,cand) ) |
if ( ndv_check_candidate(in0,obpe,oadv,oepos,cand) ) |
/* success */ |
/* success */ |
break; |
break; |
Line 2620 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
Line 2686 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
} |
} |
} |
} |
} |
} |
|
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); |
/* dp->p */ |
/* dp->p */ |
nd_bpe = cbpe; |
nd_bpe = cbpe; |
nd_setup_parameters(nd_nvar,0); |
nd_setup_parameters(nd_nvar,0); |
Line 2756 void nd_removecont(int mod,ND p) |
|
Line 2825 void nd_removecont(int mod,ND p) |
|
v.len = n; |
v.len = n; |
v.body = (pointer *)w; |
v.body = (pointer *)w; |
for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m); |
for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m); |
removecont_array(w,n); |
removecont_array((P *)w,n); |
for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CQ(m) = w[i]; |
for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CQ(m) = w[i]; |
} |
} |
} |
} |
Line 2783 void nd_removecont2(ND p1,ND p2) |
|
Line 2852 void nd_removecont2(ND p1,ND p2) |
|
v.body = (pointer *)w; |
v.body = (pointer *)w; |
for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) w[i] = CQ(m); |
for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) w[i] = CQ(m); |
for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CQ(m); |
for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CQ(m); |
removecont_array(w,n); |
removecont_array((P *)w,n); |
for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) CQ(m) = w[i]; |
for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) CQ(m) = w[i]; |
for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CQ(m) = w[i]; |
for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CQ(m) = w[i]; |
} |
} |
|
|
void ndv_removecont(int mod,NDV p) |
void ndv_removecont(int mod,NDV p) |
{ |
{ |
int i,len; |
int i,len,all_p; |
Q *w; |
Q *c; |
|
P *w; |
Q dvr,t; |
Q dvr,t; |
|
P g,cont,tp; |
NMV m; |
NMV m; |
|
|
if ( mod == -1 ) |
if ( mod == -1 ) |
Line 2801 void ndv_removecont(int mod,NDV p) |
|
Line 2872 void ndv_removecont(int mod,NDV p) |
|
ndv_mul_c(mod,p,invm(HCM(p),mod)); |
ndv_mul_c(mod,p,invm(HCM(p),mod)); |
else { |
else { |
len = p->len; |
len = p->len; |
w = (Q *)ALLOCA(len*sizeof(Q)); |
w = (P *)ALLOCA(len*sizeof(P)); |
for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) w[i] = CQ(m); |
c = (Q *)ALLOCA(len*sizeof(Q)); |
sortbynm(w,len); |
for ( m = BDY(p), all_p = 1, i = 0; i < len; NMV_ADV(m), i++ ) { |
qltozl(w,len,&dvr); |
ptozp(CP(m),1,&c[i],&w[i]); |
for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) { |
all_p = all_p && !NUM(w[i]); |
divq(CQ(m),dvr,&t); CQ(m) = t; |
|
} |
} |
|
if ( all_p ) { |
|
qltozl(c,len,&dvr); heu_nezgcdnpz(nd_vc,w,len,&g); |
|
mulp(nd_vc,(P)dvr,g,&cont); |
|
for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) { |
|
divsp(nd_vc,CP(m),cont,&tp); CP(m) = tp; |
|
} |
|
} else { |
|
sortbynm((Q *)c,len); |
|
qltozl((Q *)c,len,&dvr); |
|
for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) { |
|
divsp(nd_vc,CP(m),(P)dvr,&tp); CP(m) = tp; |
|
} |
|
} |
} |
} |
} |
} |
|
|
Line 2857 void ndv_dehomogenize(NDV p,struct order_spec *ord) |
|
Line 2940 void ndv_dehomogenize(NDV p,struct order_spec *ord) |
|
NV(p)--; |
NV(p)--; |
} |
} |
|
|
void removecont_array(Q *c,int n) |
void removecont_array(P *p,int n) |
{ |
{ |
|
int all_p,all_q,i; |
|
Q *c; |
|
P *w; |
|
P t,s; |
|
|
|
for ( all_q = 1, i = 0; i < n; i++ ) |
|
all_q = all_q && NUM(p[i]); |
|
if ( all_q ) { |
|
removecont_array_q((Q *)p,n); |
|
} else { |
|
c = (Q *)ALLOCA(n*sizeof(Q)); |
|
w = (P *)ALLOCA(n*sizeof(P)); |
|
for ( i = 0; i < n; i++ ) { |
|
ptozp(p[i],1,&c[i],&w[i]); |
|
} |
|
removecont_array_q(c,n); |
|
heu_nezgcdnpz(nd_vc,w,n,&t); |
|
for ( i = 0; i < n; i++ ) { |
|
divsp(nd_vc,w[i],t,&s); mulp(nd_vc,s,(P)c[i],&p[i]); |
|
} |
|
} |
|
} |
|
|
|
void removecont_array_q(Q *c,int n) |
|
{ |
struct oVECT v; |
struct oVECT v; |
Q d0,d1,a,u,u1,gcd; |
Q d0,d1,a,u,u1,gcd; |
int i,j; |
int i,j; |
Line 2908 void nd_mul_c(int mod,ND p,int mul) |
|
Line 3016 void nd_mul_c(int mod,ND p,int mul) |
|
} |
} |
} |
} |
|
|
void nd_mul_c_q(ND p,Q mul) |
void nd_mul_c_q(ND p,P mul) |
{ |
{ |
NM m; |
NM m; |
Q c; |
P c; |
|
|
if ( !p ) return; |
if ( !p ) return; |
if ( UNIQ(mul) ) return; |
if ( UNIQ(mul) ) return; |
for ( m = BDY(p); m; m = NEXT(m) ) { |
for ( m = BDY(p); m; m = NEXT(m) ) { |
mulq(CQ(m),mul,&c); CQ(m) = c; |
mulp(nd_vc,CP(m),mul,&c); CP(m) = c; |
} |
} |
} |
} |
|
|
Line 3230 int nd_sp(int mod,int trace,ND_pairs p,ND *rp) |
|
Line 3338 int nd_sp(int mod,int trace,ND_pairs p,ND *rp) |
|
t1 = ndv_mul_nm(mod,m,p1); |
t1 = ndv_mul_nm(mod,m,p1); |
if ( mod == -1 ) CM(m) = _chsgnsf(HCM(p1)); |
if ( mod == -1 ) CM(m) = _chsgnsf(HCM(p1)); |
else if ( mod ) CM(m) = mod-HCM(p1); |
else if ( mod ) CM(m) = mod-HCM(p1); |
else chsgnq(HCQ(p1),&CQ(m)); |
else chsgnp(HCP(p1),&CP(m)); |
ndl_sub(lcm,HDL(p2),DL(m)); |
ndl_sub(lcm,HDL(p2),DL(m)); |
if ( ndl_check_bound2(p->i2,DL(m)) ) { |
if ( ndl_check_bound2(p->i2,DL(m)) ) { |
nd_free(t1); |
nd_free(t1); |
Line 3440 ND ndv_mul_nm(int mod,NM m0,NDV p) |
|
Line 3548 ND ndv_mul_nm(int mod,NM m0,NDV p) |
|
NMV m; |
NMV m; |
UINT *d,*dt,*dm; |
UINT *d,*dt,*dm; |
int c,n,td,i,c1,c2,len; |
int c,n,td,i,c1,c2,len; |
Q q; |
P q; |
ND r; |
ND r; |
|
|
if ( !p ) return 0; |
if ( !p ) return 0; |
Line 3472 ND ndv_mul_nm(int mod,NM m0,NDV p) |
|
Line 3580 ND ndv_mul_nm(int mod,NM m0,NDV p) |
|
ndl_add(DL(m),d,DL(mr)); |
ndl_add(DL(m),d,DL(mr)); |
} |
} |
} else { |
} else { |
q = CQ(m0); |
q = CP(m0); |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
NEXTNM(mr0,mr); |
NEXTNM(mr0,mr); |
mulq(CQ(m),q,&CQ(mr)); |
mulp(nd_vc,CP(m),q,&CP(mr)); |
ndl_add(DL(m),d,DL(mr)); |
ndl_add(DL(m),d,DL(mr)); |
} |
} |
} |
} |
Line 3618 void ndv_mod(int mod,NDV p) |
|
Line 3726 void ndv_mod(int mod,NDV p) |
|
NMV t,d; |
NMV t,d; |
int r,s,u; |
int r,s,u; |
int i,len,dlen; |
int i,len,dlen; |
|
P cp; |
|
Q c; |
Obj gfs; |
Obj gfs; |
|
|
if ( !p ) return; |
if ( !p ) return; |
Line 3634 void ndv_mod(int mod,NDV p) |
|
Line 3744 void ndv_mod(int mod,NDV p) |
|
} |
} |
else |
else |
for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) { |
for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) { |
r = rem(NM(CQ(t)),mod); |
if ( nd_vc ) { |
|
nd_subst_vector(nd_vc,CP(t),nd_subst,&cp); |
|
c = (Q)cp; |
|
} else |
|
c = CQ(t); |
|
r = rem(NM(c),mod); |
if ( r ) { |
if ( r ) { |
if ( SGN(CQ(t)) < 0 ) |
if ( SGN(c) < 0 ) |
r = mod-r; |
r = mod-r; |
if ( DN(CQ(t)) ) { |
if ( DN(c) ) { |
s = rem(DN(CQ(t)),mod); |
s = rem(DN(c),mod); |
if ( !s ) |
if ( !s ) |
error("ndv_mod : division by 0"); |
error("ndv_mod : division by 0"); |
s = invm(s,mod); |
s = invm(s,mod); |
Line 3999 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
Line 4114 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
VL vv,tv; |
VL vv,tv; |
int stat,nvar,max,e; |
int stat,nvar,max,e; |
union oNDC dn; |
union oNDC dn; |
|
Q cont; |
|
P pp; |
|
|
if ( !f ) { |
if ( !f ) { |
*rp = 0; |
*rp = 0; |
Line 4024 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
Line 4141 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
/* conversion to ndv */ |
/* conversion to ndv */ |
for ( in0 = 0, t = BDY(g); t; t = NEXT(t) ) { |
for ( in0 = 0, t = BDY(g); t; t = NEXT(t) ) { |
NEXTNODE(in0,in); |
NEXTNODE(in0,in); |
BDY(in) = (pointer)ptondv(CO,vv,(P)BDY(t)); |
ptozp((P)BDY(t),1,&cont,&pp); |
|
BDY(in) = (pointer)ptondv(CO,vv,pp); |
if ( m ) ndv_mod(m,(NDV)BDY(in)); |
if ( m ) ndv_mod(m,(NDV)BDY(in)); |
} |
} |
NEXTNODE(in0,in); |
NEXTNODE(in0,in); |
Line 4032 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
Line 4150 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
if ( m ) ndv_mod(m,(NDV)BDY(in)); |
if ( m ) ndv_mod(m,(NDV)BDY(in)); |
NEXT(in) = 0; |
NEXT(in) = 0; |
|
|
ndv_setup(m,0,in0); |
/* dont sort */ |
|
ndv_setup(m,0,in0,1); |
nd_psn--; |
nd_psn--; |
nd_scale=2; |
nd_scale=2; |
while ( 1 ) { |
while ( 1 ) { |
nd = (pointer)ndvtond(m,nd_ps[nd_psn]); |
nd = (pointer)ndvtond(m,nd_ps[nd_psn]); |
stat = nd_nf(m,nd,nd_ps,1,0,&nf); |
stat = nd_nf(m,0,nd,nd_ps,1,0,&nf); |
if ( !stat ) { |
if ( !stat ) { |
nd_psn++; |
nd_psn++; |
nd_reconstruct(0,0); |
nd_reconstruct(0,0); |
Line 4080 int nd_to_vect_q(UINT *s0,int n,ND d,Q *r) |
|
Line 4199 int nd_to_vect_q(UINT *s0,int n,ND d,Q *r) |
|
return i; |
return i; |
} |
} |
|
|
|
Q *nm_ind_pair_to_vect(int mod,UINT *s0,int n,NM_ind_pair pair) |
|
{ |
|
NM m; |
|
NMV mr; |
|
UINT *d,*t,*s; |
|
NDV p; |
|
int i,j,len; |
|
Q *r; |
|
|
|
m = pair->mul; |
|
d = DL(m); |
|
p = nd_ps[pair->index]; |
|
len = LEN(p); |
|
r = (Q *)CALLOC(n,sizeof(Q)); |
|
t = (UINT *)ALLOCA(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++ ); |
|
r[i] = CQ(mr); |
|
} |
|
return r; |
|
} |
|
|
IndArray nm_ind_pair_to_vect_compress(int mod,UINT *s0,int n,NM_ind_pair pair) |
IndArray nm_ind_pair_to_vect_compress(int mod,UINT *s0,int n,NM_ind_pair pair) |
{ |
{ |
NM m; |
NM m; |
Line 4128 IndArray nm_ind_pair_to_vect_compress(int mod,UINT *s0 |
|
Line 4270 IndArray nm_ind_pair_to_vect_compress(int mod,UINT *s0 |
|
return r; |
return r; |
} |
} |
|
|
|
int compress_array(Q *svect,Q *cvect,int n) |
|
{ |
|
int i,j; |
|
|
int ndv_reduce_vect_q(Q *svect,int col,IndArray *imat,NM_ind_pair *rp0,int nred) |
for ( i = j = 0; i < n; i++ ) |
|
if ( svect[i] ) cvect[j++] = svect[i]; |
|
return j; |
|
} |
|
|
|
void expand_array(Q *svect,Q *cvect,int n) |
{ |
{ |
int i,j,k,len,pos,prev; |
int i,j; |
|
|
|
for ( i = j = 0; j < n; i++ ) |
|
if ( svect[i] ) svect[i] = cvect[j++]; |
|
} |
|
|
|
int ndv_reduce_vect_q(Q *svect,int trace,int col,IndArray *imat,NM_ind_pair *rp0,int nred) |
|
{ |
|
int i,j,k,len,pos,prev,nz; |
Q cs,mcs,c1,c2,cr,gcd,t; |
Q cs,mcs,c1,c2,cr,gcd,t; |
IndArray ivect; |
IndArray ivect; |
unsigned char *ivc; |
unsigned char *ivc; |
Line 4141 int ndv_reduce_vect_q(Q *svect,int col,IndArray *imat, |
|
Line 4299 int ndv_reduce_vect_q(Q *svect,int col,IndArray *imat, |
|
NMV mr; |
NMV mr; |
NODE rp; |
NODE rp; |
int maxrs; |
int maxrs; |
|
double hmag; |
|
Q *cvect; |
|
|
maxrs = 0; |
maxrs = 0; |
|
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)); |
for ( i = 0; i < nred; i++ ) { |
for ( i = 0; i < nred; i++ ) { |
ivect = imat[i]; |
ivect = imat[i]; |
k = ivect->head; |
k = ivect->head; |
if ( svect[k] ) { |
if ( svect[k] ) { |
maxrs = MAX(maxrs,rp0[i]->sugar); |
maxrs = MAX(maxrs,rp0[i]->sugar); |
redv = nd_ps[rp0[i]->index]; |
redv = trace?nd_ps_trace[rp0[i]->index]:nd_ps[rp0[i]->index]; |
len = LEN(redv); mr = BDY(redv); |
len = LEN(redv); mr = BDY(redv); |
igcd_cofactor(svect[k],CQ(mr),&gcd,&cs,&cr); |
igcd_cofactor(svect[k],CQ(mr),&gcd,&cs,&cr); |
chsgnq(cs,&mcs); |
chsgnq(cs,&mcs); |
Line 4181 int ndv_reduce_vect_q(Q *svect,int col,IndArray *imat, |
|
Line 4345 int ndv_reduce_vect_q(Q *svect,int col,IndArray *imat, |
|
} |
} |
break; |
break; |
} |
} |
|
for ( j = k+1; j < col && !svect[j]; j++ ); |
|
if ( j == col ) break; |
|
if ( hmag && ((double)p_mag((P)svect[j]) > hmag) ) { |
|
nz = compress_array(svect,cvect,col); |
|
removecont_array((P *)cvect,nz); |
|
expand_array(svect,cvect,nz); |
|
hmag = ((double)p_mag((P)svect[j]))*nd_scale; |
|
} |
} |
} |
} |
} |
|
nz = compress_array(svect,cvect,col); |
|
removecont_array((P *)cvect,nz); |
|
expand_array(svect,cvect,nz); |
|
if ( DP_Print ) { |
|
fprintf(asir_out,"-"); fflush(asir_out); |
|
} |
return maxrs; |
return maxrs; |
} |
} |
|
|
Line 4325 NDV vect_to_ndv(UINT *vect,int spcol,int col,int *rhea |
|
Line 4503 NDV vect_to_ndv(UINT *vect,int spcol,int col,int *rhea |
|
} |
} |
} |
} |
|
|
|
/* for preprocessed vector */ |
|
|
NDV vect_to_ndv_q(Q *vect,int spcol,int col,int *rhead,UINT *s0vect) |
NDV vect_to_ndv_q(Q *vect,int spcol,int col,int *rhead,UINT *s0vect) |
{ |
{ |
int j,k,len; |
int j,k,len; |
Line 4355 NDV vect_to_ndv_q(Q *vect,int spcol,int col,int *rhead |
|
Line 4535 NDV vect_to_ndv_q(Q *vect,int spcol,int col,int *rhead |
|
} |
} |
} |
} |
|
|
int nd_sp_f4(int m,ND_pairs l,PGeoBucket bucket) |
/* for plain vector */ |
|
|
|
NDV plain_vect_to_ndv_q(Q *vect,int col,UINT *s0vect) |
{ |
{ |
|
int j,k,len; |
|
UINT *p; |
|
Q c; |
|
NDV r; |
|
NMV mr0,mr; |
|
|
|
for ( j = 0, len = 0; j < col; j++ ) if ( vect[j] ) len++; |
|
if ( !len ) return 0; |
|
else { |
|
mr0 = (NMV)GC_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, k++ ) |
|
if ( c = vect[k] ) { |
|
if ( DN(c) ) |
|
error("afo"); |
|
ndl_copy(p,DL(mr)); CQ(mr) = c; NMV_ADV(mr); |
|
} |
|
MKNDV(nd_nvar,mr0,len,r); |
|
return r; |
|
} |
|
} |
|
|
|
int nd_sp_f4(int m,int trace,ND_pairs l,PGeoBucket bucket) |
|
{ |
ND_pairs t; |
ND_pairs t; |
NODE sp0,sp; |
NODE sp0,sp; |
int stat; |
int stat; |
ND spol; |
ND spol; |
|
|
for ( t = l; t; t = NEXT(t) ) { |
for ( t = l; t; t = NEXT(t) ) { |
stat = nd_sp(m,0,t,&spol); |
stat = nd_sp(m,trace,t,&spol); |
if ( !stat ) return 0; |
if ( !stat ) return 0; |
if ( spol ) { |
if ( spol ) { |
add_pbucket_symbolic(bucket,spol); |
add_pbucket_symbolic(bucket,spol); |
Line 4372 int nd_sp_f4(int m,ND_pairs l,PGeoBucket bucket) |
|
Line 4582 int nd_sp_f4(int m,ND_pairs l,PGeoBucket bucket) |
|
return 1; |
return 1; |
} |
} |
|
|
int nd_symbolic_preproc(PGeoBucket bucket,UINT **s0vect,NODE *r) |
int nd_symbolic_preproc(PGeoBucket bucket,int trace,UINT **s0vect,NODE *r) |
{ |
{ |
NODE rp0,rp; |
NODE rp0,rp; |
NM mul,head,s0,s; |
NM mul,head,s0,s; |
Line 4381 int nd_symbolic_preproc(PGeoBucket bucket,UINT **s0vec |
|
Line 4591 int nd_symbolic_preproc(PGeoBucket bucket,UINT **s0vec |
|
UINT *s0v,*p; |
UINT *s0v,*p; |
NM_ind_pair pair; |
NM_ind_pair pair; |
ND red; |
ND red; |
|
NDV *ps; |
|
|
s0 = 0; rp0 = 0; col = 0; |
s0 = 0; rp0 = 0; col = 0; |
|
ps = trace?nd_ps_trace:nd_ps; |
while ( 1 ) { |
while ( 1 ) { |
head = remove_head_pbucket_symbolic(bucket); |
head = remove_head_pbucket_symbolic(bucket); |
if ( !head ) break; |
if ( !head ) break; |
Line 4395 int nd_symbolic_preproc(PGeoBucket bucket,UINT **s0vec |
|
Line 4607 int nd_symbolic_preproc(PGeoBucket bucket,UINT **s0vec |
|
NEWNM(mul); |
NEWNM(mul); |
ndl_sub(DL(head),DL(h),DL(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(nd_ps[index]); |
sugar = TD(DL(mul))+SG(ps[index]); |
MKNM_ind_pair(pair,mul,index,sugar); |
MKNM_ind_pair(pair,mul,index,sugar); |
red = ndv_mul_nm_symbolic(mul,nd_ps[index]); |
red = ndv_mul_nm_symbolic(mul,ps[index]); |
add_pbucket_symbolic(bucket,nd_remove_head(red)); |
add_pbucket_symbolic(bucket,nd_remove_head(red)); |
NEXTNODE(rp0,rp); BDY(rp) = (pointer)pair; |
NEXTNODE(rp0,rp); BDY(rp) = (pointer)pair; |
} |
} |
Line 4447 NODE nd_f4(int m) |
|
Line 4659 NODE nd_f4(int m) |
|
l = nd_minsugarp(d,&d); |
l = nd_minsugarp(d,&d); |
sugar = SG(l); |
sugar = SG(l); |
bucket = create_pbucket(); |
bucket = create_pbucket(); |
stat = nd_sp_f4(m,l,bucket); |
stat = nd_sp_f4(m,0,l,bucket); |
if ( !stat ) { |
if ( !stat ) { |
for ( t = l; NEXT(t); t = NEXT(t) ); |
for ( t = l; NEXT(t); t = NEXT(t) ); |
NEXT(t) = d; d = l; |
NEXT(t) = d; d = l; |
Line 4455 NODE nd_f4(int m) |
|
Line 4667 NODE nd_f4(int m) |
|
continue; |
continue; |
} |
} |
if ( bucket->m < 0 ) continue; |
if ( bucket->m < 0 ) continue; |
col = nd_symbolic_preproc(bucket,&s0vect,&rp0); |
col = nd_symbolic_preproc(bucket,0,&s0vect,&rp0); |
if ( !col ) { |
if ( !col ) { |
for ( t = l; NEXT(t); t = NEXT(t) ); |
for ( t = l; NEXT(t); t = NEXT(t) ); |
NEXT(t) = d; d = l; |
NEXT(t) = d; d = l; |
Line 4467 NODE nd_f4(int m) |
|
Line 4679 NODE nd_f4(int m) |
|
fprintf(asir_out,"sugar=%d,symb=%fsec,", |
fprintf(asir_out,"sugar=%d,symb=%fsec,", |
sugar,eg_f4.exectime+eg_f4.gctime); |
sugar,eg_f4.exectime+eg_f4.gctime); |
if ( 1 ) |
if ( 1 ) |
nflist = nd_f4_red(m,l,s0vect,col,rp0); |
nflist = nd_f4_red(m,l,0,s0vect,col,rp0,0); |
else |
else |
nflist = nd_f4_red_dist(m,l,s0vect,col,rp0); |
nflist = nd_f4_red_dist(m,l,s0vect,col,rp0,0); |
/* adding new bases */ |
/* adding new bases */ |
for ( r = nflist; r; r = NEXT(r) ) { |
for ( r = nflist; r; r = NEXT(r) ) { |
nf = (NDV)BDY(r); |
nf = (NDV)BDY(r); |
ndv_removecont(m,nf); |
ndv_removecont(m,nf); |
|
if ( !m && nd_nalg ) { |
|
ND nf1; |
|
|
|
nf1 = ndvtond(m,nf); |
|
nd_monic(0,&nf1); |
|
nd_removecont(m,nf1); |
|
nf = ndtondv(m,nf1); |
|
} |
nh = ndv_newps(m,nf,0); |
nh = ndv_newps(m,nf,0); |
d = update_pairs(d,g,nh); |
d = update_pairs(d,g,nh); |
g = update_base(g,nh); |
g = update_base(g,nh); |
Line 4486 NODE nd_f4(int m) |
|
Line 4706 NODE nd_f4(int m) |
|
return g; |
return g; |
} |
} |
|
|
NODE nd_f4_red(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0) |
NODE nd_f4_trace(int m) |
{ |
{ |
|
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; |
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); |
|
g = update_base(g,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; |
|
|
|
/* over Q */ |
|
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); |
|
/* 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; |
|
|
|
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); |
|
g = update_base(g,nh); |
|
} |
|
} |
|
for ( r = g; r; r = NEXT(r) ) BDY(r) = (pointer)nd_ps_trace[(int)BDY(r)]; |
|
#if 0 |
|
fprintf(asir_out,"ndv_alloc=%d\n",ndv_alloc); |
|
#endif |
|
return g; |
|
} |
|
|
|
NODE nd_f4_red(int m,ND_pairs sp0,int trace,UINT *s0vect,int col,NODE rp0,ND_pairs *nz) |
|
{ |
|
IndArray *imat; |
int nsp,nred,i; |
int nsp,nred,i; |
int *rhead; |
int *rhead; |
NODE r0,rp; |
NODE r0,rp; |
Line 4509 NODE nd_f4_red(int m,ND_pairs sp0,UINT *s0vect,int col |
|
Line 4829 NODE nd_f4_red(int m,ND_pairs sp0,UINT *s0vect,int col |
|
rhead[imat[i]->head] = 1; |
rhead[imat[i]->head] = 1; |
} |
} |
if ( m ) |
if ( m ) |
r0 = nd_f4_red_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred); |
r0 = nd_f4_red_main(m,sp0,nsp,s0vect,col,rvect,rhead,imat,nred,nz); |
else |
else |
r0 = nd_f4_red_q_main(sp0,nsp,s0vect,col,rvect,rhead,imat,nred); |
r0 = nd_f4_red_q_main(sp0,nsp,trace,s0vect,col,rvect,rhead,imat,nred); |
return r0; |
return r0; |
} |
} |
|
|
NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s0vect,int col, |
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) |
NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred,ND_pairs *nz) |
{ |
{ |
int spcol,sprow,a; |
int spcol,sprow,a; |
int i,j,k,l,rank; |
int i,j,k,l,rank; |
Line 4529 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
Line 4849 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2; |
struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2; |
int maxrs; |
int maxrs; |
int *spsugar; |
int *spsugar; |
|
ND_pairs *spactive; |
|
|
spcol = col-nred; |
spcol = col-nred; |
get_eg(&eg0); |
get_eg(&eg0); |
Line 4536 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
Line 4857 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
spmat = (int **)ALLOCA(nsp*sizeof(UINT *)); |
spmat = (int **)ALLOCA(nsp*sizeof(UINT *)); |
svect = (UINT *)ALLOCA(col*sizeof(UINT)); |
svect = (UINT *)ALLOCA(col*sizeof(UINT)); |
spsugar = (int *)ALLOCA(nsp*sizeof(UINT)); |
spsugar = (int *)ALLOCA(nsp*sizeof(UINT)); |
|
spactive = !nz?0:(ND_pairs *)ALLOCA(nsp*sizeof(ND_pairs)); |
for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) { |
for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) { |
nd_sp(m,0,sp,&spol); |
nd_sp(m,0,sp,&spol); |
if ( !spol ) continue; |
if ( !spol ) continue; |
Line 4550 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
Line 4872 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
for ( j = k = 0; j < col; j++ ) |
for ( j = k = 0; j < col; j++ ) |
if ( !rhead[j] ) v[k++] = svect[j]; |
if ( !rhead[j] ) v[k++] = svect[j]; |
spsugar[sprow] = MAX(maxrs,SG(spol)); |
spsugar[sprow] = MAX(maxrs,SG(spol)); |
|
if ( nz ) |
|
spactive[sprow] = sp; |
sprow++; |
sprow++; |
} |
} |
nd_free(spol); |
nd_free(spol); |
Line 4567 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
Line 4891 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
if ( m == -1 ) |
if ( m == -1 ) |
rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat); |
rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat); |
else |
else |
rank = nd_gauss_elim_mod(spmat,spsugar,sprow,spcol,m,colstat); |
rank = nd_gauss_elim_mod(spmat,spsugar,spactive,sprow,spcol,m,colstat); |
r0 = 0; |
r0 = 0; |
for ( i = 0; i < rank; i++ ) { |
for ( i = 0; i < rank; i++ ) { |
NEXTNODE(r0,r); BDY(r) = |
NEXTNODE(r0,r); BDY(r) = |
Line 4576 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
Line 4900 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
GC_free(spmat[i]); |
GC_free(spmat[i]); |
} |
} |
if ( r0 ) NEXT(r) = 0; |
if ( r0 ) NEXT(r) = 0; |
|
|
for ( ; i < sprow; i++ ) GC_free(spmat[i]); |
for ( ; i < sprow; i++ ) GC_free(spmat[i]); |
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); |
get_eg(&eg2); init_eg(&eg_f4_2); add_eg(&eg_f4_2,&eg1,&eg2); |
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
init_eg(&eg_f4); add_eg(&eg_f4,&eg0,&eg2); |
Line 4585 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
Line 4910 NODE nd_f4_red_main(int m,ND_pairs sp0,int nsp,UINT *s |
|
nsp,nred,sprow,spcol,rank); |
nsp,nred,sprow,spcol,rank); |
fprintf(asir_out,"%fsec\n",eg_f4.exectime+eg_f4.gctime); |
fprintf(asir_out,"%fsec\n",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; |
return r0; |
} |
} |
|
|
NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vect,int col, |
#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) |
NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred) |
{ |
{ |
int spcol,sprow,a; |
int spcol,sprow,a; |
Line 4602 NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vec |
|
Line 4936 NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vec |
|
struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2; |
struct oEGT eg0,eg1,eg2,eg_f4,eg_f4_1,eg_f4_2; |
int maxrs; |
int maxrs; |
int *spsugar; |
int *spsugar; |
|
pointer *w; |
|
|
spcol = col-nred; |
spcol = col-nred; |
get_eg(&eg0); |
get_eg(&eg0); |
Line 4610 NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vec |
|
Line 4945 NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vec |
|
svect = (Q *)ALLOCA(col*sizeof(Q)); |
svect = (Q *)ALLOCA(col*sizeof(Q)); |
spsugar = (int *)ALLOCA(nsp*sizeof(Q)); |
spsugar = (int *)ALLOCA(nsp*sizeof(Q)); |
for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) { |
for ( a = sprow = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) { |
nd_sp(0,0,sp,&spol); |
nd_sp(0,trace,sp,&spol); |
if ( !spol ) continue; |
if ( !spol ) continue; |
nd_to_vect_q(s0vect,col,spol,svect); |
nd_to_vect_q(s0vect,col,spol,svect); |
maxrs = ndv_reduce_vect_q(svect,col,imat,rvect,nred); |
maxrs = ndv_reduce_vect_q(svect,trace,col,imat,rvect,nred); |
for ( i = 0; i < col; i++ ) if ( svect[i] ) break; |
for ( i = 0; i < col; i++ ) if ( svect[i] ) break; |
if ( i < col ) { |
if ( i < col ) { |
spmat[sprow] = v = (Q *)MALLOC(spcol*sizeof(Q)); |
spmat[sprow] = v = (Q *)MALLOC(spcol*sizeof(Q)); |
Line 4635 NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vec |
|
Line 4970 NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vec |
|
/* elimination (2nd step) */ |
/* elimination (2nd step) */ |
colstat = (int *)ALLOCA(spcol*sizeof(int)); |
colstat = (int *)ALLOCA(spcol*sizeof(int)); |
rank = nd_gauss_elim_q(spmat,spsugar,sprow,spcol,colstat); |
rank = nd_gauss_elim_q(spmat,spsugar,sprow,spcol,colstat); |
r0 = 0; |
w = (pointer *)ALLOCA(rank*sizeof(pointer)); |
for ( i = 0; i < rank; i++ ) { |
for ( i = 0; i < rank; i++ ) { |
NEXTNODE(r0,r); BDY(r) = |
w[rank-i-1] = (pointer)vect_to_ndv_q(spmat[i],spcol,col,rhead,s0vect); |
(pointer)vect_to_ndv_q(spmat[i],spcol,col,rhead,s0vect); |
SG((NDV)w[rank-i-1]) = spsugar[i]; |
SG((NDV)BDY(r)) = spsugar[i]; |
|
/* GC_free(spmat[i]); */ |
/* GC_free(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; |
if ( r0 ) NEXT(r) = 0; |
|
|
/* for ( ; i < sprow; i++ ) GC_free(spmat[i]); */ |
/* for ( ; i < sprow; i++ ) GC_free(spmat[i]); */ |
Line 4655 NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vec |
|
Line 4997 NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vec |
|
} |
} |
return r0; |
return r0; |
} |
} |
|
#else |
|
void printm(Q **mat,int row,int col) |
|
{ |
|
int i,j; |
|
printf("["); |
|
for ( i = 0; i < row; i++ ) { |
|
for ( j = 0; j < col; j++ ) { |
|
printexpr(CO,mat[i][j]); printf(" "); |
|
} |
|
printf("]\n"); |
|
} |
|
} |
|
|
|
NODE nd_f4_red_q_main(ND_pairs sp0,int nsp,UINT *s0vect,int col, |
|
NM_ind_pair *rvect,int *rhead,IndArray *imat,int nred) |
|
{ |
|
int row,a; |
|
int i,j,rank; |
|
NODE r0,r; |
|
ND_pairs sp; |
|
ND spol; |
|
Q **mat; |
|
int *colstat; |
|
int *sugar; |
|
|
|
row = nsp+nred; |
|
/* make the matrix */ |
|
mat = (Q **)ALLOCA(row*sizeof(Q *)); |
|
sugar = (int *)ALLOCA(row*sizeof(int)); |
|
for ( row = a = 0, sp = sp0; a < nsp; a++, sp = NEXT(sp) ) { |
|
nd_sp(0,0,sp,&spol); |
|
if ( !spol ) continue; |
|
mat[row] = (Q *)MALLOC(col*sizeof(Q)); |
|
nd_to_vect_q(s0vect,col,spol,mat[row]); |
|
sugar[row] = SG(spol); |
|
row++; |
|
} |
|
for ( i = 0; i < nred; i++, row++ ) { |
|
mat[row] = nm_ind_pair_to_vect(0,s0vect,col,rvect[i]); |
|
sugar[row] = rvect[i]->sugar; |
|
} |
|
/* elimination */ |
|
colstat = (int *)ALLOCA(col*sizeof(int)); |
|
rank = nd_gauss_elim_q(mat,sugar,row,col,colstat); |
|
r0 = 0; |
|
for ( i = 0; i < rank; i++ ) { |
|
for ( j = 0; j < col; j++ ) if ( mat[i][j] ) break; |
|
if ( j == col ) error("nd_f4_red_q_main : cannot happen"); |
|
if ( rhead[j] ) continue; |
|
NEXTNODE(r0,r); BDY(r) = |
|
(pointer)plain_vect_to_ndv_q(mat[i],col,s0vect); |
|
SG((NDV)BDY(r)) = sugar[i]; |
|
} |
|
if ( r0 ) NEXT(r) = 0; |
|
printf("\n"); |
|
return r0; |
|
} |
|
#endif |
|
|
FILE *nd_write,*nd_read; |
FILE *nd_write,*nd_read; |
|
|
void nd_send_int(int a) { |
void nd_send_int(int a) { |
Line 4749 int ox_exec_f4_red(Q proc) |
|
Line 5149 int ox_exec_f4_red(Q proc) |
|
return s; |
return s; |
} |
} |
|
|
NODE nd_f4_red_dist(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0) |
NODE nd_f4_red_dist(int m,ND_pairs sp0,UINT *s0vect,int col,NODE rp0,ND_pairs *nz) |
{ |
{ |
int nsp,nred; |
int nsp,nred; |
int i,rank,s; |
int i,rank,s; |
Line 4903 void nd_exec_f4_red_dist() |
|
Line 5303 void nd_exec_f4_red_dist() |
|
if ( m == -1 ) |
if ( m == -1 ) |
rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat); |
rank = nd_gauss_elim_sf(spmat,spsugar,sprow,spcol,m,colstat); |
else |
else |
rank = nd_gauss_elim_mod(spmat,spsugar,sprow,spcol,m,colstat); |
rank = nd_gauss_elim_mod(spmat,spsugar,0,sprow,spcol,m,colstat); |
nd_send_int(rank); |
nd_send_int(rank); |
for ( i = 0; i < rank; i++ ) { |
for ( i = 0; i < rank; i++ ) { |
nf = vect_to_ndv(spmat[i],spcol,col,rhead,s0vect); |
nf = vect_to_ndv(spmat[i],spcol,col,rhead,s0vect); |
Line 4934 int nd_gauss_elim_q(Q **mat0,int *sugar,int row,int co |
|
Line 5334 int nd_gauss_elim_q(Q **mat0,int *sugar,int row,int co |
|
wmat[i][j] = 0; |
wmat[i][j] = 0; |
} |
} |
} |
} |
rank0 = nd_gauss_elim_mod(wmat,sugar,row,col,mod,colstat); |
rank0 = nd_gauss_elim_mod(wmat,sugar,0,row,col,mod,colstat); |
NEWMAT(m); m->row = row; m->col = col; m->body = (pointer **)mat0; |
NEWMAT(m); m->row = row; m->col = col; m->body = (pointer **)mat0; |
rank = generic_gauss_elim(m,&nm,&dn,&ri,&ci); |
rank = generic_gauss_elim(m,&nm,&dn,&ri,&ci); |
if ( rank != rank0 ) |
if ( rank != rank0 ) |
Line 4964 int nd_gauss_elim_q(Q **mat0,int *sugar,int row,int co |
|
Line 5364 int nd_gauss_elim_q(Q **mat0,int *sugar,int row,int co |
|
return rank; |
return rank; |
} |
} |
|
|
int nd_gauss_elim_mod(int **mat0,int *sugar,int row,int col,int md,int *colstat) |
int nd_gauss_elim_mod(int **mat0,int *sugar,ND_pairs *spactive,int row,int col,int md,int *colstat) |
{ |
{ |
int i,j,k,l,inv,a,rank,s; |
int i,j,k,l,inv,a,rank,s; |
unsigned int *t,*pivot,*pk; |
unsigned int *t,*pivot,*pk; |
unsigned int **mat; |
unsigned int **mat; |
|
ND_pairs pair; |
|
|
mat = (unsigned int **)mat0; |
mat = (unsigned int **)mat0; |
for ( rank = 0, j = 0; j < col; j++ ) { |
for ( rank = 0, j = 0; j < col; j++ ) { |
Line 4985 int nd_gauss_elim_mod(int **mat0,int *sugar,int row,in |
|
Line 5386 int nd_gauss_elim_mod(int **mat0,int *sugar,int row,in |
|
if ( i != rank ) { |
if ( i != rank ) { |
t = mat[i]; mat[i] = mat[rank]; mat[rank] = t; |
t = mat[i]; mat[i] = mat[rank]; mat[rank] = t; |
s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s; |
s = sugar[i]; sugar[i] = sugar[rank]; sugar[rank] = s; |
|
if ( spactive ) { |
|
pair = spactive[i]; spactive[i] = spactive[rank]; |
|
spactive[rank] = pair; |
|
} |
} |
} |
pivot = mat[rank]; |
pivot = mat[rank]; |
s = sugar[rank]; |
s = sugar[rank]; |