
ompi_communicator_t, ompi_win_t, ompi_file_t all have a super class of type opal_infosubscriber_t instead of a base/super type of opal_object_t (in previous code comm used c_base, but file used super). It may be a bit bold to say that being a subscriber of MPI_Info is the foundational piece that ties these three things together, but if you object, then I would prefer to turn infosubscriber into a more general name that encompasses other common features rather than create a different super class. The key here is that we want to be able to pass comm, win and file objects as if they were opal_infosubscriber_t, so that one routine can heandle all 3 types of objects being passed to it. MPI_INFO_NULL is still an ompi_predefined_info_t type since an MPI_Info is part of ompi but the internal details of the underlying information concept is part of opal. An ompi_info_t type still exists for exposure to the user, but it is simply a wrapper for the opal object. Routines such as ompi_info_dup, etc have all been moved to opal_info_dup and related to the opal directory. Fortran to C translation tables are only used for MPI_Info that is exposed to the application and are therefore part of the ompi_info_t and not the opal_info_t The data structure changes are primarily in the following files: communicator/communicator.h ompi/info/info.h ompi/win/win.h ompi/file/file.h The following new files were created: opal/util/info.h opal/util/info.c opal/util/info_subscriber.h opal/util/info_subscriber.c This infosubscriber concept is that communicators, files and windows can have subscribers that subscribe to any changes in the info associated with the comm/file/window. When xxx_set_info is called, the new info is presented to each subscriber who can modify the info in any way they want. The new value is presented to the next subscriber and so on until all subscribers have had a chance to modify the value. Therefore, the order of subscribers can make a difference but we hope that there is generally only one subscriber that cares or modifies any given key/value pair. The final info is then stored and returned by a call to xxx_get_info. The new model can be seen in the following files: ompi/mpi/c/comm_get_info.c ompi/mpi/c/comm_set_info.c ompi/mpi/c/file_get_info.c ompi/mpi/c/file_set_info.c ompi/mpi/c/win_get_info.c ompi/mpi/c/win_set_info.c The current subscribers where changed as follows: mca/io/ompio/io_ompio_file_open.c mca/io/ompio/io_ompio_module.c mca/osc/rmda/osc_rdma_component.c (This one actually subscribes to "no_locks") mca/osc/sm/osc_sm_component.c (This one actually subscribes to "blocking_fence" and "alloc_shared_contig") Signed-off-by: Mark Allen <markalle@us.ibm.com> Conflicts: AUTHORS ompi/communicator/comm.c ompi/debuggers/ompi_mpihandles_dll.c ompi/file/file.c ompi/file/file.h ompi/info/info.c ompi/mca/io/ompio/io_ompio.h ompi/mca/io/ompio/io_ompio_file_open.c ompi/mca/io/ompio/io_ompio_file_set_view.c ompi/mca/osc/pt2pt/osc_pt2pt.h ompi/mca/sharedfp/addproc/sharedfp_addproc.h ompi/mca/sharedfp/addproc/sharedfp_addproc_file_open.c ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c ompi/mpi/c/lookup_name.c ompi/mpi/c/publish_name.c ompi/mpi/c/unpublish_name.c opal/mca/mpool/base/mpool_base_alloc.c opal/util/Makefile.am
201 строка
7.5 KiB
C
201 строка
7.5 KiB
C
/*
|
|
* Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana
|
|
* University Research and Technology
|
|
* Corporation. All rights reserved.
|
|
* Copyright (c) 2004-2013 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 (c) 2008 Cisco Systems, Inc. All rights reserved.
|
|
* Copyright (c) 2009 Oak Ridge National Labs. All rights reserved.
|
|
* Copyright (c) 2012-2013 Los Alamos National Security, Inc. All rights reserved.
|
|
* Copyright (c) 2012-2013 Inria. All rights reserved.
|
|
* Copyright (c) 2014-2015 Research Organization for Information Science
|
|
* and Technology (RIST). All rights reserved.
|
|
* Copyright (c) 2016 IBM Corp. All rights reserved.
|
|
* $COPYRIGHT$
|
|
*
|
|
* Additional copyrights may follow
|
|
*
|
|
* $HEADER$
|
|
*/
|
|
|
|
#ifndef MCA_TOPO_BASE_H
|
|
#define MCA_TOPO_BASE_H
|
|
|
|
#include "ompi_config.h"
|
|
|
|
#include "opal/class/opal_list.h"
|
|
#include "ompi/mca/mca.h"
|
|
#include "ompi/mca/topo/topo.h"
|
|
#include "ompi/proc/proc.h"
|
|
#include "ompi/communicator/communicator.h"
|
|
#include "ompi/info/info.h"
|
|
|
|
/*
|
|
* All stuff goes in here
|
|
*/
|
|
|
|
BEGIN_C_DECLS
|
|
|
|
/* Lazily initialize the framework (if it wasn't already) */
|
|
OMPI_DECLSPEC int mca_topo_base_lazy_init(void);
|
|
|
|
/*
|
|
* MCA Framework
|
|
*/
|
|
OMPI_DECLSPEC extern mca_base_framework_t ompi_topo_base_framework;
|
|
|
|
/* Select a topo module for a particular type of topology */
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_comm_select(const ompi_communicator_t* comm,
|
|
mca_topo_base_module_t* preferred_module,
|
|
mca_topo_base_module_t** selected_module,
|
|
uint32_t type);
|
|
|
|
/* Find all components that want to be considered in this job */
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_find_available(bool enable_progress_threads,
|
|
bool enable_mpi_threads);
|
|
|
|
/*
|
|
* All the glue functions which we will provide to the users by
|
|
* default. The component authors need to only write back-end
|
|
* functions for cart_create(), graph_create(), graph_map(), and
|
|
* cart_map() for their topology components. But they can implement
|
|
* these glue functions if they want.
|
|
*
|
|
* These glue functions
|
|
*/
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_cart_create(mca_topo_base_module_t *topo_module,
|
|
ompi_communicator_t* old_comm,
|
|
int ndims,
|
|
const int *dims,
|
|
const int *periods,
|
|
bool reorder,
|
|
ompi_communicator_t** comm_topo);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_cart_coords(ompi_communicator_t *comm,
|
|
int rank,
|
|
int maxdims,
|
|
int *coords);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_cartdim_get(ompi_communicator_t *comm,
|
|
int *ndims);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_cart_get(ompi_communicator_t *comm,
|
|
int maxdims,
|
|
int *dims,
|
|
int *periods,
|
|
int *coords);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_cart_map(ompi_communicator_t * comm,
|
|
int ndims,
|
|
const int *dims, const int *periods, int *newrank);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_cart_rank(ompi_communicator_t *comm,
|
|
const int *coords,
|
|
int *rank);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_cart_shift(ompi_communicator_t *comm,
|
|
int direction,
|
|
int disp,
|
|
int *rank_source,
|
|
int *rank_dest);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_cart_sub(ompi_communicator_t *comm,
|
|
const int *remain_dims,
|
|
ompi_communicator_t **new_comm);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_graphdims_get(ompi_communicator_t *comm,
|
|
int *nodes,
|
|
int *nedges);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_graph_create(mca_topo_base_module_t *topo_module,
|
|
ompi_communicator_t* old_comm,
|
|
int nnodes,
|
|
const int *index,
|
|
const int *edges,
|
|
bool reorder,
|
|
ompi_communicator_t** new_comm);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_graph_get(ompi_communicator_t *comm,
|
|
int maxindex,
|
|
int maxedges,
|
|
int *index,
|
|
int *edges);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_graph_map(ompi_communicator_t * comm,
|
|
int nnodes,
|
|
const int *index, const int *edges, int *newrank);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_graph_neighbors(ompi_communicator_t *comm,
|
|
int rank,
|
|
int maxneighbors,
|
|
int *neighbors);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_graph_neighbors_count(ompi_communicator_t *comm,
|
|
int rank,
|
|
int *nneighbors);
|
|
|
|
/**
|
|
* Efficiently distribute the information about the distributed graph as
|
|
* submitted through the distributed graph interface.
|
|
*/
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_dist_graph_distribute(mca_topo_base_module_t* module,
|
|
ompi_communicator_t *comm,
|
|
int n, const int nodes[],
|
|
const int degrees[], const int targets[],
|
|
const int weights[],
|
|
mca_topo_base_comm_dist_graph_2_2_0_t** ptopo);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_dist_graph_create(mca_topo_base_module_t* module,
|
|
ompi_communicator_t *old_comm,
|
|
int n, const int nodes[],
|
|
const int degrees[], const int targets[], const int weights[],
|
|
opal_info_t *info, int reorder,
|
|
ompi_communicator_t **new_comm);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_dist_graph_create_adjacent(mca_topo_base_module_t* module,
|
|
ompi_communicator_t *old_comm,
|
|
int indegree, const int sources[],
|
|
const int sourceweights[], int outdegree,
|
|
const int destinations[], const int destweights[],
|
|
opal_info_t *info, int reorder,
|
|
ompi_communicator_t **comm_dist_graph);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_dist_graph_neighbors(ompi_communicator_t *comm,
|
|
int maxindegree,
|
|
int sources[], int sourceweights[],
|
|
int maxoutdegree, int destinations[],
|
|
int destweights[]);
|
|
|
|
OMPI_DECLSPEC int
|
|
mca_topo_base_dist_graph_neighbors_count(ompi_communicator_t *comm,
|
|
int *inneighbors, int *outneighbors, int *weighted);
|
|
|
|
END_C_DECLS
|
|
|
|
#endif /* MCA_BASE_TOPO_H */
|