1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
/*
* Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana
* University Research and Technology
* Corporation. All rights reserved.
* Copyright (c) 2004-2006 The University of Tennessee and The University
* of Tennessee Research Foundation. All rights
* reserved.
* Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,
* University of Stuttgart. All rights reserved.
* Copyright (c) 2004-2005 The Regents of the University of California.
* All rights reserved.
* Copyright (c) 2007 Cisco Systems, Inc. All rights reserved.
*
* $COPYRIGHT$
*
* Additional copyrights may follow
*
* $HEADER$
*/
#include "opal_config.h"
#include "opal/constants.h"
#include "opal/mca/carto/carto.h"
#include "opal/mca/carto/base/base.h"
int opal_carto_base_get_host_graph(opal_carto_graph_t **graph, const char *graph_type)
{
if (!opal_carto_base_selected) {
return OPAL_ERR_NOT_FOUND;
}
return opal_carto_base_module->get_host_graph(graph, graph_type);
}
void opal_carto_base_free_graph(opal_carto_graph_t *graph)
{
if (!opal_carto_base_selected) {
return ;
}
opal_carto_base_module->free_graph(graph);
}
int opal_carto_base_get_nodes_distance(opal_carto_graph_t *graph, opal_carto_base_node_t *start, const char *node_type, opal_value_array_t *distance_)
{
if (!opal_carto_base_selected) {
return OPAL_ERR_NOT_FOUND;
}
return opal_carto_base_module->get_nodes_distance(graph, start, node_type, distance_);
}
uint32_t opal_carto_base_spf(opal_carto_graph_t *graph,opal_carto_base_node_t *start, opal_carto_base_node_t *end)
{
if (!opal_carto_base_selected) {
return OPAL_ERR_NOT_FOUND;
}
return opal_carto_base_module->spf(graph, start, end);
}
opal_carto_base_node_t *opal_carto_base_find_node(opal_carto_graph_t *graph, const char *node_name)
{
if (!opal_carto_base_selected) {
return NULL;
}
return opal_carto_base_module->find_node(graph, node_name);
}
|
