outdegree 441 ompi/communicator/communicator.h int sourceweights[], int outdegree, outdegree 430 ompi/debuggers/ompi_common_dll.c ompi_field_offset(i_info->mca_topo_base_module_t.offset.mtc_dist_graph.outdegree, outdegree 432 ompi/debuggers/ompi_common_dll.c outdegree); outdegree 233 ompi/debuggers/ompi_common_dll_defs.h int outdegree; outdegree 181 ompi/mca/coll/basic/coll_basic_neighbor_allgather.c int indegree, outdegree; outdegree 187 ompi/mca/coll/basic/coll_basic_neighbor_allgather.c outdegree = dist_graph->outdegree; outdegree 188 ompi/mca/coll/basic/coll_basic_neighbor_allgather.c if( 0 == (indegree + outdegree) ) return OMPI_SUCCESS; outdegree 194 ompi/mca/coll/basic/coll_basic_neighbor_allgather.c reqs = preqs = ompi_coll_base_comm_get_reqs( module->base_data, indegree + outdegree); outdegree 210 ompi/mca/coll/basic/coll_basic_neighbor_allgather.c for (neighbor = 0 ; neighbor < outdegree ; ++neighbor) { outdegree 225 ompi/mca/coll/basic/coll_basic_neighbor_allgather.c rc = ompi_request_wait_all (indegree + outdegree, reqs, MPI_STATUSES_IGNORE); outdegree 227 ompi/mca/coll/basic/coll_basic_neighbor_allgather.c ompi_coll_base_free_reqs(reqs, indegree + outdegree); outdegree 166 ompi/mca/coll/basic/coll_basic_neighbor_allgatherv.c int indegree, outdegree; outdegree 172 ompi/mca/coll/basic/coll_basic_neighbor_allgatherv.c outdegree = dist_graph->outdegree; outdegree 173 ompi/mca/coll/basic/coll_basic_neighbor_allgatherv.c if( 0 == (indegree + outdegree) ) return OMPI_SUCCESS; outdegree 179 ompi/mca/coll/basic/coll_basic_neighbor_allgatherv.c reqs = preqs = ompi_coll_base_comm_get_reqs( module->base_data, indegree + outdegree); outdegree 193 ompi/mca/coll/basic/coll_basic_neighbor_allgatherv.c for (neighbor = 0 ; neighbor < outdegree ; ++neighbor) { outdegree 207 ompi/mca/coll/basic/coll_basic_neighbor_allgatherv.c rc = ompi_request_wait_all (indegree + outdegree, reqs, MPI_STATUSES_IGNORE); outdegree 209 ompi/mca/coll/basic/coll_basic_neighbor_allgatherv.c ompi_coll_base_free_reqs(reqs, indegree + outdegree); outdegree 207 ompi/mca/coll/basic/coll_basic_neighbor_alltoall.c int indegree, outdegree; outdegree 211 ompi/mca/coll/basic/coll_basic_neighbor_alltoall.c outdegree = dist_graph->outdegree; outdegree 212 ompi/mca/coll/basic/coll_basic_neighbor_alltoall.c if( 0 == (indegree + outdegree) ) return OMPI_SUCCESS; outdegree 219 ompi/mca/coll/basic/coll_basic_neighbor_alltoall.c reqs = preqs = ompi_coll_base_comm_get_reqs( module->base_data, indegree + outdegree); outdegree 236 ompi/mca/coll/basic/coll_basic_neighbor_alltoall.c for (neighbor = 0 ; neighbor < outdegree ; ++neighbor) { outdegree 250 ompi/mca/coll/basic/coll_basic_neighbor_alltoall.c rc = ompi_request_wait_all (indegree + outdegree, reqs, MPI_STATUSES_IGNORE); outdegree 252 ompi/mca/coll/basic/coll_basic_neighbor_alltoall.c ompi_coll_base_free_reqs(reqs, indegree + outdegree); outdegree 193 ompi/mca/coll/basic/coll_basic_neighbor_alltoallv.c int indegree, outdegree; outdegree 197 ompi/mca/coll/basic/coll_basic_neighbor_alltoallv.c outdegree = dist_graph->outdegree; outdegree 198 ompi/mca/coll/basic/coll_basic_neighbor_alltoallv.c if( 0 == (indegree + outdegree) ) return OMPI_SUCCESS; outdegree 205 ompi/mca/coll/basic/coll_basic_neighbor_alltoallv.c reqs = preqs = ompi_coll_base_comm_get_reqs( module->base_data, indegree + outdegree); outdegree 220 ompi/mca/coll/basic/coll_basic_neighbor_alltoallv.c for (neighbor = 0 ; neighbor < outdegree ; ++neighbor) { outdegree 233 ompi/mca/coll/basic/coll_basic_neighbor_alltoallv.c rc = ompi_request_wait_all (indegree + outdegree, reqs, MPI_STATUSES_IGNORE); outdegree 235 ompi/mca/coll/basic/coll_basic_neighbor_alltoallv.c ompi_coll_base_free_reqs( reqs, indegree + outdegree ); outdegree 186 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c int indegree, outdegree; outdegree 190 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c outdegree = dist_graph->outdegree; outdegree 191 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c if( 0 == (indegree + outdegree) ) return OMPI_SUCCESS; outdegree 196 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c if (0 == indegree+outdegree) return OMPI_SUCCESS; outdegree 198 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c reqs = preqs = ompi_coll_base_comm_get_reqs( module->base_data, indegree + outdegree ); outdegree 213 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c for (neighbor = 0 ; neighbor < outdegree ; ++neighbor) { outdegree 226 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c rc = ompi_request_wait_all (indegree + outdegree, reqs, MPI_STATUSES_IGNORE); outdegree 228 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c ompi_coll_base_free_reqs( reqs, indegree + outdegree ); outdegree 51 ompi/mca/coll/libnbc/nbc_ineighbor_allgather.c int res, indegree, outdegree, *srcs, *dsts; outdegree 81 ompi/mca/coll/libnbc/nbc_ineighbor_allgather.c res = NBC_Comm_neighbors (comm, &srcs, &indegree, &dsts, &outdegree); outdegree 104 ompi/mca/coll/libnbc/nbc_ineighbor_allgather.c for (int i = 0 ; i < outdegree ; ++i) { outdegree 51 ompi/mca/coll/libnbc/nbc_ineighbor_allgatherv.c int res, indegree, outdegree, *srcs, *dsts; outdegree 81 ompi/mca/coll/libnbc/nbc_ineighbor_allgatherv.c res = NBC_Comm_neighbors(comm, &srcs, &indegree, &dsts, &outdegree); outdegree 105 ompi/mca/coll/libnbc/nbc_ineighbor_allgatherv.c for (int i = 0 ; i < outdegree ; ++i) { outdegree 48 ompi/mca/coll/libnbc/nbc_ineighbor_alltoall.c int res, indegree, outdegree, *srcs, *dsts; outdegree 84 ompi/mca/coll/libnbc/nbc_ineighbor_alltoall.c res = NBC_Comm_neighbors(comm, &srcs, &indegree, &dsts, &outdegree); outdegree 107 ompi/mca/coll/libnbc/nbc_ineighbor_alltoall.c for (int i = 0 ; i < outdegree ; ++i) { outdegree 51 ompi/mca/coll/libnbc/nbc_ineighbor_alltoallv.c int res, indegree, outdegree, *srcs, *dsts; outdegree 87 ompi/mca/coll/libnbc/nbc_ineighbor_alltoallv.c res = NBC_Comm_neighbors (comm, &srcs, &indegree, &dsts, &outdegree); outdegree 111 ompi/mca/coll/libnbc/nbc_ineighbor_alltoallv.c for (int i = 0 ; i < outdegree ; ++i) { outdegree 50 ompi/mca/coll/libnbc/nbc_ineighbor_alltoallw.c int res, indegree, outdegree, *srcs, *dsts; outdegree 73 ompi/mca/coll/libnbc/nbc_ineighbor_alltoallw.c res = NBC_Comm_neighbors (comm, &srcs, &indegree, &dsts, &outdegree); outdegree 97 ompi/mca/coll/libnbc/nbc_ineighbor_alltoallw.c for (int i = 0 ; i < outdegree ; ++i) { outdegree 580 ompi/mca/coll/libnbc/nbc_internal.h int NBC_Comm_neighbors_count (ompi_communicator_t *comm, int *indegree, int *outdegree); outdegree 18 ompi/mca/coll/libnbc/nbc_neighbor_helpers.c int NBC_Comm_neighbors_count (ompi_communicator_t *comm, int *indegree, int *outdegree) { outdegree 22 ompi/mca/coll/libnbc/nbc_neighbor_helpers.c *outdegree = *indegree = 2 * comm->c_topo->mtc.cart->ndims; outdegree 30 ompi/mca/coll/libnbc/nbc_neighbor_helpers.c *outdegree = *indegree = nneighbors; outdegree 34 ompi/mca/coll/libnbc/nbc_neighbor_helpers.c *outdegree = comm->c_topo->mtc.dist_graph->outdegree; outdegree 182 ompi/mca/topo/base/base.h const int sourceweights[], int outdegree, outdegree 199 ompi/mca/topo/base/base.h int mca_topo_base_neighbor_count (ompi_communicator_t *comm, int *indegree, int *outdegree); outdegree 131 ompi/mca/topo/base/topo_base_dist_graph_create.c topo->outdegree = idx[0].out; outdegree 147 ompi/mca/topo/base/topo_base_dist_graph_create.c if (topo->outdegree > 0) { outdegree 148 ompi/mca/topo/base/topo_base_dist_graph_create.c topo->out = (int*)malloc(sizeof(int) * topo->outdegree); outdegree 154 ompi/mca/topo/base/topo_base_dist_graph_create.c topo->outw = (int*)malloc(sizeof(int) * topo->outdegree); outdegree 229 ompi/mca/topo/base/topo_base_dist_graph_create.c count = topo->outdegree; outdegree 330 ompi/mca/topo/base/topo_base_dist_graph_create.c dist_graph->outdegree = 0; outdegree 27 ompi/mca/topo/base/topo_base_dist_graph_create_adjacent.c int outdegree, outdegree 61 ompi/mca/topo/base/topo_base_dist_graph_create_adjacent.c topo->outdegree = outdegree; outdegree 79 ompi/mca/topo/base/topo_base_dist_graph_create_adjacent.c if (topo->outdegree > 0) { outdegree 80 ompi/mca/topo/base/topo_base_dist_graph_create_adjacent.c topo->out = (int*)malloc(sizeof(int) * topo->outdegree); outdegree 84 ompi/mca/topo/base/topo_base_dist_graph_create_adjacent.c memcpy(topo->out, destinations, sizeof(int) * topo->outdegree); outdegree 87 ompi/mca/topo/base/topo_base_dist_graph_create_adjacent.c if (topo->outdegree > 0) { outdegree 88 ompi/mca/topo/base/topo_base_dist_graph_create_adjacent.c topo->outw = (int*)malloc(sizeof(int) * topo->outdegree); outdegree 92 ompi/mca/topo/base/topo_base_dist_graph_create_adjacent.c memcpy(topo->outw, destweights, sizeof(int) * topo->outdegree); outdegree 37 ompi/mca/topo/base/topo_base_dist_graph_neighbors.c if (maxoutdegree > dg->outdegree) { outdegree 38 ompi/mca/topo/base/topo_base_dist_graph_neighbors.c maxoutdegree = dg->outdegree; outdegree 28 ompi/mca/topo/base/topo_base_dist_graph_neighbors_count.c *outneighbors = dist_graph->outdegree; outdegree 74 ompi/mca/topo/base/topo_base_frame.c int mca_topo_base_neighbor_count (ompi_communicator_t *comm, int *indegree, int *outdegree) { outdegree 83 ompi/mca/topo/base/topo_base_frame.c *outdegree = *indegree = 2 * comm->c_topo->mtc.cart->ndims; outdegree 91 ompi/mca/topo/base/topo_base_frame.c *outdegree = *indegree = nneighbors; outdegree 95 ompi/mca/topo/base/topo_base_frame.c *outdegree = comm->c_topo->mtc.dist_graph->outdegree; outdegree 109 ompi/mca/topo/topo.h int indegree, outdegree; outdegree 265 ompi/mca/topo/topo.h int outdegree, outdegree 400 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(i = 0; i < topo->outdegree ; i++) outdegree 747 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(i = 0; i < topo->outdegree; i++) outdegree 46 ompi/mpi/c/dist_graph_create_adjacent.c const int sourceweights[], int outdegree, outdegree 66 ompi/mpi/c/dist_graph_create_adjacent.c } else if (indegree < 0 || outdegree < 0 || NULL == comm_dist_graph) { outdegree 71 ompi/mpi/c/dist_graph_create_adjacent.c (outdegree > 0 && outdegree 85 ompi/mpi/c/dist_graph_create_adjacent.c for (i = 0; i < outdegree; ++i) { outdegree 103 ompi/mpi/c/dist_graph_create_adjacent.c sources, sourceweights, outdegree, outdegree 114 ompi/mpi/c/ineighbor_allgather.c int outdegree = dist_graph->outdegree; outdegree 115 ompi/mpi/c/ineighbor_allgather.c if( indegree < 0 || outdegree < 0 ) { outdegree 136 ompi/mpi/c/ineighbor_allgatherv.c int outdegree = dist_graph->outdegree; outdegree 137 ompi/mpi/c/ineighbor_allgatherv.c if( indegree < 0 || outdegree < 0 ) { outdegree 114 ompi/mpi/c/ineighbor_alltoall.c int outdegree = dist_graph->outdegree; outdegree 115 ompi/mpi/c/ineighbor_alltoall.c if( indegree < 0 || outdegree < 0 ) { outdegree 55 ompi/mpi/c/ineighbor_alltoallv.c int indegree, outdegree; outdegree 73 ompi/mpi/c/ineighbor_alltoallv.c err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); outdegree 76 ompi/mpi/c/ineighbor_alltoallv.c for ( i = 0; i < outdegree; i++ ) { outdegree 110 ompi/mpi/c/ineighbor_alltoallv.c err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); outdegree 112 ompi/mpi/c/ineighbor_alltoallv.c for (i = 0; i < outdegree; ++i) { outdegree 137 ompi/mpi/c/ineighbor_alltoallv.c outdegree = dist_graph->outdegree; outdegree 138 ompi/mpi/c/ineighbor_alltoallv.c if( indegree < 0 || outdegree < 0 ) { outdegree 55 ompi/mpi/c/ineighbor_alltoallw.c int indegree, outdegree; outdegree 65 ompi/mpi/c/ineighbor_alltoallw.c err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); outdegree 68 ompi/mpi/c/ineighbor_alltoallw.c for ( i = 0; i < outdegree; i++ ) { outdegree 110 ompi/mpi/c/ineighbor_alltoallw.c err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); outdegree 112 ompi/mpi/c/ineighbor_alltoallw.c for (i = 0; i < outdegree; ++i) { outdegree 137 ompi/mpi/c/ineighbor_alltoallw.c outdegree = dist_graph->outdegree; outdegree 138 ompi/mpi/c/ineighbor_alltoallw.c if( indegree < 0 || outdegree < 0 ) { outdegree 114 ompi/mpi/c/neighbor_allgather.c int outdegree = dist_graph->outdegree; outdegree 115 ompi/mpi/c/neighbor_allgather.c if( indegree < 0 || outdegree < 0 ) { outdegree 137 ompi/mpi/c/neighbor_allgatherv.c int outdegree = dist_graph->outdegree; outdegree 138 ompi/mpi/c/neighbor_allgatherv.c if( indegree < 0 || outdegree < 0 ) { outdegree 113 ompi/mpi/c/neighbor_alltoall.c int outdegree = dist_graph->outdegree; outdegree 114 ompi/mpi/c/neighbor_alltoall.c if( indegree < 0 || outdegree < 0 ) { outdegree 55 ompi/mpi/c/neighbor_alltoallv.c int indegree, outdegree; outdegree 73 ompi/mpi/c/neighbor_alltoallv.c err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); outdegree 76 ompi/mpi/c/neighbor_alltoallv.c for ( i = 0; i < outdegree; i++ ) { outdegree 110 ompi/mpi/c/neighbor_alltoallv.c err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); outdegree 112 ompi/mpi/c/neighbor_alltoallv.c for (i = 0; i < outdegree; ++i) { outdegree 137 ompi/mpi/c/neighbor_alltoallv.c outdegree = dist_graph->outdegree; outdegree 138 ompi/mpi/c/neighbor_alltoallv.c if( indegree < 0 || outdegree < 0 ) { outdegree 55 ompi/mpi/c/neighbor_alltoallw.c int indegree, outdegree; outdegree 65 ompi/mpi/c/neighbor_alltoallw.c err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); outdegree 68 ompi/mpi/c/neighbor_alltoallw.c for ( i = 0; i < outdegree; i++ ) { outdegree 106 ompi/mpi/c/neighbor_alltoallw.c err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); outdegree 108 ompi/mpi/c/neighbor_alltoallw.c for (i = 0; i < outdegree; ++i) { outdegree 133 ompi/mpi/c/neighbor_alltoallw.c outdegree = dist_graph->outdegree; outdegree 134 ompi/mpi/c/neighbor_alltoallw.c if( indegree < 0 || outdegree < 0 ) { outdegree 40 ompi/mpi/fortran/mpif-h/dist_graph_create_adjacent_f.c (MPI_Fint *comm_old, MPI_Fint *indegree, MPI_Fint *sources, MPI_Fint *sourceweights, MPI_Fint *outdegree, MPI_Fint *destinations, MPI_Fint *destweights, MPI_Fint *info, ompi_fortran_logical_t *reorder, MPI_Fint *comm_graph, MPI_Fint *ierr), outdegree 41 ompi/mpi/fortran/mpif-h/dist_graph_create_adjacent_f.c (comm_old, indegree, sources, sourceweights, outdegree, destinations, destweights, info, reorder, comm_graph, ierr) ) outdegree 60 ompi/mpi/fortran/mpif-h/dist_graph_create_adjacent_f.c (MPI_Fint *comm_old, MPI_Fint *indegree, MPI_Fint *sources, MPI_Fint *sourceweights, MPI_Fint *outdegree, MPI_Fint *destinations, MPI_Fint *destweights, MPI_Fint *info, ompi_fortran_logical_t *reorder, MPI_Fint *comm_graph, MPI_Fint *ierr), outdegree 61 ompi/mpi/fortran/mpif-h/dist_graph_create_adjacent_f.c (comm_old, indegree, sources, sourceweights, outdegree, destinations, destweights, info, reorder, comm_graph, ierr) ) outdegree 73 ompi/mpi/fortran/mpif-h/dist_graph_create_adjacent_f.c MPI_Fint *outdegree, outdegree 98 ompi/mpi/fortran/mpif-h/dist_graph_create_adjacent_f.c OMPI_ARRAY_FINT_2_INT(destinations, *outdegree); outdegree 111 ompi/mpi/fortran/mpif-h/dist_graph_create_adjacent_f.c OMPI_FINT_2_INT(*outdegree), outdegree 158 ompi/mpi/fortran/mpif-h/prototypes_mpi.h PN2(void, MPI_Dist_graph_create_adjacent, mpi_dist_graph_create_adjacent, MPI_DIST_GRAPH_CREATE_ADJACENT, (MPI_Fint *comm_old, MPI_Fint *indegree, MPI_Fint *sources, MPI_Fint *sourceweights, MPI_Fint *outdegree, MPI_Fint *destinations, MPI_Fint *destweights, MPI_Fint *info, ompi_fortran_logical_t *reorder, MPI_Fint *comm_graph, MPI_Fint *ierr)); outdegree 2360 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h outdegree, destinations, destweights, info, reorder, & outdegree 2366 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h integer, intent(in) :: outdegree outdegree 2367 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h integer, dimension(outdegree), intent(in) :: destinations outdegree 2368 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h integer, dimension(outdegree), intent(in) :: destweights outdegree 2380 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h subroutine MPI_Dist_graph_neighbors_count(comm, indegree, outdegree, weighted, ierror) outdegree 2383 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h integer, intent(out) :: outdegree outdegree 2362 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h outdegree, destinations, destweights, info, reorder, & outdegree 2368 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h integer, intent(in) :: outdegree outdegree 2369 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h integer, dimension(outdegree), intent(in) :: destinations outdegree 2370 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h integer, dimension(outdegree), intent(in) :: destweights outdegree 2382 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h subroutine PMPI_Dist_graph_neighbors_count(comm, indegree, outdegree, weighted, ierror) outdegree 2385 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h integer, intent(out) :: outdegree outdegree 115 ompi/mpiext/pcollreq/c/neighbor_allgather_init.c int outdegree = dist_graph->outdegree; outdegree 116 ompi/mpiext/pcollreq/c/neighbor_allgather_init.c if( indegree < 0 || outdegree < 0 ) { outdegree 138 ompi/mpiext/pcollreq/c/neighbor_allgatherv_init.c int outdegree = dist_graph->outdegree; outdegree 139 ompi/mpiext/pcollreq/c/neighbor_allgatherv_init.c if( indegree < 0 || outdegree < 0 ) { outdegree 115 ompi/mpiext/pcollreq/c/neighbor_alltoall_init.c int outdegree = dist_graph->outdegree; outdegree 116 ompi/mpiext/pcollreq/c/neighbor_alltoall_init.c if( indegree < 0 || outdegree < 0 ) { outdegree 56 ompi/mpiext/pcollreq/c/neighbor_alltoallv_init.c int indegree, outdegree; outdegree 74 ompi/mpiext/pcollreq/c/neighbor_alltoallv_init.c err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); outdegree 77 ompi/mpiext/pcollreq/c/neighbor_alltoallv_init.c for ( i = 0; i < outdegree; i++ ) { outdegree 111 ompi/mpiext/pcollreq/c/neighbor_alltoallv_init.c err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); outdegree 113 ompi/mpiext/pcollreq/c/neighbor_alltoallv_init.c for (i = 0; i < outdegree; ++i) { outdegree 138 ompi/mpiext/pcollreq/c/neighbor_alltoallv_init.c outdegree = dist_graph->outdegree; outdegree 139 ompi/mpiext/pcollreq/c/neighbor_alltoallv_init.c if( indegree < 0 || outdegree < 0 ) { outdegree 56 ompi/mpiext/pcollreq/c/neighbor_alltoallw_init.c int indegree, outdegree; outdegree 66 ompi/mpiext/pcollreq/c/neighbor_alltoallw_init.c err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); outdegree 69 ompi/mpiext/pcollreq/c/neighbor_alltoallw_init.c for ( i = 0; i < outdegree; i++ ) { outdegree 111 ompi/mpiext/pcollreq/c/neighbor_alltoallw_init.c err = mca_topo_base_neighbor_count (comm, &indegree, &outdegree); outdegree 113 ompi/mpiext/pcollreq/c/neighbor_alltoallw_init.c for (i = 0; i < outdegree; ++i) { outdegree 138 ompi/mpiext/pcollreq/c/neighbor_alltoallw_init.c outdegree = dist_graph->outdegree; outdegree 139 ompi/mpiext/pcollreq/c/neighbor_alltoallw_init.c if( indegree < 0 || outdegree < 0 ) {