version 1.95, 2004/03/15 08:44:52 |
version 1.98, 2004/08/18 00:17:02 |
|
|
/* $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.97 2004/03/25 01:31:03 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 2624 UINT *ndv_compute_bound(NDV p) |
|
Line 2705 UINT *ndv_compute_bound(NDV p) |
|
int nd_get_exporigin(struct order_spec *ord) |
int nd_get_exporigin(struct order_spec *ord) |
{ |
{ |
switch ( ord->id ) { |
switch ( ord->id ) { |
case 0: |
case 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 2757 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 3234 ND ptond(VL vl,VL dvl,P p) |
|
Line 3316 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 3509 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 3542 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 3601 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; |
} |
} |