static int platform_created = 0; /* indicate whether the platform file has been traced */
static xbt_dynar_t currentContainer = NULL; /* push and pop, used only in creation */
+static const char *instr_node_name (xbt_node_t node)
+{
+ void *data = xbt_graph_node_get_data(node);
+ char *str = (char*)data;
+ 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)
if (a1->father == a2->father) return a1->father;
//create an array with all ancestors of a1
- xbt_dynar_t ancestors = xbt_dynar_new(sizeof(container_t), NULL);
+ xbt_dynar_t ancestors_a1 = xbt_dynar_new(sizeof(container_t), NULL);
container_t p;
p = a1->father;
while (p){
- xbt_dynar_push_as (ancestors, container_t, p);
+ xbt_dynar_push_as (ancestors_a1, container_t, p);
p = p->father;
}
- //find the lowest ancestor of a2 in the previously created array
+ //create an array with all ancestors of a2
+ xbt_dynar_t ancestors_a2 = xbt_dynar_new(sizeof(container_t), NULL);
p = a2->father;
while (p){
- int cpt;
- unsigned int cursor;
- xbt_dynar_foreach (ancestors, cursor, cpt){
- container_t pp = *(container_t*)xbt_dynar_get_ptr(ancestors, cursor);
- if (p == pp){
- return p;
- }
- }
+ xbt_dynar_push_as (ancestors_a2, container_t, p);
p = p->father;
}
- //not common ancestor found, return NULL
- return NULL;
+ //find the lowest ancestor
+ p = NULL;
+ int i = xbt_dynar_length (ancestors_a1) - 1;
+ int j = xbt_dynar_length (ancestors_a2) - 1;
+ while (i >= 0 && j >= 0){
+ container_t a1p = *(container_t*)xbt_dynar_get_ptr (ancestors_a1, i);
+ container_t a2p = *(container_t*)xbt_dynar_get_ptr (ancestors_a2, j);
+ if (a1p == a2p){
+ p = a1p;
+ }else{
+ break;
+ }
+ i--;
+ j--;
+ }
+ xbt_dynar_free (&ancestors_a1);
+ xbt_dynar_free (&ancestors_a2);
+ return p;
}
-static void linkContainers (container_t father, container_t src, container_t dst, xbt_dict_t filter)
+static void linkContainers (container_t src, container_t dst, xbt_dict_t filter)
{
//ignore loopback
- if (strcmp (src->name, "__loopback__") == 0 || strcmp (dst->name, "__loopback__") == 0)
+ if (strcmp (src->name, "__loopback__") == 0 || strcmp (dst->name, "__loopback__") == 0){
+ XBT_DEBUG (" linkContainers: ignoring loopback link");
return;
+ }
//find common father
container_t father = lowestCommonAncestor (src, dst);
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;
+ if (xbt_dict_get_or_null (filter, aux1)){
+ XBT_DEBUG (" linkContainers: already registered %s <-> %s (1)", src->name, dst->name);
+ return;
+ }
+ if (xbt_dict_get_or_null (filter, aux2)){
+ XBT_DEBUG (" linkContainers: already registered %s <-> %s (2)", dst->name, src->name);
+ return;
+ }
//ok, not found, register it
xbt_dict_set (filter, aux1, xbt_strdup ("1"), NULL);
//declare type
char link_typename[INSTR_DEFAULT_STR_SIZE];
- snprintf (link_typename, INSTR_DEFAULT_STR_SIZE, "%s-%s", src->type->name, dst->type->name);
+ snprintf (link_typename, INSTR_DEFAULT_STR_SIZE, "%s-%s%s-%s%s",
+ father->type->name,
+ src->type->name, src->type->id,
+ dst->type->name, dst->type->id);
type_t link_type = PJ_type_get_or_null (link_typename, father->type);
if (link_type == NULL){
link_type = PJ_type_link_new (link_typename, father->type, src->type, dst->type);
static long long counter = 0;
char key[INSTR_DEFAULT_STR_SIZE];
snprintf (key, INSTR_DEFAULT_STR_SIZE, "%lld", counter++);
- new_pajeStartLink(SIMIX_get_clock(), father, link_type, src, "G", key);
- new_pajeEndLink(SIMIX_get_clock(), father, link_type, dst, "G", key);
+ new_pajeStartLink(SIMIX_get_clock(), father, link_type, src, "topology", key);
+ new_pajeEndLink(SIMIX_get_clock(), father, link_type, dst, "topology", key);
+
+ XBT_DEBUG (" linkContainers %s <-> %s", src->name, dst->name);
+}
+
+static int graph_extraction_filter_out (container_t c1, container_t c2)
+{
+ if (c1->kind == INSTR_LINK ||
+ c1->kind == INSTR_SMPI ||
+ c1->kind == INSTR_MSG_PROCESS ||
+ c1->kind == INSTR_MSG_TASK ||
+ (c2 && strcmp (c1->name, c2->name) == 0))
+ return 1;
+ else
+ return 0;
}
static void recursiveGraphExtraction (AS_t rc, container_t container, xbt_dict_t filter)
{
+ XBT_DEBUG ("Graph extraction for routing_component = %s", rc->name);
if (!xbt_dict_is_empty(rc->routing_sons)){
xbt_dict_cursor_t cursor = NULL;
AS_t rc_son;
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;
+ if (graph_extraction_filter_out (child1, NULL)) 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 = NULL;
- xbt_ex_t e;
+ if (graph_extraction_filter_out (child2, child1)) continue;
+ XBT_DEBUG ("get_route from %s to %s", child1_name, child2_name);
+
+ //get the route
+ sg_platf_route_cbarg_t route = xbt_new0(s_sg_platf_route_cbarg_t,1);
+ route->link_list = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
+ rc->get_route_and_latency(rc, child1->net_elm, child2->net_elm,
+ route, NULL);
+
+ //user might want to extract a graph using routes with only one link
+ //see --cfg=tracing/onelink_only:1 or --help-tracing for details
+ if (TRACE_onelink_only() && xbt_dynar_length (route->link_list) > 1){
+ generic_free_route(route);
+ continue;
+ }
- TRY {
- routing_get_route_and_latency(child1_name, child2_name, &route, NULL);
- } CATCH(e) {
- xbt_ex_free(e);
- }
- if (route == NULL) continue;
+ //traverse the route connecting the containers
+ unsigned int cpt;
+ void *link;
+ container_t current, previous;
+ if (route->gw_src){
+ previous = PJ_container_get(route->gw_src->name);
+ }else{
+ previous = child1;
+ }
- if (TRACE_onelink_only()){
- if (xbt_dynar_length (route) > 1) continue;
- }
- container_t previous = child1;
- int i;
- for (i = 0; i < xbt_dynar_length(route); i++){
- link_CM02_t *link = ((link_CM02_t*)xbt_dynar_get_ptr (route, i));
- char *link_name = (*link)->lmm_resource.generic_resource.name;
- container_t current = PJ_container_get(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_t route = xbt_new0(s_route_t,1);
- route->link_list = xbt_dynar_new(global_routing->size_of_link,NULL);
- rc->get_route_and_latency (rc, child1_name, child2_name, route,NULL);
- unsigned int cpt;
- void *link;
- container_t previous = PJ_container_get(route->src_gateway);
- xbt_dynar_foreach (route->link_list, cpt, link) {
- char *link_name = ((link_CM02_t)link)->lmm_resource.generic_resource.name;
- container_t current = PJ_container_get(link_name);
- linkContainers (container, previous, current, filter);
- previous = current;
- }
- container_t last = PJ_container_get(route->dst_gateway);
- linkContainers (container, previous, last, filter);
- generic_free_route(route);
+ xbt_dynar_foreach (route->link_list, cpt, link) {
+ //FIXME (TODO): Should have a cleaner way to get the link name
+ char *link_name = ((link_CM02_t)link)->lmm_resource.generic_resource.name;
+ current = PJ_container_get(link_name);
+ linkContainers(previous, current, filter);
+ previous = current;
+ }
+ if (route->gw_dst){
+ current = PJ_container_get(route->gw_dst->name);
+ }else{
+ current = child2;
}
+ linkContainers(previous, current, filter);
+ generic_free_route(route);
}
}
}
/*
* Callbacks
*/
-static void instr_routing_parse_start_AS (const char*id,const char*routing)
+static void instr_routing_parse_start_AS (sg_platf_AS_cbarg_t AS)
{
+ const char*id = AS->id;
+
if (PJ_container_get_root() == NULL){
PJ_container_alloc ();
PJ_type_alloc();
container_t new = PJ_container_new (link_name, INSTR_LINK, father);
- if (TRACE_categorized() || TRACE_uncategorized()){
+ if (TRACE_categorized() || TRACE_uncategorized() || TRACE_platform()){
type_t bandwidth = PJ_type_get_or_null ("bandwidth", new->type);
if (bandwidth == NULL){
bandwidth = PJ_type_variable_new ("bandwidth", NULL, new->type);
container_t father = *(container_t*)xbt_dynar_get_ptr(currentContainer, xbt_dynar_length(currentContainer)-1);
container_t new = PJ_container_new (host->id, INSTR_HOST, father);
- if (TRACE_categorized() || TRACE_uncategorized()) {
+ if (TRACE_categorized() || TRACE_uncategorized() || TRACE_platform()) {
type_t power = PJ_type_get_or_null ("power", new->type);
if (power == NULL){
power = PJ_type_variable_new ("power", NULL, new->type);
if (msg_process == NULL){
msg_process = PJ_type_container_new("MSG_PROCESS", new->type);
type_t state = PJ_type_state_new ("MSG_PROCESS_STATE", msg_process);
- PJ_value_new ("executing", "0 1 0", state);
PJ_value_new ("suspend", "1 0 1", state);
PJ_value_new ("sleep", "1 1 0", state);
PJ_value_new ("receive", "1 0 0", state);
xbt_dynar_free(¤tContainer);
currentContainer = NULL;
xbt_dict_t filter = xbt_dict_new_homogeneous(xbt_free);
- recursiveGraphExtraction (global_routing->root, PJ_container_get_root(), filter);
+ XBT_DEBUG ("Starting graph extraction.");
+ recursiveGraphExtraction (routing_platf->root, PJ_container_get_root(), filter);
+ XBT_DEBUG ("Graph extraction finished.");
xbt_dict_free(&filter);
platform_created = 1;
TRACE_paje_dump_buffer(1);
recursiveNewUserVariableType (father_type, new_typename, color, PJ_type_get_root());
}
+static void recursiveNewUserStateType (const char *father_type, const char *new_typename, type_t root)
+{
+ if (!strcmp (root->name, father_type)){
+ PJ_type_state_new (new_typename, root);
+ }
+ xbt_dict_cursor_t cursor = NULL;
+ type_t child_type;
+ char *name;
+ xbt_dict_foreach(root->children, cursor, name, child_type) {
+ recursiveNewUserStateType (father_type, new_typename, child_type);
+ }
+}
+
+void instr_new_user_state_type (const char *father_type, const char *new_typename)
+{
+ recursiveNewUserStateType (father_type, new_typename, PJ_type_get_root());
+}
+
+static void recursiveNewValueForUserStateType (const char *typename, const char *value, const char *color, type_t root)
+{
+ if (!strcmp (root->name, typename)){
+ PJ_value_new (value, color, root);
+ }
+ xbt_dict_cursor_t cursor = NULL;
+ type_t child_type;
+ char *name;
+ xbt_dict_foreach(root->children, cursor, name, child_type) {
+ recursiveNewValueForUserStateType (typename, value, color, child_type);
+ }
+}
+void instr_new_value_for_user_state_type (const char *typename, const char *value, const char *color)
+{
+ recursiveNewValueForUserStateType (typename, value, color, PJ_type_get_root());
+}
int instr_platform_traced ()
{
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);
+ const char *sn = instr_node_name (s);
+ const char *dn = instr_node_name (d);
+ int len = strlen(sn)+strlen(dn)+1;
+ char *name = (char*)malloc(len * sizeof(char));
- 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);
+
+ snprintf (name, len, "%s%s", sn, dn);
ret = xbt_dict_get_or_null (edges, name);
- if (ret) return ret;
+ if (ret == NULL){
+ snprintf (name, len, "%s%s", dn, sn);
+ ret = xbt_dict_get_or_null (edges, name);
+ }
- ret = xbt_graph_new_edge(graph, s, d, NULL);
- xbt_dict_set (edges, name, ret, NULL);
+ if (ret == NULL){
+ ret = xbt_graph_new_edge(graph, s, d, NULL);
+ xbt_dict_set (edges, name, ret, NULL);
+ }
+ free (name);
return ret;
}
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 is not a link, a smpi node, a msg process or a msg task
+ if (child1->kind == INSTR_LINK || child1->kind == INSTR_SMPI || child1->kind == INSTR_MSG_PROCESS || child1->kind == INSTR_MSG_TASK) continue;
- if ((child1->kind == INSTR_HOST || child1->kind == INSTR_ROUTER) &&
- (child2->kind == INSTR_HOST || child2->kind == INSTR_ROUTER) &&
- strcmp (child1_name, child2_name) != 0){
-
- // FIXME factorize route creation with else branch below (once possible)
- xbt_dynar_t route=NULL;
- routing_get_route_and_latency (child1_name, child2_name,&route,NULL);
- if (TRACE_onelink_only()){
- if (xbt_dynar_length (route) > 1) continue;
- }
- 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);
+ xbt_dict_foreach(container->children, cursor2, child2_name, child2) {
+ //if child2 is not a link, a smpi node, a msg process or a msg task
+ if (child2->kind == INSTR_LINK || child2->kind == INSTR_SMPI || child2->kind == INSTR_MSG_PROCESS || child2->kind == INSTR_MSG_TASK) continue;
+
+ //if child1 is not child2
+ if (strcmp (child1_name, child2_name) == 0) continue;
+
+ //get the route
+ sg_platf_route_cbarg_t route = xbt_new0(s_sg_platf_route_cbarg_t,1);
+ route->link_list = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
+ rc->get_route_and_latency(rc, child1->net_elm, child2->net_elm,
+ route, NULL);
+
+ //user might want to extract a graph using routes with only one link
+ //see --cfg=tracing/onelink_only:1 or --help-tracing for details
+ if (TRACE_onelink_only() && xbt_dynar_length (route->link_list) > 1) continue;
+
+ //traverse the route connecting the containers
+ unsigned int cpt;
+ void *link;
+ xbt_node_t current, previous;
+ if (route->gw_src){
+ previous = new_xbt_graph_node(graph, route->gw_src->name, nodes);
+ }else{
+ previous = new_xbt_graph_node(graph, child1_name, nodes);
+ }
- }else if (child1->kind == INSTR_AS &&
- child2->kind == INSTR_AS &&
- strcmp(child1_name, child2_name) != 0){
-
- route_t route = xbt_new0(s_route_t,1);
- route->link_list = xbt_dynar_new(global_routing->size_of_link,NULL);
- rc->get_route_and_latency (rc, child1_name, child2_name,route, NULL);
- unsigned int cpt;
- void *link;
- xbt_node_t current, previous = new_xbt_graph_node(graph, route->src_gateway, nodes);
- xbt_dynar_foreach (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);
+ xbt_dynar_foreach (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);
new_xbt_graph_edge (graph, previous, current, edges);
- generic_free_route(route);
+ //previous -> current
+ previous = current;
+ }
+ if (route->gw_dst){
+ current = new_xbt_graph_node(graph, route->gw_dst->name, nodes);
+ }else{
+ current = new_xbt_graph_node(graph, child2_name, nodes);
}
+ new_xbt_graph_edge (graph, previous, current, edges);
+ generic_free_route(route);
}
}
xbt_graph_t ret = xbt_graph_new_graph (0, NULL);
xbt_dict_t nodes = xbt_dict_new_homogeneous(NULL);
xbt_dict_t edges = xbt_dict_new_homogeneous(NULL);
- recursiveXBTGraphExtraction (ret, nodes, edges, global_routing->root, PJ_container_get_root());
+ recursiveXBTGraphExtraction (ret, nodes, edges, routing_platf->root, PJ_container_get_root());
+ xbt_dict_free (&nodes);
+ xbt_dict_free (&edges);
return ret;
}
" 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));
+ fprintf(file, " \"%s\";\n", instr_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);
+ const char *src_s = instr_node_name (edge->src);
+ const char *dst_s = instr_node_name (edge->dst);
if (g->directed)
fprintf(file, " \"%s\" -> \"%s\";\n", src_s, dst_s);
else
