src/surf/surf_routing.cpp

   1 /* Copyright (c) 2009-2011, 2013-2014. The SimGrid Team.
   2  * All rights reserved.                                                     */
   3
   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. */
   6
   7 #include "surf_routing.hpp"
   8 #include "surf_routing_private.hpp"
   9 #include "surf_routing_cluster.hpp"
  10 #include "surf_routing_cluster_torus.hpp"
  11 #include "surf_routing_cluster_fat_tree.hpp"
  12
  13 #include "simgrid/platf_interface.h"    // platform creation API internal interface
  14 #include "simgrid/sg_config.h"
  15 #include "storage_interface.hpp"
  16
  17 #include "surf/surfxml_parse_values.h"
  18
  19
  20 /**
  21  * @ingroup SURF_build_api
  22  * @brief A library containing all known workstations
  23  */
  24 xbt_lib_t host_lib;
  25
  26 int ROUTING_HOST_LEVEL;         //Routing level
  27 int SURF_CPU_LEVEL;             //Surf cpu level
  28 int SURF_WKS_LEVEL;             //Surf workstation level
  29 int SIMIX_HOST_LEVEL;           //Simix host level
  30 int SIMIX_STORAGE_LEVEL;        //Simix storage level
  31 int MSG_HOST_LEVEL;             //Msg host level
  32 int MSG_STORAGE_LEVEL;          //Msg storage level
  33 int MSG_FILE_LEVEL;             //Msg file level
  34 int SD_HOST_LEVEL;              //Simdag host level
  35 int SD_STORAGE_LEVEL;           //Simdag storage level
  36 int COORD_HOST_LEVEL=0;         //Coordinates level
  37 int NS3_HOST_LEVEL;             //host node for ns3
  38
  39 /**
  40  * @ingroup SURF_build_api
  41  * @brief A library containing all known links
  42  */
  43 xbt_lib_t link_lib;
  44 int SD_LINK_LEVEL;              //Simdag level
  45 int SURF_LINK_LEVEL;            //Surf level
  46 int NS3_LINK_LEVEL;             //link for ns3
  47
  48 xbt_lib_t as_router_lib;
  49 int ROUTING_ASR_LEVEL;          //Routing level
  50 int COORD_ASR_LEVEL;            //Coordinates level
  51 int NS3_ASR_LEVEL;              //host node for ns3
  52 int ROUTING_PROP_ASR_LEVEL;     //Where the properties are stored
  53
  54 static xbt_dict_t random_value = NULL;
  55
  56
  57 /** @brief Retrieve a routing edge from its name
  58  *
  59  * Routing edges are either CPU/workstation and routers, whatever
  60  */
  61 RoutingEdgePtr sg_routing_edge_by_name_or_null(const char *name) {
  62   RoutingEdgePtr net_elm = (RoutingEdgePtr) xbt_lib_get_or_null(host_lib, name, ROUTING_HOST_LEVEL);
  63   if (!net_elm)
  64         net_elm = (RoutingEdgePtr) xbt_lib_get_or_null(as_router_lib, name, ROUTING_ASR_LEVEL);
  65   return net_elm;
  66 }
  67
  68 /* Global vars */
  69 RoutingPlatfPtr routing_platf = NULL;
  70 AsPtr current_routing = NULL;
  71
  72 /* global parse functions */
  73 extern xbt_dynar_t mount_list;
  74
  75 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route, surf, "Routing part of surf");
  76
  77 static void routing_parse_peer(sg_platf_peer_cbarg_t peer);     /* peer bypass */
  78 // static void routing_parse_Srandom(void);        /* random bypass */
  79
  80 static void routing_parse_postparse(void);
  81
  82 /* this lines are only for replace use like index in the model table */
  83 typedef enum {
  84   SURF_MODEL_FULL = 0,
  85   SURF_MODEL_FLOYD,
  86   SURF_MODEL_DIJKSTRA,
  87   SURF_MODEL_DIJKSTRACACHE,
  88   SURF_MODEL_NONE,
  89   SURF_MODEL_VIVALDI,
  90   SURF_MODEL_CLUSTER,
  91   SURF_MODEL_TORUS_CLUSTER,
  92   SURF_MODEL_FAT_TREE_CLUSTER,
  93 } e_routing_types;
  94
  95 struct s_model_type routing_models[] = {
  96   {"Full",
  97    "Full routing data (fast, large memory requirements, fully expressive)",
  98    model_full_create, model_full_end},
  99   {"Floyd",
 100    "Floyd routing data (slow initialization, fast lookup, lesser memory requirements, shortest path routing only)",
 101    model_floyd_create, model_floyd_end},
 102   {"Dijkstra",
 103    "Dijkstra routing data (fast initialization, slow lookup, small memory requirements, shortest path routing only)",
 104    model_dijkstra_create, model_dijkstra_both_end},
 105   {"DijkstraCache",
 106    "Dijkstra routing data (fast initialization, fast lookup, small memory requirements, shortest path routing only)",
 107    model_dijkstracache_create, model_dijkstra_both_end},
 108   {"none", "No routing (Unless you know what you are doing, avoid using this mode in combination with a non Constant network model).",
 109    model_none_create,  NULL},
 110   {"Vivaldi", "Vivaldi routing",
 111    model_vivaldi_create, NULL},
 112   {"Cluster", "Cluster routing",
 113    model_cluster_create, NULL},
 114   {"Torus_Cluster", "Torus Cluster routing",
 115    model_torus_cluster_create, NULL},
 116   {"Fat_Tree_Cluster", "Fat Tree Cluster routing",
 117    model_fat_tree_cluster_create, NULL},
 118   {NULL, NULL, NULL, NULL}
 119 };
 120
 121 /**
 122  * \brief Add a "host_link" to the network element list
 123  */
 124 static void parse_S_host_link(sg_platf_host_link_cbarg_t host)
 125 {
 126   RoutingEdgePtr info = static_cast<RoutingEdgePtr>(xbt_lib_get_or_null(host_lib, host->id, ROUTING_HOST_LEVEL));
 127   xbt_assert(info, "Host '%s' not found!", host->id);
 128   xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER] ||
 129       current_routing->p_modelDesc == &routing_models[SURF_MODEL_VIVALDI],
 130       "You have to be in model Cluster to use tag host_link!");
 131
 132   s_surf_parsing_link_up_down_t link_up_down;
 133   link_up_down.link_up = xbt_lib_get_or_null(link_lib, host->link_up, SURF_LINK_LEVEL);
 134   link_up_down.link_down = xbt_lib_get_or_null(link_lib, host->link_down, SURF_LINK_LEVEL);
 135
 136   xbt_assert(link_up_down.link_up, "Link '%s' not found!",host->link_up);
 137   xbt_assert(link_up_down.link_down, "Link '%s' not found!",host->link_down);
 138
 139   if(!current_routing->p_linkUpDownList)
 140     current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
 141
 142   // If dynar is is greater than edge id and if the host_link is already defined
 143   if((int)xbt_dynar_length(current_routing->p_linkUpDownList) > info->getId() &&
 144       xbt_dynar_get_as(current_routing->p_linkUpDownList, info->getId(), void*))
 145         surf_parse_error("Host_link for '%s' is already defined!",host->id);
 146
 147   XBT_DEBUG("Push Host_link for host '%s' to position %d", info->getName(), info->getId());
 148   xbt_dynar_set_as(current_routing->p_linkUpDownList, info->getId(), s_surf_parsing_link_up_down_t, link_up_down);
 149 }
 150
 151 /**
 152  * \brief Add a "host" to the network element list
 153  */
 154 static void parse_S_host(sg_platf_host_cbarg_t host)
 155 {
 156   if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
 157     current_routing->p_hierarchy = SURF_ROUTING_BASE;
 158   xbt_assert(!xbt_lib_get_or_null(host_lib, host->id, ROUTING_HOST_LEVEL),
 159              "Reading a host, processing unit \"%s\" already exists", host->id);
 160
 161   RoutingEdgePtr info = new RoutingEdgeImpl(xbt_strdup(host->id),
 162                                                     -1,
 163                                                     SURF_NETWORK_ELEMENT_HOST,
 164                                                     current_routing);
 165   info->setId(current_routing->parsePU(info));
 166   xbt_lib_set(host_lib, host->id, ROUTING_HOST_LEVEL, (void *) info);
 167   XBT_DEBUG("Having set name '%s' id '%d'", host->id, info->getId());
 168
 169   if(mount_list){
 170     xbt_lib_set(storage_lib, host->id, ROUTING_STORAGE_HOST_LEVEL, (void *) mount_list);
 171     mount_list = NULL;
 172   }
 173
 174   if (host->coord && strcmp(host->coord, "")) {
 175     unsigned int cursor;
 176     char*str;
 177
 178     if (!COORD_HOST_LEVEL)
 179       xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
 180     /* Pre-parse the host coordinates -- FIXME factorize with routers by overloading the routing->parse_PU function*/
 181     xbt_dynar_t ctn_str = xbt_str_split_str(host->coord, " ");
 182     xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
 183     xbt_dynar_foreach(ctn_str,cursor, str) {
 184       double val = atof(str);
 185       xbt_dynar_push(ctn,&val);
 186     }
 187     xbt_dynar_shrink(ctn, 0);
 188     xbt_dynar_free(&ctn_str);
 189     xbt_lib_set(host_lib, host->id, COORD_HOST_LEVEL, (void *) ctn);
 190     XBT_DEBUG("Having set host coordinates for '%s'",host->id);
 191   }
 192 }
 193
 194 /**
 195  * \brief Add a "router" to the network element list
 196  */
 197 static void parse_S_router(sg_platf_router_cbarg_t router)
 198 {
 199   if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
 200     current_routing->p_hierarchy = SURF_ROUTING_BASE;
 201   xbt_assert(!xbt_lib_get_or_null(as_router_lib, router->id, ROUTING_ASR_LEVEL),
 202              "Reading a router, processing unit \"%s\" already exists",
 203              router->id);
 204
 205   RoutingEdgePtr info = new RoutingEdgeImpl(xbt_strdup(router->id),
 206                                             -1,
 207                                             SURF_NETWORK_ELEMENT_ROUTER,
 208                                             current_routing);
 209   info->setId(current_routing->parsePU(info));
 210   xbt_lib_set(as_router_lib, router->id, ROUTING_ASR_LEVEL, (void *) info);
 211   XBT_DEBUG("Having set name '%s' id '%d'", router->id, info->getId());
 212
 213   if (router->coord && strcmp(router->coord, "")) {
 214     unsigned int cursor;
 215     char*str;
 216
 217     if (!COORD_ASR_LEVEL)
 218       xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
 219     /* Pre-parse the host coordinates */
 220     xbt_dynar_t ctn_str = xbt_str_split_str(router->coord, " ");
 221     xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
 222     xbt_dynar_foreach(ctn_str,cursor, str) {
 223       double val = atof(str);
 224       xbt_dynar_push(ctn,&val);
 225     }
 226     xbt_dynar_shrink(ctn, 0);
 227     xbt_dynar_free(&ctn_str);
 228     xbt_lib_set(as_router_lib, router->id, COORD_ASR_LEVEL, (void *) ctn);
 229     XBT_DEBUG("Having set router coordinates for '%s'",router->id);
 230   }
 231 }
 232
 233 /**
 234  * \brief Store the route by calling the set_route function of the current routing component
 235  */
 236 static void parse_E_route(sg_platf_route_cbarg_t route)
 237 {
 238   /*FIXME:REMOVE:xbt_assert(current_routing->parse_route,
 239              "no defined method \"set_route\" in \"%s\"",
 240              current_routing->name);*/
 241
 242   current_routing->parseRoute(route);
 243 }
 244
 245 /**
 246  * \brief Store the ASroute by calling the set_ASroute function of the current routing component
 247  */
 248 static void parse_E_ASroute(sg_platf_route_cbarg_t ASroute)
 249 {
 250   /*FIXME:REMOVE:xbt_assert(current_routing->parse_ASroute,
 251              "no defined method \"set_ASroute\" in \"%s\"",
 252              current_routing->name);*/
 253   current_routing->parseASroute(ASroute);
 254 }
 255
 256 /**
 257  * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
 258  */
 259 static void parse_E_bypassRoute(sg_platf_route_cbarg_t route)
 260 {
 261   /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
 262              "Bypassing mechanism not implemented by routing '%s'",
 263              current_routing->name);*/
 264
 265   current_routing->parseBypassroute(route);
 266 }
 267
 268 /**
 269  * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
 270  */
 271 static void parse_E_bypassASroute(sg_platf_route_cbarg_t ASroute)
 272 {
 273   /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
 274              "Bypassing mechanism not implemented by routing '%s'",
 275              current_routing->name);*/
 276   current_routing->parseBypassroute(ASroute);
 277 }
 278
 279 static void routing_parse_trace(sg_platf_trace_cbarg_t trace)
 280 {
 281   tmgr_trace_t tmgr_trace;
 282   if (!trace->file || strcmp(trace->file, "") != 0) {
 283     tmgr_trace = tmgr_trace_new_from_file(trace->file);
 284   } else if (strcmp(trace->pc_data, "") == 0) {
 285     tmgr_trace = NULL;
 286   } else {
 287     tmgr_trace =
 288           tmgr_trace_new_from_string(trace->id, trace->pc_data,
 289                                      trace->periodicity);
 290   }
 291   xbt_dict_set(traces_set_list, trace->id, (void *) tmgr_trace, NULL);
 292 }
 293
 294 static void routing_parse_trace_connect(sg_platf_trace_connect_cbarg_t trace_connect)
 295 {
 296   xbt_assert(xbt_dict_get_or_null
 297               (traces_set_list, trace_connect->trace),
 298               "Cannot connect trace %s to %s: trace unknown",
 299               trace_connect->trace,
 300               trace_connect->element);
 301
 302   switch (trace_connect->kind) {
 303   case SURF_TRACE_CONNECT_KIND_HOST_AVAIL:
 304     xbt_dict_set(trace_connect_list_host_avail,
 305         trace_connect->trace,
 306         xbt_strdup(trace_connect->element), NULL);
 307     break;
 308   case SURF_TRACE_CONNECT_KIND_POWER:
 309     xbt_dict_set(trace_connect_list_power, trace_connect->trace,
 310         xbt_strdup(trace_connect->element), NULL);
 311     break;
 312   case SURF_TRACE_CONNECT_KIND_LINK_AVAIL:
 313     xbt_dict_set(trace_connect_list_link_avail,
 314         trace_connect->trace,
 315         xbt_strdup(trace_connect->element), NULL);
 316     break;
 317   case SURF_TRACE_CONNECT_KIND_BANDWIDTH:
 318     xbt_dict_set(trace_connect_list_bandwidth,
 319         trace_connect->trace,
 320         xbt_strdup(trace_connect->element), NULL);
 321     break;
 322   case SURF_TRACE_CONNECT_KIND_LATENCY:
 323     xbt_dict_set(trace_connect_list_latency, trace_connect->trace,
 324         xbt_strdup(trace_connect->element), NULL);
 325     break;
 326   default:
 327         surf_parse_error("Cannot connect trace %s to %s: kind of trace unknown",
 328         trace_connect->trace, trace_connect->element);
 329     break;
 330   }
 331 }
 332
 333 /**
 334  * \brief Make a new routing component to the platform
 335  *
 336  * Add a new autonomous system to the platform. Any elements (such as host,
 337  * router or sub-AS) added after this call and before the corresponding call
 338  * to sg_platf_new_AS_close() will be added to this AS.
 339  *
 340  * Once this function was called, the configuration concerning the used
 341  * models cannot be changed anymore.
 342  *
 343  * @param AS_id name of this autonomous system. Must be unique in the platform
 344  * @param wanted_routing_type one of Full, Floyd, Dijkstra or similar. Full list in the variable routing_models, in src/surf/surf_routing.c
 345  */
 346 void routing_AS_begin(sg_platf_AS_cbarg_t AS)
 347 {
 348   XBT_DEBUG("routing_AS_begin");
 349   routing_model_description_t model = NULL;
 350
 351   xbt_assert(!xbt_lib_get_or_null
 352              (as_router_lib, AS->id, ROUTING_ASR_LEVEL),
 353              "The AS \"%s\" already exists", AS->id);
 354
 355   _sg_cfg_init_status = 2; /* horrible hack: direct access to the global
 356                             * controlling the level of configuration to prevent
 357                             * any further config */
 358
 359   /* search the routing model */
 360   switch(AS->routing){
 361     case A_surfxml_AS_routing_Cluster:               model = &routing_models[SURF_MODEL_CLUSTER];break;
 362     case A_surfxml_AS_routing_Cluster___torus:       model = &routing_models[SURF_MODEL_TORUS_CLUSTER];break;
 363     case A_surfxml_AS_routing_Cluster___fat___tree:  model = &routing_models[SURF_MODEL_FAT_TREE_CLUSTER];break;
 364     case A_surfxml_AS_routing_Dijkstra:              model = &routing_models[SURF_MODEL_DIJKSTRA];break;
 365     case A_surfxml_AS_routing_DijkstraCache:         model = &routing_models[SURF_MODEL_DIJKSTRACACHE];break;
 366     case A_surfxml_AS_routing_Floyd:                 model = &routing_models[SURF_MODEL_FLOYD];break;
 367     case A_surfxml_AS_routing_Full:                  model = &routing_models[SURF_MODEL_FULL];break;
 368     case A_surfxml_AS_routing_None:                  model = &routing_models[SURF_MODEL_NONE];break;
 369     case A_surfxml_AS_routing_Vivaldi:               model = &routing_models[SURF_MODEL_VIVALDI];break;
 370     default: xbt_die("Not a valid model!!!");
 371     break;
 372   }
 373
 374   /* make a new routing component */
 375   AsPtr new_as = model->create();
 376
 377   new_as->p_modelDesc = model;
 378   new_as->p_hierarchy = SURF_ROUTING_NULL;
 379   new_as->p_name = xbt_strdup(AS->id);
 380
 381   RoutingEdgePtr info = new RoutingEdgeImpl(xbt_strdup(new_as->p_name),
 382                                             -1,
 383                                             SURF_NETWORK_ELEMENT_AS,
 384                                             current_routing);
 385   if (current_routing == NULL && routing_platf->p_root == NULL) {
 386
 387     /* it is the first one */
 388     new_as->p_routingFather = NULL;
 389     routing_platf->p_root = new_as;
 390     info->setId(-1);
 391   } else if (current_routing != NULL && routing_platf->p_root != NULL) {
 392
 393     xbt_assert(!xbt_dict_get_or_null
 394                (current_routing->p_routingSons, AS->id),
 395                "The AS \"%s\" already exists", AS->id);
 396     /* it is a part of the tree */
 397     new_as->p_routingFather = current_routing;
 398     /* set the father behavior */
 399     if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
 400       current_routing->p_hierarchy = SURF_ROUTING_RECURSIVE;
 401     /* add to the sons dictionary */
 402     xbt_dict_set(current_routing->p_routingSons, AS->id,
 403                  (void *) new_as, NULL);
 404     /* add to the father element list */
 405     info->setId(current_routing->parseAS(info));
 406   } else {
 407     THROWF(arg_error, 0, "All defined components must belong to a AS");
 408   }
 409
 410   xbt_lib_set(as_router_lib, info->getName(), ROUTING_ASR_LEVEL,
 411               (void *) info);
 412   XBT_DEBUG("Having set name '%s' id '%d'", new_as->p_name, info->getId());
 413
 414   /* set the new current component of the tree */
 415   current_routing = new_as;
 416   current_routing->p_netElem = info;
 417
 418 }
 419
 420 /**
 421  * \brief Specify that the current description of AS is finished
 422  *
 423  * Once you've declared all the content of your AS, you have to close
 424  * it with this call. Your AS is not usable until you call this function.
 425  *
 426  * @fixme: this call is not as robust as wanted: bad things WILL happen
 427  * if you call it twice for the same AS, or if you forget calling it, or
 428  * even if you add stuff to a closed AS
 429  *
 430  */
 431 void routing_AS_end(sg_platf_AS_cbarg_t /*AS*/)
 432 {
 433
 434   if (current_routing == NULL) {
 435     THROWF(arg_error, 0, "Close an AS, but none was under construction");
 436   } else {
 437     if (current_routing->p_modelDesc->end)
 438       current_routing->p_modelDesc->end(current_routing);
 439     current_routing = current_routing->p_routingFather;
 440   }
 441 }
 442
 443 /* Aux Business methods */
 444
 445 /**
 446  * \brief Get the AS father and the first elements of the chain
 447  *
 448  * \param src the source host name
 449  * \param dst the destination host name
 450  *
 451  * Get the common father of the to processing units, and the first different
 452  * father in the chain
 453  */
 454 static void elements_father(sg_routing_edge_t src, sg_routing_edge_t dst,
 455                             AS_t * res_father,
 456                             AS_t * res_src,
 457                             AS_t * res_dst)
 458 {
 459   xbt_assert(src && dst, "bad parameters for \"elements_father\" method");
 460 #define ELEMENTS_FATHER_MAXDEPTH 16     /* increase if it is not enough */
 461   AsPtr src_as, dst_as;
 462   AsPtr path_src[ELEMENTS_FATHER_MAXDEPTH];
 463   AsPtr path_dst[ELEMENTS_FATHER_MAXDEPTH];
 464   int index_src = 0;
 465   int index_dst = 0;
 466   AsPtr current;
 467   AsPtr current_src;
 468   AsPtr current_dst;
 469   AsPtr father;
 470
 471   /* (1) find the as where the src and dst are located */
 472   sg_routing_edge_t src_data = src;
 473   sg_routing_edge_t dst_data = dst;
 474   src_as = src_data->getRcComponent();
 475   dst_as = dst_data->getRcComponent();
 476 #ifndef NDEBUG
 477   char* src_name = src_data->getName();
 478   char* dst_name = dst_data->getName();
 479 #endif
 480
 481   xbt_assert(src_as && dst_as,
 482              "Ask for route \"from\"(%s) or \"to\"(%s) no found", src_name, dst_name);
 483
 484   /* (2) find the path to the root routing component */
 485   for (current = src_as; current != NULL; current = current->p_routingFather) {
 486     if (index_src >= ELEMENTS_FATHER_MAXDEPTH)
 487       xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_src");
 488     path_src[index_src++] = current;
 489   }
 490   for (current = dst_as; current != NULL; current = current->p_routingFather) {
 491     if (index_dst >= ELEMENTS_FATHER_MAXDEPTH)
 492       xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_dst");
 493     path_dst[index_dst++] = current;
 494   }
 495
 496   /* (3) find the common father */
 497   do {
 498     current_src = path_src[--index_src];
 499     current_dst = path_dst[--index_dst];
 500   } while (index_src > 0 && index_dst > 0 && current_src == current_dst);
 501
 502   /* (4) they are not in the same routing component, make the path */
 503   if (current_src == current_dst)
 504     father = current_src;
 505   else
 506     father = path_src[index_src + 1];
 507
 508   /* (5) result generation */
 509   *res_father = father;         /* first the common father of src and dst */
 510   *res_src = current_src;       /* second the first different father of src */
 511   *res_dst = current_dst;       /* three  the first different father of dst */
 512
 513 #undef ELEMENTS_FATHER_MAXDEPTH
 514 }
 515
 516 /* Global Business methods */
 517
 518 /**
 519  * \brief Recursive function for get_route_latency
 520  *
 521  * \param src the source host name
 522  * \param dst the destination host name
 523  * \param *route the route where the links are stored. It is either NULL or a ready to use dynar
 524  * \param *latency the latency, if needed
 525  *
 526  * This function is called by "get_route" and "get_latency". It allows to walk
 527  * recursively through the ASes tree.
 528  */
 529 static void _get_route_and_latency(RoutingEdgePtr src, RoutingEdgePtr dst,
 530                                    xbt_dynar_t * links, double *latency)
 531 {
 532   s_sg_platf_route_cbarg_t route;
 533   memset(&route,0,sizeof(route));
 534
 535   xbt_assert(src && dst, "bad parameters for \"_get_route_latency\" method");
 536   XBT_DEBUG("Solve route/latency  \"%s\" to \"%s\"", src->getName(), dst->getName());
 537
 538   /* Find how src and dst are interconnected */
 539   AsPtr common_father, src_father, dst_father;
 540   elements_father(src, dst, &common_father, &src_father, &dst_father);
 541   XBT_DEBUG("elements_father: common father '%s' src_father '%s' dst_father '%s'",
 542       common_father->p_name, src_father->p_name, dst_father->p_name);
 543
 544   /* Check whether a direct bypass is defined */
 545   sg_platf_route_cbarg_t e_route_bypass = NULL;
 546   //FIXME:REMOVE:if (common_father->get_bypass_route)
 547
 548   e_route_bypass = common_father->getBypassRoute(src, dst, latency);
 549
 550   /* Common ancestor is kind enough to declare a bypass route from src to dst -- use it and bail out */
 551   if (e_route_bypass) {
 552     xbt_dynar_merge(links, &e_route_bypass->link_list);
 553     generic_free_route(e_route_bypass);
 554     return;
 555   }
 556
 557   /* If src and dst are in the same AS, life is good */
 558   if (src_father == dst_father) {       /* SURF_ROUTING_BASE */
 559     route.link_list = *links;
 560     common_father->getRouteAndLatency(src, dst, &route, latency);
 561     // if vivaldi latency+=vivaldi(src,dst)
 562     return;
 563   }
 564
 565   /* Not in the same AS, no bypass. We'll have to find our path between the ASes recursively*/
 566
 567   route.link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
 568   // Find the net_card corresponding to father
 569   RoutingEdgePtr src_father_net_elm = src_father->p_netElem;
 570   RoutingEdgePtr dst_father_net_elm = dst_father->p_netElem;
 571
 572   common_father->getRouteAndLatency(src_father_net_elm, dst_father_net_elm,
 573                                     &route, latency);
 574
 575   xbt_assert((route.gw_src != NULL) && (route.gw_dst != NULL),
 576       "bad gateways for route from \"%s\" to \"%s\"", src->getName(), dst->getName());
 577
 578   sg_routing_edge_t src_gateway_net_elm = route.gw_src;
 579   sg_routing_edge_t dst_gateway_net_elm = route.gw_dst;
 580
 581   /* If source gateway is not our source, we have to recursively find our way up to this point */
 582   if (src != src_gateway_net_elm)
 583     _get_route_and_latency(src, src_gateway_net_elm, links, latency);
 584   xbt_dynar_merge(links, &route.link_list);
 585
 586   /* If dest gateway is not our destination, we have to recursively find our way from this point */
 587   if (dst_gateway_net_elm != dst)
 588     _get_route_and_latency(dst_gateway_net_elm, dst, links, latency);
 589
 590   // if vivaldi latency+=vivaldi(src_gateway,dst_gateway)
 591 }
 592
 593 AS_t surf_platf_get_root(routing_platf_t platf){
 594   return platf->p_root;
 595 }
 596
 597 e_surf_network_element_type_t surf_routing_edge_get_rc_type(sg_routing_edge_t edge){
 598   return edge->getRcType();
 599 }
 600
 601
 602 /**
 603  * \brief Find a route between hosts
 604  *
 605  * \param src the network_element_t for src host
 606  * \param dst the network_element_t for dst host
 607  * \param route where to store the list of links.
 608  *              If *route=NULL, create a short lived dynar. Else, fill the provided dynar
 609  * \param latency where to store the latency experienced on the path (or NULL if not interested)
 610  *                It is the caller responsability to initialize latency to 0 (we add to provided route)
 611  * \pre route!=NULL
 612  *
 613  * walk through the routing components tree and find a route between hosts
 614  * by calling the differents "get_route" functions in each routing component.
 615  */
 616 void RoutingPlatf::getRouteAndLatency(RoutingEdgePtr src, RoutingEdgePtr dst,
 617                                    xbt_dynar_t* route, double *latency)
 618 {
 619   XBT_DEBUG("routing_get_route_and_latency from %s to %s", src->getName(), dst->getName());
 620   if (!*route) {
 621     xbt_dynar_reset(routing_platf->p_lastRoute);
 622     *route = routing_platf->p_lastRoute;
 623   }
 624
 625   _get_route_and_latency(src, dst, route, latency);
 626
 627   xbt_assert(!latency || *latency >= 0.0,
 628              "negative latency on route between \"%s\" and \"%s\"", src->getName(), dst->getName());
 629 }
 630
 631 xbt_dynar_t RoutingPlatf::getOneLinkRoutes(){
 632   return recursiveGetOneLinkRoutes(p_root);
 633 }
 634
 635 xbt_dynar_t RoutingPlatf::recursiveGetOneLinkRoutes(AsPtr rc)
 636 {
 637   xbt_dynar_t ret = xbt_dynar_new(sizeof(OnelinkPtr), xbt_free);
 638
 639   //adding my one link routes
 640   xbt_dynar_t onelink_mine = rc->getOneLinkRoutes();
 641   if (onelink_mine)
 642     xbt_dynar_merge(&ret,&onelink_mine);
 643
 644   //recursing
 645   char *key;
 646   xbt_dict_cursor_t cursor = NULL;
 647   AS_t rc_child;
 648   xbt_dict_foreach(rc->p_routingSons, cursor, key, rc_child) {
 649     xbt_dynar_t onelink_child = recursiveGetOneLinkRoutes(rc_child);
 650     if (onelink_child)
 651       xbt_dynar_merge(&ret,&onelink_child);
 652   }
 653   return ret;
 654 }
 655
 656 e_surf_network_element_type_t routing_get_network_element_type(const char *name)
 657 {
 658   RoutingEdgePtr rc = sg_routing_edge_by_name_or_null(name);
 659   if (rc)
 660     return rc->getRcType();
 661
 662   return SURF_NETWORK_ELEMENT_NULL;
 663 }
 664
 665 /**
 666  * \brief Generic method: create the global routing schema
 667  *
 668  * Make a global routing structure and set all the parsing functions.
 669  */
 670 void routing_model_create( void *loopback)
 671 {
 672   /* config the uniq global routing */
 673   routing_platf = new RoutingPlatf();
 674   routing_platf->p_root = NULL;
 675   routing_platf->p_loopback = loopback;
 676   routing_platf->p_lastRoute = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
 677   /* no current routing at moment */
 678   current_routing = NULL;
 679 }
 680
 681
 682 /* ************************************************** */
 683 /* ********** PATERN FOR NEW ROUTING **************** */
 684
 685 /* The minimal configuration of a new routing model need the next functions,
 686  * also you need to set at the start of the file, the new model in the model
 687  * list. Remember keep the null ending of the list.
 688  */
 689 /*** Routing model structure ***/
 690 // typedef struct {
 691 //   s_routing_component_t generic_routing;
 692 //   /* things that your routing model need */
 693 // } s_routing_component_NEW_t,*routing_component_NEW_t;
 694
 695 /*** Parse routing model functions ***/
 696 // static void model_NEW_set_processing_unit(routing_component_t rc, const char* name) {}
 697 // static void model_NEW_set_autonomous_system(routing_component_t rc, const char* name) {}
 698 // static void model_NEW_set_route(routing_component_t rc, const char* src, const char* dst, route_t route) {}
 699 // static void model_NEW_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t route) {}
 700 // static void model_NEW_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {}
 701
 702 /*** Business methods ***/
 703 // static route_extended_t NEW_get_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
 704 // static route_extended_t NEW_get_bypass_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
 705 // static void NEW_finalize(routing_component_t rc) { xbt_free(rc);}
 706
 707 /*** Creation routing model functions ***/
 708 // static void* model_NEW_create(void) {
 709 //   routing_component_NEW_t new_component =  xbt_new0(s_routing_component_NEW_t,1);
 710 //   new_component->generic_routing.set_processing_unit = model_NEW_set_processing_unit;
 711 //   new_component->generic_routing.set_autonomous_system = model_NEW_set_autonomous_system;
 712 //   new_component->generic_routing.set_route = model_NEW_set_route;
 713 //   new_component->generic_routing.set_ASroute = model_NEW_set_ASroute;
 714 //   new_component->generic_routing.set_bypassroute = model_NEW_set_bypassroute;
 715 //   new_component->generic_routing.get_route = NEW_get_route;
 716 //   new_component->generic_routing.get_bypass_route = NEW_get_bypass_route;
 717 //   new_component->generic_routing.finalize = NEW_finalize;
 718 //   /* initialization of internal structures */
 719 //   return new_component;
 720 // } /* mandatory */
 721 // static void  model_NEW_load(void) {}   /* mandatory */
 722 // static void  model_NEW_unload(void) {} /* mandatory */
 723 // static void  model_NEW_end(void) {}    /* mandatory */
 724
 725 /* ************************************************************************** */
 726 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
 727
 728 void routing_cluster_add_backbone(void* bb) {
 729   xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER],
 730         "You have to be in model Cluster to use tag backbone!");
 731   xbt_assert(!surf_as_cluster_get_backbone(current_routing), "The backbone link is already defined!");
 732   surf_as_cluster_set_backbone(current_routing, bb);
 733   XBT_DEBUG("Add a backbone to AS '%s'", current_routing->p_name);
 734 }
 735
 736 static void routing_parse_cabinet(sg_platf_cabinet_cbarg_t cabinet)
 737 {
 738   int start, end, i;
 739   char *groups , *host_id , *link_id = NULL;
 740   unsigned int iter;
 741   xbt_dynar_t radical_elements;
 742   xbt_dynar_t radical_ends;
 743
 744   //Make all hosts
 745   radical_elements = xbt_str_split(cabinet->radical, ",");
 746   xbt_dynar_foreach(radical_elements, iter, groups) {
 747
 748     radical_ends = xbt_str_split(groups, "-");
 749     start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
 750
 751     switch (xbt_dynar_length(radical_ends)) {
 752     case 1:
 753       end = start;
 754       break;
 755     case 2:
 756       end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
 757       break;
 758     default:
 759       surf_parse_error("Malformed radical");
 760       break;
 761     }
 762     s_sg_platf_host_cbarg_t host;
 763     memset(&host, 0, sizeof(host));
 764     host.initial_state = SURF_RESOURCE_ON;
 765     host.pstate = 0;
 766     host.power_scale = 1.0;
 767     host.core_amount = 1;
 768
 769     s_sg_platf_link_cbarg_t link;
 770     memset(&link, 0, sizeof(link));
 771     link.state = SURF_RESOURCE_ON;
 772     link.policy = SURF_LINK_FULLDUPLEX;
 773     link.latency = cabinet->lat;
 774     link.bandwidth = cabinet->bw;
 775
 776     s_sg_platf_host_link_cbarg_t host_link;
 777     memset(&host_link, 0, sizeof(host_link));
 778
 779     for (i = start; i <= end; i++) {
 780       host_id = bprintf("%s%d%s",cabinet->prefix,i,cabinet->suffix);
 781       link_id = bprintf("link_%s%d%s",cabinet->prefix,i,cabinet->suffix);
 782       host.id = host_id;
 783       link.id = link_id;
 784       xbt_dynar_t power_state_list = xbt_dynar_new(sizeof(double), NULL);
 785       xbt_dynar_push(power_state_list,&cabinet->power);
 786       host.power_peak = power_state_list;
 787       sg_platf_new_host(&host);
 788       sg_platf_new_link(&link);
 789
 790       char* link_up = bprintf("%s_UP",link_id);
 791       char* link_down = bprintf("%s_DOWN",link_id);
 792       host_link.id = host_id;
 793       host_link.link_up = link_up;
 794       host_link.link_down= link_down;
 795       sg_platf_new_host_link(&host_link);
 796
 797       free(host_id);
 798       free(link_id);
 799       free(link_up);
 800       free(link_down);
 801     }
 802
 803     xbt_dynar_free(&radical_ends);
 804   }
 805   xbt_dynar_free(&radical_elements);
 806 }
 807
 808 static void routing_parse_cluster(sg_platf_cluster_cbarg_t cluster)
 809 {
 810   char *host_id, *groups, *link_id = NULL;
 811   xbt_dict_t patterns = NULL;
 812   int rankId=0;
 813
 814   s_sg_platf_host_cbarg_t host;
 815   s_sg_platf_link_cbarg_t link;
 816
 817   unsigned int iter;
 818   int start, end, i;
 819   xbt_dynar_t radical_elements;
 820   xbt_dynar_t radical_ends;
 821
 822   if ((cluster->availability_trace && strcmp(cluster->availability_trace, ""))
 823       || (cluster->state_trace && strcmp(cluster->state_trace, ""))) {
 824     patterns = xbt_dict_new_homogeneous(xbt_free_f);
 825     xbt_dict_set(patterns, "id", xbt_strdup(cluster->id), NULL);
 826     xbt_dict_set(patterns, "prefix", xbt_strdup(cluster->prefix), NULL);
 827     xbt_dict_set(patterns, "suffix", xbt_strdup(cluster->suffix), NULL);
 828   }
 829
 830   /* parse the topology attribute. If we are not in a flat cluster,
 831    * switch to the right mode and initialize the routing with
 832    * the parameters in topo_parameters attribute
 833    */
 834   s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
 835   AS.id = cluster->id;
 836
 837   if(cluster->topology == SURF_CLUSTER_TORUS){
 838     XBT_DEBUG("<AS id=\"%s\"\trouting=\"Torus_Cluster\">", cluster->id);
 839     AS.routing = A_surfxml_AS_routing_Cluster___torus;
 840     sg_platf_new_AS_begin(&AS);
 841     ((AsClusterTorusPtr)current_routing)->parse_specific_arguments(cluster);
 842   }
 843   else if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
 844     XBT_DEBUG("<AS id=\"%s\"\trouting=\"Fat_Tree_Cluster\">", cluster->id);
 845     AS.routing = A_surfxml_AS_routing_Cluster___fat___tree;
 846     sg_platf_new_AS_begin(&AS);
 847     ((AsClusterFatTree*)current_routing)->parse_specific_arguments(cluster);
 848   }
 849
 850   else{
 851     XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", cluster->id);
 852     AS.routing = A_surfxml_AS_routing_Cluster;
 853     sg_platf_new_AS_begin(&AS);
 854   }
 855
 856   if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
 857       ((AsClusterPtr)current_routing)->p_nb_links_per_node++;
 858       ((AsClusterPtr)current_routing)->p_has_loopback=1;
 859   }
 860
 861   if(cluster->limiter_link!=0){
 862       ((AsClusterPtr)current_routing)->p_nb_links_per_node++;
 863       ((AsClusterPtr)current_routing)->p_has_limiter=1;
 864   }
 865
 866
 867
 868   current_routing->p_linkUpDownList
 869             = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
 870
 871   //Make all hosts
 872   radical_elements = xbt_str_split(cluster->radical, ",");
 873   xbt_dynar_foreach(radical_elements, iter, groups) {
 874
 875     radical_ends = xbt_str_split(groups, "-");
 876     start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
 877
 878     switch (xbt_dynar_length(radical_ends)) {
 879     case 1:
 880       end = start;
 881       break;
 882     case 2:
 883       end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
 884       break;
 885     default:
 886       surf_parse_error("Malformed radical");
 887       break;
 888     }
 889     for (i = start; i <= end; i++) {
 890       host_id =
 891           bprintf("%s%d%s", cluster->prefix, i, cluster->suffix);
 892       link_id = bprintf("%s_link_%d", cluster->id, i);
 893
 894       XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\">", host_id, cluster->power);
 895
 896       memset(&host, 0, sizeof(host));
 897       host.id = host_id;
 898       if (cluster->availability_trace && strcmp(cluster->availability_trace, "")) {
 899         xbt_dict_set(patterns, "radical", bprintf("%d", i), NULL);
 900         char *avail_file = xbt_str_varsubst(cluster->availability_trace, patterns);
 901         XBT_DEBUG("\tavailability_file=\"%s\"", avail_file);
 902         host.power_trace = tmgr_trace_new_from_file(avail_file);
 903         xbt_free(avail_file);
 904       } else {
 905         XBT_DEBUG("\tavailability_file=\"\"");
 906       }
 907
 908       if (cluster->state_trace && strcmp(cluster->state_trace, "")) {
 909         char *avail_file = xbt_str_varsubst(cluster->state_trace, patterns);
 910         XBT_DEBUG("\tstate_file=\"%s\"", avail_file);
 911         host.state_trace = tmgr_trace_new_from_file(avail_file);
 912         xbt_free(avail_file);
 913       } else {
 914         XBT_DEBUG("\tstate_file=\"\"");
 915       }
 916
 917       xbt_dynar_t power_state_list = xbt_dynar_new(sizeof(double), NULL);
 918       xbt_dynar_push(power_state_list,&cluster->power);
 919       host.power_peak = power_state_list;
 920       host.pstate = 0;
 921
 922       //host.power_peak = cluster->power;
 923       host.power_scale = 1.0;
 924       host.core_amount = cluster->core_amount;
 925       host.initial_state = SURF_RESOURCE_ON;
 926       host.coord = "";
 927       sg_platf_new_host(&host);
 928       XBT_DEBUG("</host>");
 929
 930       XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_id,
 931                 cluster->bw, cluster->lat);
 932
 933
 934       s_surf_parsing_link_up_down_t info_lim, info_loop;
 935       // All links are saved in a matrix;
 936       // every row describes a single node; every node
 937       // may have multiple links.
 938       // the first column may store a link from x to x if p_has_loopback is set
 939       // the second column may store a limiter link if p_has_limiter is set
 940       // other columns are to store one or more link for the node
 941
 942       //add a loopback link
 943       if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
 944         char *tmp_link = bprintf("%s_loopback", link_id);
 945         XBT_DEBUG("<loopback\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
 946                 cluster->limiter_link);
 947
 948
 949         memset(&link, 0, sizeof(link));
 950         link.id = tmp_link;
 951         link.bandwidth = cluster->loopback_bw;
 952         link.latency = cluster->loopback_lat;
 953         link.state = SURF_RESOURCE_ON;
 954         link.policy = SURF_LINK_FATPIPE;
 955         sg_platf_new_link(&link);
 956         info_loop.link_up =
 957             xbt_lib_get_or_null(link_lib, tmp_link, SURF_LINK_LEVEL);
 958         info_loop.link_down = info_loop.link_up;
 959         free(tmp_link);
 960         xbt_dynar_set(current_routing->p_linkUpDownList, rankId*((AsClusterPtr)current_routing)->p_nb_links_per_node, &info_loop);
 961       }
 962
 963       //add a limiter link (shared link to account for maximal bandwidth of the node)
 964       if(cluster->limiter_link!=0){
 965         char *tmp_link = bprintf("%s_limiter", link_id);
 966         XBT_DEBUG("<limiter\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
 967                 cluster->limiter_link);
 968
 969
 970         memset(&link, 0, sizeof(link));
 971         link.id = tmp_link;
 972         link.bandwidth = cluster->limiter_link;
 973         link.latency = 0;
 974         link.state = SURF_RESOURCE_ON;
 975         link.policy = SURF_LINK_SHARED;
 976         sg_platf_new_link(&link);
 977         info_lim.link_up =
 978             xbt_lib_get_or_null(link_lib, tmp_link, SURF_LINK_LEVEL);
 979         info_lim.link_down = info_lim.link_up;
 980         free(tmp_link);
 981         xbt_dynar_set(current_routing->p_linkUpDownList,
 982             rankId*((AsClusterPtr)current_routing)->p_nb_links_per_node + ((AsClusterPtr)current_routing)->p_has_loopback ,
 983             &info_lim);
 984
 985       }
 986
 987
 988       //call the cluster function that adds the others links
 989       if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
 990         ((AsClusterFatTree*) current_routing)->addProcessingNode(i);
 991       }
 992       else {
 993       ((AsClusterPtr)current_routing)->create_links_for_node(cluster, i, rankId, rankId*
 994           ((AsClusterPtr)current_routing)->p_nb_links_per_node
 995           + ((AsClusterPtr)current_routing)->p_has_loopback
 996           + ((AsClusterPtr)current_routing)->p_has_limiter );
 997       }
 998       xbt_free(link_id);
 999       xbt_free(host_id);
