Table 31 lists the bindings for topology subroutines.
Table 31. Bindings for topologies
|
Subroutine name: C C++ FORTRAN |
Binding: C C++ FORTRAN |
|---|---|
| MPI_Cart_coords | int MPI_Cart_coords(MPI_Comm comm,int rank,int maxdims,int *coords); |
| MPI::Cartcomm::Get_coords | void MPI::Cartcomm::Get_coords(int rank, int maxdims, int coords[]) const; |
| MPI_CART_COORDS | MPI_CART_COORDS(INTEGER COMM,INTEGER RANK,INTEGER MAXDIMS,INTEGER COORDS(*),INTEGER IERROR) |
| MPI_Cart_create | int MPI_Cart_create(MPI_Comm comm_old,int ndims,int *dims,int *periods,int reorder,MPI_Comm *comm_cart); |
| MPI::Intracomm::Create_cart | MPI::Cartcomm MPI::Intracomm::Create_cart(int ndims, const int dims[], const bool periods[], bool reorder) const; |
| MPI_CART_CREATE | MPI_CART_CREATE(INTEGER COMM_OLD,INTEGER NDIMS,INTEGER DIMS(*), INTEGER PERIODS(*),INTEGER REORDER,INTEGER COMM_CART,INTEGER IERROR) |
| MPI_Cart_get | int MPI_Cart_get(MPI_Comm comm,int maxdims,int *dims,int *periods,int *coords); |
| MPI::Cartcomm::Get_topo | void MPI::Cartcomm::Get_topo(int maxdims, int dims[], bool periods[], int coords[]) const; |
| MPI_CART_GET | MPI_CART_GET(INTEGER COMM,INTEGER MAXDIMS,INTEGER DIMS(*),INTEGER PERIODS(*),INTEGER COORDS(*),INTEGER IERROR) |
| MPI_Cart_map | int MPI_Cart_map(MPI_Comm comm,int ndims,int *dims,int *periods,int *newrank); |
| MPI::Cartcomm::Map | int MPI::Cartcomm::Map(int ndims, const int dims[], const bool periods[]) const; |
| MPI_CART_MAP | MPI_CART_MAP(INTEGER COMM,INTEGER NDIMS,INTEGER DIMS(*),INTEGER PERIODS(*),INTEGER NEWRANK,INTEGER IERROR) |
| MPI_Cart_rank | int MPI_Cart_rank(MPI_Comm comm,int *coords,int *rank); |
| MPI::Cartcomm::Get_cart_rank | int MPI::Cartcomm::Get_cart_rank(const int coords[]) const; |
| MPI_CART_RANK | MPI_CART_RANK(INTEGER COMM,INTEGER COORDS(*),INTEGER RANK,INTEGER IERROR) |
| MPI_Cart_shift | int MPI_Cart_shift(MPI_Comm comm,int direction,int disp,int *rank_source,int *rank_dest); |
| MPI::Cartcomm::Shift | void MPI::Cartcomm::Shift(int direction, int disp, int &rank_source, int &rank_dest) const; |
| MPI_CART_SHIFT | MPI_CART_SHIFT(INTEGER COMM,INTEGER DIRECTION,INTEGER DISP, INTEGER RANK_SOURCE,INTEGER RANK_DEST,INTEGER IERROR) |
| MPI_Cart_sub | int MPI_Cart_sub(MPI_Comm comm,int *remain_dims,MPI_Comm *newcomm); |
| MPI::Cartcomm::Sub | MPI::Cartcomm MPI::Cartcomm::Sub(const bool remain_dims[]) const; |
| MPI_CART_SUB | MPI_CART_SUB(INTEGER COMM,INTEGER REMAIN_DIMS,INTEGER NEWCOMM, INTEGER IERROR) |
| MPI_Cartdim_get | int MPI_Cartdim_get(MPI_Comm comm, int *ndims); |
| MPI::Cartcomm::Get_dim | int MPI::Cartcomm::Get_dim() const; |
| MPI_CARTDIM_GET | MPI_CARTDIM_GET(INTEGER COMM,INTEGER NDIMS,INTEGER IERROR) |
| MPI_Dims_create | int MPI_Dims_create(int nnodes,int ndims,int *dims); |
| MPI::Compute_dims | void MPI::Compute_dims(int nnodes, int ndims, int dims[]); |
| MPI_DIMS_CREATE | MPI_DIMS_CREATE(INTEGER NNODES,INTEGER NDIMS,INTEGER DIMS(*), INTEGER IERROR) |
| MPI_Graph_create | int MPI_Graph_create(MPI_Comm comm_old,int nnodes,int *index,int *edges,int reorder,MPI_Comm *comm_graph); |
| MPI::Intracomm::Create_graph | MPI::Graphcomm MPI::Intracomm::Create_graph(int nnodes, const int index[], const int edges[], bool reorder) const; |
| MPI_GRAPH_CREATE | MPI_GRAPH_CREATE(INTEGER COMM_OLD,INTEGER NNODES,INTEGER INDEX(*), INTEGER EDGES(*),INTEGER REORDER,INTEGER COMM_GRAPH,INTEGER IERROR) |
| MPI_Graph_get | int MPI_Graph_get(MPI_Comm comm,int maxindex,int maxedges,int *index, int *edges); |
| MPI::Graphcomm::Get_topo | void MPI::Graphcomm::Get_topo(int maxindex, int maxedges, int index[], int edges[]) const; |
| MPI_GRAPH_GET | MPI_GRAPH_GET(INTEGER COMM,INTEGER MAXINDEX,INTEGER MAXEDGES,INTEGER INDEX(*),INTEGER EDGES(*),INTEGER IERROR) |
| MPI_Graph_map | int MPI_Graph_map(MPI_Comm comm,int nnodes,int *index,int *edges,int *newrank); |
| MPI::Graphcomm::Map | int MPI::Graphcomm::Map(int nnodes, const int index[], const int edges[]) const; |
| MPI_GRAPH_MAP | MPI_GRAPH_MAP(INTEGER COMM,INTEGER NNODES,INTEGER INDEX(*),INTEGER EDGES(*),INTEGER NEWRANK,INTEGER IERROR) |
| MPI_Graph_neighbors | int MPI_Graph_neighbors(MPI_Comm comm,int rank,int maxneighbors,int *neighbors); |
| MPI::Graphcomm::Get_neighbors | void MPI::Graphcomm::Get_neighbors(int rank, int maxneighbors, int neighbors[]) const; |
| MPI_GRAPH_NEIGHBORS | MPI_GRAPH_NEIGHBORS(MPI_COMM COMM,INTEGER RANK,INTEGER MAXNEIGHBORS,INTEGER NNEIGHBORS(*),INTEGER IERROR) |
| MPI_Graph_neighbors_count | int MPI_Graph_neighbors_count(MPI_Comm comm,int rank,int *nneighbors); |
| MPI::Graphcomm::Get_neighbors_count | int MPI::Graphcomm::Get_neighbors_count(int rank) const; |
| MPI_GRAPH_NEIGHBORS_COUNT | MPI_GRAPH_NEIGHBORS_COUNT(INTEGER COMM,INTEGER RANK,INTEGER NEIGHBORS, INTEGER IERROR) |
| MPI_Graphdims_get | int MPI_Graphdims_get(MPI_Comm comm,int *nnodes,int *nedges); |
| MPI::Graphcomm::Get_dims | void MPI::Graphcomm::Get_dims(int nnodes[], int nedges[]) const; |
| MPI_GRAPHDIMS_GET | MPI_GRAPHDIMS_GET(INTEGER COMM,INTEGER NNDODES,INTEGER NEDGES, INTEGER IERROR) |
| MPI_Topo_test | int MPI_Topo_test(MPI_Comm comm,int *status); |
| MPI::Comm::Get_topology | int MPI::Comm::Get_topology() const; |
| MPI_TOPO_TEST | MPI_TOPO_TEST(INTEGER COMM,INTEGER STATUS,INTEGER IERROR) |