version 1.95, 2004/03/15 08:44:52 |
version 1.102, 2004/09/15 01:43:33 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.94 2004/03/15 07:30:44 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.101 2004/09/14 10:00:26 noro Exp $ */ |
|
|
#include "nd.h" |
#include "nd.h" |
|
|
Line 29 static NDV *nd_ps; |
|
Line 29 static NDV *nd_ps; |
|
static NDV *nd_ps_trace; |
static NDV *nd_ps_trace; |
static RHist *nd_psh; |
static RHist *nd_psh; |
static int nd_psn,nd_pslen; |
static int nd_psn,nd_pslen; |
|
|
static RHist *nd_red; |
static RHist *nd_red; |
|
static int *nd_work_vector; |
|
static int **nd_matrix; |
|
static int nd_matrix_len; |
|
static struct weight_or_block *nd_worb; |
|
static int nd_worb_len; |
static int nd_found,nd_create,nd_notfirst; |
static int nd_found,nd_create,nd_notfirst; |
static int nmv_adv; |
static int nmv_adv; |
static int nd_demand; |
static int nd_demand; |
Line 422 int ndl_block_compare(UINT *d1,UINT *d2) |
|
Line 425 int ndl_block_compare(UINT *d1,UINT *d2) |
|
return 0; |
return 0; |
} |
} |
|
|
|
int ndl_matrix_compare(UINT *d1,UINT *d2) |
|
{ |
|
int i,j,s; |
|
int *v; |
|
|
|
for ( j = 0; j < nd_nvar; j++ ) |
|
nd_work_vector[j] = GET_EXP(d1,j)-GET_EXP(d2,j); |
|
for ( i = 0; i < nd_matrix_len; i++ ) { |
|
v = nd_matrix[i]; |
|
for ( j = 0, s = 0; j < nd_nvar; j++ ) |
|
s += v[j]*nd_work_vector[j]; |
|
if ( s > 0 ) return 1; |
|
else if ( s < 0 ) return -1; |
|
} |
|
return 0; |
|
} |
|
|
|
int ndl_composite_compare(UINT *d1,UINT *d2) |
|
{ |
|
int i,j,s,start,end,len,o; |
|
int *v; |
|
struct sparse_weight *sw; |
|
|
|
for ( j = 0; j < nd_nvar; j++ ) |
|
nd_work_vector[j] = GET_EXP(d1,j)-GET_EXP(d2,j); |
|
for ( i = 0; i < nd_worb_len; i++ ) { |
|
len = nd_worb[i].length; |
|
switch ( nd_worb[i].type ) { |
|
case IS_DENSE_WEIGHT: |
|
v = nd_worb[i].body.dense_weight; |
|
for ( j = 0, s = 0; j < len; j++ ) |
|
s += v[j]*nd_work_vector[j]; |
|
if ( s > 0 ) return 1; |
|
else if ( s < 0 ) return -1; |
|
break; |
|
case IS_SPARSE_WEIGHT: |
|
sw = nd_worb[i].body.sparse_weight; |
|
for ( j = 0, s = 0; j < len; j++ ) |
|
s += sw[j].value*nd_work_vector[sw[j].pos]; |
|
if ( s > 0 ) return 1; |
|
else if ( s < 0 ) return -1; |
|
break; |
|
case IS_BLOCK: |
|
o = nd_worb[i].body.block.order; |
|
start = nd_worb[i].body.block.start; |
|
switch ( o ) { |
|
case 0: |
|
end = start+len; |
|
for ( j = start, s = 0; j < end; j++ ) |
|
s += MUL_WEIGHT(nd_work_vector[j],j); |
|
if ( s > 0 ) return 1; |
|
else if ( s < 0 ) return -1; |
|
for ( j = end-1; j >= start; j-- ) |
|
if ( nd_work_vector[j] < 0 ) return 1; |
|
else if ( nd_work_vector[j] > 0 ) return -1; |
|
break; |
|
case 1: |
|
end = start+len; |
|
for ( j = start, s = 0; j < end; j++ ) |
|
s += MUL_WEIGHT(nd_work_vector[j],j); |
|
if ( s > 0 ) return 1; |
|
else if ( s < 0 ) return -1; |
|
for ( j = start; j < end; j++ ) |
|
if ( nd_work_vector[j] > 0 ) return 1; |
|
else if ( nd_work_vector[j] < 0 ) return -1; |
|
break; |
|
case 2: |
|
for ( j = start; j < end; j++ ) |
|
if ( nd_work_vector[j] > 0 ) return 1; |
|
else if ( nd_work_vector[j] < 0 ) return -1; |
|
break; |
|
} |
|
break; |
|
} |
|
} |
|
return 0; |
|
} |
|
|
/* TDH -> WW -> TD-> RL */ |
/* TDH -> WW -> TD-> RL */ |
|
|
int ndl_ww_lex_compare(UINT *d1,UINT *d2) |
int ndl_ww_lex_compare(UINT *d1,UINT *d2) |
Line 2621 UINT *ndv_compute_bound(NDV p) |
|
Line 2702 UINT *ndv_compute_bound(NDV p) |
|
return t; |
return t; |
} |
} |
|
|
|
UINT *nd_compute_bound(ND p) |
|
{ |
|
UINT *d1,*d2,*t; |
|
UINT u; |
|
int i,j,k,l,len,ind; |
|
NM m; |
|
|
|
if ( !p ) |
|
return 0; |
|
d1 = (UINT *)ALLOCA(nd_wpd*sizeof(UINT)); |
|
d2 = (UINT *)ALLOCA(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) ) { |
|
ndl_lcm(DL(m),d1,d2); |
|
t = d1; d1 = d2; d2 = t; |
|
} |
|
l = nd_nvar+31; |
|
t = (UINT *)MALLOC_ATOMIC(l*sizeof(UINT)); |
|
for ( i = nd_exporigin, ind = 0; i < nd_wpd; i++ ) { |
|
u = d1[i]; |
|
k = (nd_epw-1)*nd_bpe; |
|
for ( j = 0; j < nd_epw; j++, k -= nd_bpe, ind++ ) |
|
t[ind] = (u>>k)&nd_mask0; |
|
} |
|
for ( ; ind < l; ind++ ) t[ind] = 0; |
|
return t; |
|
} |
|
|
int nd_get_exporigin(struct order_spec *ord) |
int nd_get_exporigin(struct order_spec *ord) |
{ |
{ |
switch ( ord->id ) { |
switch ( ord->id ) { |
case 0: |
case 0: case 2: |
return 1; |
return 1; |
case 1: |
case 1: |
/* block order */ |
/* block order */ |
/* d[0]:weight d[1]:w0,...,d[nd_exporigin-1]:w(n-1) */ |
/* d[0]:weight d[1]:w0,...,d[nd_exporigin-1]:w(n-1) */ |
return ord->ord.block.length+1; |
return ord->ord.block.length+1; |
case 2: |
case 3: |
error("nd_get_exporigin : matrix order is not supported yet."); |
error("nd_get_exporigin : composite order is not supported yet."); |
} |
} |
} |
} |
|
|
Line 2676 void nd_setup_parameters(int nvar,int max) { |
|
Line 2786 void nd_setup_parameters(int nvar,int max) { |
|
nmv_adv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(nd_wpd-1)*sizeof(UINT)); |
nmv_adv = ROUND_FOR_ALIGN(sizeof(struct oNMV)+(nd_wpd-1)*sizeof(UINT)); |
nd_epos = nd_create_epos(nd_ord); |
nd_epos = nd_create_epos(nd_ord); |
nd_blockmask = nd_create_blockmask(nd_ord); |
nd_blockmask = nd_create_blockmask(nd_ord); |
|
nd_work_vector = (int *)REALLOC(nd_work_vector,nd_nvar*sizeof(int)); |
} |
} |
|
|
ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d) |
ND_pairs nd_reconstruct(int mod,int trace,ND_pairs d) |
Line 3085 ND ndv_mul_nm(int mod,NM m0,NDV p) |
|
Line 3196 ND ndv_mul_nm(int mod,NM m0,NDV p) |
|
} |
} |
} |
} |
|
|
|
ND nd_quo(int mod,ND p,NDV d) |
|
{ |
|
NM mq0,mq; |
|
NMV tm; |
|
Q q; |
|
int i,nv,sg,c,c1,c2; |
|
ND t,r; |
|
|
|
if ( !p ) return 0; |
|
else { |
|
nv = NV(p); |
|
sg = SG(p); |
|
mq0 = 0; |
|
tm = (NMV)ALLOCA(nmv_adv); |
|
while ( p ) { |
|
NEXTNM(mq0,mq); |
|
ndl_sub(HDL(p),HDL(d),DL(mq)); |
|
ndl_copy(DL(mq),DL(tm)); |
|
if ( mod ) { |
|
c1 = invm(HCM(d),mod); c2 = HCM(p); |
|
DMAR(c1,c2,0,mod,c); CM(mq) = c; |
|
CM(tm) = mod-c; |
|
} else { |
|
divq(HCQ(p),HCQ(d),&CQ(mq)); |
|
chsgnq(CQ(mq),&CQ(tm)); |
|
} |
|
t = ndv_mul_nmv_trunc(mod,tm,d,HDL(d)); |
|
p = nd_add(mod,p,t); |
|
} |
|
NEXT(mq) = 0; |
|
for ( i = 0, mq = mq0; mq; mq = NEXT(mq), i++ ); |
|
MKND(nv,mq0,i,r); |
|
/* XXX */ |
|
SG(r) = sg-SG(d); |
|
return r; |
|
} |
|
} |
|
|
void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos) |
void ndv_realloc(NDV p,int obpe,int oadv,EPOS oepos) |
{ |
{ |
NMV m,mr,mr0,t; |
NMV m,mr,mr0,t; |
Line 3234 ND ptond(VL vl,VL dvl,P p) |
|
Line 3383 ND ptond(VL vl,VL dvl,P p) |
|
w = (DCP *)ALLOCA(k*sizeof(DCP)); |
w = (DCP *)ALLOCA(k*sizeof(DCP)); |
for ( dc = DC(p), j = 0; j < k; dc = NEXT(dc), j++ ) w[j] = dc; |
for ( dc = DC(p), j = 0; j < k; dc = NEXT(dc), j++ ) w[j] = dc; |
for ( i = 0, tvl = dvl, v = VR(p); |
for ( i = 0, tvl = dvl, v = VR(p); |
vl && tvl->v != v; tvl = NEXT(tvl), i++ ); |
tvl && tvl->v != v; tvl = NEXT(tvl), i++ ); |
if ( !tvl ) { |
if ( !tvl ) { |
for ( j = k-1, s = 0, MKV(v,x); j >= 0; j-- ) { |
for ( j = k-1, s = 0, MKV(v,x); j >= 0; j-- ) { |
t = ptond(vl,dvl,COEF(w[j])); |
t = ptond(vl,dvl,COEF(w[j])); |
Line 3427 void nd_init_ord(struct order_spec *ord) |
|
Line 3576 void nd_init_ord(struct order_spec *ord) |
|
} |
} |
break; |
break; |
case 1: |
case 1: |
|
/* block order */ |
/* XXX */ |
/* XXX */ |
nd_dcomp = -1; |
nd_dcomp = -1; |
nd_isrlex = 0; |
nd_isrlex = 0; |
ndl_compare_function = ndl_block_compare; |
ndl_compare_function = ndl_block_compare; |
break; |
break; |
case 2: |
case 2: |
error("nd_init_ord : matrix order is not supported yet."); |
/* matrix order */ |
|
/* XXX */ |
|
nd_dcomp = -1; |
|
nd_isrlex = 0; |
|
nd_matrix_len = ord->ord.matrix.row; |
|
nd_matrix = ord->ord.matrix.matrix; |
|
ndl_compare_function = ndl_matrix_compare; |
break; |
break; |
|
case 3: |
|
/* composite order */ |
|
nd_dcomp = -1; |
|
nd_isrlex = 0; |
|
nd_worb_len = ord->ord.composite.length; |
|
nd_worb = ord->ord.composite.w_or_b; |
|
ndl_compare_function = ndl_composite_compare; |
|
break; |
} |
} |
nd_ord = ord; |
nd_ord = ord; |
} |
} |
Line 3445 BlockMask nd_create_blockmask(struct order_spec *ord) |
|
Line 3609 BlockMask nd_create_blockmask(struct order_spec *ord) |
|
UINT *t; |
UINT *t; |
BlockMask bm; |
BlockMask bm; |
|
|
if ( !ord->id ) |
/* we only create mask table for block order */ |
|
if ( ord->id != 1 ) |
return 0; |
return 0; |
n = ord->ord.block.length; |
n = ord->ord.block.length; |
bm = (BlockMask)MALLOC(sizeof(struct oBlockMask)); |
bm = (BlockMask)MALLOC(sizeof(struct oBlockMask)); |
Line 3503 EPOS nd_create_epos(struct order_spec *ord) |
|
Line 3668 EPOS nd_create_epos(struct order_spec *ord) |
|
} |
} |
break; |
break; |
case 2: |
case 2: |
error("nd_create_epos : matrix order is not supported yet."); |
/* matrix order */ |
|
case 3: |
|
/* composite order */ |
|
for ( i = 0; i < nd_nvar; i++ ) { |
|
epos[i].i = nd_exporigin + i/nd_epw; |
|
epos[i].s = (nd_epw-(i%nd_epw)-1)*nd_bpe; |
|
} |
|
break; |
} |
} |
return epos; |
return epos; |
} |
} |
Line 4481 NDV ndv_load(int index) |
|
Line 4653 NDV ndv_load(int index) |
|
MKNDV(nv,m0,len,d); |
MKNDV(nv,m0,len,d); |
SG(d) = sugar; |
SG(d) = sugar; |
return d; |
return d; |
|
} |
|
|
|
void nd_det(int mod,MAT f,P *rp) |
|
{ |
|
VL fv,tv; |
|
int n,i,j,max,e,nvar,sgn,k0,l0,len0,len,k,l,a; |
|
pointer **m; |
|
Q mone; |
|
NDV **dm; |
|
NDV *t,*mi,*mj; |
|
NDV d,s,mij,mjj; |
|
ND u; |
|
NMV nmv; |
|
PGeoBucket bucket; |
|
struct order_spec *ord; |
|
|
|
create_order_spec(0,0,&ord); |
|
nd_init_ord(ord); |
|
get_vars((Obj)f,&fv); |
|
if ( f->row != f->col ) |
|
error("nd_det : non-square matrix"); |
|
n = f->row; |
|
for ( nvar = 0, tv = fv; tv; tv = NEXT(tv), nvar++ ); |
|
m = f->body; |
|
for ( i = 0, max = 0; i < n; i++ ) |
|
for ( j = 0; j < n; j++ ) |
|
for ( tv = fv; tv; tv = NEXT(tv) ) { |
|
e = getdeg(tv->v,(P)m[i][j]); |
|
max = MAX(e,max); |
|
} |
|
nd_setup_parameters(nvar,1024); |
|
dm = (NDV **)almat_pointer(n,n); |
|
for ( i = 0, max = 0; i < n; i++ ) |
|
for ( j = 0; j < n; j++ ) { |
|
dm[i][j] = ptondv(CO,fv,m[i][j]); |
|
if ( mod ) ndv_mod(mod,dm[i][j]); |
|
if ( dm[i][j] && !LEN(dm[i][j]) ) dm[i][j] = 0; |
|
} |
|
d = ptondv(CO,fv,(P)ONE); |
|
if ( mod ) ndv_mod(mod,d); |
|
chsgnq(ONE,&mone); |
|
for ( j = 0, sgn = 1; j < n; j++ ) { |
|
for ( i = j; i < n && !dm[i][j]; i++ ); |
|
if ( i == n ) { |
|
*rp = 0; |
|
return; |
|
} |
|
k0 = i; l0 = j; len0 = LEN(dm[k0][l0]); |
|
for ( k = j; k < n; k++ ) |
|
for ( l = j; l < n; l++ ) |
|
if ( dm[k][l] && LEN(dm[k][l]) < len0 ) { |
|
k0 = k; l0 = l; len0 = LEN(dm[k][l]); |
|
} |
|
if ( k0 != j ) { |
|
t = dm[j]; dm[j] = dm[k0]; dm[k0] = t; |
|
sgn = -sgn; |
|
} |
|
if ( l0 != j ) { |
|
for ( k = j; k < n; k++ ) { |
|
s = dm[k][j]; dm[k][j] = dm[k][l0]; dm[k][l0] = s; |
|
} |
|
sgn = -sgn; |
|
} |
|
for ( i = j+1, mj = dm[j], mjj = mj[j]; i < 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++ ) { |
|
bucket = create_pbucket(); |
|
if ( mi[k] ) |
|
nmv = BDY(mjj); len = LEN(mjj); |
|
for ( a = 0; a < len; a++, NMV_ADV(nmv) ) { |
|
u = ndv_mul_nmv_trunc(mod,nmv,mi[k],DL(BDY(d))); |
|
add_pbucket(mod,bucket,u); |
|
} |
|
if ( mj[k] && mij ) { |
|
nmv = BDY(mij); len = LEN(mij); |
|
for ( a = 0; a < len; a++, NMV_ADV(nmv) ) { |
|
u = ndv_mul_nmv_trunc(mod,nmv,mj[k],DL(BDY(d))); |
|
add_pbucket(mod,bucket,u); |
|
} |
|
} |
|
u = normalize_pbucket(mod,bucket); |
|
u = nd_quo(mod,u,d); |
|
mi[k] = ndtondv(mod,u); |
|
} |
|
} |
|
d = mjj; |
|
} |
|
if ( sgn < 0 ) |
|
if ( mod ) |
|
ndv_mul_c(mod,d,mod-1); |
|
else |
|
ndv_mul_c_q(d,mone); |
|
*rp = ndvtop(mod,CO,fv,d); |
|
} |
|
|
|
ND ndv_mul_nmv_trunc(int mod,NMV m0,NDV p,UINT *d) |
|
{ |
|
NM mr,mr0; |
|
NM tnm; |
|
NMV m; |
|
UINT *d0,*dt,*dm; |
|
int c,n,td,i,c1,c2,len; |
|
Q q; |
|
ND r; |
|
|
|
if ( !p ) return 0; |
|
else { |
|
n = NV(p); m = BDY(p); len = LEN(p); |
|
d0 = DL(m0); |
|
td = TD(d); |
|
mr0 = 0; |
|
NEWNM(tnm); |
|
if ( mod ) { |
|
c = CM(m0); |
|
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
|
ndl_add(DL(m),d0,DL(tnm)); |
|
if ( ndl_reducible(DL(tnm),d) ) { |
|
NEXTNM(mr0,mr); |
|
c1 = CM(m); DMAR(c1,c,0,mod,c2); CM(mr) = c2; |
|
ndl_add(DL(m),d0,DL(mr)); |
|
} |
|
} |
|
} else { |
|
q = CQ(m0); |
|
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
|
ndl_add(DL(m),d0,DL(tnm)); |
|
if ( ndl_reducible(DL(tnm),d) ) { |
|
NEXTNM(mr0,mr); |
|
mulq(CQ(m),q,&CQ(mr)); |
|
ndl_add(DL(m),d0,DL(mr)); |
|
} |
|
} |
|
} |
|
if ( !mr0 ) |
|
return 0; |
|
else { |
|
NEXT(mr) = 0; |
|
MKND(NV(p),mr0,len,r); |
|
SG(r) = SG(p) + TD(d0); |
|
return r; |
|
} |
|
} |
} |
} |