graph 596 ompi/debuggers/ompi_mpihandles_dll.c topo + i_info->mca_topo_base_module_t.offset.mtc.graph.nnodes, graph 605 ompi/debuggers/ompi_mpihandles_dll.c topo + i_info->mca_topo_base_module_t.offset.mtc.graph.index, graph 622 ompi/debuggers/ompi_mpihandles_dll.c topo + i_info->mca_topo_base_module_t.offset.mtc.graph.edges, graph 126 ompi/mca/coll/basic/coll_basic_neighbor_allgather.c const mca_topo_base_comm_graph_2_2_0_t *graph = comm->c_topo->mtc.graph; graph 137 ompi/mca/coll/basic/coll_basic_neighbor_allgather.c edges = graph->edges; graph 139 ompi/mca/coll/basic/coll_basic_neighbor_allgather.c edges += graph->index[rank - 1]; graph 114 ompi/mca/coll/basic/coll_basic_neighbor_allgatherv.c const mca_topo_base_comm_graph_2_2_0_t *graph = comm->c_topo->mtc.graph; graph 124 ompi/mca/coll/basic/coll_basic_neighbor_allgatherv.c edges = graph->edges; graph 126 ompi/mca/coll/basic/coll_basic_neighbor_allgatherv.c edges += graph->index[rank - 1]; graph 144 ompi/mca/coll/basic/coll_basic_neighbor_alltoall.c const mca_topo_base_comm_graph_2_2_0_t *graph = comm->c_topo->mtc.graph; graph 154 ompi/mca/coll/basic/coll_basic_neighbor_alltoall.c edges = graph->edges; graph 156 ompi/mca/coll/basic/coll_basic_neighbor_alltoall.c edges += graph->index[rank - 1]; graph 131 ompi/mca/coll/basic/coll_basic_neighbor_alltoallv.c const mca_topo_base_comm_graph_2_2_0_t *graph = comm->c_topo->mtc.graph; graph 141 ompi/mca/coll/basic/coll_basic_neighbor_alltoallv.c edges = graph->edges; graph 143 ompi/mca/coll/basic/coll_basic_neighbor_alltoallv.c edges += graph->index[rank - 1]; graph 128 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c const mca_topo_base_comm_graph_2_2_0_t *graph = comm->c_topo->mtc.graph; graph 140 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c edges = graph->edges; graph 142 ompi/mca/coll/basic/coll_basic_neighbor_alltoallw.c edges += graph->index[rank - 1]; graph 279 ompi/mca/topo/base/topo_base_comm_select.c if (NULL == module->topo.graph.graph_create) { graph 280 ompi/mca/topo/base/topo_base_comm_select.c module->topo.graph.graph_create = mca_topo_base_graph_create; graph 282 ompi/mca/topo/base/topo_base_comm_select.c if (NULL == module->topo.graph.graph_get) { graph 283 ompi/mca/topo/base/topo_base_comm_select.c module->topo.graph.graph_get = mca_topo_base_graph_get; graph 285 ompi/mca/topo/base/topo_base_comm_select.c if (NULL == module->topo.graph.graph_map) { graph 286 ompi/mca/topo/base/topo_base_comm_select.c module->topo.graph.graph_map = mca_topo_base_graph_map; graph 288 ompi/mca/topo/base/topo_base_comm_select.c if (NULL == module->topo.graph.graphdims_get) { graph 289 ompi/mca/topo/base/topo_base_comm_select.c module->topo.graph.graphdims_get = mca_topo_base_graphdims_get; graph 291 ompi/mca/topo/base/topo_base_comm_select.c if (NULL == module->topo.graph.graph_neighbors) { graph 292 ompi/mca/topo/base/topo_base_comm_select.c module->topo.graph.graph_neighbors = mca_topo_base_graph_neighbors; graph 294 ompi/mca/topo/base/topo_base_comm_select.c if (NULL == module->topo.graph.graph_neighbors_count) { graph 295 ompi/mca/topo/base/topo_base_comm_select.c module->topo.graph.graph_neighbors_count = mca_topo_base_graph_neighbors_count; graph 54 ompi/mca/topo/base/topo_base_graph_create.c mca_topo_base_comm_graph_2_2_0_t* graph; graph 72 ompi/mca/topo/base/topo_base_graph_create.c graph = OBJ_NEW(mca_topo_base_comm_graph_2_2_0_t); graph 73 ompi/mca/topo/base/topo_base_graph_create.c if( NULL == graph ) { graph 76 ompi/mca/topo/base/topo_base_graph_create.c graph->nnodes = nnodes; graph 87 ompi/mca/topo/base/topo_base_graph_create.c graph->index = (int*)malloc(sizeof(int) * nnodes); graph 88 ompi/mca/topo/base/topo_base_graph_create.c if (NULL == graph->index) { graph 89 ompi/mca/topo/base/topo_base_graph_create.c OBJ_RELEASE(graph); graph 92 ompi/mca/topo/base/topo_base_graph_create.c memcpy(graph->index, index, nnodes * sizeof(int)); graph 95 ompi/mca/topo/base/topo_base_graph_create.c graph->edges = (int*)malloc(sizeof(int) * index[nnodes-1]); graph 96 ompi/mca/topo/base/topo_base_graph_create.c if (NULL == graph->edges) { graph 97 ompi/mca/topo/base/topo_base_graph_create.c OBJ_RELEASE(graph); graph 100 ompi/mca/topo/base/topo_base_graph_create.c memcpy(graph->edges, edges, index[nnodes-1] * sizeof(int)); graph 104 ompi/mca/topo/base/topo_base_graph_create.c OBJ_RELEASE(graph); graph 122 ompi/mca/topo/base/topo_base_graph_create.c OBJ_RELEASE(graph); graph 130 ompi/mca/topo/base/topo_base_graph_create.c OBJ_RELEASE(graph); graph 140 ompi/mca/topo/base/topo_base_graph_create.c new_comm->c_topo->mtc.graph = graph; graph 153 ompi/mca/topo/base/topo_base_graph_create.c static void mca_topo_base_comm_graph_2_2_0_construct(mca_topo_base_comm_graph_2_2_0_t * graph) { graph 154 ompi/mca/topo/base/topo_base_graph_create.c graph->nnodes = 0; graph 155 ompi/mca/topo/base/topo_base_graph_create.c graph->index = NULL; graph 156 ompi/mca/topo/base/topo_base_graph_create.c graph->edges = NULL; graph 159 ompi/mca/topo/base/topo_base_graph_create.c static void mca_topo_base_comm_graph_2_2_0_destruct(mca_topo_base_comm_graph_2_2_0_t * graph) { graph 160 ompi/mca/topo/base/topo_base_graph_create.c if (NULL != graph->index) { graph 161 ompi/mca/topo/base/topo_base_graph_create.c free(graph->index); graph 163 ompi/mca/topo/base/topo_base_graph_create.c if (NULL != graph->edges) { graph 164 ompi/mca/topo/base/topo_base_graph_create.c free(graph->edges); graph 49 ompi/mca/topo/base/topo_base_graph_get.c p = comm->c_topo->mtc.graph->index; graph 54 ompi/mca/topo/base/topo_base_graph_get.c p = comm->c_topo->mtc.graph->edges; graph 57 ompi/mca/topo/base/topo_base_graph_get.c (i < comm->c_topo->mtc.graph->index[nprocs-1]) && (i < maxedges); graph 44 ompi/mca/topo/base/topo_base_graph_neighbors.c mca_topo_base_comm_graph_2_2_0_t* graph = comm->c_topo->mtc.graph; graph 50 ompi/mca/topo/base/topo_base_graph_neighbors.c nnbrs = graph->index[rank]; graph 51 ompi/mca/topo/base/topo_base_graph_neighbors.c p = graph->edges; graph 54 ompi/mca/topo/base/topo_base_graph_neighbors.c i = graph->index[rank - 1]; graph 41 ompi/mca/topo/base/topo_base_graph_neighbors_count.c mca_topo_base_comm_graph_2_2_0_t* graph = comm->c_topo->mtc.graph; graph 42 ompi/mca/topo/base/topo_base_graph_neighbors_count.c *nneighbors = graph->index[rank]; graph 44 ompi/mca/topo/base/topo_base_graph_neighbors_count.c *nneighbors -= graph->index[rank - 1]; graph 43 ompi/mca/topo/base/topo_base_graphdims_get.c mca_topo_base_comm_graph_2_2_0_t* graph = comm->c_topo->mtc.graph; graph 45 ompi/mca/topo/base/topo_base_graphdims_get.c *nedges = graph->index[*nodes -1]; graph 82 ompi/mca/topo/example/topo_example_component.c example->super.topo.graph.graph_map = mca_topo_example_graph_map; graph 123 ompi/mca/topo/topo.h mca_topo_base_comm_graph_2_2_0_t* graph; graph 333 ompi/mca/topo/topo.h mca_topo_base_graph_module_2_2_0_t graph; graph 1650 ompi/mca/topo/treematch/treematch/tm_tree.c adjacency_t *graph; graph 1658 ompi/mca/topo/treematch/treematch/tm_tree.c graph = (adjacency_t*)MALLOC(sizeof(adjacency_t)*((mat_order*mat_order-mat_order)/2)); graph 1662 ompi/mca/topo/treematch/treematch/tm_tree.c graph[e].i = i; graph 1663 ompi/mca/topo/treematch/treematch/tm_tree.c graph[e].j = j; graph 1664 ompi/mca/topo/treematch/treematch/tm_tree.c graph[e].val = mat[i][j]; graph 1675 ompi/mca/topo/treematch/treematch/tm_tree.c qsort(graph, e, sizeof(adjacency_t), adjacency_dsc); graph 1686 ompi/mca/topo/treematch/treematch/tm_tree.c if(try_add_edge(tab_node, &new_tab_node[l], arity, graph[i].i, graph[i].j, &nb_groups)) graph 1705 ompi/mca/topo/treematch/treematch/tm_tree.c FREE(graph); graph 104 ompi/mpi/c/graph_create.c err = topo->topo.graph.graph_create(topo, old_comm, graph 75 ompi/mpi/c/graph_get.c err = comm->c_topo->topo.graph.graph_get(comm, maxindx, maxedges, indx, edges); graph 79 ompi/mpi/c/graph_map.c err = comm->c_topo->topo.graph.graph_map(comm, nnodes, indx, edges, newrank); graph 80 ompi/mpi/c/graph_neighbors.c err = comm->c_topo->topo.graph.graph_neighbors(comm, rank, maxneighbors, neighbors); graph 77 ompi/mpi/c/graph_neighbors_count.c err = comm->c_topo->topo.graph.graph_neighbors_count(comm, rank, nneighbors); graph 73 ompi/mpi/c/graphdims_get.c err = comm->c_topo->topo.graph.graphdims_get(comm, nnodes, nedges); graph 126 ompi/mpi/java/c/mpi_Intracomm.c MPI_Comm graph; graph 135 ompi/mpi/java/c/mpi_Intracomm.c nnodes, cIndex, cEdges, reorder, &graph); graph 140 ompi/mpi/java/c/mpi_Intracomm.c return (jlong)graph; graph 148 ompi/mpi/java/c/mpi_Intracomm.c MPI_Comm graph; graph 162 ompi/mpi/java/c/mpi_Intracomm.c (MPI_Info)info, reorder, &graph); graph 172 ompi/mpi/java/c/mpi_Intracomm.c return (jlong)graph; graph 180 ompi/mpi/java/c/mpi_Intracomm.c MPI_Comm graph; graph 203 ompi/mpi/java/c/mpi_Intracomm.c cDesWeights, (MPI_Info)info, reorder, &graph); graph 215 ompi/mpi/java/c/mpi_Intracomm.c return (jlong)graph; graph 59 opal/class/opal_graph.c static void opal_graph_construct(opal_graph_t *graph); graph 60 opal/class/opal_graph.c static void opal_graph_destruct(opal_graph_t *graph); graph 147 opal/class/opal_graph.c static void opal_graph_construct(opal_graph_t *graph) graph 149 opal/class/opal_graph.c graph->adjacency_list = OBJ_NEW(opal_list_t); graph 150 opal/class/opal_graph.c graph->number_of_vertices = 0; graph 151 opal/class/opal_graph.c graph->number_of_edges = 0; graph 154 opal/class/opal_graph.c static void opal_graph_destruct(opal_graph_t *graph) graph 156 opal/class/opal_graph.c OPAL_LIST_RELEASE(graph->adjacency_list); graph 157 opal/class/opal_graph.c graph->number_of_vertices = 0; graph 158 opal/class/opal_graph.c graph->number_of_edges = 0; graph 186 opal/class/opal_graph.c static void delete_all_edges_conceded_to_vertex(opal_graph_t *graph, opal_graph_vertex_t *vertex) graph 194 opal/class/opal_graph.c OPAL_LIST_FOREACH(aj_list, graph->adjacency_list, opal_adjacency_list_t) { graph 219 opal/class/opal_graph.c void opal_graph_add_vertex(opal_graph_t *graph, opal_graph_vertex_t *vertex) graph 226 opal/class/opal_graph.c OPAL_LIST_FOREACH(aj_list, graph->adjacency_list, opal_adjacency_list_t) { graph 238 opal/class/opal_graph.c opal_list_append(graph->adjacency_list, (opal_list_item_t*)aj_list); graph 240 opal/class/opal_graph.c vertex->in_graph = graph; graph 242 opal/class/opal_graph.c graph->number_of_vertices++; graph 257 opal/class/opal_graph.c int opal_graph_add_edge(opal_graph_t *graph, opal_graph_edge_t *edge) graph 266 opal/class/opal_graph.c OPAL_LIST_FOREACH(aj_list, graph->adjacency_list, opal_adjacency_list_t) { graph 286 opal/class/opal_graph.c graph->number_of_edges++; graph 302 opal/class/opal_graph.c void opal_graph_remove_edge (opal_graph_t *graph, opal_graph_edge_t *edge) graph 307 opal/class/opal_graph.c graph->number_of_edges--; graph 320 opal/class/opal_graph.c void opal_graph_remove_vertex(opal_graph_t *graph, opal_graph_vertex_t *vertex) graph 331 opal/class/opal_graph.c opal_list_remove_item(graph->adjacency_list, (opal_list_item_t*)adj_list); graph 336 opal/class/opal_graph.c delete_all_edges_conceded_to_vertex(graph, vertex); graph 340 opal/class/opal_graph.c graph->number_of_vertices--; graph 354 opal/class/opal_graph.c uint32_t opal_graph_adjacent(opal_graph_t *graph, opal_graph_vertex_t *vertex1, opal_graph_vertex_t *vertex2) graph 362 opal/class/opal_graph.c if (graph != vertex1->in_graph) { graph 363 opal/class/opal_graph.c OPAL_OUTPUT((0,"opal_graph_adjacent 1 Vertex1 %p not in the graph %p\n",(void *)vertex1,(void *)graph)); graph 369 opal/class/opal_graph.c if (graph != vertex2->in_graph) { graph 370 opal/class/opal_graph.c OPAL_OUTPUT((0,"opal_graph_adjacent 2 Vertex2 %p not in the graph %p\n",(void *)vertex2,(void *)graph)); graph 403 opal/class/opal_graph.c int opal_graph_get_order(opal_graph_t *graph) graph 405 opal/class/opal_graph.c return graph->number_of_vertices; graph 416 opal/class/opal_graph.c int opal_graph_get_size(opal_graph_t *graph) graph 418 opal/class/opal_graph.c return graph->number_of_edges; graph 430 opal/class/opal_graph.c opal_graph_vertex_t *opal_graph_find_vertex(opal_graph_t *graph, void *vertex_data) graph 437 opal/class/opal_graph.c OPAL_LIST_FOREACH(aj_list, graph->adjacency_list, opal_adjacency_list_t) { graph 463 opal/class/opal_graph.c int opal_graph_get_graph_vertices(opal_graph_t *graph, opal_pointer_array_t *vertices_list) graph 470 opal/class/opal_graph.c if (0 == graph->number_of_vertices) { graph 474 opal/class/opal_graph.c OPAL_LIST_FOREACH(aj_list, graph->adjacency_list, opal_adjacency_list_t) { graph 479 opal/class/opal_graph.c return graph->number_of_vertices; graph 495 opal/class/opal_graph.c int opal_graph_get_adjacent_vertices(opal_graph_t *graph, opal_graph_vertex_t *vertex, opal_value_array_t *adjacents) graph 505 opal/class/opal_graph.c if (graph != vertex->in_graph) { graph 506 opal/class/opal_graph.c OPAL_OUTPUT((0,"Vertex %p not in the graph %p\n", (void *)vertex, (void *)graph)); graph 536 opal/class/opal_graph.c uint32_t opal_graph_spf(opal_graph_t *graph, opal_graph_vertex_t *vertex1, opal_graph_vertex_t *vertex2) graph 546 opal/class/opal_graph.c if (graph != vertex1->in_graph) { graph 547 opal/class/opal_graph.c OPAL_OUTPUT((0,"opal_graph_spf 1 Vertex1 %p not in the graph %p\n",(void *)vertex1,(void *)graph)); graph 553 opal/class/opal_graph.c if (graph != vertex2->in_graph) { graph 554 opal/class/opal_graph.c OPAL_OUTPUT((0,"opal_graph_spf 2 Vertex2 %p not in the graph %p\n",(void *)vertex2,(void *)graph)); graph 563 opal/class/opal_graph.c items_in_distance_array = opal_graph_dijkstra(graph, vertex1, distance_array); graph 626 opal/class/opal_graph.c uint32_t opal_graph_dijkstra(opal_graph_t *graph, opal_graph_vertex_t *vertex, opal_value_array_t *distance_array) graph 639 opal/class/opal_graph.c if (graph != vertex->in_graph) { graph 640 opal/class/opal_graph.c OPAL_OUTPUT((0,"opal:graph:dijkstra: vertex %p not in the graph %p\n",(void *)vertex,(void *)graph)); graph 644 opal/class/opal_graph.c graph_order = opal_graph_get_order(graph); graph 650 opal/class/opal_graph.c OPAL_LIST_FOREACH(adj_list, graph->adjacency_list, opal_adjacency_list_t) { graph 672 opal/class/opal_graph.c weight = opal_graph_adjacent(graph, current_vertex->vertex, q_start[i].vertex); graph 764 opal/class/opal_graph.c void opal_graph_print(opal_graph_t *graph) graph 775 opal/class/opal_graph.c OPAL_LIST_FOREACH(aj_list, graph->adjacency_list, opal_adjacency_list_t) { graph 198 opal/class/opal_graph.h OPAL_DECLSPEC void opal_graph_add_vertex(opal_graph_t *graph, opal_graph_vertex_t *vertex); graph 208 opal/class/opal_graph.h OPAL_DECLSPEC void opal_graph_remove_vertex(opal_graph_t *graph, opal_graph_vertex_t *vertex); graph 221 opal/class/opal_graph.h OPAL_DECLSPEC int opal_graph_add_edge(opal_graph_t *graph, opal_graph_edge_t *edge); graph 234 opal/class/opal_graph.h OPAL_DECLSPEC void opal_graph_remove_edge (opal_graph_t *graph, opal_graph_edge_t *edge); graph 247 opal/class/opal_graph.h OPAL_DECLSPEC uint32_t opal_graph_adjacent(opal_graph_t *graph, opal_graph_vertex_t *vertex1, opal_graph_vertex_t *vertex2); graph 257 opal/class/opal_graph.h OPAL_DECLSPEC int opal_graph_get_order(opal_graph_t *graph); graph 267 opal/class/opal_graph.h OPAL_DECLSPEC int opal_graph_get_size(opal_graph_t *graph); graph 278 opal/class/opal_graph.h OPAL_DECLSPEC opal_graph_vertex_t *opal_graph_find_vertex(opal_graph_t *graph, void *vertex_data); graph 293 opal/class/opal_graph.h OPAL_DECLSPEC int opal_graph_get_graph_vertices(opal_graph_t *graph, opal_pointer_array_t *vertices_list); graph 308 opal/class/opal_graph.h OPAL_DECLSPEC int opal_graph_get_adjacent_vertices(opal_graph_t *graph, opal_graph_vertex_t *vertex, opal_value_array_t *adjacent); graph 329 opal/class/opal_graph.h OPAL_DECLSPEC uint32_t opal_graph_spf(opal_graph_t *graph, opal_graph_vertex_t *vertex1, opal_graph_vertex_t *vertex2); graph 343 opal/class/opal_graph.h OPAL_DECLSPEC uint32_t opal_graph_dijkstra(opal_graph_t *graph, opal_graph_vertex_t *vertex, opal_value_array_t *distance_array); graph 349 opal/class/opal_graph.h OPAL_DECLSPEC void opal_graph_print(opal_graph_t *graph); graph 38 test/carto/carto_test.c opal_carto_graph_t *graph; graph 55 test/carto/carto_test.c opal_carto_base_get_host_graph(&graph,NULL); graph 56 test/carto/carto_test.c opal_graph_print(graph); graph 57 test/carto/carto_test.c slot0 = opal_carto_base_find_node(graph, "slot0"); graph 60 test/carto/carto_test.c opal_carto_base_free_graph(graph); graph 63 test/carto/carto_test.c end_node = opal_carto_base_find_node(graph, "slot3"); graph 66 test/carto/carto_test.c opal_carto_base_free_graph(graph); graph 69 test/carto/carto_test.c distance = opal_carto_base_spf(graph, slot0, end_node); graph 74 test/carto/carto_test.c distance_array_size = opal_carto_base_get_nodes_distance(graph, slot0, NULL, distance_array); graph 80 test/carto/carto_test.c opal_carto_base_free_graph(graph); graph 86 test/carto/carto_test.c opal_carto_base_get_host_graph(&graph,"Infiniband"); graph 87 test/carto/carto_test.c opal_graph_print(graph); graph 88 test/carto/carto_test.c slot0 = opal_carto_base_find_node(graph, "slot0"); graph 91 test/carto/carto_test.c opal_carto_base_free_graph(graph); graph 94 test/carto/carto_test.c end_node = opal_carto_base_find_node(graph, "mthca1"); graph 97 test/carto/carto_test.c opal_carto_base_free_graph(graph); graph 100 test/carto/carto_test.c distance = opal_carto_base_spf(graph, slot0, end_node); graph 105 test/carto/carto_test.c distance_array_size = opal_carto_base_get_nodes_distance(graph, slot0, "Infiniband", distance_array); graph 111 test/carto/carto_test.c opal_carto_base_free_graph(graph); graph 117 test/carto/carto_test.c opal_carto_base_get_host_graph(&graph,"Ethernet"); graph 118 test/carto/carto_test.c opal_graph_print(graph); graph 119 test/carto/carto_test.c slot0 = opal_carto_base_find_node(graph, "slot0"); graph 122 test/carto/carto_test.c opal_carto_base_free_graph(graph); graph 125 test/carto/carto_test.c end_node = opal_carto_base_find_node(graph, "eth1"); graph 128 test/carto/carto_test.c opal_carto_base_free_graph(graph); graph 131 test/carto/carto_test.c distance = opal_carto_base_spf(graph, slot0, end_node); graph 136 test/carto/carto_test.c distance_array_size = opal_carto_base_get_nodes_distance(graph, slot0, "Ethernet", distance_array); graph 142 test/carto/carto_test.c opal_carto_base_free_graph(graph); graph 148 test/carto/carto_test.c opal_carto_base_get_host_graph(&graph,"Memory"); graph 149 test/carto/carto_test.c opal_graph_print(graph); graph 150 test/carto/carto_test.c slot0 = opal_carto_base_find_node(graph, "slot0"); graph 153 test/carto/carto_test.c opal_carto_base_free_graph(graph); graph 156 test/carto/carto_test.c end_node = opal_carto_base_find_node(graph, "mem3"); graph 159 test/carto/carto_test.c opal_carto_base_free_graph(graph); graph 162 test/carto/carto_test.c distance = opal_carto_base_spf(graph, slot0, end_node); graph 167 test/carto/carto_test.c distance_array_size = opal_carto_base_get_nodes_distance(graph, slot0, "Memory", distance_array); graph 173 test/carto/carto_test.c opal_carto_base_free_graph(graph);