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