1 /* Copyright (c) 2010. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 #include "instr/instr_private.h"
10 #include "surf/surf_private.h"
11 #include "surf/network_private.h"
12 #include "xbt/graph.h"
14 XBT_LOG_NEW_DEFAULT_SUBCATEGORY (instr_routing, instr, "Tracing platform hierarchy");
16 extern xbt_dict_t defined_types; /* from instr_interface.c */
18 static int platform_created = 0; /* indicate whether the platform file has been traced */
19 static xbt_dynar_t currentContainer = NULL; /* push and pop, used only in creation */
21 static const char *instr_node_name (xbt_node_t node)
23 void *data = xbt_graph_node_get_data(node);
24 char *str = (char*)data;
29 static container_t lowestCommonAncestor (container_t a1, container_t a2)
31 //this is only an optimization (since most of a1 and a2 share the same parent)
32 if (a1->father == a2->father) return a1->father;
34 //create an array with all ancestors of a1
35 xbt_dynar_t ancestors_a1 = xbt_dynar_new(sizeof(container_t), NULL);
39 xbt_dynar_push_as (ancestors_a1, container_t, p);
43 //create an array with all ancestors of a2
44 xbt_dynar_t ancestors_a2 = xbt_dynar_new(sizeof(container_t), NULL);
47 xbt_dynar_push_as (ancestors_a2, container_t, p);
51 //find the lowest ancestor
53 int i = xbt_dynar_length (ancestors_a1) - 1;
54 int j = xbt_dynar_length (ancestors_a2) - 1;
55 while (i >= 0 && j >= 0){
56 container_t a1p = *(container_t*)xbt_dynar_get_ptr (ancestors_a1, i);
57 container_t a2p = *(container_t*)xbt_dynar_get_ptr (ancestors_a2, j);
66 xbt_dynar_free (&ancestors_a1);
67 xbt_dynar_free (&ancestors_a2);
71 static void linkContainers (container_t src, container_t dst, xbt_dict_t filter)
74 if (strcmp (src->name, "__loopback__") == 0 || strcmp (dst->name, "__loopback__") == 0)
78 container_t father = lowestCommonAncestor (src, dst);
80 xbt_die ("common father unknown, this is a tracing problem");
84 //check if we already register this pair (we only need one direction)
85 char aux1[INSTR_DEFAULT_STR_SIZE], aux2[INSTR_DEFAULT_STR_SIZE];
86 snprintf (aux1, INSTR_DEFAULT_STR_SIZE, "%s%s", src->name, dst->name);
87 snprintf (aux2, INSTR_DEFAULT_STR_SIZE, "%s%s", dst->name, src->name);
88 if (xbt_dict_get_or_null (filter, aux1)) return;
89 if (xbt_dict_get_or_null (filter, aux2)) return;
91 //ok, not found, register it
92 xbt_dict_set (filter, aux1, xbt_strdup ("1"), NULL);
93 xbt_dict_set (filter, aux2, xbt_strdup ("1"), NULL);
97 char link_typename[INSTR_DEFAULT_STR_SIZE];
98 snprintf (link_typename, INSTR_DEFAULT_STR_SIZE, "%s-%s%s-%s%s",
100 src->type->name, src->type->id,
101 dst->type->name, dst->type->id);
102 type_t link_type = PJ_type_get_or_null (link_typename, father->type);
103 if (link_type == NULL){
104 link_type = PJ_type_link_new (link_typename, father->type, src->type, dst->type);
107 //register EDGE types for triva configuration
108 xbt_dict_set (trivaEdgeTypes, link_type->name, xbt_strdup("1"), NULL);
111 static long long counter = 0;
112 char key[INSTR_DEFAULT_STR_SIZE];
113 snprintf (key, INSTR_DEFAULT_STR_SIZE, "%lld", counter++);
114 new_pajeStartLink(SIMIX_get_clock(), father, link_type, src, "G", key);
115 new_pajeEndLink(SIMIX_get_clock(), father, link_type, dst, "G", key);
118 static void recursiveGraphExtraction (AS_t rc, container_t container, xbt_dict_t filter)
120 if (!xbt_dict_is_empty(rc->routing_sons)){
121 xbt_dict_cursor_t cursor = NULL;
124 //bottom-up recursion
125 xbt_dict_foreach(rc->routing_sons, cursor, child_name, rc_son) {
126 container_t child_container = xbt_dict_get (container->children, rc_son->name);
127 recursiveGraphExtraction (rc_son, child_container, filter);
132 xbt_dict_cursor_t cursor1 = NULL, cursor2 = NULL;
133 container_t child1, child2;
134 const char *child1_name, *child2_name;
135 xbt_dict_foreach(container->children, cursor1, child1_name, child1) {
136 //if child1 is not a link, a smpi node, a msg process or a msg task
137 if (child1->kind == INSTR_LINK || child1->kind == INSTR_SMPI || child1->kind == INSTR_MSG_PROCESS || child1->kind == INSTR_MSG_TASK) continue;
139 xbt_dict_foreach(container->children, cursor2, child2_name, child2) {
140 //if child2 is not a link, a smpi node, a msg process or a msg task
141 if (child2->kind == INSTR_LINK || child2->kind == INSTR_SMPI || child2->kind == INSTR_MSG_PROCESS || child2->kind == INSTR_MSG_TASK) continue;
143 //if child1 is not child2
144 if (strcmp (child1_name, child2_name) == 0) continue;
147 route_t route = xbt_new0(s_route_t,1);
148 route->link_list = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
149 rc->get_route_and_latency(rc, child1->net_elm, child2->net_elm,
152 //user might want to extract a graph using routes with only one link
153 //see --cfg=tracing/onelink_only:1 or --help-tracing for details
154 if (TRACE_onelink_only() && xbt_dynar_length (route->link_list) > 1){
155 generic_free_route(route);
159 //traverse the route connecting the containers
162 container_t current, previous;
163 if (route->src_gateway){
164 previous = PJ_container_get(route->src_gateway->name);
169 xbt_dynar_foreach (route->link_list, cpt, link) {
170 char *link_name = ((link_CM02_t)link)->lmm_resource.generic_resource.name;
171 current = PJ_container_get(link_name);
172 linkContainers(previous, current, filter);
175 if (route->dst_gateway){
176 current = PJ_container_get(route->dst_gateway->name);
180 linkContainers(previous, current, filter);
181 generic_free_route(route);
189 static void instr_routing_parse_start_AS (const char*id,int routing)
191 if (PJ_container_get_root() == NULL){
192 PJ_container_alloc ();
194 container_t root = PJ_container_new (id, INSTR_AS, NULL);
195 PJ_container_set_root (root);
197 if (TRACE_smpi_is_enabled()) {
198 if (!TRACE_smpi_is_grouped()){
199 type_t mpi = PJ_type_get_or_null ("MPI", root->type);
201 mpi = PJ_type_container_new("MPI", root->type);
202 PJ_type_state_new ("MPI_STATE", mpi);
203 PJ_type_link_new ("MPI_LINK", PJ_type_get_root(), mpi, mpi);
208 if (TRACE_needs_platform()){
209 currentContainer = xbt_dynar_new (sizeof(container_t), NULL);
210 xbt_dynar_push (currentContainer, &root);
215 if (TRACE_needs_platform()){
216 container_t father = *(container_t*)xbt_dynar_get_ptr(currentContainer, xbt_dynar_length(currentContainer)-1);
217 container_t new = PJ_container_new (id, INSTR_AS, father);
218 xbt_dynar_push (currentContainer, &new);
222 static void instr_routing_parse_end_AS ()
224 if (TRACE_needs_platform()){
225 xbt_dynar_pop_ptr (currentContainer);
229 static void instr_routing_parse_start_link (sg_platf_link_cbarg_t link)
231 container_t father = *(container_t*)xbt_dynar_get_ptr(currentContainer, xbt_dynar_length(currentContainer)-1);
233 double bandwidth_value = link->bandwidth;
234 double latency_value = link->latency;
235 xbt_dynar_t links_to_create = xbt_dynar_new (sizeof(char*), &xbt_free_ref);
237 if (link->policy == SURF_LINK_FULLDUPLEX){
238 char *up = bprintf("%s_UP", link->id);
239 char *down = bprintf("%s_DOWN", link->id);
240 xbt_dynar_push_as (links_to_create, char*, xbt_strdup(up));
241 xbt_dynar_push_as (links_to_create, char*, xbt_strdup(down));
245 xbt_dynar_push_as (links_to_create, char*, strdup(link->id));
248 char *link_name = NULL;
250 xbt_dynar_foreach (links_to_create, i, link_name){
252 container_t new = PJ_container_new (link_name, INSTR_LINK, father);
254 if (TRACE_categorized() || TRACE_uncategorized() || TRACE_platform()){
255 type_t bandwidth = PJ_type_get_or_null ("bandwidth", new->type);
256 if (bandwidth == NULL){
257 bandwidth = PJ_type_variable_new ("bandwidth", NULL, new->type);
259 type_t latency = PJ_type_get_or_null ("latency", new->type);
260 if (latency == NULL){
261 latency = PJ_type_variable_new ("latency", NULL, new->type);
263 new_pajeSetVariable (0, new, bandwidth, bandwidth_value);
264 new_pajeSetVariable (0, new, latency, latency_value);
266 if (TRACE_uncategorized()){
267 type_t bandwidth_used = PJ_type_get_or_null ("bandwidth_used", new->type);
268 if (bandwidth_used == NULL){
269 bandwidth_used = PJ_type_variable_new ("bandwidth_used", "0.5 0.5 0.5", new->type);
274 xbt_dynar_free (&links_to_create);
277 static void instr_routing_parse_start_host (sg_platf_host_cbarg_t host)
279 container_t father = *(container_t*)xbt_dynar_get_ptr(currentContainer, xbt_dynar_length(currentContainer)-1);
280 container_t new = PJ_container_new (host->id, INSTR_HOST, father);
282 if (TRACE_categorized() || TRACE_uncategorized() || TRACE_platform()) {
283 type_t power = PJ_type_get_or_null ("power", new->type);
285 power = PJ_type_variable_new ("power", NULL, new->type);
287 new_pajeSetVariable (0, new, power, host->power_peak);
289 if (TRACE_uncategorized()){
290 type_t power_used = PJ_type_get_or_null ("power_used", new->type);
291 if (power_used == NULL){
292 power_used = PJ_type_variable_new ("power_used", "0.5 0.5 0.5", new->type);
296 if (TRACE_smpi_is_enabled() && TRACE_smpi_is_grouped()){
297 type_t mpi = PJ_type_get_or_null ("MPI", new->type);
299 mpi = PJ_type_container_new("MPI", new->type);
300 PJ_type_state_new ("MPI_STATE", mpi);
301 PJ_type_link_new ("MPI_LINK", PJ_type_get_root(), mpi, mpi);
305 if (TRACE_msg_process_is_enabled()) {
306 type_t msg_process = PJ_type_get_or_null ("MSG_PROCESS", new->type);
307 if (msg_process == NULL){
308 msg_process = PJ_type_container_new("MSG_PROCESS", new->type);
309 type_t state = PJ_type_state_new ("MSG_PROCESS_STATE", msg_process);
310 PJ_value_new ("suspend", "1 0 1", state);
311 PJ_value_new ("sleep", "1 1 0", state);
312 PJ_value_new ("receive", "1 0 0", state);
313 PJ_value_new ("send", "0 0 1", state);
314 PJ_value_new ("task_execute", "0 1 1", state);
315 PJ_type_link_new ("MSG_PROCESS_LINK", PJ_type_get_root(), msg_process, msg_process);
316 PJ_type_link_new ("MSG_PROCESS_TASK_LINK", PJ_type_get_root(), msg_process, msg_process);
321 static void instr_routing_parse_start_router (sg_platf_router_cbarg_t router)
323 container_t father = *(container_t*)xbt_dynar_get_ptr(currentContainer, xbt_dynar_length(currentContainer)-1);
324 PJ_container_new (router->id, INSTR_ROUTER, father);
327 static void instr_routing_parse_end_platform ()
329 xbt_dynar_free(¤tContainer);
330 currentContainer = NULL;
331 xbt_dict_t filter = xbt_dict_new_homogeneous(xbt_free);
332 recursiveGraphExtraction (routing_platf->root, PJ_container_get_root(), filter);
333 xbt_dict_free(&filter);
334 platform_created = 1;
335 TRACE_paje_dump_buffer(1);
338 void instr_routing_define_callbacks ()
340 if (!TRACE_is_enabled()) return;
341 //always need the call backs to ASes (we need only the root AS),
342 //to create the rootContainer and the rootType properly
343 sg_platf_AS_begin_add_cb(instr_routing_parse_start_AS);
344 sg_platf_AS_end_add_cb(instr_routing_parse_end_AS);
345 if (!TRACE_needs_platform()) return;
346 sg_platf_link_add_cb(instr_routing_parse_start_link);
347 sg_platf_host_add_cb(instr_routing_parse_start_host);
348 sg_platf_router_add_cb(instr_routing_parse_start_router);
350 sg_platf_postparse_add_cb(instr_routing_parse_end_platform);
354 * user categories support
356 static void recursiveNewVariableType (const char *new_typename, const char *color, type_t root)
358 if (!strcmp (root->name, "HOST")){
359 char tnstr[INSTR_DEFAULT_STR_SIZE];
360 snprintf (tnstr, INSTR_DEFAULT_STR_SIZE, "p%s", new_typename);
361 PJ_type_variable_new (tnstr, color, root);
363 if (!strcmp (root->name, "LINK")){
364 char tnstr[INSTR_DEFAULT_STR_SIZE];
365 snprintf (tnstr, INSTR_DEFAULT_STR_SIZE, "b%s", new_typename);
366 PJ_type_variable_new (tnstr, color, root);
368 xbt_dict_cursor_t cursor = NULL;
371 xbt_dict_foreach(root->children, cursor, name, child_type) {
372 recursiveNewVariableType (new_typename, color, child_type);
376 void instr_new_variable_type (const char *new_typename, const char *color)
378 recursiveNewVariableType (new_typename, color, PJ_type_get_root());
381 static void recursiveNewUserVariableType (const char *father_type, const char *new_typename, const char *color, type_t root)
383 if (!strcmp (root->name, father_type)){
384 PJ_type_variable_new (new_typename, color, root);
386 xbt_dict_cursor_t cursor = NULL;
389 xbt_dict_foreach(root->children, cursor, name, child_type) {
390 recursiveNewUserVariableType (father_type, new_typename, color, child_type);
394 void instr_new_user_variable_type (const char *father_type, const char *new_typename, const char *color)
396 recursiveNewUserVariableType (father_type, new_typename, color, PJ_type_get_root());
399 static void recursiveNewUserStateType (const char *father_type, const char *new_typename, type_t root)
401 if (!strcmp (root->name, father_type)){
402 PJ_type_state_new (new_typename, root);
404 xbt_dict_cursor_t cursor = NULL;
407 xbt_dict_foreach(root->children, cursor, name, child_type) {
408 recursiveNewUserStateType (father_type, new_typename, child_type);
412 void instr_new_user_state_type (const char *father_type, const char *new_typename)
414 recursiveNewUserStateType (father_type, new_typename, PJ_type_get_root());
417 static void recursiveNewValueForUserStateType (const char *typename, const char *value, const char *color, type_t root)
419 if (!strcmp (root->name, typename)){
420 PJ_value_new (value, color, root);
422 xbt_dict_cursor_t cursor = NULL;
425 xbt_dict_foreach(root->children, cursor, name, child_type) {
426 recursiveNewValueForUserStateType (typename, value, color, child_type);
430 void instr_new_value_for_user_state_type (const char *typename, const char *value, const char *color)
432 recursiveNewValueForUserStateType (typename, value, color, PJ_type_get_root());
435 int instr_platform_traced ()
437 return platform_created;
440 #define GRAPHICATOR_SUPPORT_FUNCTIONS
443 static xbt_node_t new_xbt_graph_node (xbt_graph_t graph, const char *name, xbt_dict_t nodes)
445 xbt_node_t ret = xbt_dict_get_or_null (nodes, name);
448 ret = xbt_graph_new_node (graph, xbt_strdup(name));
449 xbt_dict_set (nodes, name, ret, NULL);
453 static xbt_edge_t new_xbt_graph_edge (xbt_graph_t graph, xbt_node_t s, xbt_node_t d, xbt_dict_t edges)
457 const char *sn = instr_node_name (s);
458 const char *dn = instr_node_name (d);
459 int len = strlen(sn)+strlen(dn)+1;
460 char *name = (char*)malloc(len * sizeof(char));
463 snprintf (name, len, "%s%s", sn, dn);
464 ret = xbt_dict_get_or_null (edges, name);
466 snprintf (name, len, "%s%s", dn, sn);
467 ret = xbt_dict_get_or_null (edges, name);
471 ret = xbt_graph_new_edge(graph, s, d, NULL);
472 xbt_dict_set (edges, name, ret, NULL);
478 static void recursiveXBTGraphExtraction (xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges,
479 AS_t rc, container_t container)
481 if (!xbt_dict_is_empty(rc->routing_sons)){
482 xbt_dict_cursor_t cursor = NULL;
485 //bottom-up recursion
486 xbt_dict_foreach(rc->routing_sons, cursor, child_name, rc_son) {
487 container_t child_container = xbt_dict_get (container->children, rc_son->name);
488 recursiveXBTGraphExtraction (graph, nodes, edges, rc_son, child_container);
493 xbt_dict_cursor_t cursor1 = NULL, cursor2 = NULL;
494 container_t child1, child2;
495 const char *child1_name, *child2_name;
496 xbt_dict_foreach(container->children, cursor1, child1_name, child1) {
497 //if child1 is not a link, a smpi node, a msg process or a msg task
498 if (child1->kind == INSTR_LINK || child1->kind == INSTR_SMPI || child1->kind == INSTR_MSG_PROCESS || child1->kind == INSTR_MSG_TASK) continue;
500 xbt_dict_foreach(container->children, cursor2, child2_name, child2) {
501 //if child2 is not a link, a smpi node, a msg process or a msg task
502 if (child2->kind == INSTR_LINK || child2->kind == INSTR_SMPI || child2->kind == INSTR_MSG_PROCESS || child2->kind == INSTR_MSG_TASK) continue;
504 //if child1 is not child2
505 if (strcmp (child1_name, child2_name) == 0) continue;
508 route_t route = xbt_new0(s_route_t,1);
509 route->link_list = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
510 rc->get_route_and_latency(rc, child1->net_elm, child2->net_elm,
513 //user might want to extract a graph using routes with only one link
514 //see --cfg=tracing/onelink_only:1 or --help-tracing for details
515 if (TRACE_onelink_only() && xbt_dynar_length (route->link_list) > 1) continue;
517 //traverse the route connecting the containers
520 xbt_node_t current, previous;
521 if (route->src_gateway){
522 previous = new_xbt_graph_node(graph, route->src_gateway->name, nodes);
524 previous = new_xbt_graph_node(graph, child1_name, nodes);
527 xbt_dynar_foreach (route->link_list, cpt, link) {
528 char *link_name = ((link_CM02_t)link)->lmm_resource.generic_resource.name;
529 current = new_xbt_graph_node(graph, link_name, nodes);
530 new_xbt_graph_edge (graph, previous, current, edges);
531 //previous -> current
534 if (route->dst_gateway){
535 current = new_xbt_graph_node(graph, route->dst_gateway->name, nodes);
537 current = new_xbt_graph_node(graph, child2_name, nodes);
539 new_xbt_graph_edge (graph, previous, current, edges);
540 generic_free_route(route);
546 xbt_graph_t instr_routing_platform_graph (void)
548 xbt_graph_t ret = xbt_graph_new_graph (0, NULL);
549 xbt_dict_t nodes = xbt_dict_new_homogeneous(NULL);
550 xbt_dict_t edges = xbt_dict_new_homogeneous(NULL);
551 recursiveXBTGraphExtraction (ret, nodes, edges, routing_platf->root, PJ_container_get_root());
552 xbt_dict_free (&nodes);
553 xbt_dict_free (&edges);
557 void instr_routing_platform_graph_export_graphviz (xbt_graph_t g, const char *filename)
559 unsigned int cursor = 0;
560 xbt_node_t node = NULL;
561 xbt_edge_t edge = NULL;
564 file = fopen(filename, "w");
565 xbt_assert(file, "Failed to open %s \n", filename);
568 fprintf(file, "digraph test {\n");
570 fprintf(file, "graph test {\n");
572 fprintf(file, " graph [overlap=scale]\n");
574 fprintf(file, " node [shape=box, style=filled]\n");
576 " node [width=.3, height=.3, style=filled, color=skyblue]\n\n");
578 xbt_dynar_foreach(g->nodes, cursor, node) {
579 fprintf(file, " \"%s\";\n", instr_node_name(node));
581 xbt_dynar_foreach(g->edges, cursor, edge) {
582 const char *src_s = instr_node_name (edge->src);
583 const char *dst_s = instr_node_name (edge->dst);
585 fprintf(file, " \"%s\" -> \"%s\";\n", src_s, dst_s);
587 fprintf(file, " \"%s\" -- \"%s\";\n", src_s, dst_s);
589 fprintf(file, "}\n");
594 #endif /* HAVE_TRACING */