#ifdef HAVE_TRACING
#include "surf/surf_private.h"
#include "surf/network_private.h"
+#include "xbt/graph.h"
XBT_LOG_NEW_DEFAULT_SUBCATEGORY (instr_routing, instr, "Tracing platform hierarchy");
return NULL;
}
-static void linkContainers (const char *a1, const char *a2)
+static void linkContainers (container_t father, container_t src, container_t dst, xbt_dict_t filter)
{
//ignore loopback
- if (strcmp (a1, "__loopback__") == 0 || strcmp (a2, "__loopback__") == 0)
+ if (strcmp (src->name, "__loopback__") == 0 || strcmp (dst->name, "__loopback__") == 0)
return;
- container_t a1_container = getContainerByName (a1);
- type_t a1_type = a1_container->type;
-
- container_t a2_container = getContainerByName (a2);
- type_t a2_type = a2_container->type;
-
- container_t container = findCommonFather (getRootContainer(), a1_container, a2_container);
- xbt_assert0 (container != NULL, "common father not found");
+ if (filter != NULL){
+ //check if we already register this pair (we only need one direction)
+ char aux1[INSTR_DEFAULT_STR_SIZE], aux2[INSTR_DEFAULT_STR_SIZE];
+ snprintf (aux1, INSTR_DEFAULT_STR_SIZE, "%s%s", src->name, dst->name);
+ snprintf (aux2, INSTR_DEFAULT_STR_SIZE, "%s%s", dst->name, src->name);
+ if (xbt_dict_get_or_null (filter, aux1)) return;
+ if (xbt_dict_get_or_null (filter, aux2)) return;
+
+ //ok, not found, register it
+ xbt_dict_set (filter, aux1, xbt_strdup ("1"), xbt_free);
+ xbt_dict_set (filter, aux2, xbt_strdup ("1"), xbt_free);
+ }
//declare type
char link_typename[INSTR_DEFAULT_STR_SIZE];
- snprintf (link_typename, INSTR_DEFAULT_STR_SIZE, "%s-%s", a1_type->name, a2_type->name);
- type_t link_type = getLinkType (link_typename, container->type, a1_type, a2_type);
+ snprintf (link_typename, INSTR_DEFAULT_STR_SIZE, "%s-%s", src->type->name, dst->type->name);
+ type_t link_type = getLinkType (link_typename, father->type, src->type, dst->type);
//register EDGE types for triva configuration
xbt_dict_set (trivaEdgeTypes, link_type->name, xbt_strdup("1"), xbt_free);
static long long counter = 0;
char key[INSTR_DEFAULT_STR_SIZE];
snprintf (key, INSTR_DEFAULT_STR_SIZE, "%lld", counter++);
- new_pajeStartLink(SIMIX_get_clock(), container, link_type, a1_container, "G", key);
- new_pajeEndLink(SIMIX_get_clock(), container, link_type, a2_container, "G", key);
+ new_pajeStartLink(SIMIX_get_clock(), father, link_type, src, "G", key);
+ new_pajeEndLink(SIMIX_get_clock(), father, link_type, dst, "G", key);
}
-static void recursiveGraphExtraction (container_t container)
+static void recursiveGraphExtraction (routing_component_t rc, container_t container, xbt_dict_t filter)
{
- if (xbt_dict_length(container->children)){
+ if (xbt_dict_length (rc->routing_sons)){
xbt_dict_cursor_t cursor = NULL;
- container_t child;
+ routing_component_t rc_son;
char *child_name;
//bottom-up recursion
- xbt_dict_foreach(container->children, cursor, child_name, child) {
- recursiveGraphExtraction (child);
+ xbt_dict_foreach(rc->routing_sons, cursor, child_name, rc_son) {
+ container_t child_container = xbt_dict_get (container->children, rc_son->name);
+ recursiveGraphExtraction (rc_son, child_container, filter);
}
+ }
- //let's get routes
- xbt_dict_cursor_t cursor1 = NULL, cursor2 = NULL;
- container_t child1, child2;
- const char *child_name1, *child_name2;
-
- xbt_dict_t filter = xbt_dict_new ();
-
- xbt_dict_foreach(container->children, cursor1, child_name1, child1) {
- xbt_dict_foreach(container->children, cursor2, child_name2, child2) {
- //check if we already register this pair (we only need one direction)
- char aux1[INSTR_DEFAULT_STR_SIZE], aux2[INSTR_DEFAULT_STR_SIZE];
- snprintf (aux1, INSTR_DEFAULT_STR_SIZE, "%s%s", child_name1, child_name2);
- snprintf (aux2, INSTR_DEFAULT_STR_SIZE, "%s%s", child_name2, child_name1);
- if (xbt_dict_get_or_null (filter, aux1)) continue;
- if (xbt_dict_get_or_null (filter, aux2)) continue;
-
- //ok, not found, register it
- xbt_dict_set (filter, aux1, xbt_strdup ("1"), xbt_free);
- xbt_dict_set (filter, aux2, xbt_strdup ("1"), xbt_free);
-
- if ((child1->kind == INSTR_HOST || child1->kind == INSTR_ROUTER) &&
- (child2->kind == INSTR_HOST || child2->kind == INSTR_ROUTER)){
-
- //getting route
- xbt_dynar_t route = NULL;
- xbt_ex_t exception;
- TRY {
- route = global_routing->get_route (child_name1, child_name2);
- }CATCH(exception) {
- //no route between them, that's possible
- continue;
- }
-
- //link the route members
- unsigned int cpt;
- void *link;
- char *previous_entity_name = (char*)child_name1;
- xbt_dynar_foreach (route, cpt, link) {
- char *link_name = ((link_CM02_t)link)->lmm_resource.generic_resource.name;
- linkContainers (previous_entity_name, link_name);
- previous_entity_name = link_name;
- }
- linkContainers (previous_entity_name, child_name2);
- }else if (child1->kind == INSTR_AS &&
- child2->kind == INSTR_AS &&
- strcmp(child_name1, child_name2) != 0){
-
- //getting route
- routing_component_t root = global_routing->root;
- route_extended_t route = NULL;
- xbt_ex_t exception;
- TRY {
- route = root->get_route (root, child_name1, child_name2);
- }CATCH(exception) {
- //no route between them, that's possible
- continue;
- }
- xbt_assert2(route!=NULL,
- "there is no ASroute between %s and %s", child_name1, child_name2);
- unsigned int cpt;
- void *link;
- char *previous_entity_name = route->src_gateway;
- xbt_dynar_foreach (route->generic_route.link_list, cpt, link) {
- char *link_name = ((link_CM02_t)link)->lmm_resource.generic_resource.name;
- linkContainers (previous_entity_name, link_name);
- previous_entity_name = link_name;
- }
- linkContainers (previous_entity_name, route->dst_gateway);
+ //let's get routes
+ xbt_dict_cursor_t cursor1 = NULL, cursor2 = NULL;
+ container_t child1, child2;
+ const char *child1_name, *child2_name;
+ xbt_dict_foreach(container->children, cursor1, child1_name, child1) {
+ if (child1->kind == INSTR_LINK) continue;
+ xbt_dict_foreach(container->children, cursor2, child2_name, child2) {
+ if (child2->kind == INSTR_LINK) continue;
+
+ if ((child1->kind == INSTR_HOST || child1->kind == INSTR_ROUTER) &&
+ (child2->kind == INSTR_HOST || child2->kind == INSTR_ROUTER) &&
+ strcmp (child1_name, child2_name) != 0){
+
+ xbt_dynar_t route = global_routing->get_route (child1_name, child2_name);
+ unsigned int cpt;
+ void *link;
+ container_t previous = child1;
+ xbt_dynar_foreach (route, cpt, link) {
+ char *link_name = ((link_CM02_t)link)->lmm_resource.generic_resource.name;
+ container_t current = getContainerByName(link_name);
+ linkContainers(container, previous, current, filter);
+ previous = current;
}
+ linkContainers(container, previous, child2, filter);
+
+ }else if (child1->kind == INSTR_AS &&
+ child2->kind == INSTR_AS &&
+ strcmp(child1_name, child2_name) != 0){
+
+ route_extended_t route = rc->get_route (rc, child1_name, child2_name);
+ unsigned int cpt;
+ void *link;
+ container_t previous = getContainerByName(route->src_gateway);
+ xbt_dynar_foreach (route->generic_route.link_list, cpt, link) {
+ char *link_name = ((link_CM02_t)link)->lmm_resource.generic_resource.name;
+ container_t current = getContainerByName(link_name);
+ linkContainers (container, previous, current, filter);
+ previous = current;
+ }
+ container_t last = getContainerByName(route->dst_gateway);
+ linkContainers (container, previous, last, filter);
}
}
- xbt_dict_free(&filter);
}
}
static void instr_routing_parse_start_AS ()
{
if (getRootContainer() == NULL){
- container_t root = newContainer ("0", INSTR_AS, NULL);
+ container_t root = newContainer (A_surfxml_AS_id, INSTR_AS, NULL);
instr_paje_init (root);
currentContainer = xbt_dynar_new (sizeof(container_t), NULL);
getLinkType ("MPI_LINK", getRootType(), mpi, mpi);
}
}
+
+ return;
}
container_t father = *(container_t*)xbt_dynar_get_ptr(currentContainer, xbt_dynar_length(currentContainer)-1);
container_t new = newContainer (A_surfxml_AS_id, INSTR_AS, father);
static void instr_routing_parse_start_link ()
{
container_t father = *(container_t*)xbt_dynar_get_ptr(currentContainer, xbt_dynar_length(currentContainer)-1);
- container_t new = newContainer (A_surfxml_link_id, INSTR_LINK, father);
+ const char *link_id = A_surfxml_link_id;
+
+ double bandwidth_value = atof(A_surfxml_link_bandwidth);
+ double latency_value = atof(A_surfxml_link_latency);
+ xbt_dynar_t links_to_create = xbt_dynar_new (sizeof(char*), &xbt_free_ref);
+
+ if (A_surfxml_link_sharing_policy == A_surfxml_link_sharing_policy_FULLDUPLEX){
+ char *up = bprintf("%s_UP", link_id);
+ char *down = bprintf("%s_DOWN", link_id);
+ xbt_dynar_push_as (links_to_create, char*, xbt_strdup(up));
+ xbt_dynar_push_as (links_to_create, char*, xbt_strdup(down));
+ free (up);
+ free (down);
+ }else{
+ xbt_dynar_push_as (links_to_create, char*, strdup(link_id));
+ }
- type_t bandwidth = getVariableType ("bandwidth", NULL, new->type);
- type_t latency = getVariableType ("latency", NULL, new->type);
- new_pajeSetVariable (0, new, bandwidth, atof(A_surfxml_link_bandwidth));
- new_pajeSetVariable (0, new, latency, atof(A_surfxml_link_latency));
- if (TRACE_uncategorized()){
- getVariableType ("bandwidth_used", "0.5 0.5 0.5", new->type);
+ char *link_name = NULL;
+ unsigned int i;
+ xbt_dynar_foreach (links_to_create, i, link_name){
+
+ container_t new = newContainer (link_name, INSTR_LINK, father);
+
+ type_t bandwidth = getVariableType ("bandwidth", NULL, new->type);
+ type_t latency = getVariableType ("latency", NULL, new->type);
+ new_pajeSetVariable (0, new, bandwidth, bandwidth_value);
+ new_pajeSetVariable (0, new, latency, latency_value);
+ if (TRACE_uncategorized()){
+ getVariableType ("bandwidth_used", "0.5 0.5 0.5", new->type);
+ }
}
+
+ xbt_dynar_free (&links_to_create);
}
static void instr_routing_parse_end_link ()
if (TRACE_msg_process_is_enabled()) {
type_t msg_process = getContainerType("MSG_PROCESS", new->type);
- getStateType ("MSG_PROCESS_STATE", msg_process);
+ type_t state = getStateType ("MSG_PROCESS_STATE", msg_process);
+ getValue ("executing", "0 1 0", state);
+ getValue ("suspend", "1 0 1", state);
+ getValue ("sleep", "1 1 0", state);
+ getValue ("receive", "1 0 0", state);
+ getValue ("send", "0 0 1", state);
+ getValue ("task_execute", "0 1 1", state);
getLinkType ("MSG_PROCESS_LINK", getRootType(), msg_process, msg_process);
getLinkType ("MSG_PROCESS_TASK_LINK", getRootType(), msg_process, msg_process);
}
if (TRACE_msg_task_is_enabled()) {
type_t msg_task = getContainerType ("MSG_TASK", new->type);
- getStateType ("MSG_TASK_STATE", msg_task);
+ type_t state = getStateType ("MSG_TASK_STATE", msg_task);
+ getValue ("MSG_task_execute", "0 1 0", state);
+ getValue ("created", "1 1 0", state);
getLinkType ("MSG_TASK_LINK", getRootType(), msg_task, msg_task);
}
}
{
xbt_dynar_free(¤tContainer);
currentContainer = NULL;
- recursiveGraphExtraction (getRootContainer());
+ xbt_dict_t filter = xbt_dict_new ();
+ recursiveGraphExtraction (global_routing->root, getRootContainer(), filter);
+ xbt_dict_free(&filter);
platform_created = 1;
TRACE_paje_dump_buffer(1);
}
*/
static void recursiveNewUserVariableType (const char *new_typename, const char *color, type_t root)
{
- if (!strcmp (root->name, "HOST") || !strcmp (root->name, "LINK")){
- getVariableType(new_typename, color, root);
+ if (!strcmp (root->name, "HOST")){
+ char tnstr[INSTR_DEFAULT_STR_SIZE];
+ snprintf (tnstr, INSTR_DEFAULT_STR_SIZE, "p%s", new_typename);
+ getVariableType(tnstr, color, root);
+ }
+ if (!strcmp (root->name, "LINK")){
+ char tnstr[INSTR_DEFAULT_STR_SIZE];
+ snprintf (tnstr, INSTR_DEFAULT_STR_SIZE, "b%s", new_typename);
+ getVariableType(tnstr, color, root);
}
xbt_dict_cursor_t cursor = NULL;
type_t child_type;
return platform_created;
}
+#define GRAPHICATOR_SUPPORT_FUNCTIONS
+
+
+static xbt_node_t new_xbt_graph_node (xbt_graph_t graph, const char *name, xbt_dict_t nodes)
+{
+ xbt_node_t ret = xbt_dict_get_or_null (nodes, name);
+ if (ret) return ret;
+
+ ret = xbt_graph_new_node (graph, xbt_strdup(name));
+ xbt_dict_set (nodes, name, ret, NULL);
+ return ret;
+}
+
+static xbt_edge_t new_xbt_graph_edge (xbt_graph_t graph, xbt_node_t s, xbt_node_t d, xbt_dict_t edges)
+{
+ xbt_edge_t ret;
+ char *name;
+
+ const char *sn = TRACE_node_name (s);
+ const char *dn = TRACE_node_name (d);
+
+ name = bprintf ("%s%s", sn, dn);
+ ret = xbt_dict_get_or_null (edges, name);
+ if (ret) return ret;
+ free (name);
+ name = bprintf ("%s%s", dn, sn);
+ ret = xbt_dict_get_or_null (edges, name);
+ if (ret) return ret;
+
+ ret = xbt_graph_new_edge(graph, s, d, NULL);
+ xbt_dict_set (edges, name, ret, NULL);
+ return ret;
+}
+
+static void recursiveXBTGraphExtraction (xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges,
+ routing_component_t rc, container_t container)
+{
+ if (xbt_dict_length (rc->routing_sons)){
+ xbt_dict_cursor_t cursor = NULL;
+ routing_component_t rc_son;
+ char *child_name;
+ //bottom-up recursion
+ xbt_dict_foreach(rc->routing_sons, cursor, child_name, rc_son) {
+ container_t child_container = xbt_dict_get (container->children, rc_son->name);
+ recursiveXBTGraphExtraction (graph, nodes, edges, rc_son, child_container);
+ }
+ }
+
+ //let's get routes
+ xbt_dict_cursor_t cursor1 = NULL, cursor2 = NULL;
+ container_t child1, child2;
+ const char *child1_name, *child2_name;
+ xbt_dict_foreach(container->children, cursor1, child1_name, child1) {
+ if (child1->kind == INSTR_LINK) continue;
+ xbt_dict_foreach(container->children, cursor2, child2_name, child2) {
+ if (child2->kind == INSTR_LINK) continue;
+
+ if ((child1->kind == INSTR_HOST || child1->kind == INSTR_ROUTER) &&
+ (child2->kind == INSTR_HOST || child2->kind == INSTR_ROUTER) &&
+ strcmp (child1_name, child2_name) != 0){
+
+ xbt_dynar_t route = global_routing->get_route (child1_name, child2_name);
+ unsigned int cpt;
+ void *link;
+ xbt_node_t current, previous = new_xbt_graph_node(graph, child1_name, nodes);
+ xbt_dynar_foreach (route, cpt, link) {
+ char *link_name = ((link_CM02_t)link)->lmm_resource.generic_resource.name;
+ current = new_xbt_graph_node(graph, link_name, nodes);
+ new_xbt_graph_edge (graph, previous, current, edges);
+ //previous -> current
+ previous = current;
+ }
+ current = new_xbt_graph_node(graph, child2_name, nodes);
+ new_xbt_graph_edge (graph, previous, current, edges);
+
+ }else if (child1->kind == INSTR_AS &&
+ child2->kind == INSTR_AS &&
+ strcmp(child1_name, child2_name) != 0){
+
+ route_extended_t route = rc->get_route (rc, child1_name, child2_name);
+ unsigned int cpt;
+ void *link;
+ xbt_node_t current, previous = new_xbt_graph_node(graph, route->src_gateway, nodes);
+ xbt_dynar_foreach (route->generic_route.link_list, cpt, link) {
+ char *link_name = ((link_CM02_t)link)->lmm_resource.generic_resource.name;
+ current = new_xbt_graph_node(graph, link_name, nodes);
+ //previous -> current
+ previous = current;
+ }
+ current = new_xbt_graph_node(graph, route->dst_gateway, nodes);
+ new_xbt_graph_edge (graph, previous, current, edges);
+ }
+ }
+ }
+
+}
+
+xbt_graph_t instr_routing_platform_graph (void)
+{
+ xbt_graph_t ret = xbt_graph_new_graph (0, NULL);
+ xbt_dict_t nodes = xbt_dict_new ();
+ xbt_dict_t edges = xbt_dict_new ();
+ recursiveXBTGraphExtraction (ret, nodes, edges, global_routing->root, getRootContainer());
+ return ret;
+}
+
+void instr_routing_platform_graph_export_graphviz (xbt_graph_t g, const char *filename)
+{
+ unsigned int cursor = 0;
+ xbt_node_t node = NULL;
+ xbt_edge_t edge = NULL;
+ FILE *file = NULL;
+
+ file = fopen(filename, "w");
+ xbt_assert(file, "Failed to open %s \n", filename);
+
+ if (g->directed)
+ fprintf(file, "digraph test {\n");
+ else
+ fprintf(file, "graph test {\n");
+
+ fprintf(file, " graph [overlap=scale]\n");
+
+ fprintf(file, " node [shape=box, style=filled]\n");
+ fprintf(file,
+ " node [width=.3, height=.3, style=filled, color=skyblue]\n\n");
+
+ xbt_dynar_foreach(g->nodes, cursor, node) {
+ fprintf(file, " \"%s\";\n", TRACE_node_name(node));
+ }
+ xbt_dynar_foreach(g->edges, cursor, edge) {
+ const char *src_s = TRACE_node_name (edge->src);
+ const char *dst_s = TRACE_node_name (edge->dst);
+ if (g->directed)
+ fprintf(file, " \"%s\" -> \"%s\";\n", src_s, dst_s);
+ else
+ fprintf(file, " \"%s\" -- \"%s\";\n", src_s, dst_s);
+ }
+ fprintf(file, "}\n");
+ fclose(file);
+
+}
+
#endif /* HAVE_TRACING */