1
1
openmpi/ompi/mpi/c/dist_graph_create.c
George Bosilca 5fae72b9aa Add the MPI 2.2 MPI_Dist_graph functionality.
This patch reshape the way we deal with topologies completely. Where
our topologies were mainly storage components (they were not capable
of creating the new communicator), the new version is built around a
[possibly] common representation (in mca/topo/topo.h), but the functions
to attach and retrieve the topological information are specific to each
component. As a result the ompi_create_cart and ompi_create_graph functions
become useless and have been removed.

In addition to adding the internal infrastructure to manage the topology
information, it updates the MPI interface, and the debuggers support and
provides all Fortran interfaces.

This commit was SVN r28687.
2013-07-01 12:40:08 +00:00

87 строки
3.4 KiB
C

/*
* Copyright (c) 2011-2012 The University of Tennessee and The University
* of Tennessee Research Foundation. All rights
* reserved.
*
*/
#include "ompi_config.h"
#include "ompi/mpi/c/bindings.h"
#include "ompi/runtime/params.h"
#include "ompi/communicator/communicator.h"
#include "ompi/errhandler/errhandler.h"
#include "ompi/memchecker.h"
#include "ompi/mca/topo/topo.h"
#include "ompi/mca/topo/base/base.h"
#if OPAL_HAVE_WEAK_SYMBOLS && OMPI_PROFILING_DEFINES
#pragma weak MPI_Dist_graph_create = PMPI_Dist_graph_create
#endif
#if OMPI_PROFILING_DEFINES
#include "ompi/mpi/c/profile/defines.h"
#endif
static const char FUNC_NAME[] = "MPI_Dist_graph_create";
int MPI_Dist_graph_create(MPI_Comm comm_old, int n, int sources[],
int degrees[], int destinations[], int weights[],
MPI_Info info, int reorder, MPI_Comm * newcomm)
{
mca_topo_base_module_t* topo;
int i, j, index, err, comm_size;
MEMCHECKER(
memchecker_comm(comm_old);
);
if (MPI_PARAM_CHECK) {
OMPI_ERR_INIT_FINALIZE(FUNC_NAME);
if (ompi_comm_invalid(comm_old)) {
return OMPI_ERRHANDLER_INVOKE(MPI_COMM_WORLD, MPI_ERR_COMM,
FUNC_NAME);
} else if (OMPI_COMM_IS_INTER(comm_old)) {
return OMPI_ERRHANDLER_INVOKE(MPI_COMM_WORLD, MPI_ERR_COMM,
FUNC_NAME);
} else if (n < 0 || NULL == newcomm) {
return OMPI_ERRHANDLER_INVOKE(comm_old, MPI_ERR_ARG, FUNC_NAME);
} else if (n > 0 && (NULL == sources || NULL == degrees ||
NULL == destinations || NULL == weights)) {
return OMPI_ERRHANDLER_INVOKE(comm_old, MPI_ERR_ARG, FUNC_NAME);
}
/* Ensure the arrays are full of valid-valued integers */
comm_size = ompi_comm_size(comm_old);
for( i = index = 0; i < n; ++i ) {
if (sources[i] < 0 || sources[i] >= comm_size) {
return OMPI_ERRHANDLER_INVOKE(comm_old, MPI_ERR_ARG,
FUNC_NAME);
} else if (degrees[i] < 0) {
return OMPI_ERRHANDLER_INVOKE(comm_old, MPI_ERR_ARG,
FUNC_NAME);
}
for( j = 0; j < degrees[i]; ++j ) {
if (destinations[index] < 0 || destinations[index] >= comm_size) {
return OMPI_ERRHANDLER_INVOKE(comm_old, MPI_ERR_ARG,
FUNC_NAME);
} else if (MPI_UNWEIGHTED != weights && weights[index] < 0) {
return OMPI_ERRHANDLER_INVOKE(comm_old, MPI_ERR_ARG,
FUNC_NAME);
}
index++;
}
}
}
/* Ensure there is a topo attached to this communicator */
if(OMPI_SUCCESS != (err = mca_topo_base_comm_select(comm_old, NULL,
&topo, OMPI_COMM_DIST_GRAPH))) {
return OMPI_ERRHANDLER_INVOKE(comm_old, err, FUNC_NAME);
}
err = topo->topo.dist_graph.dist_graph_create(topo, comm_old, n, sources, degrees,
destinations, weights, info,
reorder, newcomm);
OMPI_ERRHANDLER_RETURN(err, comm_old, err, FUNC_NAME);
}