version 1.22, 2003/12/10 05:39:58 |
version 1.25, 2004/08/28 12:50:30 |
|
|
* OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY |
* OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* $OpenXM: OpenXM_contrib2/asir2000/io/ox.c,v 1.21 2003/12/09 03:07:45 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/io/ox.c,v 1.24 2003/12/11 05:48:04 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
Line 120 static int available_cmo[] = { |
|
Line 120 static int available_cmo[] = { |
|
CMO_ZZ, CMO_QQ, CMO_ZERO, |
CMO_ZZ, CMO_QQ, CMO_ZERO, |
CMO_DMS_GENERIC, CMO_DMS_OF_N_VARIABLES, |
CMO_DMS_GENERIC, CMO_DMS_OF_N_VARIABLES, |
CMO_RING_BY_NAME, CMO_DISTRIBUTED_POLYNOMIAL, |
CMO_RING_BY_NAME, CMO_DISTRIBUTED_POLYNOMIAL, |
|
CMO_RATIONAL, |
CMO_RECURSIVE_POLYNOMIAL, CMO_UNIVARIATE_POLYNOMIAL, |
CMO_RECURSIVE_POLYNOMIAL, CMO_UNIVARIATE_POLYNOMIAL, |
CMO_INDETERMINATE, |
CMO_INDETERMINATE, |
CMO_TREE, |
CMO_TREE, |
Line 146 static int ox_asir_available_sm[] = { |
|
Line 147 static int ox_asir_available_sm[] = { |
|
SM_mathcap, SM_setMathcap, SM_nop, |
SM_mathcap, SM_setMathcap, SM_nop, |
SM_beginBlock, SM_endBlock, |
SM_beginBlock, SM_endBlock, |
SM_set_rank_102, SM_tcp_accept_102, SM_tcp_connect_102, SM_reset_102, |
SM_set_rank_102, SM_tcp_accept_102, SM_tcp_connect_102, SM_reset_102, |
|
SM_bcast_102, SM_reduce_102, |
0 |
0 |
}; |
}; |
|
|
Line 532 void ox_send_data_102(int rank,pointer p) |
|
Line 534 void ox_send_data_102(int rank,pointer p) |
|
end_critical(); |
end_critical(); |
} |
} |
|
|
void ox_bcast_102(int root,Obj *rp) |
void ox_bcast_102(int root) |
{ |
{ |
Obj data; |
Obj data; |
int n,myr,r,mask,src,dst,id; |
int r,mask,id,src,dst; |
|
|
data = *rp; |
r = myrank_102-root; |
n = nserver_102; |
if ( r == 0 ) |
myr = myrank_102; |
data = (Obj)asir_pop_one(); |
r = myr-root; |
|
if ( r < 0 ) r += n; |
if ( r < 0 ) r += nserver_102; |
for ( mask = 1; mask < n; mask <<= 1 ) |
for ( mask = 1; mask < nserver_102; mask <<= 1 ) |
if ( r&mask ) { |
if ( r&mask ) { |
src = myr-mask; |
src = myrank_102-mask; |
if ( src < 0 ) src += n; |
if ( src < 0 ) src += nserver_102; |
ox_recv_102(src,&id,&data); |
ox_recv_102(src,&id,&data); |
break; |
break; |
} |
} |
for ( mask >>= 1; mask > 0; mask >>= 1 ) |
for ( mask >>= 1; mask > 0; mask >>= 1 ) |
if ( (r+mask) < n ) { |
if ( (r+mask) < nserver_102 ) { |
dst = myr+mask; |
dst = myrank_102+mask; |
if ( dst >= n ) dst -= n; |
if ( dst >= nserver_102 ) dst -= nserver_102; |
ox_send_data_102(dst,data); |
ox_send_data_102(dst,data); |
} |
} |
*rp = data; |
asir_push_one(data); |
|
} |
|
|
|
/* func : an arithmetic funcion func(vl,a,b,*c) */ |
|
|
|
void ox_reduce_102(int root,void (*func)()) |
|
{ |
|
Obj data,data0,t; |
|
int r,mask,id,src,dst; |
|
|
|
r = myrank_102-root; |
|
if ( r < 0 ) r += nserver_102; |
|
data = (Obj)asir_pop_one(); |
|
for ( mask = 1; mask < nserver_102; mask <<= 1 ) |
|
if ( r&mask ) { |
|
dst = (r-mask)+root; |
|
if ( dst >= nserver_102 ) dst -= nserver_102; |
|
ox_send_data_102(dst,data); |
|
break; |
|
} else { |
|
src = r+mask; |
|
if ( src < nserver_102 ) { |
|
src += root; |
|
if ( src >= nserver_102 ) src -= nserver_102; |
|
ox_recv_102(src,&id,&data0); |
|
(*func)(CO,data,data0,&t); data = t; |
|
} |
|
} |
|
asir_push_one(r?0:data); |
} |
} |
|
|
void ox_send_cmd(int s,int id) |
void ox_send_cmd(int s,int id) |