degrees           166 ompi/mca/topo/base/base.h                                     const int degrees[], const int targets[],
degrees           174 ompi/mca/topo/base/base.h                                 const int degrees[], const int targets[], const int weights[],
degrees            38 ompi/mca/topo/base/topo_base_dist_graph_create.c                                         const int degrees[], const int targets[],
degrees            69 ompi/mca/topo/base/topo_base_dist_graph_create.c         cnt[nodes[i]].out += degrees[i];
degrees            70 ompi/mca/topo/base/topo_base_dist_graph_create.c         for( j = 0; j < degrees[i]; ++j ) {
degrees            96 ompi/mca/topo/base/topo_base_dist_graph_create.c         for( j = 0; j < degrees[i]; ++j ) {  /* for each node's degree */
degrees           285 ompi/mca/topo/base/topo_base_dist_graph_create.c                                     const int degrees[], const int targets[],
degrees           315 ompi/mca/topo/base/topo_base_dist_graph_create.c                                               degrees, targets,
degrees           255 ompi/mca/topo/topo.h                      const int degrees[], const int targets[], const int weights[],
degrees            71 ompi/mca/topo/treematch/topo_treematch.h                                          const int degrees[], const int targets[],
degrees           100 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                                          const int degrees[], const int targets[],
degrees           108 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                                                                    degrees, targets, weights,
degrees            38 ompi/mpi/c/dist_graph_create.c                           const int degrees[], const int destinations[], const int weights[],
degrees            58 ompi/mpi/c/dist_graph_create.c         } else if (n > 0 && (NULL == sources || NULL == degrees ||
degrees            68 ompi/mpi/c/dist_graph_create.c             } else if (degrees[i] < 0) {
degrees            72 ompi/mpi/c/dist_graph_create.c             for( j = 0; j < degrees[i]; ++j ) {
degrees            91 ompi/mpi/c/dist_graph_create.c     err = topo->topo.dist_graph.dist_graph_create(topo, comm_old, n, sources, degrees,
degrees            39 ompi/mpi/fortran/mpif-h/dist_graph_create_f.c                             (MPI_Fint *comm_old, MPI_Fint *n, MPI_Fint *sources, MPI_Fint *degrees, MPI_Fint *destinations, MPI_Fint *weights, MPI_Fint *info,  ompi_fortran_logical_t *reorder, MPI_Fint *comm_graph,  MPI_Fint *ierr),
degrees            40 ompi/mpi/fortran/mpif-h/dist_graph_create_f.c                             (comm_old, n, sources, degrees, destinations, weights, info,  reorder, comm_graph, ierr) )
degrees            59 ompi/mpi/fortran/mpif-h/dist_graph_create_f.c                             (MPI_Fint *comm_old, MPI_Fint *n, MPI_Fint *sources, MPI_Fint *degrees, MPI_Fint *destinations, MPI_Fint *weights, MPI_Fint *info,  ompi_fortran_logical_t *reorder, MPI_Fint *comm_graph,  MPI_Fint *ierr),
degrees            60 ompi/mpi/fortran/mpif-h/dist_graph_create_f.c                             (comm_old, n, sources, degrees, destinations, weights, info, reorder, comm_graph, ierr) )
degrees            70 ompi/mpi/fortran/mpif-h/dist_graph_create_f.c                               MPI_Fint *degrees, MPI_Fint *destinations, MPI_Fint *weights,
degrees            80 ompi/mpi/fortran/mpif-h/dist_graph_create_f.c     OMPI_ARRAY_NAME_DECL(degrees);
degrees            86 ompi/mpi/fortran/mpif-h/dist_graph_create_f.c     OMPI_ARRAY_FINT_2_INT(degrees, *n);
degrees            88 ompi/mpi/fortran/mpif-h/dist_graph_create_f.c         count += OMPI_ARRAY_NAME_CONVERT(degrees)[i];
degrees           102 ompi/mpi/fortran/mpif-h/dist_graph_create_f.c                                                    OMPI_ARRAY_NAME_CONVERT(degrees), OMPI_ARRAY_NAME_CONVERT(destinations),
degrees           109 ompi/mpi/fortran/mpif-h/dist_graph_create_f.c     OMPI_ARRAY_FINT_2_INT_CLEANUP(degrees);
degrees           157 ompi/mpi/fortran/mpif-h/prototypes_mpi.h PN2(void, MPI_Dist_graph_create, mpi_dist_graph_create, MPI_DIST_GRAPH_CREATE, (MPI_Fint *comm_old, MPI_Fint *n, MPI_Fint *sources, MPI_Fint *degrees, MPI_Fint *destinations, MPI_Fint *weights, MPI_Fint *info,  ompi_fortran_logical_t *reorder, MPI_Fint *comm_graph,  MPI_Fint *ierr));
degrees          2340 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h subroutine MPI_Dist_graph_create(comm_old, n, sources, degrees, destinations, &
degrees          2345 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h   integer, dimension(n), intent(in) :: degrees
degrees          2342 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h subroutine PMPI_Dist_graph_create(comm_old, n, sources, degrees, destinations, &
degrees          2347 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h   integer, dimension(n), intent(in) :: degrees
degrees           145 ompi/mpi/java/c/mpi_Intracomm.c         jintArray degrees, jintArray destins, jintArray weights,
degrees           154 ompi/mpi/java/c/mpi_Intracomm.c     ompi_java_getIntArray(env, degrees, &jDegrees, &cDegrees);
degrees           166 ompi/mpi/java/c/mpi_Intracomm.c     ompi_java_forgetIntArray(env, degrees, jDegrees, cDegrees);
degrees           275 ompi/mpi/java/java/Intracomm.java 			int[] sources, int[] degrees, int[] destinations,
degrees           282 ompi/mpi/java/java/Intracomm.java 				handle, sources, degrees, destinations,
degrees           301 ompi/mpi/java/java/Intracomm.java 			int[] sources, int[] degrees, int[] destinations,
degrees           308 ompi/mpi/java/java/Intracomm.java 				handle, sources, degrees, destinations,
degrees           313 ompi/mpi/java/java/Intracomm.java 			long comm, int[] sources, int[] degrees, int[] destinations,
degrees           270 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h     NETLOC_int *degrees;