1000       rankId++;
1001     }
1002
1003     xbt_dynar_free(&radical_ends);
1004   }
1005   xbt_dynar_free(&radical_elements);
1006
1007   // For fat trees, the links must be created once all nodes have been added
1008   if(cluster->topology == SURF_CLUSTER_FAT_TREE) {
1009     ((AsClusterFatTree*)current_routing)->create_links();
1010   }
1011   // Add a router. It is magically used thanks to the way in which surf_routing_cluster is written,
1012   // and it's very useful to connect clusters together
1013   XBT_DEBUG(" ");
1014   XBT_DEBUG("<router id=\"%s\"/>", cluster->router_id);
1015   char *newid = NULL;
1016   s_sg_platf_router_cbarg_t router;
1017   memset(&router, 0, sizeof(router));
1018   router.id = cluster->router_id;
1019   router.coord = "";
1020   if (!router.id || !strcmp(router.id, ""))
1021     router.id = newid =
1022         bprintf("%s%s_router%s", cluster->prefix, cluster->id,
1023                 cluster->suffix);
1024   sg_platf_new_router(&router);
1025   ((AsClusterPtr)current_routing)->p_router = (RoutingEdgePtr) xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL);
1026   free(newid);
1027
1028   //Make the backbone
1029   if ((cluster->bb_bw != 0) || (cluster->bb_lat != 0)) {
1030     char *link_backbone = bprintf("%s_backbone", cluster->id);
1031     XBT_DEBUG("<link\tid=\"%s\" bw=\"%f\" lat=\"%f\"/>", link_backbone,
1032               cluster->bb_bw, cluster->bb_lat);
1033
1034     memset(&link, 0, sizeof(link));
1035     link.id = link_backbone;
1036     link.bandwidth = cluster->bb_bw;
1037     link.latency = cluster->bb_lat;
1038     link.state = SURF_RESOURCE_ON;
1039     link.policy = cluster->bb_sharing_policy;
1040
1041     sg_platf_new_link(&link);
1042
1043     routing_cluster_add_backbone(xbt_lib_get_or_null(link_lib, link_backbone, SURF_LINK_LEVEL));
1044
1045     free(link_backbone);
1046   }
1047
1048   XBT_DEBUG("</AS>");
1049   sg_platf_new_AS_end();
1050   XBT_DEBUG(" ");
1051   xbt_dict_free(&patterns); // no op if it were never set
1052 }
1053
1054 static void routing_parse_postparse(void) {
1055   xbt_dict_free(&random_value);
1056 }
1057
1058 static void routing_parse_peer(sg_platf_peer_cbarg_t peer)
1059 {
1060   char *host_id = NULL;
1061   char *link_id = NULL;
1062   char *router_id = NULL;
1063
1064   XBT_DEBUG(" ");
1065   host_id = HOST_PEER(peer->id);
1066   link_id = LINK_PEER(peer->id);
1067   router_id = ROUTER_PEER(peer->id);
1068
1069   XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", peer->id);
1070   s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
1071   AS.id = peer->id;
1072   AS.routing = A_surfxml_AS_routing_Cluster;
1073   sg_platf_new_AS_begin(&AS);
1074
1075   current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
1076
1077   XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\"/>", host_id, peer->power);
1078   s_sg_platf_host_cbarg_t host;
1079   memset(&host, 0, sizeof(host));
1080   host.initial_state = SURF_RESOURCE_ON;
1081   host.id = host_id;
1082
1083   xbt_dynar_t power_state_list = xbt_dynar_new(sizeof(double), NULL);
1084   xbt_dynar_push(power_state_list,&peer->power);
1085   host.power_peak = power_state_list;
1086   host.pstate = 0;
1087   //host.power_peak = peer->power;
1088   host.power_scale = 1.0;
1089   host.power_trace = peer->availability_trace;
1090   host.state_trace = peer->state_trace;
1091   host.core_amount = 1;
1092   sg_platf_new_host(&host);
1093
1094   s_sg_platf_link_cbarg_t link;
1095   memset(&link, 0, sizeof(link));
1096   link.state = SURF_RESOURCE_ON;
1097   link.policy = SURF_LINK_SHARED;
1098   link.latency = peer->lat;
1099
1100   char* link_up = bprintf("%s_UP",link_id);
1101   XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_up,
1102             peer->bw_out, peer->lat);
1103   link.id = link_up;
1104   link.bandwidth = peer->bw_out;
1105   sg_platf_new_link(&link);
1106
1107   char* link_down = bprintf("%s_DOWN",link_id);
1108   XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_down,
1109             peer->bw_in, peer->lat);
1110   link.id = link_down;
1111   link.bandwidth = peer->bw_in;
1112   sg_platf_new_link(&link);
1113
1114   XBT_DEBUG("<host_link\tid=\"%s\"\tup=\"%s\"\tdown=\"%s\" />", host_id,link_up,link_down);
1115   s_sg_platf_host_link_cbarg_t host_link;
1116   memset(&host_link, 0, sizeof(host_link));
1117   host_link.id = host_id;
1118   host_link.link_up = link_up;
1119   host_link.link_down= link_down;
1120   sg_platf_new_host_link(&host_link);
1121
1122   XBT_DEBUG("<router id=\"%s\"/>", router_id);
1123   s_sg_platf_router_cbarg_t router;
1124   memset(&router, 0, sizeof(router));
1125   router.id = router_id;
1126   router.coord = peer->coord;
1127   sg_platf_new_router(&router);
1128   static_cast<AsClusterPtr>(current_routing)->p_router = static_cast<RoutingEdgePtr>(xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL));
1129
1130   XBT_DEBUG("</AS>");
1131   sg_platf_new_AS_end();
1132   XBT_DEBUG(" ");
1133
1134   //xbt_dynar_free(&tab_elements_num);
1135   free(router_id);
1136   free(host_id);
1137   free(link_id);
1138   free(link_up);
1139   free(link_down);
1140 }
1141
1142 // static void routing_parse_Srandom(void)
1143 // {
1144 //   double mean, std, min, max, seed;
1145 //   char *random_id = A_surfxml_random_id;
1146 //   char *random_radical = A_surfxml_random_radical;
1147 //   char *rd_name = NULL;
1148 //   char *rd_value;
1149 //   mean = surf_parse_get_double(A_surfxml_random_mean);
1150 //   std = surf_parse_get_double(A_surfxml_random_std___deviation);
1151 //   min = surf_parse_get_double(A_surfxml_random_min);
1152 //   max = surf_parse_get_double(A_surfxml_random_max);
1153 //   seed = surf_parse_get_double(A_surfxml_random_seed);
1154
1155 //   double res = 0;
1156 //   int i = 0;
1157 //   random_data_t random = xbt_new0(s_random_data_t, 1);
1158 //   char *tmpbuf;
1159
1160 //   xbt_dynar_t radical_elements;
1161 //   unsigned int iter;
1162 //   char *groups;
1163 //   int start, end;
1164 //   xbt_dynar_t radical_ends;
1165
1166 //   switch (A_surfxml_random_generator) {
1167 //   case AU_surfxml_random_generator:
1168 //   case A_surfxml_random_generator_NONE:
1169 //     random->generator = NONE;
1170 //     break;
1171 //   case A_surfxml_random_generator_DRAND48:
1172 //     random->generator = DRAND48;
1173 //     break;
1174 //   case A_surfxml_random_generator_RAND:
1175 //     random->generator = RAND;
1176 //     break;
1177 //   case A_surfxml_random_generator_RNGSTREAM:
1178 //     random->generator = RNGSTREAM;
1179 //     break;
1180 //   default:
1181 //     surf_parse_error("Invalid random generator");
1182 //     break;
1183 //   }
1184 //   random->seed = seed;
1185 //   random->min = min;
1186 //   random->max = max;
1187
1188 //   /* Check user stupidities */
1189 //   if (max < min)
1190 //     THROWF(arg_error, 0, "random->max < random->min (%f < %f)", max, min);
1191 //   if (mean < min)
1192 //     THROWF(arg_error, 0, "random->mean < random->min (%f < %f)", mean, min);
1193 //   if (mean > max)
1194 //     THROWF(arg_error, 0, "random->mean > random->max (%f > %f)", mean, max);
1195
1196 //   /* normalize the mean and standard deviation before storing */
1197 //   random->mean = (mean - min) / (max - min);
1198 //   random->std = std / (max - min);
1199
1200 //   if (random->mean * (1 - random->mean) < random->std * random->std)
1201 //     THROWF(arg_error, 0, "Invalid mean and standard deviation (%f and %f)",
1202 //            random->mean, random->std);
1203
1204 //   XBT_DEBUG
1205 //       ("id = '%s' min = '%f' max = '%f' mean = '%f' std_deviatinon = '%f' generator = '%d' seed = '%ld' radical = '%s'",
1206 //        random_id, random->min, random->max, random->mean, random->std,
1207 //        (int)random->generator, random->seed, random_radical);
1208
1209 //   if (!random_value)
1210 //     random_value = xbt_dict_new_homogeneous(free);
1211
1212 //   if (!strcmp(random_radical, "")) {
1213 //     res = random_generate(random);
1214 //     rd_value = bprintf("%f", res);
1215 //     xbt_dict_set(random_value, random_id, rd_value, NULL);
1216 //   } else {
1217 //     radical_elements = xbt_str_split(random_radical, ",");
1218 //     xbt_dynar_foreach(radical_elements, iter, groups) {
1219 //       radical_ends = xbt_str_split(groups, "-");
1220 //       switch (xbt_dynar_length(radical_ends)) {
1221 //       case 1:
1222 //         xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1223 //                    "Custom Random '%s' already exists !", random_id);
1224 //         res = random_generate(random);
1225 //         tmpbuf =
1226 //             bprintf("%s%d", random_id,
1227 //                     atoi(xbt_dynar_getfirst_as(radical_ends, char *)));
1228 //         xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1229 //         xbt_free(tmpbuf);
1230 //         break;
1231
1232 //       case 2:
1233 //         start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
1234 //         end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
1235 //         for (i = start; i <= end; i++) {
1236 //           xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1237 //                      "Custom Random '%s' already exists !", bprintf("%s%d",
1238 //                                                                     random_id,
1239 //                                                                     i));
1240 //           res = random_generate(random);
1241 //           tmpbuf = bprintf("%s%d", random_id, i);
1242 //           xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1243 //           xbt_free(tmpbuf);
1244 //         }
1245 //         break;
1246 //       default:
1247 //         XBT_CRITICAL("Malformed radical");
1248 //         break;
1249 //       }
1250 //       res = random_generate(random);
1251 //       rd_name = bprintf("%s_router", random_id);
1252 //       rd_value = bprintf("%f", res);
1253 //       xbt_dict_set(random_value, rd_name, rd_value, NULL);
1254
1255 //       xbt_dynar_free(&radical_ends);
1256 //     }
1257 //     free(rd_name);
1258 //     xbt_dynar_free(&radical_elements);
1259 //   }
1260 // }
1261
1262 static void check_disk_attachment()
1263 {
1264   xbt_lib_cursor_t cursor;
1265   char *key;
1266   void **data;
1267   RoutingEdgePtr host_elm;
1268   xbt_lib_foreach(storage_lib, cursor, key, data) {
1269     if(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL) != NULL) {
1270           StoragePtr storage = static_cast<StoragePtr>(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL));
1271           host_elm = sg_routing_edge_by_name_or_null(storage->p_attach);
1272           if(!host_elm)
1273                   surf_parse_error("Unable to attach storage %s: host %s doesn't exist.", storage->getName(), storage->p_attach);
1274     }
1275   }
1276 }
1277
1278 void routing_register_callbacks()
1279 {
1280   sg_platf_host_add_cb(parse_S_host);
1281   sg_platf_router_add_cb(parse_S_router);
1282   sg_platf_host_link_add_cb(parse_S_host_link);
1283   sg_platf_route_add_cb(parse_E_route);
1284   sg_platf_ASroute_add_cb(parse_E_ASroute);
1285   sg_platf_bypassRoute_add_cb(parse_E_bypassRoute);
1286   sg_platf_bypassASroute_add_cb(parse_E_bypassASroute);
1287
1288   sg_platf_cluster_add_cb(routing_parse_cluster);
1289   sg_platf_cabinet_add_cb(routing_parse_cabinet);
1290
1291   sg_platf_peer_add_cb(routing_parse_peer);
1292   sg_platf_postparse_add_cb(routing_parse_postparse);
1293   sg_platf_postparse_add_cb(check_disk_attachment);
1294
1295   /* we care about the ASes while parsing the platf. Incredible, isnt it? */
1296   sg_platf_AS_end_add_cb(routing_AS_end);
1297   sg_platf_AS_begin_add_cb(routing_AS_begin);
1298
1299   sg_platf_trace_add_cb(routing_parse_trace);
1300   sg_platf_trace_connect_add_cb(routing_parse_trace_connect);
1301
1302 #ifdef HAVE_TRACING
1303   instr_routing_define_callbacks();
1304 #endif
1305 }
1306
1307 /**
1308  * \brief Recursive function for finalize
1309  *
1310  * \param rc the source host name
1311  *
1312  * This fuction is call by "finalize". It allow to finalize the
1313  * AS or routing components. It delete all the structures.
1314  */
1315 static void finalize_rec(AsPtr as) {
1316   xbt_dict_cursor_t cursor = NULL;
1317   char *key;
1318   AS_t elem;
1319
1320   xbt_dict_foreach(as->p_routingSons, cursor, key, elem) {
1321     finalize_rec(elem);
1322   }
1323
1324   delete as;;
1325 }
1326
1327 /** \brief Frees all memory allocated by the routing module */
1328 void routing_exit(void) {
1329   delete routing_platf;
1330 }
1331
1332 RoutingPlatf::~RoutingPlatf()
1333 {
1334         xbt_dynar_free(&p_lastRoute);
1335         finalize_rec(p_root);
1336 }
1337
1338 AS_t surf_AS_get_routing_root() {
1339   return routing_platf->p_root;
1340 }
1341
1342 const char *surf_AS_get_name(AsPtr as) {
1343   return as->p_name;
1344 }
1345
1346 static AsPtr surf_AS_recursive_get_by_name(AsPtr current, const char * name) {
1347   xbt_dict_cursor_t cursor = NULL;
1348   char *key;
1349   AS_t elem;
1350   AsPtr tmp = NULL;
1351
1352   if(!strcmp(current->p_name, name))
1353     return current;
1354
1355   xbt_dict_foreach(current->p_routingSons, cursor, key, elem) {
1356     tmp = surf_AS_recursive_get_by_name(elem, name);
1357     if(tmp != NULL ) {
1358         break;
1359     }
1360   }
1361   return tmp;
1362 }
1363
1364
1365 AsPtr surf_AS_get_by_name(const char * name) {
1366   AsPtr as = surf_AS_recursive_get_by_name(routing_platf->p_root, name);
1367   if(as == NULL)
1368     XBT_WARN("Impossible to find an AS with name %s, please check your input", name);
1369   return as;
1370 }
1371
1372 xbt_dict_t surf_AS_get_routing_sons(AsPtr as) {
1373   return as->p_routingSons;
1374 }
1375
1376 const char *surf_AS_get_model(AsPtr as) {
1377   return as->p_modelDesc->name;
1378 }
1379
1380 xbt_dynar_t surf_AS_get_hosts(AsPtr as) {
1381   xbt_dynar_t elms = as->p_indexNetworkElm;
1382   sg_routing_edge_t relm;
1383   xbt_dictelm_t delm;
1384   int index;
1385   int count = xbt_dynar_length(elms);
1386   xbt_dynar_t res =  xbt_dynar_new(sizeof(xbt_dictelm_t), NULL);
1387   for (index = 0; index < count; index++) {
1388      relm = xbt_dynar_get_as(elms, index, RoutingEdgePtr);
1389      delm = xbt_lib_get_elm_or_null(host_lib, relm->getName());
1390      if (delm!=NULL) {
1391        xbt_dynar_push(res, &delm);
1392      }
1393   }
1394   return res;
1395 }
1396
1397 void surf_AS_get_graph(AS_t as, xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges) {
1398   as->getGraph(graph, nodes, edges);
1399 }
1400