Home
last modified time | relevance | path

Searched refs:outdegree (Results 1 – 25 of 346) sorted by relevance

12345678910>>...14

/dports/net/mpich/mpich-3.4.3/src/mpi/topo/
H A Ddist_gr_create_adj.c17 const int sourceweights[], int outdegree,
67 int outdegree, const int destinations[], in MPI_Dist_graph_create_adjacent() argument
114 MPIR_ERRTEST_ARGNEG(outdegree, "outdegree", mpi_errno); in MPI_Dist_graph_create_adjacent()
124 if (outdegree > 0) { in MPI_Dist_graph_create_adjacent()
156 dist_graph_ptr->outdegree = outdegree; in MPI_Dist_graph_create_adjacent()
172 if (outdegree > 0) { in MPI_Dist_graph_create_adjacent()
173 MPIR_CHKPMEM_MALLOC(dist_graph_ptr->out, int *, outdegree * sizeof(int), mpi_errno, in MPI_Dist_graph_create_adjacent()
175 MPIR_Memcpy(dist_graph_ptr->out, destinations, outdegree * sizeof(int)); in MPI_Dist_graph_create_adjacent()
177 MPIR_CHKPMEM_MALLOC(dist_graph_ptr->out_weights, int *, outdegree * sizeof(int), in MPI_Dist_graph_create_adjacent()
179 MPIR_Memcpy(dist_graph_ptr->out_weights, destweights, outdegree * sizeof(int)); in MPI_Dist_graph_create_adjacent()
[all …]
H A Ddist_gr_neighb_count.c16 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
40 *outdegree = topo_ptr->topo.dist_graph.outdegree; 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
105 MPIR_ERRTEST_ARGNULL(outdegree, "outdegree", 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()
132 outdegree, weighted); in MPI_Dist_graph_neighbors_count()
H A Dtopoutil.c163 copy_topology->topo.dist_graph.outdegree = old_topology->topo.dist_graph.outdegree; in MPIR_Topology_copy_fn()
166 MPIR_ARRAY_COPY_HELPER(dist_graph, out, outdegree); in MPIR_Topology_copy_fn()
169 MPIR_ARRAY_COPY_HELPER(dist_graph, out_weights, outdegree); in MPIR_Topology_copy_fn()
272 *indegree = *outdegree = nneighbors; in MPIR_Topo_canon_nhb_count()
276 *outdegree = 2 * topo_ptr->topo.cart.ndims; in MPIR_Topo_canon_nhb_count()
290 int outdegree, int dests[], int outweights[]) in MPIR_Topo_canon_nhb() argument
305 outdegree, dests, outweights); in MPIR_Topo_canon_nhb()
308 MPIR_Assert(indegree == outdegree); in MPIR_Topo_canon_nhb()
311 MPIR_Memcpy(dests, sources, outdegree * sizeof(*dests)); in MPIR_Topo_canon_nhb()
316 MPIR_Assert(indegree == outdegree); in MPIR_Topo_canon_nhb()
[all …]
/dports/net/mpich/mpich-3.4.3/test/mpi/cxx/topo/
H A Ddistgraphcxx.cxx24 int indegree, outdegree, sources[4], dests[4], sweights[4], dweights[4]; in main() local
35 outdegree = 0; in main()
37 dests[outdegree++] = wrank + 1; in main()
39 dests[outdegree++] = wrank + 3; in main()
45 outdegree, dests, MPI::INFO_NULL, false); in main()
60 if (myoutdegree != outdegree) { in main()
62 cout << "Outdegree is " << myoutdegree << " should be " << outdegree << "\n"; in main()
78 for (i = 0; i < outdegree; i++) { in main()
/dports/net/mpich2/mpich2-1.5/src/mpi/topo/
H A Ddist_gr_create_adj.c68 int outdegree, MPICH2_CONST int destinations[], in MPI_Dist_graph_create_adjacent() argument
114 MPIR_ERRTEST_ARGNEG(outdegree, "outdegree", mpi_errno); in MPI_Dist_graph_create_adjacent()
124 if (outdegree > 0) { in MPI_Dist_graph_create_adjacent()
155 dist_graph_ptr->outdegree = outdegree; in MPI_Dist_graph_create_adjacent()
161 …MPIU_CHKPMEM_MALLOC(dist_graph_ptr->out, int *, outdegree*sizeof(int), mpi_errno, "dist_graph_ptr-… in MPI_Dist_graph_create_adjacent()
163 MPIU_Memcpy(dist_graph_ptr->out, destinations, outdegree*sizeof(int)); in MPI_Dist_graph_create_adjacent()
167 …MPIU_CHKPMEM_MALLOC(dist_graph_ptr->out_weights, int *, outdegree*sizeof(int), mpi_errno, "dist_gr… in MPI_Dist_graph_create_adjacent()
169 MPIU_Memcpy(dist_graph_ptr->out_weights, destweights, outdegree*sizeof(int)); in MPI_Dist_graph_create_adjacent()
192 outdegree, destinations, destweights, in MPI_Dist_graph_create_adjacent()
H A Dtopoutil.c173 copy_topology->topo.dist_graph.outdegree = old_topology->topo.dist_graph.outdegree; in MPIR_Topology_copy_fn()
176 MPIR_ARRAY_COPY_HELPER(dist_graph, out, outdegree); in MPIR_Topology_copy_fn()
177 MPIR_ARRAY_COPY_HELPER(dist_graph, out_weights, outdegree); in MPIR_Topology_copy_fn()
289 *indegree = *outdegree = nneighbors; in MPIR_Topo_canon_nhb_count()
294 *outdegree = 2 * topo_ptr->topo.cart.ndims; in MPIR_Topo_canon_nhb_count()
313 int outdegree, int dests[], int outweights[]) in MPIR_Topo_canon_nhb() argument
327 outdegree, dests, outweights); in MPIR_Topo_canon_nhb()
331 MPIU_Assert(indegree == outdegree); in MPIR_Topo_canon_nhb()
334 MPIU_Memcpy(dests, sources, outdegree*sizeof(*dests)); in MPIR_Topo_canon_nhb()
340 MPIU_Assert(indegree == outdegree); in MPIR_Topo_canon_nhb()
[all …]
H A Ddist_gr_neighb_count.c33 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
41 *outdegree = topo_ptr->topo.dist_graph.outdegree; 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
109 MPIR_ERRTEST_ARGNULL(outdegree, "outdegree", 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/openmpi3/openmpi-3.1.6/ompi/mca/topo/base/
H A Dtopo_base_dist_graph_create_adjacent.c27 int outdegree, in mca_topo_base_dist_graph_create_adjacent() argument
61 topo->outdegree = outdegree; in mca_topo_base_dist_graph_create_adjacent()
79 if (topo->outdegree > 0) { in mca_topo_base_dist_graph_create_adjacent()
80 topo->out = (int*)malloc(sizeof(int) * topo->outdegree); in mca_topo_base_dist_graph_create_adjacent()
84 memcpy(topo->out, destinations, sizeof(int) * topo->outdegree); in mca_topo_base_dist_graph_create_adjacent()
87 if (topo->outdegree > 0) { in mca_topo_base_dist_graph_create_adjacent()
88 topo->outw = (int*)malloc(sizeof(int) * topo->outdegree); in mca_topo_base_dist_graph_create_adjacent()
92 memcpy(topo->outw, destweights, sizeof(int) * topo->outdegree); in mca_topo_base_dist_graph_create_adjacent()
H A Dtopo_base_frame.c74 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()
95 *outdegree = comm->c_topo->mtc.dist_graph->outdegree; in mca_topo_base_neighbor_count()
/dports/net/openmpi/openmpi-4.1.1/ompi/mca/topo/base/
H A Dtopo_base_dist_graph_create_adjacent.c27 int outdegree, in mca_topo_base_dist_graph_create_adjacent() argument
61 topo->outdegree = outdegree; in mca_topo_base_dist_graph_create_adjacent()
79 if (topo->outdegree > 0) { in mca_topo_base_dist_graph_create_adjacent()
80 topo->out = (int*)malloc(sizeof(int) * topo->outdegree); in mca_topo_base_dist_graph_create_adjacent()
84 memcpy(topo->out, destinations, sizeof(int) * topo->outdegree); in mca_topo_base_dist_graph_create_adjacent()
87 if (topo->outdegree > 0) { in mca_topo_base_dist_graph_create_adjacent()
88 topo->outw = (int*)malloc(sizeof(int) * topo->outdegree); in mca_topo_base_dist_graph_create_adjacent()
92 memcpy(topo->outw, destweights, sizeof(int) * topo->outdegree); in mca_topo_base_dist_graph_create_adjacent()
H A Dtopo_base_frame.c74 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()
95 *outdegree = comm->c_topo->mtc.dist_graph->outdegree; in mca_topo_base_neighbor_count()
/dports/net/openmpi/openmpi-4.1.1/ompi/mpi/c/
H A Dneighbor_alltoallv.c55 int indegree, outdegree; in MPI_Neighbor_alltoallv() local
73 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallv()
76 for ( i = 0; i < outdegree; i++ ) { in MPI_Neighbor_alltoallv()
106 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallv()
108 if (((0 < outdegree) && ((NULL == sendcounts) || (NULL == sdispls))) || in MPI_Neighbor_alltoallv()
113 for (i = 0; i < outdegree; ++i) { in MPI_Neighbor_alltoallv()
138 outdegree = dist_graph->outdegree; in MPI_Neighbor_alltoallv()
139 if( indegree < 0 || outdegree < 0 ) { in MPI_Neighbor_alltoallv()
H A Dineighbor_alltoallw.c56 int indegree, outdegree; in MPI_Ineighbor_alltoallw() local
66 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallw()
69 for ( i = 0; i < outdegree; i++ ) { in MPI_Ineighbor_alltoallw()
105 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallw()
107 … if (((0 < outdegree) && ((NULL == sendcounts) || (NULL == sdispls) || (NULL == sendtypes))) || in MPI_Ineighbor_alltoallw()
112 for (i = 0; i < outdegree; ++i) { in MPI_Ineighbor_alltoallw()
137 outdegree = dist_graph->outdegree; in MPI_Ineighbor_alltoallw()
138 if( indegree < 0 || outdegree < 0 ) { in MPI_Ineighbor_alltoallw()
H A Dneighbor_alltoallw.c55 int indegree, outdegree; in MPI_Neighbor_alltoallw() local
65 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallw()
68 for ( i = 0; i < outdegree; i++ ) { in MPI_Neighbor_alltoallw()
102 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallw()
104 … if (((0 < outdegree) && ((NULL == sendcounts) || (NULL == sdispls) || (NULL == sendtypes))) || in MPI_Neighbor_alltoallw()
109 for (i = 0; i < outdegree; ++i) { in MPI_Neighbor_alltoallw()
134 outdegree = dist_graph->outdegree; in MPI_Neighbor_alltoallw()
135 if( indegree < 0 || outdegree < 0 ) { in MPI_Neighbor_alltoallw()
H A Dineighbor_alltoallv.c56 int indegree, outdegree; in MPI_Ineighbor_alltoallv() local
74 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallv()
77 for ( i = 0; i < outdegree; i++ ) { in MPI_Ineighbor_alltoallv()
107 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallv()
109 if (((0 < outdegree) && ((NULL == sendcounts) || (NULL == sdispls))) || in MPI_Ineighbor_alltoallv()
114 for (i = 0; i < outdegree; ++i) { in MPI_Ineighbor_alltoallv()
139 outdegree = dist_graph->outdegree; in MPI_Ineighbor_alltoallv()
140 if( indegree < 0 || outdegree < 0 ) { in MPI_Ineighbor_alltoallv()
/dports/net/mpich/mpich-3.4.3/src/binding/fortran/use_mpi_f08/wrappers_f/
H A Ddist_graph_create_adjacent_f08ts.f907 outdegree, destinations, destweights, info, reorder, comm_dist_graph, ierror) argument
20 integer, intent(in) :: outdegree local
21 integer, intent(in) :: destinations(outdegree)
22 integer, intent(in), target :: destweights(outdegree)
33 integer(c_int) :: destinations_c(outdegree)
34 integer(c_int), target :: destweights_c(outdegree)
61 …_Dist_graph_create_adjacent_c(comm_old%MPI_VAL, indegree, sources, sourceweights_cptr, outdegree, &
67 outdegree_c = outdegree
/dports/net/mpich/mpich-3.4.3/src/binding/fortran/use_mpi_f08/wrappers_f/profiling/
H A Dpdist_graph_create_adjacent_f08ts.f907 outdegree, destinations, destweights, info, reorder, comm_dist_graph, ierror) argument
20 integer, intent(in) :: outdegree local
21 integer, intent(in) :: destinations(outdegree)
22 integer, intent(in), target :: destweights(outdegree)
33 integer(c_int) :: destinations_c(outdegree)
34 integer(c_int), target :: destweights_c(outdegree)
61 …_Dist_graph_create_adjacent_c(comm_old%MPI_VAL, indegree, sources, sourceweights_cptr, outdegree, &
67 outdegree_c = outdegree
/dports/net/openmpi3/openmpi-3.1.6/ompi/mpi/c/
H A Dineighbor_alltoallv.c54 int indegree, outdegree; in MPI_Ineighbor_alltoallv() local
70 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallv()
73 for ( i = 0; i < outdegree; i++ ) { in MPI_Ineighbor_alltoallv()
107 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallv()
109 for (i = 0; i < outdegree; ++i) { in MPI_Ineighbor_alltoallv()
134 outdegree = dist_graph->outdegree; in MPI_Ineighbor_alltoallv()
135 if( indegree < 0 || outdegree < 0 ) { in MPI_Ineighbor_alltoallv()
H A Dneighbor_alltoallv.c54 int indegree, outdegree; in MPI_Neighbor_alltoallv() local
70 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallv()
73 for ( i = 0; i < outdegree; i++ ) { in MPI_Neighbor_alltoallv()
107 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallv()
109 for (i = 0; i < outdegree; ++i) { in MPI_Neighbor_alltoallv()
134 outdegree = dist_graph->outdegree; in MPI_Neighbor_alltoallv()
135 if( indegree < 0 || outdegree < 0 ) { in MPI_Neighbor_alltoallv()
H A Dineighbor_alltoallw.c54 int indegree, outdegree; in MPI_Ineighbor_alltoallw() local
62 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallw()
65 for ( i = 0; i < outdegree; i++ ) { in MPI_Ineighbor_alltoallw()
107 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Ineighbor_alltoallw()
109 for (i = 0; i < outdegree; ++i) { in MPI_Ineighbor_alltoallw()
134 outdegree = dist_graph->outdegree; in MPI_Ineighbor_alltoallw()
135 if( indegree < 0 || outdegree < 0 ) { in MPI_Ineighbor_alltoallw()
H A Dneighbor_alltoallw.c54 int indegree, outdegree; in MPI_Neighbor_alltoallw() local
62 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallw()
65 for ( i = 0; i < outdegree; i++ ) { in MPI_Neighbor_alltoallw()
103 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPI_Neighbor_alltoallw()
105 for (i = 0; i < outdegree; ++i) { in MPI_Neighbor_alltoallw()
130 outdegree = dist_graph->outdegree; in MPI_Neighbor_alltoallw()
131 if( indegree < 0 || outdegree < 0 ) { in MPI_Neighbor_alltoallw()
/dports/net/openmpi/openmpi-4.1.1/ompi/mpiext/pcollreq/c/
H A Dneighbor_alltoallv_init.c57 int indegree, outdegree; in MPIX_Neighbor_alltoallv_init() local
75 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPIX_Neighbor_alltoallv_init()
78 for ( i = 0; i < outdegree; i++ ) { in MPIX_Neighbor_alltoallv_init()
112 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPIX_Neighbor_alltoallv_init()
114 for (i = 0; i < outdegree; ++i) { in MPIX_Neighbor_alltoallv_init()
139 outdegree = dist_graph->outdegree; in MPIX_Neighbor_alltoallv_init()
140 if( indegree < 0 || outdegree < 0 ) { in MPIX_Neighbor_alltoallv_init()
H A Dneighbor_alltoallw_init.c57 int indegree, outdegree; in MPIX_Neighbor_alltoallw_init() local
67 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPIX_Neighbor_alltoallw_init()
70 for ( i = 0; i < outdegree; i++ ) { in MPIX_Neighbor_alltoallw_init()
112 err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); in MPIX_Neighbor_alltoallw_init()
114 for (i = 0; i < outdegree; ++i) { in MPIX_Neighbor_alltoallw_init()
139 outdegree = dist_graph->outdegree; in MPIX_Neighbor_alltoallw_init()
140 if( indegree < 0 || outdegree < 0 ) { in MPIX_Neighbor_alltoallw_init()
/dports/graphics/R-cran-DiagrammeR/DiagrammeR/R/
H A Dget_node_info.R148 outdegree <- 0 functionVar
156 outdegree <- vector(mode = "character")
158 outdegree <-
159 c(outdegree,
163 outdegree <- length(outdegree)
191 node_properties[i, 6] <- outdegree
/dports/net/openmpi/openmpi-4.1.1/ompi/mpi/fortran/mpif-h/
H A Ddist_graph_create_adjacent_f.c40 …_Fint *indegree, MPI_Fint *sources, MPI_Fint *sourceweights, MPI_Fint *outdegree, MPI_Fint *dest…
41 …(comm_old, indegree, sources, sourceweights, outdegree, destinations, destweights, info, reorder, …
60 …_Fint *indegree, MPI_Fint *sources, MPI_Fint *sourceweights, MPI_Fint *outdegree, MPI_Fint *dest…
61 …(comm_old, indegree, sources, sourceweights, outdegree, destinations, destweights, info, reorder,…
73 MPI_Fint *outdegree, in ompi_dist_graph_create_adjacent_f() argument
99 OMPI_ARRAY_FINT_2_INT(destinations, *outdegree); in ompi_dist_graph_create_adjacent_f()
112 OMPI_FINT_2_INT(*outdegree), in ompi_dist_graph_create_adjacent_f()

12345678910>>...14