src/surf/surf_routing.cpp

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