weighted          433 ompi/debuggers/ompi_common_dll.c         ompi_field_offset(i_info->mca_topo_base_module_t.offset.mtc_dist_graph.weighted,
weighted          435 ompi/debuggers/ompi_common_dll.c                           weighted);
weighted          234 ompi/debuggers/ompi_common_dll_defs.h                 int weighted;
weighted          196 ompi/mca/topo/base/base.h                                          int *inneighbors, int *outneighbors, int *weighted);
weighted          132 ompi/mca/topo/base/topo_base_dist_graph_create.c     topo->weighted = (weights != MPI_UNWEIGHTED);
weighted          331 ompi/mca/topo/base/topo_base_dist_graph_create.c     dist_graph->weighted = false;
weighted           62 ompi/mca/topo/base/topo_base_dist_graph_create_adjacent.c     topo->weighted = !((MPI_UNWEIGHTED == sourceweights) && (MPI_UNWEIGHTED == destweights));
weighted           19 ompi/mca/topo/base/topo_base_dist_graph_neighbors_count.c                                              int *outneighbors, int *weighted)
weighted           29 ompi/mca/topo/base/topo_base_dist_graph_neighbors_count.c     *weighted = (int)dist_graph->weighted;
weighted          110 ompi/mca/topo/topo.h     bool weighted;
weighted          282 ompi/mca/topo/topo.h                      int *inneighbors, int *outneighbors, int *weighted);
weighted          397 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c         if( true == topo->weighted ) {
weighted          743 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c         if( true == topo->weighted ) {
weighted           41 ompi/mpi/c/dist_graph_neighbors_count.c                                    int *outneighbors, int *weighted)
weighted           55 ompi/mpi/c/dist_graph_neighbors_count.c                    NULL == weighted) {
weighted           65 ompi/mpi/c/dist_graph_neighbors_count.c                                                                    outneighbors, weighted);
weighted           36 ompi/mpi/fortran/mpif-h/dist_graph_neighbors_count_f.c                             (MPI_Fint *comm, MPI_Fint *inneighbors, MPI_Fint *outneighbors, ompi_fortran_logical_t *weighted, MPI_Fint *ierr),
weighted           37 ompi/mpi/fortran/mpif-h/dist_graph_neighbors_count_f.c                             (comm, inneighbors, outneighbors, weighted, ierr) )
weighted           56 ompi/mpi/fortran/mpif-h/dist_graph_neighbors_count_f.c                             (MPI_Fint *comm, MPI_Fint *inneighbors, MPI_Fint *outneighbors, ompi_fortran_logical_t *weighted, MPI_Fint *ierr),
weighted           57 ompi/mpi/fortran/mpif-h/dist_graph_neighbors_count_f.c                             (comm, inneighbors, outneighbors, weighted, ierr) )
weighted           65 ompi/mpi/fortran/mpif-h/dist_graph_neighbors_count_f.c                                        MPI_Fint *outneighbors, ompi_fortran_logical_t *weighted,
weighted           71 ompi/mpi/fortran/mpif-h/dist_graph_neighbors_count_f.c     OMPI_LOGICAL_NAME_DECL(weighted);
weighted           78 ompi/mpi/fortran/mpif-h/dist_graph_neighbors_count_f.c                                                             OMPI_LOGICAL_SINGLE_NAME_CONVERT(weighted)));
weighted           79 ompi/mpi/fortran/mpif-h/dist_graph_neighbors_count_f.c     OMPI_SINGLE_INT_2_LOGICAL(weighted);
weighted          160 ompi/mpi/fortran/mpif-h/prototypes_mpi.h PN2(void, MPI_Dist_graph_neighbors_count, mpi_dist_graph_neighbors_count, MPI_DIST_GRAPH_NEIGHBORS_COUNT, (MPI_Fint *comm, MPI_Fint *inneighbors, MPI_Fint *outneighbors, ompi_fortran_logical_t *weighted, MPI_Fint *ierr));
weighted         2380 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h subroutine MPI_Dist_graph_neighbors_count(comm, indegree, outdegree, weighted, ierror)
weighted         2384 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h   logical, intent(out) :: weighted
weighted         2382 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h subroutine PMPI_Dist_graph_neighbors_count(comm, indegree, outdegree, weighted, ierror)
weighted         2386 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h   logical, intent(out) :: weighted
weighted          137 ompi/mpi/java/c/mpi_Comm.c     int rc, weighted;
weighted          151 ompi/mpi/java/c/mpi_Comm.c             rc = MPI_Dist_graph_neighbors_count(comm, in, out, &weighted);
weighted          115 ompi/mpi/java/c/mpi_GraphComm.c     int inDegree, outDegree, weighted;
weighted          118 ompi/mpi/java/c/mpi_GraphComm.c              (MPI_Comm)comm, &inDegree, &outDegree, &weighted);
weighted          149 ompi/mpi/java/c/mpi_GraphComm.c            weighted ? JNI_TRUE : JNI_FALSE);
weighted          146 ompi/mpi/java/c/mpi_Intracomm.c         jlong info, jboolean reorder, jboolean weighted)
weighted          157 ompi/mpi/java/c/mpi_Intracomm.c     if(weighted)
weighted          169 ompi/mpi/java/c/mpi_Intracomm.c     if(weighted)
weighted          178 ompi/mpi/java/c/mpi_Intracomm.c         jlong info, jboolean reorder, jboolean weighted)
weighted          190 ompi/mpi/java/c/mpi_Intracomm.c     if(weighted)
weighted          209 ompi/mpi/java/c/mpi_Intracomm.c     if(weighted)
weighted           30 ompi/mpi/java/java/DistGraphNeighbors.java 	private final boolean weighted;
weighted           34 ompi/mpi/java/java/DistGraphNeighbors.java 			int[] destinations, int[] destWeights, boolean weighted)
weighted           40 ompi/mpi/java/java/DistGraphNeighbors.java 		this.weighted      = weighted;
weighted           67 ompi/mpi/java/java/DistGraphNeighbors.java 		return weighted;
weighted          314 ompi/mpi/java/java/Intracomm.java 			int[] weights, long info, boolean reorder, boolean weighted)
weighted          376 ompi/mpi/java/java/Intracomm.java 			int[] distweights, long info, boolean reorder, boolean weighted)