src/surf/instr_routing.cpp

   1 /* Copyright (c) 2010-2017. The SimGrid Team. All rights reserved.          */
   2
   3 /* This program is free software; you can redistribute it and/or modify it
   4  * under the terms of the license (GNU LGPL) which comes with this package. */
   5
   6 #include "src/instr/instr_private.hpp"
   7
   8 #include "simgrid/s4u/Engine.hpp"
   9 #include "simgrid/s4u/Host.hpp"
  10 #include "src/kernel/routing/NetZoneImpl.hpp"
  11 #include "src/kernel/routing/NetPoint.hpp"
  12 #include "src/surf/network_interface.hpp"
  13 #include "src/surf/xml/platf_private.hpp"
  14 #include "surf/surf.h"
  15 #include "xbt/graph.h"
  16
  17 XBT_LOG_NEW_DEFAULT_SUBCATEGORY (instr_routing, instr, "Tracing platform hierarchy");
  18
  19 static int platform_created = 0;            /* indicate whether the platform file has been traced */
  20 static std::vector<container_t> currentContainer; /* push and pop, used only in creation */
  21
  22 static const char *instr_node_name (xbt_node_t node)
  23 {
  24   void *data = xbt_graph_node_get_data(node);
  25   return static_cast<char*>(data);
  26 }
  27
  28 static container_t lowestCommonAncestor (container_t a1, container_t a2)
  29 {
  30   //this is only an optimization (since most of a1 and a2 share the same parent)
  31   if (a1->father_ == a2->father_)
  32     return a1->father_;
  33
  34   //create an array with all ancestors of a1
  35   std::vector<container_t> ancestors_a1;
  36   container_t p = a1->father_;
  37   while (p){
  38     ancestors_a1.push_back(p);
  39     p = p->father_;
  40   }
  41
  42   //create an array with all ancestors of a2
  43   std::vector<container_t> ancestors_a2;
  44   p = a2->father_;
  45   while (p){
  46     ancestors_a2.push_back(p);
  47     p = p->father_;
  48   }
  49
  50   //find the lowest ancestor
  51   p = nullptr;
  52   int i = ancestors_a1.size() - 1;
  53   int j = ancestors_a2.size() - 1;
  54   while (i >= 0 && j >= 0){
  55     container_t a1p = ancestors_a1.at(i);
  56     container_t a2p = ancestors_a2.at(j);
  57     if (a1p == a2p){
  58       p = a1p;
  59     }else{
  60       break;
  61     }
  62     i--;
  63     j--;
  64   }
  65   return p;
  66 }
  67
  68 static void linkContainers(container_t src, container_t dst, std::set<std::string>* filter)
  69 {
  70   //ignore loopback
  71   if (src->name_ == "__loopback__" || dst->name_ == "__loopback__") {
  72     XBT_DEBUG ("  linkContainers: ignoring loopback link");
  73     return;
  74   }
  75
  76   //find common father
  77   container_t father = lowestCommonAncestor (src, dst);
  78   if (not father) {
  79     xbt_die ("common father unknown, this is a tracing problem");
  80   }
  81
  82   // check if we already register this pair (we only need one direction)
  83   std::string aux1 = src->name_ + dst->name_;
  84   std::string aux2 = dst->name_ + src->name_;
  85   if (filter->find(aux1) != filter->end()) {
  86     XBT_DEBUG("  linkContainers: already registered %s <-> %s (1)", src->name_.c_str(), dst->name_.c_str());
  87     return;
  88   }
  89   if (filter->find(aux2) != filter->end()) {
  90     XBT_DEBUG("  linkContainers: already registered %s <-> %s (2)", dst->name_.c_str(), src->name_.c_str());
  91     return;
  92   }
  93
  94   // ok, not found, register it
  95   filter->insert(aux1);
  96   filter->insert(aux2);
  97
  98   //declare type
  99   std::string link_typename = father->type_->getName() + "-" + src->type_->getName() + src->type_->getId() + "-" +
 100                               dst->type_->getName() + dst->type_->getId();
 101   simgrid::instr::Type* link_type = father->type_->getOrCreateLinkType(link_typename, src->type_, dst->type_);
 102
 103   //register EDGE types for triva configuration
 104   trivaEdgeTypes.insert(link_type->getName());
 105
 106   //create the link
 107   static long long counter = 0;
 108
 109   char key[INSTR_DEFAULT_STR_SIZE];
 110   snprintf (key, INSTR_DEFAULT_STR_SIZE, "%lld", counter);
 111   counter++;
 112
 113   new simgrid::instr::StartLinkEvent(SIMIX_get_clock(), father, link_type, src, "topology", key);
 114   new simgrid::instr::EndLinkEvent(SIMIX_get_clock(), father, link_type, dst, "topology", key);
 115
 116   XBT_DEBUG("  linkContainers %s <-> %s", src->name_.c_str(), dst->name_.c_str());
 117 }
 118
 119 static void recursiveGraphExtraction(simgrid::s4u::NetZone* netzone, container_t container,
 120                                      std::set<std::string>* filter)
 121 {
 122   if (not TRACE_platform_topology()) {
 123     XBT_DEBUG("Graph extraction disabled by user.");
 124     return;
 125   }
 126   XBT_DEBUG("Graph extraction for NetZone = %s", netzone->getCname());
 127   if (not netzone->getChildren()->empty()) {
 128     //bottom-up recursion
 129     for (auto const& nz_son : *netzone->getChildren()) {
 130       container_t child_container = container->children_.at(nz_son->getCname());
 131       recursiveGraphExtraction(nz_son, child_container, filter);
 132     }
 133   }
 134
 135   xbt_graph_t graph = xbt_graph_new_graph (0, nullptr);
 136   xbt_dict_t nodes = xbt_dict_new_homogeneous(nullptr);
 137   xbt_dict_t edges = xbt_dict_new_homogeneous(nullptr);
 138   xbt_edge_t edge = nullptr;
 139
 140   xbt_dict_cursor_t cursor = nullptr;
 141   char *edge_name;
 142
 143   static_cast<simgrid::kernel::routing::NetZoneImpl*>(netzone)->getGraph(graph, nodes, edges);
 144   xbt_dict_foreach(edges,cursor,edge_name,edge) {
 145     linkContainers(simgrid::instr::Container::byName(static_cast<const char*>(edge->src->data)),
 146                    simgrid::instr::Container::byName(static_cast<const char*>(edge->dst->data)), filter);
 147   }
 148   xbt_dict_free (&nodes);
 149   xbt_dict_free (&edges);
 150   xbt_graph_free_graph(graph, xbt_free_f, xbt_free_f, nullptr);
 151 }
 152
 153 /*
 154  * Callbacks
 155  */
 156 static void sg_instr_AS_begin(simgrid::s4u::NetZone& netzone)
 157 {
 158   std::string id = netzone.getName();
 159
 160   if (PJ_container_get_root() == nullptr){
 161     container_t root = new simgrid::instr::Container(id, simgrid::instr::INSTR_AS, nullptr);
 162     PJ_container_set_root (root);
 163
 164     if (TRACE_smpi_is_enabled()) {
 165       simgrid::instr::Type* mpi = root->type_->getOrCreateContainerType("MPI");
 166       if (not TRACE_smpi_is_grouped())
 167         mpi->getOrCreateStateType("MPI_STATE");
 168       simgrid::instr::Type::getRootType()->getOrCreateLinkType("MPI_LINK", mpi, mpi);
 169     }
 170
 171     if (TRACE_needs_platform()){
 172       currentContainer.push_back(root);
 173     }
 174     return;
 175   }
 176
 177   if (TRACE_needs_platform()){
 178     container_t father = currentContainer.back();
 179     container_t container = new simgrid::instr::Container(id, simgrid::instr::INSTR_AS, father);
 180     currentContainer.push_back(container);
 181   }
 182 }
 183
 184 static void sg_instr_AS_end(simgrid::s4u::NetZone& /*netzone*/)
 185 {
 186   if (TRACE_needs_platform()){
 187     currentContainer.pop_back();
 188   }
 189 }
 190
 191 static void instr_routing_parse_start_link(simgrid::s4u::Link& link)
 192 {
 193   if (currentContainer.empty()) // No ongoing parsing. Are you creating the loopback?
 194     return;
 195   container_t father = currentContainer.back();
 196
 197   double bandwidth_value = link.bandwidth();
 198   double latency_value   = link.latency();
 199
 200   container_t container = new simgrid::instr::Container(link.getCname(), simgrid::instr::INSTR_LINK, father);
 201
 202   if ((TRACE_categorized() || TRACE_uncategorized() || TRACE_platform()) && (not TRACE_disable_link())) {
 203     simgrid::instr::Type* bandwidth = container->type_->getOrCreateVariableType("bandwidth", "");
 204     simgrid::instr::Type* latency   = container->type_->getOrCreateVariableType("latency", "");
 205     new simgrid::instr::SetVariableEvent(0, container, bandwidth, bandwidth_value);
 206     new simgrid::instr::SetVariableEvent(0, container, latency, latency_value);
 207   }
 208   if (TRACE_uncategorized()) {
 209     container->type_->getOrCreateVariableType("bandwidth_used", "0.5 0.5 0.5");
 210   }
 211 }
 212
 213 static void sg_instr_new_host(simgrid::s4u::Host& host)
 214 {
 215   container_t father = currentContainer.back();
 216   container_t container = new simgrid::instr::Container(host.getCname(), simgrid::instr::INSTR_HOST, father);
 217
 218   if ((TRACE_categorized() || TRACE_uncategorized() || TRACE_platform()) && (not TRACE_disable_speed())) {
 219     simgrid::instr::Type* speed = container->type_->getOrCreateVariableType("power", "");
 220
 221     double current_speed_state = host.getSpeed();
 222     new simgrid::instr::SetVariableEvent(0, container, speed, current_speed_state);
 223   }
 224   if (TRACE_uncategorized())
 225     container->type_->getOrCreateVariableType("power_used", "0.5 0.5 0.5");
 226
 227   if (TRACE_smpi_is_enabled() && TRACE_smpi_is_grouped())
 228     container->type_->getOrCreateContainerType("MPI")->getOrCreateStateType("MPI_STATE");
 229
 230   if (TRACE_msg_process_is_enabled()) {
 231     simgrid::instr::Type* msg_process = container->type_->getOrCreateContainerType("MSG_PROCESS");
 232     simgrid::instr::Type* state       = msg_process->getOrCreateStateType("MSG_PROCESS_STATE");
 233     simgrid::instr::Value::byNameOrCreate("suspend", "1 0 1", state);
 234     simgrid::instr::Value::byNameOrCreate("sleep", "1 1 0", state);
 235     simgrid::instr::Value::byNameOrCreate("receive", "1 0 0", state);
 236     simgrid::instr::Value::byNameOrCreate("send", "0 0 1", state);
 237     simgrid::instr::Value::byNameOrCreate("task_execute", "0 1 1", state);
 238     simgrid::instr::Type::getRootType()->getOrCreateLinkType("MSG_PROCESS_LINK", msg_process, msg_process);
 239     simgrid::instr::Type::getRootType()->getOrCreateLinkType("MSG_PROCESS_TASK_LINK", msg_process, msg_process);
 240   }
 241
 242   if (TRACE_msg_vm_is_enabled()) {
 243     simgrid::instr::Type* msg_vm = container->type_->getOrCreateContainerType("MSG_VM");
 244     simgrid::instr::Type* state  = msg_vm->getOrCreateStateType("MSG_VM_STATE");
 245     simgrid::instr::Value::byNameOrCreate("suspend", "1 0 1", state);
 246     simgrid::instr::Value::byNameOrCreate("sleep", "1 1 0", state);
 247     simgrid::instr::Value::byNameOrCreate("receive", "1 0 0", state);
 248     simgrid::instr::Value::byNameOrCreate("send", "0 0 1", state);
 249     simgrid::instr::Value::byNameOrCreate("task_execute", "0 1 1", state);
 250     simgrid::instr::Type::getRootType()->getOrCreateLinkType("MSG_VM_LINK", msg_vm, msg_vm);
 251     simgrid::instr::Type::getRootType()->getOrCreateLinkType("MSG_VM_PROCESS_LINK", msg_vm, msg_vm);
 252   }
 253 }
 254
 255 static void sg_instr_new_router(simgrid::kernel::routing::NetPoint * netpoint)
 256 {
 257   if (not netpoint->isRouter())
 258     return;
 259   if (TRACE_is_enabled() && TRACE_needs_platform()) {
 260     container_t father = currentContainer.back();
 261     new simgrid::instr::Container(netpoint->getCname(), simgrid::instr::INSTR_ROUTER, father);
 262   }
 263 }
 264
 265 static void instr_routing_parse_end_platform ()
 266 {
 267   currentContainer.clear();
 268   std::set<std::string>* filter = new std::set<std::string>;
 269   XBT_DEBUG ("Starting graph extraction.");
 270   recursiveGraphExtraction(simgrid::s4u::Engine::getInstance()->getNetRoot(), PJ_container_get_root(), filter);
 271   XBT_DEBUG ("Graph extraction finished.");
 272   delete filter;
 273   platform_created = 1;
 274   TRACE_paje_dump_buffer(true);
 275 }
 276
 277 void instr_routing_define_callbacks ()
 278 {
 279   // always need the callbacks to ASes (we need only the root AS), to create the rootContainer and the rootType properly
 280   if (not TRACE_is_enabled())
 281     return;
 282   if (TRACE_needs_platform()) {
 283     simgrid::s4u::Link::onCreation.connect(instr_routing_parse_start_link);
 284     simgrid::s4u::onPlatformCreated.connect(instr_routing_parse_end_platform);
 285     simgrid::s4u::Host::onCreation.connect(sg_instr_new_host);
 286   }
 287   simgrid::s4u::NetZone::onCreation.connect(sg_instr_AS_begin);
 288   simgrid::s4u::NetZone::onSeal.connect(sg_instr_AS_end);
 289   simgrid::kernel::routing::NetPoint::onCreation.connect(&sg_instr_new_router);
 290 }
 291 /*
 292  * user categories support
 293  */
 294 static void recursiveNewVariableType(const char* new_typename, const char* color, simgrid::instr::Type* root)
 295 {
 296   if (root->getName() == "HOST" || root->getName() == "MSG_VM")
 297     root->getOrCreateVariableType(std::string("p") + new_typename, color == nullptr ? "" : color);
 298
 299   if (root->getName() == "LINK")
 300     root->getOrCreateVariableType(std::string("b") + new_typename, color == nullptr ? "" : color);
 301
 302   for (auto elm : root->children_) {
 303     recursiveNewVariableType(new_typename, color == nullptr ? "" : color, elm.second);
 304   }
 305 }
 306
 307 void instr_new_variable_type (const char *new_typename, const char *color)
 308 {
 309   recursiveNewVariableType(new_typename, color, simgrid::instr::Type::getRootType());
 310 }
 311
 312 static void recursiveNewUserVariableType(const char* father_type, const char* new_typename, const char* color,
 313                                          simgrid::instr::Type* root)
 314 {
 315   if (root->getName() == father_type) {
 316     root->getOrCreateVariableType(new_typename, color == nullptr ? "" : color);
 317   }
 318   for (auto elm : root->children_)
 319     recursiveNewUserVariableType(father_type, new_typename, color, elm.second);
 320 }
 321
 322 void instr_new_user_variable_type  (const char *father_type, const char *new_typename, const char *color)
 323 {
 324   recursiveNewUserVariableType(father_type, new_typename, color, simgrid::instr::Type::getRootType());
 325 }
 326
 327 static void recursiveNewUserStateType(const char* father_type, const char* new_typename, simgrid::instr::Type* root)
 328 {
 329   if (root->getName() == father_type) {
 330     root->getOrCreateStateType(new_typename);
 331   }
 332   for (auto elm : root->children_)
 333     recursiveNewUserStateType(father_type, new_typename, elm.second);
 334 }
 335
 336 void instr_new_user_state_type (const char *father_type, const char *new_typename)
 337 {
 338   recursiveNewUserStateType(father_type, new_typename, simgrid::instr::Type::getRootType());
 339 }
 340
 341 static void recursiveNewValueForUserStateType(const char* type_name, const char* val, const char* color,
 342                                               simgrid::instr::Type* root)
 343 {
 344   if (root->getName() == type_name)
 345     simgrid::instr::Value::byNameOrCreate(val, color, root);
 346
 347   for (auto elm : root->children_)
 348     recursiveNewValueForUserStateType(type_name, val, color, elm.second);
 349 }
 350
 351 void instr_new_value_for_user_state_type (const char *type_name, const char *value, const char *color)
 352 {
 353   recursiveNewValueForUserStateType(type_name, value, color, simgrid::instr::Type::getRootType());
 354 }
 355
 356 int instr_platform_traced ()
 357 {
 358   return platform_created;
 359 }
 360
 361 #define GRAPHICATOR_SUPPORT_FUNCTIONS
 362
 363 static void recursiveXBTGraphExtraction(xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges, sg_netzone_t netzone,
 364                                         container_t container)
 365 {
 366   if (not netzone->getChildren()->empty()) {
 367     //bottom-up recursion
 368     for (auto const& netzone_child : *netzone->getChildren()) {
 369       container_t child_container = container->children_.at(netzone_child->getCname());
 370       recursiveXBTGraphExtraction(graph, nodes, edges, netzone_child, child_container);
 371     }
 372   }
 373
 374   static_cast<simgrid::kernel::routing::NetZoneImpl*>(netzone)->getGraph(graph, nodes, edges);
 375 }
 376
 377 xbt_graph_t instr_routing_platform_graph ()
 378 {
 379   xbt_graph_t ret = xbt_graph_new_graph (0, nullptr);
 380   xbt_dict_t nodes = xbt_dict_new_homogeneous(nullptr);
 381   xbt_dict_t edges = xbt_dict_new_homogeneous(nullptr);
 382   recursiveXBTGraphExtraction(ret, nodes, edges, simgrid::s4u::Engine::getInstance()->getNetRoot(),
 383                               PJ_container_get_root());
 384   xbt_dict_free (&nodes);
 385   xbt_dict_free (&edges);
 386   return ret;
 387 }
 388
 389 void instr_routing_platform_graph_export_graphviz (xbt_graph_t g, const char *filename)
 390 {
 391   unsigned int cursor = 0;
 392   xbt_node_t node = nullptr;
 393   xbt_edge_t edge = nullptr;
 394
 395   FILE *file = fopen(filename, "w");
 396   xbt_assert(file, "Failed to open %s \n", filename);
 397
 398   if (g->directed)
 399     fprintf(file, "digraph test {\n");
 400   else
 401     fprintf(file, "graph test {\n");
 402
 403   fprintf(file, "  graph [overlap=scale]\n");
 404
 405   fprintf(file, "  node [shape=box, style=filled]\n");
 406   fprintf(file, "  node [width=.3, height=.3, style=filled, color=skyblue]\n\n");
 407
 408   xbt_dynar_foreach(g->nodes, cursor, node) {
 409     fprintf(file, "  \"%s\";\n", instr_node_name(node));
 410   }
 411   xbt_dynar_foreach(g->edges, cursor, edge) {
 412     const char *src_s = instr_node_name (edge->src);
 413     const char *dst_s = instr_node_name (edge->dst);
 414     if (g->directed)
 415       fprintf(file, "  \"%s\" -> \"%s\";\n", src_s, dst_s);
 416     else
 417       fprintf(file, "  \"%s\" -- \"%s\";\n", src_s, dst_s);
 418   }
 419   fprintf(file, "}\n");
 420   fclose(file);
 421 }