newrank 138 ompi/mca/coll/base/coll_base_allreduce.c int newrank, newremote, extra_ranks; newrank 192 ompi/mca/coll/base/coll_base_allreduce.c newrank = -1; newrank 200 ompi/mca/coll/base/coll_base_allreduce.c newrank = rank >> 1; newrank 203 ompi/mca/coll/base/coll_base_allreduce.c newrank = rank - extra_ranks; newrank 212 ompi/mca/coll/base/coll_base_allreduce.c if (newrank < 0) break; newrank 214 ompi/mca/coll/base/coll_base_allreduce.c newremote = newrank ^ distance; newrank 102 ompi/mca/topo/base/base.h const int *dims, const int *periods, int *newrank); newrank 145 ompi/mca/topo/base/base.h const int *index, const int *edges, int *newrank); newrank 43 ompi/mca/topo/base/topo_base_cart_map.c const int *dims, const int *periods, int *newrank) newrank 68 ompi/mca/topo/base/topo_base_cart_map.c *newrank = ((rank < 0) || (rank >= nprocs)) ? MPI_UNDEFINED : rank; newrank 43 ompi/mca/topo/base/topo_base_graph_map.c const int *index, const int *edges, int *newrank) newrank 48 ompi/mca/topo/base/topo_base_graph_map.c *newrank = newrank 71 ompi/mca/topo/example/topo_example.h int *newrank); newrank 77 ompi/mca/topo/example/topo_example.h int *newrank); newrank 46 ompi/mca/topo/example/topo_example_cart_map.c int *newrank) newrank 76 ompi/mca/topo/example/topo_example_cart_map.c *newrank = ((rank < 0) || (rank >= nprocs)) ? MPI_UNDEFINED : rank; newrank 45 ompi/mca/topo/example/topo_example_graph_map.c int *newrank) newrank 54 ompi/mca/topo/example/topo_example_graph_map.c *newrank = newrank 183 ompi/mca/topo/topo.h int *newrank); newrank 229 ompi/mca/topo/topo.h int *newrank); newrank 141 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c int rank, size, newrank = -1, hwloc_err, i, j, idx; newrank 689 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c &newrank, 1, MPI_INT, newrank 700 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c if (OMPI_SUCCESS != (err = ompi_comm_split(comm_old, 0, newrank, newcomm, false))) { newrank 899 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c &newrank, 1, MPI_INT, newrank 928 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c newrank += offset; newrank 935 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c if (OMPI_SUCCESS != (err = ompi_comm_split(comm_old, 0, newrank, newcomm, false))) { newrank 46 ompi/mpi/c/cart_map.c const int periods[], int *newrank) newrank 65 ompi/mpi/c/cart_map.c if ((NULL == dims) || (NULL == periods) || (NULL == newrank)) { newrank 77 ompi/mpi/c/cart_map.c *newrank = ompi_comm_rank(comm); newrank 80 ompi/mpi/c/cart_map.c periods, newrank); newrank 46 ompi/mpi/c/graph_map.c int *newrank) newrank 65 ompi/mpi/c/graph_map.c if (1 > nnodes || NULL == indx || NULL == edges || NULL == newrank) { newrank 77 ompi/mpi/c/graph_map.c *newrank = ompi_comm_rank(comm); newrank 79 ompi/mpi/c/graph_map.c err = comm->c_topo->topo.graph.graph_map(comm, nnodes, indx, edges, newrank); newrank 125 ompi/mpi/cxx/topology_inln.h int newrank; newrank 126 ompi/mpi/cxx/topology_inln.h (void)MPI_Cart_map(mpi_comm, ndims, const_cast<int *>(dims), int_periods, &newrank); newrank 128 ompi/mpi/cxx/topology_inln.h return newrank; newrank 208 ompi/mpi/cxx/topology_inln.h int newrank; newrank 209 ompi/mpi/cxx/topology_inln.h (void)MPI_Graph_map(mpi_comm, nnodes, const_cast<int *>(index), const_cast<int *>(edges), &newrank); newrank 210 ompi/mpi/cxx/topology_inln.h return newrank; newrank 42 ompi/mpi/fortran/mpif-h/cart_map_f.c (MPI_Fint *comm, MPI_Fint *ndims, MPI_Fint *dims, ompi_fortran_logical_t *periods, MPI_Fint *newrank, MPI_Fint *ierr), newrank 43 ompi/mpi/fortran/mpif-h/cart_map_f.c (comm, ndims, dims, periods, newrank, ierr) ) newrank 62 ompi/mpi/fortran/mpif-h/cart_map_f.c (MPI_Fint *comm, MPI_Fint *ndims, MPI_Fint *dims, ompi_fortran_logical_t *periods, MPI_Fint *newrank, MPI_Fint *ierr), newrank 63 ompi/mpi/fortran/mpif-h/cart_map_f.c (comm, ndims, dims, periods, newrank, ierr) ) newrank 71 ompi/mpi/fortran/mpif-h/cart_map_f.c ompi_fortran_logical_t *periods, MPI_Fint *newrank, MPI_Fint *ierr) newrank 77 ompi/mpi/fortran/mpif-h/cart_map_f.c OMPI_SINGLE_NAME_DECL(newrank); newrank 89 ompi/mpi/fortran/mpif-h/cart_map_f.c OMPI_SINGLE_NAME_CONVERT(newrank)); newrank 94 ompi/mpi/fortran/mpif-h/cart_map_f.c OMPI_SINGLE_INT_2_FINT(newrank); newrank 41 ompi/mpi/fortran/mpif-h/graph_map_f.c (MPI_Fint *comm, MPI_Fint *nnodes, MPI_Fint *indx, MPI_Fint *edges, MPI_Fint *newrank, MPI_Fint *ierr), newrank 42 ompi/mpi/fortran/mpif-h/graph_map_f.c (comm, nnodes, indx, edges, newrank, ierr) ) newrank 61 ompi/mpi/fortran/mpif-h/graph_map_f.c (MPI_Fint *comm, MPI_Fint *nnodes, MPI_Fint *indx, MPI_Fint *edges, MPI_Fint *newrank, MPI_Fint *ierr), newrank 62 ompi/mpi/fortran/mpif-h/graph_map_f.c (comm, nnodes, indx, edges, newrank, ierr) ) newrank 114 ompi/mpi/fortran/mpif-h/prototypes_mpi.h PN2(void, MPI_Cart_map, mpi_cart_map, MPI_CART_MAP, (MPI_Fint *comm, MPI_Fint *ndims, MPI_Fint *dims, ompi_fortran_logical_t *periods, MPI_Fint *newrank, MPI_Fint *ierr)); newrank 245 ompi/mpi/fortran/mpif-h/prototypes_mpi.h PN2(void, MPI_Graph_map, mpi_graph_map, MPI_GRAPH_MAP, (MPI_Fint *comm, MPI_Fint *nnodes, MPI_Fint *index, MPI_Fint *edges, MPI_Fint *newrank, MPI_Fint *ierr)); newrank 1776 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h subroutine ompi_graph_map_f(comm,nnodes,index,edges,newrank,ierror) & newrank 1782 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h INTEGER, INTENT(OUT) :: newrank newrank 183 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h subroutine MPI_Cart_map(comm, ndims, dims, periods, newrank& newrank 189 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h integer, intent(out) :: newrank newrank 718 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h subroutine MPI_Graph_map(comm, nnodes, index, edges, newrank& newrank 724 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h integer, intent(out) :: newrank newrank 183 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h subroutine PMPI_Cart_map(comm, ndims, dims, periods, newrank& newrank 189 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h integer, intent(out) :: newrank newrank 718 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h subroutine PMPI_Graph_map(comm, nnodes, index, edges, newrank& newrank 724 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h integer, intent(out) :: newrank newrank 144 ompi/mpi/java/c/mpi_CartComm.c int newrank; newrank 145 ompi/mpi/java/c/mpi_CartComm.c int rc = MPI_Cart_map((MPI_Comm)comm, nDims, cDims, cPeriods, &newrank); newrank 150 ompi/mpi/java/c/mpi_CartComm.c return newrank; newrank 162 ompi/mpi/java/c/mpi_GraphComm.c int newrank; newrank 163 ompi/mpi/java/c/mpi_GraphComm.c int rc = MPI_Graph_map((MPI_Comm)comm, nNodes, cIndex, cEdges, &newrank); newrank 168 ompi/mpi/java/c/mpi_GraphComm.c return newrank;