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){
75 XBT_DEBUG (" linkContainers: ignoring loopback link");
80 container_t father = lowestCommonAncestor (src, dst);
82 xbt_die ("common father unknown, this is a tracing problem");
86 //check if we already register this pair (we only need one direction)
87 char aux1[INSTR_DEFAULT_STR_SIZE], aux2[INSTR_DEFAULT_STR_SIZE];
88 snprintf (aux1, INSTR_DEFAULT_STR_SIZE, "%s%s", src->name, dst->name);
89 snprintf (aux2, INSTR_DEFAULT_STR_SIZE, "%s%s", dst->name, src->name);
90 if (xbt_dict_get_or_null (filter, aux1)){
91 XBT_DEBUG (" linkContainers: already registered %s <-> %s (1)", src->name, dst->name);
94 if (xbt_dict_get_or_null (filter, aux2)){
95 XBT_DEBUG (" linkContainers: already registered %s <-> %s (2)", dst->name, src->name);
99 //ok, not found, register it
100 xbt_dict_set (filter, aux1, xbt_strdup ("1"), NULL);
101 xbt_dict_set (filter, aux2, xbt_strdup ("1"), NULL);
105 char link_typename[INSTR_DEFAULT_STR_SIZE];
106 snprintf (link_typename, INSTR_DEFAULT_STR_SIZE, "%s-%s%s-%s%s",
108 src->type->name, src->type->id,
109 dst->type->name, dst->type->id);
110 type_t link_type = PJ_type_get_or_null (link_typename, father->type);
111 if (link_type == NULL){
112 link_type = PJ_type_link_new (link_typename, father->type, src->type, dst->type);
115 //register EDGE types for triva configuration
116 xbt_dict_set (trivaEdgeTypes, link_type->name, xbt_strdup("1"), NULL);
119 static long long counter = 0;
120 char key[INSTR_DEFAULT_STR_SIZE];
121 snprintf (key, INSTR_DEFAULT_STR_SIZE, "%lld", counter++);
122 new_pajeStartLink(SIMIX_get_clock(), father, link_type, src, "G", key);
123 new_pajeEndLink(SIMIX_get_clock(), father, link_type, dst, "G", key);
125 XBT_DEBUG (" linkContainers %s <-> %s", src->name, dst->name);
128 static int graph_extraction_filter_out (container_t c1, container_t c2)
130 if (c1->kind == INSTR_LINK ||
131 c1->kind == INSTR_SMPI ||
132 c1->kind == INSTR_MSG_PROCESS ||
133 c1->kind == INSTR_MSG_TASK ||
134 (c2 && strcmp (c1->name, c2->name) == 0))
140 static void recursiveGraphExtraction (AS_t rc, container_t container, xbt_dict_t filter)
142 XBT_DEBUG ("Graph extraction for routing_component = %s", rc->name);
143 if (!xbt_dict_is_empty(rc->routing_sons)){
144 xbt_dict_cursor_t cursor = NULL;
147 //bottom-up recursion
148 xbt_dict_foreach(rc->routing_sons, cursor, child_name, rc_son) {
149 container_t child_container = xbt_dict_get (container->children, rc_son->name);
150 recursiveGraphExtraction (rc_son, child_container, filter);
155 xbt_dict_cursor_t cursor1 = NULL, cursor2 = NULL;
156 container_t child1, child2;
157 const char *child1_name, *child2_name;
158 xbt_dict_foreach(container->children, cursor1, child1_name, child1) {
159 if (graph_extraction_filter_out (child1, NULL)) continue;
160 xbt_dict_foreach(container->children, cursor2, child2_name, child2) {
161 if (graph_extraction_filter_out (child2, child1)) continue;
162 XBT_DEBUG ("get_route from %s to %s", child1_name, child2_name);
165 sg_platf_route_cbarg_t route = xbt_new0(s_sg_platf_route_cbarg_t,1);
166 route->link_list = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
167 rc->get_route_and_latency(rc, child1->net_elm, child2->net_elm,
170 //user might want to extract a graph using routes with only one link
171 //see --cfg=tracing/onelink_only:1 or --help-tracing for details
172 if (TRACE_onelink_only() && xbt_dynar_length (route->link_list) > 1){
173 generic_free_route(route);
177 //traverse the route connecting the containers
180 container_t current, previous;
182 previous = PJ_container_get(route->gw_src->name);
187 xbt_dynar_foreach (route->link_list, cpt, link) {
188 //FIXME (TODO): Should have a cleaner way to get the link name
189 char *link_name = ((link_CM02_t)link)->lmm_resource.generic_resource.name;
190 current = PJ_container_get(link_name);
191 linkContainers(previous, current, filter);
195 current = PJ_container_get(route->gw_dst->name);
199 linkContainers(previous, current, filter);
200 generic_free_route(route);
208 static void instr_routing_parse_start_AS (sg_platf_AS_cbarg_t AS)
210 const char*id = AS->id;
212 if (PJ_container_get_root() == NULL){
213 PJ_container_alloc ();
215 container_t root = PJ_container_new (id, INSTR_AS, NULL);
216 PJ_container_set_root (root);
218 if (TRACE_smpi_is_enabled()) {
219 if (!TRACE_smpi_is_grouped()){
220 type_t mpi = PJ_type_get_or_null ("MPI", root->type);
222 mpi = PJ_type_container_new("MPI", root->type);
223 PJ_type_state_new ("MPI_STATE", mpi);
224 PJ_type_link_new ("MPI_LINK", PJ_type_get_root(), mpi, mpi);
229 if (TRACE_needs_platform()){
230 currentContainer = xbt_dynar_new (sizeof(container_t), NULL);
231 xbt_dynar_push (currentContainer, &root);
236 if (TRACE_needs_platform()){
237 container_t father = *(container_t*)xbt_dynar_get_ptr(currentContainer, xbt_dynar_length(currentContainer)-1);
238 container_t new = PJ_container_new (id, INSTR_AS, father);
239 xbt_dynar_push (currentContainer, &new);
243 static void instr_routing_parse_end_AS ()
245 if (TRACE_needs_platform()){
246 xbt_dynar_pop_ptr (currentContainer);
250 static void instr_routing_parse_start_link (sg_platf_link_cbarg_t link)
252 container_t father = *(container_t*)xbt_dynar_get_ptr(currentContainer, xbt_dynar_length(currentContainer)-1);
254 double bandwidth_value = link->bandwidth;
255 double latency_value = link->latency;
256 xbt_dynar_t links_to_create = xbt_dynar_new (sizeof(char*), &xbt_free_ref);
258 if (link->policy == SURF_LINK_FULLDUPLEX){
259 char *up = bprintf("%s_UP", link->id);
260 char *down = bprintf("%s_DOWN", link->id);
261 xbt_dynar_push_as (links_to_create, char*, xbt_strdup(up));
262 xbt_dynar_push_as (links_to_create, char*, xbt_strdup(down));
266 xbt_dynar_push_as (links_to_create, char*, strdup(link->id));
269 char *link_name = NULL;
271 xbt_dynar_foreach (links_to_create, i, link_name){
273 container_t new = PJ_container_new (link_name, INSTR_LINK, father);
275 if (TRACE_categorized() || TRACE_uncategorized() || TRACE_platform()){
276 type_t bandwidth = PJ_type_get_or_null ("bandwidth", new->type);
277 if (bandwidth == NULL){
278 bandwidth = PJ_type_variable_new ("bandwidth", NULL, new->type);
280 type_t latency = PJ_type_get_or_null ("latency", new->type);
281 if (latency == NULL){
282 latency = PJ_type_variable_new ("latency", NULL, new->type);
284 new_pajeSetVariable (0, new, bandwidth, bandwidth_value);
285 new_pajeSetVariable (0, new, latency, latency_value);
287 if (TRACE_uncategorized()){
288 type_t bandwidth_used = PJ_type_get_or_null ("bandwidth_used", new->type);
289 if (bandwidth_used == NULL){
290 bandwidth_used = PJ_type_variable_new ("bandwidth_used", "0.5 0.5 0.5", new->type);
295 xbt_dynar_free (&links_to_create);
298 static void instr_routing_parse_start_host (sg_platf_host_cbarg_t host)
300 container_t father = *(container_t*)xbt_dynar_get_ptr(currentContainer, xbt_dynar_length(currentContainer)-1);
301 container_t new = PJ_container_new (host->id, INSTR_HOST, father);
303 if (TRACE_categorized() || TRACE_uncategorized() || TRACE_platform()) {
304 type_t power = PJ_type_get_or_null ("power", new->type);
306 power = PJ_type_variable_new ("power", NULL, new->type);
308 new_pajeSetVariable (0, new, power, host->power_peak);
310 if (TRACE_uncategorized()){
311 type_t power_used = PJ_type_get_or_null ("power_used", new->type);
312 if (power_used == NULL){
313 power_used = PJ_type_variable_new ("power_used", "0.5 0.5 0.5", new->type);
317 if (TRACE_smpi_is_enabled() && TRACE_smpi_is_grouped()){
318 type_t mpi = PJ_type_get_or_null ("MPI", new->type);
320 mpi = PJ_type_container_new("MPI", new->type);
321 PJ_type_state_new ("MPI_STATE", mpi);
322 PJ_type_link_new ("MPI_LINK", PJ_type_get_root(), mpi, mpi);
326 if (TRACE_msg_process_is_enabled()) {
327 type_t msg_process = PJ_type_get_or_null ("MSG_PROCESS", new->type);
328 if (msg_process == NULL){
329 msg_process = PJ_type_container_new("MSG_PROCESS", new->type);
330 type_t state = PJ_type_state_new ("MSG_PROCESS_STATE", msg_process);
331 PJ_value_new ("suspend", "1 0 1", state);
332 PJ_value_new ("sleep", "1 1 0", state);
333 PJ_value_new ("receive", "1 0 0", state);
334 PJ_value_new ("send", "0 0 1", state);
335 PJ_value_new ("task_execute", "0 1 1", state);
336 PJ_type_link_new ("MSG_PROCESS_LINK", PJ_type_get_root(), msg_process, msg_process);
337 PJ_type_link_new ("MSG_PROCESS_TASK_LINK", PJ_type_get_root(), msg_process, msg_process);
342 static void instr_routing_parse_start_router (sg_platf_router_cbarg_t router)
344 container_t father = *(container_t*)xbt_dynar_get_ptr(currentContainer, xbt_dynar_length(currentContainer)-1);
345 PJ_container_new (router->id, INSTR_ROUTER, father);
348 static void instr_routing_parse_end_platform ()
350 xbt_dynar_free(¤tContainer);
351 currentContainer = NULL;
352 xbt_dict_t filter = xbt_dict_new_homogeneous(xbt_free);
353 XBT_DEBUG ("Starting graph extraction.");
354 recursiveGraphExtraction (routing_platf->root, PJ_container_get_root(), filter);
355 XBT_DEBUG ("Graph extraction finished.");
356 xbt_dict_free(&filter);
357 platform_created = 1;
358 TRACE_paje_dump_buffer(1);
361 void instr_routing_define_callbacks ()
363 if (!TRACE_is_enabled()) return;
364 //always need the call backs to ASes (we need only the root AS),
365 //to create the rootContainer and the rootType properly
366 sg_platf_AS_begin_add_cb(instr_routing_parse_start_AS);
367 sg_platf_AS_end_add_cb(instr_routing_parse_end_AS);
368 if (!TRACE_needs_platform()) return;
369 sg_platf_link_add_cb(instr_routing_parse_start_link);
370 sg_platf_host_add_cb(instr_routing_parse_start_host);
371 sg_platf_router_add_cb(instr_routing_parse_start_router);
373 sg_platf_postparse_add_cb(instr_routing_parse_end_platform);
377 * user categories support
379 static void recursiveNewVariableType (const char *new_typename, const char *color, type_t root)
381 if (!strcmp (root->name, "HOST")){
382 char tnstr[INSTR_DEFAULT_STR_SIZE];
383 snprintf (tnstr, INSTR_DEFAULT_STR_SIZE, "p%s", new_typename);
384 PJ_type_variable_new (tnstr, color, root);
386 if (!strcmp (root->name, "LINK")){
387 char tnstr[INSTR_DEFAULT_STR_SIZE];
388 snprintf (tnstr, INSTR_DEFAULT_STR_SIZE, "b%s", new_typename);
389 PJ_type_variable_new (tnstr, color, root);
391 xbt_dict_cursor_t cursor = NULL;
394 xbt_dict_foreach(root->children, cursor, name, child_type) {
395 recursiveNewVariableType (new_typename, color, child_type);
399 void instr_new_variable_type (const char *new_typename, const char *color)
401 recursiveNewVariableType (new_typename, color, PJ_type_get_root());
404 static void recursiveNewUserVariableType (const char *father_type, const char *new_typename, const char *color, type_t root)
406 if (!strcmp (root->name, father_type)){
407 PJ_type_variable_new (new_typename, color, root);
409 xbt_dict_cursor_t cursor = NULL;
412 xbt_dict_foreach(root->children, cursor, name, child_type) {
413 recursiveNewUserVariableType (father_type, new_typename, color, child_type);
417 void instr_new_user_variable_type (const char *father_type, const char *new_typename, const char *color)
419 recursiveNewUserVariableType (father_type, new_typename, color, PJ_type_get_root());
422 static void recursiveNewUserStateType (const char *father_type, const char *new_typename, type_t root)
424 if (!strcmp (root->name, father_type)){
425 PJ_type_state_new (new_typename, root);
427 xbt_dict_cursor_t cursor = NULL;
430 xbt_dict_foreach(root->children, cursor, name, child_type) {
431 recursiveNewUserStateType (father_type, new_typename, child_type);
435 void instr_new_user_state_type (const char *father_type, const char *new_typename)
437 recursiveNewUserStateType (father_type, new_typename, PJ_type_get_root());
440 static void recursiveNewValueForUserStateType (const char *typename, const char *value, const char *color, type_t root)
442 if (!strcmp (root->name, typename)){
443 PJ_value_new (value, color, root);
445 xbt_dict_cursor_t cursor = NULL;
448 xbt_dict_foreach(root->children, cursor, name, child_type) {
449 recursiveNewValueForUserStateType (typename, value, color, child_type);
453 void instr_new_value_for_user_state_type (const char *typename, const char *value, const char *color)
455 recursiveNewValueForUserStateType (typename, value, color, PJ_type_get_root());
458 int instr_platform_traced ()
460 return platform_created;
463 #define GRAPHICATOR_SUPPORT_FUNCTIONS
466 static xbt_node_t new_xbt_graph_node (xbt_graph_t graph, const char *name, xbt_dict_t nodes)
468 xbt_node_t ret = xbt_dict_get_or_null (nodes, name);
471 ret = xbt_graph_new_node (graph, xbt_strdup(name));
472 xbt_dict_set (nodes, name, ret, NULL);
476 static xbt_edge_t new_xbt_graph_edge (xbt_graph_t graph, xbt_node_t s, xbt_node_t d, xbt_dict_t edges)
480 const char *sn = instr_node_name (s);
481 const char *dn = instr_node_name (d);
482 int len = strlen(sn)+strlen(dn)+1;
483 char *name = (char*)malloc(len * sizeof(char));
486 snprintf (name, len, "%s%s", sn, dn);
487 ret = xbt_dict_get_or_null (edges, name);
489 snprintf (name, len, "%s%s", dn, sn);
490 ret = xbt_dict_get_or_null (edges, name);
494 ret = xbt_graph_new_edge(graph, s, d, NULL);
495 xbt_dict_set (edges, name, ret, NULL);
501 static void recursiveXBTGraphExtraction (xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges,
502 AS_t rc, container_t container)
504 if (!xbt_dict_is_empty(rc->routing_sons)){
505 xbt_dict_cursor_t cursor = NULL;
508 //bottom-up recursion
509 xbt_dict_foreach(rc->routing_sons, cursor, child_name, rc_son) {
510 container_t child_container = xbt_dict_get (container->children, rc_son->name);
511 recursiveXBTGraphExtraction (graph, nodes, edges, rc_son, child_container);
516 xbt_dict_cursor_t cursor1 = NULL, cursor2 = NULL;
517 container_t child1, child2;
518 const char *child1_name, *child2_name;
519 xbt_dict_foreach(container->children, cursor1, child1_name, child1) {
520 //if child1 is not a link, a smpi node, a msg process or a msg task
521 if (child1->kind == INSTR_LINK || child1->kind == INSTR_SMPI || child1->kind == INSTR_MSG_PROCESS || child1->kind == INSTR_MSG_TASK) continue;
523 xbt_dict_foreach(container->children, cursor2, child2_name, child2) {
524 //if child2 is not a link, a smpi node, a msg process or a msg task
525 if (child2->kind == INSTR_LINK || child2->kind == INSTR_SMPI || child2->kind == INSTR_MSG_PROCESS || child2->kind == INSTR_MSG_TASK) continue;
527 //if child1 is not child2
528 if (strcmp (child1_name, child2_name) == 0) continue;
531 sg_platf_route_cbarg_t route = xbt_new0(s_sg_platf_route_cbarg_t,1);
532 route->link_list = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
533 rc->get_route_and_latency(rc, child1->net_elm, child2->net_elm,
536 //user might want to extract a graph using routes with only one link
537 //see --cfg=tracing/onelink_only:1 or --help-tracing for details
538 if (TRACE_onelink_only() && xbt_dynar_length (route->link_list) > 1) continue;
540 //traverse the route connecting the containers
543 xbt_node_t current, previous;
545 previous = new_xbt_graph_node(graph, route->gw_src->name, nodes);
547 previous = new_xbt_graph_node(graph, child1_name, nodes);
550 xbt_dynar_foreach (route->link_list, cpt, link) {
551 char *link_name = ((link_CM02_t)link)->lmm_resource.generic_resource.name;
552 current = new_xbt_graph_node(graph, link_name, nodes);
553 new_xbt_graph_edge (graph, previous, current, edges);
554 //previous -> current
558 current = new_xbt_graph_node(graph, route->gw_dst->name, nodes);
560 current = new_xbt_graph_node(graph, child2_name, nodes);
562 new_xbt_graph_edge (graph, previous, current, edges);
563 generic_free_route(route);
569 xbt_graph_t instr_routing_platform_graph (void)
571 xbt_graph_t ret = xbt_graph_new_graph (0, NULL);
572 xbt_dict_t nodes = xbt_dict_new_homogeneous(NULL);
573 xbt_dict_t edges = xbt_dict_new_homogeneous(NULL);
574 recursiveXBTGraphExtraction (ret, nodes, edges, routing_platf->root, PJ_container_get_root());
575 xbt_dict_free (&nodes);
576 xbt_dict_free (&edges);
580 void instr_routing_platform_graph_export_graphviz (xbt_graph_t g, const char *filename)
582 unsigned int cursor = 0;
583 xbt_node_t node = NULL;
584 xbt_edge_t edge = NULL;
587 file = fopen(filename, "w");
588 xbt_assert(file, "Failed to open %s \n", filename);
591 fprintf(file, "digraph test {\n");
593 fprintf(file, "graph test {\n");
595 fprintf(file, " graph [overlap=scale]\n");
597 fprintf(file, " node [shape=box, style=filled]\n");
599 " node [width=.3, height=.3, style=filled, color=skyblue]\n\n");
601 xbt_dynar_foreach(g->nodes, cursor, node) {
602 fprintf(file, " \"%s\";\n", instr_node_name(node));
604 xbt_dynar_foreach(g->edges, cursor, edge) {
605 const char *src_s = instr_node_name (edge->src);
606 const char *dst_s = instr_node_name (edge->dst);
608 fprintf(file, " \"%s\" -> \"%s\";\n", src_s, dst_s);
610 fprintf(file, " \"%s\" -- \"%s\";\n", src_s, dst_s);
612 fprintf(file, "}\n");
617 #endif /* HAVE_TRACING */