version 1.186, 2010/04/23 07:35:44 |
version 1.192, 2010/12/14 05:29:37 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.185 2010/04/23 04:44:51 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.191 2010/09/27 05:05:58 noro Exp $ */ |
|
|
#include "nd.h" |
#include "nd.h" |
|
|
Line 49 static int nd_demand; |
|
Line 49 static int nd_demand; |
|
static int nd_module,nd_ispot,nd_mpos,nd_pot_nelim; |
static int nd_module,nd_ispot,nd_mpos,nd_pot_nelim; |
static NODE nd_tracelist; |
static NODE nd_tracelist; |
static NODE nd_alltracelist; |
static NODE nd_alltracelist; |
static int nd_gentrace,nd_gensyz,nd_nora,nd_incr; |
static int nd_gentrace,nd_gensyz,nd_nora,nd_newelim; |
|
static int *nd_gbblock; |
|
|
NumberField get_numberfield(); |
NumberField get_numberfield(); |
UINT *nd_det_compute_bound(NDV **dm,int n,int j); |
UINT *nd_det_compute_bound(NDV **dm,int n,int j); |
|
|
goto again; |
goto again; |
} else if ( nf ) { |
} else if ( nf ) { |
if ( checkonly || gensyz ) return 0; |
if ( checkonly || gensyz ) return 0; |
|
if ( nd_newelim ) { |
|
if ( nd_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); } |
if ( DP_Print ) { printf("+"); fflush(stdout); } |
hc = HCU(nf); |
hc = HCU(nf); |
nd_removecont(m,nf); |
nd_removecont(m,nf); |
Line 2300 ND_pairs nd_newpairs( NODE g, int t ) |
|
Line 2306 ND_pairs nd_newpairs( NODE g, int t ) |
|
{ |
{ |
NODE h; |
NODE h; |
UINT *dl; |
UINT *dl; |
int ts,s; |
int ts,s,i,t0,min,max; |
ND_pairs r,r0; |
ND_pairs r,r0; |
|
|
dl = DL(nd_psh[t]); |
dl = DL(nd_psh[t]); |
Line 2308 ND_pairs nd_newpairs( NODE g, int t ) |
|
Line 2314 ND_pairs nd_newpairs( NODE g, int t ) |
|
for ( r0 = 0, h = g; h; h = NEXT(h) ) { |
for ( r0 = 0, h = g; h; h = NEXT(h) ) { |
if ( nd_module && (MPOS(DL(nd_psh[(long)BDY(h)])) != MPOS(dl)) ) |
if ( nd_module && (MPOS(DL(nd_psh[(long)BDY(h)])) != MPOS(dl)) ) |
continue; |
continue; |
if ( (long)BDY(h) < nd_incr && t < nd_incr ) 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); |
NEXTND_pairs(r0,r); |
r->i1 = (long)BDY(h); |
r->i1 = (long)BDY(h); |
r->i2 = t; |
r->i2 = t; |
Line 2895 void nd_gr(LIST f,LIST v,int m,int homo,int f4,struct |
|
Line 2910 void nd_gr(LIST f,LIST v,int m,int homo,int f4,struct |
|
ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos,ompos); |
ndv_homogenize((NDV)BDY(t),obpe,oadv,oepos,ompos); |
} |
} |
|
|
ndv_setup(m,0,fd0,nd_incr?1:0,0); |
ndv_setup(m,0,fd0,nd_gbblock?1:0,0); |
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
MKLIST(l1,nd_tracelist); MKNODE(nd_alltracelist,l1,0); |
MKLIST(l1,nd_tracelist); MKNODE(nd_alltracelist,l1,0); |
} |
} |
x = f4?nd_f4(m,&perm):nd_gb(m,ishomo || homo,0,0,&perm); |
x = f4?nd_f4(m,&perm):nd_gb(m,ishomo || homo,0,0,&perm); |
|
if ( !x ) { |
|
*rp = 0; return; |
|
} |
if ( !ishomo && homo ) { |
if ( !ishomo && homo ) { |
/* dehomogenization */ |
/* dehomogenization */ |
for ( t = x; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord); |
for ( t = x; t; t = NEXT(t) ) ndv_dehomogenize((NDV)BDY(t),ord); |
Line 3162 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
Line 3180 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
tl1 = tl2 = tl3 = tl4 = 0; |
tl1 = tl2 = tl3 = tl4 = 0; |
if ( Demand ) |
if ( Demand ) |
nd_demand = 1; |
nd_demand = 1; |
ret = ndv_setup(m,1,fd0,nd_incr?1:0,0); |
ret = ndv_setup(m,1,fd0,nd_gbblock?1:0,0); |
if ( nd_gentrace ) { |
if ( nd_gentrace ) { |
MKLIST(l1,nd_tracelist); MKNODE(nd_alltracelist,l1,0); |
MKLIST(l1,nd_tracelist); MKNODE(nd_alltracelist,l1,0); |
} |
} |
Line 4918 EPOS nd_create_epos(struct order_spec *ord) |
|
Line 4936 EPOS nd_create_epos(struct order_spec *ord) |
|
|
|
/* external interface */ |
/* external interface */ |
|
|
void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec *ord,P *rp) |
void nd_nf_p(Obj f,LIST g,LIST v,int m,struct order_spec *ord,Obj *rp) |
{ |
{ |
NODE t,in0,in; |
NODE t,in0,in; |
ND nd,nf; |
ND ndf,nf; |
NDV ndv; |
NDV ndvf; |
VL vv,tv; |
VL vv,tv; |
int stat,nvar,max,e; |
int stat,nvar,max,mrank; |
union oNDC dn; |
union oNDC dn; |
Q cont; |
Q cont; |
P pp; |
P pp; |
|
LIST ppl; |
|
|
if ( !f ) { |
if ( !f ) { |
*rp = 0; |
*rp = 0; |
Line 4936 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
Line 4955 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
pltovl(v,&vv); |
pltovl(v,&vv); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
|
|
/* get the degree bound */ |
/* max=65536 implies nd_bpe=32 */ |
for ( t = BDY(g), max = 1; t; t = NEXT(t) ) |
max = 65536; |
for ( tv = vv; tv; tv = NEXT(tv) ) { |
|
e = getdeg(tv->v,(P)BDY(t)); |
|
max = MAX(e,max); |
|
} |
|
for ( tv = vv; tv; tv = NEXT(tv) ) { |
|
e = getdeg(tv->v,f); |
|
max = MAX(e,max); |
|
} |
|
|
|
|
nd_module = 0; |
|
/* nd_module will be set if ord is a module ordering */ |
nd_init_ord(ord); |
nd_init_ord(ord); |
nd_setup_parameters(nvar,max); |
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)); |
/* 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); |
ptozp((P)BDY(t),1,&cont,&pp); |
if ( nd_module ) { |
BDY(in) = (pointer)ptondv(CO,vv,pp); |
if ( !BDY(t) || OID(BDY(t)) != O_LIST |
|
|| length(BDY((LIST)BDY(t))) != mrank ) |
|
error("nd_nf_p : inconsistent basis element"); |
|
if ( !m ) pltozpl((LIST)BDY(t),&cont,&ppl); |
|
else ppl = (LIST)BDY(t); |
|
BDY(in) = (pointer)pltondv(CO,vv,ppl); |
|
} else { |
|
if ( !m ) ptozp((P)BDY(t),1,&cont,&pp); |
|
else pp = (P)BDY(t); |
|
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); |
if ( in0 ) NEXT(in) = 0; |
BDY(in) = (pointer)ptondv(CO,vv,f); |
|
if ( m ) ndv_mod(m,(NDV)BDY(in)); |
|
NEXT(in) = 0; |
|
|
|
|
if ( nd_module ) ndvf = pltondv(CO,vv,(LIST)f); |
|
else ndvf = ptondv(CO,vv,(P)f); |
|
if ( m ) ndv_mod(m,ndvf); |
|
ndf = (pointer)ndvtond(m,ndvf); |
|
|
/* dont sort, dont removecont */ |
/* dont sort, dont removecont */ |
ndv_setup(m,0,in0,1,1); |
ndv_setup(m,0,in0,1,1); |
nd_psn--; |
|
nd_scale=2; |
nd_scale=2; |
while ( 1 ) { |
stat = nd_nf(m,0,ndf,nd_ps,1,0,&nf); |
nd = (pointer)ndvtond(m,nd_ps[nd_psn]); |
if ( !stat ) |
stat = nd_nf(m,0,nd,nd_ps,1,0,&nf); |
error("nd_nf_p : exponent too large"); |
if ( !stat ) { |
if ( nd_module ) *rp = (Obj)ndvtopl(m,CO,vv,ndtondv(m,nf),mrank); |
nd_psn++; |
else *rp = (Obj)ndvtop(m,CO,vv,ndtondv(m,nf)); |
nd_reconstruct(0,0); |
|
nd_psn--; |
|
} else |
|
break; |
|
} |
|
*rp = ndvtop(m,CO,vv,ndtondv(m,nf)); |
|
} |
} |
|
|
int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r) |
int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r) |
Line 6590 void nd_det(int mod,MAT f,P *rp) |
|
Line 6610 void nd_det(int mod,MAT f,P *rp) |
|
bucket = create_pbucket(); |
bucket = create_pbucket(); |
if ( mi[k] ) { |
if ( mi[k] ) { |
nmv = BDY(mjj); len = LEN(mjj); |
nmv = BDY(mjj); len = LEN(mjj); |
fprintf(stderr,"len=%d\n",len); |
|
for ( a = 0; a < len; a++, NMV_ADV(nmv) ) { |
for ( a = 0; a < len; a++, NMV_ADV(nmv) ) { |
fprintf(stderr,"."); |
|
u = ndv_mul_nmv_trunc(mod,nmv,mi[k],DL(BDY(d))); |
u = ndv_mul_nmv_trunc(mod,nmv,mi[k],DL(BDY(d))); |
add_pbucket(mod,bucket,u); |
add_pbucket(mod,bucket,u); |
if ( !(a%1000) ) |
|
fprintf(stderr,"%d\n",a); |
|
} |
} |
} |
} |
if ( mj[k] && mij ) { |
if ( mj[k] && mij ) { |
nmv = BDY(mij); len = LEN(mij); |
nmv = BDY(mij); len = LEN(mij); |
fprintf(stderr,"len=%d\n",len); |
|
for ( a = 0; a < len; a++, NMV_ADV(nmv) ) { |
for ( a = 0; a < len; a++, NMV_ADV(nmv) ) { |
fprintf(stderr,"."); |
|
u = ndv_mul_nmv_trunc(mod,nmv,mj[k],DL(BDY(d))); |
u = ndv_mul_nmv_trunc(mod,nmv,mj[k],DL(BDY(d))); |
add_pbucket(mod,bucket,u); |
add_pbucket(mod,bucket,u); |
if ( !(a%1000) ) |
|
fprintf(stderr,"%d\n",a); |
|
} |
} |
} |
} |
u = nd_quo(mod,bucket,d); |
u = nd_quo(mod,bucket,d); |
Line 6937 void conv_ilist(int demand,int trace,NODE g,int **indp |
|
Line 6949 void conv_ilist(int demand,int trace,NODE g,int **indp |
|
|
|
void parse_nd_option(NODE opt) |
void parse_nd_option(NODE opt) |
{ |
{ |
NODE t,p; |
NODE t,p,u; |
|
int i,s; |
char *key; |
char *key; |
Obj value; |
Obj value; |
|
|
nd_gentrace = 0; nd_gensyz = 0; nd_nora = 0; nd_incr = 0; |
nd_gentrace = 0; nd_gensyz = 0; nd_nora = 0; nd_gbblock = 0; |
|
nd_newelim = 0; |
for ( t = opt; t; t = NEXT(t) ) { |
for ( t = opt; t; t = NEXT(t) ) { |
p = BDY((LIST)BDY(t)); |
p = BDY((LIST)BDY(t)); |
key = BDY((STRING)BDY(p)); |
key = BDY((STRING)BDY(p)); |
Line 6952 void parse_nd_option(NODE opt) |
|
Line 6966 void parse_nd_option(NODE opt) |
|
nd_gensyz = value?1:0; |
nd_gensyz = value?1:0; |
else if ( !strcmp(key,"nora") ) |
else if ( !strcmp(key,"nora") ) |
nd_nora = value?1:0; |
nd_nora = value?1:0; |
else if ( !strcmp(key,"incr") ) |
else if ( !strcmp(key,"gbblock") ) { |
nd_incr = QTOS((Q)value); |
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") ) |
|
nd_newelim = value?1:0; |
} |
} |
} |
} |