version 1.96, 2004/03/17 08:16:24 |
version 1.98, 2004/08/18 00:17:02 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.95 2004/03/15 08:44:52 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 33 static RHist *nd_red; |
|
Line 33 static RHist *nd_red; |
|
static int *nd_work_vector; |
static int *nd_work_vector; |
static int **nd_matrix; |
static int **nd_matrix; |
static int nd_matrix_len; |
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 441 int ndl_matrix_compare(UINT *d1,UINT *d2) |
|
Line 442 int ndl_matrix_compare(UINT *d1,UINT *d2) |
|
return 0; |
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 3254 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 3463 void nd_init_ord(struct order_spec *ord) |
|
Line 3525 void nd_init_ord(struct order_spec *ord) |
|
ndl_compare_function = ndl_matrix_compare; |
ndl_compare_function = ndl_matrix_compare; |
break; |
break; |
case 3: |
case 3: |
error("nd_init_ord : composite order is not supported yet."); |
/* 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; |
break; |
} |
} |
nd_ord = ord; |
nd_ord = ord; |