edges 402 ompi/debuggers/ompi_common_dll.c ompi_field_offset(i_info->mca_topo_base_module_t.offset.mtc_graph.edges, edges 404 ompi/debuggers/ompi_common_dll.c edges); edges 407 ompi/debuggers/ompi_common_dll.c i_info->mca_topo_base_module_t.offset.mtc_graph.edges += offset; edges 225 ompi/debuggers/ompi_common_dll_defs.h int edges; edges 591 ompi/debuggers/ompi_mpihandles_dll.c mqs_taddr_t index, edges; edges 621 ompi/debuggers/ompi_mpihandles_dll.c edges = ompi_fetch_pointer(process, edges 622 ompi/debuggers/ompi_mpihandles_dll.c topo + i_info->mca_topo_base_module_t.offset.mtc.graph.edges, edges 628 ompi/debuggers/ompi_mpihandles_dll.c ompi_fetch_int(process, edges + (sizeof(int) * i), p_info); edges 128 ompi/mca/coll/basic/coll_basic_neighbor_allgather.c const int *edges; edges 137 ompi/mca/coll/basic/coll_basic_neighbor_allgather.c edges = graph->edges; edges 139 ompi/mca/coll/basic/coll_basic_neighbor_allgather.c edges += graph->index[rank - 1]; edges 147 ompi/mca/coll/basic/coll_basic_neighbor_allgather.c rc = MCA_PML_CALL(irecv(rbuf, rcount, rdtype, edges[neighbor], MCA_COLL_BASE_TAG_ALLGATHER, edges 154 ompi/mca/coll/basic/coll_basic_neighbor_allgather.c rc = MCA_PML_CALL(isend((void *) sbuf, scount, sdtype, edges[neighbor], edges 116 ompi/mca/coll/basic/coll_basic_neighbor_allgatherv.c const int *edges; edges 124 ompi/mca/coll/basic/coll_basic_neighbor_allgatherv.c edges = graph->edges; edges 126 ompi/mca/coll/basic/coll_basic_neighbor_allgatherv.c edges += graph->index[rank - 1]; edges 135 ompi/mca/coll/basic/coll_basic_neighbor_allgatherv.c rdtype, edges[neighbor], MCA_COLL_BASE_TAG_ALLGATHER, comm, preqs++)); edges 140 ompi/mca/coll/basic/coll_basic_neighbor_allgatherv.c rc = MCA_PML_CALL(isend((void *) sbuf, scount, sdtype, edges[neighbor], edges 149 ompi/mca/coll/basic/coll_basic_neighbor_alltoall.c const int *edges; edges 154 ompi/mca/coll/basic/coll_basic_neighbor_alltoall.c edges = graph->edges; edges 156 ompi/mca/coll/basic/coll_basic_neighbor_alltoall.c edges += graph->index[rank - 1]; edges 166 ompi/mca/coll/basic/coll_basic_neighbor_alltoall.c rc = MCA_PML_CALL(irecv(rbuf, rcount, rdtype, edges[neighbor], MCA_COLL_BASE_TAG_ALLTOALL, edges 179 ompi/mca/coll/basic/coll_basic_neighbor_alltoall.c rc = MCA_PML_CALL(isend((void *) sbuf, scount, sdtype, edges[neighbor], edges 136 ompi/mca/coll/basic/coll_basic_neighbor_alltoallv.c const int *edges; edges 141 ompi/mca/coll/basic/coll_basic_neighbor_alltoallv.c edges = graph->edges; edges 143 ompi/mca/coll/basic/coll_basic_neighbor_alltoallv.c edges += graph->index[rank - 1]; edges 154 ompi/mca/coll/basic/coll_basic_neighbor_alltoallv.c edges[neighbor], MCA_COLL_BASE_TAG_ALLTOALL, comm, preqs++)); edges 166 ompi/mca/coll/basic/coll_basic_neighbor_alltoallv.c edges[neighbor], MCA_COLL_BASE_TAG_ALLTOALL, MCA_PML_BASE_SEND_STANDARD, edges 132 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c const int *edges; edges 140 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c edges = graph->edges; edges 142 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c edges += graph->index[rank - 1]; edges 148 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c edges[neighbor], MCA_COLL_BASE_TAG_ALLTOALL, comm, preqs++)); edges 160 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c edges[neighbor], MCA_COLL_BASE_TAG_ALLTOALL, MCA_PML_BASE_SEND_STANDARD, edges 131 ompi/mca/topo/base/base.h const int *edges, edges 140 ompi/mca/topo/base/base.h int *edges); edges 145 ompi/mca/topo/base/base.h const int *index, const int *edges, int *newrank); edges 47 ompi/mca/topo/base/topo_base_graph_create.c const int *edges, edges 95 ompi/mca/topo/base/topo_base_graph_create.c graph->edges = (int*)malloc(sizeof(int) * index[nnodes-1]); edges 96 ompi/mca/topo/base/topo_base_graph_create.c if (NULL == graph->edges) { edges 100 ompi/mca/topo/base/topo_base_graph_create.c memcpy(graph->edges, edges, index[nnodes-1] * sizeof(int)); edges 156 ompi/mca/topo/base/topo_base_graph_create.c graph->edges = NULL; edges 163 ompi/mca/topo/base/topo_base_graph_create.c if (NULL != graph->edges) { edges 164 ompi/mca/topo/base/topo_base_graph_create.c free(graph->edges); edges 41 ompi/mca/topo/base/topo_base_graph_get.c int *edges) edges 54 ompi/mca/topo/base/topo_base_graph_get.c p = comm->c_topo->mtc.graph->edges; edges 60 ompi/mca/topo/base/topo_base_graph_get.c *edges++ = *p; edges 43 ompi/mca/topo/base/topo_base_graph_map.c const int *index, const int *edges, int *newrank) edges 51 ompi/mca/topo/base/topo_base_graph_neighbors.c p = graph->edges; edges 76 ompi/mca/topo/example/topo_example.h int *edges, edges 44 ompi/mca/topo/example/topo_example_graph_map.c int *edges, edges 76 ompi/mca/topo/topo.h int *edges; edges 211 ompi/mca/topo/topo.h const int *edges, edges 221 ompi/mca/topo/topo.h int *edges); edges 228 ompi/mca/topo/topo.h const int *edges, edges 46 ompi/mpi/c/graph_create.c const int edges[], int reorder, MPI_Comm *comm_graph) edges 68 ompi/mpi/c/graph_create.c } else if (nnodes >= 1 && ((NULL == indx) || (NULL == edges))) { edges 105 ompi/mpi/c/graph_create.c nnodes, indx, edges, edges 44 ompi/mpi/c/graph_get.c int indx[], int edges[]) edges 62 ompi/mpi/c/graph_get.c if (0 > maxindx || 0 > maxedges || NULL == indx || NULL == edges) { edges 75 ompi/mpi/c/graph_get.c err = comm->c_topo->topo.graph.graph_get(comm, maxindx, maxedges, indx, edges); edges 45 ompi/mpi/c/graph_map.c int MPI_Graph_map(MPI_Comm comm, int nnodes, const int indx[], const int edges[], edges 65 ompi/mpi/c/graph_map.c if (1 > nnodes || NULL == indx || NULL == edges || NULL == newrank) { edges 79 ompi/mpi/c/graph_map.c err = comm->c_topo->topo.graph.graph_map(comm, nnodes, indx, edges, newrank); edges 119 ompi/mpi/cxx/intracomm.h const int edges[], bool reorder) const; edges 116 ompi/mpi/cxx/intracomm_inln.h const int edges[], bool reorder) const edges 120 ompi/mpi/cxx/intracomm_inln.h const_cast<int *>(edges), (int)reorder, &newcomm); edges 152 ompi/mpi/cxx/topology.h int edges[]) const; edges 160 ompi/mpi/cxx/topology.h const int edges[]) const; edges 184 ompi/mpi/cxx/topology_inln.h int edges[]) const edges 186 ompi/mpi/cxx/topology_inln.h (void)MPI_Graph_get(mpi_comm, maxindex, maxedges, index, edges); edges 206 ompi/mpi/cxx/topology_inln.h const int edges[]) const edges 209 ompi/mpi/cxx/topology_inln.h (void)MPI_Graph_map(mpi_comm, nnodes, const_cast<int *>(index), const_cast<int *>(edges), &newrank); edges 41 ompi/mpi/fortran/mpif-h/graph_create_f.c (MPI_Fint *comm_old, MPI_Fint *nnodes, MPI_Fint *indx, MPI_Fint *edges, ompi_fortran_logical_t *reorder, MPI_Fint *comm_graph, MPI_Fint *ierr), edges 42 ompi/mpi/fortran/mpif-h/graph_create_f.c (comm_old, nnodes, indx, edges, reorder, comm_graph, ierr) ) edges 61 ompi/mpi/fortran/mpif-h/graph_create_f.c (MPI_Fint *comm_old, MPI_Fint *nnodes, MPI_Fint *indx, MPI_Fint *edges, ompi_fortran_logical_t *reorder, MPI_Fint *comm_graph, MPI_Fint *ierr), edges 62 ompi/mpi/fortran/mpif-h/graph_create_f.c (comm_old, nnodes, indx, edges, reorder, comm_graph, ierr) ) edges 70 ompi/mpi/fortran/mpif-h/graph_create_f.c MPI_Fint *indx, MPI_Fint *edges, edges 77 ompi/mpi/fortran/mpif-h/graph_create_f.c OMPI_ARRAY_NAME_DECL(edges); edges 84 ompi/mpi/fortran/mpif-h/graph_create_f.c OMPI_ARRAY_FINT_2_INT(edges, indx[*nnodes - 1]); edges 89 ompi/mpi/fortran/mpif-h/graph_create_f.c OMPI_ARRAY_NAME_CONVERT(edges), edges 99 ompi/mpi/fortran/mpif-h/graph_create_f.c OMPI_ARRAY_FINT_2_INT_CLEANUP(edges); edges 41 ompi/mpi/fortran/mpif-h/graph_get_f.c (MPI_Fint *comm, MPI_Fint *maxindex, MPI_Fint *maxedges, MPI_Fint *indx, MPI_Fint *edges, MPI_Fint *ierr), edges 42 ompi/mpi/fortran/mpif-h/graph_get_f.c (comm, maxindex, maxedges, indx, edges, ierr) ) edges 61 ompi/mpi/fortran/mpif-h/graph_get_f.c (MPI_Fint *comm, MPI_Fint *maxindex, MPI_Fint *maxedges, MPI_Fint *indx, MPI_Fint *edges, MPI_Fint *ierr), edges 62 ompi/mpi/fortran/mpif-h/graph_get_f.c (comm, maxindex, maxedges, indx, edges, ierr) ) edges 71 ompi/mpi/fortran/mpif-h/graph_get_f.c MPI_Fint *edges, MPI_Fint *ierr) edges 76 ompi/mpi/fortran/mpif-h/graph_get_f.c OMPI_ARRAY_NAME_DECL(edges); edges 80 ompi/mpi/fortran/mpif-h/graph_get_f.c OMPI_ARRAY_FINT_2_INT_ALLOC(edges, *maxedges); edges 86 ompi/mpi/fortran/mpif-h/graph_get_f.c OMPI_ARRAY_NAME_CONVERT(edges)); edges 91 ompi/mpi/fortran/mpif-h/graph_get_f.c OMPI_ARRAY_INT_2_FINT(edges, *maxedges); edges 94 ompi/mpi/fortran/mpif-h/graph_get_f.c OMPI_ARRAY_FINT_2_INT_CLEANUP(edges); edges 41 ompi/mpi/fortran/mpif-h/graph_map_f.c (MPI_Fint *comm, MPI_Fint *nnodes, MPI_Fint *indx, MPI_Fint *edges, MPI_Fint *newrank, MPI_Fint *ierr), edges 42 ompi/mpi/fortran/mpif-h/graph_map_f.c (comm, nnodes, indx, edges, newrank, ierr) ) edges 61 ompi/mpi/fortran/mpif-h/graph_map_f.c (MPI_Fint *comm, MPI_Fint *nnodes, MPI_Fint *indx, MPI_Fint *edges, MPI_Fint *newrank, MPI_Fint *ierr), edges 62 ompi/mpi/fortran/mpif-h/graph_map_f.c (comm, nnodes, indx, edges, newrank, ierr) ) edges 70 ompi/mpi/fortran/mpif-h/graph_map_f.c MPI_Fint *edges, MPI_Fint *nrank, MPI_Fint *ierr) edges 75 ompi/mpi/fortran/mpif-h/graph_map_f.c OMPI_ARRAY_NAME_DECL(edges); edges 81 ompi/mpi/fortran/mpif-h/graph_map_f.c OMPI_ARRAY_FINT_2_INT(edges, indx[*nnodes - 1]); edges 86 ompi/mpi/fortran/mpif-h/graph_map_f.c OMPI_ARRAY_NAME_CONVERT(edges), edges 93 ompi/mpi/fortran/mpif-h/graph_map_f.c OMPI_ARRAY_FINT_2_INT_CLEANUP(edges); edges 243 ompi/mpi/fortran/mpif-h/prototypes_mpi.h PN2(void, MPI_Graph_create, mpi_graph_create, MPI_GRAPH_CREATE, (MPI_Fint *comm_old, MPI_Fint *nnodes, MPI_Fint *index, MPI_Fint *edges, ompi_fortran_logical_t *reorder, MPI_Fint *comm_graph, MPI_Fint *ierr)); edges 244 ompi/mpi/fortran/mpif-h/prototypes_mpi.h PN2(void, MPI_Graph_get, mpi_graph_get, MPI_GRAPH_GET, (MPI_Fint *comm, MPI_Fint *maxindex, MPI_Fint *maxedges, MPI_Fint *index, MPI_Fint *edges, MPI_Fint *ierr)); edges 245 ompi/mpi/fortran/mpif-h/prototypes_mpi.h PN2(void, MPI_Graph_map, mpi_graph_map, MPI_GRAPH_MAP, (MPI_Fint *comm, MPI_Fint *nnodes, MPI_Fint *index, MPI_Fint *edges, MPI_Fint *newrank, MPI_Fint *ierr)); edges 1767 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h subroutine ompi_graph_get_f(comm,maxindex,maxedges,index,edges,ierror) & edges 1772 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h INTEGER, INTENT(OUT) :: index(*), edges(*) edges 1776 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h subroutine ompi_graph_map_f(comm,nnodes,index,edges,newrank,ierror) & edges 1781 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h INTEGER, INTENT(IN) :: index(*), edges(*) edges 687 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h subroutine MPI_Graph_create(comm_old, nnodes, index, edges, reorder, & edges 692 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h integer, dimension(*), intent(in) :: edges edges 703 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h subroutine MPI_Graph_get(comm, maxindex, maxedges, index, edges& edges 709 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h integer, dimension(*), intent(out) :: edges edges 718 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h subroutine MPI_Graph_map(comm, nnodes, index, edges, newrank& edges 723 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-interfaces.h integer, dimension(*), intent(in) :: edges edges 687 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h subroutine PMPI_Graph_create(comm_old, nnodes, index, edges, reorder, & edges 692 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h integer, dimension(*), intent(in) :: edges edges 703 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h subroutine PMPI_Graph_get(comm, maxindex, maxedges, index, edges& edges 709 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h integer, dimension(*), intent(out) :: edges edges 718 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h subroutine PMPI_Graph_map(comm, nnodes, index, edges, newrank& edges 723 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-interfaces.h integer, dimension(*), intent(in) :: edges edges 74 ompi/mpi/java/c/mpi_GraphComm.c edges = (*env)->NewIntArray(env, maxEdg); edges 79 ompi/mpi/java/c/mpi_GraphComm.c ompi_java_getIntArray(env, edges, &jEdges, &cEdges); edges 85 ompi/mpi/java/c/mpi_GraphComm.c ompi_java_releaseIntArray(env, edges, jEdges, cEdges); edges 88 ompi/mpi/java/c/mpi_GraphComm.c ompi_java.GraphParmsInit, index, edges); edges 154 ompi/mpi/java/c/mpi_GraphComm.c jintArray index, jintArray edges) edges 160 ompi/mpi/java/c/mpi_GraphComm.c ompi_java_getIntArray(env, edges, &jEdges, &cEdges); edges 167 ompi/mpi/java/c/mpi_GraphComm.c ompi_java_releaseIntArray(env, edges, jEdges, cEdges); edges 124 ompi/mpi/java/c/mpi_Intracomm.c jintArray index, jintArray edges, jboolean reorder) edges 132 ompi/mpi/java/c/mpi_Intracomm.c ompi_java_getIntArray(env, edges, &jEdges, &cEdges); edges 139 ompi/mpi/java/c/mpi_Intracomm.c ompi_java_forgetIntArray(env, edges, jEdges, cEdges); edges 189 ompi/mpi/java/java/GraphComm.java public int map(int[] index, int[] edges) throws MPIException edges 192 ompi/mpi/java/java/GraphComm.java return map(handle, index, edges); edges 195 ompi/mpi/java/java/GraphComm.java private native int map(long comm, int[] index, int[] edges) throws MPIException; edges 59 ompi/mpi/java/java/GraphParms.java private final int[] edges; edges 66 ompi/mpi/java/java/GraphParms.java protected GraphParms(int[] index, int[] edges) edges 69 ompi/mpi/java/java/GraphParms.java this.edges = edges; edges 99 ompi/mpi/java/java/GraphParms.java return edges.length; edges 114 ompi/mpi/java/java/GraphParms.java return edges[i]; edges 249 ompi/mpi/java/java/Intracomm.java public final GraphComm createGraph(int[] index, int[] edges, boolean reorder) edges 253 ompi/mpi/java/java/Intracomm.java return new GraphComm(createGraph(handle, index, edges, reorder)); edges 257 ompi/mpi/java/java/Intracomm.java long comm, int[] index, int[] edges, boolean reorder) edges 170 opal/class/opal_graph.c aj_list->edges = OBJ_NEW(opal_list_t); edges 176 opal/class/opal_graph.c OPAL_LIST_RELEASE(aj_list->edges); edges 198 opal/class/opal_graph.c OPAL_LIST_FOREACH_SAFE(edge, next, aj_list->edges, opal_graph_edge_t) { edges 204 opal/class/opal_graph.c opal_list_remove_item(edge->in_adj_list->edges, (opal_list_item_t*)edge); edges 284 opal/class/opal_graph.c opal_list_append(start_aj_list->edges, (opal_list_item_t*)edge); edges 305 opal/class/opal_graph.c opal_list_remove_item(edge->in_adj_list->edges, (opal_list_item_t*)edge); edges 385 opal/class/opal_graph.c OPAL_LIST_FOREACH(edge, adj_list->edges, opal_graph_edge_t) { edges 514 opal/class/opal_graph.c adjacents_number = opal_list_get_size(adj_list->edges); edges 516 opal/class/opal_graph.c OPAL_LIST_FOREACH(edge, adj_list->edges, opal_graph_edge_t) { edges 746 opal/class/opal_graph.c OPAL_LIST_FOREACH(edge, aj_list->edges, opal_graph_edge_t) { edges 788 opal/class/opal_graph.c OPAL_LIST_FOREACH(edge, aj_list->edges, opal_graph_edge_t) { edges 131 opal/class/opal_graph.h opal_list_t *edges; /* An edge list for all the adjacent and their weights */ edges 180 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h netloc_edge_t *edges; edges 391 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h utarray_len((node)->edges) edges 394 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h (*(netloc_edge_t **)utarray_eltptr((node)->edges, (i))) edges 397 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h HASH_ITER(hh, node->edges, edge, _tmp)