2005-05-24 02:06:50 +04:00
|
|
|
/*
|
2007-03-17 02:11:45 +03:00
|
|
|
* Copyright (c) 2004-2007 The Trustees of Indiana University and Indiana
|
2005-11-05 22:57:48 +03:00
|
|
|
* University Research and Technology
|
|
|
|
* Corporation. All rights reserved.
|
2008-02-18 20:39:30 +03:00
|
|
|
* Copyright (c) 2004-2008 The University of Tennessee and The University
|
2005-11-05 22:57:48 +03:00
|
|
|
* of Tennessee Research Foundation. All rights
|
|
|
|
* reserved.
|
2008-03-09 16:17:13 +03:00
|
|
|
* Copyright (c) 2004-2007 High Performance Computing Center Stuttgart,
|
2005-05-24 02:06:50 +04:00
|
|
|
* University of Stuttgart. All rights reserved.
|
|
|
|
* Copyright (c) 2004-2005 The Regents of the University of California.
|
|
|
|
* All rights reserved.
|
2007-10-22 16:07:22 +04:00
|
|
|
* Copyright (c) 2006-2007 Voltaire. All rights reserved.
|
2005-05-24 02:06:50 +04:00
|
|
|
* $COPYRIGHT$
|
2008-03-09 16:17:13 +03:00
|
|
|
*
|
2005-05-24 02:06:50 +04:00
|
|
|
* Additional copyrights may follow
|
2008-03-09 16:17:13 +03:00
|
|
|
*
|
2005-05-24 02:06:50 +04:00
|
|
|
* $HEADER$
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "ompi_config.h"
|
|
|
|
|
|
|
|
#include <string.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <errno.h>
|
|
|
|
|
2006-02-12 04:33:29 +03:00
|
|
|
#include "opal/sys/atomic.h"
|
2009-03-04 01:25:13 +03:00
|
|
|
#include "opal/class/opal_bitmap.h"
|
2009-02-14 05:26:12 +03:00
|
|
|
#include "opal/util/output.h"
|
2009-03-04 01:25:13 +03:00
|
|
|
#include "opal/util/printf.h"
|
2008-06-15 17:43:28 +04:00
|
|
|
#include "opal/mca/carto/carto.h"
|
|
|
|
#include "opal/mca/carto/base/base.h"
|
|
|
|
#include "opal/mca/paffinity/base/base.h"
|
|
|
|
#include "opal/mca/maffinity/base/base.h"
|
2006-02-12 04:33:29 +03:00
|
|
|
#include "orte/util/proc_info.h"
|
- Split the datatype engine into two parts: an MPI specific part in
OMPI
and a language agnostic part in OPAL. The convertor is completely
moved into OPAL. This offers several benefits as described in RFC
http://www.open-mpi.org/community/lists/devel/2009/07/6387.php
namely:
- Fewer basic types (int* and float* types, boolean and wchar
- Fixing naming scheme to ompi-nomenclature.
- Usability outside of the ompi-layer.
- Due to the fixed nature of simple opal types, their information is
completely
known at compile time and therefore constified
- With fewer datatypes (22), the actual sizes of bit-field types may be
reduced
from 64 to 32 bits, allowing reorganizing the opal_datatype
structure, eliminating holes and keeping data required in convertor
(upon send/recv) in one cacheline...
This has implications to the convertor-datastructure and other parts
of the code.
- Several performance tests have been run, the netpipe latency does not
change with
this patch on Linux/x86-64 on the smoky cluster.
- Extensive tests have been done to verify correctness (no new
regressions) using:
1. mpi_test_suite on linux/x86-64 using clean ompi-trunk and
ompi-ddt:
a. running both trunk and ompi-ddt resulted in no differences
(except for MPI_SHORT_INT and MPI_TYPE_MIX_LB_UB do now run
correctly).
b. with --enable-memchecker and running under valgrind (one buglet
when run with static found in test-suite, commited)
2. ibm testsuite on linux/x86-64 using clean ompi-trunk and ompi-ddt:
all passed (except for the dynamic/ tests failed!! as trunk/MTT)
3. compilation and usage of HDF5 tests on Jaguar using PGI and
PathScale compilers.
4. compilation and usage on Scicortex.
- Please note, that for the heterogeneous case, (-m32 compiled
binaries/ompi), neither
ompi-trunk, nor ompi-ddt branch would successfully launch.
This commit was SVN r21641.
2009-07-13 08:56:31 +04:00
|
|
|
#include "opal/datatype/opal_convertor.h"
|
2005-09-13 00:22:59 +04:00
|
|
|
#include "ompi/class/ompi_free_list.h"
|
|
|
|
#include "ompi/mca/btl/btl.h"
|
2006-02-12 04:33:29 +03:00
|
|
|
#include "ompi/mca/mpool/base/base.h"
|
|
|
|
#include "ompi/mca/common/sm/common_sm_mmap.h"
|
2008-06-15 17:43:28 +04:00
|
|
|
#include "ompi/mca/mpool/sm/mpool_sm.h"
|
2008-10-16 19:09:00 +04:00
|
|
|
|
|
|
|
#if OPAL_ENABLE_FT == 1
|
|
|
|
#include "opal/mca/crs/base/base.h"
|
|
|
|
#include "ompi/runtime/ompi_cr.h"
|
|
|
|
#endif
|
|
|
|
|
2005-06-30 09:50:55 +04:00
|
|
|
#include "btl_sm.h"
|
|
|
|
#include "btl_sm_endpoint.h"
|
|
|
|
#include "btl_sm_frag.h"
|
2005-07-28 20:25:09 +04:00
|
|
|
#include "btl_sm_fifo.h"
|
2005-09-13 00:22:59 +04:00
|
|
|
#include "ompi/proc/proc.h"
|
2005-05-24 02:06:50 +04:00
|
|
|
|
2007-03-20 11:15:58 +03:00
|
|
|
mca_btl_sm_t mca_btl_sm = {
|
2005-05-24 02:06:50 +04:00
|
|
|
{
|
2005-06-30 09:50:55 +04:00
|
|
|
&mca_btl_sm_component.super,
|
|
|
|
0, /* btl_eager_limit */
|
2007-12-16 11:35:17 +03:00
|
|
|
0, /* btl_rndv_eager_limit */
|
2005-06-30 09:50:55 +04:00
|
|
|
0, /* btl_max_send_size */
|
2007-06-21 11:12:40 +04:00
|
|
|
0, /* btl_rdma_pipeline_send_length */
|
2007-05-17 11:54:27 +04:00
|
|
|
0, /* btl_rdma_pipeline_frag_size */
|
|
|
|
0, /* btl_min_rdma_pipeline_size */
|
2005-06-30 09:50:55 +04:00
|
|
|
0, /* btl_exclusivity */
|
|
|
|
0, /* btl_latency */
|
|
|
|
0, /* btl_bandwidth */
|
|
|
|
0, /* btl flags */
|
2007-03-20 11:15:58 +03:00
|
|
|
mca_btl_sm_add_procs,
|
2005-06-30 09:50:55 +04:00
|
|
|
mca_btl_sm_del_procs,
|
2008-01-15 08:32:53 +03:00
|
|
|
NULL,
|
2005-06-30 09:50:55 +04:00
|
|
|
mca_btl_sm_finalize,
|
|
|
|
mca_btl_sm_alloc,
|
|
|
|
mca_btl_sm_free,
|
|
|
|
mca_btl_sm_prepare_src,
|
2005-06-01 18:34:22 +04:00
|
|
|
NULL,
|
2008-03-09 16:17:13 +03:00
|
|
|
mca_btl_sm_send,
|
2009-02-26 21:10:50 +03:00
|
|
|
mca_btl_sm_sendi,
|
2005-05-24 02:06:50 +04:00
|
|
|
NULL, /* put */
|
2006-03-17 20:39:41 +03:00
|
|
|
NULL, /* get */
|
2006-08-18 02:02:01 +04:00
|
|
|
mca_btl_base_dump,
|
|
|
|
NULL, /* mpool */
|
2007-03-17 02:11:45 +03:00
|
|
|
mca_btl_sm_register_error_cb, /* register error */
|
|
|
|
mca_btl_sm_ft_event
|
2005-05-24 02:06:50 +04:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2007-03-20 11:15:58 +03:00
|
|
|
/*
|
|
|
|
* calculate offset of an address from the beginning of a shared memory segment
|
|
|
|
*/
|
|
|
|
#define ADDR2OFFSET(ADDR, BASE) ((char*)(ADDR) - (char*)(BASE))
|
|
|
|
|
|
|
|
/*
|
|
|
|
* calculate an absolute address in a local address space given an offset and
|
|
|
|
* a base address of a shared memory segment
|
|
|
|
*/
|
|
|
|
#define OFFSET2ADDR(OFFSET, BASE) ((ptrdiff_t)(OFFSET) + (char*)(BASE))
|
2005-05-24 02:06:50 +04:00
|
|
|
|
2008-03-11 17:39:10 +03:00
|
|
|
|
|
|
|
static void *mpool_calloc(size_t nmemb, size_t size)
|
|
|
|
{
|
|
|
|
void *buf;
|
|
|
|
size_t bsize = nmemb * size;
|
2008-06-15 17:43:28 +04:00
|
|
|
mca_mpool_base_module_t *mpool = mca_btl_sm_component.sm_mpool;
|
|
|
|
|
|
|
|
buf = mpool->mpool_alloc(mpool, bsize, CACHE_LINE_SIZE, 0, NULL);
|
2008-03-11 17:39:10 +03:00
|
|
|
|
|
|
|
if (NULL == buf)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
memset(buf, 0, bsize);
|
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
2008-06-15 17:43:28 +04:00
|
|
|
static void init_maffinity(int *my_mem_node, int *max_mem_node)
|
|
|
|
{
|
2009-08-13 17:08:39 +04:00
|
|
|
opal_carto_graph_t *topo;
|
2008-06-15 17:43:28 +04:00
|
|
|
opal_value_array_t dists;
|
2008-08-23 07:13:29 +04:00
|
|
|
int i, num_core, socket;
|
2008-06-15 17:43:28 +04:00
|
|
|
opal_paffinity_base_cpu_set_t cpus;
|
|
|
|
char *myslot = NULL;
|
|
|
|
opal_carto_node_distance_t *dist;
|
|
|
|
opal_carto_base_node_t *slot_node;
|
|
|
|
|
|
|
|
*my_mem_node = 0;
|
|
|
|
*max_mem_node = 1;
|
|
|
|
|
|
|
|
if(opal_carto_base_get_host_graph(&topo, "Memory") != OMPI_SUCCESS)
|
|
|
|
return;
|
|
|
|
|
|
|
|
OBJ_CONSTRUCT(&dists, opal_value_array_t);
|
|
|
|
opal_value_array_init(&dists, sizeof(opal_carto_node_distance_t));
|
|
|
|
|
2008-08-21 23:21:28 +04:00
|
|
|
if(opal_paffinity_base_get_processor_info(&num_core) != OMPI_SUCCESS) {
|
|
|
|
num_core = 100; /* set something large */
|
|
|
|
}
|
2008-06-15 17:43:28 +04:00
|
|
|
|
|
|
|
OPAL_PAFFINITY_CPU_ZERO(cpus);
|
|
|
|
opal_paffinity_base_get(&cpus);
|
|
|
|
|
|
|
|
/* find core we are running on */
|
2008-08-21 23:21:28 +04:00
|
|
|
for(i = 0; i < num_core; i++)
|
2008-06-15 17:43:28 +04:00
|
|
|
if(OPAL_PAFFINITY_CPU_ISSET(i, cpus))
|
|
|
|
break;
|
|
|
|
|
2008-08-23 07:13:29 +04:00
|
|
|
if (OMPI_SUCCESS != opal_paffinity_base_get_map_to_socket_core(i, &socket, &i)) {
|
|
|
|
/* no topology info available */
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2008-06-15 17:43:28 +04:00
|
|
|
asprintf(&myslot, "slot%d", socket);
|
|
|
|
|
|
|
|
slot_node = opal_carto_base_find_node(topo, myslot);
|
|
|
|
|
|
|
|
if(NULL == slot_node)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
opal_carto_base_get_nodes_distance(topo, slot_node, "Memory", &dists);
|
|
|
|
if((*max_mem_node = opal_value_array_get_size(&dists)) < 2)
|
|
|
|
goto out;
|
|
|
|
|
2008-09-08 19:39:30 +04:00
|
|
|
dist = (opal_carto_node_distance_t *) opal_value_array_get_item(&dists, 0);
|
2008-06-15 17:43:28 +04:00
|
|
|
opal_maffinity_base_node_name_to_id(dist->node->node_name, my_mem_node);
|
|
|
|
out:
|
|
|
|
if(myslot) free(myslot);
|
|
|
|
OBJ_DESTRUCT(&dists);
|
|
|
|
opal_carto_base_free_graph(topo);
|
|
|
|
}
|
|
|
|
|
2008-03-11 17:39:10 +03:00
|
|
|
static int sm_btl_first_time_init(mca_btl_sm_t *sm_btl, int n)
|
|
|
|
{
|
|
|
|
size_t size, length, length_payload;
|
|
|
|
char *sm_ctl_file;
|
2009-02-17 18:58:15 +03:00
|
|
|
sm_fifo_t *my_fifos;
|
2008-06-15 17:43:28 +04:00
|
|
|
int my_mem_node=-1, num_mem_nodes=-1, i;
|
|
|
|
|
|
|
|
init_maffinity(&my_mem_node, &num_mem_nodes);
|
|
|
|
mca_btl_sm_component.mem_node = my_mem_node;
|
|
|
|
mca_btl_sm_component.num_mem_nodes = num_mem_nodes;
|
2008-03-11 17:39:10 +03:00
|
|
|
|
|
|
|
/* lookup shared memory pool */
|
2008-09-08 19:39:30 +04:00
|
|
|
mca_btl_sm_component.sm_mpools = (mca_mpool_base_module_t **) calloc(num_mem_nodes,
|
2008-06-15 17:43:28 +04:00
|
|
|
sizeof(mca_mpool_base_module_t*));
|
|
|
|
|
|
|
|
/* create mpool for each memory node */
|
|
|
|
for(i = 0; i < num_mem_nodes; i++) {
|
|
|
|
mca_mpool_base_resources_t res;
|
2009-02-20 22:51:57 +03:00
|
|
|
mca_btl_sm_component_t* m = &mca_btl_sm_component;
|
|
|
|
|
2008-06-15 17:43:28 +04:00
|
|
|
/* disable memory binding if there is only one memory node */
|
|
|
|
res.mem_node = (num_mem_nodes == 1) ? -1 : i;
|
2009-02-20 22:51:57 +03:00
|
|
|
|
|
|
|
/* determine how much memory to create */
|
2009-03-13 21:11:41 +03:00
|
|
|
/*
|
|
|
|
* This heuristic formula mostly says that we request memory for:
|
|
|
|
* - nfifos FIFOs, each comprising:
|
|
|
|
* . a sm_fifo_t structure
|
|
|
|
* . many pointers (fifo_size of them per FIFO)
|
|
|
|
* - eager fragments (2*n of them, allocated in sm_free_list_inc chunks)
|
|
|
|
* - max fragments (sm_free_list_num of them)
|
|
|
|
*
|
|
|
|
* On top of all that, we sprinkle in some number of "CACHE_LINE_SIZE"
|
|
|
|
* additions to account for some padding and edge effects that may lie
|
|
|
|
* in the allocator.
|
|
|
|
*/
|
|
|
|
res.size = m->nfifos * ( sizeof(sm_fifo_t) + sizeof(void *) * m->fifo_size + 4 * CACHE_LINE_SIZE )
|
|
|
|
+ ( 2 * n + m->sm_free_list_inc ) * ( m->eager_limit + 2 * CACHE_LINE_SIZE )
|
|
|
|
+ m->sm_free_list_num * ( m->max_frag_size + 2 * CACHE_LINE_SIZE );
|
2009-02-20 22:51:57 +03:00
|
|
|
if ( ((double) res.size) * n > LONG_MAX )
|
|
|
|
res.size = LONG_MAX;
|
|
|
|
else
|
|
|
|
res.size *= n;
|
|
|
|
|
|
|
|
/* now, create it */
|
2008-06-15 17:43:28 +04:00
|
|
|
mca_btl_sm_component.sm_mpools[i] =
|
2008-03-11 17:39:10 +03:00
|
|
|
mca_mpool_base_module_create(mca_btl_sm_component.sm_mpool_name,
|
2008-06-15 17:43:28 +04:00
|
|
|
sm_btl, &res);
|
|
|
|
/* Sanity check to ensure that we found it */
|
|
|
|
if(NULL == mca_btl_sm_component.sm_mpools[i])
|
|
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
|
|
|
|
|
|
if(i == my_mem_node)
|
|
|
|
mca_btl_sm_component.sm_mpool = mca_btl_sm_component.sm_mpools[i];
|
2008-03-11 17:39:10 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
mca_btl_sm_component.sm_mpool_base =
|
2008-06-15 17:43:28 +04:00
|
|
|
mca_btl_sm_component.sm_mpools[0]->mpool_base(mca_btl_sm_component.sm_mpools[0]);
|
2008-03-11 17:39:10 +03:00
|
|
|
|
|
|
|
/* create a list of peers */
|
|
|
|
mca_btl_sm_component.sm_peers = (struct mca_btl_base_endpoint_t**)
|
|
|
|
calloc(n, sizeof(struct mca_btl_base_endpoint_t*));
|
|
|
|
if(NULL == mca_btl_sm_component.sm_peers)
|
|
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
|
|
|
|
|
|
/* Allocate Shared Memory BTL process coordination
|
|
|
|
* data structure. This will reside in shared memory */
|
|
|
|
|
|
|
|
/* set file name */
|
|
|
|
if(asprintf(&sm_ctl_file, "%s"OPAL_PATH_SEP"shared_mem_btl_module.%s",
|
2009-03-06 00:56:03 +03:00
|
|
|
orte_process_info.job_session_dir,
|
|
|
|
orte_process_info.nodename) < 0)
|
2008-03-11 17:39:10 +03:00
|
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
|
|
|
|
|
|
/* Pass in a data segment alignment of 0 to get no data
|
|
|
|
segment (only the shared control structure) */
|
2008-03-16 13:01:56 +03:00
|
|
|
size = sizeof(mca_common_sm_file_header_t) +
|
2009-02-17 18:58:15 +03:00
|
|
|
n * (sizeof(sm_fifo_t*) + sizeof(char *) + sizeof(uint16_t)) + CACHE_LINE_SIZE;
|
2008-03-16 13:01:56 +03:00
|
|
|
if(!(mca_btl_sm_component.mmap_file =
|
|
|
|
mca_common_sm_mmap_init(size, sm_ctl_file,
|
|
|
|
sizeof(mca_common_sm_file_header_t),
|
|
|
|
CACHE_LINE_SIZE))) {
|
2008-06-09 18:53:58 +04:00
|
|
|
opal_output(0, "mca_btl_sm_add_procs: unable to create shared memory "
|
2008-03-11 17:39:10 +03:00
|
|
|
"BTL coordinating strucure :: size %lu \n",
|
|
|
|
(unsigned long)size);
|
|
|
|
free(sm_ctl_file);
|
|
|
|
return OMPI_ERROR;
|
|
|
|
}
|
|
|
|
|
|
|
|
free(sm_ctl_file);
|
|
|
|
|
|
|
|
/* set the pointer to the shared memory control structure */
|
2008-03-16 13:01:56 +03:00
|
|
|
mca_btl_sm_component.sm_ctl_header =
|
|
|
|
(mca_common_sm_file_header_t*)mca_btl_sm_component.mmap_file->map_seg;
|
2008-03-11 17:39:10 +03:00
|
|
|
|
2008-03-16 13:01:56 +03:00
|
|
|
|
|
|
|
/* check to make sure number of local procs is within the
|
|
|
|
* specified limits */
|
|
|
|
if(mca_btl_sm_component.sm_max_procs > 0 &&
|
|
|
|
mca_btl_sm_component.num_smp_procs + n >
|
|
|
|
mca_btl_sm_component.sm_max_procs) {
|
|
|
|
return OMPI_ERROR;
|
|
|
|
}
|
|
|
|
|
2009-05-20 02:50:44 +04:00
|
|
|
mca_btl_sm_component.shm_fifo = (volatile sm_fifo_t **)mca_btl_sm_component.mmap_file->data_addr;
|
2008-03-16 13:01:56 +03:00
|
|
|
mca_btl_sm_component.shm_bases = (char**)(mca_btl_sm_component.shm_fifo + n);
|
2008-06-15 17:43:28 +04:00
|
|
|
mca_btl_sm_component.shm_mem_nodes = (uint16_t*)(mca_btl_sm_component.shm_bases + n);
|
2008-03-16 13:01:56 +03:00
|
|
|
|
|
|
|
/* set the base of the shared memory segment */
|
|
|
|
mca_btl_sm_component.shm_bases[mca_btl_sm_component.my_smp_rank] =
|
2008-03-11 17:39:10 +03:00
|
|
|
(char*)mca_btl_sm_component.sm_mpool_base;
|
2008-06-15 17:43:28 +04:00
|
|
|
mca_btl_sm_component.shm_mem_nodes[mca_btl_sm_component.my_smp_rank] =
|
|
|
|
(uint16_t)my_mem_node;
|
2008-03-11 17:39:10 +03:00
|
|
|
|
2009-02-17 18:58:15 +03:00
|
|
|
/* initialize the array of fifo's "owned" by this process */
|
|
|
|
if(NULL == (my_fifos = (sm_fifo_t*)mpool_calloc(FIFO_MAP_NUM(n), sizeof(sm_fifo_t))))
|
2008-03-11 17:39:10 +03:00
|
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
|
|
|
2008-03-16 13:01:56 +03:00
|
|
|
mca_btl_sm_component.shm_fifo[mca_btl_sm_component.my_smp_rank] = my_fifos;
|
2008-03-11 17:39:10 +03:00
|
|
|
|
|
|
|
/* cache the pointer to the 2d fifo array. These addresses
|
|
|
|
* are valid in the current process space */
|
2009-02-17 18:58:15 +03:00
|
|
|
mca_btl_sm_component.fifo = (sm_fifo_t**)malloc(sizeof(sm_fifo_t*) * n);
|
2008-03-11 17:39:10 +03:00
|
|
|
|
|
|
|
if(NULL == mca_btl_sm_component.fifo)
|
|
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
|
|
|
|
|
|
mca_btl_sm_component.fifo[mca_btl_sm_component.my_smp_rank] = my_fifos;
|
|
|
|
|
2008-09-08 19:39:30 +04:00
|
|
|
mca_btl_sm_component.mem_nodes = (uint16_t *) malloc(sizeof(uint16_t) * n);
|
2008-06-15 17:43:28 +04:00
|
|
|
if(NULL == mca_btl_sm_component.mem_nodes)
|
|
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
|
|
|
2008-03-11 17:39:10 +03:00
|
|
|
/* initialize fragment descriptor free lists */
|
|
|
|
|
|
|
|
/* allocation will be for the fragment descriptor and payload buffer */
|
|
|
|
length = sizeof(mca_btl_sm_frag1_t);
|
|
|
|
length_payload =
|
|
|
|
sizeof(mca_btl_sm_hdr_t) + mca_btl_sm_component.eager_limit;
|
2009-02-20 22:51:57 +03:00
|
|
|
i = ompi_free_list_init_new(&mca_btl_sm_component.sm_frags_eager, length,
|
|
|
|
CACHE_LINE_SIZE, OBJ_CLASS(mca_btl_sm_frag1_t),
|
|
|
|
length_payload, CACHE_LINE_SIZE,
|
|
|
|
mca_btl_sm_component.sm_free_list_num,
|
|
|
|
mca_btl_sm_component.sm_free_list_max,
|
|
|
|
mca_btl_sm_component.sm_free_list_inc,
|
|
|
|
mca_btl_sm_component.sm_mpool);
|
|
|
|
if ( OMPI_SUCCESS != i )
|
|
|
|
return i;
|
2008-03-11 17:39:10 +03:00
|
|
|
|
|
|
|
length = sizeof(mca_btl_sm_frag2_t);
|
|
|
|
length_payload =
|
|
|
|
sizeof(mca_btl_sm_hdr_t) + mca_btl_sm_component.max_frag_size;
|
2009-02-20 22:51:57 +03:00
|
|
|
i = ompi_free_list_init_new(&mca_btl_sm_component.sm_frags_max, length,
|
|
|
|
CACHE_LINE_SIZE, OBJ_CLASS(mca_btl_sm_frag2_t),
|
|
|
|
length_payload, CACHE_LINE_SIZE,
|
|
|
|
mca_btl_sm_component.sm_free_list_num,
|
|
|
|
mca_btl_sm_component.sm_free_list_max,
|
|
|
|
mca_btl_sm_component.sm_free_list_inc,
|
|
|
|
mca_btl_sm_component.sm_mpool);
|
|
|
|
if ( OMPI_SUCCESS != i )
|
|
|
|
return i;
|
|
|
|
|
2009-06-27 04:12:56 +04:00
|
|
|
mca_btl_sm_component.num_outstanding_frags = 0;
|
|
|
|
|
|
|
|
mca_btl_sm_component.num_pending_sends = 0;
|
2009-02-20 22:51:57 +03:00
|
|
|
i = opal_free_list_init(&mca_btl_sm_component.pending_send_fl,
|
|
|
|
sizeof(btl_sm_pending_send_item_t),
|
|
|
|
OBJ_CLASS(opal_free_list_item_t),
|
|
|
|
16, -1, 32);
|
|
|
|
if ( OMPI_SUCCESS != i )
|
|
|
|
return i;
|
2008-03-11 17:39:10 +03:00
|
|
|
|
|
|
|
/* set flag indicating btl has been inited */
|
|
|
|
sm_btl->btl_inited = true;
|
|
|
|
|
|
|
|
return OMPI_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct mca_btl_base_endpoint_t *
|
|
|
|
create_sm_endpoint(int local_proc, struct ompi_proc_t *proc)
|
|
|
|
{
|
|
|
|
struct mca_btl_base_endpoint_t *ep;
|
2009-05-07 00:11:28 +04:00
|
|
|
#if OPAL_ENABLE_PROGRESS_THREADS == 1
|
2008-03-11 17:39:10 +03:00
|
|
|
char path[PATH_MAX];
|
|
|
|
#endif
|
|
|
|
|
|
|
|
ep = (struct mca_btl_base_endpoint_t*)
|
|
|
|
malloc(sizeof(struct mca_btl_base_endpoint_t));
|
|
|
|
if(NULL == ep)
|
|
|
|
return NULL;
|
|
|
|
ep->peer_smp_rank = local_proc + mca_btl_sm_component.num_smp_procs;
|
|
|
|
|
|
|
|
OBJ_CONSTRUCT(&ep->pending_sends, opal_list_t);
|
2009-05-07 00:11:28 +04:00
|
|
|
#if OPAL_ENABLE_PROGRESS_THREADS == 1
|
2008-03-11 17:39:10 +03:00
|
|
|
sprintf(path, "%s"OPAL_PATH_SEP"sm_fifo.%lu",
|
2009-03-06 00:56:03 +03:00
|
|
|
orte_process_info.job_session_dir,
|
2008-03-11 17:39:10 +03:00
|
|
|
(unsigned long)proc->proc_name.vpid);
|
|
|
|
ep->fifo_fd = open(path, O_WRONLY);
|
|
|
|
if(ep->fifo_fd < 0) {
|
2008-06-09 18:53:58 +04:00
|
|
|
opal_output(0, "mca_btl_sm_add_procs: open(%s) failed with errno=%d\n",
|
2008-03-11 17:39:10 +03:00
|
|
|
path, errno);
|
|
|
|
free(ep);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
return ep;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void calc_sm_max_procs(int n)
|
|
|
|
{
|
|
|
|
/* see if need to allocate space for extra procs */
|
|
|
|
if(0 > mca_btl_sm_component.sm_max_procs) {
|
|
|
|
/* no limit */
|
|
|
|
if(0 <= mca_btl_sm_component.sm_extra_procs) {
|
|
|
|
/* limit */
|
|
|
|
mca_btl_sm_component.sm_max_procs =
|
|
|
|
n + mca_btl_sm_component.sm_extra_procs;
|
|
|
|
} else {
|
|
|
|
/* no limit */
|
|
|
|
mca_btl_sm_component.sm_max_procs = 2 * n;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-03-20 11:15:58 +03:00
|
|
|
int mca_btl_sm_add_procs(
|
2008-03-09 16:17:13 +03:00
|
|
|
struct mca_btl_base_module_t* btl,
|
|
|
|
size_t nprocs,
|
|
|
|
struct ompi_proc_t **procs,
|
2005-06-30 09:50:55 +04:00
|
|
|
struct mca_btl_base_endpoint_t **peers,
|
2009-03-04 01:25:13 +03:00
|
|
|
opal_bitmap_t* reachability)
|
2005-05-24 02:06:50 +04:00
|
|
|
{
|
2008-03-11 17:39:10 +03:00
|
|
|
int return_code = OMPI_SUCCESS;
|
2009-05-20 21:41:13 +04:00
|
|
|
int32_t n_local_procs = 0, proc, j, my_smp_rank = -1;
|
2005-05-24 02:06:50 +04:00
|
|
|
ompi_proc_t* my_proc; /* pointer to caller's proc structure */
|
2008-03-11 17:39:10 +03:00
|
|
|
mca_btl_sm_t *sm_btl;
|
2007-02-01 20:18:35 +03:00
|
|
|
bool have_connected_peer = false;
|
2008-03-16 13:01:56 +03:00
|
|
|
char **bases;
|
2005-05-24 02:06:50 +04:00
|
|
|
/* initializion */
|
|
|
|
|
2008-03-11 17:39:10 +03:00
|
|
|
sm_btl = (mca_btl_sm_t *)btl;
|
2005-05-24 02:06:50 +04:00
|
|
|
|
|
|
|
/* get pointer to my proc structure */
|
2008-03-11 17:39:10 +03:00
|
|
|
if(NULL == (my_proc = ompi_proc_local()))
|
|
|
|
return OMPI_ERR_OUT_OF_RESOURCE;
|
2005-05-24 02:06:50 +04:00
|
|
|
|
|
|
|
/* Get unique host identifier for each process in the list,
|
|
|
|
* and idetify procs that are on this host. Add procs on this
|
|
|
|
* host to shared memory reachbility list. Also, get number
|
2008-03-11 17:39:10 +03:00
|
|
|
* of local procs in the procs list. */
|
|
|
|
for(proc = 0; proc < (int32_t)nprocs; proc++) {
|
2005-07-15 19:22:41 +04:00
|
|
|
/* check to see if this proc can be reached via shmem (i.e.,
|
|
|
|
if they're on my local host and in my job) */
|
2007-02-01 20:18:35 +03:00
|
|
|
if (procs[proc]->proc_name.jobid != my_proc->proc_name.jobid ||
|
2009-02-11 18:02:38 +03:00
|
|
|
!OPAL_PROC_ON_LOCAL_NODE(procs[proc]->proc_flags)) {
|
2007-03-21 16:29:19 +03:00
|
|
|
peers[proc] = NULL;
|
2005-05-24 02:06:50 +04:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2007-02-01 20:18:35 +03:00
|
|
|
/* check to see if this is me */
|
2008-03-11 17:39:10 +03:00
|
|
|
if(my_proc == procs[proc]) {
|
|
|
|
my_smp_rank = mca_btl_sm_component.my_smp_rank = n_local_procs++;
|
|
|
|
continue;
|
2007-02-01 20:18:35 +03:00
|
|
|
}
|
|
|
|
|
2008-03-11 17:39:10 +03:00
|
|
|
/* we have someone to talk to */
|
|
|
|
have_connected_peer = true;
|
2007-10-22 16:07:22 +04:00
|
|
|
|
2008-03-11 17:39:10 +03:00
|
|
|
if(!(peers[proc] = create_sm_endpoint(n_local_procs, procs[proc]))) {
|
|
|
|
return_code = OMPI_ERROR;
|
2005-07-15 19:22:41 +04:00
|
|
|
goto CLEANUP;
|
|
|
|
}
|
|
|
|
n_local_procs++;
|
2008-03-11 17:39:10 +03:00
|
|
|
|
|
|
|
/* add this proc to shared memory accessibility list */
|
2009-03-04 01:25:13 +03:00
|
|
|
return_code = opal_bitmap_set_bit(reachability, proc);
|
2008-03-11 17:39:10 +03:00
|
|
|
if(OMPI_SUCCESS != return_code)
|
|
|
|
goto CLEANUP;
|
2005-05-24 02:06:50 +04:00
|
|
|
}
|
2005-07-15 19:22:41 +04:00
|
|
|
|
2007-02-01 20:18:35 +03:00
|
|
|
/* jump out if there's not someone we can talk to */
|
2008-03-11 17:39:10 +03:00
|
|
|
if (!have_connected_peer)
|
2005-05-24 02:06:50 +04:00
|
|
|
goto CLEANUP;
|
|
|
|
|
|
|
|
/* make sure that my_smp_rank has been defined */
|
2008-03-11 17:39:10 +03:00
|
|
|
if(-1 == my_smp_rank) {
|
|
|
|
return_code = OMPI_ERROR;
|
2005-05-24 02:06:50 +04:00
|
|
|
goto CLEANUP;
|
|
|
|
}
|
|
|
|
|
2008-03-11 17:39:10 +03:00
|
|
|
calc_sm_max_procs(n_local_procs);
|
2005-05-24 02:06:50 +04:00
|
|
|
|
2008-03-11 17:39:10 +03:00
|
|
|
if (!sm_btl->btl_inited) {
|
|
|
|
return_code =
|
|
|
|
sm_btl_first_time_init(sm_btl, mca_btl_sm_component.sm_max_procs);
|
|
|
|
if(return_code != OMPI_SUCCESS)
|
2005-05-24 02:06:50 +04:00
|
|
|
goto CLEANUP;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* set local proc's smp rank in the peers structure for
|
2009-05-20 21:41:13 +04:00
|
|
|
* rapid access and calculate reachability */
|
2008-03-11 17:39:10 +03:00
|
|
|
for(proc = 0; proc < (int32_t)nprocs; proc++) {
|
|
|
|
if(NULL == peers[proc])
|
|
|
|
continue;
|
|
|
|
mca_btl_sm_component.sm_peers[peers[proc]->peer_smp_rank] = peers[proc];
|
|
|
|
peers[proc]->my_smp_rank = my_smp_rank;
|
2005-05-24 02:06:50 +04:00
|
|
|
}
|
|
|
|
|
2008-03-16 13:01:56 +03:00
|
|
|
bases = mca_btl_sm_component.shm_bases;
|
2005-05-24 02:06:50 +04:00
|
|
|
|
2009-02-17 18:58:15 +03:00
|
|
|
/* initialize own FIFOs */
|
|
|
|
/*
|
|
|
|
* The receiver initializes all its FIFOs. All components will
|
|
|
|
* be allocated near the receiver. Nothing will be local to
|
|
|
|
* "the sender" since there will be many senders.
|
|
|
|
*/
|
|
|
|
for(j = mca_btl_sm_component.num_smp_procs;
|
|
|
|
j < mca_btl_sm_component.num_smp_procs + FIFO_MAP_NUM(n_local_procs); j++) {
|
|
|
|
|
|
|
|
return_code = sm_fifo_init( mca_btl_sm_component.fifo_size,
|
|
|
|
mca_btl_sm_component.sm_mpool,
|
|
|
|
&mca_btl_sm_component.fifo[my_smp_rank][j],
|
|
|
|
mca_btl_sm_component.fifo_lazy_free);
|
|
|
|
if(return_code != OMPI_SUCCESS)
|
|
|
|
goto CLEANUP;
|
|
|
|
}
|
|
|
|
|
2009-05-20 02:50:44 +04:00
|
|
|
opal_atomic_wmb();
|
|
|
|
|
2009-04-01 01:46:27 +04:00
|
|
|
/* Sync with other local procs. Force the FIFO initialization to always
|
|
|
|
* happens before the readers access it.
|
|
|
|
*/
|
|
|
|
opal_atomic_add_32( &mca_btl_sm_component.mmap_file->map_seg->seg_inited, 1);
|
|
|
|
while( n_local_procs >
|
|
|
|
mca_btl_sm_component.mmap_file->map_seg->seg_inited) {
|
|
|
|
opal_progress();
|
2009-05-20 02:50:44 +04:00
|
|
|
opal_atomic_rmb();
|
2009-04-01 01:46:27 +04:00
|
|
|
}
|
|
|
|
|
2009-02-17 18:58:15 +03:00
|
|
|
/* coordinate with other processes */
|
2008-03-11 17:39:10 +03:00
|
|
|
for(j = mca_btl_sm_component.num_smp_procs;
|
|
|
|
j < mca_btl_sm_component.num_smp_procs + n_local_procs; j++) {
|
|
|
|
ptrdiff_t diff;
|
2005-05-24 02:06:50 +04:00
|
|
|
|
|
|
|
/* spin until this element is allocated */
|
2009-02-17 18:58:15 +03:00
|
|
|
/* doesn't really wait for that process... FIFO might be allocated, but not initialized */
|
2009-05-20 02:50:44 +04:00
|
|
|
opal_atomic_rmb();
|
2008-03-16 13:01:56 +03:00
|
|
|
while(NULL == mca_btl_sm_component.shm_fifo[j]) {
|
2007-03-21 13:25:10 +03:00
|
|
|
opal_progress();
|
2009-05-20 02:50:44 +04:00
|
|
|
opal_atomic_rmb();
|
2005-10-19 04:56:14 +04:00
|
|
|
}
|
2005-05-24 02:06:50 +04:00
|
|
|
|
2005-11-13 01:32:09 +03:00
|
|
|
/* Calculate the difference as (my_base - their_base) */
|
2008-03-16 13:01:56 +03:00
|
|
|
diff = ADDR2OFFSET(bases[my_smp_rank], bases[j]);
|
2007-03-22 15:18:44 +03:00
|
|
|
|
2008-03-11 17:39:10 +03:00
|
|
|
/* store local address of remote fifos */
|
|
|
|
mca_btl_sm_component.fifo[j] =
|
2009-02-17 18:58:15 +03:00
|
|
|
(sm_fifo_t*)OFFSET2ADDR(diff, mca_btl_sm_component.shm_fifo[j]);
|
2007-03-22 15:18:44 +03:00
|
|
|
|
2008-06-15 17:43:28 +04:00
|
|
|
/* cache local copy of peer memory node number */
|
2009-02-17 18:58:15 +03:00
|
|
|
mca_btl_sm_component.mem_nodes[j] = mca_btl_sm_component.shm_mem_nodes[j];
|
2005-05-24 02:06:50 +04:00
|
|
|
}
|
|
|
|
|
2008-03-11 17:39:10 +03:00
|
|
|
/* update the local smp process count */
|
|
|
|
mca_btl_sm_component.num_smp_procs += n_local_procs;
|
2005-05-24 02:06:50 +04:00
|
|
|
|
2006-10-07 01:13:49 +04:00
|
|
|
/* make sure we have enough eager fragmnents for each process */
|
2008-05-30 07:58:39 +04:00
|
|
|
return_code = ompi_free_list_resize(&mca_btl_sm_component.sm_frags_eager,
|
2008-03-11 17:39:10 +03:00
|
|
|
mca_btl_sm_component.num_smp_procs * 2);
|
|
|
|
if (OMPI_SUCCESS != return_code)
|
2006-10-07 01:13:49 +04:00
|
|
|
goto CLEANUP;
|
2005-05-24 02:06:50 +04:00
|
|
|
|
|
|
|
CLEANUP:
|
|
|
|
return return_code;
|
|
|
|
}
|
|
|
|
|
2005-06-30 09:50:55 +04:00
|
|
|
int mca_btl_sm_del_procs(
|
2008-03-09 16:17:13 +03:00
|
|
|
struct mca_btl_base_module_t* btl,
|
2005-05-24 02:06:50 +04:00
|
|
|
size_t nprocs,
|
2008-03-09 16:17:13 +03:00
|
|
|
struct ompi_proc_t **procs,
|
2005-06-30 09:50:55 +04:00
|
|
|
struct mca_btl_base_endpoint_t **peers)
|
2005-05-24 02:06:50 +04:00
|
|
|
{
|
|
|
|
return OMPI_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
2005-06-30 09:50:55 +04:00
|
|
|
* MCA->BTL Clean up any resources held by BTL module
|
2005-05-24 02:06:50 +04:00
|
|
|
* before the module is unloaded.
|
|
|
|
*
|
2005-06-30 09:50:55 +04:00
|
|
|
* @param btl (IN) BTL module.
|
2005-05-24 02:06:50 +04:00
|
|
|
*
|
2005-06-30 09:50:55 +04:00
|
|
|
* Prior to unloading a BTL module, the MCA framework will call
|
|
|
|
* the BTL finalize method of the module. Any resources held by
|
|
|
|
* the BTL should be released and if required the memory corresponding
|
|
|
|
* to the BTL module freed.
|
2005-05-24 02:06:50 +04:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2005-06-30 09:50:55 +04:00
|
|
|
int mca_btl_sm_finalize(struct mca_btl_base_module_t* btl)
|
2005-05-24 02:06:50 +04:00
|
|
|
{
|
|
|
|
return OMPI_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-03-09 16:17:13 +03:00
|
|
|
/*
|
2007-02-13 15:01:36 +03:00
|
|
|
* Register callback function for error handling..
|
|
|
|
*/
|
|
|
|
int mca_btl_sm_register_error_cb(
|
|
|
|
struct mca_btl_base_module_t* btl,
|
|
|
|
mca_btl_base_module_error_cb_fn_t cbfunc)
|
|
|
|
{
|
|
|
|
mca_btl_sm_t *sm_btl = (mca_btl_sm_t *)btl;
|
|
|
|
sm_btl->error_cb = cbfunc;
|
|
|
|
return OMPI_SUCCESS;
|
|
|
|
}
|
2005-05-24 02:06:50 +04:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Allocate a segment.
|
|
|
|
*
|
2005-06-30 09:50:55 +04:00
|
|
|
* @param btl (IN) BTL module
|
2005-05-24 02:06:50 +04:00
|
|
|
* @param size (IN) Request segment size.
|
|
|
|
*/
|
2005-06-30 09:50:55 +04:00
|
|
|
extern mca_btl_base_descriptor_t* mca_btl_sm_alloc(
|
|
|
|
struct mca_btl_base_module_t* btl,
|
2007-12-09 17:00:42 +03:00
|
|
|
struct mca_btl_base_endpoint_t* endpoint,
|
2007-05-24 23:51:26 +04:00
|
|
|
uint8_t order,
|
2007-12-09 17:08:01 +03:00
|
|
|
size_t size,
|
|
|
|
uint32_t flags)
|
2005-05-24 02:06:50 +04:00
|
|
|
{
|
2008-12-18 01:14:59 +03:00
|
|
|
mca_btl_sm_frag_t* frag = NULL;
|
2005-05-24 02:06:50 +04:00
|
|
|
int rc;
|
2005-06-30 09:50:55 +04:00
|
|
|
if(size <= mca_btl_sm_component.eager_limit) {
|
2008-12-18 01:14:59 +03:00
|
|
|
MCA_BTL_SM_FRAG_ALLOC_EAGER(frag,rc);
|
2005-09-07 17:40:22 +04:00
|
|
|
} else if (size <= mca_btl_sm_component.max_frag_size) {
|
2008-12-18 01:14:59 +03:00
|
|
|
MCA_BTL_SM_FRAG_ALLOC_MAX(frag,rc);
|
2005-05-24 02:06:50 +04:00
|
|
|
}
|
2006-10-07 01:13:49 +04:00
|
|
|
|
2008-12-18 01:14:59 +03:00
|
|
|
if (OPAL_LIKELY(frag != NULL)) {
|
2006-10-07 01:13:49 +04:00
|
|
|
frag->segment.seg_len = size;
|
2008-02-18 20:39:30 +03:00
|
|
|
frag->base.des_flags = flags;
|
2006-10-07 01:13:49 +04:00
|
|
|
}
|
2005-06-30 09:50:55 +04:00
|
|
|
return (mca_btl_base_descriptor_t*)frag;
|
2005-05-24 02:06:50 +04:00
|
|
|
}
|
2006-10-07 01:13:49 +04:00
|
|
|
|
2005-05-24 02:06:50 +04:00
|
|
|
/**
|
2005-06-30 09:50:55 +04:00
|
|
|
* Return a segment allocated by this BTL.
|
2005-05-24 02:06:50 +04:00
|
|
|
*
|
2005-06-30 09:50:55 +04:00
|
|
|
* @param btl (IN) BTL module
|
2005-05-24 02:06:50 +04:00
|
|
|
* @param segment (IN) Allocated segment.
|
|
|
|
*/
|
2005-06-30 09:50:55 +04:00
|
|
|
extern int mca_btl_sm_free(
|
|
|
|
struct mca_btl_base_module_t* btl,
|
|
|
|
mca_btl_base_descriptor_t* des)
|
2005-05-24 02:06:50 +04:00
|
|
|
{
|
2005-06-30 09:50:55 +04:00
|
|
|
mca_btl_sm_frag_t* frag = (mca_btl_sm_frag_t*)des;
|
2006-05-31 18:24:32 +04:00
|
|
|
MCA_BTL_SM_FRAG_RETURN(frag);
|
2008-03-09 16:17:13 +03:00
|
|
|
|
2005-05-24 02:06:50 +04:00
|
|
|
return OMPI_SUCCESS;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Pack data
|
|
|
|
*
|
2005-06-30 09:50:55 +04:00
|
|
|
* @param btl (IN) BTL module
|
2005-05-24 02:06:50 +04:00
|
|
|
*/
|
2005-06-30 09:50:55 +04:00
|
|
|
struct mca_btl_base_descriptor_t* mca_btl_sm_prepare_src(
|
|
|
|
struct mca_btl_base_module_t* btl,
|
|
|
|
struct mca_btl_base_endpoint_t* endpoint,
|
2005-06-25 01:12:38 +04:00
|
|
|
mca_mpool_base_registration_t* registration,
|
- Split the datatype engine into two parts: an MPI specific part in
OMPI
and a language agnostic part in OPAL. The convertor is completely
moved into OPAL. This offers several benefits as described in RFC
http://www.open-mpi.org/community/lists/devel/2009/07/6387.php
namely:
- Fewer basic types (int* and float* types, boolean and wchar
- Fixing naming scheme to ompi-nomenclature.
- Usability outside of the ompi-layer.
- Due to the fixed nature of simple opal types, their information is
completely
known at compile time and therefore constified
- With fewer datatypes (22), the actual sizes of bit-field types may be
reduced
from 64 to 32 bits, allowing reorganizing the opal_datatype
structure, eliminating holes and keeping data required in convertor
(upon send/recv) in one cacheline...
This has implications to the convertor-datastructure and other parts
of the code.
- Several performance tests have been run, the netpipe latency does not
change with
this patch on Linux/x86-64 on the smoky cluster.
- Extensive tests have been done to verify correctness (no new
regressions) using:
1. mpi_test_suite on linux/x86-64 using clean ompi-trunk and
ompi-ddt:
a. running both trunk and ompi-ddt resulted in no differences
(except for MPI_SHORT_INT and MPI_TYPE_MIX_LB_UB do now run
correctly).
b. with --enable-memchecker and running under valgrind (one buglet
when run with static found in test-suite, commited)
2. ibm testsuite on linux/x86-64 using clean ompi-trunk and ompi-ddt:
all passed (except for the dynamic/ tests failed!! as trunk/MTT)
3. compilation and usage of HDF5 tests on Jaguar using PGI and
PathScale compilers.
4. compilation and usage on Scicortex.
- Please note, that for the heterogeneous case, (-m32 compiled
binaries/ompi), neither
ompi-trunk, nor ompi-ddt branch would successfully launch.
This commit was SVN r21641.
2009-07-13 08:56:31 +04:00
|
|
|
struct opal_convertor_t* convertor,
|
2007-05-24 23:51:26 +04:00
|
|
|
uint8_t order,
|
2005-05-24 02:06:50 +04:00
|
|
|
size_t reserve,
|
2007-12-09 17:08:01 +03:00
|
|
|
size_t* size,
|
|
|
|
uint32_t flags)
|
2005-05-24 02:06:50 +04:00
|
|
|
{
|
2005-06-30 09:50:55 +04:00
|
|
|
mca_btl_sm_frag_t* frag;
|
2005-06-01 18:34:22 +04:00
|
|
|
struct iovec iov;
|
|
|
|
uint32_t iov_count = 1;
|
2005-06-08 23:13:28 +04:00
|
|
|
size_t max_data = *size;
|
2005-06-01 18:34:22 +04:00
|
|
|
int rc;
|
|
|
|
|
2009-02-20 22:51:57 +03:00
|
|
|
if ( reserve + max_data <= mca_btl_sm_component.eager_limit ) {
|
|
|
|
MCA_BTL_SM_FRAG_ALLOC_EAGER(frag,rc);
|
|
|
|
} else {
|
|
|
|
MCA_BTL_SM_FRAG_ALLOC_MAX(frag, rc);
|
|
|
|
}
|
2008-12-18 01:14:59 +03:00
|
|
|
if(OPAL_UNLIKELY(NULL == frag)) {
|
2005-06-01 18:34:22 +04:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2005-06-09 00:38:03 +04:00
|
|
|
if(reserve + max_data > frag->size) {
|
2005-06-02 01:09:43 +04:00
|
|
|
max_data = frag->size - reserve;
|
2008-03-09 16:17:13 +03:00
|
|
|
}
|
2005-06-01 18:34:22 +04:00
|
|
|
iov.iov_len = max_data;
|
2007-03-05 17:17:50 +03:00
|
|
|
iov.iov_base =
|
|
|
|
(IOVBASE_TYPE*)(((unsigned char*)(frag->segment.seg_addr.pval)) +
|
|
|
|
reserve);
|
2005-06-01 18:34:22 +04:00
|
|
|
|
- Split the datatype engine into two parts: an MPI specific part in
OMPI
and a language agnostic part in OPAL. The convertor is completely
moved into OPAL. This offers several benefits as described in RFC
http://www.open-mpi.org/community/lists/devel/2009/07/6387.php
namely:
- Fewer basic types (int* and float* types, boolean and wchar
- Fixing naming scheme to ompi-nomenclature.
- Usability outside of the ompi-layer.
- Due to the fixed nature of simple opal types, their information is
completely
known at compile time and therefore constified
- With fewer datatypes (22), the actual sizes of bit-field types may be
reduced
from 64 to 32 bits, allowing reorganizing the opal_datatype
structure, eliminating holes and keeping data required in convertor
(upon send/recv) in one cacheline...
This has implications to the convertor-datastructure and other parts
of the code.
- Several performance tests have been run, the netpipe latency does not
change with
this patch on Linux/x86-64 on the smoky cluster.
- Extensive tests have been done to verify correctness (no new
regressions) using:
1. mpi_test_suite on linux/x86-64 using clean ompi-trunk and
ompi-ddt:
a. running both trunk and ompi-ddt resulted in no differences
(except for MPI_SHORT_INT and MPI_TYPE_MIX_LB_UB do now run
correctly).
b. with --enable-memchecker and running under valgrind (one buglet
when run with static found in test-suite, commited)
2. ibm testsuite on linux/x86-64 using clean ompi-trunk and ompi-ddt:
all passed (except for the dynamic/ tests failed!! as trunk/MTT)
3. compilation and usage of HDF5 tests on Jaguar using PGI and
PathScale compilers.
4. compilation and usage on Scicortex.
- Please note, that for the heterogeneous case, (-m32 compiled
binaries/ompi), neither
ompi-trunk, nor ompi-ddt branch would successfully launch.
This commit was SVN r21641.
2009-07-13 08:56:31 +04:00
|
|
|
rc = opal_convertor_pack(convertor, &iov, &iov_count, &max_data );
|
2005-06-01 18:34:22 +04:00
|
|
|
if(rc < 0) {
|
2006-05-31 18:24:32 +04:00
|
|
|
MCA_BTL_SM_FRAG_RETURN(frag);
|
2005-06-01 18:34:22 +04:00
|
|
|
return NULL;
|
|
|
|
}
|
2005-06-09 00:38:03 +04:00
|
|
|
frag->segment.seg_len = reserve + max_data;
|
2008-02-18 20:39:30 +03:00
|
|
|
frag->base.des_flags = flags;
|
2005-06-01 18:34:22 +04:00
|
|
|
*size = max_data;
|
|
|
|
return &frag->base;
|
2005-05-24 02:06:50 +04:00
|
|
|
}
|
|
|
|
|
2008-05-30 07:58:39 +04:00
|
|
|
#if 0
|
|
|
|
#define MCA_BTL_SM_TOUCH_DATA_TILL_CACHELINE_BOUNDARY(sm_frag) \
|
|
|
|
do { \
|
|
|
|
char* _memory = (char*)(sm_frag)->segment.seg_addr.pval + \
|
|
|
|
(sm_frag)->segment.seg_len; \
|
|
|
|
int* _intmem; \
|
|
|
|
size_t align = (intptr_t)_memory & 0xFUL; \
|
|
|
|
switch( align & 0x3 ) { \
|
|
|
|
case 3: *_memory = 0; _memory++; \
|
|
|
|
case 2: *_memory = 0; _memory++; \
|
|
|
|
case 1: *_memory = 0; _memory++; \
|
|
|
|
} \
|
|
|
|
align >>= 2; \
|
|
|
|
_intmem = (int*)_memory; \
|
|
|
|
switch( align ) { \
|
|
|
|
case 3: *_intmem = 0; _intmem++; \
|
|
|
|
case 2: *_intmem = 0; _intmem++; \
|
|
|
|
case 1: *_intmem = 0; _intmem++; \
|
|
|
|
} \
|
|
|
|
} while(0)
|
|
|
|
#else
|
|
|
|
#define MCA_BTL_SM_TOUCH_DATA_TILL_CACHELINE_BOUNDARY(sm_frag)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
if( OPAL_LIKELY(align > 0) ) { \
|
|
|
|
align = 0xFUL - align; \
|
|
|
|
memset( _memory, 0, align ); \
|
|
|
|
} \
|
|
|
|
|
|
|
|
#endif
|
2008-03-09 16:17:13 +03:00
|
|
|
|
2005-05-24 02:06:50 +04:00
|
|
|
/**
|
2008-05-30 07:58:39 +04:00
|
|
|
* Initiate an inline send to the peer. If failure then return a descriptor.
|
2005-05-24 02:06:50 +04:00
|
|
|
*
|
2005-06-30 09:50:55 +04:00
|
|
|
* @param btl (IN) BTL module
|
|
|
|
* @param peer (IN) BTL peer addressing
|
2005-05-24 02:06:50 +04:00
|
|
|
*/
|
2008-05-30 07:58:39 +04:00
|
|
|
int mca_btl_sm_sendi( struct mca_btl_base_module_t* btl,
|
|
|
|
struct mca_btl_base_endpoint_t* endpoint,
|
- Split the datatype engine into two parts: an MPI specific part in
OMPI
and a language agnostic part in OPAL. The convertor is completely
moved into OPAL. This offers several benefits as described in RFC
http://www.open-mpi.org/community/lists/devel/2009/07/6387.php
namely:
- Fewer basic types (int* and float* types, boolean and wchar
- Fixing naming scheme to ompi-nomenclature.
- Usability outside of the ompi-layer.
- Due to the fixed nature of simple opal types, their information is
completely
known at compile time and therefore constified
- With fewer datatypes (22), the actual sizes of bit-field types may be
reduced
from 64 to 32 bits, allowing reorganizing the opal_datatype
structure, eliminating holes and keeping data required in convertor
(upon send/recv) in one cacheline...
This has implications to the convertor-datastructure and other parts
of the code.
- Several performance tests have been run, the netpipe latency does not
change with
this patch on Linux/x86-64 on the smoky cluster.
- Extensive tests have been done to verify correctness (no new
regressions) using:
1. mpi_test_suite on linux/x86-64 using clean ompi-trunk and
ompi-ddt:
a. running both trunk and ompi-ddt resulted in no differences
(except for MPI_SHORT_INT and MPI_TYPE_MIX_LB_UB do now run
correctly).
b. with --enable-memchecker and running under valgrind (one buglet
when run with static found in test-suite, commited)
2. ibm testsuite on linux/x86-64 using clean ompi-trunk and ompi-ddt:
all passed (except for the dynamic/ tests failed!! as trunk/MTT)
3. compilation and usage of HDF5 tests on Jaguar using PGI and
PathScale compilers.
4. compilation and usage on Scicortex.
- Please note, that for the heterogeneous case, (-m32 compiled
binaries/ompi), neither
ompi-trunk, nor ompi-ddt branch would successfully launch.
This commit was SVN r21641.
2009-07-13 08:56:31 +04:00
|
|
|
struct opal_convertor_t* convertor,
|
2008-05-30 07:58:39 +04:00
|
|
|
void* header,
|
|
|
|
size_t header_size,
|
|
|
|
size_t payload_size,
|
|
|
|
uint8_t order,
|
|
|
|
uint32_t flags,
|
|
|
|
mca_btl_base_tag_t tag,
|
|
|
|
mca_btl_base_descriptor_t** descriptor )
|
|
|
|
{
|
2009-02-26 21:10:50 +03:00
|
|
|
size_t length = (header_size + payload_size);
|
2008-05-30 07:58:39 +04:00
|
|
|
mca_btl_sm_frag_t* frag;
|
|
|
|
int rc;
|
2005-05-24 02:06:50 +04:00
|
|
|
|
2009-06-28 03:42:09 +04:00
|
|
|
if ( mca_btl_sm_component.num_outstanding_frags * 2 > (int) mca_btl_sm_component.fifo_size ) {
|
2009-06-27 04:12:56 +04:00
|
|
|
mca_btl_sm_component_progress();
|
|
|
|
}
|
|
|
|
|
2009-02-26 21:10:50 +03:00
|
|
|
/* this check should be unnecessary... turn into an assertion? */
|
2008-05-30 07:58:39 +04:00
|
|
|
if( length < mca_btl_sm_component.eager_limit ) {
|
2009-02-26 21:10:50 +03:00
|
|
|
|
|
|
|
/* allocate a fragment, giving up if we can't get one */
|
|
|
|
/* note that frag==NULL is equivalent to rc returning an error code */
|
2008-12-18 01:14:59 +03:00
|
|
|
MCA_BTL_SM_FRAG_ALLOC_EAGER(frag, rc);
|
2008-05-30 07:58:39 +04:00
|
|
|
if( OPAL_UNLIKELY(NULL == frag) ) {
|
|
|
|
*descriptor = NULL;
|
|
|
|
return rc;
|
|
|
|
}
|
2009-02-26 21:10:50 +03:00
|
|
|
|
|
|
|
/* fill in fragment fields */
|
2008-05-30 07:58:39 +04:00
|
|
|
frag->segment.seg_len = length;
|
2009-02-26 21:10:50 +03:00
|
|
|
frag->hdr->len = length;
|
2008-05-30 07:58:39 +04:00
|
|
|
assert( 0 == (flags & MCA_BTL_DES_SEND_ALWAYS_CALLBACK) );
|
2009-02-26 21:10:50 +03:00
|
|
|
frag->base.des_flags = flags | MCA_BTL_DES_FLAGS_BTL_OWNERSHIP; /* why do any flags matter here other than OWNERSHIP? */
|
2008-05-30 07:58:39 +04:00
|
|
|
frag->hdr->tag = tag;
|
|
|
|
frag->endpoint = endpoint;
|
|
|
|
|
2009-02-26 21:10:50 +03:00
|
|
|
/* write the match header (with MPI comm/tag/etc. info) */
|
2008-05-30 07:58:39 +04:00
|
|
|
memcpy( frag->segment.seg_addr.pval, header, header_size );
|
2009-02-26 21:10:50 +03:00
|
|
|
|
|
|
|
/* write the message data if there is any */
|
|
|
|
/*
|
|
|
|
We can add MEMCHECKER calls before and after the packing.
|
|
|
|
*/
|
2008-05-30 07:58:39 +04:00
|
|
|
if( payload_size ) {
|
2009-02-26 21:10:50 +03:00
|
|
|
size_t max_data;
|
2008-05-30 07:58:39 +04:00
|
|
|
struct iovec iov;
|
2008-06-12 21:24:39 +04:00
|
|
|
uint32_t iov_count;
|
2008-05-30 07:58:39 +04:00
|
|
|
/* pack the data into the supplied buffer */
|
|
|
|
iov.iov_base = (IOVBASE_TYPE*)((unsigned char*)frag->segment.seg_addr.pval + header_size);
|
2008-06-12 21:24:39 +04:00
|
|
|
iov.iov_len = max_data = payload_size;
|
2008-05-30 07:58:39 +04:00
|
|
|
iov_count = 1;
|
|
|
|
|
- Split the datatype engine into two parts: an MPI specific part in
OMPI
and a language agnostic part in OPAL. The convertor is completely
moved into OPAL. This offers several benefits as described in RFC
http://www.open-mpi.org/community/lists/devel/2009/07/6387.php
namely:
- Fewer basic types (int* and float* types, boolean and wchar
- Fixing naming scheme to ompi-nomenclature.
- Usability outside of the ompi-layer.
- Due to the fixed nature of simple opal types, their information is
completely
known at compile time and therefore constified
- With fewer datatypes (22), the actual sizes of bit-field types may be
reduced
from 64 to 32 bits, allowing reorganizing the opal_datatype
structure, eliminating holes and keeping data required in convertor
(upon send/recv) in one cacheline...
This has implications to the convertor-datastructure and other parts
of the code.
- Several performance tests have been run, the netpipe latency does not
change with
this patch on Linux/x86-64 on the smoky cluster.
- Extensive tests have been done to verify correctness (no new
regressions) using:
1. mpi_test_suite on linux/x86-64 using clean ompi-trunk and
ompi-ddt:
a. running both trunk and ompi-ddt resulted in no differences
(except for MPI_SHORT_INT and MPI_TYPE_MIX_LB_UB do now run
correctly).
b. with --enable-memchecker and running under valgrind (one buglet
when run with static found in test-suite, commited)
2. ibm testsuite on linux/x86-64 using clean ompi-trunk and ompi-ddt:
all passed (except for the dynamic/ tests failed!! as trunk/MTT)
3. compilation and usage of HDF5 tests on Jaguar using PGI and
PathScale compilers.
4. compilation and usage on Scicortex.
- Please note, that for the heterogeneous case, (-m32 compiled
binaries/ompi), neither
ompi-trunk, nor ompi-ddt branch would successfully launch.
This commit was SVN r21641.
2009-07-13 08:56:31 +04:00
|
|
|
(void)opal_convertor_pack( convertor, &iov, &iov_count, &max_data);
|
2008-05-30 07:58:39 +04:00
|
|
|
|
|
|
|
assert(max_data == payload_size);
|
|
|
|
}
|
2009-02-26 21:10:50 +03:00
|
|
|
|
2008-05-30 07:58:39 +04:00
|
|
|
MCA_BTL_SM_TOUCH_DATA_TILL_CACHELINE_BOUNDARY(frag);
|
2009-02-26 21:10:50 +03:00
|
|
|
|
|
|
|
/* write the fragment pointer to the FIFO */
|
2008-05-30 07:58:39 +04:00
|
|
|
/*
|
2009-02-26 21:10:50 +03:00
|
|
|
* Note that we don't care what the FIFO-write return code is. Even if
|
|
|
|
* the return code indicates failure, the write has still "completed" from
|
|
|
|
* our point of view: it has been posted to a "pending send" queue.
|
2008-05-30 07:58:39 +04:00
|
|
|
*/
|
2009-06-27 04:12:56 +04:00
|
|
|
OPAL_THREAD_ADD32(&mca_btl_sm_component.num_outstanding_frags, +1);
|
2008-05-30 07:58:39 +04:00
|
|
|
MCA_BTL_SM_FIFO_WRITE(endpoint, endpoint->my_smp_rank,
|
2009-06-27 04:12:56 +04:00
|
|
|
endpoint->peer_smp_rank, (void *) VIRTUAL2RELATIVE(frag->hdr), false, true, rc);
|
2009-02-26 21:10:50 +03:00
|
|
|
return OMPI_SUCCESS;
|
2008-05-30 07:58:39 +04:00
|
|
|
}
|
2009-02-26 21:10:50 +03:00
|
|
|
|
|
|
|
/* presumably, this code path will never get executed */
|
2008-05-30 07:58:39 +04:00
|
|
|
*descriptor = mca_btl_sm_alloc( btl, endpoint, order,
|
|
|
|
payload_size + header_size, flags);
|
|
|
|
return OMPI_ERR_RESOURCE_BUSY;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Initiate a send to the peer.
|
|
|
|
*
|
|
|
|
* @param btl (IN) BTL module
|
|
|
|
* @param peer (IN) BTL peer addressing
|
|
|
|
*/
|
2008-09-30 22:30:35 +04:00
|
|
|
int mca_btl_sm_send( struct mca_btl_base_module_t* btl,
|
|
|
|
struct mca_btl_base_endpoint_t* endpoint,
|
|
|
|
struct mca_btl_base_descriptor_t* descriptor,
|
|
|
|
mca_btl_base_tag_t tag )
|
2005-05-24 02:06:50 +04:00
|
|
|
{
|
2005-06-30 09:50:55 +04:00
|
|
|
mca_btl_sm_frag_t* frag = (mca_btl_sm_frag_t*)descriptor;
|
2007-10-22 16:07:22 +04:00
|
|
|
int rc;
|
2005-05-24 02:06:50 +04:00
|
|
|
|
2009-06-28 03:42:09 +04:00
|
|
|
if ( mca_btl_sm_component.num_outstanding_frags * 2 > (int) mca_btl_sm_component.fifo_size ) {
|
2009-06-27 04:12:56 +04:00
|
|
|
mca_btl_sm_component_progress();
|
|
|
|
}
|
|
|
|
|
2007-10-22 16:07:22 +04:00
|
|
|
/* available header space */
|
2007-03-05 17:24:09 +03:00
|
|
|
frag->hdr->len = frag->segment.seg_len;
|
2007-08-28 01:41:04 +04:00
|
|
|
/* type of message, pt-2-pt, one-sided, etc */
|
2007-03-05 17:24:09 +03:00
|
|
|
frag->hdr->tag = tag;
|
2005-05-24 02:06:50 +04:00
|
|
|
|
2008-05-30 07:58:39 +04:00
|
|
|
MCA_BTL_SM_TOUCH_DATA_TILL_CACHELINE_BOUNDARY(frag);
|
|
|
|
|
2007-10-22 16:07:22 +04:00
|
|
|
frag->endpoint = endpoint;
|
|
|
|
|
2008-03-09 16:17:13 +03:00
|
|
|
/*
|
2005-05-24 02:06:50 +04:00
|
|
|
* post the descriptor in the queue - post with the relative
|
2008-03-09 16:17:13 +03:00
|
|
|
* address
|
2005-05-24 02:06:50 +04:00
|
|
|
*/
|
2009-06-27 04:12:56 +04:00
|
|
|
OPAL_THREAD_ADD32(&mca_btl_sm_component.num_outstanding_frags, +1);
|
2007-10-22 16:07:22 +04:00
|
|
|
MCA_BTL_SM_FIFO_WRITE(endpoint, endpoint->my_smp_rank,
|
2009-06-27 04:12:56 +04:00
|
|
|
endpoint->peer_smp_rank, (void *) VIRTUAL2RELATIVE(frag->hdr), false, true, rc);
|
2008-08-17 23:00:50 +04:00
|
|
|
if( OPAL_LIKELY(0 == rc) ) {
|
|
|
|
return 1; /* the data is completely gone */
|
|
|
|
}
|
|
|
|
frag->base.des_flags |= MCA_BTL_DES_SEND_ALWAYS_CALLBACK;
|
2008-08-18 00:07:53 +04:00
|
|
|
/* not yet gone, but pending. Let the upper level knows that
|
|
|
|
* the callback will be triggered when the data will be sent.
|
|
|
|
*/
|
|
|
|
return 0;
|
2005-05-24 02:06:50 +04:00
|
|
|
}
|
2007-03-17 02:11:45 +03:00
|
|
|
|
2008-10-16 19:09:00 +04:00
|
|
|
#if OPAL_ENABLE_FT == 0
|
2007-03-17 02:11:45 +03:00
|
|
|
int mca_btl_sm_ft_event(int state) {
|
2008-10-16 19:09:00 +04:00
|
|
|
return OMPI_SUCCESS;
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
int mca_btl_sm_ft_event(int state) {
|
|
|
|
/* Notify mpool */
|
|
|
|
if( NULL != mca_btl_sm_component.sm_mpool &&
|
|
|
|
NULL != mca_btl_sm_component.sm_mpool->mpool_ft_event) {
|
|
|
|
mca_btl_sm_component.sm_mpool->mpool_ft_event(state);
|
|
|
|
}
|
|
|
|
|
2007-03-17 02:11:45 +03:00
|
|
|
if(OPAL_CRS_CHECKPOINT == state) {
|
2008-10-16 19:09:00 +04:00
|
|
|
if( NULL != mca_btl_sm_component.mmap_file ) {
|
|
|
|
/* On restart we need the old file names to exist (not necessarily
|
|
|
|
* contain content) so the CRS component does not fail when searching
|
|
|
|
* for these old file handles. The restart procedure will make sure
|
|
|
|
* these files get cleaned up appropriately.
|
|
|
|
*/
|
|
|
|
opal_crs_base_metadata_write_token(NULL, CRS_METADATA_TOUCH, mca_btl_sm_component.mmap_file->map_path);
|
|
|
|
|
|
|
|
/* Record the job session directory */
|
2009-03-06 00:56:03 +03:00
|
|
|
opal_crs_base_metadata_write_token(NULL, CRS_METADATA_MKDIR, orte_process_info.job_session_dir);
|
2008-10-16 19:09:00 +04:00
|
|
|
}
|
2007-03-17 02:11:45 +03:00
|
|
|
}
|
|
|
|
else if(OPAL_CRS_CONTINUE == state) {
|
2008-10-16 19:09:00 +04:00
|
|
|
if( ompi_cr_continue_like_restart ) {
|
|
|
|
if( NULL != mca_btl_sm_component.mmap_file ) {
|
|
|
|
/* Do not Add session directory on continue */
|
|
|
|
|
|
|
|
/* Add shared memory file */
|
|
|
|
opal_crs_base_cleanup_append(mca_btl_sm_component.mmap_file->map_path, false);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Clear this so we force the module to re-init the sm files */
|
|
|
|
mca_btl_sm_component.sm_mpool = NULL;
|
|
|
|
}
|
2007-03-17 02:11:45 +03:00
|
|
|
}
|
2008-10-16 19:09:00 +04:00
|
|
|
else if(OPAL_CRS_RESTART == state ||
|
|
|
|
OPAL_CRS_RESTART_PRE == state) {
|
|
|
|
if( NULL != mca_btl_sm_component.mmap_file ) {
|
|
|
|
/* Add session directory */
|
2009-03-06 00:56:03 +03:00
|
|
|
opal_crs_base_cleanup_append(orte_process_info.job_session_dir, true);
|
2008-10-16 19:09:00 +04:00
|
|
|
/* Add shared memory file */
|
|
|
|
opal_crs_base_cleanup_append(mca_btl_sm_component.mmap_file->map_path, false);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Clear this so we force the module to re-init the sm files */
|
|
|
|
mca_btl_sm_component.sm_mpool = NULL;
|
2007-03-17 02:11:45 +03:00
|
|
|
}
|
|
|
|
else if(OPAL_CRS_TERM == state ) {
|
|
|
|
;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
;
|
|
|
|
}
|
|
|
|
|
|
|
|
return OMPI_SUCCESS;
|
|
|
|
}
|
2008-10-16 19:09:00 +04:00
|
|
|
#endif /* OPAL_ENABLE_FT */
|