#include "src/instr/instr_private.h"
-#include "src/routing/AsImpl.hpp"
+#include "src/kernel/routing/AsImpl.hpp"
#include "simgrid/s4u/engine.hpp"
#include "surf/surf.h"
#include "src/surf/xml/platf_private.hpp"
return str;
}
-
static container_t lowestCommonAncestor (container_t a1, container_t a2)
{
//this is only an optimization (since most of a1 and a2 share the same parent)
xbt_dict_cursor_t cursor = nullptr;
char *edge_name;
- static_cast<simgrid::routing::AsImpl*>(as)->getGraph(graph, nodes, edges);
+ static_cast<simgrid::kernel::routing::AsImpl*>(as)->getGraph(graph, nodes, edges);
xbt_dict_foreach(edges,cursor,edge_name,edge) {
linkContainers(
PJ_container_get((const char*) edge->src->data),
speed = PJ_type_variable_new ("power", nullptr, container->type);
}
- double current_speed_state;
- xbt_dynar_get_cpy(host->speed_per_pstate, host->pstate, ¤t_speed_state);
+ double current_speed_state = host->speed_per_pstate[host->pstate];
new_pajeSetVariable (0, container, speed, current_speed_state);
}
if (TRACE_uncategorized()){
#define GRAPHICATOR_SUPPORT_FUNCTIONS
-
static void recursiveXBTGraphExtraction (xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges,
AS_t as, container_t container)
{
}
}
- static_cast<simgrid::routing::AsImpl*>(as)->getGraph(graph, nodes, edges);
+ static_cast<simgrid::kernel::routing::AsImpl*>(as)->getGraph(graph, nodes, edges);
}
-xbt_graph_t instr_routing_platform_graph (void)
+xbt_graph_t instr_routing_platform_graph ()
{
xbt_graph_t ret = xbt_graph_new_graph (0, nullptr);
xbt_dict_t nodes = xbt_dict_new_homogeneous(nullptr);