/dports/net/mpich/mpich-3.4.3/src/mpi/topo/ |
H A D | dist_gr_create_adj.c | 16 int MPI_Dist_graph_create_adjacent(MPI_Comm comm_old, int indegree, const int sources[], 65 int indegree, const int sources[], in MPI_Dist_graph_create_adjacent() argument 113 MPIR_ERRTEST_ARGNEG(indegree, "indegree", mpi_errno); in MPI_Dist_graph_create_adjacent() 116 if (indegree > 0) { in MPI_Dist_graph_create_adjacent() 153 dist_graph_ptr->indegree = indegree; in MPI_Dist_graph_create_adjacent() 161 if (indegree > 0) { in MPI_Dist_graph_create_adjacent() 162 MPIR_CHKPMEM_MALLOC(dist_graph_ptr->in, int *, indegree * sizeof(int), mpi_errno, in MPI_Dist_graph_create_adjacent() 164 MPIR_Memcpy(dist_graph_ptr->in, sources, indegree * sizeof(int)); in MPI_Dist_graph_create_adjacent() 166 MPIR_CHKPMEM_MALLOC(dist_graph_ptr->in_weights, int *, indegree * sizeof(int), in MPI_Dist_graph_create_adjacent() 168 MPIR_Memcpy(dist_graph_ptr->in_weights, sourceweights, indegree * sizeof(int)); in MPI_Dist_graph_create_adjacent() [all …]
|
H A D | topoutil.c | 162 copy_topology->topo.dist_graph.indegree = old_topology->topo.dist_graph.indegree; in MPIR_Topology_copy_fn() 165 MPIR_ARRAY_COPY_HELPER(dist_graph, in, indegree); in MPIR_Topology_copy_fn() 168 MPIR_ARRAY_COPY_HELPER(dist_graph, in_weights, indegree); in MPIR_Topology_copy_fn() 272 *indegree = *outdegree = nneighbors; in MPIR_Topo_canon_nhb_count() 275 *indegree = 2 * topo_ptr->topo.cart.ndims; in MPIR_Topo_canon_nhb_count() 289 int indegree, int sources[], int inweights[], in MPIR_Topo_canon_nhb() argument 304 indegree, sources, inweights, in MPIR_Topo_canon_nhb() 308 MPIR_Assert(indegree == outdegree); in MPIR_Topo_canon_nhb() 316 MPIR_Assert(indegree == outdegree); in MPIR_Topo_canon_nhb() 317 MPIR_Assert(indegree == 2 * topo_ptr->topo.cart.ndims); in MPIR_Topo_canon_nhb() [all …]
|
H A D | dist_gr_neighb_count.c | 16 int MPI_Dist_graph_neighbors_count(MPI_Comm comm, int *indegree, int *outdegree, int *weighted) 29 int MPIR_Dist_graph_neighbors_count_impl(MPIR_Comm * comm_ptr, int *indegree, int *outdegree, in MPIR_Dist_graph_neighbors_count_impl() argument 39 *indegree = topo_ptr->topo.dist_graph.indegree; in MPIR_Dist_graph_neighbors_count_impl() 69 int MPI_Dist_graph_neighbors_count(MPI_Comm comm, int *indegree, int *outdegree, int *weighted) in MPI_Dist_graph_neighbors_count() argument 104 MPIR_ERRTEST_ARGNULL(indegree, "indegree", mpi_errno); in MPI_Dist_graph_neighbors_count() 114 mpi_errno = MPIR_Dist_graph_neighbors_count_impl(comm_ptr, indegree, outdegree, weighted); in MPI_Dist_graph_neighbors_count() 131 "**mpi_dist_graph_neighbors_count %C %p %p %p", comm, indegree, in MPI_Dist_graph_neighbors_count()
|
/dports/net/mpich2/mpich2-1.5/src/mpi/topo/ |
H A D | dist_gr_create_adj.c | 66 int indegree, MPICH2_CONST int sources[], in MPI_Dist_graph_create_adjacent() argument 113 MPIR_ERRTEST_ARGNEG(indegree, "indegree", mpi_errno); in MPI_Dist_graph_create_adjacent() 116 if (indegree > 0) { in MPI_Dist_graph_create_adjacent() 152 dist_graph_ptr->indegree = indegree; in MPI_Dist_graph_create_adjacent() 160 …MPIU_CHKPMEM_MALLOC(dist_graph_ptr->in, int *, indegree*sizeof(int), mpi_errno, "dist_graph_ptr->i… in MPI_Dist_graph_create_adjacent() 162 MPIU_Memcpy(dist_graph_ptr->in, sources, indegree*sizeof(int)); in MPI_Dist_graph_create_adjacent() 166 …MPIU_CHKPMEM_MALLOC(dist_graph_ptr->in_weights, int *, indegree*sizeof(int), mpi_errno, "dist_grap… in MPI_Dist_graph_create_adjacent() 168 MPIU_Memcpy(dist_graph_ptr->in_weights, sourceweights, indegree*sizeof(int)); in MPI_Dist_graph_create_adjacent() 191 comm_old, indegree, sources, sourceweights, in MPI_Dist_graph_create_adjacent()
|
H A D | topoutil.c | 172 copy_topology->topo.dist_graph.indegree = old_topology->topo.dist_graph.indegree; in MPIR_Topology_copy_fn() 174 MPIR_ARRAY_COPY_HELPER(dist_graph, in, indegree); in MPIR_Topology_copy_fn() 175 MPIR_ARRAY_COPY_HELPER(dist_graph, in_weights, indegree); in MPIR_Topology_copy_fn() 289 *indegree = *outdegree = nneighbors; in MPIR_Topo_canon_nhb_count() 293 *indegree = 2 * topo_ptr->topo.cart.ndims; in MPIR_Topo_canon_nhb_count() 312 int indegree, int sources[], int inweights[], in MPIR_Topo_canon_nhb() argument 326 indegree, sources, inweights, in MPIR_Topo_canon_nhb() 331 MPIU_Assert(indegree == outdegree); in MPIR_Topo_canon_nhb() 340 MPIU_Assert(indegree == outdegree); in MPIR_Topo_canon_nhb() 341 MPIU_Assert(indegree == 2*topo_ptr->topo.cart.ndims); in MPIR_Topo_canon_nhb() [all …]
|
H A D | dist_gr_neighb_count.c | 33 int MPIR_Dist_graph_neighbors_count_impl(MPID_Comm *comm_ptr, int *indegree, int *outdegree, int *w… in MPIR_Dist_graph_neighbors_count_impl() argument 40 *indegree = topo_ptr->topo.dist_graph.indegree; in MPIR_Dist_graph_neighbors_count_impl() 74 int MPI_Dist_graph_neighbors_count(MPI_Comm comm, int *indegree, int *outdegree, int *weighted) in MPI_Dist_graph_neighbors_count() argument 108 MPIR_ERRTEST_ARGNULL(indegree, "indegree", mpi_errno); in MPI_Dist_graph_neighbors_count() 118 mpi_errno = MPIR_Dist_graph_neighbors_count_impl(comm_ptr, indegree, outdegree, weighted); in MPI_Dist_graph_neighbors_count() 135 comm, indegree, outdegree, weighted); in MPI_Dist_graph_neighbors_count()
|
/dports/net/mpich/mpich-3.4.3/test/mpi/cxx/topo/ |
H A D | distgraphcxx.cxx | 24 int indegree, outdegree, sources[4], dests[4], sweights[4], dweights[4]; in main() local 34 indegree = 0; in main() 41 sources[indegree++] = wrank - 2; in main() 44 dcomm = MPI::COMM_WORLD.Dist_graph_create_adjacent(indegree, sources, in main() 56 if (myindegree != indegree) { in main() 58 cout << "Indegree is " << myindegree << " should be " << indegree << "\n"; in main() 73 for (i = 0; i < indegree; i++) { in main()
|
/dports/net/openmpi/openmpi-4.1.1/ompi/mpi/c/ |
H A D | neighbor_alltoallv.c | 55 int indegree, outdegree; in MPI_Neighbor_alltoallv() local 73 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallv() 83 for ( i = 0; i < indegree; i++ ) { in MPI_Neighbor_alltoallv() 106 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallv() 109 ((0 < indegree) && ((NULL == recvcounts) || (NULL == rdispls))) || in MPI_Neighbor_alltoallv() 117 for (i = 0; i < indegree; ++i) { in MPI_Neighbor_alltoallv() 137 indegree = dist_graph->indegree; in MPI_Neighbor_alltoallv() 139 if( indegree < 0 || outdegree < 0 ) { in MPI_Neighbor_alltoallv()
|
H A D | ineighbor_alltoallw.c | 56 int indegree, outdegree; in MPI_Ineighbor_alltoallw() local 66 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallw() 79 for ( i = 0; i < indegree; i++ ) { in MPI_Ineighbor_alltoallw() 105 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallw() 108 … ((0 < indegree) && ((NULL == recvcounts) || (NULL == rdispls) || (NULL == recvtypes))) || in MPI_Ineighbor_alltoallw() 116 for (i = 0; i < indegree; ++i) { in MPI_Ineighbor_alltoallw() 136 indegree = dist_graph->indegree; in MPI_Ineighbor_alltoallw() 138 if( indegree < 0 || outdegree < 0 ) { in MPI_Ineighbor_alltoallw()
|
H A D | neighbor_alltoallw.c | 55 int indegree, outdegree; in MPI_Neighbor_alltoallw() local 65 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallw() 78 for ( i = 0; i < indegree; i++ ) { in MPI_Neighbor_alltoallw() 102 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallw() 105 … ((0 < indegree) && ((NULL == recvcounts) || (NULL == rdispls) || (NULL == recvtypes))) || in MPI_Neighbor_alltoallw() 113 for (i = 0; i < indegree; ++i) { in MPI_Neighbor_alltoallw() 133 indegree = dist_graph->indegree; in MPI_Neighbor_alltoallw() 135 if( indegree < 0 || outdegree < 0 ) { in MPI_Neighbor_alltoallw()
|
H A D | ineighbor_alltoallv.c | 56 int indegree, outdegree; in MPI_Ineighbor_alltoallv() local 74 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallv() 84 for ( i = 0; i < indegree; i++ ) { in MPI_Ineighbor_alltoallv() 107 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallv() 110 ((0 < indegree) && ((NULL == recvcounts) || (NULL == rdispls))) || in MPI_Ineighbor_alltoallv() 118 for (i = 0; i < indegree; ++i) { in MPI_Ineighbor_alltoallv() 138 indegree = dist_graph->indegree; in MPI_Ineighbor_alltoallv() 140 if( indegree < 0 || outdegree < 0 ) { in MPI_Ineighbor_alltoallv()
|
/dports/net/openmpi/openmpi-4.1.1/ompi/mpi/fortran/mpif-h/ |
H A D | dist_graph_create_adjacent_f.c | 40 …(MPI_Fint *comm_old, MPI_Fint *indegree, MPI_Fint *sources, MPI_Fint *sourceweights, MPI_Fint *ou… 41 …(comm_old, indegree, sources, sourceweights, outdegree, destinations, destweights, info, reorder, … 60 …(MPI_Fint *comm_old, MPI_Fint *indegree, MPI_Fint *sources, MPI_Fint *sourceweights, MPI_Fint *ou… 61 …(comm_old, indegree, sources, sourceweights, outdegree, destinations, destweights, info, reorder,… 71 void ompi_dist_graph_create_adjacent_f(MPI_Fint *comm_old, MPI_Fint *indegree, in ompi_dist_graph_create_adjacent_f() argument 89 OMPI_ARRAY_FINT_2_INT(sources, *indegree); in ompi_dist_graph_create_adjacent_f() 95 OMPI_ARRAY_FINT_2_INT(sourceweights, *indegree); in ompi_dist_graph_create_adjacent_f() 105 OMPI_ARRAY_FINT_2_INT(destweights, *indegree); in ompi_dist_graph_create_adjacent_f() 109 c_ierr = PMPI_Dist_graph_create_adjacent(c_comm_old, OMPI_FINT_2_INT(*indegree), in ompi_dist_graph_create_adjacent_f()
|
/dports/net/openmpi3/openmpi-3.1.6/ompi/mpi/fortran/mpif-h/ |
H A D | dist_graph_create_adjacent_f.c | 40 …(MPI_Fint *comm_old, MPI_Fint *indegree, MPI_Fint *sources, MPI_Fint *sourceweights, MPI_Fint *ou… 41 …(comm_old, indegree, sources, sourceweights, outdegree, destinations, destweights, info, reorder, … 60 …(MPI_Fint *comm_old, MPI_Fint *indegree, MPI_Fint *sources, MPI_Fint *sourceweights, MPI_Fint *ou… 61 …(comm_old, indegree, sources, sourceweights, outdegree, destinations, destweights, info, reorder,… 71 void ompi_dist_graph_create_adjacent_f(MPI_Fint *comm_old, MPI_Fint *indegree, in ompi_dist_graph_create_adjacent_f() argument 88 OMPI_ARRAY_FINT_2_INT(sources, *indegree); in ompi_dist_graph_create_adjacent_f() 94 OMPI_ARRAY_FINT_2_INT(sourceweights, *indegree); in ompi_dist_graph_create_adjacent_f() 104 OMPI_ARRAY_FINT_2_INT(destweights, *indegree); in ompi_dist_graph_create_adjacent_f() 108 *ierr = OMPI_INT_2_FINT(PMPI_Dist_graph_create_adjacent(c_comm_old, OMPI_FINT_2_INT(*indegree), in ompi_dist_graph_create_adjacent_f()
|
/dports/net/openmpi3/openmpi-3.1.6/ompi/mca/topo/base/ |
H A D | topo_base_dist_graph_create_adjacent.c | 25 int indegree, const int sources[], in mca_topo_base_dist_graph_create_adjacent() argument 60 topo->indegree = indegree; in mca_topo_base_dist_graph_create_adjacent() 64 if (topo->indegree > 0) { in mca_topo_base_dist_graph_create_adjacent() 65 topo->in = (int*)malloc(sizeof(int) * topo->indegree); in mca_topo_base_dist_graph_create_adjacent() 69 memcpy(topo->in, sources, sizeof(int) * topo->indegree); in mca_topo_base_dist_graph_create_adjacent() 71 topo->inw = (int*)malloc(sizeof(int) * topo->indegree); in mca_topo_base_dist_graph_create_adjacent() 75 memcpy( topo->inw, sourceweights, sizeof(int) * topo->indegree ); in mca_topo_base_dist_graph_create_adjacent()
|
H A D | topo_base_frame.c | 74 int mca_topo_base_neighbor_count (ompi_communicator_t *comm, int *indegree, int *outdegree) { in mca_topo_base_neighbor_count() argument 83 *outdegree = *indegree = 2 * comm->c_topo->mtc.cart->ndims; in mca_topo_base_neighbor_count() 91 *outdegree = *indegree = nneighbors; in mca_topo_base_neighbor_count() 94 *indegree = comm->c_topo->mtc.dist_graph->indegree; in mca_topo_base_neighbor_count()
|
/dports/net/openmpi/openmpi-4.1.1/ompi/mca/topo/base/ |
H A D | topo_base_dist_graph_create_adjacent.c | 25 int indegree, const int sources[], in mca_topo_base_dist_graph_create_adjacent() argument 60 topo->indegree = indegree; in mca_topo_base_dist_graph_create_adjacent() 64 if (topo->indegree > 0) { in mca_topo_base_dist_graph_create_adjacent() 65 topo->in = (int*)malloc(sizeof(int) * topo->indegree); in mca_topo_base_dist_graph_create_adjacent() 69 memcpy(topo->in, sources, sizeof(int) * topo->indegree); in mca_topo_base_dist_graph_create_adjacent() 71 topo->inw = (int*)malloc(sizeof(int) * topo->indegree); in mca_topo_base_dist_graph_create_adjacent() 75 memcpy( topo->inw, sourceweights, sizeof(int) * topo->indegree ); in mca_topo_base_dist_graph_create_adjacent()
|
/dports/net/openmpi3/openmpi-3.1.6/ompi/mpi/c/ |
H A D | ineighbor_alltoallv.c | 54 int indegree, outdegree; in MPI_Ineighbor_alltoallv() local 70 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallv() 80 for ( i = 0; i < indegree; i++ ) { in MPI_Ineighbor_alltoallv() 107 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallv() 113 for (i = 0; i < indegree; ++i) { in MPI_Ineighbor_alltoallv() 133 indegree = dist_graph->indegree; in MPI_Ineighbor_alltoallv() 135 if( indegree < 0 || outdegree < 0 ) { in MPI_Ineighbor_alltoallv()
|
H A D | neighbor_alltoallv.c | 54 int indegree, outdegree; in MPI_Neighbor_alltoallv() local 70 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallv() 80 for ( i = 0; i < indegree; i++ ) { in MPI_Neighbor_alltoallv() 107 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallv() 113 for (i = 0; i < indegree; ++i) { in MPI_Neighbor_alltoallv() 133 indegree = dist_graph->indegree; in MPI_Neighbor_alltoallv() 135 if( indegree < 0 || outdegree < 0 ) { in MPI_Neighbor_alltoallv()
|
H A D | ineighbor_alltoallw.c | 54 int indegree, outdegree; in MPI_Ineighbor_alltoallw() local 62 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallw() 75 for ( i = 0; i < indegree; i++ ) { in MPI_Ineighbor_alltoallw() 107 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallw() 113 for (i = 0; i < indegree; ++i) { in MPI_Ineighbor_alltoallw() 133 indegree = dist_graph->indegree; in MPI_Ineighbor_alltoallw() 135 if( indegree < 0 || outdegree < 0 ) { in MPI_Ineighbor_alltoallw()
|
H A D | neighbor_alltoallw.c | 54 int indegree, outdegree; in MPI_Neighbor_alltoallw() local 62 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallw() 75 for ( i = 0; i < indegree; i++ ) { in MPI_Neighbor_alltoallw() 103 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallw() 109 for (i = 0; i < indegree; ++i) { in MPI_Neighbor_alltoallw() 129 indegree = dist_graph->indegree; in MPI_Neighbor_alltoallw() 131 if( indegree < 0 || outdegree < 0 ) { in MPI_Neighbor_alltoallw()
|
/dports/science/nest/nest-simulator-3.1/testsuite/pytests/ |
H A D | test_multiple_synapses.py | 126 indegree = 2 140 ref_sm = (['static_synapse']*num_trg*indegree + 141 ['stdp_synapse']*num_trg*indegree + 142 ['stdp_synapse']*num_trg*indegree) 151 indegree = 3 164 self.assertEqual(num_trgt * indegree * 2, len(conns)) 167 self.assertEqual(sorted(weights)[:num_trgt * indegree], [-3]*num_trgt*indegree) 173 indegree = 3 191 self.assertEqual(num_trgt * indegree * 2, len(conns)) 199 indegree = 3 [all …]
|
/dports/net/openmpi/openmpi-4.1.1/ompi/mpiext/pcollreq/c/ |
H A D | neighbor_alltoallv_init.c | 57 int indegree, outdegree; in MPIX_Neighbor_alltoallv_init() local 75 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPIX_Neighbor_alltoallv_init() 85 for ( i = 0; i < indegree; i++ ) { in MPIX_Neighbor_alltoallv_init() 112 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPIX_Neighbor_alltoallv_init() 118 for (i = 0; i < indegree; ++i) { in MPIX_Neighbor_alltoallv_init() 138 indegree = dist_graph->indegree; in MPIX_Neighbor_alltoallv_init() 140 if( indegree < 0 || outdegree < 0 ) { in MPIX_Neighbor_alltoallv_init()
|
H A D | neighbor_alltoallw_init.c | 57 int indegree, outdegree; in MPIX_Neighbor_alltoallw_init() local 67 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPIX_Neighbor_alltoallw_init() 80 for ( i = 0; i < indegree; i++ ) { in MPIX_Neighbor_alltoallw_init() 112 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPIX_Neighbor_alltoallw_init() 118 for (i = 0; i < indegree; ++i) { in MPIX_Neighbor_alltoallw_init() 138 indegree = dist_graph->indegree; in MPIX_Neighbor_alltoallw_init() 140 if( indegree < 0 || outdegree < 0 ) { in MPIX_Neighbor_alltoallw_init()
|
/dports/net/mpich/mpich-3.4.3/src/binding/fortran/use_mpi_f08/wrappers_f/ |
H A D | dist_graph_create_adjacent_f08ts.f90 | 17 integer, intent(in) :: indegree local 18 integer, intent(in) :: sources(indegree) 19 integer, intent(in), target :: sourceweights(indegree) 30 integer(c_int) :: sources_c(indegree) 31 integer(c_int), target :: sourceweights_c(indegree) 61 …ierror_c = MPIR_Dist_graph_create_adjacent_c(comm_old%MPI_VAL, indegree, sources, sourceweights_cp… 65 indegree_c = indegree
|
/dports/net/mpich/mpich-3.4.3/src/binding/fortran/use_mpi_f08/wrappers_f/profiling/ |
H A D | pdist_graph_create_adjacent_f08ts.f90 | 17 integer, intent(in) :: indegree local 18 integer, intent(in) :: sources(indegree) 19 integer, intent(in), target :: sourceweights(indegree) 30 integer(c_int) :: sources_c(indegree) 31 integer(c_int), target :: sourceweights_c(indegree) 61 …ierror_c = MPIR_Dist_graph_create_adjacent_c(comm_old%MPI_VAL, indegree, sources, sourceweights_cp… 65 indegree_c = indegree
|