228f966798
On some systems (like windows) qsort can modify the order of modules when the comparaison function return 0. As we expect to have the mca_btl_sm_add_procs_same_base_addr called before mca_btl_sm_add_procs we have force the qsort to return the SM modules in the correct order. Giving to the same_addr module a slightly higher priority solve this problem. This commit was SVN r8620.
524 строки
19 KiB
C
524 строки
19 KiB
C
/*
|
|
* Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana
|
|
* University Research and Technology
|
|
* Corporation. All rights reserved.
|
|
* Copyright (c) 2004-2005 The University of Tennessee and The University
|
|
* of Tennessee Research Foundation. All rights
|
|
* reserved.
|
|
* Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,
|
|
* University of Stuttgart. All rights reserved.
|
|
* Copyright (c) 2004-2005 The Regents of the University of California.
|
|
* All rights reserved.
|
|
* $COPYRIGHT$
|
|
*
|
|
* Additional copyrights may follow
|
|
*
|
|
* $HEADER$
|
|
*/
|
|
#include "ompi_config.h"
|
|
#include <errno.h>
|
|
#ifdef HAVE_UNISTD_H
|
|
#include <unistd.h>
|
|
#endif /* HAVE_UNISTD_H */
|
|
#ifdef HAVE_STRING_H
|
|
#include <string.h>
|
|
#endif /* HAVE_STRING_H */
|
|
#ifdef HAVE_FCNTL_H
|
|
#include <fcntl.h>
|
|
#endif /* HAVE_FCNTL_H */
|
|
#ifdef HAVE_SYS_TYPES_H
|
|
#include <sys/types.h>
|
|
#endif /* HAVE_SYS_TYPES_H */
|
|
#ifdef HAVE_SYS_MMAN_H
|
|
#include <sys/mman.h>
|
|
#endif /* HAVE_SYS_MMAN_H */
|
|
#ifdef HAVE_SYS_STAT_H
|
|
#include <sys/stat.h> /* for mkfifo */
|
|
#endif /* HAVE_SYS_STAT_H */
|
|
|
|
#include "ompi/include/constants.h"
|
|
#include "include/sys/cache.h"
|
|
#include "opal/event/event.h"
|
|
#include "opal/util/if.h"
|
|
#include "opal/util/argv.h"
|
|
#include "opal/util/output.h"
|
|
#include "util/sys_info.h"
|
|
#include "util/proc_info.h"
|
|
#include "mca/pml/pml.h"
|
|
#include "mca/base/mca_base_param.h"
|
|
#include "mca/pml/base/pml_base_module_exchange.h"
|
|
#include "mca/mpool/base/base.h"
|
|
#include "mca/common/sm/common_sm_mmap.h"
|
|
#include "btl_sm.h"
|
|
#include "btl_sm_frag.h"
|
|
#include "btl_sm_fifo.h"
|
|
|
|
|
|
|
|
/*
|
|
* Shared Memory (SM) component instance.
|
|
*/
|
|
|
|
mca_btl_sm_component_t mca_btl_sm_component = {
|
|
{ /* super is being filled in */
|
|
/* First, the mca_base_component_t struct containing meta information
|
|
about the component itself */
|
|
{
|
|
/* Indicate that we are a pml v1.0.0 component (which also implies a
|
|
specific MCA version) */
|
|
MCA_BTL_BASE_VERSION_1_0_0,
|
|
"sm", /* MCA component name */
|
|
OMPI_MAJOR_VERSION, /* MCA component major version */
|
|
OMPI_MINOR_VERSION, /* MCA component minor version */
|
|
OMPI_RELEASE_VERSION, /* MCA component release version */
|
|
mca_btl_sm_component_open, /* component open */
|
|
mca_btl_sm_component_close /* component close */
|
|
},
|
|
|
|
/* Next the MCA v1.0.0 component meta data */
|
|
{
|
|
/* Whether the component is checkpointable or not */
|
|
false
|
|
},
|
|
|
|
mca_btl_sm_component_init,
|
|
mca_btl_sm_component_progress,
|
|
} /* end super */
|
|
};
|
|
|
|
|
|
/*
|
|
* utility routines for parameter registration
|
|
*/
|
|
|
|
static inline char* mca_btl_sm_param_register_string(
|
|
const char* param_name,
|
|
const char* default_value)
|
|
{
|
|
char *param_value;
|
|
int id = mca_base_param_register_string("btl","sm",param_name,NULL,default_value);
|
|
mca_base_param_lookup_string(id, ¶m_value);
|
|
return param_value;
|
|
}
|
|
|
|
static inline int mca_btl_sm_param_register_int(
|
|
const char* param_name,
|
|
int default_value)
|
|
{
|
|
int id = mca_base_param_register_int("btl","sm",param_name,NULL,default_value);
|
|
int param_value = default_value;
|
|
mca_base_param_lookup_int(id,¶m_value);
|
|
return param_value;
|
|
}
|
|
|
|
|
|
/*
|
|
* Called by MCA framework to open the component, registers
|
|
* component parameters.
|
|
*/
|
|
|
|
int mca_btl_sm_component_open(void)
|
|
{
|
|
/* register SM component parameters */
|
|
mca_btl_sm_component.sm_free_list_num =
|
|
mca_btl_sm_param_register_int("free_list_num", 8);
|
|
mca_btl_sm_component.sm_free_list_max =
|
|
mca_btl_sm_param_register_int("free_list_max", -1);
|
|
mca_btl_sm_component.sm_free_list_inc =
|
|
mca_btl_sm_param_register_int("free_list_inc", 256);
|
|
mca_btl_sm_component.sm_max_procs =
|
|
mca_btl_sm_param_register_int("max_procs", -1);
|
|
mca_btl_sm_component.sm_extra_procs =
|
|
mca_btl_sm_param_register_int("sm_extra_procs", -1);
|
|
mca_btl_sm_component.sm_mpool_name =
|
|
mca_btl_sm_param_register_string("mpool", "sm");
|
|
mca_btl_sm_component.eager_limit =
|
|
mca_btl_sm_param_register_int("eager_limit", 1024);
|
|
mca_btl_sm_component.max_frag_size =
|
|
mca_btl_sm_param_register_int("max_frag_size", 8*1024);
|
|
mca_btl_sm_component.size_of_cb_queue =
|
|
mca_btl_sm_param_register_int("size_of_cb_queue", 128);
|
|
mca_btl_sm_component.cb_lazy_free_freq =
|
|
mca_btl_sm_param_register_int("cb_lazy_free_freq", 120);
|
|
/* make sure that queue size and lazy free frequency are consistent -
|
|
* want to make sure that slots are freed at a rate they can be
|
|
* reused, w/o allocating extra new circular buffer fifo arrays */
|
|
if( (float)(mca_btl_sm_component.cb_lazy_free_freq) >=
|
|
0.95*(float)(mca_btl_sm_component.size_of_cb_queue) ) {
|
|
/* upper limit */
|
|
mca_btl_sm_component.cb_lazy_free_freq=
|
|
(int)(0.95*(float)(mca_btl_sm_component.size_of_cb_queue));
|
|
/* lower limit */
|
|
if( 0>= mca_btl_sm_component.cb_lazy_free_freq ) {
|
|
mca_btl_sm_component.cb_lazy_free_freq=1;
|
|
}
|
|
}
|
|
|
|
/* default number of extra procs to allow for future growth */
|
|
mca_btl_sm_component.sm_extra_procs =
|
|
mca_btl_sm_param_register_int("sm_extra_procs", 2);
|
|
|
|
/* initialize objects */
|
|
OBJ_CONSTRUCT(&mca_btl_sm_component.sm_lock, opal_mutex_t);
|
|
OBJ_CONSTRUCT(&mca_btl_sm_component.sm_frags1, ompi_free_list_t);
|
|
OBJ_CONSTRUCT(&mca_btl_sm_component.sm_frags2, ompi_free_list_t);
|
|
return OMPI_SUCCESS;
|
|
}
|
|
|
|
|
|
/*
|
|
* component cleanup - sanity checking of queue lengths
|
|
*/
|
|
|
|
int mca_btl_sm_component_close(void)
|
|
{
|
|
int return_value=OMPI_SUCCESS;
|
|
|
|
OBJ_DESTRUCT(&mca_btl_sm_component.sm_lock);
|
|
OBJ_DESTRUCT(&mca_btl_sm_component.sm_frags1);
|
|
OBJ_DESTRUCT(&mca_btl_sm_component.sm_frags2);
|
|
|
|
/* unmap the shared memory control structure */
|
|
if(mca_btl_sm_component.mmap_file != NULL) {
|
|
return_value=munmap(mca_btl_sm_component.mmap_file->map_addr,
|
|
mca_btl_sm_component.mmap_file->map_size);
|
|
if(-1 == return_value) {
|
|
return_value=OMPI_ERROR;
|
|
opal_output(0," munmap failed :: file - %s :: errno - %d \n",
|
|
mca_btl_sm_component.mmap_file->map_addr,
|
|
errno);
|
|
goto CLEANUP;
|
|
}
|
|
|
|
/* unlink file, so that it will be deleted when all references
|
|
* to it are gone - no error checking, since we want all procs
|
|
* to call this, so that in an abnormal termination scanario,
|
|
* this file will still get cleaned up */
|
|
unlink(mca_btl_sm_component.mmap_file->map_path);
|
|
}
|
|
|
|
#if OMPI_ENABLE_PROGRESS_THREADS == 1
|
|
/* close/cleanup fifo create for event notification */
|
|
if(mca_btl_sm_component.sm_fifo_fd > 0) {
|
|
/* write a done message down the pipe */
|
|
unsigned char cmd = DONE;
|
|
if( write(mca_btl_sm_component.sm_fifo_fd,&cmd,sizeof(cmd)) !=
|
|
sizeof(cmd)){
|
|
opal_output(0, "mca_btl_sm_component_close: write fifo failed: errno=%d\n",
|
|
errno);
|
|
}
|
|
opal_thread_join(&mca_btl_sm_component.sm_fifo_thread, NULL);
|
|
close(mca_btl_sm_component.sm_fifo_fd);
|
|
unlink(mca_btl_sm_component.sm_fifo_path);
|
|
}
|
|
#endif
|
|
|
|
|
|
CLEANUP:
|
|
|
|
/* return */
|
|
return return_value;
|
|
}
|
|
|
|
|
|
/*
|
|
* SM component initialization
|
|
*/
|
|
mca_btl_base_module_t** mca_btl_sm_component_init(
|
|
int *num_ptls,
|
|
bool enable_progress_threads,
|
|
bool enable_mpi_threads)
|
|
{
|
|
mca_btl_base_module_t **ptls = NULL;
|
|
int i;
|
|
|
|
*num_ptls = 0;
|
|
|
|
/* lookup/create shared memory pool only when used */
|
|
mca_btl_sm_component.sm_mpool = NULL;
|
|
mca_btl_sm_component.sm_mpool_base = NULL;
|
|
|
|
#if OMPI_ENABLE_PROGRESS_THREADS == 1
|
|
/* create a named pipe to receive events */
|
|
sprintf( mca_btl_sm_component.sm_fifo_path,
|
|
"%s/sm_fifo.%lu", orte_process_info.job_session_dir,
|
|
(unsigned long)orte_process_info.my_name->vpid );
|
|
if(mkfifo(mca_btl_sm_component.sm_fifo_path, 0660) < 0) {
|
|
opal_output(0, "mca_btl_sm_component_init: mkfifo failed with errno=%d\n",errno);
|
|
return NULL;
|
|
}
|
|
mca_btl_sm_component.sm_fifo_fd = open(mca_btl_sm_component.sm_fifo_path, O_RDWR);
|
|
if(mca_btl_sm_component.sm_fifo_fd < 0) {
|
|
opal_output(0, "mca_btl_sm_component_init: open(%s) failed with errno=%d\n",
|
|
mca_btl_sm_component.sm_fifo_path, errno);
|
|
return NULL;
|
|
}
|
|
|
|
OBJ_CONSTRUCT(&mca_btl_sm_component.sm_fifo_thread, opal_thread_t);
|
|
mca_btl_sm_component.sm_fifo_thread.t_run = (opal_thread_fn_t) mca_btl_sm_component_event_thread;
|
|
opal_thread_start(&mca_btl_sm_component.sm_fifo_thread);
|
|
#endif
|
|
|
|
/* allocate the Shared Memory PTL */
|
|
*num_ptls = 2;
|
|
ptls = malloc((*num_ptls)*sizeof(mca_btl_base_module_t*));
|
|
if (NULL == ptls) {
|
|
return NULL;
|
|
}
|
|
|
|
/* get pointer to the ptls */
|
|
ptls[0] = (mca_btl_base_module_t *)(&(mca_btl_sm[0]));
|
|
ptls[1] = (mca_btl_base_module_t *)(&(mca_btl_sm[1]));
|
|
|
|
/* set scheduling parameters */
|
|
for( i=0 ; i < 2 ; i++ ) {
|
|
mca_btl_sm[i].super.btl_eager_limit=mca_btl_sm_component.eager_limit;
|
|
mca_btl_sm[i].super.btl_min_send_size=mca_btl_sm_component.max_frag_size;
|
|
mca_btl_sm[i].super.btl_max_send_size=mca_btl_sm_component.max_frag_size;
|
|
mca_btl_sm[i].super.btl_min_rdma_size=mca_btl_sm_component.max_frag_size;
|
|
mca_btl_sm[i].super.btl_max_rdma_size=mca_btl_sm_component.max_frag_size;
|
|
/* Because of the strange behavior of the qsort function on some OSes
|
|
* when it has to order items with the same value,
|
|
* we have to make sure that the add_procs functions are called in the
|
|
* correct order (ie. mca_btl_sm_add_procs_same_base_addr before
|
|
* mca_btl_sm_add_procs) or we will face segfault as only the first
|
|
* allocate memory for the mca_btl_sm_component.sm_proc_connect array.
|
|
*/
|
|
mca_btl_sm[i].super.btl_exclusivity=MCA_BTL_EXCLUSIVITY_HIGH-1-i; /* always use this btl */
|
|
mca_btl_sm[i].super.btl_latency=100; /* lowest latency */
|
|
mca_btl_sm[i].super.btl_bandwidth=900; /* not really used now since exclusivity is set to the highest value */
|
|
}
|
|
|
|
/* initialize some PTL data */
|
|
/* start with no SM procs */
|
|
mca_btl_sm_component.num_smp_procs = 0;
|
|
mca_btl_sm_component.my_smp_rank = 0xFFFFFFFF; /* not defined */
|
|
|
|
/* set flag indicating ptl not inited */
|
|
mca_btl_sm[0].btl_inited=false;
|
|
mca_btl_sm[1].btl_inited=false;
|
|
|
|
return ptls;
|
|
}
|
|
|
|
|
|
/*
|
|
* SM component progress.
|
|
*/
|
|
|
|
#if OMPI_ENABLE_PROGRESS_THREADS == 1
|
|
void mca_btl_sm_component_event_thread(opal_object_t* thread)
|
|
{
|
|
while(1) {
|
|
unsigned char cmd;
|
|
if(read(mca_btl_sm_component.sm_fifo_fd, &cmd, sizeof(cmd)) != sizeof(cmd)) {
|
|
/* error condition */
|
|
return;
|
|
}
|
|
if( DONE == cmd ){
|
|
/* return when done message received */
|
|
return;
|
|
}
|
|
mca_btl_sm_component_progress();
|
|
}
|
|
}
|
|
#endif
|
|
|
|
|
|
int mca_btl_sm_component_progress(void)
|
|
{
|
|
/* local variables */
|
|
unsigned int peer_smp_rank ;
|
|
mca_btl_sm_frag_t *frag;
|
|
ompi_fifo_t *fifo = NULL;
|
|
int my_smp_rank=mca_btl_sm_component.my_smp_rank;
|
|
int proc;
|
|
int rc = 0;
|
|
|
|
/* send progress is made by the PML */
|
|
|
|
/*
|
|
* receive progress
|
|
*/
|
|
|
|
/* poll each fifo */
|
|
|
|
/* loop over fifo's - procs with same base shared memory
|
|
* virtual address as this process */
|
|
for( proc=0 ; proc < mca_btl_sm_component.num_smp_procs_same_base_addr
|
|
; proc++ )
|
|
{
|
|
peer_smp_rank= mca_btl_sm_component.list_smp_procs_same_base_addr[proc];
|
|
fifo=&(mca_btl_sm_component.fifo[peer_smp_rank][my_smp_rank]);
|
|
|
|
/* if fifo is not yet setup - continue - not data has been sent*/
|
|
if(OMPI_CB_FREE == fifo->tail){
|
|
continue;
|
|
}
|
|
|
|
/* aquire thread lock */
|
|
if( opal_using_threads() ) {
|
|
opal_atomic_lock( &(fifo->tail_lock) );
|
|
}
|
|
|
|
/* get pointer - pass in offset to change queue pointer
|
|
* addressing from that of the sender. In this case, we know
|
|
* that we have the same base address as the sender, so no
|
|
* translation is necessary when accessing the fifo. Hence,
|
|
* we use the _same_base_addr varient. */
|
|
frag = (mca_btl_sm_frag_t *)
|
|
ompi_fifo_read_from_tail_same_base_addr( fifo );
|
|
if( OMPI_CB_FREE == frag ) {
|
|
/* release thread lock */
|
|
if( opal_using_threads() ) {
|
|
opal_atomic_unlock(&(fifo->tail_lock));
|
|
}
|
|
continue;
|
|
}
|
|
|
|
/* release thread lock */
|
|
if( opal_using_threads() ) {
|
|
opal_atomic_unlock(&(fifo->tail_lock));
|
|
}
|
|
|
|
/* dispatch fragment by type */
|
|
switch(frag->type) {
|
|
case MCA_BTL_SM_FRAG_ACK:
|
|
{
|
|
/* completion callback */
|
|
frag->base.des_src = frag->base.des_dst;
|
|
frag->base.des_src_cnt = frag->base.des_dst_cnt;
|
|
frag->base.des_dst = NULL;
|
|
frag->base.des_dst_cnt = 0;
|
|
frag->base.des_cbfunc(&mca_btl_sm[0].super, frag->endpoint, &frag->base, frag->rc);
|
|
break;
|
|
}
|
|
case MCA_BTL_SM_FRAG_SEND:
|
|
{
|
|
/* recv upcall */
|
|
mca_btl_sm_recv_reg_t* reg = mca_btl_sm[0].sm_reg + frag->tag;
|
|
frag->base.des_dst = frag->base.des_src;
|
|
frag->base.des_dst_cnt = frag->base.des_src_cnt;
|
|
frag->base.des_src = NULL;
|
|
frag->base.des_src_cnt = 0;
|
|
reg->cbfunc(&mca_btl_sm[0].super,frag->tag,&frag->base,reg->cbdata);
|
|
frag->type = MCA_BTL_SM_FRAG_ACK;
|
|
MCA_BTL_SM_FIFO_WRITE( mca_btl_sm_component.sm_peers[peer_smp_rank],
|
|
my_smp_rank, peer_smp_rank, frag, rc );
|
|
if(OMPI_SUCCESS != rc)
|
|
return rc;
|
|
break;
|
|
}
|
|
default:
|
|
{
|
|
/* unknown */
|
|
frag->rc = OMPI_ERROR;
|
|
frag->type = MCA_BTL_SM_FRAG_ACK;
|
|
MCA_BTL_SM_FIFO_WRITE( mca_btl_sm_component.sm_peers[peer_smp_rank],
|
|
my_smp_rank, peer_smp_rank, frag, rc );
|
|
if(OMPI_SUCCESS != rc)
|
|
return rc;
|
|
break;
|
|
}
|
|
}
|
|
rc++;
|
|
} /* end peer_local_smp_rank loop */
|
|
|
|
|
|
/* loop over fifo's - procs with different base shared memory
|
|
* virtual address as this process */
|
|
for( proc=0 ; proc < mca_btl_sm_component.num_smp_procs_different_base_addr
|
|
; proc++ )
|
|
{
|
|
peer_smp_rank= mca_btl_sm_component.list_smp_procs_different_base_addr[proc];
|
|
fifo=&(mca_btl_sm_component.fifo[peer_smp_rank][my_smp_rank]);
|
|
|
|
/* if fifo is not yet setup - continue - not data has been sent*/
|
|
if(OMPI_CB_FREE == fifo->tail){
|
|
continue;
|
|
}
|
|
|
|
/* aquire thread lock */
|
|
if( opal_using_threads() ) {
|
|
opal_atomic_lock(&(fifo->tail_lock));
|
|
}
|
|
|
|
/* get pointer - pass in offset to change queue pointer
|
|
* addressing from that of the sender. In this case, we do
|
|
* *not* have the same base address as the sender, so we must
|
|
* translate every access into the fifo to be relevant to our
|
|
* memory space. Hence, we do *not* use the _same_base_addr
|
|
* variant. */
|
|
frag=(mca_btl_sm_frag_t *)ompi_fifo_read_from_tail( fifo,
|
|
mca_btl_sm_component.sm_offset[peer_smp_rank]);
|
|
if( OMPI_CB_FREE == frag ) {
|
|
/* release thread lock */
|
|
if( opal_using_threads() ) {
|
|
opal_atomic_unlock(&(fifo->tail_lock));
|
|
}
|
|
continue;
|
|
}
|
|
|
|
/* release thread lock */
|
|
if( opal_using_threads() ) {
|
|
opal_atomic_unlock(&(fifo->tail_lock));
|
|
}
|
|
|
|
/* change the address from address relative to the shared
|
|
* memory address, to a true virtual address */
|
|
frag = (mca_btl_sm_frag_t *)( (char *)frag +
|
|
mca_btl_sm_component.sm_offset[peer_smp_rank]);
|
|
|
|
/* dispatch fragment by type */
|
|
switch(frag->type) {
|
|
case MCA_BTL_SM_FRAG_ACK:
|
|
{
|
|
/* completion callback */
|
|
frag->base.des_src =
|
|
( mca_btl_base_segment_t* )((unsigned char*)frag->base.des_dst + mca_btl_sm_component.sm_offset[peer_smp_rank]);
|
|
frag->base.des_src->seg_addr.pval =
|
|
((unsigned char*)frag->base.des_src->seg_addr.pval +
|
|
mca_btl_sm_component.sm_offset[peer_smp_rank]);
|
|
frag->base.des_src_cnt = frag->base.des_dst_cnt;
|
|
frag->base.des_dst = NULL;
|
|
frag->base.des_dst_cnt = 0;
|
|
frag->base.des_cbfunc(&mca_btl_sm[1].super, frag->endpoint, &frag->base, frag->rc);
|
|
break;
|
|
}
|
|
case MCA_BTL_SM_FRAG_SEND:
|
|
{
|
|
/* recv upcall */
|
|
mca_btl_sm_recv_reg_t* reg = mca_btl_sm[1].sm_reg + frag->tag;
|
|
frag->base.des_dst = (mca_btl_base_segment_t*)
|
|
((unsigned char*)frag->base.des_src + mca_btl_sm_component.sm_offset[peer_smp_rank]);
|
|
frag->base.des_dst->seg_addr.pval =
|
|
((unsigned char*)frag->base.des_dst->seg_addr.pval +
|
|
mca_btl_sm_component.sm_offset[peer_smp_rank]);
|
|
frag->base.des_dst_cnt = frag->base.des_src_cnt;
|
|
frag->base.des_src = NULL;
|
|
frag->base.des_src_cnt = 0;
|
|
reg->cbfunc(&mca_btl_sm[1].super,frag->tag,&frag->base,reg->cbdata);
|
|
frag->type = MCA_BTL_SM_FRAG_ACK;
|
|
MCA_BTL_SM_FIFO_WRITE( mca_btl_sm_component.sm_peers[peer_smp_rank],
|
|
my_smp_rank, peer_smp_rank, frag, rc );
|
|
if(OMPI_SUCCESS != rc)
|
|
return rc;
|
|
break;
|
|
}
|
|
default:
|
|
{
|
|
/* unknown */
|
|
frag->rc = OMPI_ERROR;
|
|
frag->type = MCA_BTL_SM_FRAG_ACK;
|
|
MCA_BTL_SM_FIFO_WRITE( mca_btl_sm_component.sm_peers[peer_smp_rank],
|
|
my_smp_rank, peer_smp_rank, frag, rc );
|
|
if(OMPI_SUCCESS != rc)
|
|
return rc;
|
|
break;
|
|
}
|
|
}
|
|
rc++;
|
|
} /* end peer_local_smp_rank loop */
|
|
return rc;
|
|
}
|